1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007
4 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 #ifndef ADA_RETAIN_DOTS
61 #define ADA_RETAIN_DOTS 0
64 /* Define whether or not the C operator '/' truncates towards zero for
65 differently signed operands (truncation direction is undefined in C).
66 Copied from valarith.c. */
68 #ifndef TRUNCATION_TOWARDS_ZERO
69 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
72 static void extract_string (CORE_ADDR addr
, char *buf
);
74 static void modify_general_field (char *, LONGEST
, int, int);
76 static struct type
*desc_base_type (struct type
*);
78 static struct type
*desc_bounds_type (struct type
*);
80 static struct value
*desc_bounds (struct value
*);
82 static int fat_pntr_bounds_bitpos (struct type
*);
84 static int fat_pntr_bounds_bitsize (struct type
*);
86 static struct type
*desc_data_type (struct type
*);
88 static struct value
*desc_data (struct value
*);
90 static int fat_pntr_data_bitpos (struct type
*);
92 static int fat_pntr_data_bitsize (struct type
*);
94 static struct value
*desc_one_bound (struct value
*, int, int);
96 static int desc_bound_bitpos (struct type
*, int, int);
98 static int desc_bound_bitsize (struct type
*, int, int);
100 static struct type
*desc_index_type (struct type
*, int);
102 static int desc_arity (struct type
*);
104 static int ada_type_match (struct type
*, struct type
*, int);
106 static int ada_args_match (struct symbol
*, struct value
**, int);
108 static struct value
*ensure_lval (struct value
*, CORE_ADDR
*);
110 static struct value
*convert_actual (struct value
*, struct type
*,
113 static struct value
*make_array_descriptor (struct type
*, struct value
*,
116 static void ada_add_block_symbols (struct obstack
*,
117 struct block
*, const char *,
118 domain_enum
, struct objfile
*,
119 struct symtab
*, int);
121 static int is_nonfunction (struct ada_symbol_info
*, int);
123 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
124 struct block
*, struct symtab
*);
126 static int num_defns_collected (struct obstack
*);
128 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
130 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
131 *, const char *, int,
134 static struct symtab
*symtab_for_sym (struct symbol
*);
136 static struct value
*resolve_subexp (struct expression
**, int *, int,
139 static void replace_operator_with_call (struct expression
**, int, int, int,
140 struct symbol
*, struct block
*);
142 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
144 static char *ada_op_name (enum exp_opcode
);
146 static const char *ada_decoded_op_name (enum exp_opcode
);
148 static int numeric_type_p (struct type
*);
150 static int integer_type_p (struct type
*);
152 static int scalar_type_p (struct type
*);
154 static int discrete_type_p (struct type
*);
156 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
161 static struct symbol
*find_old_style_renaming_symbol (const char *,
164 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
167 static struct value
*evaluate_subexp (struct type
*, struct expression
*,
170 static struct value
*evaluate_subexp_type (struct expression
*, int *);
172 static int is_dynamic_field (struct type
*, int);
174 static struct type
*to_fixed_variant_branch_type (struct type
*,
176 CORE_ADDR
, struct value
*);
178 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
180 static struct type
*to_fixed_range_type (char *, struct value
*,
183 static struct type
*to_static_fixed_type (struct type
*);
184 static struct type
*static_unwrap_type (struct type
*type
);
186 static struct value
*unwrap_value (struct value
*);
188 static struct type
*packed_array_type (struct type
*, long *);
190 static struct type
*decode_packed_array_type (struct type
*);
192 static struct value
*decode_packed_array (struct value
*);
194 static struct value
*value_subscript_packed (struct value
*, int,
197 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int);
199 static struct value
*coerce_unspec_val_to_type (struct value
*,
202 static struct value
*get_var_value (char *, char *);
204 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
206 static int equiv_types (struct type
*, struct type
*);
208 static int is_name_suffix (const char *);
210 static int wild_match (const char *, int, const char *);
212 static struct value
*ada_coerce_ref (struct value
*);
214 static LONGEST
pos_atr (struct value
*);
216 static struct value
*value_pos_atr (struct value
*);
218 static struct value
*value_val_atr (struct type
*, struct value
*);
220 static struct symbol
*standard_lookup (const char *, const struct block
*,
223 static struct value
*ada_search_struct_field (char *, struct value
*, int,
226 static struct value
*ada_value_primitive_field (struct value
*, int, int,
229 static int find_struct_field (char *, struct type
*, int,
230 struct type
**, int *, int *, int *, int *);
232 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
235 static struct value
*ada_to_fixed_value (struct value
*);
237 static int ada_resolve_function (struct ada_symbol_info
*, int,
238 struct value
**, int, const char *,
241 static struct value
*ada_coerce_to_simple_array (struct value
*);
243 static int ada_is_direct_array_type (struct type
*);
245 static void ada_language_arch_info (struct gdbarch
*,
246 struct language_arch_info
*);
248 static void check_size (const struct type
*);
250 static struct value
*ada_index_struct_field (int, struct value
*, int,
253 static struct value
*assign_aggregate (struct value
*, struct value
*,
254 struct expression
*, int *, enum noside
);
256 static void aggregate_assign_from_choices (struct value
*, struct value
*,
258 int *, LONGEST
*, int *,
259 int, LONGEST
, LONGEST
);
261 static void aggregate_assign_positional (struct value
*, struct value
*,
263 int *, LONGEST
*, int *, int,
267 static void aggregate_assign_others (struct value
*, struct value
*,
269 int *, LONGEST
*, int, LONGEST
, LONGEST
);
272 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
275 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
278 static void ada_forward_operator_length (struct expression
*, int, int *,
283 /* Maximum-sized dynamic type. */
284 static unsigned int varsize_limit
;
286 /* FIXME: brobecker/2003-09-17: No longer a const because it is
287 returned by a function that does not return a const char *. */
288 static char *ada_completer_word_break_characters
=
290 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
292 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
295 /* The name of the symbol to use to get the name of the main subprogram. */
296 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
297 = "__gnat_ada_main_program_name";
299 /* Limit on the number of warnings to raise per expression evaluation. */
300 static int warning_limit
= 2;
302 /* Number of warning messages issued; reset to 0 by cleanups after
303 expression evaluation. */
304 static int warnings_issued
= 0;
306 static const char *known_runtime_file_name_patterns
[] = {
307 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
310 static const char *known_auxiliary_function_name_patterns
[] = {
311 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
314 /* Space for allocating results of ada_lookup_symbol_list. */
315 static struct obstack symbol_list_obstack
;
319 /* Given DECODED_NAME a string holding a symbol name in its
320 decoded form (ie using the Ada dotted notation), returns
321 its unqualified name. */
324 ada_unqualified_name (const char *decoded_name
)
326 const char *result
= strrchr (decoded_name
, '.');
329 result
++; /* Skip the dot... */
331 result
= decoded_name
;
336 /* Return a string starting with '<', followed by STR, and '>'.
337 The result is good until the next call. */
340 add_angle_brackets (const char *str
)
342 static char *result
= NULL
;
345 result
= (char *) xmalloc ((strlen (str
) + 3) * sizeof (char));
347 sprintf (result
, "<%s>", str
);
352 ada_get_gdb_completer_word_break_characters (void)
354 return ada_completer_word_break_characters
;
357 /* Print an array element index using the Ada syntax. */
360 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
361 int format
, enum val_prettyprint pretty
)
363 LA_VALUE_PRINT (index_value
, stream
, format
, pretty
);
364 fprintf_filtered (stream
, " => ");
367 /* Read the string located at ADDR from the inferior and store the
371 extract_string (CORE_ADDR addr
, char *buf
)
375 /* Loop, reading one byte at a time, until we reach the '\000'
376 end-of-string marker. */
379 target_read_memory (addr
+ char_index
* sizeof (char),
380 buf
+ char_index
* sizeof (char), sizeof (char));
383 while (buf
[char_index
- 1] != '\000');
386 /* Assuming VECT points to an array of *SIZE objects of size
387 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
388 updating *SIZE as necessary and returning the (new) array. */
391 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
393 if (*size
< min_size
)
396 if (*size
< min_size
)
398 vect
= xrealloc (vect
, *size
* element_size
);
403 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
404 suffix of FIELD_NAME beginning "___". */
407 field_name_match (const char *field_name
, const char *target
)
409 int len
= strlen (target
);
411 (strncmp (field_name
, target
, len
) == 0
412 && (field_name
[len
] == '\0'
413 || (strncmp (field_name
+ len
, "___", 3) == 0
414 && strcmp (field_name
+ strlen (field_name
) - 6,
419 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
420 FIELD_NAME, and return its index. This function also handles fields
421 whose name have ___ suffixes because the compiler sometimes alters
422 their name by adding such a suffix to represent fields with certain
423 constraints. If the field could not be found, return a negative
424 number if MAYBE_MISSING is set. Otherwise raise an error. */
427 ada_get_field_index (const struct type
*type
, const char *field_name
,
431 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (type
); fieldno
++)
432 if (field_name_match (TYPE_FIELD_NAME (type
, fieldno
), field_name
))
436 error (_("Unable to find field %s in struct %s. Aborting"),
437 field_name
, TYPE_NAME (type
));
442 /* The length of the prefix of NAME prior to any "___" suffix. */
445 ada_name_prefix_len (const char *name
)
451 const char *p
= strstr (name
, "___");
453 return strlen (name
);
459 /* Return non-zero if SUFFIX is a suffix of STR.
460 Return zero if STR is null. */
463 is_suffix (const char *str
, const char *suffix
)
469 len2
= strlen (suffix
);
470 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
473 /* Create a value of type TYPE whose contents come from VALADDR, if it
474 is non-null, and whose memory address (in the inferior) is
478 value_from_contents_and_address (struct type
*type
,
479 const gdb_byte
*valaddr
,
482 struct value
*v
= allocate_value (type
);
484 set_value_lazy (v
, 1);
486 memcpy (value_contents_raw (v
), valaddr
, TYPE_LENGTH (type
));
487 VALUE_ADDRESS (v
) = address
;
489 VALUE_LVAL (v
) = lval_memory
;
493 /* The contents of value VAL, treated as a value of type TYPE. The
494 result is an lval in memory if VAL is. */
496 static struct value
*
497 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
499 type
= ada_check_typedef (type
);
500 if (value_type (val
) == type
)
504 struct value
*result
;
506 /* Make sure that the object size is not unreasonable before
507 trying to allocate some memory for it. */
510 result
= allocate_value (type
);
511 VALUE_LVAL (result
) = VALUE_LVAL (val
);
512 set_value_bitsize (result
, value_bitsize (val
));
513 set_value_bitpos (result
, value_bitpos (val
));
514 VALUE_ADDRESS (result
) = VALUE_ADDRESS (val
) + value_offset (val
);
516 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
517 set_value_lazy (result
, 1);
519 memcpy (value_contents_raw (result
), value_contents (val
),
525 static const gdb_byte
*
526 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
531 return valaddr
+ offset
;
535 cond_offset_target (CORE_ADDR address
, long offset
)
540 return address
+ offset
;
543 /* Issue a warning (as for the definition of warning in utils.c, but
544 with exactly one argument rather than ...), unless the limit on the
545 number of warnings has passed during the evaluation of the current
548 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
549 provided by "complaint". */
550 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
553 lim_warning (const char *format
, ...)
556 va_start (args
, format
);
558 warnings_issued
+= 1;
559 if (warnings_issued
<= warning_limit
)
560 vwarning (format
, args
);
565 /* Issue an error if the size of an object of type T is unreasonable,
566 i.e. if it would be a bad idea to allocate a value of this type in
570 check_size (const struct type
*type
)
572 if (TYPE_LENGTH (type
) > varsize_limit
)
573 error (_("object size is larger than varsize-limit"));
577 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
578 gdbtypes.h, but some of the necessary definitions in that file
579 seem to have gone missing. */
581 /* Maximum value of a SIZE-byte signed integer type. */
583 max_of_size (int size
)
585 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
586 return top_bit
| (top_bit
- 1);
589 /* Minimum value of a SIZE-byte signed integer type. */
591 min_of_size (int size
)
593 return -max_of_size (size
) - 1;
596 /* Maximum value of a SIZE-byte unsigned integer type. */
598 umax_of_size (int size
)
600 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
601 return top_bit
| (top_bit
- 1);
604 /* Maximum value of integral type T, as a signed quantity. */
606 max_of_type (struct type
*t
)
608 if (TYPE_UNSIGNED (t
))
609 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
611 return max_of_size (TYPE_LENGTH (t
));
614 /* Minimum value of integral type T, as a signed quantity. */
616 min_of_type (struct type
*t
)
618 if (TYPE_UNSIGNED (t
))
621 return min_of_size (TYPE_LENGTH (t
));
624 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
625 static struct value
*
626 discrete_type_high_bound (struct type
*type
)
628 switch (TYPE_CODE (type
))
630 case TYPE_CODE_RANGE
:
631 return value_from_longest (TYPE_TARGET_TYPE (type
),
632 TYPE_HIGH_BOUND (type
));
635 value_from_longest (type
,
636 TYPE_FIELD_BITPOS (type
,
637 TYPE_NFIELDS (type
) - 1));
639 return value_from_longest (type
, max_of_type (type
));
641 error (_("Unexpected type in discrete_type_high_bound."));
645 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
646 static struct value
*
647 discrete_type_low_bound (struct type
*type
)
649 switch (TYPE_CODE (type
))
651 case TYPE_CODE_RANGE
:
652 return value_from_longest (TYPE_TARGET_TYPE (type
),
653 TYPE_LOW_BOUND (type
));
655 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, 0));
657 return value_from_longest (type
, min_of_type (type
));
659 error (_("Unexpected type in discrete_type_low_bound."));
663 /* The identity on non-range types. For range types, the underlying
664 non-range scalar type. */
667 base_type (struct type
*type
)
669 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
671 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
673 type
= TYPE_TARGET_TYPE (type
);
679 /* Language Selection */
681 /* If the main program is in Ada, return language_ada, otherwise return LANG
682 (the main program is in Ada iif the adainit symbol is found).
684 MAIN_PST is not used. */
687 ada_update_initial_language (enum language lang
,
688 struct partial_symtab
*main_pst
)
690 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
691 (struct objfile
*) NULL
) != NULL
)
697 /* If the main procedure is written in Ada, then return its name.
698 The result is good until the next call. Return NULL if the main
699 procedure doesn't appear to be in Ada. */
704 struct minimal_symbol
*msym
;
705 CORE_ADDR main_program_name_addr
;
706 static char main_program_name
[1024];
708 /* For Ada, the name of the main procedure is stored in a specific
709 string constant, generated by the binder. Look for that symbol,
710 extract its address, and then read that string. If we didn't find
711 that string, then most probably the main procedure is not written
713 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
717 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
718 if (main_program_name_addr
== 0)
719 error (_("Invalid address for Ada main program name."));
721 extract_string (main_program_name_addr
, main_program_name
);
722 return main_program_name
;
725 /* The main procedure doesn't seem to be in Ada. */
731 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
734 const struct ada_opname_map ada_opname_table
[] = {
735 {"Oadd", "\"+\"", BINOP_ADD
},
736 {"Osubtract", "\"-\"", BINOP_SUB
},
737 {"Omultiply", "\"*\"", BINOP_MUL
},
738 {"Odivide", "\"/\"", BINOP_DIV
},
739 {"Omod", "\"mod\"", BINOP_MOD
},
740 {"Orem", "\"rem\"", BINOP_REM
},
741 {"Oexpon", "\"**\"", BINOP_EXP
},
742 {"Olt", "\"<\"", BINOP_LESS
},
743 {"Ole", "\"<=\"", BINOP_LEQ
},
744 {"Ogt", "\">\"", BINOP_GTR
},
745 {"Oge", "\">=\"", BINOP_GEQ
},
746 {"Oeq", "\"=\"", BINOP_EQUAL
},
747 {"One", "\"/=\"", BINOP_NOTEQUAL
},
748 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
749 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
750 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
751 {"Oconcat", "\"&\"", BINOP_CONCAT
},
752 {"Oabs", "\"abs\"", UNOP_ABS
},
753 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
754 {"Oadd", "\"+\"", UNOP_PLUS
},
755 {"Osubtract", "\"-\"", UNOP_NEG
},
759 /* Return non-zero if STR should be suppressed in info listings. */
762 is_suppressed_name (const char *str
)
764 if (strncmp (str
, "_ada_", 5) == 0)
766 if (str
[0] == '_' || str
[0] == '\000')
771 const char *suffix
= strstr (str
, "___");
772 if (suffix
!= NULL
&& suffix
[3] != 'X')
775 suffix
= str
+ strlen (str
);
776 for (p
= suffix
- 1; p
!= str
; p
-= 1)
780 if (p
[0] == 'X' && p
[-1] != '_')
784 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
785 if (strncmp (ada_opname_table
[i
].encoded
, p
,
786 strlen (ada_opname_table
[i
].encoded
)) == 0)
795 /* The "encoded" form of DECODED, according to GNAT conventions.
796 The result is valid until the next call to ada_encode. */
799 ada_encode (const char *decoded
)
801 static char *encoding_buffer
= NULL
;
802 static size_t encoding_buffer_size
= 0;
809 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
810 2 * strlen (decoded
) + 10);
813 for (p
= decoded
; *p
!= '\0'; p
+= 1)
815 if (!ADA_RETAIN_DOTS
&& *p
== '.')
817 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
822 const struct ada_opname_map
*mapping
;
824 for (mapping
= ada_opname_table
;
825 mapping
->encoded
!= NULL
826 && strncmp (mapping
->decoded
, p
,
827 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
829 if (mapping
->encoded
== NULL
)
830 error (_("invalid Ada operator name: %s"), p
);
831 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
832 k
+= strlen (mapping
->encoded
);
837 encoding_buffer
[k
] = *p
;
842 encoding_buffer
[k
] = '\0';
843 return encoding_buffer
;
846 /* Return NAME folded to lower case, or, if surrounded by single
847 quotes, unfolded, but with the quotes stripped away. Result good
851 ada_fold_name (const char *name
)
853 static char *fold_buffer
= NULL
;
854 static size_t fold_buffer_size
= 0;
856 int len
= strlen (name
);
857 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
861 strncpy (fold_buffer
, name
+ 1, len
- 2);
862 fold_buffer
[len
- 2] = '\000';
867 for (i
= 0; i
<= len
; i
+= 1)
868 fold_buffer
[i
] = tolower (name
[i
]);
874 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
877 is_lower_alphanum (const char c
)
879 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
882 /* Remove either of these suffixes:
887 These are suffixes introduced by the compiler for entities such as
888 nested subprogram for instance, in order to avoid name clashes.
889 They do not serve any purpose for the debugger. */
892 ada_remove_trailing_digits (const char *encoded
, int *len
)
894 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
897 while (i
> 0 && isdigit (encoded
[i
]))
899 if (i
>= 0 && encoded
[i
] == '.')
901 else if (i
>= 0 && encoded
[i
] == '$')
903 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
905 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
910 /* Remove the suffix introduced by the compiler for protected object
914 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
916 /* Remove trailing N. */
918 /* Protected entry subprograms are broken into two
919 separate subprograms: The first one is unprotected, and has
920 a 'N' suffix; the second is the protected version, and has
921 the 'P' suffix. The second calls the first one after handling
922 the protection. Since the P subprograms are internally generated,
923 we leave these names undecoded, giving the user a clue that this
924 entity is internal. */
927 && encoded
[*len
- 1] == 'N'
928 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
932 /* If ENCODED follows the GNAT entity encoding conventions, then return
933 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
936 The resulting string is valid until the next call of ada_decode.
937 If the string is unchanged by decoding, the original string pointer
941 ada_decode (const char *encoded
)
948 static char *decoding_buffer
= NULL
;
949 static size_t decoding_buffer_size
= 0;
951 /* The name of the Ada main procedure starts with "_ada_".
952 This prefix is not part of the decoded name, so skip this part
953 if we see this prefix. */
954 if (strncmp (encoded
, "_ada_", 5) == 0)
957 /* If the name starts with '_', then it is not a properly encoded
958 name, so do not attempt to decode it. Similarly, if the name
959 starts with '<', the name should not be decoded. */
960 if (encoded
[0] == '_' || encoded
[0] == '<')
963 len0
= strlen (encoded
);
965 ada_remove_trailing_digits (encoded
, &len0
);
966 ada_remove_po_subprogram_suffix (encoded
, &len0
);
968 /* Remove the ___X.* suffix if present. Do not forget to verify that
969 the suffix is located before the current "end" of ENCODED. We want
970 to avoid re-matching parts of ENCODED that have previously been
971 marked as discarded (by decrementing LEN0). */
972 p
= strstr (encoded
, "___");
973 if (p
!= NULL
&& p
- encoded
< len0
- 3)
981 /* Remove any trailing TKB suffix. It tells us that this symbol
982 is for the body of a task, but that information does not actually
983 appear in the decoded name. */
985 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
988 /* Remove trailing "B" suffixes. */
989 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
991 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
994 /* Make decoded big enough for possible expansion by operator name. */
996 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
997 decoded
= decoding_buffer
;
999 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1001 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1004 while ((i
>= 0 && isdigit (encoded
[i
]))
1005 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1007 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1009 else if (encoded
[i
] == '$')
1013 /* The first few characters that are not alphabetic are not part
1014 of any encoding we use, so we can copy them over verbatim. */
1016 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1017 decoded
[j
] = encoded
[i
];
1022 /* Is this a symbol function? */
1023 if (at_start_name
&& encoded
[i
] == 'O')
1026 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1028 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1029 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1031 && !isalnum (encoded
[i
+ op_len
]))
1033 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1036 j
+= strlen (ada_opname_table
[k
].decoded
);
1040 if (ada_opname_table
[k
].encoded
!= NULL
)
1045 /* Replace "TK__" with "__", which will eventually be translated
1046 into "." (just below). */
1048 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1051 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1052 be translated into "." (just below). These are internal names
1053 generated for anonymous blocks inside which our symbol is nested. */
1055 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1056 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1057 && isdigit (encoded
[i
+4]))
1061 while (k
< len0
&& isdigit (encoded
[k
]))
1062 k
++; /* Skip any extra digit. */
1064 /* Double-check that the "__B_{DIGITS}+" sequence we found
1065 is indeed followed by "__". */
1066 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1070 /* Remove _E{DIGITS}+[sb] */
1072 /* Just as for protected object subprograms, there are 2 categories
1073 of subprograms created by the compiler for each entry. The first
1074 one implements the actual entry code, and has a suffix following
1075 the convention above; the second one implements the barrier and
1076 uses the same convention as above, except that the 'E' is replaced
1079 Just as above, we do not decode the name of barrier functions
1080 to give the user a clue that the code he is debugging has been
1081 internally generated. */
1083 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1084 && isdigit (encoded
[i
+2]))
1088 while (k
< len0
&& isdigit (encoded
[k
]))
1092 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1095 /* Just as an extra precaution, make sure that if this
1096 suffix is followed by anything else, it is a '_'.
1097 Otherwise, we matched this sequence by accident. */
1099 || (k
< len0
&& encoded
[k
] == '_'))
1104 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1105 the GNAT front-end in protected object subprograms. */
1108 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1110 /* Backtrack a bit up until we reach either the begining of
1111 the encoded name, or "__". Make sure that we only find
1112 digits or lowercase characters. */
1113 const char *ptr
= encoded
+ i
- 1;
1115 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1118 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1122 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1124 /* This is a X[bn]* sequence not separated from the previous
1125 part of the name with a non-alpha-numeric character (in other
1126 words, immediately following an alpha-numeric character), then
1127 verify that it is placed at the end of the encoded name. If
1128 not, then the encoding is not valid and we should abort the
1129 decoding. Otherwise, just skip it, it is used in body-nested
1133 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1137 else if (!ADA_RETAIN_DOTS
1138 && i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1140 /* Replace '__' by '.'. */
1148 /* It's a character part of the decoded name, so just copy it
1150 decoded
[j
] = encoded
[i
];
1155 decoded
[j
] = '\000';
1157 /* Decoded names should never contain any uppercase character.
1158 Double-check this, and abort the decoding if we find one. */
1160 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1161 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1164 if (strcmp (decoded
, encoded
) == 0)
1170 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1171 decoded
= decoding_buffer
;
1172 if (encoded
[0] == '<')
1173 strcpy (decoded
, encoded
);
1175 sprintf (decoded
, "<%s>", encoded
);
1180 /* Table for keeping permanent unique copies of decoded names. Once
1181 allocated, names in this table are never released. While this is a
1182 storage leak, it should not be significant unless there are massive
1183 changes in the set of decoded names in successive versions of a
1184 symbol table loaded during a single session. */
1185 static struct htab
*decoded_names_store
;
1187 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1188 in the language-specific part of GSYMBOL, if it has not been
1189 previously computed. Tries to save the decoded name in the same
1190 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1191 in any case, the decoded symbol has a lifetime at least that of
1193 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1194 const, but nevertheless modified to a semantically equivalent form
1195 when a decoded name is cached in it.
1199 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1202 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1203 if (*resultp
== NULL
)
1205 const char *decoded
= ada_decode (gsymbol
->name
);
1206 if (gsymbol
->bfd_section
!= NULL
)
1208 bfd
*obfd
= gsymbol
->bfd_section
->owner
;
1211 struct objfile
*objf
;
1214 if (obfd
== objf
->obfd
)
1216 *resultp
= obsavestring (decoded
, strlen (decoded
),
1217 &objf
->objfile_obstack
);
1223 /* Sometimes, we can't find a corresponding objfile, in which
1224 case, we put the result on the heap. Since we only decode
1225 when needed, we hope this usually does not cause a
1226 significant memory leak (FIXME). */
1227 if (*resultp
== NULL
)
1229 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1232 *slot
= xstrdup (decoded
);
1241 ada_la_decode (const char *encoded
, int options
)
1243 return xstrdup (ada_decode (encoded
));
1246 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1247 suffixes that encode debugging information or leading _ada_ on
1248 SYM_NAME (see is_name_suffix commentary for the debugging
1249 information that is ignored). If WILD, then NAME need only match a
1250 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1251 either argument is NULL. */
1254 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1256 if (sym_name
== NULL
|| name
== NULL
)
1259 return wild_match (name
, strlen (name
), sym_name
);
1262 int len_name
= strlen (name
);
1263 return (strncmp (sym_name
, name
, len_name
) == 0
1264 && is_name_suffix (sym_name
+ len_name
))
1265 || (strncmp (sym_name
, "_ada_", 5) == 0
1266 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1267 && is_name_suffix (sym_name
+ len_name
+ 5));
1271 /* True (non-zero) iff, in Ada mode, the symbol SYM should be
1272 suppressed in info listings. */
1275 ada_suppress_symbol_printing (struct symbol
*sym
)
1277 if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
)
1280 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym
));
1286 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1288 static char *bound_name
[] = {
1289 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1290 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1293 /* Maximum number of array dimensions we are prepared to handle. */
1295 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1297 /* Like modify_field, but allows bitpos > wordlength. */
1300 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1302 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1306 /* The desc_* routines return primitive portions of array descriptors
1309 /* The descriptor or array type, if any, indicated by TYPE; removes
1310 level of indirection, if needed. */
1312 static struct type
*
1313 desc_base_type (struct type
*type
)
1317 type
= ada_check_typedef (type
);
1319 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1320 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1321 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1326 /* True iff TYPE indicates a "thin" array pointer type. */
1329 is_thin_pntr (struct type
*type
)
1332 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1333 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1336 /* The descriptor type for thin pointer type TYPE. */
1338 static struct type
*
1339 thin_descriptor_type (struct type
*type
)
1341 struct type
*base_type
= desc_base_type (type
);
1342 if (base_type
== NULL
)
1344 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1348 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1349 if (alt_type
== NULL
)
1356 /* A pointer to the array data for thin-pointer value VAL. */
1358 static struct value
*
1359 thin_data_pntr (struct value
*val
)
1361 struct type
*type
= value_type (val
);
1362 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1363 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1366 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1367 VALUE_ADDRESS (val
) + value_offset (val
));
1370 /* True iff TYPE indicates a "thick" array pointer type. */
1373 is_thick_pntr (struct type
*type
)
1375 type
= desc_base_type (type
);
1376 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1377 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1380 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1381 pointer to one, the type of its bounds data; otherwise, NULL. */
1383 static struct type
*
1384 desc_bounds_type (struct type
*type
)
1388 type
= desc_base_type (type
);
1392 else if (is_thin_pntr (type
))
1394 type
= thin_descriptor_type (type
);
1397 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1399 return ada_check_typedef (r
);
1401 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1403 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1405 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1410 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1411 one, a pointer to its bounds data. Otherwise NULL. */
1413 static struct value
*
1414 desc_bounds (struct value
*arr
)
1416 struct type
*type
= ada_check_typedef (value_type (arr
));
1417 if (is_thin_pntr (type
))
1419 struct type
*bounds_type
=
1420 desc_bounds_type (thin_descriptor_type (type
));
1423 if (bounds_type
== NULL
)
1424 error (_("Bad GNAT array descriptor"));
1426 /* NOTE: The following calculation is not really kosher, but
1427 since desc_type is an XVE-encoded type (and shouldn't be),
1428 the correct calculation is a real pain. FIXME (and fix GCC). */
1429 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1430 addr
= value_as_long (arr
);
1432 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1435 value_from_longest (lookup_pointer_type (bounds_type
),
1436 addr
- TYPE_LENGTH (bounds_type
));
1439 else if (is_thick_pntr (type
))
1440 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1441 _("Bad GNAT array descriptor"));
1446 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1447 position of the field containing the address of the bounds data. */
1450 fat_pntr_bounds_bitpos (struct type
*type
)
1452 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1455 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1456 size of the field containing the address of the bounds data. */
1459 fat_pntr_bounds_bitsize (struct type
*type
)
1461 type
= desc_base_type (type
);
1463 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1464 return TYPE_FIELD_BITSIZE (type
, 1);
1466 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1469 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1470 pointer to one, the type of its array data (a
1471 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1472 ada_type_of_array to get an array type with bounds data. */
1474 static struct type
*
1475 desc_data_type (struct type
*type
)
1477 type
= desc_base_type (type
);
1479 /* NOTE: The following is bogus; see comment in desc_bounds. */
1480 if (is_thin_pntr (type
))
1481 return lookup_pointer_type
1482 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1483 else if (is_thick_pntr (type
))
1484 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1489 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1492 static struct value
*
1493 desc_data (struct value
*arr
)
1495 struct type
*type
= value_type (arr
);
1496 if (is_thin_pntr (type
))
1497 return thin_data_pntr (arr
);
1498 else if (is_thick_pntr (type
))
1499 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1500 _("Bad GNAT array descriptor"));
1506 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1507 position of the field containing the address of the data. */
1510 fat_pntr_data_bitpos (struct type
*type
)
1512 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1515 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1516 size of the field containing the address of the data. */
1519 fat_pntr_data_bitsize (struct type
*type
)
1521 type
= desc_base_type (type
);
1523 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1524 return TYPE_FIELD_BITSIZE (type
, 0);
1526 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1529 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1530 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1531 bound, if WHICH is 1. The first bound is I=1. */
1533 static struct value
*
1534 desc_one_bound (struct value
*bounds
, int i
, int which
)
1536 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1537 _("Bad GNAT array descriptor bounds"));
1540 /* If BOUNDS is an array-bounds structure type, return the bit position
1541 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1542 bound, if WHICH is 1. The first bound is I=1. */
1545 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1547 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1550 /* If BOUNDS is an array-bounds structure type, return the bit field size
1551 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1552 bound, if WHICH is 1. The first bound is I=1. */
1555 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1557 type
= desc_base_type (type
);
1559 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1560 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1562 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1565 /* If TYPE is the type of an array-bounds structure, the type of its
1566 Ith bound (numbering from 1). Otherwise, NULL. */
1568 static struct type
*
1569 desc_index_type (struct type
*type
, int i
)
1571 type
= desc_base_type (type
);
1573 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1574 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1579 /* The number of index positions in the array-bounds type TYPE.
1580 Return 0 if TYPE is NULL. */
1583 desc_arity (struct type
*type
)
1585 type
= desc_base_type (type
);
1588 return TYPE_NFIELDS (type
) / 2;
1592 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1593 an array descriptor type (representing an unconstrained array
1597 ada_is_direct_array_type (struct type
*type
)
1601 type
= ada_check_typedef (type
);
1602 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1603 || ada_is_array_descriptor_type (type
));
1606 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1610 ada_is_array_type (struct type
*type
)
1613 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1614 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1615 type
= TYPE_TARGET_TYPE (type
);
1616 return ada_is_direct_array_type (type
);
1619 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1622 ada_is_simple_array_type (struct type
*type
)
1626 type
= ada_check_typedef (type
);
1627 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1628 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1629 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1632 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1635 ada_is_array_descriptor_type (struct type
*type
)
1637 struct type
*data_type
= desc_data_type (type
);
1641 type
= ada_check_typedef (type
);
1644 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1645 && TYPE_TARGET_TYPE (data_type
) != NULL
1646 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1647 || TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1648 && desc_arity (desc_bounds_type (type
)) > 0;
1651 /* Non-zero iff type is a partially mal-formed GNAT array
1652 descriptor. FIXME: This is to compensate for some problems with
1653 debugging output from GNAT. Re-examine periodically to see if it
1657 ada_is_bogus_array_descriptor (struct type
*type
)
1661 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1662 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1663 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1664 && !ada_is_array_descriptor_type (type
);
1668 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1669 (fat pointer) returns the type of the array data described---specifically,
1670 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1671 in from the descriptor; otherwise, they are left unspecified. If
1672 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1673 returns NULL. The result is simply the type of ARR if ARR is not
1676 ada_type_of_array (struct value
*arr
, int bounds
)
1678 if (ada_is_packed_array_type (value_type (arr
)))
1679 return decode_packed_array_type (value_type (arr
));
1681 if (!ada_is_array_descriptor_type (value_type (arr
)))
1682 return value_type (arr
);
1686 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr
))));
1689 struct type
*elt_type
;
1691 struct value
*descriptor
;
1692 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1694 elt_type
= ada_array_element_type (value_type (arr
), -1);
1695 arity
= ada_array_arity (value_type (arr
));
1697 if (elt_type
== NULL
|| arity
== 0)
1698 return ada_check_typedef (value_type (arr
));
1700 descriptor
= desc_bounds (arr
);
1701 if (value_as_long (descriptor
) == 0)
1705 struct type
*range_type
= alloc_type (objf
);
1706 struct type
*array_type
= alloc_type (objf
);
1707 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1708 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1711 create_range_type (range_type
, value_type (low
),
1712 longest_to_int (value_as_long (low
)),
1713 longest_to_int (value_as_long (high
)));
1714 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1717 return lookup_pointer_type (elt_type
);
1721 /* If ARR does not represent an array, returns ARR unchanged.
1722 Otherwise, returns either a standard GDB array with bounds set
1723 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1724 GDB array. Returns NULL if ARR is a null fat pointer. */
1727 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1729 if (ada_is_array_descriptor_type (value_type (arr
)))
1731 struct type
*arrType
= ada_type_of_array (arr
, 1);
1732 if (arrType
== NULL
)
1734 return value_cast (arrType
, value_copy (desc_data (arr
)));
1736 else if (ada_is_packed_array_type (value_type (arr
)))
1737 return decode_packed_array (arr
);
1742 /* If ARR does not represent an array, returns ARR unchanged.
1743 Otherwise, returns a standard GDB array describing ARR (which may
1744 be ARR itself if it already is in the proper form). */
1746 static struct value
*
1747 ada_coerce_to_simple_array (struct value
*arr
)
1749 if (ada_is_array_descriptor_type (value_type (arr
)))
1751 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1753 error (_("Bounds unavailable for null array pointer."));
1754 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1755 return value_ind (arrVal
);
1757 else if (ada_is_packed_array_type (value_type (arr
)))
1758 return decode_packed_array (arr
);
1763 /* If TYPE represents a GNAT array type, return it translated to an
1764 ordinary GDB array type (possibly with BITSIZE fields indicating
1765 packing). For other types, is the identity. */
1768 ada_coerce_to_simple_array_type (struct type
*type
)
1770 struct value
*mark
= value_mark ();
1771 struct value
*dummy
= value_from_longest (builtin_type_long
, 0);
1772 struct type
*result
;
1773 deprecated_set_value_type (dummy
, type
);
1774 result
= ada_type_of_array (dummy
, 0);
1775 value_free_to_mark (mark
);
1779 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1782 ada_is_packed_array_type (struct type
*type
)
1786 type
= desc_base_type (type
);
1787 type
= ada_check_typedef (type
);
1789 ada_type_name (type
) != NULL
1790 && strstr (ada_type_name (type
), "___XP") != NULL
;
1793 /* Given that TYPE is a standard GDB array type with all bounds filled
1794 in, and that the element size of its ultimate scalar constituents
1795 (that is, either its elements, or, if it is an array of arrays, its
1796 elements' elements, etc.) is *ELT_BITS, return an identical type,
1797 but with the bit sizes of its elements (and those of any
1798 constituent arrays) recorded in the BITSIZE components of its
1799 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1802 static struct type
*
1803 packed_array_type (struct type
*type
, long *elt_bits
)
1805 struct type
*new_elt_type
;
1806 struct type
*new_type
;
1807 LONGEST low_bound
, high_bound
;
1809 type
= ada_check_typedef (type
);
1810 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1813 new_type
= alloc_type (TYPE_OBJFILE (type
));
1814 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1816 create_array_type (new_type
, new_elt_type
, TYPE_FIELD_TYPE (type
, 0));
1817 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1818 TYPE_NAME (new_type
) = ada_type_name (type
);
1820 if (get_discrete_bounds (TYPE_FIELD_TYPE (type
, 0),
1821 &low_bound
, &high_bound
) < 0)
1822 low_bound
= high_bound
= 0;
1823 if (high_bound
< low_bound
)
1824 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1827 *elt_bits
*= (high_bound
- low_bound
+ 1);
1828 TYPE_LENGTH (new_type
) =
1829 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1832 TYPE_FLAGS (new_type
) |= TYPE_FLAG_FIXED_INSTANCE
;
1836 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1838 static struct type
*
1839 decode_packed_array_type (struct type
*type
)
1842 struct block
**blocks
;
1843 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1846 struct type
*shadow_type
;
1851 raw_name
= ada_type_name (desc_base_type (type
));
1856 name
= (char *) alloca (strlen (raw_name
) + 1);
1857 tail
= strstr (raw_name
, "___XP");
1858 type
= desc_base_type (type
);
1860 memcpy (name
, raw_name
, tail
- raw_name
);
1861 name
[tail
- raw_name
] = '\000';
1863 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1864 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1866 lim_warning (_("could not find bounds information on packed array"));
1869 shadow_type
= SYMBOL_TYPE (sym
);
1871 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1873 lim_warning (_("could not understand bounds information on packed array"));
1877 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1880 (_("could not understand bit size information on packed array"));
1884 return packed_array_type (shadow_type
, &bits
);
1887 /* Given that ARR is a struct value *indicating a GNAT packed array,
1888 returns a simple array that denotes that array. Its type is a
1889 standard GDB array type except that the BITSIZEs of the array
1890 target types are set to the number of bits in each element, and the
1891 type length is set appropriately. */
1893 static struct value
*
1894 decode_packed_array (struct value
*arr
)
1898 arr
= ada_coerce_ref (arr
);
1899 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1900 arr
= ada_value_ind (arr
);
1902 type
= decode_packed_array_type (value_type (arr
));
1905 error (_("can't unpack array"));
1909 if (gdbarch_bits_big_endian (current_gdbarch
)
1910 && ada_is_modular_type (value_type (arr
)))
1912 /* This is a (right-justified) modular type representing a packed
1913 array with no wrapper. In order to interpret the value through
1914 the (left-justified) packed array type we just built, we must
1915 first left-justify it. */
1916 int bit_size
, bit_pos
;
1919 mod
= ada_modulus (value_type (arr
)) - 1;
1926 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1927 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1928 bit_pos
/ HOST_CHAR_BIT
,
1929 bit_pos
% HOST_CHAR_BIT
,
1934 return coerce_unspec_val_to_type (arr
, type
);
1938 /* The value of the element of packed array ARR at the ARITY indices
1939 given in IND. ARR must be a simple array. */
1941 static struct value
*
1942 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1945 int bits
, elt_off
, bit_off
;
1946 long elt_total_bit_offset
;
1947 struct type
*elt_type
;
1951 elt_total_bit_offset
= 0;
1952 elt_type
= ada_check_typedef (value_type (arr
));
1953 for (i
= 0; i
< arity
; i
+= 1)
1955 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1956 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1958 (_("attempt to do packed indexing of something other than a packed array"));
1961 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1962 LONGEST lowerbound
, upperbound
;
1965 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1967 lim_warning (_("don't know bounds of array"));
1968 lowerbound
= upperbound
= 0;
1971 idx
= value_as_long (value_pos_atr (ind
[i
]));
1972 if (idx
< lowerbound
|| idx
> upperbound
)
1973 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1974 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1975 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1976 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1979 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1980 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1982 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1987 /* Non-zero iff TYPE includes negative integer values. */
1990 has_negatives (struct type
*type
)
1992 switch (TYPE_CODE (type
))
1997 return !TYPE_UNSIGNED (type
);
1998 case TYPE_CODE_RANGE
:
1999 return TYPE_LOW_BOUND (type
) < 0;
2004 /* Create a new value of type TYPE from the contents of OBJ starting
2005 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2006 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2007 assigning through the result will set the field fetched from.
2008 VALADDR is ignored unless OBJ is NULL, in which case,
2009 VALADDR+OFFSET must address the start of storage containing the
2010 packed value. The value returned in this case is never an lval.
2011 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2014 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2015 long offset
, int bit_offset
, int bit_size
,
2019 int src
, /* Index into the source area */
2020 targ
, /* Index into the target area */
2021 srcBitsLeft
, /* Number of source bits left to move */
2022 nsrc
, ntarg
, /* Number of source and target bytes */
2023 unusedLS
, /* Number of bits in next significant
2024 byte of source that are unused */
2025 accumSize
; /* Number of meaningful bits in accum */
2026 unsigned char *bytes
; /* First byte containing data to unpack */
2027 unsigned char *unpacked
;
2028 unsigned long accum
; /* Staging area for bits being transferred */
2030 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2031 /* Transmit bytes from least to most significant; delta is the direction
2032 the indices move. */
2033 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
2035 type
= ada_check_typedef (type
);
2039 v
= allocate_value (type
);
2040 bytes
= (unsigned char *) (valaddr
+ offset
);
2042 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2045 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
2046 bytes
= (unsigned char *) alloca (len
);
2047 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
2051 v
= allocate_value (type
);
2052 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2057 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
2058 if (VALUE_LVAL (obj
) == lval_internalvar
)
2059 VALUE_LVAL (v
) = lval_internalvar_component
;
2060 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
;
2061 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2062 set_value_bitsize (v
, bit_size
);
2063 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2065 VALUE_ADDRESS (v
) += 1;
2066 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2070 set_value_bitsize (v
, bit_size
);
2071 unpacked
= (unsigned char *) value_contents (v
);
2073 srcBitsLeft
= bit_size
;
2075 ntarg
= TYPE_LENGTH (type
);
2079 memset (unpacked
, 0, TYPE_LENGTH (type
));
2082 else if (gdbarch_bits_big_endian (current_gdbarch
))
2085 if (has_negatives (type
)
2086 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2090 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2093 switch (TYPE_CODE (type
))
2095 case TYPE_CODE_ARRAY
:
2096 case TYPE_CODE_UNION
:
2097 case TYPE_CODE_STRUCT
:
2098 /* Non-scalar values must be aligned at a byte boundary... */
2100 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2101 /* ... And are placed at the beginning (most-significant) bytes
2103 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2107 targ
= TYPE_LENGTH (type
) - 1;
2113 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2116 unusedLS
= bit_offset
;
2119 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2126 /* Mask for removing bits of the next source byte that are not
2127 part of the value. */
2128 unsigned int unusedMSMask
=
2129 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2131 /* Sign-extend bits for this byte. */
2132 unsigned int signMask
= sign
& ~unusedMSMask
;
2134 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2135 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2136 if (accumSize
>= HOST_CHAR_BIT
)
2138 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2139 accumSize
-= HOST_CHAR_BIT
;
2140 accum
>>= HOST_CHAR_BIT
;
2144 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2151 accum
|= sign
<< accumSize
;
2152 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2153 accumSize
-= HOST_CHAR_BIT
;
2154 accum
>>= HOST_CHAR_BIT
;
2162 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2163 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2166 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2167 int src_offset
, int n
)
2169 unsigned int accum
, mask
;
2170 int accum_bits
, chunk_size
;
2172 target
+= targ_offset
/ HOST_CHAR_BIT
;
2173 targ_offset
%= HOST_CHAR_BIT
;
2174 source
+= src_offset
/ HOST_CHAR_BIT
;
2175 src_offset
%= HOST_CHAR_BIT
;
2176 if (gdbarch_bits_big_endian (current_gdbarch
))
2178 accum
= (unsigned char) *source
;
2180 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2185 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2186 accum_bits
+= HOST_CHAR_BIT
;
2188 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2191 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2192 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2195 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2197 accum_bits
-= chunk_size
;
2204 accum
= (unsigned char) *source
>> src_offset
;
2206 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2210 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2211 accum_bits
+= HOST_CHAR_BIT
;
2213 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2216 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2217 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2219 accum_bits
-= chunk_size
;
2220 accum
>>= chunk_size
;
2227 /* Store the contents of FROMVAL into the location of TOVAL.
2228 Return a new value with the location of TOVAL and contents of
2229 FROMVAL. Handles assignment into packed fields that have
2230 floating-point or non-scalar types. */
2232 static struct value
*
2233 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2235 struct type
*type
= value_type (toval
);
2236 int bits
= value_bitsize (toval
);
2238 toval
= ada_coerce_ref (toval
);
2239 fromval
= ada_coerce_ref (fromval
);
2241 if (ada_is_direct_array_type (value_type (toval
)))
2242 toval
= ada_coerce_to_simple_array (toval
);
2243 if (ada_is_direct_array_type (value_type (fromval
)))
2244 fromval
= ada_coerce_to_simple_array (fromval
);
2246 if (!deprecated_value_modifiable (toval
))
2247 error (_("Left operand of assignment is not a modifiable lvalue."));
2249 if (VALUE_LVAL (toval
) == lval_memory
2251 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2252 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2254 int len
= (value_bitpos (toval
)
2255 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2256 char *buffer
= (char *) alloca (len
);
2258 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2260 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2261 fromval
= value_cast (type
, fromval
);
2263 read_memory (to_addr
, buffer
, len
);
2264 if (gdbarch_bits_big_endian (current_gdbarch
))
2265 move_bits (buffer
, value_bitpos (toval
),
2266 value_contents (fromval
),
2267 TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
-
2270 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2272 write_memory (to_addr
, buffer
, len
);
2273 if (deprecated_memory_changed_hook
)
2274 deprecated_memory_changed_hook (to_addr
, len
);
2276 val
= value_copy (toval
);
2277 memcpy (value_contents_raw (val
), value_contents (fromval
),
2278 TYPE_LENGTH (type
));
2279 deprecated_set_value_type (val
, type
);
2284 return value_assign (toval
, fromval
);
2288 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2289 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2290 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2291 * COMPONENT, and not the inferior's memory. The current contents
2292 * of COMPONENT are ignored. */
2294 value_assign_to_component (struct value
*container
, struct value
*component
,
2297 LONGEST offset_in_container
=
2298 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2299 - VALUE_ADDRESS (container
) - value_offset (container
));
2300 int bit_offset_in_container
=
2301 value_bitpos (component
) - value_bitpos (container
);
2304 val
= value_cast (value_type (component
), val
);
2306 if (value_bitsize (component
) == 0)
2307 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2309 bits
= value_bitsize (component
);
2311 if (gdbarch_bits_big_endian (current_gdbarch
))
2312 move_bits (value_contents_writeable (container
) + offset_in_container
,
2313 value_bitpos (container
) + bit_offset_in_container
,
2314 value_contents (val
),
2315 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2318 move_bits (value_contents_writeable (container
) + offset_in_container
,
2319 value_bitpos (container
) + bit_offset_in_container
,
2320 value_contents (val
), 0, bits
);
2323 /* The value of the element of array ARR at the ARITY indices given in IND.
2324 ARR may be either a simple array, GNAT array descriptor, or pointer
2328 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2332 struct type
*elt_type
;
2334 elt
= ada_coerce_to_simple_array (arr
);
2336 elt_type
= ada_check_typedef (value_type (elt
));
2337 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2338 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2339 return value_subscript_packed (elt
, arity
, ind
);
2341 for (k
= 0; k
< arity
; k
+= 1)
2343 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2344 error (_("too many subscripts (%d expected)"), k
);
2345 elt
= value_subscript (elt
, value_pos_atr (ind
[k
]));
2350 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2351 value of the element of *ARR at the ARITY indices given in
2352 IND. Does not read the entire array into memory. */
2355 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2360 for (k
= 0; k
< arity
; k
+= 1)
2365 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2366 error (_("too many subscripts (%d expected)"), k
);
2367 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2369 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2370 idx
= value_pos_atr (ind
[k
]);
2372 idx
= value_sub (idx
, value_from_longest (builtin_type_int
, lwb
));
2373 arr
= value_add (arr
, idx
);
2374 type
= TYPE_TARGET_TYPE (type
);
2377 return value_ind (arr
);
2380 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2381 actual type of ARRAY_PTR is ignored), returns a reference to
2382 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2383 bound of this array is LOW, as per Ada rules. */
2384 static struct value
*
2385 ada_value_slice_ptr (struct value
*array_ptr
, struct type
*type
,
2388 CORE_ADDR base
= value_as_address (array_ptr
)
2389 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2390 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2391 struct type
*index_type
=
2392 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2394 struct type
*slice_type
=
2395 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2396 return value_from_pointer (lookup_reference_type (slice_type
), base
);
2400 static struct value
*
2401 ada_value_slice (struct value
*array
, int low
, int high
)
2403 struct type
*type
= value_type (array
);
2404 struct type
*index_type
=
2405 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2406 struct type
*slice_type
=
2407 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2408 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2411 /* If type is a record type in the form of a standard GNAT array
2412 descriptor, returns the number of dimensions for type. If arr is a
2413 simple array, returns the number of "array of"s that prefix its
2414 type designation. Otherwise, returns 0. */
2417 ada_array_arity (struct type
*type
)
2424 type
= desc_base_type (type
);
2427 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2428 return desc_arity (desc_bounds_type (type
));
2430 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2433 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2439 /* If TYPE is a record type in the form of a standard GNAT array
2440 descriptor or a simple array type, returns the element type for
2441 TYPE after indexing by NINDICES indices, or by all indices if
2442 NINDICES is -1. Otherwise, returns NULL. */
2445 ada_array_element_type (struct type
*type
, int nindices
)
2447 type
= desc_base_type (type
);
2449 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2452 struct type
*p_array_type
;
2454 p_array_type
= desc_data_type (type
);
2456 k
= ada_array_arity (type
);
2460 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2461 if (nindices
>= 0 && k
> nindices
)
2463 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2464 while (k
> 0 && p_array_type
!= NULL
)
2466 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2469 return p_array_type
;
2471 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2473 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2475 type
= TYPE_TARGET_TYPE (type
);
2484 /* The type of nth index in arrays of given type (n numbering from 1).
2485 Does not examine memory. */
2488 ada_index_type (struct type
*type
, int n
)
2490 struct type
*result_type
;
2492 type
= desc_base_type (type
);
2494 if (n
> ada_array_arity (type
))
2497 if (ada_is_simple_array_type (type
))
2501 for (i
= 1; i
< n
; i
+= 1)
2502 type
= TYPE_TARGET_TYPE (type
);
2503 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2504 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2505 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2506 perhaps stabsread.c would make more sense. */
2507 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2508 result_type
= builtin_type_int
;
2513 return desc_index_type (desc_bounds_type (type
), n
);
2516 /* Given that arr is an array type, returns the lower bound of the
2517 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2518 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2519 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2520 bounds type. It works for other arrays with bounds supplied by
2521 run-time quantities other than discriminants. */
2524 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2525 struct type
** typep
)
2528 struct type
*index_type_desc
;
2530 if (ada_is_packed_array_type (arr_type
))
2531 arr_type
= decode_packed_array_type (arr_type
);
2533 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2536 *typep
= builtin_type_int
;
2537 return (LONGEST
) - which
;
2540 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2541 type
= TYPE_TARGET_TYPE (arr_type
);
2545 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2546 if (index_type_desc
== NULL
)
2548 struct type
*index_type
;
2552 type
= TYPE_TARGET_TYPE (type
);
2556 index_type
= TYPE_INDEX_TYPE (type
);
2558 *typep
= index_type
;
2560 /* The index type is either a range type or an enumerated type.
2561 For the range type, we have some macros that allow us to
2562 extract the value of the low and high bounds. But they
2563 do now work for enumerated types. The expressions used
2564 below work for both range and enum types. */
2566 (LONGEST
) (which
== 0
2567 ? TYPE_FIELD_BITPOS (index_type
, 0)
2568 : TYPE_FIELD_BITPOS (index_type
,
2569 TYPE_NFIELDS (index_type
) - 1));
2573 struct type
*index_type
=
2574 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2575 NULL
, TYPE_OBJFILE (arr_type
));
2578 *typep
= index_type
;
2581 (LONGEST
) (which
== 0
2582 ? TYPE_LOW_BOUND (index_type
)
2583 : TYPE_HIGH_BOUND (index_type
));
2587 /* Given that arr is an array value, returns the lower bound of the
2588 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2589 WHICH is 1. This routine will also work for arrays with bounds
2590 supplied by run-time quantities other than discriminants. */
2593 ada_array_bound (struct value
*arr
, int n
, int which
)
2595 struct type
*arr_type
= value_type (arr
);
2597 if (ada_is_packed_array_type (arr_type
))
2598 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2599 else if (ada_is_simple_array_type (arr_type
))
2602 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2603 return value_from_longest (type
, v
);
2606 return desc_one_bound (desc_bounds (arr
), n
, which
);
2609 /* Given that arr is an array value, returns the length of the
2610 nth index. This routine will also work for arrays with bounds
2611 supplied by run-time quantities other than discriminants.
2612 Does not work for arrays indexed by enumeration types with representation
2613 clauses at the moment. */
2616 ada_array_length (struct value
*arr
, int n
)
2618 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2620 if (ada_is_packed_array_type (arr_type
))
2621 return ada_array_length (decode_packed_array (arr
), n
);
2623 if (ada_is_simple_array_type (arr_type
))
2627 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2628 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2629 return value_from_longest (type
, v
);
2633 value_from_longest (builtin_type_int
,
2634 value_as_long (desc_one_bound (desc_bounds (arr
),
2636 - value_as_long (desc_one_bound (desc_bounds (arr
),
2640 /* An empty array whose type is that of ARR_TYPE (an array type),
2641 with bounds LOW to LOW-1. */
2643 static struct value
*
2644 empty_array (struct type
*arr_type
, int low
)
2646 struct type
*index_type
=
2647 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2649 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2650 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2654 /* Name resolution */
2656 /* The "decoded" name for the user-definable Ada operator corresponding
2660 ada_decoded_op_name (enum exp_opcode op
)
2664 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2666 if (ada_opname_table
[i
].op
== op
)
2667 return ada_opname_table
[i
].decoded
;
2669 error (_("Could not find operator name for opcode"));
2673 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2674 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2675 undefined namespace) and converts operators that are
2676 user-defined into appropriate function calls. If CONTEXT_TYPE is
2677 non-null, it provides a preferred result type [at the moment, only
2678 type void has any effect---causing procedures to be preferred over
2679 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2680 return type is preferred. May change (expand) *EXP. */
2683 resolve (struct expression
**expp
, int void_context_p
)
2687 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2690 /* Resolve the operator of the subexpression beginning at
2691 position *POS of *EXPP. "Resolving" consists of replacing
2692 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2693 with their resolutions, replacing built-in operators with
2694 function calls to user-defined operators, where appropriate, and,
2695 when DEPROCEDURE_P is non-zero, converting function-valued variables
2696 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2697 are as in ada_resolve, above. */
2699 static struct value
*
2700 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2701 struct type
*context_type
)
2705 struct expression
*exp
; /* Convenience: == *expp. */
2706 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2707 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2708 int nargs
; /* Number of operands. */
2715 /* Pass one: resolve operands, saving their types and updating *pos,
2720 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2721 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2726 resolve_subexp (expp
, pos
, 0, NULL
);
2728 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2733 resolve_subexp (expp
, pos
, 0, NULL
);
2738 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2741 case OP_ATR_MODULUS
:
2751 case TERNOP_IN_RANGE
:
2752 case BINOP_IN_BOUNDS
:
2758 case OP_DISCRETE_RANGE
:
2760 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2769 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2771 resolve_subexp (expp
, pos
, 1, NULL
);
2773 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2790 case BINOP_LOGICAL_AND
:
2791 case BINOP_LOGICAL_OR
:
2792 case BINOP_BITWISE_AND
:
2793 case BINOP_BITWISE_IOR
:
2794 case BINOP_BITWISE_XOR
:
2797 case BINOP_NOTEQUAL
:
2804 case BINOP_SUBSCRIPT
:
2812 case UNOP_LOGICAL_NOT
:
2828 case OP_INTERNALVAR
:
2838 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2841 case STRUCTOP_STRUCT
:
2842 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2855 error (_("Unexpected operator during name resolution"));
2858 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2859 for (i
= 0; i
< nargs
; i
+= 1)
2860 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2864 /* Pass two: perform any resolution on principal operator. */
2871 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2873 struct ada_symbol_info
*candidates
;
2877 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2878 (exp
->elts
[pc
+ 2].symbol
),
2879 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2882 if (n_candidates
> 1)
2884 /* Types tend to get re-introduced locally, so if there
2885 are any local symbols that are not types, first filter
2888 for (j
= 0; j
< n_candidates
; j
+= 1)
2889 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2895 case LOC_REGPARM_ADDR
:
2899 case LOC_BASEREG_ARG
:
2901 case LOC_COMPUTED_ARG
:
2907 if (j
< n_candidates
)
2910 while (j
< n_candidates
)
2912 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2914 candidates
[j
] = candidates
[n_candidates
- 1];
2923 if (n_candidates
== 0)
2924 error (_("No definition found for %s"),
2925 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2926 else if (n_candidates
== 1)
2928 else if (deprocedure_p
2929 && !is_nonfunction (candidates
, n_candidates
))
2931 i
= ada_resolve_function
2932 (candidates
, n_candidates
, NULL
, 0,
2933 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2936 error (_("Could not find a match for %s"),
2937 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2941 printf_filtered (_("Multiple matches for %s\n"),
2942 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2943 user_select_syms (candidates
, n_candidates
, 1);
2947 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2948 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2949 if (innermost_block
== NULL
2950 || contained_in (candidates
[i
].block
, innermost_block
))
2951 innermost_block
= candidates
[i
].block
;
2955 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2958 replace_operator_with_call (expp
, pc
, 0, 0,
2959 exp
->elts
[pc
+ 2].symbol
,
2960 exp
->elts
[pc
+ 1].block
);
2967 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2968 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2970 struct ada_symbol_info
*candidates
;
2974 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2975 (exp
->elts
[pc
+ 5].symbol
),
2976 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2978 if (n_candidates
== 1)
2982 i
= ada_resolve_function
2983 (candidates
, n_candidates
,
2985 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2988 error (_("Could not find a match for %s"),
2989 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2992 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2993 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2994 if (innermost_block
== NULL
2995 || contained_in (candidates
[i
].block
, innermost_block
))
2996 innermost_block
= candidates
[i
].block
;
3007 case BINOP_BITWISE_AND
:
3008 case BINOP_BITWISE_IOR
:
3009 case BINOP_BITWISE_XOR
:
3011 case BINOP_NOTEQUAL
:
3019 case UNOP_LOGICAL_NOT
:
3021 if (possible_user_operator_p (op
, argvec
))
3023 struct ada_symbol_info
*candidates
;
3027 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3028 (struct block
*) NULL
, VAR_DOMAIN
,
3030 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3031 ada_decoded_op_name (op
), NULL
);
3035 replace_operator_with_call (expp
, pc
, nargs
, 1,
3036 candidates
[i
].sym
, candidates
[i
].block
);
3047 return evaluate_subexp_type (exp
, pos
);
3050 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3051 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3052 a non-pointer. A type of 'void' (which is never a valid expression type)
3053 by convention matches anything. */
3054 /* The term "match" here is rather loose. The match is heuristic and
3055 liberal. FIXME: TOO liberal, in fact. */
3058 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3060 ftype
= ada_check_typedef (ftype
);
3061 atype
= ada_check_typedef (atype
);
3063 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3064 ftype
= TYPE_TARGET_TYPE (ftype
);
3065 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3066 atype
= TYPE_TARGET_TYPE (atype
);
3068 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3069 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3072 switch (TYPE_CODE (ftype
))
3077 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3078 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3079 TYPE_TARGET_TYPE (atype
), 0);
3082 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3084 case TYPE_CODE_ENUM
:
3085 case TYPE_CODE_RANGE
:
3086 switch (TYPE_CODE (atype
))
3089 case TYPE_CODE_ENUM
:
3090 case TYPE_CODE_RANGE
:
3096 case TYPE_CODE_ARRAY
:
3097 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3098 || ada_is_array_descriptor_type (atype
));
3100 case TYPE_CODE_STRUCT
:
3101 if (ada_is_array_descriptor_type (ftype
))
3102 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3103 || ada_is_array_descriptor_type (atype
));
3105 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3106 && !ada_is_array_descriptor_type (atype
));
3108 case TYPE_CODE_UNION
:
3110 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3114 /* Return non-zero if the formals of FUNC "sufficiently match" the
3115 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3116 may also be an enumeral, in which case it is treated as a 0-
3117 argument function. */
3120 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3123 struct type
*func_type
= SYMBOL_TYPE (func
);
3125 if (SYMBOL_CLASS (func
) == LOC_CONST
3126 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3127 return (n_actuals
== 0);
3128 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3131 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3134 for (i
= 0; i
< n_actuals
; i
+= 1)
3136 if (actuals
[i
] == NULL
)
3140 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3141 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3143 if (!ada_type_match (ftype
, atype
, 1))
3150 /* False iff function type FUNC_TYPE definitely does not produce a value
3151 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3152 FUNC_TYPE is not a valid function type with a non-null return type
3153 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3156 return_match (struct type
*func_type
, struct type
*context_type
)
3158 struct type
*return_type
;
3160 if (func_type
== NULL
)
3163 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3164 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3166 return_type
= base_type (func_type
);
3167 if (return_type
== NULL
)
3170 context_type
= base_type (context_type
);
3172 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3173 return context_type
== NULL
|| return_type
== context_type
;
3174 else if (context_type
== NULL
)
3175 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3177 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3181 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3182 function (if any) that matches the types of the NARGS arguments in
3183 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3184 that returns that type, then eliminate matches that don't. If
3185 CONTEXT_TYPE is void and there is at least one match that does not
3186 return void, eliminate all matches that do.
3188 Asks the user if there is more than one match remaining. Returns -1
3189 if there is no such symbol or none is selected. NAME is used
3190 solely for messages. May re-arrange and modify SYMS in
3191 the process; the index returned is for the modified vector. */
3194 ada_resolve_function (struct ada_symbol_info syms
[],
3195 int nsyms
, struct value
**args
, int nargs
,
3196 const char *name
, struct type
*context_type
)
3199 int m
; /* Number of hits */
3200 struct type
*fallback
;
3201 struct type
*return_type
;
3203 return_type
= context_type
;
3204 if (context_type
== NULL
)
3205 fallback
= builtin_type_void
;
3212 for (k
= 0; k
< nsyms
; k
+= 1)
3214 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3216 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3217 && return_match (type
, return_type
))
3223 if (m
> 0 || return_type
== fallback
)
3226 return_type
= fallback
;
3233 printf_filtered (_("Multiple matches for %s\n"), name
);
3234 user_select_syms (syms
, m
, 1);
3240 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3241 in a listing of choices during disambiguation (see sort_choices, below).
3242 The idea is that overloadings of a subprogram name from the
3243 same package should sort in their source order. We settle for ordering
3244 such symbols by their trailing number (__N or $N). */
3247 encoded_ordered_before (char *N0
, char *N1
)
3251 else if (N0
== NULL
)
3256 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3258 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3260 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3261 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3265 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3268 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3270 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3271 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3273 return (strcmp (N0
, N1
) < 0);
3277 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3281 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3284 for (i
= 1; i
< nsyms
; i
+= 1)
3286 struct ada_symbol_info sym
= syms
[i
];
3289 for (j
= i
- 1; j
>= 0; j
-= 1)
3291 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3292 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3294 syms
[j
+ 1] = syms
[j
];
3300 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3301 by asking the user (if necessary), returning the number selected,
3302 and setting the first elements of SYMS items. Error if no symbols
3305 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3306 to be re-integrated one of these days. */
3309 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3312 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3314 int first_choice
= (max_results
== 1) ? 1 : 2;
3315 const char *select_mode
= multiple_symbols_select_mode ();
3317 if (max_results
< 1)
3318 error (_("Request to select 0 symbols!"));
3322 if (select_mode
== multiple_symbols_cancel
)
3324 canceled because the command is ambiguous\n\
3325 See set/show multiple-symbol."));
3327 /* If select_mode is "all", then return all possible symbols.
3328 Only do that if more than one symbol can be selected, of course.
3329 Otherwise, display the menu as usual. */
3330 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3333 printf_unfiltered (_("[0] cancel\n"));
3334 if (max_results
> 1)
3335 printf_unfiltered (_("[1] all\n"));
3337 sort_choices (syms
, nsyms
);
3339 for (i
= 0; i
< nsyms
; i
+= 1)
3341 if (syms
[i
].sym
== NULL
)
3344 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3346 struct symtab_and_line sal
=
3347 find_function_start_sal (syms
[i
].sym
, 1);
3348 if (sal
.symtab
== NULL
)
3349 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3351 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3354 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3355 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3356 sal
.symtab
->filename
, sal
.line
);
3362 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3363 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3364 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3365 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3367 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3368 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3370 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3371 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3372 else if (is_enumeral
3373 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3375 printf_unfiltered (("[%d] "), i
+ first_choice
);
3376 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3378 printf_unfiltered (_("'(%s) (enumeral)\n"),
3379 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3381 else if (symtab
!= NULL
)
3382 printf_unfiltered (is_enumeral
3383 ? _("[%d] %s in %s (enumeral)\n")
3384 : _("[%d] %s at %s:?\n"),
3386 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3389 printf_unfiltered (is_enumeral
3390 ? _("[%d] %s (enumeral)\n")
3391 : _("[%d] %s at ?\n"),
3393 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3397 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3400 for (i
= 0; i
< n_chosen
; i
+= 1)
3401 syms
[i
] = syms
[chosen
[i
]];
3406 /* Read and validate a set of numeric choices from the user in the
3407 range 0 .. N_CHOICES-1. Place the results in increasing
3408 order in CHOICES[0 .. N-1], and return N.
3410 The user types choices as a sequence of numbers on one line
3411 separated by blanks, encoding them as follows:
3413 + A choice of 0 means to cancel the selection, throwing an error.
3414 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3415 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3417 The user is not allowed to choose more than MAX_RESULTS values.
3419 ANNOTATION_SUFFIX, if present, is used to annotate the input
3420 prompts (for use with the -f switch). */
3423 get_selections (int *choices
, int n_choices
, int max_results
,
3424 int is_all_choice
, char *annotation_suffix
)
3429 int first_choice
= is_all_choice
? 2 : 1;
3431 prompt
= getenv ("PS2");
3435 args
= command_line_input (prompt
, 0, annotation_suffix
);
3438 error_no_arg (_("one or more choice numbers"));
3442 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3443 order, as given in args. Choices are validated. */
3449 while (isspace (*args
))
3451 if (*args
== '\0' && n_chosen
== 0)
3452 error_no_arg (_("one or more choice numbers"));
3453 else if (*args
== '\0')
3456 choice
= strtol (args
, &args2
, 10);
3457 if (args
== args2
|| choice
< 0
3458 || choice
> n_choices
+ first_choice
- 1)
3459 error (_("Argument must be choice number"));
3463 error (_("cancelled"));
3465 if (choice
< first_choice
)
3467 n_chosen
= n_choices
;
3468 for (j
= 0; j
< n_choices
; j
+= 1)
3472 choice
-= first_choice
;
3474 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3478 if (j
< 0 || choice
!= choices
[j
])
3481 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3482 choices
[k
+ 1] = choices
[k
];
3483 choices
[j
+ 1] = choice
;
3488 if (n_chosen
> max_results
)
3489 error (_("Select no more than %d of the above"), max_results
);
3494 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3495 on the function identified by SYM and BLOCK, and taking NARGS
3496 arguments. Update *EXPP as needed to hold more space. */
3499 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3500 int oplen
, struct symbol
*sym
,
3501 struct block
*block
)
3503 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3504 symbol, -oplen for operator being replaced). */
3505 struct expression
*newexp
= (struct expression
*)
3506 xmalloc (sizeof (struct expression
)
3507 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3508 struct expression
*exp
= *expp
;
3510 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3511 newexp
->language_defn
= exp
->language_defn
;
3512 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3513 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3514 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3516 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3517 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3519 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3520 newexp
->elts
[pc
+ 4].block
= block
;
3521 newexp
->elts
[pc
+ 5].symbol
= sym
;
3527 /* Type-class predicates */
3529 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3533 numeric_type_p (struct type
*type
)
3539 switch (TYPE_CODE (type
))
3544 case TYPE_CODE_RANGE
:
3545 return (type
== TYPE_TARGET_TYPE (type
)
3546 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3553 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3556 integer_type_p (struct type
*type
)
3562 switch (TYPE_CODE (type
))
3566 case TYPE_CODE_RANGE
:
3567 return (type
== TYPE_TARGET_TYPE (type
)
3568 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3575 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3578 scalar_type_p (struct type
*type
)
3584 switch (TYPE_CODE (type
))
3587 case TYPE_CODE_RANGE
:
3588 case TYPE_CODE_ENUM
:
3597 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3600 discrete_type_p (struct type
*type
)
3606 switch (TYPE_CODE (type
))
3609 case TYPE_CODE_RANGE
:
3610 case TYPE_CODE_ENUM
:
3618 /* Returns non-zero if OP with operands in the vector ARGS could be
3619 a user-defined function. Errs on the side of pre-defined operators
3620 (i.e., result 0). */
3623 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3625 struct type
*type0
=
3626 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3627 struct type
*type1
=
3628 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3642 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3646 case BINOP_BITWISE_AND
:
3647 case BINOP_BITWISE_IOR
:
3648 case BINOP_BITWISE_XOR
:
3649 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3652 case BINOP_NOTEQUAL
:
3657 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3660 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3663 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3667 case UNOP_LOGICAL_NOT
:
3669 return (!numeric_type_p (type0
));
3678 1. In the following, we assume that a renaming type's name may
3679 have an ___XD suffix. It would be nice if this went away at some
3681 2. We handle both the (old) purely type-based representation of
3682 renamings and the (new) variable-based encoding. At some point,
3683 it is devoutly to be hoped that the former goes away
3684 (FIXME: hilfinger-2007-07-09).
3685 3. Subprogram renamings are not implemented, although the XRS
3686 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3688 /* If SYM encodes a renaming,
3690 <renaming> renames <renamed entity>,
3692 sets *LEN to the length of the renamed entity's name,
3693 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3694 the string describing the subcomponent selected from the renamed
3695 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3696 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3697 are undefined). Otherwise, returns a value indicating the category
3698 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3699 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3700 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3701 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3702 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3703 may be NULL, in which case they are not assigned.
3705 [Currently, however, GCC does not generate subprogram renamings.] */
3707 enum ada_renaming_category
3708 ada_parse_renaming (struct symbol
*sym
,
3709 const char **renamed_entity
, int *len
,
3710 const char **renaming_expr
)
3712 enum ada_renaming_category kind
;
3717 return ADA_NOT_RENAMING
;
3718 switch (SYMBOL_CLASS (sym
))
3721 return ADA_NOT_RENAMING
;
3723 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3724 renamed_entity
, len
, renaming_expr
);
3728 case LOC_OPTIMIZED_OUT
:
3729 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3731 return ADA_NOT_RENAMING
;
3735 kind
= ADA_OBJECT_RENAMING
;
3739 kind
= ADA_EXCEPTION_RENAMING
;
3743 kind
= ADA_PACKAGE_RENAMING
;
3747 kind
= ADA_SUBPROGRAM_RENAMING
;
3751 return ADA_NOT_RENAMING
;
3755 if (renamed_entity
!= NULL
)
3756 *renamed_entity
= info
;
3757 suffix
= strstr (info
, "___XE");
3758 if (suffix
== NULL
|| suffix
== info
)
3759 return ADA_NOT_RENAMING
;
3761 *len
= strlen (info
) - strlen (suffix
);
3763 if (renaming_expr
!= NULL
)
3764 *renaming_expr
= suffix
;
3768 /* Assuming TYPE encodes a renaming according to the old encoding in
3769 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3770 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3771 ADA_NOT_RENAMING otherwise. */
3772 static enum ada_renaming_category
3773 parse_old_style_renaming (struct type
*type
,
3774 const char **renamed_entity
, int *len
,
3775 const char **renaming_expr
)
3777 enum ada_renaming_category kind
;
3782 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3783 || TYPE_NFIELDS (type
) != 1)
3784 return ADA_NOT_RENAMING
;
3786 name
= type_name_no_tag (type
);
3788 return ADA_NOT_RENAMING
;
3790 name
= strstr (name
, "___XR");
3792 return ADA_NOT_RENAMING
;
3797 kind
= ADA_OBJECT_RENAMING
;
3800 kind
= ADA_EXCEPTION_RENAMING
;
3803 kind
= ADA_PACKAGE_RENAMING
;
3806 kind
= ADA_SUBPROGRAM_RENAMING
;
3809 return ADA_NOT_RENAMING
;
3812 info
= TYPE_FIELD_NAME (type
, 0);
3814 return ADA_NOT_RENAMING
;
3815 if (renamed_entity
!= NULL
)
3816 *renamed_entity
= info
;
3817 suffix
= strstr (info
, "___XE");
3818 if (renaming_expr
!= NULL
)
3819 *renaming_expr
= suffix
+ 5;
3820 if (suffix
== NULL
|| suffix
== info
)
3821 return ADA_NOT_RENAMING
;
3823 *len
= suffix
- info
;
3829 /* Evaluation: Function Calls */
3831 /* Return an lvalue containing the value VAL. This is the identity on
3832 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3833 on the stack, using and updating *SP as the stack pointer, and
3834 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3836 static struct value
*
3837 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3839 if (! VALUE_LVAL (val
))
3841 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3843 /* The following is taken from the structure-return code in
3844 call_function_by_hand. FIXME: Therefore, some refactoring seems
3846 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3848 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3849 reserving sufficient space. */
3851 if (gdbarch_frame_align_p (current_gdbarch
))
3852 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3853 VALUE_ADDRESS (val
) = *sp
;
3857 /* Stack grows upward. Align the frame, allocate space, and
3858 then again, re-align the frame. */
3859 if (gdbarch_frame_align_p (current_gdbarch
))
3860 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3861 VALUE_ADDRESS (val
) = *sp
;
3863 if (gdbarch_frame_align_p (current_gdbarch
))
3864 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3866 VALUE_LVAL (val
) = lval_memory
;
3868 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3874 /* Return the value ACTUAL, converted to be an appropriate value for a
3875 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3876 allocating any necessary descriptors (fat pointers), or copies of
3877 values not residing in memory, updating it as needed. */
3880 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3883 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3884 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3885 struct type
*formal_target
=
3886 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3887 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3888 struct type
*actual_target
=
3889 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3890 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3892 if (ada_is_array_descriptor_type (formal_target
)
3893 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3894 return make_array_descriptor (formal_type
, actual
, sp
);
3895 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3896 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3898 struct value
*result
;
3899 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3900 && ada_is_array_descriptor_type (actual_target
))
3901 result
= desc_data (actual
);
3902 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3904 if (VALUE_LVAL (actual
) != lval_memory
)
3907 actual_type
= ada_check_typedef (value_type (actual
));
3908 val
= allocate_value (actual_type
);
3909 memcpy ((char *) value_contents_raw (val
),
3910 (char *) value_contents (actual
),
3911 TYPE_LENGTH (actual_type
));
3912 actual
= ensure_lval (val
, sp
);
3914 result
= value_addr (actual
);
3918 return value_cast_pointers (formal_type
, result
);
3920 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3921 return ada_value_ind (actual
);
3927 /* Push a descriptor of type TYPE for array value ARR on the stack at
3928 *SP, updating *SP to reflect the new descriptor. Return either
3929 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3930 to-descriptor type rather than a descriptor type), a struct value *
3931 representing a pointer to this descriptor. */
3933 static struct value
*
3934 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3936 struct type
*bounds_type
= desc_bounds_type (type
);
3937 struct type
*desc_type
= desc_base_type (type
);
3938 struct value
*descriptor
= allocate_value (desc_type
);
3939 struct value
*bounds
= allocate_value (bounds_type
);
3942 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3944 modify_general_field (value_contents_writeable (bounds
),
3945 value_as_long (ada_array_bound (arr
, i
, 0)),
3946 desc_bound_bitpos (bounds_type
, i
, 0),
3947 desc_bound_bitsize (bounds_type
, i
, 0));
3948 modify_general_field (value_contents_writeable (bounds
),
3949 value_as_long (ada_array_bound (arr
, i
, 1)),
3950 desc_bound_bitpos (bounds_type
, i
, 1),
3951 desc_bound_bitsize (bounds_type
, i
, 1));
3954 bounds
= ensure_lval (bounds
, sp
);
3956 modify_general_field (value_contents_writeable (descriptor
),
3957 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3958 fat_pntr_data_bitpos (desc_type
),
3959 fat_pntr_data_bitsize (desc_type
));
3961 modify_general_field (value_contents_writeable (descriptor
),
3962 VALUE_ADDRESS (bounds
),
3963 fat_pntr_bounds_bitpos (desc_type
),
3964 fat_pntr_bounds_bitsize (desc_type
));
3966 descriptor
= ensure_lval (descriptor
, sp
);
3968 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3969 return value_addr (descriptor
);
3974 /* Dummy definitions for an experimental caching module that is not
3975 * used in the public sources. */
3978 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3979 struct symbol
**sym
, struct block
**block
,
3980 struct symtab
**symtab
)
3986 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3987 struct block
*block
, struct symtab
*symtab
)
3993 /* Return the result of a standard (literal, C-like) lookup of NAME in
3994 given DOMAIN, visible from lexical block BLOCK. */
3996 static struct symbol
*
3997 standard_lookup (const char *name
, const struct block
*block
,
4001 struct symtab
*symtab
;
4003 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
, NULL
))
4006 lookup_symbol_in_language (name
, block
, domain
, language_c
, 0, &symtab
);
4007 cache_symbol (name
, domain
, sym
, block_found
, symtab
);
4012 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4013 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4014 since they contend in overloading in the same way. */
4016 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4020 for (i
= 0; i
< n
; i
+= 1)
4021 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4022 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4023 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4029 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4030 struct types. Otherwise, they may not. */
4033 equiv_types (struct type
*type0
, struct type
*type1
)
4037 if (type0
== NULL
|| type1
== NULL
4038 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4040 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4041 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4042 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4043 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4049 /* True iff SYM0 represents the same entity as SYM1, or one that is
4050 no more defined than that of SYM1. */
4053 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4057 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4058 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4061 switch (SYMBOL_CLASS (sym0
))
4067 struct type
*type0
= SYMBOL_TYPE (sym0
);
4068 struct type
*type1
= SYMBOL_TYPE (sym1
);
4069 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4070 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4071 int len0
= strlen (name0
);
4073 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4074 && (equiv_types (type0
, type1
)
4075 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4076 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4079 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4080 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4086 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4087 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4090 add_defn_to_vec (struct obstack
*obstackp
,
4092 struct block
*block
, struct symtab
*symtab
)
4096 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4098 /* Do not try to complete stub types, as the debugger is probably
4099 already scanning all symbols matching a certain name at the
4100 time when this function is called. Trying to replace the stub
4101 type by its associated full type will cause us to restart a scan
4102 which may lead to an infinite recursion. Instead, the client
4103 collecting the matching symbols will end up collecting several
4104 matches, with at least one of them complete. It can then filter
4105 out the stub ones if needed. */
4107 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4109 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4111 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4113 prevDefns
[i
].sym
= sym
;
4114 prevDefns
[i
].block
= block
;
4115 prevDefns
[i
].symtab
= symtab
;
4121 struct ada_symbol_info info
;
4125 info
.symtab
= symtab
;
4126 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4130 /* Number of ada_symbol_info structures currently collected in
4131 current vector in *OBSTACKP. */
4134 num_defns_collected (struct obstack
*obstackp
)
4136 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4139 /* Vector of ada_symbol_info structures currently collected in current
4140 vector in *OBSTACKP. If FINISH, close off the vector and return
4141 its final address. */
4143 static struct ada_symbol_info
*
4144 defns_collected (struct obstack
*obstackp
, int finish
)
4147 return obstack_finish (obstackp
);
4149 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4152 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4153 Check the global symbols if GLOBAL, the static symbols if not.
4154 Do wild-card match if WILD. */
4156 static struct partial_symbol
*
4157 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4158 int global
, domain_enum
namespace, int wild
)
4160 struct partial_symbol
**start
;
4161 int name_len
= strlen (name
);
4162 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4171 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4172 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4176 for (i
= 0; i
< length
; i
+= 1)
4178 struct partial_symbol
*psym
= start
[i
];
4180 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4181 SYMBOL_DOMAIN (psym
), namespace)
4182 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4196 int M
= (U
+ i
) >> 1;
4197 struct partial_symbol
*psym
= start
[M
];
4198 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4200 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4202 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4213 struct partial_symbol
*psym
= start
[i
];
4215 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4216 SYMBOL_DOMAIN (psym
), namespace))
4218 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4226 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4240 int M
= (U
+ i
) >> 1;
4241 struct partial_symbol
*psym
= start
[M
];
4242 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4244 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4246 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4257 struct partial_symbol
*psym
= start
[i
];
4259 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4260 SYMBOL_DOMAIN (psym
), namespace))
4264 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4267 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4269 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4279 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4289 /* Find a symbol table containing symbol SYM or NULL if none. */
4291 static struct symtab
*
4292 symtab_for_sym (struct symbol
*sym
)
4295 struct objfile
*objfile
;
4297 struct symbol
*tmp_sym
;
4298 struct dict_iterator iter
;
4301 ALL_PRIMARY_SYMTABS (objfile
, s
)
4303 switch (SYMBOL_CLASS (sym
))
4311 case LOC_CONST_BYTES
:
4312 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4313 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4315 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4316 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4322 switch (SYMBOL_CLASS (sym
))
4328 case LOC_REGPARM_ADDR
:
4333 case LOC_BASEREG_ARG
:
4335 case LOC_COMPUTED_ARG
:
4336 for (j
= FIRST_LOCAL_BLOCK
;
4337 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4339 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4340 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4351 /* Return a minimal symbol matching NAME according to Ada decoding
4352 rules. Returns NULL if there is no such minimal symbol. Names
4353 prefixed with "standard__" are handled specially: "standard__" is
4354 first stripped off, and only static and global symbols are searched. */
4356 struct minimal_symbol
*
4357 ada_lookup_simple_minsym (const char *name
)
4359 struct objfile
*objfile
;
4360 struct minimal_symbol
*msymbol
;
4363 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4365 name
+= sizeof ("standard__") - 1;
4369 wild_match
= (strstr (name
, "__") == NULL
);
4371 ALL_MSYMBOLS (objfile
, msymbol
)
4373 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4374 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4381 /* For all subprograms that statically enclose the subprogram of the
4382 selected frame, add symbols matching identifier NAME in DOMAIN
4383 and their blocks to the list of data in OBSTACKP, as for
4384 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4388 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4389 const char *name
, domain_enum
namespace,
4394 /* True if TYPE is definitely an artificial type supplied to a symbol
4395 for which no debugging information was given in the symbol file. */
4398 is_nondebugging_type (struct type
*type
)
4400 char *name
= ada_type_name (type
);
4401 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4404 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4405 duplicate other symbols in the list (The only case I know of where
4406 this happens is when object files containing stabs-in-ecoff are
4407 linked with files containing ordinary ecoff debugging symbols (or no
4408 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4409 Returns the number of items in the modified list. */
4412 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4419 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4420 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4421 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4423 for (j
= 0; j
< nsyms
; j
+= 1)
4426 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4427 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4428 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4429 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4430 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4431 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4434 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4435 syms
[k
- 1] = syms
[k
];
4448 /* Given a type that corresponds to a renaming entity, use the type name
4449 to extract the scope (package name or function name, fully qualified,
4450 and following the GNAT encoding convention) where this renaming has been
4451 defined. The string returned needs to be deallocated after use. */
4454 xget_renaming_scope (struct type
*renaming_type
)
4456 /* The renaming types adhere to the following convention:
4457 <scope>__<rename>___<XR extension>.
4458 So, to extract the scope, we search for the "___XR" extension,
4459 and then backtrack until we find the first "__". */
4461 const char *name
= type_name_no_tag (renaming_type
);
4462 char *suffix
= strstr (name
, "___XR");
4467 /* Now, backtrack a bit until we find the first "__". Start looking
4468 at suffix - 3, as the <rename> part is at least one character long. */
4470 for (last
= suffix
- 3; last
> name
; last
--)
4471 if (last
[0] == '_' && last
[1] == '_')
4474 /* Make a copy of scope and return it. */
4476 scope_len
= last
- name
;
4477 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4479 strncpy (scope
, name
, scope_len
);
4480 scope
[scope_len
] = '\0';
4485 /* Return nonzero if NAME corresponds to a package name. */
4488 is_package_name (const char *name
)
4490 /* Here, We take advantage of the fact that no symbols are generated
4491 for packages, while symbols are generated for each function.
4492 So the condition for NAME represent a package becomes equivalent
4493 to NAME not existing in our list of symbols. There is only one
4494 small complication with library-level functions (see below). */
4498 /* If it is a function that has not been defined at library level,
4499 then we should be able to look it up in the symbols. */
4500 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4503 /* Library-level function names start with "_ada_". See if function
4504 "_ada_" followed by NAME can be found. */
4506 /* Do a quick check that NAME does not contain "__", since library-level
4507 functions names cannot contain "__" in them. */
4508 if (strstr (name
, "__") != NULL
)
4511 fun_name
= xstrprintf ("_ada_%s", name
);
4513 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4516 /* Return nonzero if SYM corresponds to a renaming entity that is
4517 not visible from FUNCTION_NAME. */
4520 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4524 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4527 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4529 make_cleanup (xfree
, scope
);
4531 /* If the rename has been defined in a package, then it is visible. */
4532 if (is_package_name (scope
))
4535 /* Check that the rename is in the current function scope by checking
4536 that its name starts with SCOPE. */
4538 /* If the function name starts with "_ada_", it means that it is
4539 a library-level function. Strip this prefix before doing the
4540 comparison, as the encoding for the renaming does not contain
4542 if (strncmp (function_name
, "_ada_", 5) == 0)
4545 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4548 /* Remove entries from SYMS that corresponds to a renaming entity that
4549 is not visible from the function associated with CURRENT_BLOCK or
4550 that is superfluous due to the presence of more specific renaming
4551 information. Places surviving symbols in the initial entries of
4552 SYMS and returns the number of surviving symbols.
4555 First, in cases where an object renaming is implemented as a
4556 reference variable, GNAT may produce both the actual reference
4557 variable and the renaming encoding. In this case, we discard the
4560 Second, GNAT emits a type following a specified encoding for each renaming
4561 entity. Unfortunately, STABS currently does not support the definition
4562 of types that are local to a given lexical block, so all renamings types
4563 are emitted at library level. As a consequence, if an application
4564 contains two renaming entities using the same name, and a user tries to
4565 print the value of one of these entities, the result of the ada symbol
4566 lookup will also contain the wrong renaming type.
4568 This function partially covers for this limitation by attempting to
4569 remove from the SYMS list renaming symbols that should be visible
4570 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4571 method with the current information available. The implementation
4572 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4574 - When the user tries to print a rename in a function while there
4575 is another rename entity defined in a package: Normally, the
4576 rename in the function has precedence over the rename in the
4577 package, so the latter should be removed from the list. This is
4578 currently not the case.
4580 - This function will incorrectly remove valid renames if
4581 the CURRENT_BLOCK corresponds to a function which symbol name
4582 has been changed by an "Export" pragma. As a consequence,
4583 the user will be unable to print such rename entities. */
4586 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4587 int nsyms
, const struct block
*current_block
)
4589 struct symbol
*current_function
;
4590 char *current_function_name
;
4592 int is_new_style_renaming
;
4594 /* If there is both a renaming foo___XR... encoded as a variable and
4595 a simple variable foo in the same block, discard the latter.
4596 First, zero out such symbols, then compress. */
4597 is_new_style_renaming
= 0;
4598 for (i
= 0; i
< nsyms
; i
+= 1)
4600 struct symbol
*sym
= syms
[i
].sym
;
4601 struct block
*block
= syms
[i
].block
;
4605 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4607 name
= SYMBOL_LINKAGE_NAME (sym
);
4608 suffix
= strstr (name
, "___XR");
4612 int name_len
= suffix
- name
;
4614 is_new_style_renaming
= 1;
4615 for (j
= 0; j
< nsyms
; j
+= 1)
4616 if (i
!= j
&& syms
[j
].sym
!= NULL
4617 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4619 && block
== syms
[j
].block
)
4623 if (is_new_style_renaming
)
4627 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4628 if (syms
[j
].sym
!= NULL
)
4636 /* Extract the function name associated to CURRENT_BLOCK.
4637 Abort if unable to do so. */
4639 if (current_block
== NULL
)
4642 current_function
= block_function (current_block
);
4643 if (current_function
== NULL
)
4646 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4647 if (current_function_name
== NULL
)
4650 /* Check each of the symbols, and remove it from the list if it is
4651 a type corresponding to a renaming that is out of the scope of
4652 the current block. */
4657 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4658 == ADA_OBJECT_RENAMING
4659 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4662 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4663 syms
[j
- 1] = syms
[j
];
4673 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4674 scope and in global scopes, returning the number of matches. Sets
4675 *RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
4676 indicating the symbols found and the blocks and symbol tables (if
4677 any) in which they were found. This vector are transient---good only to
4678 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4679 symbol match within the nest of blocks whose innermost member is BLOCK0,
4680 is the one match returned (no other matches in that or
4681 enclosing blocks is returned). If there are any matches in or
4682 surrounding BLOCK0, then these alone are returned. Otherwise, the
4683 search extends to global and file-scope (static) symbol tables.
4684 Names prefixed with "standard__" are handled specially: "standard__"
4685 is first stripped off, and only static and global symbols are searched. */
4688 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4689 domain_enum
namespace,
4690 struct ada_symbol_info
**results
)
4694 struct partial_symtab
*ps
;
4695 struct blockvector
*bv
;
4696 struct objfile
*objfile
;
4697 struct block
*block
;
4699 struct minimal_symbol
*msymbol
;
4705 obstack_free (&symbol_list_obstack
, NULL
);
4706 obstack_init (&symbol_list_obstack
);
4710 /* Search specified block and its superiors. */
4712 wild_match
= (strstr (name0
, "__") == NULL
);
4714 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4715 needed, but adding const will
4716 have a cascade effect. */
4717 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4721 name
= name0
+ sizeof ("standard__") - 1;
4725 while (block
!= NULL
)
4728 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4729 namespace, NULL
, NULL
, wild_match
);
4731 /* If we found a non-function match, assume that's the one. */
4732 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4733 num_defns_collected (&symbol_list_obstack
)))
4736 block
= BLOCK_SUPERBLOCK (block
);
4739 /* If no luck so far, try to find NAME as a local symbol in some lexically
4740 enclosing subprogram. */
4741 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4742 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4743 name
, namespace, wild_match
);
4745 /* If we found ANY matches among non-global symbols, we're done. */
4747 if (num_defns_collected (&symbol_list_obstack
) > 0)
4751 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
, &s
))
4754 add_defn_to_vec (&symbol_list_obstack
, sym
, block
, s
);
4758 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4759 tables, and psymtab's. */
4761 ALL_PRIMARY_SYMTABS (objfile
, s
)
4764 bv
= BLOCKVECTOR (s
);
4765 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4766 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4767 objfile
, s
, wild_match
);
4770 if (namespace == VAR_DOMAIN
)
4772 ALL_MSYMBOLS (objfile
, msymbol
)
4774 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4776 switch (MSYMBOL_TYPE (msymbol
))
4778 case mst_solib_trampoline
:
4781 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4784 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4786 bv
= BLOCKVECTOR (s
);
4787 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4788 ada_add_block_symbols (&symbol_list_obstack
, block
,
4789 SYMBOL_LINKAGE_NAME (msymbol
),
4790 namespace, objfile
, s
, wild_match
);
4792 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4794 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4795 ada_add_block_symbols (&symbol_list_obstack
, block
,
4796 SYMBOL_LINKAGE_NAME (msymbol
),
4797 namespace, objfile
, s
,
4806 ALL_PSYMTABS (objfile
, ps
)
4810 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4812 s
= PSYMTAB_TO_SYMTAB (ps
);
4815 bv
= BLOCKVECTOR (s
);
4816 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4817 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4818 namespace, objfile
, s
, wild_match
);
4822 /* Now add symbols from all per-file blocks if we've gotten no hits
4823 (Not strictly correct, but perhaps better than an error).
4824 Do the symtabs first, then check the psymtabs. */
4826 if (num_defns_collected (&symbol_list_obstack
) == 0)
4829 ALL_PRIMARY_SYMTABS (objfile
, s
)
4832 bv
= BLOCKVECTOR (s
);
4833 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4834 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4835 objfile
, s
, wild_match
);
4838 ALL_PSYMTABS (objfile
, ps
)
4842 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4844 s
= PSYMTAB_TO_SYMTAB (ps
);
4845 bv
= BLOCKVECTOR (s
);
4848 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4849 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4850 namespace, objfile
, s
, wild_match
);
4856 ndefns
= num_defns_collected (&symbol_list_obstack
);
4857 *results
= defns_collected (&symbol_list_obstack
, 1);
4859 ndefns
= remove_extra_symbols (*results
, ndefns
);
4862 cache_symbol (name0
, namespace, NULL
, NULL
, NULL
);
4864 if (ndefns
== 1 && cacheIfUnique
)
4865 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
,
4866 (*results
)[0].symtab
);
4868 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4874 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4875 domain_enum
namespace, struct block
**block_found
)
4877 struct ada_symbol_info
*candidates
;
4880 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4882 if (n_candidates
== 0)
4885 if (block_found
!= NULL
)
4886 *block_found
= candidates
[0].block
;
4888 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4891 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4892 scope and in global scopes, or NULL if none. NAME is folded and
4893 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4894 choosing the first symbol if there are multiple choices.
4895 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4896 table in which the symbol was found (in both cases, these
4897 assignments occur only if the pointers are non-null). */
4899 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4900 domain_enum
namespace, int *is_a_field_of_this
)
4902 if (is_a_field_of_this
!= NULL
)
4903 *is_a_field_of_this
= 0;
4906 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4907 block0
, namespace, NULL
);
4910 static struct symbol
*
4911 ada_lookup_symbol_nonlocal (const char *name
,
4912 const char *linkage_name
,
4913 const struct block
*block
,
4914 const domain_enum domain
)
4916 if (linkage_name
== NULL
)
4917 linkage_name
= name
;
4918 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4923 /* True iff STR is a possible encoded suffix of a normal Ada name
4924 that is to be ignored for matching purposes. Suffixes of parallel
4925 names (e.g., XVE) are not included here. Currently, the possible suffixes
4926 are given by either of the regular expression:
4928 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4929 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4930 _E[0-9]+[bs]$ [protected object entry suffixes]
4931 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4933 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4934 match is performed. This sequence is used to differentiate homonyms,
4935 is an optional part of a valid name suffix. */
4938 is_name_suffix (const char *str
)
4941 const char *matching
;
4942 const int len
= strlen (str
);
4944 /* Skip optional leading __[0-9]+. */
4946 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4949 while (isdigit (str
[0]))
4955 if (str
[0] == '.' || str
[0] == '$')
4958 while (isdigit (matching
[0]))
4960 if (matching
[0] == '\0')
4966 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4969 while (isdigit (matching
[0]))
4971 if (matching
[0] == '\0')
4976 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4977 with a N at the end. Unfortunately, the compiler uses the same
4978 convention for other internal types it creates. So treating
4979 all entity names that end with an "N" as a name suffix causes
4980 some regressions. For instance, consider the case of an enumerated
4981 type. To support the 'Image attribute, it creates an array whose
4983 Having a single character like this as a suffix carrying some
4984 information is a bit risky. Perhaps we should change the encoding
4985 to be something like "_N" instead. In the meantime, do not do
4986 the following check. */
4987 /* Protected Object Subprograms */
4988 if (len
== 1 && str
[0] == 'N')
4993 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4996 while (isdigit (matching
[0]))
4998 if ((matching
[0] == 'b' || matching
[0] == 's')
4999 && matching
[1] == '\0')
5003 /* ??? We should not modify STR directly, as we are doing below. This
5004 is fine in this case, but may become problematic later if we find
5005 that this alternative did not work, and want to try matching
5006 another one from the begining of STR. Since we modified it, we
5007 won't be able to find the begining of the string anymore! */
5011 while (str
[0] != '_' && str
[0] != '\0')
5013 if (str
[0] != 'n' && str
[0] != 'b')
5019 if (str
[0] == '\000')
5024 if (str
[1] != '_' || str
[2] == '\000')
5028 if (strcmp (str
+ 3, "JM") == 0)
5030 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5031 the LJM suffix in favor of the JM one. But we will
5032 still accept LJM as a valid suffix for a reasonable
5033 amount of time, just to allow ourselves to debug programs
5034 compiled using an older version of GNAT. */
5035 if (strcmp (str
+ 3, "LJM") == 0)
5039 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5040 || str
[4] == 'U' || str
[4] == 'P')
5042 if (str
[4] == 'R' && str
[5] != 'T')
5046 if (!isdigit (str
[2]))
5048 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5049 if (!isdigit (str
[k
]) && str
[k
] != '_')
5053 if (str
[0] == '$' && isdigit (str
[1]))
5055 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5056 if (!isdigit (str
[k
]) && str
[k
] != '_')
5063 /* Return nonzero if the given string starts with a dot ('.')
5064 followed by zero or more digits.
5066 Note: brobecker/2003-11-10: A forward declaration has not been
5067 added at the begining of this file yet, because this function
5068 is only used to work around a problem found during wild matching
5069 when trying to match minimal symbol names against symbol names
5070 obtained from dwarf-2 data. This function is therefore currently
5071 only used in wild_match() and is likely to be deleted when the
5072 problem in dwarf-2 is fixed. */
5075 is_dot_digits_suffix (const char *str
)
5081 while (isdigit (str
[0]))
5083 return (str
[0] == '\0');
5086 /* Return non-zero if the string starting at NAME and ending before
5087 NAME_END contains no capital letters. */
5090 is_valid_name_for_wild_match (const char *name0
)
5092 const char *decoded_name
= ada_decode (name0
);
5095 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5096 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5102 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5103 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5104 informational suffixes of NAME (i.e., for which is_name_suffix is
5108 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5115 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
5116 stored in the symbol table for nested function names is sometimes
5117 different from the name of the associated entity stored in
5118 the dwarf-2 data: This is the case for nested subprograms, where
5119 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
5120 while the symbol name from the dwarf-2 data does not.
5122 Although the DWARF-2 standard documents that entity names stored
5123 in the dwarf-2 data should be identical to the name as seen in
5124 the source code, GNAT takes a different approach as we already use
5125 a special encoding mechanism to convey the information so that
5126 a C debugger can still use the information generated to debug
5127 Ada programs. A corollary is that the symbol names in the dwarf-2
5128 data should match the names found in the symbol table. I therefore
5129 consider this issue as a compiler defect.
5131 Until the compiler is properly fixed, we work-around the problem
5132 by ignoring such suffixes during the match. We do so by making
5133 a copy of PATN0 and NAME0, and then by stripping such a suffix
5134 if present. We then perform the match on the resulting strings. */
5137 name_len
= strlen (name0
);
5139 name
= name_start
= (char *) alloca ((name_len
+ 1) * sizeof (char));
5140 strcpy (name
, name0
);
5141 dot
= strrchr (name
, '.');
5142 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5145 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
5146 strncpy (patn
, patn0
, patn_len
);
5147 patn
[patn_len
] = '\0';
5148 dot
= strrchr (patn
, '.');
5149 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5152 patn_len
= dot
- patn
;
5156 /* Now perform the wild match. */
5158 name_len
= strlen (name
);
5159 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
5160 && strncmp (patn
, name
+ 5, patn_len
) == 0
5161 && is_name_suffix (name
+ patn_len
+ 5))
5164 while (name_len
>= patn_len
)
5166 if (strncmp (patn
, name
, patn_len
) == 0
5167 && is_name_suffix (name
+ patn_len
))
5168 return (name
== name_start
|| is_valid_name_for_wild_match (name0
));
5175 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
5180 if (!islower (name
[2]))
5187 if (!islower (name
[1]))
5198 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5199 vector *defn_symbols, updating the list of symbols in OBSTACKP
5200 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5201 OBJFILE is the section containing BLOCK.
5202 SYMTAB is recorded with each symbol added. */
5205 ada_add_block_symbols (struct obstack
*obstackp
,
5206 struct block
*block
, const char *name
,
5207 domain_enum domain
, struct objfile
*objfile
,
5208 struct symtab
*symtab
, int wild
)
5210 struct dict_iterator iter
;
5211 int name_len
= strlen (name
);
5212 /* A matching argument symbol, if any. */
5213 struct symbol
*arg_sym
;
5214 /* Set true when we find a matching non-argument symbol. */
5223 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5225 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5226 SYMBOL_DOMAIN (sym
), domain
)
5227 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5229 switch (SYMBOL_CLASS (sym
))
5235 case LOC_REGPARM_ADDR
:
5236 case LOC_BASEREG_ARG
:
5237 case LOC_COMPUTED_ARG
:
5240 case LOC_UNRESOLVED
:
5244 add_defn_to_vec (obstackp
,
5245 fixup_symbol_section (sym
, objfile
),
5254 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5256 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5257 SYMBOL_DOMAIN (sym
), domain
))
5259 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5261 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5263 switch (SYMBOL_CLASS (sym
))
5269 case LOC_REGPARM_ADDR
:
5270 case LOC_BASEREG_ARG
:
5271 case LOC_COMPUTED_ARG
:
5274 case LOC_UNRESOLVED
:
5278 add_defn_to_vec (obstackp
,
5279 fixup_symbol_section (sym
, objfile
),
5288 if (!found_sym
&& arg_sym
!= NULL
)
5290 add_defn_to_vec (obstackp
,
5291 fixup_symbol_section (arg_sym
, objfile
),
5300 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5302 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5303 SYMBOL_DOMAIN (sym
), domain
))
5307 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5310 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5312 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5317 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5319 switch (SYMBOL_CLASS (sym
))
5325 case LOC_REGPARM_ADDR
:
5326 case LOC_BASEREG_ARG
:
5327 case LOC_COMPUTED_ARG
:
5330 case LOC_UNRESOLVED
:
5334 add_defn_to_vec (obstackp
,
5335 fixup_symbol_section (sym
, objfile
),
5343 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5344 They aren't parameters, right? */
5345 if (!found_sym
&& arg_sym
!= NULL
)
5347 add_defn_to_vec (obstackp
,
5348 fixup_symbol_section (arg_sym
, objfile
),
5355 /* Symbol Completion */
5357 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5358 name in a form that's appropriate for the completion. The result
5359 does not need to be deallocated, but is only good until the next call.
5361 TEXT_LEN is equal to the length of TEXT.
5362 Perform a wild match if WILD_MATCH is set.
5363 ENCODED should be set if TEXT represents the start of a symbol name
5364 in its encoded form. */
5367 symbol_completion_match (const char *sym_name
,
5368 const char *text
, int text_len
,
5369 int wild_match
, int encoded
)
5372 const int verbatim_match
= (text
[0] == '<');
5377 /* Strip the leading angle bracket. */
5382 /* First, test against the fully qualified name of the symbol. */
5384 if (strncmp (sym_name
, text
, text_len
) == 0)
5387 if (match
&& !encoded
)
5389 /* One needed check before declaring a positive match is to verify
5390 that iff we are doing a verbatim match, the decoded version
5391 of the symbol name starts with '<'. Otherwise, this symbol name
5392 is not a suitable completion. */
5393 const char *sym_name_copy
= sym_name
;
5394 int has_angle_bracket
;
5396 sym_name
= ada_decode (sym_name
);
5397 has_angle_bracket
= (sym_name
[0] == '<');
5398 match
= (has_angle_bracket
== verbatim_match
);
5399 sym_name
= sym_name_copy
;
5402 if (match
&& !verbatim_match
)
5404 /* When doing non-verbatim match, another check that needs to
5405 be done is to verify that the potentially matching symbol name
5406 does not include capital letters, because the ada-mode would
5407 not be able to understand these symbol names without the
5408 angle bracket notation. */
5411 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5416 /* Second: Try wild matching... */
5418 if (!match
&& wild_match
)
5420 /* Since we are doing wild matching, this means that TEXT
5421 may represent an unqualified symbol name. We therefore must
5422 also compare TEXT against the unqualified name of the symbol. */
5423 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5425 if (strncmp (sym_name
, text
, text_len
) == 0)
5429 /* Finally: If we found a mach, prepare the result to return. */
5435 sym_name
= add_angle_brackets (sym_name
);
5438 sym_name
= ada_decode (sym_name
);
5443 typedef char *char_ptr
;
5444 DEF_VEC_P (char_ptr
);
5446 /* A companion function to ada_make_symbol_completion_list().
5447 Check if SYM_NAME represents a symbol which name would be suitable
5448 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5449 it is appended at the end of the given string vector SV.
5451 ORIG_TEXT is the string original string from the user command
5452 that needs to be completed. WORD is the entire command on which
5453 completion should be performed. These two parameters are used to
5454 determine which part of the symbol name should be added to the
5456 if WILD_MATCH is set, then wild matching is performed.
5457 ENCODED should be set if TEXT represents a symbol name in its
5458 encoded formed (in which case the completion should also be
5462 symbol_completion_add (VEC(char_ptr
) **sv
,
5463 const char *sym_name
,
5464 const char *text
, int text_len
,
5465 const char *orig_text
, const char *word
,
5466 int wild_match
, int encoded
)
5468 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5469 wild_match
, encoded
);
5475 /* We found a match, so add the appropriate completion to the given
5478 if (word
== orig_text
)
5480 completion
= xmalloc (strlen (match
) + 5);
5481 strcpy (completion
, match
);
5483 else if (word
> orig_text
)
5485 /* Return some portion of sym_name. */
5486 completion
= xmalloc (strlen (match
) + 5);
5487 strcpy (completion
, match
+ (word
- orig_text
));
5491 /* Return some of ORIG_TEXT plus sym_name. */
5492 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5493 strncpy (completion
, word
, orig_text
- word
);
5494 completion
[orig_text
- word
] = '\0';
5495 strcat (completion
, match
);
5498 VEC_safe_push (char_ptr
, *sv
, completion
);
5501 /* Return a list of possible symbol names completing TEXT0. The list
5502 is NULL terminated. WORD is the entire command on which completion
5506 ada_make_symbol_completion_list (char *text0
, char *word
)
5512 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5515 struct partial_symtab
*ps
;
5516 struct minimal_symbol
*msymbol
;
5517 struct objfile
*objfile
;
5518 struct block
*b
, *surrounding_static_block
= 0;
5520 struct dict_iterator iter
;
5522 if (text0
[0] == '<')
5524 text
= xstrdup (text0
);
5525 make_cleanup (xfree
, text
);
5526 text_len
= strlen (text
);
5532 text
= xstrdup (ada_encode (text0
));
5533 make_cleanup (xfree
, text
);
5534 text_len
= strlen (text
);
5535 for (i
= 0; i
< text_len
; i
++)
5536 text
[i
] = tolower (text
[i
]);
5538 encoded
= (strstr (text0
, "__") != NULL
);
5539 /* If the name contains a ".", then the user is entering a fully
5540 qualified entity name, and the match must not be done in wild
5541 mode. Similarly, if the user wants to complete what looks like
5542 an encoded name, the match must not be done in wild mode. */
5543 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5546 /* First, look at the partial symtab symbols. */
5547 ALL_PSYMTABS (objfile
, ps
)
5549 struct partial_symbol
**psym
;
5551 /* If the psymtab's been read in we'll get it when we search
5552 through the blockvector. */
5556 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5557 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5558 + ps
->n_global_syms
); psym
++)
5561 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5562 text
, text_len
, text0
, word
,
5563 wild_match
, encoded
);
5566 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5567 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5568 + ps
->n_static_syms
); psym
++)
5571 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5572 text
, text_len
, text0
, word
,
5573 wild_match
, encoded
);
5577 /* At this point scan through the misc symbol vectors and add each
5578 symbol you find to the list. Eventually we want to ignore
5579 anything that isn't a text symbol (everything else will be
5580 handled by the psymtab code above). */
5582 ALL_MSYMBOLS (objfile
, msymbol
)
5585 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5586 text
, text_len
, text0
, word
, wild_match
, encoded
);
5589 /* Search upwards from currently selected frame (so that we can
5590 complete on local vars. */
5592 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5594 if (!BLOCK_SUPERBLOCK (b
))
5595 surrounding_static_block
= b
; /* For elmin of dups */
5597 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5599 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5600 text
, text_len
, text0
, word
,
5601 wild_match
, encoded
);
5605 /* Go through the symtabs and check the externs and statics for
5606 symbols which match. */
5608 ALL_SYMTABS (objfile
, s
)
5611 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5612 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5614 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5615 text
, text_len
, text0
, word
,
5616 wild_match
, encoded
);
5620 ALL_SYMTABS (objfile
, s
)
5623 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5624 /* Don't do this block twice. */
5625 if (b
== surrounding_static_block
)
5627 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5629 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5630 text
, text_len
, text0
, word
,
5631 wild_match
, encoded
);
5635 /* Append the closing NULL entry. */
5636 VEC_safe_push (char_ptr
, completions
, NULL
);
5638 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5639 return the copy. It's unfortunate that we have to make a copy
5640 of an array that we're about to destroy, but there is nothing much
5641 we can do about it. Fortunately, it's typically not a very large
5644 const size_t completions_size
=
5645 VEC_length (char_ptr
, completions
) * sizeof (char *);
5646 char **result
= malloc (completions_size
);
5648 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5650 VEC_free (char_ptr
, completions
);
5657 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5658 for tagged types. */
5661 ada_is_dispatch_table_ptr_type (struct type
*type
)
5665 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5668 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5672 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5675 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5676 to be invisible to users. */
5679 ada_is_ignored_field (struct type
*type
, int field_num
)
5681 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5684 /* Check the name of that field. */
5686 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5688 /* Anonymous field names should not be printed.
5689 brobecker/2007-02-20: I don't think this can actually happen
5690 but we don't want to print the value of annonymous fields anyway. */
5694 /* A field named "_parent" is internally generated by GNAT for
5695 tagged types, and should not be printed either. */
5696 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5700 /* If this is the dispatch table of a tagged type, then ignore. */
5701 if (ada_is_tagged_type (type
, 1)
5702 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5705 /* Not a special field, so it should not be ignored. */
5709 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5710 pointer or reference type whose ultimate target has a tag field. */
5713 ada_is_tagged_type (struct type
*type
, int refok
)
5715 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5718 /* True iff TYPE represents the type of X'Tag */
5721 ada_is_tag_type (struct type
*type
)
5723 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5727 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5728 return (name
!= NULL
5729 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5733 /* The type of the tag on VAL. */
5736 ada_tag_type (struct value
*val
)
5738 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5741 /* The value of the tag on VAL. */
5744 ada_value_tag (struct value
*val
)
5746 return ada_value_struct_elt (val
, "_tag", 0);
5749 /* The value of the tag on the object of type TYPE whose contents are
5750 saved at VALADDR, if it is non-null, or is at memory address
5753 static struct value
*
5754 value_tag_from_contents_and_address (struct type
*type
,
5755 const gdb_byte
*valaddr
,
5758 int tag_byte_offset
, dummy1
, dummy2
;
5759 struct type
*tag_type
;
5760 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5763 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5765 : valaddr
+ tag_byte_offset
);
5766 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5768 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5773 static struct type
*
5774 type_from_tag (struct value
*tag
)
5776 const char *type_name
= ada_tag_name (tag
);
5777 if (type_name
!= NULL
)
5778 return ada_find_any_type (ada_encode (type_name
));
5789 static int ada_tag_name_1 (void *);
5790 static int ada_tag_name_2 (struct tag_args
*);
5792 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5793 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5794 The value stored in ARGS->name is valid until the next call to
5798 ada_tag_name_1 (void *args0
)
5800 struct tag_args
*args
= (struct tag_args
*) args0
;
5801 static char name
[1024];
5805 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5807 return ada_tag_name_2 (args
);
5808 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5811 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5812 for (p
= name
; *p
!= '\0'; p
+= 1)
5819 /* Utility function for ada_tag_name_1 that tries the second
5820 representation for the dispatch table (in which there is no
5821 explicit 'tsd' field in the referent of the tag pointer, and instead
5822 the tsd pointer is stored just before the dispatch table. */
5825 ada_tag_name_2 (struct tag_args
*args
)
5827 struct type
*info_type
;
5828 static char name
[1024];
5830 struct value
*val
, *valp
;
5833 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5834 if (info_type
== NULL
)
5836 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5837 valp
= value_cast (info_type
, args
->tag
);
5840 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5843 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5846 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5847 for (p
= name
; *p
!= '\0'; p
+= 1)
5854 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5858 ada_tag_name (struct value
*tag
)
5860 struct tag_args args
;
5861 if (!ada_is_tag_type (value_type (tag
)))
5865 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5869 /* The parent type of TYPE, or NULL if none. */
5872 ada_parent_type (struct type
*type
)
5876 type
= ada_check_typedef (type
);
5878 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5881 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5882 if (ada_is_parent_field (type
, i
))
5883 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5888 /* True iff field number FIELD_NUM of structure type TYPE contains the
5889 parent-type (inherited) fields of a derived type. Assumes TYPE is
5890 a structure type with at least FIELD_NUM+1 fields. */
5893 ada_is_parent_field (struct type
*type
, int field_num
)
5895 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5896 return (name
!= NULL
5897 && (strncmp (name
, "PARENT", 6) == 0
5898 || strncmp (name
, "_parent", 7) == 0));
5901 /* True iff field number FIELD_NUM of structure type TYPE is a
5902 transparent wrapper field (which should be silently traversed when doing
5903 field selection and flattened when printing). Assumes TYPE is a
5904 structure type with at least FIELD_NUM+1 fields. Such fields are always
5908 ada_is_wrapper_field (struct type
*type
, int field_num
)
5910 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5911 return (name
!= NULL
5912 && (strncmp (name
, "PARENT", 6) == 0
5913 || strcmp (name
, "REP") == 0
5914 || strncmp (name
, "_parent", 7) == 0
5915 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5918 /* True iff field number FIELD_NUM of structure or union type TYPE
5919 is a variant wrapper. Assumes TYPE is a structure type with at least
5920 FIELD_NUM+1 fields. */
5923 ada_is_variant_part (struct type
*type
, int field_num
)
5925 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5926 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5927 || (is_dynamic_field (type
, field_num
)
5928 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5929 == TYPE_CODE_UNION
)));
5932 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5933 whose discriminants are contained in the record type OUTER_TYPE,
5934 returns the type of the controlling discriminant for the variant. */
5937 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5939 char *name
= ada_variant_discrim_name (var_type
);
5941 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5943 return builtin_type_int
;
5948 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5949 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5950 represents a 'when others' clause; otherwise 0. */
5953 ada_is_others_clause (struct type
*type
, int field_num
)
5955 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5956 return (name
!= NULL
&& name
[0] == 'O');
5959 /* Assuming that TYPE0 is the type of the variant part of a record,
5960 returns the name of the discriminant controlling the variant.
5961 The value is valid until the next call to ada_variant_discrim_name. */
5964 ada_variant_discrim_name (struct type
*type0
)
5966 static char *result
= NULL
;
5967 static size_t result_len
= 0;
5970 const char *discrim_end
;
5971 const char *discrim_start
;
5973 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5974 type
= TYPE_TARGET_TYPE (type0
);
5978 name
= ada_type_name (type
);
5980 if (name
== NULL
|| name
[0] == '\000')
5983 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5986 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5989 if (discrim_end
== name
)
5992 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5995 if (discrim_start
== name
+ 1)
5997 if ((discrim_start
> name
+ 3
5998 && strncmp (discrim_start
- 3, "___", 3) == 0)
5999 || discrim_start
[-1] == '.')
6003 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6004 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6005 result
[discrim_end
- discrim_start
] = '\0';
6009 /* Scan STR for a subtype-encoded number, beginning at position K.
6010 Put the position of the character just past the number scanned in
6011 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6012 Return 1 if there was a valid number at the given position, and 0
6013 otherwise. A "subtype-encoded" number consists of the absolute value
6014 in decimal, followed by the letter 'm' to indicate a negative number.
6015 Assumes 0m does not occur. */
6018 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6022 if (!isdigit (str
[k
]))
6025 /* Do it the hard way so as not to make any assumption about
6026 the relationship of unsigned long (%lu scan format code) and
6029 while (isdigit (str
[k
]))
6031 RU
= RU
* 10 + (str
[k
] - '0');
6038 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6044 /* NOTE on the above: Technically, C does not say what the results of
6045 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6046 number representable as a LONGEST (although either would probably work
6047 in most implementations). When RU>0, the locution in the then branch
6048 above is always equivalent to the negative of RU. */
6055 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6056 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6057 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6060 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6062 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6075 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6084 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6085 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6087 if (val
>= L
&& val
<= U
)
6099 /* FIXME: Lots of redundancy below. Try to consolidate. */
6101 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6102 ARG_TYPE, extract and return the value of one of its (non-static)
6103 fields. FIELDNO says which field. Differs from value_primitive_field
6104 only in that it can handle packed values of arbitrary type. */
6106 static struct value
*
6107 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6108 struct type
*arg_type
)
6112 arg_type
= ada_check_typedef (arg_type
);
6113 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6115 /* Handle packed fields. */
6117 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6119 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6120 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6122 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6123 offset
+ bit_pos
/ 8,
6124 bit_pos
% 8, bit_size
, type
);
6127 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6130 /* Find field with name NAME in object of type TYPE. If found,
6131 set the following for each argument that is non-null:
6132 - *FIELD_TYPE_P to the field's type;
6133 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6134 an object of that type;
6135 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6136 - *BIT_SIZE_P to its size in bits if the field is packed, and
6138 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6139 fields up to but not including the desired field, or by the total
6140 number of fields if not found. A NULL value of NAME never
6141 matches; the function just counts visible fields in this case.
6143 Returns 1 if found, 0 otherwise. */
6146 find_struct_field (char *name
, struct type
*type
, int offset
,
6147 struct type
**field_type_p
,
6148 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6153 type
= ada_check_typedef (type
);
6155 if (field_type_p
!= NULL
)
6156 *field_type_p
= NULL
;
6157 if (byte_offset_p
!= NULL
)
6159 if (bit_offset_p
!= NULL
)
6161 if (bit_size_p
!= NULL
)
6164 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6166 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6167 int fld_offset
= offset
+ bit_pos
/ 8;
6168 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6170 if (t_field_name
== NULL
)
6173 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6175 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6176 if (field_type_p
!= NULL
)
6177 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6178 if (byte_offset_p
!= NULL
)
6179 *byte_offset_p
= fld_offset
;
6180 if (bit_offset_p
!= NULL
)
6181 *bit_offset_p
= bit_pos
% 8;
6182 if (bit_size_p
!= NULL
)
6183 *bit_size_p
= bit_size
;
6186 else if (ada_is_wrapper_field (type
, i
))
6188 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6189 field_type_p
, byte_offset_p
, bit_offset_p
,
6190 bit_size_p
, index_p
))
6193 else if (ada_is_variant_part (type
, i
))
6195 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6198 struct type
*field_type
6199 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6201 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6203 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6205 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6206 field_type_p
, byte_offset_p
,
6207 bit_offset_p
, bit_size_p
, index_p
))
6211 else if (index_p
!= NULL
)
6217 /* Number of user-visible fields in record type TYPE. */
6220 num_visible_fields (struct type
*type
)
6224 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6228 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6229 and search in it assuming it has (class) type TYPE.
6230 If found, return value, else return NULL.
6232 Searches recursively through wrapper fields (e.g., '_parent'). */
6234 static struct value
*
6235 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6239 type
= ada_check_typedef (type
);
6241 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6243 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6245 if (t_field_name
== NULL
)
6248 else if (field_name_match (t_field_name
, name
))
6249 return ada_value_primitive_field (arg
, offset
, i
, type
);
6251 else if (ada_is_wrapper_field (type
, i
))
6253 struct value
*v
= /* Do not let indent join lines here. */
6254 ada_search_struct_field (name
, arg
,
6255 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6256 TYPE_FIELD_TYPE (type
, i
));
6261 else if (ada_is_variant_part (type
, i
))
6263 /* PNH: Do we ever get here? See find_struct_field. */
6265 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6266 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6268 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6270 struct value
*v
= ada_search_struct_field
/* Force line break. */
6272 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6273 TYPE_FIELD_TYPE (field_type
, j
));
6282 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6283 int, struct type
*);
6286 /* Return field #INDEX in ARG, where the index is that returned by
6287 * find_struct_field through its INDEX_P argument. Adjust the address
6288 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6289 * If found, return value, else return NULL. */
6291 static struct value
*
6292 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6295 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6299 /* Auxiliary function for ada_index_struct_field. Like
6300 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6303 static struct value
*
6304 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6308 type
= ada_check_typedef (type
);
6310 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6312 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6314 else if (ada_is_wrapper_field (type
, i
))
6316 struct value
*v
= /* Do not let indent join lines here. */
6317 ada_index_struct_field_1 (index_p
, arg
,
6318 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6319 TYPE_FIELD_TYPE (type
, i
));
6324 else if (ada_is_variant_part (type
, i
))
6326 /* PNH: Do we ever get here? See ada_search_struct_field,
6327 find_struct_field. */
6328 error (_("Cannot assign this kind of variant record"));
6330 else if (*index_p
== 0)
6331 return ada_value_primitive_field (arg
, offset
, i
, type
);
6338 /* Given ARG, a value of type (pointer or reference to a)*
6339 structure/union, extract the component named NAME from the ultimate
6340 target structure/union and return it as a value with its
6341 appropriate type. If ARG is a pointer or reference and the field
6342 is not packed, returns a reference to the field, otherwise the
6343 value of the field (an lvalue if ARG is an lvalue).
6345 The routine searches for NAME among all members of the structure itself
6346 and (recursively) among all members of any wrapper members
6349 If NO_ERR, then simply return NULL in case of error, rather than
6353 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6355 struct type
*t
, *t1
;
6359 t1
= t
= ada_check_typedef (value_type (arg
));
6360 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6362 t1
= TYPE_TARGET_TYPE (t
);
6365 t1
= ada_check_typedef (t1
);
6366 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6368 arg
= coerce_ref (arg
);
6373 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6375 t1
= TYPE_TARGET_TYPE (t
);
6378 t1
= ada_check_typedef (t1
);
6379 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6381 arg
= value_ind (arg
);
6388 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6392 v
= ada_search_struct_field (name
, arg
, 0, t
);
6395 int bit_offset
, bit_size
, byte_offset
;
6396 struct type
*field_type
;
6399 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6400 address
= value_as_address (arg
);
6402 address
= unpack_pointer (t
, value_contents (arg
));
6404 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6405 if (find_struct_field (name
, t1
, 0,
6406 &field_type
, &byte_offset
, &bit_offset
,
6411 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6412 arg
= ada_coerce_ref (arg
);
6414 arg
= ada_value_ind (arg
);
6415 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6416 bit_offset
, bit_size
,
6420 v
= value_from_pointer (lookup_reference_type (field_type
),
6421 address
+ byte_offset
);
6425 if (v
!= NULL
|| no_err
)
6428 error (_("There is no member named %s."), name
);
6434 error (_("Attempt to extract a component of a value that is not a record."));
6437 /* Given a type TYPE, look up the type of the component of type named NAME.
6438 If DISPP is non-null, add its byte displacement from the beginning of a
6439 structure (pointed to by a value) of type TYPE to *DISPP (does not
6440 work for packed fields).
6442 Matches any field whose name has NAME as a prefix, possibly
6445 TYPE can be either a struct or union. If REFOK, TYPE may also
6446 be a (pointer or reference)+ to a struct or union, and the
6447 ultimate target type will be searched.
6449 Looks recursively into variant clauses and parent types.
6451 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6452 TYPE is not a type of the right kind. */
6454 static struct type
*
6455 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6456 int noerr
, int *dispp
)
6463 if (refok
&& type
!= NULL
)
6466 type
= ada_check_typedef (type
);
6467 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6468 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6470 type
= TYPE_TARGET_TYPE (type
);
6474 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6475 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6481 target_terminal_ours ();
6482 gdb_flush (gdb_stdout
);
6484 error (_("Type (null) is not a structure or union type"));
6487 /* XXX: type_sprint */
6488 fprintf_unfiltered (gdb_stderr
, _("Type "));
6489 type_print (type
, "", gdb_stderr
, -1);
6490 error (_(" is not a structure or union type"));
6495 type
= to_static_fixed_type (type
);
6497 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6499 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6503 if (t_field_name
== NULL
)
6506 else if (field_name_match (t_field_name
, name
))
6509 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6510 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6513 else if (ada_is_wrapper_field (type
, i
))
6516 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6521 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6526 else if (ada_is_variant_part (type
, i
))
6529 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6531 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6534 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6539 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6550 target_terminal_ours ();
6551 gdb_flush (gdb_stdout
);
6554 /* XXX: type_sprint */
6555 fprintf_unfiltered (gdb_stderr
, _("Type "));
6556 type_print (type
, "", gdb_stderr
, -1);
6557 error (_(" has no component named <null>"));
6561 /* XXX: type_sprint */
6562 fprintf_unfiltered (gdb_stderr
, _("Type "));
6563 type_print (type
, "", gdb_stderr
, -1);
6564 error (_(" has no component named %s"), name
);
6571 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6572 within a value of type OUTER_TYPE that is stored in GDB at
6573 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6574 numbering from 0) is applicable. Returns -1 if none are. */
6577 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6578 const gdb_byte
*outer_valaddr
)
6582 char *discrim_name
= ada_variant_discrim_name (var_type
);
6583 struct value
*outer
;
6584 struct value
*discrim
;
6585 LONGEST discrim_val
;
6587 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6588 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6589 if (discrim
== NULL
)
6591 discrim_val
= value_as_long (discrim
);
6594 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6596 if (ada_is_others_clause (var_type
, i
))
6598 else if (ada_in_variant (discrim_val
, var_type
, i
))
6602 return others_clause
;
6607 /* Dynamic-Sized Records */
6609 /* Strategy: The type ostensibly attached to a value with dynamic size
6610 (i.e., a size that is not statically recorded in the debugging
6611 data) does not accurately reflect the size or layout of the value.
6612 Our strategy is to convert these values to values with accurate,
6613 conventional types that are constructed on the fly. */
6615 /* There is a subtle and tricky problem here. In general, we cannot
6616 determine the size of dynamic records without its data. However,
6617 the 'struct value' data structure, which GDB uses to represent
6618 quantities in the inferior process (the target), requires the size
6619 of the type at the time of its allocation in order to reserve space
6620 for GDB's internal copy of the data. That's why the
6621 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6622 rather than struct value*s.
6624 However, GDB's internal history variables ($1, $2, etc.) are
6625 struct value*s containing internal copies of the data that are not, in
6626 general, the same as the data at their corresponding addresses in
6627 the target. Fortunately, the types we give to these values are all
6628 conventional, fixed-size types (as per the strategy described
6629 above), so that we don't usually have to perform the
6630 'to_fixed_xxx_type' conversions to look at their values.
6631 Unfortunately, there is one exception: if one of the internal
6632 history variables is an array whose elements are unconstrained
6633 records, then we will need to create distinct fixed types for each
6634 element selected. */
6636 /* The upshot of all of this is that many routines take a (type, host
6637 address, target address) triple as arguments to represent a value.
6638 The host address, if non-null, is supposed to contain an internal
6639 copy of the relevant data; otherwise, the program is to consult the
6640 target at the target address. */
6642 /* Assuming that VAL0 represents a pointer value, the result of
6643 dereferencing it. Differs from value_ind in its treatment of
6644 dynamic-sized types. */
6647 ada_value_ind (struct value
*val0
)
6649 struct value
*val
= unwrap_value (value_ind (val0
));
6650 return ada_to_fixed_value (val
);
6653 /* The value resulting from dereferencing any "reference to"
6654 qualifiers on VAL0. */
6656 static struct value
*
6657 ada_coerce_ref (struct value
*val0
)
6659 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6661 struct value
*val
= val0
;
6662 val
= coerce_ref (val
);
6663 val
= unwrap_value (val
);
6664 return ada_to_fixed_value (val
);
6670 /* Return OFF rounded upward if necessary to a multiple of
6671 ALIGNMENT (a power of 2). */
6674 align_value (unsigned int off
, unsigned int alignment
)
6676 return (off
+ alignment
- 1) & ~(alignment
- 1);
6679 /* Return the bit alignment required for field #F of template type TYPE. */
6682 field_alignment (struct type
*type
, int f
)
6684 const char *name
= TYPE_FIELD_NAME (type
, f
);
6688 /* The field name should never be null, unless the debugging information
6689 is somehow malformed. In this case, we assume the field does not
6690 require any alignment. */
6694 len
= strlen (name
);
6696 if (!isdigit (name
[len
- 1]))
6699 if (isdigit (name
[len
- 2]))
6700 align_offset
= len
- 2;
6702 align_offset
= len
- 1;
6704 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6705 return TARGET_CHAR_BIT
;
6707 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6710 /* Find a symbol named NAME. Ignores ambiguity. */
6713 ada_find_any_symbol (const char *name
)
6717 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6718 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6721 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6725 /* Find a type named NAME. Ignores ambiguity. */
6728 ada_find_any_type (const char *name
)
6730 struct symbol
*sym
= ada_find_any_symbol (name
);
6733 return SYMBOL_TYPE (sym
);
6738 /* Given NAME and an associated BLOCK, search all symbols for
6739 NAME suffixed with "___XR", which is the ``renaming'' symbol
6740 associated to NAME. Return this symbol if found, return
6744 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6748 sym
= find_old_style_renaming_symbol (name
, block
);
6753 /* Not right yet. FIXME pnh 7/20/2007. */
6754 sym
= ada_find_any_symbol (name
);
6755 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6761 static struct symbol
*
6762 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6764 const struct symbol
*function_sym
= block_function (block
);
6767 if (function_sym
!= NULL
)
6769 /* If the symbol is defined inside a function, NAME is not fully
6770 qualified. This means we need to prepend the function name
6771 as well as adding the ``___XR'' suffix to build the name of
6772 the associated renaming symbol. */
6773 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6774 /* Function names sometimes contain suffixes used
6775 for instance to qualify nested subprograms. When building
6776 the XR type name, we need to make sure that this suffix is
6777 not included. So do not include any suffix in the function
6778 name length below. */
6779 const int function_name_len
= ada_name_prefix_len (function_name
);
6780 const int rename_len
= function_name_len
+ 2 /* "__" */
6781 + strlen (name
) + 6 /* "___XR\0" */ ;
6783 /* Strip the suffix if necessary. */
6784 function_name
[function_name_len
] = '\0';
6786 /* Library-level functions are a special case, as GNAT adds
6787 a ``_ada_'' prefix to the function name to avoid namespace
6788 pollution. However, the renaming symbols themselves do not
6789 have this prefix, so we need to skip this prefix if present. */
6790 if (function_name_len
> 5 /* "_ada_" */
6791 && strstr (function_name
, "_ada_") == function_name
)
6792 function_name
= function_name
+ 5;
6794 rename
= (char *) alloca (rename_len
* sizeof (char));
6795 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6799 const int rename_len
= strlen (name
) + 6;
6800 rename
= (char *) alloca (rename_len
* sizeof (char));
6801 sprintf (rename
, "%s___XR", name
);
6804 return ada_find_any_symbol (rename
);
6807 /* Because of GNAT encoding conventions, several GDB symbols may match a
6808 given type name. If the type denoted by TYPE0 is to be preferred to
6809 that of TYPE1 for purposes of type printing, return non-zero;
6810 otherwise return 0. */
6813 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6817 else if (type0
== NULL
)
6819 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6821 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6823 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6825 else if (ada_is_packed_array_type (type0
))
6827 else if (ada_is_array_descriptor_type (type0
)
6828 && !ada_is_array_descriptor_type (type1
))
6832 const char *type0_name
= type_name_no_tag (type0
);
6833 const char *type1_name
= type_name_no_tag (type1
);
6835 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6836 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6842 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6843 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6846 ada_type_name (struct type
*type
)
6850 else if (TYPE_NAME (type
) != NULL
)
6851 return TYPE_NAME (type
);
6853 return TYPE_TAG_NAME (type
);
6856 /* Find a parallel type to TYPE whose name is formed by appending
6857 SUFFIX to the name of TYPE. */
6860 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6863 static size_t name_len
= 0;
6865 char *typename
= ada_type_name (type
);
6867 if (typename
== NULL
)
6870 len
= strlen (typename
);
6872 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6874 strcpy (name
, typename
);
6875 strcpy (name
+ len
, suffix
);
6877 return ada_find_any_type (name
);
6881 /* If TYPE is a variable-size record type, return the corresponding template
6882 type describing its fields. Otherwise, return NULL. */
6884 static struct type
*
6885 dynamic_template_type (struct type
*type
)
6887 type
= ada_check_typedef (type
);
6889 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6890 || ada_type_name (type
) == NULL
)
6894 int len
= strlen (ada_type_name (type
));
6895 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6898 return ada_find_parallel_type (type
, "___XVE");
6902 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6903 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6906 is_dynamic_field (struct type
*templ_type
, int field_num
)
6908 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6910 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6911 && strstr (name
, "___XVL") != NULL
;
6914 /* The index of the variant field of TYPE, or -1 if TYPE does not
6915 represent a variant record type. */
6918 variant_field_index (struct type
*type
)
6922 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6925 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6927 if (ada_is_variant_part (type
, f
))
6933 /* A record type with no fields. */
6935 static struct type
*
6936 empty_record (struct objfile
*objfile
)
6938 struct type
*type
= alloc_type (objfile
);
6939 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6940 TYPE_NFIELDS (type
) = 0;
6941 TYPE_FIELDS (type
) = NULL
;
6942 TYPE_NAME (type
) = "<empty>";
6943 TYPE_TAG_NAME (type
) = NULL
;
6944 TYPE_FLAGS (type
) = 0;
6945 TYPE_LENGTH (type
) = 0;
6949 /* An ordinary record type (with fixed-length fields) that describes
6950 the value of type TYPE at VALADDR or ADDRESS (see comments at
6951 the beginning of this section) VAL according to GNAT conventions.
6952 DVAL0 should describe the (portion of a) record that contains any
6953 necessary discriminants. It should be NULL if value_type (VAL) is
6954 an outer-level type (i.e., as opposed to a branch of a variant.) A
6955 variant field (unless unchecked) is replaced by a particular branch
6958 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6959 length are not statically known are discarded. As a consequence,
6960 VALADDR, ADDRESS and DVAL0 are ignored.
6962 NOTE: Limitations: For now, we assume that dynamic fields and
6963 variants occupy whole numbers of bytes. However, they need not be
6967 ada_template_to_fixed_record_type_1 (struct type
*type
,
6968 const gdb_byte
*valaddr
,
6969 CORE_ADDR address
, struct value
*dval0
,
6970 int keep_dynamic_fields
)
6972 struct value
*mark
= value_mark ();
6975 int nfields
, bit_len
;
6978 int fld_bit_len
, bit_incr
;
6981 /* Compute the number of fields in this record type that are going
6982 to be processed: unless keep_dynamic_fields, this includes only
6983 fields whose position and length are static will be processed. */
6984 if (keep_dynamic_fields
)
6985 nfields
= TYPE_NFIELDS (type
);
6989 while (nfields
< TYPE_NFIELDS (type
)
6990 && !ada_is_variant_part (type
, nfields
)
6991 && !is_dynamic_field (type
, nfields
))
6995 rtype
= alloc_type (TYPE_OBJFILE (type
));
6996 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6997 INIT_CPLUS_SPECIFIC (rtype
);
6998 TYPE_NFIELDS (rtype
) = nfields
;
6999 TYPE_FIELDS (rtype
) = (struct field
*)
7000 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7001 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7002 TYPE_NAME (rtype
) = ada_type_name (type
);
7003 TYPE_TAG_NAME (rtype
) = NULL
;
7004 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
7010 for (f
= 0; f
< nfields
; f
+= 1)
7012 off
= align_value (off
, field_alignment (type
, f
))
7013 + TYPE_FIELD_BITPOS (type
, f
);
7014 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
7015 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7017 if (ada_is_variant_part (type
, f
))
7020 fld_bit_len
= bit_incr
= 0;
7022 else if (is_dynamic_field (type
, f
))
7025 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7029 /* Get the fixed type of the field. Note that, in this case, we
7030 do not want to get the real type out of the tag: if the current
7031 field is the parent part of a tagged record, we will get the
7032 tag of the object. Clearly wrong: the real type of the parent
7033 is not the real type of the child. We would end up in an infinite
7035 TYPE_FIELD_TYPE (rtype
, f
) =
7038 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
7039 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7040 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
7041 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7042 bit_incr
= fld_bit_len
=
7043 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7047 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
7048 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7049 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7050 bit_incr
= fld_bit_len
=
7051 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7053 bit_incr
= fld_bit_len
=
7054 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
7056 if (off
+ fld_bit_len
> bit_len
)
7057 bit_len
= off
+ fld_bit_len
;
7059 TYPE_LENGTH (rtype
) =
7060 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7063 /* We handle the variant part, if any, at the end because of certain
7064 odd cases in which it is re-ordered so as NOT the last field of
7065 the record. This can happen in the presence of representation
7067 if (variant_field
>= 0)
7069 struct type
*branch_type
;
7071 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7074 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7079 to_fixed_variant_branch_type
7080 (TYPE_FIELD_TYPE (type
, variant_field
),
7081 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7082 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7083 if (branch_type
== NULL
)
7085 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7086 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7087 TYPE_NFIELDS (rtype
) -= 1;
7091 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7092 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7094 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7096 if (off
+ fld_bit_len
> bit_len
)
7097 bit_len
= off
+ fld_bit_len
;
7098 TYPE_LENGTH (rtype
) =
7099 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7103 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7104 should contain the alignment of that record, which should be a strictly
7105 positive value. If null or negative, then something is wrong, most
7106 probably in the debug info. In that case, we don't round up the size
7107 of the resulting type. If this record is not part of another structure,
7108 the current RTYPE length might be good enough for our purposes. */
7109 if (TYPE_LENGTH (type
) <= 0)
7111 if (TYPE_NAME (rtype
))
7112 warning (_("Invalid type size for `%s' detected: %d."),
7113 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7115 warning (_("Invalid type size for <unnamed> detected: %d."),
7116 TYPE_LENGTH (type
));
7120 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7121 TYPE_LENGTH (type
));
7124 value_free_to_mark (mark
);
7125 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7126 error (_("record type with dynamic size is larger than varsize-limit"));
7130 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7133 static struct type
*
7134 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7135 CORE_ADDR address
, struct value
*dval0
)
7137 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7141 /* An ordinary record type in which ___XVL-convention fields and
7142 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7143 static approximations, containing all possible fields. Uses
7144 no runtime values. Useless for use in values, but that's OK,
7145 since the results are used only for type determinations. Works on both
7146 structs and unions. Representation note: to save space, we memorize
7147 the result of this function in the TYPE_TARGET_TYPE of the
7150 static struct type
*
7151 template_to_static_fixed_type (struct type
*type0
)
7157 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7158 return TYPE_TARGET_TYPE (type0
);
7160 nfields
= TYPE_NFIELDS (type0
);
7163 for (f
= 0; f
< nfields
; f
+= 1)
7165 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7166 struct type
*new_type
;
7168 if (is_dynamic_field (type0
, f
))
7169 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7171 new_type
= static_unwrap_type (field_type
);
7172 if (type
== type0
&& new_type
!= field_type
)
7174 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
7175 TYPE_CODE (type
) = TYPE_CODE (type0
);
7176 INIT_CPLUS_SPECIFIC (type
);
7177 TYPE_NFIELDS (type
) = nfields
;
7178 TYPE_FIELDS (type
) = (struct field
*)
7179 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7180 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7181 sizeof (struct field
) * nfields
);
7182 TYPE_NAME (type
) = ada_type_name (type0
);
7183 TYPE_TAG_NAME (type
) = NULL
;
7184 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
7185 TYPE_LENGTH (type
) = 0;
7187 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7188 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7193 /* Given an object of type TYPE whose contents are at VALADDR and
7194 whose address in memory is ADDRESS, returns a revision of TYPE --
7195 a non-dynamic-sized record with a variant part -- in which
7196 the variant part is replaced with the appropriate branch. Looks
7197 for discriminant values in DVAL0, which can be NULL if the record
7198 contains the necessary discriminant values. */
7200 static struct type
*
7201 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7202 CORE_ADDR address
, struct value
*dval0
)
7204 struct value
*mark
= value_mark ();
7207 struct type
*branch_type
;
7208 int nfields
= TYPE_NFIELDS (type
);
7209 int variant_field
= variant_field_index (type
);
7211 if (variant_field
== -1)
7215 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7219 rtype
= alloc_type (TYPE_OBJFILE (type
));
7220 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7221 INIT_CPLUS_SPECIFIC (rtype
);
7222 TYPE_NFIELDS (rtype
) = nfields
;
7223 TYPE_FIELDS (rtype
) =
7224 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7225 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7226 sizeof (struct field
) * nfields
);
7227 TYPE_NAME (rtype
) = ada_type_name (type
);
7228 TYPE_TAG_NAME (rtype
) = NULL
;
7229 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
7230 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7232 branch_type
= to_fixed_variant_branch_type
7233 (TYPE_FIELD_TYPE (type
, variant_field
),
7234 cond_offset_host (valaddr
,
7235 TYPE_FIELD_BITPOS (type
, variant_field
)
7237 cond_offset_target (address
,
7238 TYPE_FIELD_BITPOS (type
, variant_field
)
7239 / TARGET_CHAR_BIT
), dval
);
7240 if (branch_type
== NULL
)
7243 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7244 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7245 TYPE_NFIELDS (rtype
) -= 1;
7249 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7250 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7251 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7252 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7254 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7256 value_free_to_mark (mark
);
7260 /* An ordinary record type (with fixed-length fields) that describes
7261 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7262 beginning of this section]. Any necessary discriminants' values
7263 should be in DVAL, a record value; it may be NULL if the object
7264 at ADDR itself contains any necessary discriminant values.
7265 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7266 values from the record are needed. Except in the case that DVAL,
7267 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7268 unchecked) is replaced by a particular branch of the variant.
7270 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7271 is questionable and may be removed. It can arise during the
7272 processing of an unconstrained-array-of-record type where all the
7273 variant branches have exactly the same size. This is because in
7274 such cases, the compiler does not bother to use the XVS convention
7275 when encoding the record. I am currently dubious of this
7276 shortcut and suspect the compiler should be altered. FIXME. */
7278 static struct type
*
7279 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7280 CORE_ADDR address
, struct value
*dval
)
7282 struct type
*templ_type
;
7284 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7287 templ_type
= dynamic_template_type (type0
);
7289 if (templ_type
!= NULL
)
7290 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7291 else if (variant_field_index (type0
) >= 0)
7293 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7295 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7300 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
7306 /* An ordinary record type (with fixed-length fields) that describes
7307 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7308 union type. Any necessary discriminants' values should be in DVAL,
7309 a record value. That is, this routine selects the appropriate
7310 branch of the union at ADDR according to the discriminant value
7311 indicated in the union's type name. */
7313 static struct type
*
7314 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7315 CORE_ADDR address
, struct value
*dval
)
7318 struct type
*templ_type
;
7319 struct type
*var_type
;
7321 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7322 var_type
= TYPE_TARGET_TYPE (var_type0
);
7324 var_type
= var_type0
;
7326 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7328 if (templ_type
!= NULL
)
7329 var_type
= templ_type
;
7332 ada_which_variant_applies (var_type
,
7333 value_type (dval
), value_contents (dval
));
7336 return empty_record (TYPE_OBJFILE (var_type
));
7337 else if (is_dynamic_field (var_type
, which
))
7338 return to_fixed_record_type
7339 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7340 valaddr
, address
, dval
);
7341 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7343 to_fixed_record_type
7344 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7346 return TYPE_FIELD_TYPE (var_type
, which
);
7349 /* Assuming that TYPE0 is an array type describing the type of a value
7350 at ADDR, and that DVAL describes a record containing any
7351 discriminants used in TYPE0, returns a type for the value that
7352 contains no dynamic components (that is, no components whose sizes
7353 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7354 true, gives an error message if the resulting type's size is over
7357 static struct type
*
7358 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7361 struct type
*index_type_desc
;
7362 struct type
*result
;
7364 if (ada_is_packed_array_type (type0
) /* revisit? */
7365 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
7368 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7369 if (index_type_desc
== NULL
)
7371 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7372 /* NOTE: elt_type---the fixed version of elt_type0---should never
7373 depend on the contents of the array in properly constructed
7375 /* Create a fixed version of the array element type.
7376 We're not providing the address of an element here,
7377 and thus the actual object value cannot be inspected to do
7378 the conversion. This should not be a problem, since arrays of
7379 unconstrained objects are not allowed. In particular, all
7380 the elements of an array of a tagged type should all be of
7381 the same type specified in the debugging info. No need to
7382 consult the object tag. */
7383 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7385 if (elt_type0
== elt_type
)
7388 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7389 elt_type
, TYPE_INDEX_TYPE (type0
));
7394 struct type
*elt_type0
;
7397 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7398 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7400 /* NOTE: result---the fixed version of elt_type0---should never
7401 depend on the contents of the array in properly constructed
7403 /* Create a fixed version of the array element type.
7404 We're not providing the address of an element here,
7405 and thus the actual object value cannot be inspected to do
7406 the conversion. This should not be a problem, since arrays of
7407 unconstrained objects are not allowed. In particular, all
7408 the elements of an array of a tagged type should all be of
7409 the same type specified in the debugging info. No need to
7410 consult the object tag. */
7412 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7413 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7415 struct type
*range_type
=
7416 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7417 dval
, TYPE_OBJFILE (type0
));
7418 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7419 result
, range_type
);
7421 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7422 error (_("array type with dynamic size is larger than varsize-limit"));
7425 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
7430 /* A standard type (containing no dynamically sized components)
7431 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7432 DVAL describes a record containing any discriminants used in TYPE0,
7433 and may be NULL if there are none, or if the object of type TYPE at
7434 ADDRESS or in VALADDR contains these discriminants.
7436 If CHECK_TAG is not null, in the case of tagged types, this function
7437 attempts to locate the object's tag and use it to compute the actual
7438 type. However, when ADDRESS is null, we cannot use it to determine the
7439 location of the tag, and therefore compute the tagged type's actual type.
7440 So we return the tagged type without consulting the tag. */
7442 static struct type
*
7443 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7444 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7446 type
= ada_check_typedef (type
);
7447 switch (TYPE_CODE (type
))
7451 case TYPE_CODE_STRUCT
:
7453 struct type
*static_type
= to_static_fixed_type (type
);
7454 struct type
*fixed_record_type
=
7455 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7456 /* If STATIC_TYPE is a tagged type and we know the object's address,
7457 then we can determine its tag, and compute the object's actual
7458 type from there. Note that we have to use the fixed record
7459 type (the parent part of the record may have dynamic fields
7460 and the way the location of _tag is expressed may depend on
7463 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7465 struct type
*real_type
=
7466 type_from_tag (value_tag_from_contents_and_address
7470 if (real_type
!= NULL
)
7471 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7473 return fixed_record_type
;
7475 case TYPE_CODE_ARRAY
:
7476 return to_fixed_array_type (type
, dval
, 1);
7477 case TYPE_CODE_UNION
:
7481 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7485 /* The same as ada_to_fixed_type_1, except that it preserves the type
7486 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7487 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7490 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7491 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7494 struct type
*fixed_type
=
7495 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7497 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7498 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7504 /* A standard (static-sized) type corresponding as well as possible to
7505 TYPE0, but based on no runtime data. */
7507 static struct type
*
7508 to_static_fixed_type (struct type
*type0
)
7515 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7518 type0
= ada_check_typedef (type0
);
7520 switch (TYPE_CODE (type0
))
7524 case TYPE_CODE_STRUCT
:
7525 type
= dynamic_template_type (type0
);
7527 return template_to_static_fixed_type (type
);
7529 return template_to_static_fixed_type (type0
);
7530 case TYPE_CODE_UNION
:
7531 type
= ada_find_parallel_type (type0
, "___XVU");
7533 return template_to_static_fixed_type (type
);
7535 return template_to_static_fixed_type (type0
);
7539 /* A static approximation of TYPE with all type wrappers removed. */
7541 static struct type
*
7542 static_unwrap_type (struct type
*type
)
7544 if (ada_is_aligner_type (type
))
7546 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7547 if (ada_type_name (type1
) == NULL
)
7548 TYPE_NAME (type1
) = ada_type_name (type
);
7550 return static_unwrap_type (type1
);
7554 struct type
*raw_real_type
= ada_get_base_type (type
);
7555 if (raw_real_type
== type
)
7558 return to_static_fixed_type (raw_real_type
);
7562 /* In some cases, incomplete and private types require
7563 cross-references that are not resolved as records (for example,
7565 type FooP is access Foo;
7567 type Foo is array ...;
7568 ). In these cases, since there is no mechanism for producing
7569 cross-references to such types, we instead substitute for FooP a
7570 stub enumeration type that is nowhere resolved, and whose tag is
7571 the name of the actual type. Call these types "non-record stubs". */
7573 /* A type equivalent to TYPE that is not a non-record stub, if one
7574 exists, otherwise TYPE. */
7577 ada_check_typedef (struct type
*type
)
7582 CHECK_TYPEDEF (type
);
7583 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7584 || !TYPE_STUB (type
)
7585 || TYPE_TAG_NAME (type
) == NULL
)
7589 char *name
= TYPE_TAG_NAME (type
);
7590 struct type
*type1
= ada_find_any_type (name
);
7591 return (type1
== NULL
) ? type
: type1
;
7595 /* A value representing the data at VALADDR/ADDRESS as described by
7596 type TYPE0, but with a standard (static-sized) type that correctly
7597 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7598 type, then return VAL0 [this feature is simply to avoid redundant
7599 creation of struct values]. */
7601 static struct value
*
7602 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7605 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7606 if (type
== type0
&& val0
!= NULL
)
7609 return value_from_contents_and_address (type
, 0, address
);
7612 /* A value representing VAL, but with a standard (static-sized) type
7613 that correctly describes it. Does not necessarily create a new
7616 static struct value
*
7617 ada_to_fixed_value (struct value
*val
)
7619 return ada_to_fixed_value_create (value_type (val
),
7620 VALUE_ADDRESS (val
) + value_offset (val
),
7624 /* A value representing VAL, but with a standard (static-sized) type
7625 chosen to approximate the real type of VAL as well as possible, but
7626 without consulting any runtime values. For Ada dynamic-sized
7627 types, therefore, the type of the result is likely to be inaccurate. */
7630 ada_to_static_fixed_value (struct value
*val
)
7633 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7634 if (type
== value_type (val
))
7637 return coerce_unspec_val_to_type (val
, type
);
7643 /* Table mapping attribute numbers to names.
7644 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7646 static const char *attribute_names
[] = {
7664 ada_attribute_name (enum exp_opcode n
)
7666 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7667 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7669 return attribute_names
[0];
7672 /* Evaluate the 'POS attribute applied to ARG. */
7675 pos_atr (struct value
*arg
)
7677 struct type
*type
= value_type (arg
);
7679 if (!discrete_type_p (type
))
7680 error (_("'POS only defined on discrete types"));
7682 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7685 LONGEST v
= value_as_long (arg
);
7687 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7689 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7692 error (_("enumeration value is invalid: can't find 'POS"));
7695 return value_as_long (arg
);
7698 static struct value
*
7699 value_pos_atr (struct value
*arg
)
7701 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7704 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7706 static struct value
*
7707 value_val_atr (struct type
*type
, struct value
*arg
)
7709 if (!discrete_type_p (type
))
7710 error (_("'VAL only defined on discrete types"));
7711 if (!integer_type_p (value_type (arg
)))
7712 error (_("'VAL requires integral argument"));
7714 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7716 long pos
= value_as_long (arg
);
7717 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7718 error (_("argument to 'VAL out of range"));
7719 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7722 return value_from_longest (type
, value_as_long (arg
));
7728 /* True if TYPE appears to be an Ada character type.
7729 [At the moment, this is true only for Character and Wide_Character;
7730 It is a heuristic test that could stand improvement]. */
7733 ada_is_character_type (struct type
*type
)
7737 /* If the type code says it's a character, then assume it really is,
7738 and don't check any further. */
7739 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7742 /* Otherwise, assume it's a character type iff it is a discrete type
7743 with a known character type name. */
7744 name
= ada_type_name (type
);
7745 return (name
!= NULL
7746 && (TYPE_CODE (type
) == TYPE_CODE_INT
7747 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7748 && (strcmp (name
, "character") == 0
7749 || strcmp (name
, "wide_character") == 0
7750 || strcmp (name
, "wide_wide_character") == 0
7751 || strcmp (name
, "unsigned char") == 0));
7754 /* True if TYPE appears to be an Ada string type. */
7757 ada_is_string_type (struct type
*type
)
7759 type
= ada_check_typedef (type
);
7761 && TYPE_CODE (type
) != TYPE_CODE_PTR
7762 && (ada_is_simple_array_type (type
)
7763 || ada_is_array_descriptor_type (type
))
7764 && ada_array_arity (type
) == 1)
7766 struct type
*elttype
= ada_array_element_type (type
, 1);
7768 return ada_is_character_type (elttype
);
7775 /* True if TYPE is a struct type introduced by the compiler to force the
7776 alignment of a value. Such types have a single field with a
7777 distinctive name. */
7780 ada_is_aligner_type (struct type
*type
)
7782 type
= ada_check_typedef (type
);
7784 /* If we can find a parallel XVS type, then the XVS type should
7785 be used instead of this type. And hence, this is not an aligner
7787 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7790 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7791 && TYPE_NFIELDS (type
) == 1
7792 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7795 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7796 the parallel type. */
7799 ada_get_base_type (struct type
*raw_type
)
7801 struct type
*real_type_namer
;
7802 struct type
*raw_real_type
;
7804 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7807 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7808 if (real_type_namer
== NULL
7809 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7810 || TYPE_NFIELDS (real_type_namer
) != 1)
7813 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7814 if (raw_real_type
== NULL
)
7817 return raw_real_type
;
7820 /* The type of value designated by TYPE, with all aligners removed. */
7823 ada_aligned_type (struct type
*type
)
7825 if (ada_is_aligner_type (type
))
7826 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7828 return ada_get_base_type (type
);
7832 /* The address of the aligned value in an object at address VALADDR
7833 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7836 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7838 if (ada_is_aligner_type (type
))
7839 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7841 TYPE_FIELD_BITPOS (type
,
7842 0) / TARGET_CHAR_BIT
);
7849 /* The printed representation of an enumeration literal with encoded
7850 name NAME. The value is good to the next call of ada_enum_name. */
7852 ada_enum_name (const char *name
)
7854 static char *result
;
7855 static size_t result_len
= 0;
7858 /* First, unqualify the enumeration name:
7859 1. Search for the last '.' character. If we find one, then skip
7860 all the preceeding characters, the unqualified name starts
7861 right after that dot.
7862 2. Otherwise, we may be debugging on a target where the compiler
7863 translates dots into "__". Search forward for double underscores,
7864 but stop searching when we hit an overloading suffix, which is
7865 of the form "__" followed by digits. */
7867 tmp
= strrchr (name
, '.');
7872 while ((tmp
= strstr (name
, "__")) != NULL
)
7874 if (isdigit (tmp
[2]))
7884 if (name
[1] == 'U' || name
[1] == 'W')
7886 if (sscanf (name
+ 2, "%x", &v
) != 1)
7892 GROW_VECT (result
, result_len
, 16);
7893 if (isascii (v
) && isprint (v
))
7894 sprintf (result
, "'%c'", v
);
7895 else if (name
[1] == 'U')
7896 sprintf (result
, "[\"%02x\"]", v
);
7898 sprintf (result
, "[\"%04x\"]", v
);
7904 tmp
= strstr (name
, "__");
7906 tmp
= strstr (name
, "$");
7909 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7910 strncpy (result
, name
, tmp
- name
);
7911 result
[tmp
- name
] = '\0';
7919 static struct value
*
7920 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7923 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7924 (expect_type
, exp
, pos
, noside
);
7927 /* Evaluate the subexpression of EXP starting at *POS as for
7928 evaluate_type, updating *POS to point just past the evaluated
7931 static struct value
*
7932 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7934 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7935 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7938 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7941 static struct value
*
7942 unwrap_value (struct value
*val
)
7944 struct type
*type
= ada_check_typedef (value_type (val
));
7945 if (ada_is_aligner_type (type
))
7947 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7948 struct type
*val_type
= ada_check_typedef (value_type (v
));
7949 if (ada_type_name (val_type
) == NULL
)
7950 TYPE_NAME (val_type
) = ada_type_name (type
);
7952 return unwrap_value (v
);
7956 struct type
*raw_real_type
=
7957 ada_check_typedef (ada_get_base_type (type
));
7959 if (type
== raw_real_type
)
7963 coerce_unspec_val_to_type
7964 (val
, ada_to_fixed_type (raw_real_type
, 0,
7965 VALUE_ADDRESS (val
) + value_offset (val
),
7970 static struct value
*
7971 cast_to_fixed (struct type
*type
, struct value
*arg
)
7975 if (type
== value_type (arg
))
7977 else if (ada_is_fixed_point_type (value_type (arg
)))
7978 val
= ada_float_to_fixed (type
,
7979 ada_fixed_to_float (value_type (arg
),
7980 value_as_long (arg
)));
7984 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7985 val
= ada_float_to_fixed (type
, argd
);
7988 return value_from_longest (type
, val
);
7991 static struct value
*
7992 cast_from_fixed_to_double (struct value
*arg
)
7994 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7995 value_as_long (arg
));
7996 return value_from_double (builtin_type_double
, val
);
7999 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8000 return the converted value. */
8002 static struct value
*
8003 coerce_for_assign (struct type
*type
, struct value
*val
)
8005 struct type
*type2
= value_type (val
);
8009 type2
= ada_check_typedef (type2
);
8010 type
= ada_check_typedef (type
);
8012 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
8013 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8015 val
= ada_value_ind (val
);
8016 type2
= value_type (val
);
8019 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
8020 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8022 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
8023 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8024 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
8025 error (_("Incompatible types in assignment"));
8026 deprecated_set_value_type (val
, type
);
8031 static struct value
*
8032 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8035 struct type
*type1
, *type2
;
8038 arg1
= coerce_ref (arg1
);
8039 arg2
= coerce_ref (arg2
);
8040 type1
= base_type (ada_check_typedef (value_type (arg1
)));
8041 type2
= base_type (ada_check_typedef (value_type (arg2
)));
8043 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8044 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8045 return value_binop (arg1
, arg2
, op
);
8054 return value_binop (arg1
, arg2
, op
);
8057 v2
= value_as_long (arg2
);
8059 error (_("second operand of %s must not be zero."), op_string (op
));
8061 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8062 return value_binop (arg1
, arg2
, op
);
8064 v1
= value_as_long (arg1
);
8069 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8070 v
+= v
> 0 ? -1 : 1;
8078 /* Should not reach this point. */
8082 val
= allocate_value (type1
);
8083 store_unsigned_integer (value_contents_raw (val
),
8084 TYPE_LENGTH (value_type (val
)), v
);
8089 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8091 if (ada_is_direct_array_type (value_type (arg1
))
8092 || ada_is_direct_array_type (value_type (arg2
)))
8094 /* Automatically dereference any array reference before
8095 we attempt to perform the comparison. */
8096 arg1
= ada_coerce_ref (arg1
);
8097 arg2
= ada_coerce_ref (arg2
);
8099 arg1
= ada_coerce_to_simple_array (arg1
);
8100 arg2
= ada_coerce_to_simple_array (arg2
);
8101 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8102 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8103 error (_("Attempt to compare array with non-array"));
8104 /* FIXME: The following works only for types whose
8105 representations use all bits (no padding or undefined bits)
8106 and do not have user-defined equality. */
8108 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8109 && memcmp (value_contents (arg1
), value_contents (arg2
),
8110 TYPE_LENGTH (value_type (arg1
))) == 0;
8112 return value_equal (arg1
, arg2
);
8115 /* Total number of component associations in the aggregate starting at
8116 index PC in EXP. Assumes that index PC is the start of an
8120 num_component_specs (struct expression
*exp
, int pc
)
8123 m
= exp
->elts
[pc
+ 1].longconst
;
8126 for (i
= 0; i
< m
; i
+= 1)
8128 switch (exp
->elts
[pc
].opcode
)
8134 n
+= exp
->elts
[pc
+ 1].longconst
;
8137 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8142 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8143 component of LHS (a simple array or a record), updating *POS past
8144 the expression, assuming that LHS is contained in CONTAINER. Does
8145 not modify the inferior's memory, nor does it modify LHS (unless
8146 LHS == CONTAINER). */
8149 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8150 struct expression
*exp
, int *pos
)
8152 struct value
*mark
= value_mark ();
8154 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8156 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
8157 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8161 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8162 elt
= ada_to_fixed_value (unwrap_value (elt
));
8165 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8166 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8168 value_assign_to_component (container
, elt
,
8169 ada_evaluate_subexp (NULL
, exp
, pos
,
8172 value_free_to_mark (mark
);
8175 /* Assuming that LHS represents an lvalue having a record or array
8176 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8177 of that aggregate's value to LHS, advancing *POS past the
8178 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8179 lvalue containing LHS (possibly LHS itself). Does not modify
8180 the inferior's memory, nor does it modify the contents of
8181 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8183 static struct value
*
8184 assign_aggregate (struct value
*container
,
8185 struct value
*lhs
, struct expression
*exp
,
8186 int *pos
, enum noside noside
)
8188 struct type
*lhs_type
;
8189 int n
= exp
->elts
[*pos
+1].longconst
;
8190 LONGEST low_index
, high_index
;
8193 int max_indices
, num_indices
;
8194 int is_array_aggregate
;
8196 struct value
*mark
= value_mark ();
8199 if (noside
!= EVAL_NORMAL
)
8202 for (i
= 0; i
< n
; i
+= 1)
8203 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8207 container
= ada_coerce_ref (container
);
8208 if (ada_is_direct_array_type (value_type (container
)))
8209 container
= ada_coerce_to_simple_array (container
);
8210 lhs
= ada_coerce_ref (lhs
);
8211 if (!deprecated_value_modifiable (lhs
))
8212 error (_("Left operand of assignment is not a modifiable lvalue."));
8214 lhs_type
= value_type (lhs
);
8215 if (ada_is_direct_array_type (lhs_type
))
8217 lhs
= ada_coerce_to_simple_array (lhs
);
8218 lhs_type
= value_type (lhs
);
8219 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8220 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8221 is_array_aggregate
= 1;
8223 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8226 high_index
= num_visible_fields (lhs_type
) - 1;
8227 is_array_aggregate
= 0;
8230 error (_("Left-hand side must be array or record."));
8232 num_specs
= num_component_specs (exp
, *pos
- 3);
8233 max_indices
= 4 * num_specs
+ 4;
8234 indices
= alloca (max_indices
* sizeof (indices
[0]));
8235 indices
[0] = indices
[1] = low_index
- 1;
8236 indices
[2] = indices
[3] = high_index
+ 1;
8239 for (i
= 0; i
< n
; i
+= 1)
8241 switch (exp
->elts
[*pos
].opcode
)
8244 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8245 &num_indices
, max_indices
,
8246 low_index
, high_index
);
8249 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8250 &num_indices
, max_indices
,
8251 low_index
, high_index
);
8255 error (_("Misplaced 'others' clause"));
8256 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8257 num_indices
, low_index
, high_index
);
8260 error (_("Internal error: bad aggregate clause"));
8267 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8268 construct at *POS, updating *POS past the construct, given that
8269 the positions are relative to lower bound LOW, where HIGH is the
8270 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8271 updating *NUM_INDICES as needed. CONTAINER is as for
8272 assign_aggregate. */
8274 aggregate_assign_positional (struct value
*container
,
8275 struct value
*lhs
, struct expression
*exp
,
8276 int *pos
, LONGEST
*indices
, int *num_indices
,
8277 int max_indices
, LONGEST low
, LONGEST high
)
8279 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8281 if (ind
- 1 == high
)
8282 warning (_("Extra components in aggregate ignored."));
8285 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8287 assign_component (container
, lhs
, ind
, exp
, pos
);
8290 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8293 /* Assign into the components of LHS indexed by the OP_CHOICES
8294 construct at *POS, updating *POS past the construct, given that
8295 the allowable indices are LOW..HIGH. Record the indices assigned
8296 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8297 needed. CONTAINER is as for assign_aggregate. */
8299 aggregate_assign_from_choices (struct value
*container
,
8300 struct value
*lhs
, struct expression
*exp
,
8301 int *pos
, LONGEST
*indices
, int *num_indices
,
8302 int max_indices
, LONGEST low
, LONGEST high
)
8305 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8306 int choice_pos
, expr_pc
;
8307 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8309 choice_pos
= *pos
+= 3;
8311 for (j
= 0; j
< n_choices
; j
+= 1)
8312 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8314 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8316 for (j
= 0; j
< n_choices
; j
+= 1)
8318 LONGEST lower
, upper
;
8319 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8320 if (op
== OP_DISCRETE_RANGE
)
8323 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8325 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8330 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8341 name
= &exp
->elts
[choice_pos
+ 2].string
;
8344 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8347 error (_("Invalid record component association."));
8349 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8351 if (! find_struct_field (name
, value_type (lhs
), 0,
8352 NULL
, NULL
, NULL
, NULL
, &ind
))
8353 error (_("Unknown component name: %s."), name
);
8354 lower
= upper
= ind
;
8357 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8358 error (_("Index in component association out of bounds."));
8360 add_component_interval (lower
, upper
, indices
, num_indices
,
8362 while (lower
<= upper
)
8366 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8372 /* Assign the value of the expression in the OP_OTHERS construct in
8373 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8374 have not been previously assigned. The index intervals already assigned
8375 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8376 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8378 aggregate_assign_others (struct value
*container
,
8379 struct value
*lhs
, struct expression
*exp
,
8380 int *pos
, LONGEST
*indices
, int num_indices
,
8381 LONGEST low
, LONGEST high
)
8384 int expr_pc
= *pos
+1;
8386 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8389 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8393 assign_component (container
, lhs
, ind
, exp
, &pos
);
8396 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8399 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8400 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8401 modifying *SIZE as needed. It is an error if *SIZE exceeds
8402 MAX_SIZE. The resulting intervals do not overlap. */
8404 add_component_interval (LONGEST low
, LONGEST high
,
8405 LONGEST
* indices
, int *size
, int max_size
)
8408 for (i
= 0; i
< *size
; i
+= 2) {
8409 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8412 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8413 if (high
< indices
[kh
])
8415 if (low
< indices
[i
])
8417 indices
[i
+ 1] = indices
[kh
- 1];
8418 if (high
> indices
[i
+ 1])
8419 indices
[i
+ 1] = high
;
8420 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8421 *size
-= kh
- i
- 2;
8424 else if (high
< indices
[i
])
8428 if (*size
== max_size
)
8429 error (_("Internal error: miscounted aggregate components."));
8431 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8432 indices
[j
] = indices
[j
- 2];
8434 indices
[i
+ 1] = high
;
8437 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8440 static struct value
*
8441 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8443 if (type
== ada_check_typedef (value_type (arg2
)))
8446 if (ada_is_fixed_point_type (type
))
8447 return (cast_to_fixed (type
, arg2
));
8449 if (ada_is_fixed_point_type (value_type (arg2
)))
8450 return value_cast (type
, cast_from_fixed_to_double (arg2
));
8452 return value_cast (type
, arg2
);
8455 static struct value
*
8456 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8457 int *pos
, enum noside noside
)
8460 int tem
, tem2
, tem3
;
8462 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8465 struct value
**argvec
;
8469 op
= exp
->elts
[pc
].opcode
;
8475 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8476 arg1
= unwrap_value (arg1
);
8478 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8479 then we need to perform the conversion manually, because
8480 evaluate_subexp_standard doesn't do it. This conversion is
8481 necessary in Ada because the different kinds of float/fixed
8482 types in Ada have different representations.
8484 Similarly, we need to perform the conversion from OP_LONG
8486 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8487 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8493 struct value
*result
;
8495 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8496 /* The result type will have code OP_STRING, bashed there from
8497 OP_ARRAY. Bash it back. */
8498 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8499 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8505 type
= exp
->elts
[pc
+ 1].type
;
8506 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8507 if (noside
== EVAL_SKIP
)
8509 arg1
= ada_value_cast (type
, arg1
, noside
);
8514 type
= exp
->elts
[pc
+ 1].type
;
8515 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8518 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8519 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8521 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8522 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8524 return ada_value_assign (arg1
, arg1
);
8526 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8527 except if the lhs of our assignment is a convenience variable.
8528 In the case of assigning to a convenience variable, the lhs
8529 should be exactly the result of the evaluation of the rhs. */
8530 type
= value_type (arg1
);
8531 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8533 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8534 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8536 if (ada_is_fixed_point_type (value_type (arg1
)))
8537 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8538 else if (ada_is_fixed_point_type (value_type (arg2
)))
8540 (_("Fixed-point values must be assigned to fixed-point variables"));
8542 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8543 return ada_value_assign (arg1
, arg2
);
8546 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8547 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8548 if (noside
== EVAL_SKIP
)
8550 if ((ada_is_fixed_point_type (value_type (arg1
))
8551 || ada_is_fixed_point_type (value_type (arg2
)))
8552 && value_type (arg1
) != value_type (arg2
))
8553 error (_("Operands of fixed-point addition must have the same type"));
8554 /* Do the addition, and cast the result to the type of the first
8555 argument. We cannot cast the result to a reference type, so if
8556 ARG1 is a reference type, find its underlying type. */
8557 type
= value_type (arg1
);
8558 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8559 type
= TYPE_TARGET_TYPE (type
);
8560 return value_cast (type
, value_add (arg1
, arg2
));
8563 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8564 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8565 if (noside
== EVAL_SKIP
)
8567 if ((ada_is_fixed_point_type (value_type (arg1
))
8568 || ada_is_fixed_point_type (value_type (arg2
)))
8569 && value_type (arg1
) != value_type (arg2
))
8570 error (_("Operands of fixed-point subtraction must have the same type"));
8571 /* Do the substraction, and cast the result to the type of the first
8572 argument. We cannot cast the result to a reference type, so if
8573 ARG1 is a reference type, find its underlying type. */
8574 type
= value_type (arg1
);
8575 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8576 type
= TYPE_TARGET_TYPE (type
);
8577 return value_cast (type
, value_sub (arg1
, arg2
));
8581 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8582 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8583 if (noside
== EVAL_SKIP
)
8585 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8586 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8587 return value_zero (value_type (arg1
), not_lval
);
8590 if (ada_is_fixed_point_type (value_type (arg1
)))
8591 arg1
= cast_from_fixed_to_double (arg1
);
8592 if (ada_is_fixed_point_type (value_type (arg2
)))
8593 arg2
= cast_from_fixed_to_double (arg2
);
8594 return ada_value_binop (arg1
, arg2
, op
);
8599 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8600 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8601 if (noside
== EVAL_SKIP
)
8603 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8604 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8605 return value_zero (value_type (arg1
), not_lval
);
8607 return ada_value_binop (arg1
, arg2
, op
);
8610 case BINOP_NOTEQUAL
:
8611 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8612 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8613 if (noside
== EVAL_SKIP
)
8615 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8618 tem
= ada_value_equal (arg1
, arg2
);
8619 if (op
== BINOP_NOTEQUAL
)
8621 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
8624 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8625 if (noside
== EVAL_SKIP
)
8627 else if (ada_is_fixed_point_type (value_type (arg1
)))
8628 return value_cast (value_type (arg1
), value_neg (arg1
));
8630 return value_neg (arg1
);
8632 case BINOP_LOGICAL_AND
:
8633 case BINOP_LOGICAL_OR
:
8634 case UNOP_LOGICAL_NOT
:
8639 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8640 return value_cast (LA_BOOL_TYPE
, val
);
8643 case BINOP_BITWISE_AND
:
8644 case BINOP_BITWISE_IOR
:
8645 case BINOP_BITWISE_XOR
:
8649 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8651 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8653 return value_cast (value_type (arg1
), val
);
8659 /* Tagged types are a little special in the fact that the real type
8660 is dynamic and can only be determined by inspecting the object
8661 value. So even if we're support to do an EVAL_AVOID_SIDE_EFFECTS
8662 evaluation, we force an EVAL_NORMAL evaluation for tagged types. */
8663 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8664 && ada_is_tagged_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
), 1))
8665 noside
= EVAL_NORMAL
;
8667 if (noside
== EVAL_SKIP
)
8672 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8673 /* Only encountered when an unresolved symbol occurs in a
8674 context other than a function call, in which case, it is
8676 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8677 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8678 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8682 (to_static_fixed_type
8683 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8689 unwrap_value (evaluate_subexp_standard
8690 (expect_type
, exp
, pos
, noside
));
8691 return ada_to_fixed_value (arg1
);
8697 /* Allocate arg vector, including space for the function to be
8698 called in argvec[0] and a terminating NULL. */
8699 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8701 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8703 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8704 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8705 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8706 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8709 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8710 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8713 if (noside
== EVAL_SKIP
)
8717 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8718 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8719 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8720 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8721 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8722 argvec
[0] = value_addr (argvec
[0]);
8724 type
= ada_check_typedef (value_type (argvec
[0]));
8725 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8727 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8729 case TYPE_CODE_FUNC
:
8730 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8732 case TYPE_CODE_ARRAY
:
8734 case TYPE_CODE_STRUCT
:
8735 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8736 argvec
[0] = ada_value_ind (argvec
[0]);
8737 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8740 error (_("cannot subscript or call something of type `%s'"),
8741 ada_type_name (value_type (argvec
[0])));
8746 switch (TYPE_CODE (type
))
8748 case TYPE_CODE_FUNC
:
8749 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8750 return allocate_value (TYPE_TARGET_TYPE (type
));
8751 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8752 case TYPE_CODE_STRUCT
:
8756 arity
= ada_array_arity (type
);
8757 type
= ada_array_element_type (type
, nargs
);
8759 error (_("cannot subscript or call a record"));
8761 error (_("wrong number of subscripts; expecting %d"), arity
);
8762 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8763 return value_zero (ada_aligned_type (type
), lval_memory
);
8765 unwrap_value (ada_value_subscript
8766 (argvec
[0], nargs
, argvec
+ 1));
8768 case TYPE_CODE_ARRAY
:
8769 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8771 type
= ada_array_element_type (type
, nargs
);
8773 error (_("element type of array unknown"));
8775 return value_zero (ada_aligned_type (type
), lval_memory
);
8778 unwrap_value (ada_value_subscript
8779 (ada_coerce_to_simple_array (argvec
[0]),
8780 nargs
, argvec
+ 1));
8781 case TYPE_CODE_PTR
: /* Pointer to array */
8782 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8783 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8785 type
= ada_array_element_type (type
, nargs
);
8787 error (_("element type of array unknown"));
8789 return value_zero (ada_aligned_type (type
), lval_memory
);
8792 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8793 nargs
, argvec
+ 1));
8796 error (_("Attempt to index or call something other than an "
8797 "array or function"));
8802 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8803 struct value
*low_bound_val
=
8804 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8805 struct value
*high_bound_val
=
8806 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8809 low_bound_val
= coerce_ref (low_bound_val
);
8810 high_bound_val
= coerce_ref (high_bound_val
);
8811 low_bound
= pos_atr (low_bound_val
);
8812 high_bound
= pos_atr (high_bound_val
);
8814 if (noside
== EVAL_SKIP
)
8817 /* If this is a reference to an aligner type, then remove all
8819 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8820 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8821 TYPE_TARGET_TYPE (value_type (array
)) =
8822 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8824 if (ada_is_packed_array_type (value_type (array
)))
8825 error (_("cannot slice a packed array"));
8827 /* If this is a reference to an array or an array lvalue,
8828 convert to a pointer. */
8829 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8830 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8831 && VALUE_LVAL (array
) == lval_memory
))
8832 array
= value_addr (array
);
8834 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8835 && ada_is_array_descriptor_type (ada_check_typedef
8836 (value_type (array
))))
8837 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8839 array
= ada_coerce_to_simple_array_ptr (array
);
8841 /* If we have more than one level of pointer indirection,
8842 dereference the value until we get only one level. */
8843 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8844 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8846 array
= value_ind (array
);
8848 /* Make sure we really do have an array type before going further,
8849 to avoid a SEGV when trying to get the index type or the target
8850 type later down the road if the debug info generated by
8851 the compiler is incorrect or incomplete. */
8852 if (!ada_is_simple_array_type (value_type (array
)))
8853 error (_("cannot take slice of non-array"));
8855 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8857 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8858 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8862 struct type
*arr_type0
=
8863 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8865 return ada_value_slice_ptr (array
, arr_type0
,
8866 longest_to_int (low_bound
),
8867 longest_to_int (high_bound
));
8870 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8872 else if (high_bound
< low_bound
)
8873 return empty_array (value_type (array
), low_bound
);
8875 return ada_value_slice (array
, longest_to_int (low_bound
),
8876 longest_to_int (high_bound
));
8881 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8882 type
= exp
->elts
[pc
+ 1].type
;
8884 if (noside
== EVAL_SKIP
)
8887 switch (TYPE_CODE (type
))
8890 lim_warning (_("Membership test incompletely implemented; "
8891 "always returns true"));
8892 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
8894 case TYPE_CODE_RANGE
:
8895 arg2
= value_from_longest (builtin_type_int
, TYPE_LOW_BOUND (type
));
8896 arg3
= value_from_longest (builtin_type_int
,
8897 TYPE_HIGH_BOUND (type
));
8899 value_from_longest (builtin_type_int
,
8900 (value_less (arg1
, arg3
)
8901 || value_equal (arg1
, arg3
))
8902 && (value_less (arg2
, arg1
)
8903 || value_equal (arg2
, arg1
)));
8906 case BINOP_IN_BOUNDS
:
8908 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8909 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8911 if (noside
== EVAL_SKIP
)
8914 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8915 return value_zero (builtin_type_int
, not_lval
);
8917 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8919 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8920 error (_("invalid dimension number to 'range"));
8922 arg3
= ada_array_bound (arg2
, tem
, 1);
8923 arg2
= ada_array_bound (arg2
, tem
, 0);
8926 value_from_longest (builtin_type_int
,
8927 (value_less (arg1
, arg3
)
8928 || value_equal (arg1
, arg3
))
8929 && (value_less (arg2
, arg1
)
8930 || value_equal (arg2
, arg1
)));
8932 case TERNOP_IN_RANGE
:
8933 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8934 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8935 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8937 if (noside
== EVAL_SKIP
)
8941 value_from_longest (builtin_type_int
,
8942 (value_less (arg1
, arg3
)
8943 || value_equal (arg1
, arg3
))
8944 && (value_less (arg2
, arg1
)
8945 || value_equal (arg2
, arg1
)));
8951 struct type
*type_arg
;
8952 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8954 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8956 type_arg
= exp
->elts
[pc
+ 2].type
;
8960 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8964 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8965 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8966 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8969 if (noside
== EVAL_SKIP
)
8972 if (type_arg
== NULL
)
8974 arg1
= ada_coerce_ref (arg1
);
8976 if (ada_is_packed_array_type (value_type (arg1
)))
8977 arg1
= ada_coerce_to_simple_array (arg1
);
8979 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8980 error (_("invalid dimension number to '%s"),
8981 ada_attribute_name (op
));
8983 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8985 type
= ada_index_type (value_type (arg1
), tem
);
8988 (_("attempt to take bound of something that is not an array"));
8989 return allocate_value (type
);
8994 default: /* Should never happen. */
8995 error (_("unexpected attribute encountered"));
8997 return ada_array_bound (arg1
, tem
, 0);
8999 return ada_array_bound (arg1
, tem
, 1);
9001 return ada_array_length (arg1
, tem
);
9004 else if (discrete_type_p (type_arg
))
9006 struct type
*range_type
;
9007 char *name
= ada_type_name (type_arg
);
9009 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9011 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
9012 if (range_type
== NULL
)
9013 range_type
= type_arg
;
9017 error (_("unexpected attribute encountered"));
9019 return discrete_type_low_bound (range_type
);
9021 return discrete_type_high_bound (range_type
);
9023 error (_("the 'length attribute applies only to array types"));
9026 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9027 error (_("unimplemented type attribute"));
9032 if (ada_is_packed_array_type (type_arg
))
9033 type_arg
= decode_packed_array_type (type_arg
);
9035 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
9036 error (_("invalid dimension number to '%s"),
9037 ada_attribute_name (op
));
9039 type
= ada_index_type (type_arg
, tem
);
9042 (_("attempt to take bound of something that is not an array"));
9043 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9044 return allocate_value (type
);
9049 error (_("unexpected attribute encountered"));
9051 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9052 return value_from_longest (type
, low
);
9054 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
9055 return value_from_longest (type
, high
);
9057 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9058 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
9059 return value_from_longest (type
, high
- low
+ 1);
9065 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9066 if (noside
== EVAL_SKIP
)
9069 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9070 return value_zero (ada_tag_type (arg1
), not_lval
);
9072 return ada_value_tag (arg1
);
9076 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9077 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9078 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9079 if (noside
== EVAL_SKIP
)
9081 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9082 return value_zero (value_type (arg1
), not_lval
);
9084 return value_binop (arg1
, arg2
,
9085 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9087 case OP_ATR_MODULUS
:
9089 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
9090 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9092 if (noside
== EVAL_SKIP
)
9095 if (!ada_is_modular_type (type_arg
))
9096 error (_("'modulus must be applied to modular type"));
9098 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9099 ada_modulus (type_arg
));
9104 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9105 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9106 if (noside
== EVAL_SKIP
)
9108 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9109 return value_zero (builtin_type_int
, not_lval
);
9111 return value_pos_atr (arg1
);
9114 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9115 if (noside
== EVAL_SKIP
)
9117 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9118 return value_zero (builtin_type_int
, not_lval
);
9120 return value_from_longest (builtin_type_int
,
9122 * TYPE_LENGTH (value_type (arg1
)));
9125 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9126 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9127 type
= exp
->elts
[pc
+ 2].type
;
9128 if (noside
== EVAL_SKIP
)
9130 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9131 return value_zero (type
, not_lval
);
9133 return value_val_atr (type
, arg1
);
9136 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9137 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9138 if (noside
== EVAL_SKIP
)
9140 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9141 return value_zero (value_type (arg1
), not_lval
);
9143 return value_binop (arg1
, arg2
, op
);
9146 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9147 if (noside
== EVAL_SKIP
)
9153 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9154 if (noside
== EVAL_SKIP
)
9156 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9157 return value_neg (arg1
);
9162 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
9163 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
9164 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
9165 if (noside
== EVAL_SKIP
)
9167 type
= ada_check_typedef (value_type (arg1
));
9168 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9170 if (ada_is_array_descriptor_type (type
))
9171 /* GDB allows dereferencing GNAT array descriptors. */
9173 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9174 if (arrType
== NULL
)
9175 error (_("Attempt to dereference null array pointer."));
9176 return value_at_lazy (arrType
, 0);
9178 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9179 || TYPE_CODE (type
) == TYPE_CODE_REF
9180 /* In C you can dereference an array to get the 1st elt. */
9181 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9183 type
= to_static_fixed_type
9185 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9187 return value_zero (type
, lval_memory
);
9189 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9190 /* GDB allows dereferencing an int. */
9191 return value_zero (builtin_type_int
, lval_memory
);
9193 error (_("Attempt to take contents of a non-pointer value."));
9195 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9196 type
= ada_check_typedef (value_type (arg1
));
9198 if (ada_is_array_descriptor_type (type
))
9199 /* GDB allows dereferencing GNAT array descriptors. */
9200 return ada_coerce_to_simple_array (arg1
);
9202 return ada_value_ind (arg1
);
9204 case STRUCTOP_STRUCT
:
9205 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9206 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9207 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9208 if (noside
== EVAL_SKIP
)
9210 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9212 struct type
*type1
= value_type (arg1
);
9213 if (ada_is_tagged_type (type1
, 1))
9215 type
= ada_lookup_struct_elt_type (type1
,
9216 &exp
->elts
[pc
+ 2].string
,
9219 /* In this case, we assume that the field COULD exist
9220 in some extension of the type. Return an object of
9221 "type" void, which will match any formal
9222 (see ada_type_match). */
9223 return value_zero (builtin_type_void
, lval_memory
);
9227 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9230 return value_zero (ada_aligned_type (type
), lval_memory
);
9234 ada_to_fixed_value (unwrap_value
9235 (ada_value_struct_elt
9236 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9238 /* The value is not supposed to be used. This is here to make it
9239 easier to accommodate expressions that contain types. */
9241 if (noside
== EVAL_SKIP
)
9243 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9244 return allocate_value (exp
->elts
[pc
+ 1].type
);
9246 error (_("Attempt to use a type name as an expression"));
9251 case OP_DISCRETE_RANGE
:
9254 if (noside
== EVAL_NORMAL
)
9258 error (_("Undefined name, ambiguous name, or renaming used in "
9259 "component association: %s."), &exp
->elts
[pc
+2].string
);
9261 error (_("Aggregates only allowed on the right of an assignment"));
9263 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9266 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9268 for (tem
= 0; tem
< nargs
; tem
+= 1)
9269 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9274 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
9280 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9281 type name that encodes the 'small and 'delta information.
9282 Otherwise, return NULL. */
9285 fixed_type_info (struct type
*type
)
9287 const char *name
= ada_type_name (type
);
9288 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9290 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9292 const char *tail
= strstr (name
, "___XF_");
9298 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9299 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9304 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9307 ada_is_fixed_point_type (struct type
*type
)
9309 return fixed_type_info (type
) != NULL
;
9312 /* Return non-zero iff TYPE represents a System.Address type. */
9315 ada_is_system_address_type (struct type
*type
)
9317 return (TYPE_NAME (type
)
9318 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9321 /* Assuming that TYPE is the representation of an Ada fixed-point
9322 type, return its delta, or -1 if the type is malformed and the
9323 delta cannot be determined. */
9326 ada_delta (struct type
*type
)
9328 const char *encoding
= fixed_type_info (type
);
9331 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9334 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9337 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9338 factor ('SMALL value) associated with the type. */
9341 scaling_factor (struct type
*type
)
9343 const char *encoding
= fixed_type_info (type
);
9344 unsigned long num0
, den0
, num1
, den1
;
9347 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9352 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9354 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9358 /* Assuming that X is the representation of a value of fixed-point
9359 type TYPE, return its floating-point equivalent. */
9362 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9364 return (DOUBLEST
) x
*scaling_factor (type
);
9367 /* The representation of a fixed-point value of type TYPE
9368 corresponding to the value X. */
9371 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9373 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9377 /* VAX floating formats */
9379 /* Non-zero iff TYPE represents one of the special VAX floating-point
9383 ada_is_vax_floating_type (struct type
*type
)
9386 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9389 && (TYPE_CODE (type
) == TYPE_CODE_INT
9390 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9391 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9394 /* The type of special VAX floating-point type this is, assuming
9395 ada_is_vax_floating_point. */
9398 ada_vax_float_type_suffix (struct type
*type
)
9400 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9403 /* A value representing the special debugging function that outputs
9404 VAX floating-point values of the type represented by TYPE. Assumes
9405 ada_is_vax_floating_type (TYPE). */
9408 ada_vax_float_print_function (struct type
*type
)
9410 switch (ada_vax_float_type_suffix (type
))
9413 return get_var_value ("DEBUG_STRING_F", 0);
9415 return get_var_value ("DEBUG_STRING_D", 0);
9417 return get_var_value ("DEBUG_STRING_G", 0);
9419 error (_("invalid VAX floating-point type"));
9426 /* Scan STR beginning at position K for a discriminant name, and
9427 return the value of that discriminant field of DVAL in *PX. If
9428 PNEW_K is not null, put the position of the character beyond the
9429 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9430 not alter *PX and *PNEW_K if unsuccessful. */
9433 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9436 static char *bound_buffer
= NULL
;
9437 static size_t bound_buffer_len
= 0;
9440 struct value
*bound_val
;
9442 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9445 pend
= strstr (str
+ k
, "__");
9449 k
+= strlen (bound
);
9453 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9454 bound
= bound_buffer
;
9455 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9456 bound
[pend
- (str
+ k
)] = '\0';
9460 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9461 if (bound_val
== NULL
)
9464 *px
= value_as_long (bound_val
);
9470 /* Value of variable named NAME in the current environment. If
9471 no such variable found, then if ERR_MSG is null, returns 0, and
9472 otherwise causes an error with message ERR_MSG. */
9474 static struct value
*
9475 get_var_value (char *name
, char *err_msg
)
9477 struct ada_symbol_info
*syms
;
9480 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9485 if (err_msg
== NULL
)
9488 error (("%s"), err_msg
);
9491 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9494 /* Value of integer variable named NAME in the current environment. If
9495 no such variable found, returns 0, and sets *FLAG to 0. If
9496 successful, sets *FLAG to 1. */
9499 get_int_var_value (char *name
, int *flag
)
9501 struct value
*var_val
= get_var_value (name
, 0);
9513 return value_as_long (var_val
);
9518 /* Return a range type whose base type is that of the range type named
9519 NAME in the current environment, and whose bounds are calculated
9520 from NAME according to the GNAT range encoding conventions.
9521 Extract discriminant values, if needed, from DVAL. If a new type
9522 must be created, allocate in OBJFILE's space. The bounds
9523 information, in general, is encoded in NAME, the base type given in
9524 the named range type. */
9526 static struct type
*
9527 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9529 struct type
*raw_type
= ada_find_any_type (name
);
9530 struct type
*base_type
;
9533 if (raw_type
== NULL
)
9534 base_type
= builtin_type_int
;
9535 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9536 base_type
= TYPE_TARGET_TYPE (raw_type
);
9538 base_type
= raw_type
;
9540 subtype_info
= strstr (name
, "___XD");
9541 if (subtype_info
== NULL
)
9545 static char *name_buf
= NULL
;
9546 static size_t name_len
= 0;
9547 int prefix_len
= subtype_info
- name
;
9553 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9554 strncpy (name_buf
, name
, prefix_len
);
9555 name_buf
[prefix_len
] = '\0';
9558 bounds_str
= strchr (subtype_info
, '_');
9561 if (*subtype_info
== 'L')
9563 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9564 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9566 if (bounds_str
[n
] == '_')
9568 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9575 strcpy (name_buf
+ prefix_len
, "___L");
9576 L
= get_int_var_value (name_buf
, &ok
);
9579 lim_warning (_("Unknown lower bound, using 1."));
9584 if (*subtype_info
== 'U')
9586 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9587 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9593 strcpy (name_buf
+ prefix_len
, "___U");
9594 U
= get_int_var_value (name_buf
, &ok
);
9597 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9602 if (objfile
== NULL
)
9603 objfile
= TYPE_OBJFILE (base_type
);
9604 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9605 TYPE_NAME (type
) = name
;
9610 /* True iff NAME is the name of a range type. */
9613 ada_is_range_type_name (const char *name
)
9615 return (name
!= NULL
&& strstr (name
, "___XD"));
9621 /* True iff TYPE is an Ada modular type. */
9624 ada_is_modular_type (struct type
*type
)
9626 struct type
*subranged_type
= base_type (type
);
9628 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9629 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
9630 && TYPE_UNSIGNED (subranged_type
));
9633 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9636 ada_modulus (struct type
* type
)
9638 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9642 /* Ada exception catchpoint support:
9643 ---------------------------------
9645 We support 3 kinds of exception catchpoints:
9646 . catchpoints on Ada exceptions
9647 . catchpoints on unhandled Ada exceptions
9648 . catchpoints on failed assertions
9650 Exceptions raised during failed assertions, or unhandled exceptions
9651 could perfectly be caught with the general catchpoint on Ada exceptions.
9652 However, we can easily differentiate these two special cases, and having
9653 the option to distinguish these two cases from the rest can be useful
9654 to zero-in on certain situations.
9656 Exception catchpoints are a specialized form of breakpoint,
9657 since they rely on inserting breakpoints inside known routines
9658 of the GNAT runtime. The implementation therefore uses a standard
9659 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9662 Support in the runtime for exception catchpoints have been changed
9663 a few times already, and these changes affect the implementation
9664 of these catchpoints. In order to be able to support several
9665 variants of the runtime, we use a sniffer that will determine
9666 the runtime variant used by the program being debugged.
9668 At this time, we do not support the use of conditions on Ada exception
9669 catchpoints. The COND and COND_STRING fields are therefore set
9670 to NULL (most of the time, see below).
9672 Conditions where EXP_STRING, COND, and COND_STRING are used:
9674 When a user specifies the name of a specific exception in the case
9675 of catchpoints on Ada exceptions, we store the name of that exception
9676 in the EXP_STRING. We then translate this request into an actual
9677 condition stored in COND_STRING, and then parse it into an expression
9680 /* The different types of catchpoints that we introduced for catching
9683 enum exception_catchpoint_kind
9686 ex_catch_exception_unhandled
,
9690 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9692 /* A structure that describes how to support exception catchpoints
9693 for a given executable. */
9695 struct exception_support_info
9697 /* The name of the symbol to break on in order to insert
9698 a catchpoint on exceptions. */
9699 const char *catch_exception_sym
;
9701 /* The name of the symbol to break on in order to insert
9702 a catchpoint on unhandled exceptions. */
9703 const char *catch_exception_unhandled_sym
;
9705 /* The name of the symbol to break on in order to insert
9706 a catchpoint on failed assertions. */
9707 const char *catch_assert_sym
;
9709 /* Assuming that the inferior just triggered an unhandled exception
9710 catchpoint, this function is responsible for returning the address
9711 in inferior memory where the name of that exception is stored.
9712 Return zero if the address could not be computed. */
9713 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9716 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9717 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9719 /* The following exception support info structure describes how to
9720 implement exception catchpoints with the latest version of the
9721 Ada runtime (as of 2007-03-06). */
9723 static const struct exception_support_info default_exception_support_info
=
9725 "__gnat_debug_raise_exception", /* catch_exception_sym */
9726 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9727 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9728 ada_unhandled_exception_name_addr
9731 /* The following exception support info structure describes how to
9732 implement exception catchpoints with a slightly older version
9733 of the Ada runtime. */
9735 static const struct exception_support_info exception_support_info_fallback
=
9737 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9738 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9739 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9740 ada_unhandled_exception_name_addr_from_raise
9743 /* For each executable, we sniff which exception info structure to use
9744 and cache it in the following global variable. */
9746 static const struct exception_support_info
*exception_info
= NULL
;
9748 /* Inspect the Ada runtime and determine which exception info structure
9749 should be used to provide support for exception catchpoints.
9751 This function will always set exception_info, or raise an error. */
9754 ada_exception_support_info_sniffer (void)
9758 /* If the exception info is already known, then no need to recompute it. */
9759 if (exception_info
!= NULL
)
9762 /* Check the latest (default) exception support info. */
9763 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9767 exception_info
= &default_exception_support_info
;
9771 /* Try our fallback exception suport info. */
9772 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9776 exception_info
= &exception_support_info_fallback
;
9780 /* Sometimes, it is normal for us to not be able to find the routine
9781 we are looking for. This happens when the program is linked with
9782 the shared version of the GNAT runtime, and the program has not been
9783 started yet. Inform the user of these two possible causes if
9786 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9787 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9789 /* If the symbol does not exist, then check that the program is
9790 already started, to make sure that shared libraries have been
9791 loaded. If it is not started, this may mean that the symbol is
9792 in a shared library. */
9794 if (ptid_get_pid (inferior_ptid
) == 0)
9795 error (_("Unable to insert catchpoint. Try to start the program first."));
9797 /* At this point, we know that we are debugging an Ada program and
9798 that the inferior has been started, but we still are not able to
9799 find the run-time symbols. That can mean that we are in
9800 configurable run time mode, or that a-except as been optimized
9801 out by the linker... In any case, at this point it is not worth
9802 supporting this feature. */
9804 error (_("Cannot insert catchpoints in this configuration."));
9807 /* An observer of "executable_changed" events.
9808 Its role is to clear certain cached values that need to be recomputed
9809 each time a new executable is loaded by GDB. */
9812 ada_executable_changed_observer (void *unused
)
9814 /* If the executable changed, then it is possible that the Ada runtime
9815 is different. So we need to invalidate the exception support info
9817 exception_info
= NULL
;
9820 /* Return the name of the function at PC, NULL if could not find it.
9821 This function only checks the debugging information, not the symbol
9825 function_name_from_pc (CORE_ADDR pc
)
9829 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9835 /* True iff FRAME is very likely to be that of a function that is
9836 part of the runtime system. This is all very heuristic, but is
9837 intended to be used as advice as to what frames are uninteresting
9841 is_known_support_routine (struct frame_info
*frame
)
9843 struct symtab_and_line sal
;
9847 /* If this code does not have any debugging information (no symtab),
9848 This cannot be any user code. */
9850 find_frame_sal (frame
, &sal
);
9851 if (sal
.symtab
== NULL
)
9854 /* If there is a symtab, but the associated source file cannot be
9855 located, then assume this is not user code: Selecting a frame
9856 for which we cannot display the code would not be very helpful
9857 for the user. This should also take care of case such as VxWorks
9858 where the kernel has some debugging info provided for a few units. */
9860 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9863 /* Check the unit filename againt the Ada runtime file naming.
9864 We also check the name of the objfile against the name of some
9865 known system libraries that sometimes come with debugging info
9868 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9870 re_comp (known_runtime_file_name_patterns
[i
]);
9871 if (re_exec (sal
.symtab
->filename
))
9873 if (sal
.symtab
->objfile
!= NULL
9874 && re_exec (sal
.symtab
->objfile
->name
))
9878 /* Check whether the function is a GNAT-generated entity. */
9880 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9881 if (func_name
== NULL
)
9884 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9886 re_comp (known_auxiliary_function_name_patterns
[i
]);
9887 if (re_exec (func_name
))
9894 /* Find the first frame that contains debugging information and that is not
9895 part of the Ada run-time, starting from FI and moving upward. */
9898 ada_find_printable_frame (struct frame_info
*fi
)
9900 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9902 if (!is_known_support_routine (fi
))
9911 /* Assuming that the inferior just triggered an unhandled exception
9912 catchpoint, return the address in inferior memory where the name
9913 of the exception is stored.
9915 Return zero if the address could not be computed. */
9918 ada_unhandled_exception_name_addr (void)
9920 return parse_and_eval_address ("e.full_name");
9923 /* Same as ada_unhandled_exception_name_addr, except that this function
9924 should be used when the inferior uses an older version of the runtime,
9925 where the exception name needs to be extracted from a specific frame
9926 several frames up in the callstack. */
9929 ada_unhandled_exception_name_addr_from_raise (void)
9932 struct frame_info
*fi
;
9934 /* To determine the name of this exception, we need to select
9935 the frame corresponding to RAISE_SYM_NAME. This frame is
9936 at least 3 levels up, so we simply skip the first 3 frames
9937 without checking the name of their associated function. */
9938 fi
= get_current_frame ();
9939 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9941 fi
= get_prev_frame (fi
);
9945 const char *func_name
=
9946 function_name_from_pc (get_frame_address_in_block (fi
));
9947 if (func_name
!= NULL
9948 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9949 break; /* We found the frame we were looking for... */
9950 fi
= get_prev_frame (fi
);
9957 return parse_and_eval_address ("id.full_name");
9960 /* Assuming the inferior just triggered an Ada exception catchpoint
9961 (of any type), return the address in inferior memory where the name
9962 of the exception is stored, if applicable.
9964 Return zero if the address could not be computed, or if not relevant. */
9967 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9968 struct breakpoint
*b
)
9972 case ex_catch_exception
:
9973 return (parse_and_eval_address ("e.full_name"));
9976 case ex_catch_exception_unhandled
:
9977 return exception_info
->unhandled_exception_name_addr ();
9980 case ex_catch_assert
:
9981 return 0; /* Exception name is not relevant in this case. */
9985 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9989 return 0; /* Should never be reached. */
9992 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9993 any error that ada_exception_name_addr_1 might cause to be thrown.
9994 When an error is intercepted, a warning with the error message is printed,
9995 and zero is returned. */
9998 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9999 struct breakpoint
*b
)
10001 struct gdb_exception e
;
10002 CORE_ADDR result
= 0;
10004 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10006 result
= ada_exception_name_addr_1 (ex
, b
);
10011 warning (_("failed to get exception name: %s"), e
.message
);
10018 /* Implement the PRINT_IT method in the breakpoint_ops structure
10019 for all exception catchpoint kinds. */
10021 static enum print_stop_action
10022 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10024 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10025 char exception_name
[256];
10029 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10030 exception_name
[sizeof (exception_name
) - 1] = '\0';
10033 ada_find_printable_frame (get_current_frame ());
10035 annotate_catchpoint (b
->number
);
10038 case ex_catch_exception
:
10040 printf_filtered (_("\nCatchpoint %d, %s at "),
10041 b
->number
, exception_name
);
10043 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10045 case ex_catch_exception_unhandled
:
10047 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10048 b
->number
, exception_name
);
10050 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10053 case ex_catch_assert
:
10054 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10059 return PRINT_SRC_AND_LOC
;
10062 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10063 for all exception catchpoint kinds. */
10066 print_one_exception (enum exception_catchpoint_kind ex
,
10067 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10071 annotate_field (4);
10072 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10075 annotate_field (5);
10076 *last_addr
= b
->loc
->address
;
10079 case ex_catch_exception
:
10080 if (b
->exp_string
!= NULL
)
10082 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10084 ui_out_field_string (uiout
, "what", msg
);
10088 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10092 case ex_catch_exception_unhandled
:
10093 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10096 case ex_catch_assert
:
10097 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10101 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10106 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10107 for all exception catchpoint kinds. */
10110 print_mention_exception (enum exception_catchpoint_kind ex
,
10111 struct breakpoint
*b
)
10115 case ex_catch_exception
:
10116 if (b
->exp_string
!= NULL
)
10117 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10118 b
->number
, b
->exp_string
);
10120 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10124 case ex_catch_exception_unhandled
:
10125 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10129 case ex_catch_assert
:
10130 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10134 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10139 /* Virtual table for "catch exception" breakpoints. */
10141 static enum print_stop_action
10142 print_it_catch_exception (struct breakpoint
*b
)
10144 return print_it_exception (ex_catch_exception
, b
);
10148 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10150 print_one_exception (ex_catch_exception
, b
, last_addr
);
10154 print_mention_catch_exception (struct breakpoint
*b
)
10156 print_mention_exception (ex_catch_exception
, b
);
10159 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10161 print_it_catch_exception
,
10162 print_one_catch_exception
,
10163 print_mention_catch_exception
10166 /* Virtual table for "catch exception unhandled" breakpoints. */
10168 static enum print_stop_action
10169 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10171 return print_it_exception (ex_catch_exception_unhandled
, b
);
10175 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10177 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10181 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10183 print_mention_exception (ex_catch_exception_unhandled
, b
);
10186 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10187 print_it_catch_exception_unhandled
,
10188 print_one_catch_exception_unhandled
,
10189 print_mention_catch_exception_unhandled
10192 /* Virtual table for "catch assert" breakpoints. */
10194 static enum print_stop_action
10195 print_it_catch_assert (struct breakpoint
*b
)
10197 return print_it_exception (ex_catch_assert
, b
);
10201 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10203 print_one_exception (ex_catch_assert
, b
, last_addr
);
10207 print_mention_catch_assert (struct breakpoint
*b
)
10209 print_mention_exception (ex_catch_assert
, b
);
10212 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10213 print_it_catch_assert
,
10214 print_one_catch_assert
,
10215 print_mention_catch_assert
10218 /* Return non-zero if B is an Ada exception catchpoint. */
10221 ada_exception_catchpoint_p (struct breakpoint
*b
)
10223 return (b
->ops
== &catch_exception_breakpoint_ops
10224 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10225 || b
->ops
== &catch_assert_breakpoint_ops
);
10228 /* Return a newly allocated copy of the first space-separated token
10229 in ARGSP, and then adjust ARGSP to point immediately after that
10232 Return NULL if ARGPS does not contain any more tokens. */
10235 ada_get_next_arg (char **argsp
)
10237 char *args
= *argsp
;
10241 /* Skip any leading white space. */
10243 while (isspace (*args
))
10246 if (args
[0] == '\0')
10247 return NULL
; /* No more arguments. */
10249 /* Find the end of the current argument. */
10252 while (*end
!= '\0' && !isspace (*end
))
10255 /* Adjust ARGSP to point to the start of the next argument. */
10259 /* Make a copy of the current argument and return it. */
10261 result
= xmalloc (end
- args
+ 1);
10262 strncpy (result
, args
, end
- args
);
10263 result
[end
- args
] = '\0';
10268 /* Split the arguments specified in a "catch exception" command.
10269 Set EX to the appropriate catchpoint type.
10270 Set EXP_STRING to the name of the specific exception if
10271 specified by the user. */
10274 catch_ada_exception_command_split (char *args
,
10275 enum exception_catchpoint_kind
*ex
,
10278 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10279 char *exception_name
;
10281 exception_name
= ada_get_next_arg (&args
);
10282 make_cleanup (xfree
, exception_name
);
10284 /* Check that we do not have any more arguments. Anything else
10287 while (isspace (*args
))
10290 if (args
[0] != '\0')
10291 error (_("Junk at end of expression"));
10293 discard_cleanups (old_chain
);
10295 if (exception_name
== NULL
)
10297 /* Catch all exceptions. */
10298 *ex
= ex_catch_exception
;
10299 *exp_string
= NULL
;
10301 else if (strcmp (exception_name
, "unhandled") == 0)
10303 /* Catch unhandled exceptions. */
10304 *ex
= ex_catch_exception_unhandled
;
10305 *exp_string
= NULL
;
10309 /* Catch a specific exception. */
10310 *ex
= ex_catch_exception
;
10311 *exp_string
= exception_name
;
10315 /* Return the name of the symbol on which we should break in order to
10316 implement a catchpoint of the EX kind. */
10318 static const char *
10319 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10321 gdb_assert (exception_info
!= NULL
);
10325 case ex_catch_exception
:
10326 return (exception_info
->catch_exception_sym
);
10328 case ex_catch_exception_unhandled
:
10329 return (exception_info
->catch_exception_unhandled_sym
);
10331 case ex_catch_assert
:
10332 return (exception_info
->catch_assert_sym
);
10335 internal_error (__FILE__
, __LINE__
,
10336 _("unexpected catchpoint kind (%d)"), ex
);
10340 /* Return the breakpoint ops "virtual table" used for catchpoints
10343 static struct breakpoint_ops
*
10344 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10348 case ex_catch_exception
:
10349 return (&catch_exception_breakpoint_ops
);
10351 case ex_catch_exception_unhandled
:
10352 return (&catch_exception_unhandled_breakpoint_ops
);
10354 case ex_catch_assert
:
10355 return (&catch_assert_breakpoint_ops
);
10358 internal_error (__FILE__
, __LINE__
,
10359 _("unexpected catchpoint kind (%d)"), ex
);
10363 /* Return the condition that will be used to match the current exception
10364 being raised with the exception that the user wants to catch. This
10365 assumes that this condition is used when the inferior just triggered
10366 an exception catchpoint.
10368 The string returned is a newly allocated string that needs to be
10369 deallocated later. */
10372 ada_exception_catchpoint_cond_string (const char *exp_string
)
10374 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10377 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10379 static struct expression
*
10380 ada_parse_catchpoint_condition (char *cond_string
,
10381 struct symtab_and_line sal
)
10383 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10386 /* Return the symtab_and_line that should be used to insert an exception
10387 catchpoint of the TYPE kind.
10389 EX_STRING should contain the name of a specific exception
10390 that the catchpoint should catch, or NULL otherwise.
10392 The idea behind all the remaining parameters is that their names match
10393 the name of certain fields in the breakpoint structure that are used to
10394 handle exception catchpoints. This function returns the value to which
10395 these fields should be set, depending on the type of catchpoint we need
10398 If COND and COND_STRING are both non-NULL, any value they might
10399 hold will be free'ed, and then replaced by newly allocated ones.
10400 These parameters are left untouched otherwise. */
10402 static struct symtab_and_line
10403 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10404 char **addr_string
, char **cond_string
,
10405 struct expression
**cond
, struct breakpoint_ops
**ops
)
10407 const char *sym_name
;
10408 struct symbol
*sym
;
10409 struct symtab_and_line sal
;
10411 /* First, find out which exception support info to use. */
10412 ada_exception_support_info_sniffer ();
10414 /* Then lookup the function on which we will break in order to catch
10415 the Ada exceptions requested by the user. */
10417 sym_name
= ada_exception_sym_name (ex
);
10418 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10420 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10421 that should be compiled with debugging information. As a result, we
10422 expect to find that symbol in the symtabs. If we don't find it, then
10423 the target most likely does not support Ada exceptions, or we cannot
10424 insert exception breakpoints yet, because the GNAT runtime hasn't been
10427 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10428 in such a way that no debugging information is produced for the symbol
10429 we are looking for. In this case, we could search the minimal symbols
10430 as a fall-back mechanism. This would still be operating in degraded
10431 mode, however, as we would still be missing the debugging information
10432 that is needed in order to extract the name of the exception being
10433 raised (this name is printed in the catchpoint message, and is also
10434 used when trying to catch a specific exception). We do not handle
10435 this case for now. */
10438 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10440 /* Make sure that the symbol we found corresponds to a function. */
10441 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10442 error (_("Symbol \"%s\" is not a function (class = %d)"),
10443 sym_name
, SYMBOL_CLASS (sym
));
10445 sal
= find_function_start_sal (sym
, 1);
10447 /* Set ADDR_STRING. */
10449 *addr_string
= xstrdup (sym_name
);
10451 /* Set the COND and COND_STRING (if not NULL). */
10453 if (cond_string
!= NULL
&& cond
!= NULL
)
10455 if (*cond_string
!= NULL
)
10457 xfree (*cond_string
);
10458 *cond_string
= NULL
;
10465 if (exp_string
!= NULL
)
10467 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10468 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10473 *ops
= ada_exception_breakpoint_ops (ex
);
10478 /* Parse the arguments (ARGS) of the "catch exception" command.
10480 Set TYPE to the appropriate exception catchpoint type.
10481 If the user asked the catchpoint to catch only a specific
10482 exception, then save the exception name in ADDR_STRING.
10484 See ada_exception_sal for a description of all the remaining
10485 function arguments of this function. */
10487 struct symtab_and_line
10488 ada_decode_exception_location (char *args
, char **addr_string
,
10489 char **exp_string
, char **cond_string
,
10490 struct expression
**cond
,
10491 struct breakpoint_ops
**ops
)
10493 enum exception_catchpoint_kind ex
;
10495 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10496 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10500 struct symtab_and_line
10501 ada_decode_assert_location (char *args
, char **addr_string
,
10502 struct breakpoint_ops
**ops
)
10504 /* Check that no argument where provided at the end of the command. */
10508 while (isspace (*args
))
10511 error (_("Junk at end of arguments."));
10514 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10519 /* Information about operators given special treatment in functions
10521 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10523 #define ADA_OPERATORS \
10524 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10525 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10526 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10527 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10528 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10529 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10530 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10531 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10532 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10533 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10534 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10535 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10536 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10537 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10538 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10539 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10540 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10541 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10542 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10545 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10547 switch (exp
->elts
[pc
- 1].opcode
)
10550 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10553 #define OP_DEFN(op, len, args, binop) \
10554 case op: *oplenp = len; *argsp = args; break;
10560 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10565 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10571 ada_op_name (enum exp_opcode opcode
)
10576 return op_name_standard (opcode
);
10578 #define OP_DEFN(op, len, args, binop) case op: return #op;
10583 return "OP_AGGREGATE";
10585 return "OP_CHOICES";
10591 /* As for operator_length, but assumes PC is pointing at the first
10592 element of the operator, and gives meaningful results only for the
10593 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10596 ada_forward_operator_length (struct expression
*exp
, int pc
,
10597 int *oplenp
, int *argsp
)
10599 switch (exp
->elts
[pc
].opcode
)
10602 *oplenp
= *argsp
= 0;
10605 #define OP_DEFN(op, len, args, binop) \
10606 case op: *oplenp = len; *argsp = args; break;
10612 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10617 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10623 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10624 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10632 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10634 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10639 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10643 /* Ada attributes ('Foo). */
10646 case OP_ATR_LENGTH
:
10650 case OP_ATR_MODULUS
:
10657 case UNOP_IN_RANGE
:
10659 /* XXX: gdb_sprint_host_address, type_sprint */
10660 fprintf_filtered (stream
, _("Type @"));
10661 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10662 fprintf_filtered (stream
, " (");
10663 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10664 fprintf_filtered (stream
, ")");
10666 case BINOP_IN_BOUNDS
:
10667 fprintf_filtered (stream
, " (%d)",
10668 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10670 case TERNOP_IN_RANGE
:
10675 case OP_DISCRETE_RANGE
:
10676 case OP_POSITIONAL
:
10683 char *name
= &exp
->elts
[elt
+ 2].string
;
10684 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10685 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10690 return dump_subexp_body_standard (exp
, stream
, elt
);
10694 for (i
= 0; i
< nargs
; i
+= 1)
10695 elt
= dump_subexp (exp
, stream
, elt
);
10700 /* The Ada extension of print_subexp (q.v.). */
10703 ada_print_subexp (struct expression
*exp
, int *pos
,
10704 struct ui_file
*stream
, enum precedence prec
)
10706 int oplen
, nargs
, i
;
10708 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10710 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10717 print_subexp_standard (exp
, pos
, stream
, prec
);
10721 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10724 case BINOP_IN_BOUNDS
:
10725 /* XXX: sprint_subexp */
10726 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10727 fputs_filtered (" in ", stream
);
10728 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10729 fputs_filtered ("'range", stream
);
10730 if (exp
->elts
[pc
+ 1].longconst
> 1)
10731 fprintf_filtered (stream
, "(%ld)",
10732 (long) exp
->elts
[pc
+ 1].longconst
);
10735 case TERNOP_IN_RANGE
:
10736 if (prec
>= PREC_EQUAL
)
10737 fputs_filtered ("(", stream
);
10738 /* XXX: sprint_subexp */
10739 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10740 fputs_filtered (" in ", stream
);
10741 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10742 fputs_filtered (" .. ", stream
);
10743 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10744 if (prec
>= PREC_EQUAL
)
10745 fputs_filtered (")", stream
);
10750 case OP_ATR_LENGTH
:
10754 case OP_ATR_MODULUS
:
10759 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10761 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10762 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10766 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10767 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10771 for (tem
= 1; tem
< nargs
; tem
+= 1)
10773 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10774 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10776 fputs_filtered (")", stream
);
10781 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10782 fputs_filtered ("'(", stream
);
10783 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10784 fputs_filtered (")", stream
);
10787 case UNOP_IN_RANGE
:
10788 /* XXX: sprint_subexp */
10789 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10790 fputs_filtered (" in ", stream
);
10791 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10794 case OP_DISCRETE_RANGE
:
10795 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10796 fputs_filtered ("..", stream
);
10797 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10801 fputs_filtered ("others => ", stream
);
10802 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10806 for (i
= 0; i
< nargs
-1; i
+= 1)
10809 fputs_filtered ("|", stream
);
10810 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10812 fputs_filtered (" => ", stream
);
10813 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10816 case OP_POSITIONAL
:
10817 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10821 fputs_filtered ("(", stream
);
10822 for (i
= 0; i
< nargs
; i
+= 1)
10825 fputs_filtered (", ", stream
);
10826 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10828 fputs_filtered (")", stream
);
10833 /* Table mapping opcodes into strings for printing operators
10834 and precedences of the operators. */
10836 static const struct op_print ada_op_print_tab
[] = {
10837 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10838 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10839 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10840 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10841 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10842 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10843 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10844 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10845 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10846 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10847 {">", BINOP_GTR
, PREC_ORDER
, 0},
10848 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10849 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10850 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10851 {"+", BINOP_ADD
, PREC_ADD
, 0},
10852 {"-", BINOP_SUB
, PREC_ADD
, 0},
10853 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10854 {"*", BINOP_MUL
, PREC_MUL
, 0},
10855 {"/", BINOP_DIV
, PREC_MUL
, 0},
10856 {"rem", BINOP_REM
, PREC_MUL
, 0},
10857 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10858 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10859 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10860 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10861 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10862 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10863 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10864 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10865 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10866 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10867 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10871 enum ada_primitive_types
{
10872 ada_primitive_type_int
,
10873 ada_primitive_type_long
,
10874 ada_primitive_type_short
,
10875 ada_primitive_type_char
,
10876 ada_primitive_type_float
,
10877 ada_primitive_type_double
,
10878 ada_primitive_type_void
,
10879 ada_primitive_type_long_long
,
10880 ada_primitive_type_long_double
,
10881 ada_primitive_type_natural
,
10882 ada_primitive_type_positive
,
10883 ada_primitive_type_system_address
,
10884 nr_ada_primitive_types
10888 ada_language_arch_info (struct gdbarch
*gdbarch
,
10889 struct language_arch_info
*lai
)
10891 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10892 lai
->primitive_type_vector
10893 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10895 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10896 init_type (TYPE_CODE_INT
,
10897 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10898 0, "integer", (struct objfile
*) NULL
);
10899 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10900 init_type (TYPE_CODE_INT
,
10901 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10902 0, "long_integer", (struct objfile
*) NULL
);
10903 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10904 init_type (TYPE_CODE_INT
,
10905 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10906 0, "short_integer", (struct objfile
*) NULL
);
10907 lai
->string_char_type
=
10908 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10909 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10910 0, "character", (struct objfile
*) NULL
);
10911 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10912 init_type (TYPE_CODE_FLT
,
10913 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10914 0, "float", (struct objfile
*) NULL
);
10915 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10916 init_type (TYPE_CODE_FLT
,
10917 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10918 0, "long_float", (struct objfile
*) NULL
);
10919 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10920 init_type (TYPE_CODE_INT
,
10921 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10922 0, "long_long_integer", (struct objfile
*) NULL
);
10923 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10924 init_type (TYPE_CODE_FLT
,
10925 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10926 0, "long_long_float", (struct objfile
*) NULL
);
10927 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10928 init_type (TYPE_CODE_INT
,
10929 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10930 0, "natural", (struct objfile
*) NULL
);
10931 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10932 init_type (TYPE_CODE_INT
,
10933 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10934 0, "positive", (struct objfile
*) NULL
);
10935 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10937 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10938 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10939 (struct objfile
*) NULL
));
10940 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10941 = "system__address";
10944 /* Language vector */
10946 /* Not really used, but needed in the ada_language_defn. */
10949 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10951 ada_emit_char (c
, stream
, quoter
, 1);
10957 warnings_issued
= 0;
10958 return ada_parse ();
10961 static const struct exp_descriptor ada_exp_descriptor
= {
10963 ada_operator_length
,
10965 ada_dump_subexp_body
,
10966 ada_evaluate_subexp
10969 const struct language_defn ada_language_defn
= {
10970 "ada", /* Language name */
10974 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10975 that's not quite what this means. */
10977 &ada_exp_descriptor
,
10981 ada_printchar
, /* Print a character constant */
10982 ada_printstr
, /* Function to print string constant */
10983 emit_char
, /* Function to print single char (not used) */
10984 ada_print_type
, /* Print a type using appropriate syntax */
10985 ada_val_print
, /* Print a value using appropriate syntax */
10986 ada_value_print
, /* Print a top-level value */
10987 NULL
, /* Language specific skip_trampoline */
10988 NULL
, /* name_of_this */
10989 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10990 basic_lookup_transparent_type
, /* lookup_transparent_type */
10991 ada_la_decode
, /* Language specific symbol demangler */
10992 NULL
, /* Language specific class_name_from_physname */
10993 ada_op_print_tab
, /* expression operators for printing */
10994 0, /* c-style arrays */
10995 1, /* String lower bound */
10996 ada_get_gdb_completer_word_break_characters
,
10997 ada_make_symbol_completion_list
,
10998 ada_language_arch_info
,
10999 ada_print_array_index
,
11000 default_pass_by_reference
,
11005 _initialize_ada_language (void)
11007 add_language (&ada_language_defn
);
11009 varsize_limit
= 65536;
11011 obstack_init (&symbol_list_obstack
);
11013 decoded_names_store
= htab_create_alloc
11014 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11015 NULL
, xcalloc
, xfree
);
11017 observer_attach_executable_changed (ada_executable_changed_observer
);