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
*, int);
120 static int is_nonfunction (struct ada_symbol_info
*, int);
122 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
125 static int num_defns_collected (struct obstack
*);
127 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
129 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
130 *, const char *, int,
133 static struct symtab
*symtab_for_sym (struct symbol
*);
135 static struct value
*resolve_subexp (struct expression
**, int *, int,
138 static void replace_operator_with_call (struct expression
**, int, int, int,
139 struct symbol
*, struct block
*);
141 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
143 static char *ada_op_name (enum exp_opcode
);
145 static const char *ada_decoded_op_name (enum exp_opcode
);
147 static int numeric_type_p (struct type
*);
149 static int integer_type_p (struct type
*);
151 static int scalar_type_p (struct type
*);
153 static int discrete_type_p (struct type
*);
155 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
160 static struct symbol
*find_old_style_renaming_symbol (const char *,
163 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
166 static struct value
*evaluate_subexp (struct type
*, struct expression
*,
169 static struct value
*evaluate_subexp_type (struct expression
*, int *);
171 static int is_dynamic_field (struct type
*, int);
173 static struct type
*to_fixed_variant_branch_type (struct type
*,
175 CORE_ADDR
, struct value
*);
177 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
179 static struct type
*to_fixed_range_type (char *, struct value
*,
182 static struct type
*to_static_fixed_type (struct type
*);
183 static struct type
*static_unwrap_type (struct type
*type
);
185 static struct value
*unwrap_value (struct value
*);
187 static struct type
*packed_array_type (struct type
*, long *);
189 static struct type
*decode_packed_array_type (struct type
*);
191 static struct value
*decode_packed_array (struct value
*);
193 static struct value
*value_subscript_packed (struct value
*, int,
196 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int);
198 static struct value
*coerce_unspec_val_to_type (struct value
*,
201 static struct value
*get_var_value (char *, char *);
203 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
205 static int equiv_types (struct type
*, struct type
*);
207 static int is_name_suffix (const char *);
209 static int is_digits_suffix (const char *str
);
211 static int wild_match (const char *, int, const char *);
213 static struct value
*ada_coerce_ref (struct value
*);
215 static LONGEST
pos_atr (struct value
*);
217 static struct value
*value_pos_atr (struct value
*);
219 static struct value
*value_val_atr (struct type
*, struct value
*);
221 static struct symbol
*standard_lookup (const char *, const struct block
*,
224 static struct value
*ada_search_struct_field (char *, struct value
*, int,
227 static struct value
*ada_value_primitive_field (struct value
*, int, int,
230 static int find_struct_field (char *, struct type
*, int,
231 struct type
**, int *, int *, int *, int *);
233 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
236 static struct value
*ada_to_fixed_value (struct value
*);
238 static int ada_resolve_function (struct ada_symbol_info
*, int,
239 struct value
**, int, const char *,
242 static struct value
*ada_coerce_to_simple_array (struct value
*);
244 static int ada_is_direct_array_type (struct type
*);
246 static void ada_language_arch_info (struct gdbarch
*,
247 struct language_arch_info
*);
249 static void check_size (const struct type
*);
251 static struct value
*ada_index_struct_field (int, struct value
*, int,
254 static struct value
*assign_aggregate (struct value
*, struct value
*,
255 struct expression
*, int *, enum noside
);
257 static void aggregate_assign_from_choices (struct value
*, struct value
*,
259 int *, LONGEST
*, int *,
260 int, LONGEST
, LONGEST
);
262 static void aggregate_assign_positional (struct value
*, struct value
*,
264 int *, LONGEST
*, int *, int,
268 static void aggregate_assign_others (struct value
*, struct value
*,
270 int *, LONGEST
*, int, LONGEST
, LONGEST
);
273 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
276 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
279 static void ada_forward_operator_length (struct expression
*, int, int *,
284 /* Maximum-sized dynamic type. */
285 static unsigned int varsize_limit
;
287 /* FIXME: brobecker/2003-09-17: No longer a const because it is
288 returned by a function that does not return a const char *. */
289 static char *ada_completer_word_break_characters
=
291 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
293 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
296 /* The name of the symbol to use to get the name of the main subprogram. */
297 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
298 = "__gnat_ada_main_program_name";
300 /* Limit on the number of warnings to raise per expression evaluation. */
301 static int warning_limit
= 2;
303 /* Number of warning messages issued; reset to 0 by cleanups after
304 expression evaluation. */
305 static int warnings_issued
= 0;
307 static const char *known_runtime_file_name_patterns
[] = {
308 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
311 static const char *known_auxiliary_function_name_patterns
[] = {
312 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
315 /* Space for allocating results of ada_lookup_symbol_list. */
316 static struct obstack symbol_list_obstack
;
320 /* Given DECODED_NAME a string holding a symbol name in its
321 decoded form (ie using the Ada dotted notation), returns
322 its unqualified name. */
325 ada_unqualified_name (const char *decoded_name
)
327 const char *result
= strrchr (decoded_name
, '.');
330 result
++; /* Skip the dot... */
332 result
= decoded_name
;
337 /* Return a string starting with '<', followed by STR, and '>'.
338 The result is good until the next call. */
341 add_angle_brackets (const char *str
)
343 static char *result
= NULL
;
346 result
= (char *) xmalloc ((strlen (str
) + 3) * sizeof (char));
348 sprintf (result
, "<%s>", str
);
353 ada_get_gdb_completer_word_break_characters (void)
355 return ada_completer_word_break_characters
;
358 /* Print an array element index using the Ada syntax. */
361 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
362 int format
, enum val_prettyprint pretty
)
364 LA_VALUE_PRINT (index_value
, stream
, format
, pretty
);
365 fprintf_filtered (stream
, " => ");
368 /* Read the string located at ADDR from the inferior and store the
372 extract_string (CORE_ADDR addr
, char *buf
)
376 /* Loop, reading one byte at a time, until we reach the '\000'
377 end-of-string marker. */
380 target_read_memory (addr
+ char_index
* sizeof (char),
381 buf
+ char_index
* sizeof (char), sizeof (char));
384 while (buf
[char_index
- 1] != '\000');
387 /* Assuming VECT points to an array of *SIZE objects of size
388 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
389 updating *SIZE as necessary and returning the (new) array. */
392 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
394 if (*size
< min_size
)
397 if (*size
< min_size
)
399 vect
= xrealloc (vect
, *size
* element_size
);
404 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
405 suffix of FIELD_NAME beginning "___". */
408 field_name_match (const char *field_name
, const char *target
)
410 int len
= strlen (target
);
412 (strncmp (field_name
, target
, len
) == 0
413 && (field_name
[len
] == '\0'
414 || (strncmp (field_name
+ len
, "___", 3) == 0
415 && strcmp (field_name
+ strlen (field_name
) - 6,
420 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
421 FIELD_NAME, and return its index. This function also handles fields
422 whose name have ___ suffixes because the compiler sometimes alters
423 their name by adding such a suffix to represent fields with certain
424 constraints. If the field could not be found, return a negative
425 number if MAYBE_MISSING is set. Otherwise raise an error. */
428 ada_get_field_index (const struct type
*type
, const char *field_name
,
432 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (type
); fieldno
++)
433 if (field_name_match (TYPE_FIELD_NAME (type
, fieldno
), field_name
))
437 error (_("Unable to find field %s in struct %s. Aborting"),
438 field_name
, TYPE_NAME (type
));
443 /* The length of the prefix of NAME prior to any "___" suffix. */
446 ada_name_prefix_len (const char *name
)
452 const char *p
= strstr (name
, "___");
454 return strlen (name
);
460 /* Return non-zero if SUFFIX is a suffix of STR.
461 Return zero if STR is null. */
464 is_suffix (const char *str
, const char *suffix
)
470 len2
= strlen (suffix
);
471 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
474 /* Create a value of type TYPE whose contents come from VALADDR, if it
475 is non-null, and whose memory address (in the inferior) is
479 value_from_contents_and_address (struct type
*type
,
480 const gdb_byte
*valaddr
,
483 struct value
*v
= allocate_value (type
);
485 set_value_lazy (v
, 1);
487 memcpy (value_contents_raw (v
), valaddr
, TYPE_LENGTH (type
));
488 VALUE_ADDRESS (v
) = address
;
490 VALUE_LVAL (v
) = lval_memory
;
494 /* The contents of value VAL, treated as a value of type TYPE. The
495 result is an lval in memory if VAL is. */
497 static struct value
*
498 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
500 type
= ada_check_typedef (type
);
501 if (value_type (val
) == type
)
505 struct value
*result
;
507 /* Make sure that the object size is not unreasonable before
508 trying to allocate some memory for it. */
511 result
= allocate_value (type
);
512 VALUE_LVAL (result
) = VALUE_LVAL (val
);
513 set_value_bitsize (result
, value_bitsize (val
));
514 set_value_bitpos (result
, value_bitpos (val
));
515 VALUE_ADDRESS (result
) = VALUE_ADDRESS (val
) + value_offset (val
);
517 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
518 set_value_lazy (result
, 1);
520 memcpy (value_contents_raw (result
), value_contents (val
),
526 static const gdb_byte
*
527 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
532 return valaddr
+ offset
;
536 cond_offset_target (CORE_ADDR address
, long offset
)
541 return address
+ offset
;
544 /* Issue a warning (as for the definition of warning in utils.c, but
545 with exactly one argument rather than ...), unless the limit on the
546 number of warnings has passed during the evaluation of the current
549 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
550 provided by "complaint". */
551 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
554 lim_warning (const char *format
, ...)
557 va_start (args
, format
);
559 warnings_issued
+= 1;
560 if (warnings_issued
<= warning_limit
)
561 vwarning (format
, args
);
566 /* Issue an error if the size of an object of type T is unreasonable,
567 i.e. if it would be a bad idea to allocate a value of this type in
571 check_size (const struct type
*type
)
573 if (TYPE_LENGTH (type
) > varsize_limit
)
574 error (_("object size is larger than varsize-limit"));
578 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
579 gdbtypes.h, but some of the necessary definitions in that file
580 seem to have gone missing. */
582 /* Maximum value of a SIZE-byte signed integer type. */
584 max_of_size (int size
)
586 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
587 return top_bit
| (top_bit
- 1);
590 /* Minimum value of a SIZE-byte signed integer type. */
592 min_of_size (int size
)
594 return -max_of_size (size
) - 1;
597 /* Maximum value of a SIZE-byte unsigned integer type. */
599 umax_of_size (int size
)
601 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
602 return top_bit
| (top_bit
- 1);
605 /* Maximum value of integral type T, as a signed quantity. */
607 max_of_type (struct type
*t
)
609 if (TYPE_UNSIGNED (t
))
610 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
612 return max_of_size (TYPE_LENGTH (t
));
615 /* Minimum value of integral type T, as a signed quantity. */
617 min_of_type (struct type
*t
)
619 if (TYPE_UNSIGNED (t
))
622 return min_of_size (TYPE_LENGTH (t
));
625 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
627 discrete_type_high_bound (struct type
*type
)
629 switch (TYPE_CODE (type
))
631 case TYPE_CODE_RANGE
:
632 return TYPE_HIGH_BOUND (type
);
634 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
639 return 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. */
647 discrete_type_low_bound (struct type
*type
)
649 switch (TYPE_CODE (type
))
651 case TYPE_CODE_RANGE
:
652 return TYPE_LOW_BOUND (type
);
654 return TYPE_FIELD_BITPOS (type
, 0);
659 return min_of_type (type
);
661 error (_("Unexpected type in discrete_type_low_bound."));
665 /* The identity on non-range types. For range types, the underlying
666 non-range scalar type. */
669 base_type (struct type
*type
)
671 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
673 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
675 type
= TYPE_TARGET_TYPE (type
);
681 /* Language Selection */
683 /* If the main program is in Ada, return language_ada, otherwise return LANG
684 (the main program is in Ada iif the adainit symbol is found).
686 MAIN_PST is not used. */
689 ada_update_initial_language (enum language lang
,
690 struct partial_symtab
*main_pst
)
692 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
693 (struct objfile
*) NULL
) != NULL
)
699 /* If the main procedure is written in Ada, then return its name.
700 The result is good until the next call. Return NULL if the main
701 procedure doesn't appear to be in Ada. */
706 struct minimal_symbol
*msym
;
707 CORE_ADDR main_program_name_addr
;
708 static char main_program_name
[1024];
710 /* For Ada, the name of the main procedure is stored in a specific
711 string constant, generated by the binder. Look for that symbol,
712 extract its address, and then read that string. If we didn't find
713 that string, then most probably the main procedure is not written
715 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
719 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
720 if (main_program_name_addr
== 0)
721 error (_("Invalid address for Ada main program name."));
723 extract_string (main_program_name_addr
, main_program_name
);
724 return main_program_name
;
727 /* The main procedure doesn't seem to be in Ada. */
733 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
736 const struct ada_opname_map ada_opname_table
[] = {
737 {"Oadd", "\"+\"", BINOP_ADD
},
738 {"Osubtract", "\"-\"", BINOP_SUB
},
739 {"Omultiply", "\"*\"", BINOP_MUL
},
740 {"Odivide", "\"/\"", BINOP_DIV
},
741 {"Omod", "\"mod\"", BINOP_MOD
},
742 {"Orem", "\"rem\"", BINOP_REM
},
743 {"Oexpon", "\"**\"", BINOP_EXP
},
744 {"Olt", "\"<\"", BINOP_LESS
},
745 {"Ole", "\"<=\"", BINOP_LEQ
},
746 {"Ogt", "\">\"", BINOP_GTR
},
747 {"Oge", "\">=\"", BINOP_GEQ
},
748 {"Oeq", "\"=\"", BINOP_EQUAL
},
749 {"One", "\"/=\"", BINOP_NOTEQUAL
},
750 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
751 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
752 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
753 {"Oconcat", "\"&\"", BINOP_CONCAT
},
754 {"Oabs", "\"abs\"", UNOP_ABS
},
755 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
756 {"Oadd", "\"+\"", UNOP_PLUS
},
757 {"Osubtract", "\"-\"", UNOP_NEG
},
761 /* Return non-zero if STR should be suppressed in info listings. */
764 is_suppressed_name (const char *str
)
766 if (strncmp (str
, "_ada_", 5) == 0)
768 if (str
[0] == '_' || str
[0] == '\000')
773 const char *suffix
= strstr (str
, "___");
774 if (suffix
!= NULL
&& suffix
[3] != 'X')
777 suffix
= str
+ strlen (str
);
778 for (p
= suffix
- 1; p
!= str
; p
-= 1)
782 if (p
[0] == 'X' && p
[-1] != '_')
786 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
787 if (strncmp (ada_opname_table
[i
].encoded
, p
,
788 strlen (ada_opname_table
[i
].encoded
)) == 0)
797 /* The "encoded" form of DECODED, according to GNAT conventions.
798 The result is valid until the next call to ada_encode. */
801 ada_encode (const char *decoded
)
803 static char *encoding_buffer
= NULL
;
804 static size_t encoding_buffer_size
= 0;
811 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
812 2 * strlen (decoded
) + 10);
815 for (p
= decoded
; *p
!= '\0'; p
+= 1)
817 if (!ADA_RETAIN_DOTS
&& *p
== '.')
819 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
824 const struct ada_opname_map
*mapping
;
826 for (mapping
= ada_opname_table
;
827 mapping
->encoded
!= NULL
828 && strncmp (mapping
->decoded
, p
,
829 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
831 if (mapping
->encoded
== NULL
)
832 error (_("invalid Ada operator name: %s"), p
);
833 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
834 k
+= strlen (mapping
->encoded
);
839 encoding_buffer
[k
] = *p
;
844 encoding_buffer
[k
] = '\0';
845 return encoding_buffer
;
848 /* Return NAME folded to lower case, or, if surrounded by single
849 quotes, unfolded, but with the quotes stripped away. Result good
853 ada_fold_name (const char *name
)
855 static char *fold_buffer
= NULL
;
856 static size_t fold_buffer_size
= 0;
858 int len
= strlen (name
);
859 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
863 strncpy (fold_buffer
, name
+ 1, len
- 2);
864 fold_buffer
[len
- 2] = '\000';
869 for (i
= 0; i
<= len
; i
+= 1)
870 fold_buffer
[i
] = tolower (name
[i
]);
876 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
879 is_lower_alphanum (const char c
)
881 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
884 /* Remove either of these suffixes:
889 These are suffixes introduced by the compiler for entities such as
890 nested subprogram for instance, in order to avoid name clashes.
891 They do not serve any purpose for the debugger. */
894 ada_remove_trailing_digits (const char *encoded
, int *len
)
896 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
899 while (i
> 0 && isdigit (encoded
[i
]))
901 if (i
>= 0 && encoded
[i
] == '.')
903 else if (i
>= 0 && encoded
[i
] == '$')
905 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
907 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
912 /* Remove the suffix introduced by the compiler for protected object
916 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
918 /* Remove trailing N. */
920 /* Protected entry subprograms are broken into two
921 separate subprograms: The first one is unprotected, and has
922 a 'N' suffix; the second is the protected version, and has
923 the 'P' suffix. The second calls the first one after handling
924 the protection. Since the P subprograms are internally generated,
925 we leave these names undecoded, giving the user a clue that this
926 entity is internal. */
929 && encoded
[*len
- 1] == 'N'
930 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
934 /* If ENCODED follows the GNAT entity encoding conventions, then return
935 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
938 The resulting string is valid until the next call of ada_decode.
939 If the string is unchanged by decoding, the original string pointer
943 ada_decode (const char *encoded
)
950 static char *decoding_buffer
= NULL
;
951 static size_t decoding_buffer_size
= 0;
953 /* The name of the Ada main procedure starts with "_ada_".
954 This prefix is not part of the decoded name, so skip this part
955 if we see this prefix. */
956 if (strncmp (encoded
, "_ada_", 5) == 0)
959 /* If the name starts with '_', then it is not a properly encoded
960 name, so do not attempt to decode it. Similarly, if the name
961 starts with '<', the name should not be decoded. */
962 if (encoded
[0] == '_' || encoded
[0] == '<')
965 len0
= strlen (encoded
);
967 ada_remove_trailing_digits (encoded
, &len0
);
968 ada_remove_po_subprogram_suffix (encoded
, &len0
);
970 /* Remove the ___X.* suffix if present. Do not forget to verify that
971 the suffix is located before the current "end" of ENCODED. We want
972 to avoid re-matching parts of ENCODED that have previously been
973 marked as discarded (by decrementing LEN0). */
974 p
= strstr (encoded
, "___");
975 if (p
!= NULL
&& p
- encoded
< len0
- 3)
983 /* Remove any trailing TKB suffix. It tells us that this symbol
984 is for the body of a task, but that information does not actually
985 appear in the decoded name. */
987 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
990 /* Remove trailing "B" suffixes. */
991 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
993 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
996 /* Make decoded big enough for possible expansion by operator name. */
998 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
999 decoded
= decoding_buffer
;
1001 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1003 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1006 while ((i
>= 0 && isdigit (encoded
[i
]))
1007 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1009 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1011 else if (encoded
[i
] == '$')
1015 /* The first few characters that are not alphabetic are not part
1016 of any encoding we use, so we can copy them over verbatim. */
1018 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1019 decoded
[j
] = encoded
[i
];
1024 /* Is this a symbol function? */
1025 if (at_start_name
&& encoded
[i
] == 'O')
1028 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1030 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1031 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1033 && !isalnum (encoded
[i
+ op_len
]))
1035 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1038 j
+= strlen (ada_opname_table
[k
].decoded
);
1042 if (ada_opname_table
[k
].encoded
!= NULL
)
1047 /* Replace "TK__" with "__", which will eventually be translated
1048 into "." (just below). */
1050 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1053 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1054 be translated into "." (just below). These are internal names
1055 generated for anonymous blocks inside which our symbol is nested. */
1057 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1058 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1059 && isdigit (encoded
[i
+4]))
1063 while (k
< len0
&& isdigit (encoded
[k
]))
1064 k
++; /* Skip any extra digit. */
1066 /* Double-check that the "__B_{DIGITS}+" sequence we found
1067 is indeed followed by "__". */
1068 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1072 /* Remove _E{DIGITS}+[sb] */
1074 /* Just as for protected object subprograms, there are 2 categories
1075 of subprograms created by the compiler for each entry. The first
1076 one implements the actual entry code, and has a suffix following
1077 the convention above; the second one implements the barrier and
1078 uses the same convention as above, except that the 'E' is replaced
1081 Just as above, we do not decode the name of barrier functions
1082 to give the user a clue that the code he is debugging has been
1083 internally generated. */
1085 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1086 && isdigit (encoded
[i
+2]))
1090 while (k
< len0
&& isdigit (encoded
[k
]))
1094 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1097 /* Just as an extra precaution, make sure that if this
1098 suffix is followed by anything else, it is a '_'.
1099 Otherwise, we matched this sequence by accident. */
1101 || (k
< len0
&& encoded
[k
] == '_'))
1106 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1107 the GNAT front-end in protected object subprograms. */
1110 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1112 /* Backtrack a bit up until we reach either the begining of
1113 the encoded name, or "__". Make sure that we only find
1114 digits or lowercase characters. */
1115 const char *ptr
= encoded
+ i
- 1;
1117 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1120 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1124 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1126 /* This is a X[bn]* sequence not separated from the previous
1127 part of the name with a non-alpha-numeric character (in other
1128 words, immediately following an alpha-numeric character), then
1129 verify that it is placed at the end of the encoded name. If
1130 not, then the encoding is not valid and we should abort the
1131 decoding. Otherwise, just skip it, it is used in body-nested
1135 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1139 else if (!ADA_RETAIN_DOTS
1140 && i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1142 /* Replace '__' by '.'. */
1150 /* It's a character part of the decoded name, so just copy it
1152 decoded
[j
] = encoded
[i
];
1157 decoded
[j
] = '\000';
1159 /* Decoded names should never contain any uppercase character.
1160 Double-check this, and abort the decoding if we find one. */
1162 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1163 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1166 if (strcmp (decoded
, encoded
) == 0)
1172 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1173 decoded
= decoding_buffer
;
1174 if (encoded
[0] == '<')
1175 strcpy (decoded
, encoded
);
1177 sprintf (decoded
, "<%s>", encoded
);
1182 /* Table for keeping permanent unique copies of decoded names. Once
1183 allocated, names in this table are never released. While this is a
1184 storage leak, it should not be significant unless there are massive
1185 changes in the set of decoded names in successive versions of a
1186 symbol table loaded during a single session. */
1187 static struct htab
*decoded_names_store
;
1189 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1190 in the language-specific part of GSYMBOL, if it has not been
1191 previously computed. Tries to save the decoded name in the same
1192 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1193 in any case, the decoded symbol has a lifetime at least that of
1195 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1196 const, but nevertheless modified to a semantically equivalent form
1197 when a decoded name is cached in it.
1201 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1204 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1205 if (*resultp
== NULL
)
1207 const char *decoded
= ada_decode (gsymbol
->name
);
1208 if (gsymbol
->obj_section
!= NULL
)
1210 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1211 *resultp
= obsavestring (decoded
, strlen (decoded
),
1212 &objf
->objfile_obstack
);
1214 /* Sometimes, we can't find a corresponding objfile, in which
1215 case, we put the result on the heap. Since we only decode
1216 when needed, we hope this usually does not cause a
1217 significant memory leak (FIXME). */
1218 if (*resultp
== NULL
)
1220 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1223 *slot
= xstrdup (decoded
);
1232 ada_la_decode (const char *encoded
, int options
)
1234 return xstrdup (ada_decode (encoded
));
1237 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1238 suffixes that encode debugging information or leading _ada_ on
1239 SYM_NAME (see is_name_suffix commentary for the debugging
1240 information that is ignored). If WILD, then NAME need only match a
1241 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1242 either argument is NULL. */
1245 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1247 if (sym_name
== NULL
|| name
== NULL
)
1250 return wild_match (name
, strlen (name
), sym_name
);
1253 int len_name
= strlen (name
);
1254 return (strncmp (sym_name
, name
, len_name
) == 0
1255 && is_name_suffix (sym_name
+ len_name
))
1256 || (strncmp (sym_name
, "_ada_", 5) == 0
1257 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1258 && is_name_suffix (sym_name
+ len_name
+ 5));
1262 /* True (non-zero) iff, in Ada mode, the symbol SYM should be
1263 suppressed in info listings. */
1266 ada_suppress_symbol_printing (struct symbol
*sym
)
1268 if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
)
1271 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym
));
1277 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1279 static char *bound_name
[] = {
1280 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1281 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1284 /* Maximum number of array dimensions we are prepared to handle. */
1286 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1288 /* Like modify_field, but allows bitpos > wordlength. */
1291 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1293 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1297 /* The desc_* routines return primitive portions of array descriptors
1300 /* The descriptor or array type, if any, indicated by TYPE; removes
1301 level of indirection, if needed. */
1303 static struct type
*
1304 desc_base_type (struct type
*type
)
1308 type
= ada_check_typedef (type
);
1310 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1311 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1312 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1317 /* True iff TYPE indicates a "thin" array pointer type. */
1320 is_thin_pntr (struct type
*type
)
1323 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1324 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1327 /* The descriptor type for thin pointer type TYPE. */
1329 static struct type
*
1330 thin_descriptor_type (struct type
*type
)
1332 struct type
*base_type
= desc_base_type (type
);
1333 if (base_type
== NULL
)
1335 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1339 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1340 if (alt_type
== NULL
)
1347 /* A pointer to the array data for thin-pointer value VAL. */
1349 static struct value
*
1350 thin_data_pntr (struct value
*val
)
1352 struct type
*type
= value_type (val
);
1353 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1354 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1357 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1358 VALUE_ADDRESS (val
) + value_offset (val
));
1361 /* True iff TYPE indicates a "thick" array pointer type. */
1364 is_thick_pntr (struct type
*type
)
1366 type
= desc_base_type (type
);
1367 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1368 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1371 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1372 pointer to one, the type of its bounds data; otherwise, NULL. */
1374 static struct type
*
1375 desc_bounds_type (struct type
*type
)
1379 type
= desc_base_type (type
);
1383 else if (is_thin_pntr (type
))
1385 type
= thin_descriptor_type (type
);
1388 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1390 return ada_check_typedef (r
);
1392 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1394 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1396 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1401 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1402 one, a pointer to its bounds data. Otherwise NULL. */
1404 static struct value
*
1405 desc_bounds (struct value
*arr
)
1407 struct type
*type
= ada_check_typedef (value_type (arr
));
1408 if (is_thin_pntr (type
))
1410 struct type
*bounds_type
=
1411 desc_bounds_type (thin_descriptor_type (type
));
1414 if (bounds_type
== NULL
)
1415 error (_("Bad GNAT array descriptor"));
1417 /* NOTE: The following calculation is not really kosher, but
1418 since desc_type is an XVE-encoded type (and shouldn't be),
1419 the correct calculation is a real pain. FIXME (and fix GCC). */
1420 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1421 addr
= value_as_long (arr
);
1423 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1426 value_from_longest (lookup_pointer_type (bounds_type
),
1427 addr
- TYPE_LENGTH (bounds_type
));
1430 else if (is_thick_pntr (type
))
1431 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1432 _("Bad GNAT array descriptor"));
1437 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1438 position of the field containing the address of the bounds data. */
1441 fat_pntr_bounds_bitpos (struct type
*type
)
1443 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1446 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1447 size of the field containing the address of the bounds data. */
1450 fat_pntr_bounds_bitsize (struct type
*type
)
1452 type
= desc_base_type (type
);
1454 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1455 return TYPE_FIELD_BITSIZE (type
, 1);
1457 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1460 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1461 pointer to one, the type of its array data (a
1462 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1463 ada_type_of_array to get an array type with bounds data. */
1465 static struct type
*
1466 desc_data_type (struct type
*type
)
1468 type
= desc_base_type (type
);
1470 /* NOTE: The following is bogus; see comment in desc_bounds. */
1471 if (is_thin_pntr (type
))
1472 return lookup_pointer_type
1473 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1474 else if (is_thick_pntr (type
))
1475 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1480 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1483 static struct value
*
1484 desc_data (struct value
*arr
)
1486 struct type
*type
= value_type (arr
);
1487 if (is_thin_pntr (type
))
1488 return thin_data_pntr (arr
);
1489 else if (is_thick_pntr (type
))
1490 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1491 _("Bad GNAT array descriptor"));
1497 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1498 position of the field containing the address of the data. */
1501 fat_pntr_data_bitpos (struct type
*type
)
1503 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1506 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1507 size of the field containing the address of the data. */
1510 fat_pntr_data_bitsize (struct type
*type
)
1512 type
= desc_base_type (type
);
1514 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1515 return TYPE_FIELD_BITSIZE (type
, 0);
1517 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1520 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1521 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1522 bound, if WHICH is 1. The first bound is I=1. */
1524 static struct value
*
1525 desc_one_bound (struct value
*bounds
, int i
, int which
)
1527 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1528 _("Bad GNAT array descriptor bounds"));
1531 /* If BOUNDS is an array-bounds structure type, return the bit position
1532 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1533 bound, if WHICH is 1. The first bound is I=1. */
1536 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1538 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1541 /* If BOUNDS is an array-bounds structure type, return the bit field size
1542 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1543 bound, if WHICH is 1. The first bound is I=1. */
1546 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1548 type
= desc_base_type (type
);
1550 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1551 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1553 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1556 /* If TYPE is the type of an array-bounds structure, the type of its
1557 Ith bound (numbering from 1). Otherwise, NULL. */
1559 static struct type
*
1560 desc_index_type (struct type
*type
, int i
)
1562 type
= desc_base_type (type
);
1564 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1565 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1570 /* The number of index positions in the array-bounds type TYPE.
1571 Return 0 if TYPE is NULL. */
1574 desc_arity (struct type
*type
)
1576 type
= desc_base_type (type
);
1579 return TYPE_NFIELDS (type
) / 2;
1583 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1584 an array descriptor type (representing an unconstrained array
1588 ada_is_direct_array_type (struct type
*type
)
1592 type
= ada_check_typedef (type
);
1593 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1594 || ada_is_array_descriptor_type (type
));
1597 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1601 ada_is_array_type (struct type
*type
)
1604 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1605 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1606 type
= TYPE_TARGET_TYPE (type
);
1607 return ada_is_direct_array_type (type
);
1610 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1613 ada_is_simple_array_type (struct type
*type
)
1617 type
= ada_check_typedef (type
);
1618 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1619 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1620 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1623 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1626 ada_is_array_descriptor_type (struct type
*type
)
1628 struct type
*data_type
= desc_data_type (type
);
1632 type
= ada_check_typedef (type
);
1635 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1636 && TYPE_TARGET_TYPE (data_type
) != NULL
1637 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1638 || TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1639 && desc_arity (desc_bounds_type (type
)) > 0;
1642 /* Non-zero iff type is a partially mal-formed GNAT array
1643 descriptor. FIXME: This is to compensate for some problems with
1644 debugging output from GNAT. Re-examine periodically to see if it
1648 ada_is_bogus_array_descriptor (struct type
*type
)
1652 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1653 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1654 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1655 && !ada_is_array_descriptor_type (type
);
1659 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1660 (fat pointer) returns the type of the array data described---specifically,
1661 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1662 in from the descriptor; otherwise, they are left unspecified. If
1663 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1664 returns NULL. The result is simply the type of ARR if ARR is not
1667 ada_type_of_array (struct value
*arr
, int bounds
)
1669 if (ada_is_packed_array_type (value_type (arr
)))
1670 return decode_packed_array_type (value_type (arr
));
1672 if (!ada_is_array_descriptor_type (value_type (arr
)))
1673 return value_type (arr
);
1677 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr
))));
1680 struct type
*elt_type
;
1682 struct value
*descriptor
;
1683 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1685 elt_type
= ada_array_element_type (value_type (arr
), -1);
1686 arity
= ada_array_arity (value_type (arr
));
1688 if (elt_type
== NULL
|| arity
== 0)
1689 return ada_check_typedef (value_type (arr
));
1691 descriptor
= desc_bounds (arr
);
1692 if (value_as_long (descriptor
) == 0)
1696 struct type
*range_type
= alloc_type (objf
);
1697 struct type
*array_type
= alloc_type (objf
);
1698 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1699 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1702 create_range_type (range_type
, value_type (low
),
1703 longest_to_int (value_as_long (low
)),
1704 longest_to_int (value_as_long (high
)));
1705 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1708 return lookup_pointer_type (elt_type
);
1712 /* If ARR does not represent an array, returns ARR unchanged.
1713 Otherwise, returns either a standard GDB array with bounds set
1714 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1715 GDB array. Returns NULL if ARR is a null fat pointer. */
1718 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1720 if (ada_is_array_descriptor_type (value_type (arr
)))
1722 struct type
*arrType
= ada_type_of_array (arr
, 1);
1723 if (arrType
== NULL
)
1725 return value_cast (arrType
, value_copy (desc_data (arr
)));
1727 else if (ada_is_packed_array_type (value_type (arr
)))
1728 return decode_packed_array (arr
);
1733 /* If ARR does not represent an array, returns ARR unchanged.
1734 Otherwise, returns a standard GDB array describing ARR (which may
1735 be ARR itself if it already is in the proper form). */
1737 static struct value
*
1738 ada_coerce_to_simple_array (struct value
*arr
)
1740 if (ada_is_array_descriptor_type (value_type (arr
)))
1742 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1744 error (_("Bounds unavailable for null array pointer."));
1745 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1746 return value_ind (arrVal
);
1748 else if (ada_is_packed_array_type (value_type (arr
)))
1749 return decode_packed_array (arr
);
1754 /* If TYPE represents a GNAT array type, return it translated to an
1755 ordinary GDB array type (possibly with BITSIZE fields indicating
1756 packing). For other types, is the identity. */
1759 ada_coerce_to_simple_array_type (struct type
*type
)
1761 struct value
*mark
= value_mark ();
1762 struct value
*dummy
= value_from_longest (builtin_type_long
, 0);
1763 struct type
*result
;
1764 deprecated_set_value_type (dummy
, type
);
1765 result
= ada_type_of_array (dummy
, 0);
1766 value_free_to_mark (mark
);
1770 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1773 ada_is_packed_array_type (struct type
*type
)
1777 type
= desc_base_type (type
);
1778 type
= ada_check_typedef (type
);
1780 ada_type_name (type
) != NULL
1781 && strstr (ada_type_name (type
), "___XP") != NULL
;
1784 /* Given that TYPE is a standard GDB array type with all bounds filled
1785 in, and that the element size of its ultimate scalar constituents
1786 (that is, either its elements, or, if it is an array of arrays, its
1787 elements' elements, etc.) is *ELT_BITS, return an identical type,
1788 but with the bit sizes of its elements (and those of any
1789 constituent arrays) recorded in the BITSIZE components of its
1790 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1793 static struct type
*
1794 packed_array_type (struct type
*type
, long *elt_bits
)
1796 struct type
*new_elt_type
;
1797 struct type
*new_type
;
1798 LONGEST low_bound
, high_bound
;
1800 type
= ada_check_typedef (type
);
1801 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1804 new_type
= alloc_type (TYPE_OBJFILE (type
));
1805 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1807 create_array_type (new_type
, new_elt_type
, TYPE_FIELD_TYPE (type
, 0));
1808 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1809 TYPE_NAME (new_type
) = ada_type_name (type
);
1811 if (get_discrete_bounds (TYPE_FIELD_TYPE (type
, 0),
1812 &low_bound
, &high_bound
) < 0)
1813 low_bound
= high_bound
= 0;
1814 if (high_bound
< low_bound
)
1815 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1818 *elt_bits
*= (high_bound
- low_bound
+ 1);
1819 TYPE_LENGTH (new_type
) =
1820 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1823 TYPE_FIXED_INSTANCE (new_type
) = 1;
1827 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1829 static struct type
*
1830 decode_packed_array_type (struct type
*type
)
1833 struct block
**blocks
;
1834 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1837 struct type
*shadow_type
;
1842 raw_name
= ada_type_name (desc_base_type (type
));
1847 name
= (char *) alloca (strlen (raw_name
) + 1);
1848 tail
= strstr (raw_name
, "___XP");
1849 type
= desc_base_type (type
);
1851 memcpy (name
, raw_name
, tail
- raw_name
);
1852 name
[tail
- raw_name
] = '\000';
1854 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1855 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1857 lim_warning (_("could not find bounds information on packed array"));
1860 shadow_type
= SYMBOL_TYPE (sym
);
1862 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1864 lim_warning (_("could not understand bounds information on packed array"));
1868 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1871 (_("could not understand bit size information on packed array"));
1875 return packed_array_type (shadow_type
, &bits
);
1878 /* Given that ARR is a struct value *indicating a GNAT packed array,
1879 returns a simple array that denotes that array. Its type is a
1880 standard GDB array type except that the BITSIZEs of the array
1881 target types are set to the number of bits in each element, and the
1882 type length is set appropriately. */
1884 static struct value
*
1885 decode_packed_array (struct value
*arr
)
1889 arr
= ada_coerce_ref (arr
);
1890 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1891 arr
= ada_value_ind (arr
);
1893 type
= decode_packed_array_type (value_type (arr
));
1896 error (_("can't unpack array"));
1900 if (gdbarch_bits_big_endian (current_gdbarch
)
1901 && ada_is_modular_type (value_type (arr
)))
1903 /* This is a (right-justified) modular type representing a packed
1904 array with no wrapper. In order to interpret the value through
1905 the (left-justified) packed array type we just built, we must
1906 first left-justify it. */
1907 int bit_size
, bit_pos
;
1910 mod
= ada_modulus (value_type (arr
)) - 1;
1917 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1918 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1919 bit_pos
/ HOST_CHAR_BIT
,
1920 bit_pos
% HOST_CHAR_BIT
,
1925 return coerce_unspec_val_to_type (arr
, type
);
1929 /* The value of the element of packed array ARR at the ARITY indices
1930 given in IND. ARR must be a simple array. */
1932 static struct value
*
1933 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1936 int bits
, elt_off
, bit_off
;
1937 long elt_total_bit_offset
;
1938 struct type
*elt_type
;
1942 elt_total_bit_offset
= 0;
1943 elt_type
= ada_check_typedef (value_type (arr
));
1944 for (i
= 0; i
< arity
; i
+= 1)
1946 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1947 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1949 (_("attempt to do packed indexing of something other than a packed array"));
1952 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1953 LONGEST lowerbound
, upperbound
;
1956 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1958 lim_warning (_("don't know bounds of array"));
1959 lowerbound
= upperbound
= 0;
1962 idx
= value_as_long (value_pos_atr (ind
[i
]));
1963 if (idx
< lowerbound
|| idx
> upperbound
)
1964 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1965 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1966 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1967 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1970 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1971 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1973 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1978 /* Non-zero iff TYPE includes negative integer values. */
1981 has_negatives (struct type
*type
)
1983 switch (TYPE_CODE (type
))
1988 return !TYPE_UNSIGNED (type
);
1989 case TYPE_CODE_RANGE
:
1990 return TYPE_LOW_BOUND (type
) < 0;
1995 /* Create a new value of type TYPE from the contents of OBJ starting
1996 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1997 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1998 assigning through the result will set the field fetched from.
1999 VALADDR is ignored unless OBJ is NULL, in which case,
2000 VALADDR+OFFSET must address the start of storage containing the
2001 packed value. The value returned in this case is never an lval.
2002 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2005 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2006 long offset
, int bit_offset
, int bit_size
,
2010 int src
, /* Index into the source area */
2011 targ
, /* Index into the target area */
2012 srcBitsLeft
, /* Number of source bits left to move */
2013 nsrc
, ntarg
, /* Number of source and target bytes */
2014 unusedLS
, /* Number of bits in next significant
2015 byte of source that are unused */
2016 accumSize
; /* Number of meaningful bits in accum */
2017 unsigned char *bytes
; /* First byte containing data to unpack */
2018 unsigned char *unpacked
;
2019 unsigned long accum
; /* Staging area for bits being transferred */
2021 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2022 /* Transmit bytes from least to most significant; delta is the direction
2023 the indices move. */
2024 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
2026 type
= ada_check_typedef (type
);
2030 v
= allocate_value (type
);
2031 bytes
= (unsigned char *) (valaddr
+ offset
);
2033 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2036 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
2037 bytes
= (unsigned char *) alloca (len
);
2038 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
2042 v
= allocate_value (type
);
2043 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2048 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
2049 if (VALUE_LVAL (obj
) == lval_internalvar
)
2050 VALUE_LVAL (v
) = lval_internalvar_component
;
2051 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
;
2052 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2053 set_value_bitsize (v
, bit_size
);
2054 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2056 VALUE_ADDRESS (v
) += 1;
2057 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2061 set_value_bitsize (v
, bit_size
);
2062 unpacked
= (unsigned char *) value_contents (v
);
2064 srcBitsLeft
= bit_size
;
2066 ntarg
= TYPE_LENGTH (type
);
2070 memset (unpacked
, 0, TYPE_LENGTH (type
));
2073 else if (gdbarch_bits_big_endian (current_gdbarch
))
2076 if (has_negatives (type
)
2077 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2081 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2084 switch (TYPE_CODE (type
))
2086 case TYPE_CODE_ARRAY
:
2087 case TYPE_CODE_UNION
:
2088 case TYPE_CODE_STRUCT
:
2089 /* Non-scalar values must be aligned at a byte boundary... */
2091 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2092 /* ... And are placed at the beginning (most-significant) bytes
2094 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2098 targ
= TYPE_LENGTH (type
) - 1;
2104 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2107 unusedLS
= bit_offset
;
2110 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2117 /* Mask for removing bits of the next source byte that are not
2118 part of the value. */
2119 unsigned int unusedMSMask
=
2120 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2122 /* Sign-extend bits for this byte. */
2123 unsigned int signMask
= sign
& ~unusedMSMask
;
2125 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2126 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2127 if (accumSize
>= HOST_CHAR_BIT
)
2129 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2130 accumSize
-= HOST_CHAR_BIT
;
2131 accum
>>= HOST_CHAR_BIT
;
2135 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2142 accum
|= sign
<< accumSize
;
2143 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2144 accumSize
-= HOST_CHAR_BIT
;
2145 accum
>>= HOST_CHAR_BIT
;
2153 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2154 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2157 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2158 int src_offset
, int n
)
2160 unsigned int accum
, mask
;
2161 int accum_bits
, chunk_size
;
2163 target
+= targ_offset
/ HOST_CHAR_BIT
;
2164 targ_offset
%= HOST_CHAR_BIT
;
2165 source
+= src_offset
/ HOST_CHAR_BIT
;
2166 src_offset
%= HOST_CHAR_BIT
;
2167 if (gdbarch_bits_big_endian (current_gdbarch
))
2169 accum
= (unsigned char) *source
;
2171 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2176 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2177 accum_bits
+= HOST_CHAR_BIT
;
2179 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2182 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2183 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2186 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2188 accum_bits
-= chunk_size
;
2195 accum
= (unsigned char) *source
>> src_offset
;
2197 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2201 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2202 accum_bits
+= HOST_CHAR_BIT
;
2204 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2207 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2208 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2210 accum_bits
-= chunk_size
;
2211 accum
>>= chunk_size
;
2218 /* Store the contents of FROMVAL into the location of TOVAL.
2219 Return a new value with the location of TOVAL and contents of
2220 FROMVAL. Handles assignment into packed fields that have
2221 floating-point or non-scalar types. */
2223 static struct value
*
2224 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2226 struct type
*type
= value_type (toval
);
2227 int bits
= value_bitsize (toval
);
2229 toval
= ada_coerce_ref (toval
);
2230 fromval
= ada_coerce_ref (fromval
);
2232 if (ada_is_direct_array_type (value_type (toval
)))
2233 toval
= ada_coerce_to_simple_array (toval
);
2234 if (ada_is_direct_array_type (value_type (fromval
)))
2235 fromval
= ada_coerce_to_simple_array (fromval
);
2237 if (!deprecated_value_modifiable (toval
))
2238 error (_("Left operand of assignment is not a modifiable lvalue."));
2240 if (VALUE_LVAL (toval
) == lval_memory
2242 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2243 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2245 int len
= (value_bitpos (toval
)
2246 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2248 char *buffer
= (char *) alloca (len
);
2250 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2252 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2253 fromval
= value_cast (type
, fromval
);
2255 read_memory (to_addr
, buffer
, len
);
2256 from_size
= value_bitsize (fromval
);
2258 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2259 if (gdbarch_bits_big_endian (current_gdbarch
))
2260 move_bits (buffer
, value_bitpos (toval
),
2261 value_contents (fromval
), from_size
- bits
, bits
);
2263 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2265 write_memory (to_addr
, buffer
, len
);
2266 if (deprecated_memory_changed_hook
)
2267 deprecated_memory_changed_hook (to_addr
, len
);
2269 val
= value_copy (toval
);
2270 memcpy (value_contents_raw (val
), value_contents (fromval
),
2271 TYPE_LENGTH (type
));
2272 deprecated_set_value_type (val
, type
);
2277 return value_assign (toval
, fromval
);
2281 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2282 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2283 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2284 * COMPONENT, and not the inferior's memory. The current contents
2285 * of COMPONENT are ignored. */
2287 value_assign_to_component (struct value
*container
, struct value
*component
,
2290 LONGEST offset_in_container
=
2291 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2292 - VALUE_ADDRESS (container
) - value_offset (container
));
2293 int bit_offset_in_container
=
2294 value_bitpos (component
) - value_bitpos (container
);
2297 val
= value_cast (value_type (component
), val
);
2299 if (value_bitsize (component
) == 0)
2300 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2302 bits
= value_bitsize (component
);
2304 if (gdbarch_bits_big_endian (current_gdbarch
))
2305 move_bits (value_contents_writeable (container
) + offset_in_container
,
2306 value_bitpos (container
) + bit_offset_in_container
,
2307 value_contents (val
),
2308 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2311 move_bits (value_contents_writeable (container
) + offset_in_container
,
2312 value_bitpos (container
) + bit_offset_in_container
,
2313 value_contents (val
), 0, bits
);
2316 /* The value of the element of array ARR at the ARITY indices given in IND.
2317 ARR may be either a simple array, GNAT array descriptor, or pointer
2321 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2325 struct type
*elt_type
;
2327 elt
= ada_coerce_to_simple_array (arr
);
2329 elt_type
= ada_check_typedef (value_type (elt
));
2330 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2331 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2332 return value_subscript_packed (elt
, arity
, ind
);
2334 for (k
= 0; k
< arity
; k
+= 1)
2336 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2337 error (_("too many subscripts (%d expected)"), k
);
2338 elt
= value_subscript (elt
, value_pos_atr (ind
[k
]));
2343 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2344 value of the element of *ARR at the ARITY indices given in
2345 IND. Does not read the entire array into memory. */
2348 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2353 for (k
= 0; k
< arity
; k
+= 1)
2358 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2359 error (_("too many subscripts (%d expected)"), k
);
2360 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2362 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2363 idx
= value_pos_atr (ind
[k
]);
2365 idx
= value_sub (idx
, value_from_longest (builtin_type_int
, lwb
));
2366 arr
= value_add (arr
, idx
);
2367 type
= TYPE_TARGET_TYPE (type
);
2370 return value_ind (arr
);
2373 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2374 actual type of ARRAY_PTR is ignored), returns a reference to
2375 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2376 bound of this array is LOW, as per Ada rules. */
2377 static struct value
*
2378 ada_value_slice_ptr (struct value
*array_ptr
, struct type
*type
,
2381 CORE_ADDR base
= value_as_address (array_ptr
)
2382 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2383 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2384 struct type
*index_type
=
2385 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2387 struct type
*slice_type
=
2388 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2389 return value_from_pointer (lookup_reference_type (slice_type
), base
);
2393 static struct value
*
2394 ada_value_slice (struct value
*array
, int low
, int high
)
2396 struct type
*type
= value_type (array
);
2397 struct type
*index_type
=
2398 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2399 struct type
*slice_type
=
2400 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2401 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2404 /* If type is a record type in the form of a standard GNAT array
2405 descriptor, returns the number of dimensions for type. If arr is a
2406 simple array, returns the number of "array of"s that prefix its
2407 type designation. Otherwise, returns 0. */
2410 ada_array_arity (struct type
*type
)
2417 type
= desc_base_type (type
);
2420 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2421 return desc_arity (desc_bounds_type (type
));
2423 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2426 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2432 /* If TYPE is a record type in the form of a standard GNAT array
2433 descriptor or a simple array type, returns the element type for
2434 TYPE after indexing by NINDICES indices, or by all indices if
2435 NINDICES is -1. Otherwise, returns NULL. */
2438 ada_array_element_type (struct type
*type
, int nindices
)
2440 type
= desc_base_type (type
);
2442 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2445 struct type
*p_array_type
;
2447 p_array_type
= desc_data_type (type
);
2449 k
= ada_array_arity (type
);
2453 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2454 if (nindices
>= 0 && k
> nindices
)
2456 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2457 while (k
> 0 && p_array_type
!= NULL
)
2459 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2462 return p_array_type
;
2464 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2466 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2468 type
= TYPE_TARGET_TYPE (type
);
2477 /* The type of nth index in arrays of given type (n numbering from 1).
2478 Does not examine memory. */
2481 ada_index_type (struct type
*type
, int n
)
2483 struct type
*result_type
;
2485 type
= desc_base_type (type
);
2487 if (n
> ada_array_arity (type
))
2490 if (ada_is_simple_array_type (type
))
2494 for (i
= 1; i
< n
; i
+= 1)
2495 type
= TYPE_TARGET_TYPE (type
);
2496 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2497 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2498 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2499 perhaps stabsread.c would make more sense. */
2500 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2501 result_type
= builtin_type_int
;
2506 return desc_index_type (desc_bounds_type (type
), n
);
2509 /* Given that arr is an array type, returns the lower bound of the
2510 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2511 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2512 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2513 bounds type. It works for other arrays with bounds supplied by
2514 run-time quantities other than discriminants. */
2517 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2518 struct type
** typep
)
2521 struct type
*index_type_desc
;
2523 if (ada_is_packed_array_type (arr_type
))
2524 arr_type
= decode_packed_array_type (arr_type
);
2526 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2529 *typep
= builtin_type_int
;
2530 return (LONGEST
) - which
;
2533 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2534 type
= TYPE_TARGET_TYPE (arr_type
);
2538 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2539 if (index_type_desc
== NULL
)
2541 struct type
*index_type
;
2545 type
= TYPE_TARGET_TYPE (type
);
2549 index_type
= TYPE_INDEX_TYPE (type
);
2551 *typep
= index_type
;
2553 /* The index type is either a range type or an enumerated type.
2554 For the range type, we have some macros that allow us to
2555 extract the value of the low and high bounds. But they
2556 do now work for enumerated types. The expressions used
2557 below work for both range and enum types. */
2559 (LONGEST
) (which
== 0
2560 ? TYPE_FIELD_BITPOS (index_type
, 0)
2561 : TYPE_FIELD_BITPOS (index_type
,
2562 TYPE_NFIELDS (index_type
) - 1));
2566 struct type
*index_type
=
2567 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2568 NULL
, TYPE_OBJFILE (arr_type
));
2571 *typep
= index_type
;
2574 (LONGEST
) (which
== 0
2575 ? TYPE_LOW_BOUND (index_type
)
2576 : TYPE_HIGH_BOUND (index_type
));
2580 /* Given that arr is an array value, returns the lower bound of the
2581 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2582 WHICH is 1. This routine will also work for arrays with bounds
2583 supplied by run-time quantities other than discriminants. */
2586 ada_array_bound (struct value
*arr
, int n
, int which
)
2588 struct type
*arr_type
= value_type (arr
);
2590 if (ada_is_packed_array_type (arr_type
))
2591 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2592 else if (ada_is_simple_array_type (arr_type
))
2595 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2596 return value_from_longest (type
, v
);
2599 return desc_one_bound (desc_bounds (arr
), n
, which
);
2602 /* Given that arr is an array value, returns the length of the
2603 nth index. This routine will also work for arrays with bounds
2604 supplied by run-time quantities other than discriminants.
2605 Does not work for arrays indexed by enumeration types with representation
2606 clauses at the moment. */
2609 ada_array_length (struct value
*arr
, int n
)
2611 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2613 if (ada_is_packed_array_type (arr_type
))
2614 return ada_array_length (decode_packed_array (arr
), n
);
2616 if (ada_is_simple_array_type (arr_type
))
2620 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2621 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2622 return value_from_longest (type
, v
);
2626 value_from_longest (builtin_type_int32
,
2627 value_as_long (desc_one_bound (desc_bounds (arr
),
2629 - value_as_long (desc_one_bound (desc_bounds (arr
),
2633 /* An empty array whose type is that of ARR_TYPE (an array type),
2634 with bounds LOW to LOW-1. */
2636 static struct value
*
2637 empty_array (struct type
*arr_type
, int low
)
2639 struct type
*index_type
=
2640 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2642 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2643 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2647 /* Name resolution */
2649 /* The "decoded" name for the user-definable Ada operator corresponding
2653 ada_decoded_op_name (enum exp_opcode op
)
2657 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2659 if (ada_opname_table
[i
].op
== op
)
2660 return ada_opname_table
[i
].decoded
;
2662 error (_("Could not find operator name for opcode"));
2666 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2667 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2668 undefined namespace) and converts operators that are
2669 user-defined into appropriate function calls. If CONTEXT_TYPE is
2670 non-null, it provides a preferred result type [at the moment, only
2671 type void has any effect---causing procedures to be preferred over
2672 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2673 return type is preferred. May change (expand) *EXP. */
2676 resolve (struct expression
**expp
, int void_context_p
)
2680 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2683 /* Resolve the operator of the subexpression beginning at
2684 position *POS of *EXPP. "Resolving" consists of replacing
2685 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2686 with their resolutions, replacing built-in operators with
2687 function calls to user-defined operators, where appropriate, and,
2688 when DEPROCEDURE_P is non-zero, converting function-valued variables
2689 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2690 are as in ada_resolve, above. */
2692 static struct value
*
2693 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2694 struct type
*context_type
)
2698 struct expression
*exp
; /* Convenience: == *expp. */
2699 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2700 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2701 int nargs
; /* Number of operands. */
2708 /* Pass one: resolve operands, saving their types and updating *pos,
2713 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2714 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2719 resolve_subexp (expp
, pos
, 0, NULL
);
2721 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2726 resolve_subexp (expp
, pos
, 0, NULL
);
2731 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2734 case OP_ATR_MODULUS
:
2744 case TERNOP_IN_RANGE
:
2745 case BINOP_IN_BOUNDS
:
2751 case OP_DISCRETE_RANGE
:
2753 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2762 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2764 resolve_subexp (expp
, pos
, 1, NULL
);
2766 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2783 case BINOP_LOGICAL_AND
:
2784 case BINOP_LOGICAL_OR
:
2785 case BINOP_BITWISE_AND
:
2786 case BINOP_BITWISE_IOR
:
2787 case BINOP_BITWISE_XOR
:
2790 case BINOP_NOTEQUAL
:
2797 case BINOP_SUBSCRIPT
:
2805 case UNOP_LOGICAL_NOT
:
2821 case OP_INTERNALVAR
:
2831 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2834 case STRUCTOP_STRUCT
:
2835 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2848 error (_("Unexpected operator during name resolution"));
2851 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2852 for (i
= 0; i
< nargs
; i
+= 1)
2853 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2857 /* Pass two: perform any resolution on principal operator. */
2864 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2866 struct ada_symbol_info
*candidates
;
2870 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2871 (exp
->elts
[pc
+ 2].symbol
),
2872 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2875 if (n_candidates
> 1)
2877 /* Types tend to get re-introduced locally, so if there
2878 are any local symbols that are not types, first filter
2881 for (j
= 0; j
< n_candidates
; j
+= 1)
2882 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2887 case LOC_REGPARM_ADDR
:
2895 if (j
< n_candidates
)
2898 while (j
< n_candidates
)
2900 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2902 candidates
[j
] = candidates
[n_candidates
- 1];
2911 if (n_candidates
== 0)
2912 error (_("No definition found for %s"),
2913 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2914 else if (n_candidates
== 1)
2916 else if (deprocedure_p
2917 && !is_nonfunction (candidates
, n_candidates
))
2919 i
= ada_resolve_function
2920 (candidates
, n_candidates
, NULL
, 0,
2921 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2924 error (_("Could not find a match for %s"),
2925 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2929 printf_filtered (_("Multiple matches for %s\n"),
2930 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2931 user_select_syms (candidates
, n_candidates
, 1);
2935 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2936 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2937 if (innermost_block
== NULL
2938 || contained_in (candidates
[i
].block
, innermost_block
))
2939 innermost_block
= candidates
[i
].block
;
2943 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2946 replace_operator_with_call (expp
, pc
, 0, 0,
2947 exp
->elts
[pc
+ 2].symbol
,
2948 exp
->elts
[pc
+ 1].block
);
2955 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2956 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2958 struct ada_symbol_info
*candidates
;
2962 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2963 (exp
->elts
[pc
+ 5].symbol
),
2964 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2966 if (n_candidates
== 1)
2970 i
= ada_resolve_function
2971 (candidates
, n_candidates
,
2973 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2976 error (_("Could not find a match for %s"),
2977 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2980 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2981 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2982 if (innermost_block
== NULL
2983 || contained_in (candidates
[i
].block
, innermost_block
))
2984 innermost_block
= candidates
[i
].block
;
2995 case BINOP_BITWISE_AND
:
2996 case BINOP_BITWISE_IOR
:
2997 case BINOP_BITWISE_XOR
:
2999 case BINOP_NOTEQUAL
:
3007 case UNOP_LOGICAL_NOT
:
3009 if (possible_user_operator_p (op
, argvec
))
3011 struct ada_symbol_info
*candidates
;
3015 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3016 (struct block
*) NULL
, VAR_DOMAIN
,
3018 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3019 ada_decoded_op_name (op
), NULL
);
3023 replace_operator_with_call (expp
, pc
, nargs
, 1,
3024 candidates
[i
].sym
, candidates
[i
].block
);
3035 return evaluate_subexp_type (exp
, pos
);
3038 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3039 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3040 a non-pointer. A type of 'void' (which is never a valid expression type)
3041 by convention matches anything. */
3042 /* The term "match" here is rather loose. The match is heuristic and
3043 liberal. FIXME: TOO liberal, in fact. */
3046 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3048 ftype
= ada_check_typedef (ftype
);
3049 atype
= ada_check_typedef (atype
);
3051 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3052 ftype
= TYPE_TARGET_TYPE (ftype
);
3053 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3054 atype
= TYPE_TARGET_TYPE (atype
);
3056 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3057 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3060 switch (TYPE_CODE (ftype
))
3065 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3066 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3067 TYPE_TARGET_TYPE (atype
), 0);
3070 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3072 case TYPE_CODE_ENUM
:
3073 case TYPE_CODE_RANGE
:
3074 switch (TYPE_CODE (atype
))
3077 case TYPE_CODE_ENUM
:
3078 case TYPE_CODE_RANGE
:
3084 case TYPE_CODE_ARRAY
:
3085 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3086 || ada_is_array_descriptor_type (atype
));
3088 case TYPE_CODE_STRUCT
:
3089 if (ada_is_array_descriptor_type (ftype
))
3090 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3091 || ada_is_array_descriptor_type (atype
));
3093 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3094 && !ada_is_array_descriptor_type (atype
));
3096 case TYPE_CODE_UNION
:
3098 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3102 /* Return non-zero if the formals of FUNC "sufficiently match" the
3103 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3104 may also be an enumeral, in which case it is treated as a 0-
3105 argument function. */
3108 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3111 struct type
*func_type
= SYMBOL_TYPE (func
);
3113 if (SYMBOL_CLASS (func
) == LOC_CONST
3114 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3115 return (n_actuals
== 0);
3116 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3119 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3122 for (i
= 0; i
< n_actuals
; i
+= 1)
3124 if (actuals
[i
] == NULL
)
3128 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3129 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3131 if (!ada_type_match (ftype
, atype
, 1))
3138 /* False iff function type FUNC_TYPE definitely does not produce a value
3139 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3140 FUNC_TYPE is not a valid function type with a non-null return type
3141 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3144 return_match (struct type
*func_type
, struct type
*context_type
)
3146 struct type
*return_type
;
3148 if (func_type
== NULL
)
3151 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3152 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3154 return_type
= base_type (func_type
);
3155 if (return_type
== NULL
)
3158 context_type
= base_type (context_type
);
3160 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3161 return context_type
== NULL
|| return_type
== context_type
;
3162 else if (context_type
== NULL
)
3163 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3165 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3169 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3170 function (if any) that matches the types of the NARGS arguments in
3171 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3172 that returns that type, then eliminate matches that don't. If
3173 CONTEXT_TYPE is void and there is at least one match that does not
3174 return void, eliminate all matches that do.
3176 Asks the user if there is more than one match remaining. Returns -1
3177 if there is no such symbol or none is selected. NAME is used
3178 solely for messages. May re-arrange and modify SYMS in
3179 the process; the index returned is for the modified vector. */
3182 ada_resolve_function (struct ada_symbol_info syms
[],
3183 int nsyms
, struct value
**args
, int nargs
,
3184 const char *name
, struct type
*context_type
)
3187 int m
; /* Number of hits */
3188 struct type
*fallback
;
3189 struct type
*return_type
;
3191 return_type
= context_type
;
3192 if (context_type
== NULL
)
3193 fallback
= builtin_type_void
;
3200 for (k
= 0; k
< nsyms
; k
+= 1)
3202 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3204 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3205 && return_match (type
, return_type
))
3211 if (m
> 0 || return_type
== fallback
)
3214 return_type
= fallback
;
3221 printf_filtered (_("Multiple matches for %s\n"), name
);
3222 user_select_syms (syms
, m
, 1);
3228 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3229 in a listing of choices during disambiguation (see sort_choices, below).
3230 The idea is that overloadings of a subprogram name from the
3231 same package should sort in their source order. We settle for ordering
3232 such symbols by their trailing number (__N or $N). */
3235 encoded_ordered_before (char *N0
, char *N1
)
3239 else if (N0
== NULL
)
3244 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3246 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3248 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3249 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3253 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3256 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3258 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3259 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3261 return (strcmp (N0
, N1
) < 0);
3265 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3269 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3272 for (i
= 1; i
< nsyms
; i
+= 1)
3274 struct ada_symbol_info sym
= syms
[i
];
3277 for (j
= i
- 1; j
>= 0; j
-= 1)
3279 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3280 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3282 syms
[j
+ 1] = syms
[j
];
3288 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3289 by asking the user (if necessary), returning the number selected,
3290 and setting the first elements of SYMS items. Error if no symbols
3293 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3294 to be re-integrated one of these days. */
3297 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3300 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3302 int first_choice
= (max_results
== 1) ? 1 : 2;
3303 const char *select_mode
= multiple_symbols_select_mode ();
3305 if (max_results
< 1)
3306 error (_("Request to select 0 symbols!"));
3310 if (select_mode
== multiple_symbols_cancel
)
3312 canceled because the command is ambiguous\n\
3313 See set/show multiple-symbol."));
3315 /* If select_mode is "all", then return all possible symbols.
3316 Only do that if more than one symbol can be selected, of course.
3317 Otherwise, display the menu as usual. */
3318 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3321 printf_unfiltered (_("[0] cancel\n"));
3322 if (max_results
> 1)
3323 printf_unfiltered (_("[1] all\n"));
3325 sort_choices (syms
, nsyms
);
3327 for (i
= 0; i
< nsyms
; i
+= 1)
3329 if (syms
[i
].sym
== NULL
)
3332 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3334 struct symtab_and_line sal
=
3335 find_function_start_sal (syms
[i
].sym
, 1);
3336 if (sal
.symtab
== NULL
)
3337 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3339 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3342 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3343 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3344 sal
.symtab
->filename
, sal
.line
);
3350 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3351 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3352 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3353 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3355 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3356 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3358 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3359 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3360 else if (is_enumeral
3361 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3363 printf_unfiltered (("[%d] "), i
+ first_choice
);
3364 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3366 printf_unfiltered (_("'(%s) (enumeral)\n"),
3367 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3369 else if (symtab
!= NULL
)
3370 printf_unfiltered (is_enumeral
3371 ? _("[%d] %s in %s (enumeral)\n")
3372 : _("[%d] %s at %s:?\n"),
3374 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3377 printf_unfiltered (is_enumeral
3378 ? _("[%d] %s (enumeral)\n")
3379 : _("[%d] %s at ?\n"),
3381 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3385 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3388 for (i
= 0; i
< n_chosen
; i
+= 1)
3389 syms
[i
] = syms
[chosen
[i
]];
3394 /* Read and validate a set of numeric choices from the user in the
3395 range 0 .. N_CHOICES-1. Place the results in increasing
3396 order in CHOICES[0 .. N-1], and return N.
3398 The user types choices as a sequence of numbers on one line
3399 separated by blanks, encoding them as follows:
3401 + A choice of 0 means to cancel the selection, throwing an error.
3402 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3403 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3405 The user is not allowed to choose more than MAX_RESULTS values.
3407 ANNOTATION_SUFFIX, if present, is used to annotate the input
3408 prompts (for use with the -f switch). */
3411 get_selections (int *choices
, int n_choices
, int max_results
,
3412 int is_all_choice
, char *annotation_suffix
)
3417 int first_choice
= is_all_choice
? 2 : 1;
3419 prompt
= getenv ("PS2");
3423 args
= command_line_input (prompt
, 0, annotation_suffix
);
3426 error_no_arg (_("one or more choice numbers"));
3430 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3431 order, as given in args. Choices are validated. */
3437 while (isspace (*args
))
3439 if (*args
== '\0' && n_chosen
== 0)
3440 error_no_arg (_("one or more choice numbers"));
3441 else if (*args
== '\0')
3444 choice
= strtol (args
, &args2
, 10);
3445 if (args
== args2
|| choice
< 0
3446 || choice
> n_choices
+ first_choice
- 1)
3447 error (_("Argument must be choice number"));
3451 error (_("cancelled"));
3453 if (choice
< first_choice
)
3455 n_chosen
= n_choices
;
3456 for (j
= 0; j
< n_choices
; j
+= 1)
3460 choice
-= first_choice
;
3462 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3466 if (j
< 0 || choice
!= choices
[j
])
3469 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3470 choices
[k
+ 1] = choices
[k
];
3471 choices
[j
+ 1] = choice
;
3476 if (n_chosen
> max_results
)
3477 error (_("Select no more than %d of the above"), max_results
);
3482 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3483 on the function identified by SYM and BLOCK, and taking NARGS
3484 arguments. Update *EXPP as needed to hold more space. */
3487 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3488 int oplen
, struct symbol
*sym
,
3489 struct block
*block
)
3491 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3492 symbol, -oplen for operator being replaced). */
3493 struct expression
*newexp
= (struct expression
*)
3494 xmalloc (sizeof (struct expression
)
3495 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3496 struct expression
*exp
= *expp
;
3498 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3499 newexp
->language_defn
= exp
->language_defn
;
3500 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3501 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3502 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3504 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3505 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3507 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3508 newexp
->elts
[pc
+ 4].block
= block
;
3509 newexp
->elts
[pc
+ 5].symbol
= sym
;
3515 /* Type-class predicates */
3517 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3521 numeric_type_p (struct type
*type
)
3527 switch (TYPE_CODE (type
))
3532 case TYPE_CODE_RANGE
:
3533 return (type
== TYPE_TARGET_TYPE (type
)
3534 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3541 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3544 integer_type_p (struct type
*type
)
3550 switch (TYPE_CODE (type
))
3554 case TYPE_CODE_RANGE
:
3555 return (type
== TYPE_TARGET_TYPE (type
)
3556 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3563 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3566 scalar_type_p (struct type
*type
)
3572 switch (TYPE_CODE (type
))
3575 case TYPE_CODE_RANGE
:
3576 case TYPE_CODE_ENUM
:
3585 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3588 discrete_type_p (struct type
*type
)
3594 switch (TYPE_CODE (type
))
3597 case TYPE_CODE_RANGE
:
3598 case TYPE_CODE_ENUM
:
3606 /* Returns non-zero if OP with operands in the vector ARGS could be
3607 a user-defined function. Errs on the side of pre-defined operators
3608 (i.e., result 0). */
3611 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3613 struct type
*type0
=
3614 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3615 struct type
*type1
=
3616 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3630 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3634 case BINOP_BITWISE_AND
:
3635 case BINOP_BITWISE_IOR
:
3636 case BINOP_BITWISE_XOR
:
3637 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3640 case BINOP_NOTEQUAL
:
3645 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3648 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3651 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3655 case UNOP_LOGICAL_NOT
:
3657 return (!numeric_type_p (type0
));
3666 1. In the following, we assume that a renaming type's name may
3667 have an ___XD suffix. It would be nice if this went away at some
3669 2. We handle both the (old) purely type-based representation of
3670 renamings and the (new) variable-based encoding. At some point,
3671 it is devoutly to be hoped that the former goes away
3672 (FIXME: hilfinger-2007-07-09).
3673 3. Subprogram renamings are not implemented, although the XRS
3674 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3676 /* If SYM encodes a renaming,
3678 <renaming> renames <renamed entity>,
3680 sets *LEN to the length of the renamed entity's name,
3681 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3682 the string describing the subcomponent selected from the renamed
3683 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3684 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3685 are undefined). Otherwise, returns a value indicating the category
3686 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3687 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3688 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3689 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3690 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3691 may be NULL, in which case they are not assigned.
3693 [Currently, however, GCC does not generate subprogram renamings.] */
3695 enum ada_renaming_category
3696 ada_parse_renaming (struct symbol
*sym
,
3697 const char **renamed_entity
, int *len
,
3698 const char **renaming_expr
)
3700 enum ada_renaming_category kind
;
3705 return ADA_NOT_RENAMING
;
3706 switch (SYMBOL_CLASS (sym
))
3709 return ADA_NOT_RENAMING
;
3711 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3712 renamed_entity
, len
, renaming_expr
);
3716 case LOC_OPTIMIZED_OUT
:
3717 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3719 return ADA_NOT_RENAMING
;
3723 kind
= ADA_OBJECT_RENAMING
;
3727 kind
= ADA_EXCEPTION_RENAMING
;
3731 kind
= ADA_PACKAGE_RENAMING
;
3735 kind
= ADA_SUBPROGRAM_RENAMING
;
3739 return ADA_NOT_RENAMING
;
3743 if (renamed_entity
!= NULL
)
3744 *renamed_entity
= info
;
3745 suffix
= strstr (info
, "___XE");
3746 if (suffix
== NULL
|| suffix
== info
)
3747 return ADA_NOT_RENAMING
;
3749 *len
= strlen (info
) - strlen (suffix
);
3751 if (renaming_expr
!= NULL
)
3752 *renaming_expr
= suffix
;
3756 /* Assuming TYPE encodes a renaming according to the old encoding in
3757 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3758 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3759 ADA_NOT_RENAMING otherwise. */
3760 static enum ada_renaming_category
3761 parse_old_style_renaming (struct type
*type
,
3762 const char **renamed_entity
, int *len
,
3763 const char **renaming_expr
)
3765 enum ada_renaming_category kind
;
3770 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3771 || TYPE_NFIELDS (type
) != 1)
3772 return ADA_NOT_RENAMING
;
3774 name
= type_name_no_tag (type
);
3776 return ADA_NOT_RENAMING
;
3778 name
= strstr (name
, "___XR");
3780 return ADA_NOT_RENAMING
;
3785 kind
= ADA_OBJECT_RENAMING
;
3788 kind
= ADA_EXCEPTION_RENAMING
;
3791 kind
= ADA_PACKAGE_RENAMING
;
3794 kind
= ADA_SUBPROGRAM_RENAMING
;
3797 return ADA_NOT_RENAMING
;
3800 info
= TYPE_FIELD_NAME (type
, 0);
3802 return ADA_NOT_RENAMING
;
3803 if (renamed_entity
!= NULL
)
3804 *renamed_entity
= info
;
3805 suffix
= strstr (info
, "___XE");
3806 if (renaming_expr
!= NULL
)
3807 *renaming_expr
= suffix
+ 5;
3808 if (suffix
== NULL
|| suffix
== info
)
3809 return ADA_NOT_RENAMING
;
3811 *len
= suffix
- info
;
3817 /* Evaluation: Function Calls */
3819 /* Return an lvalue containing the value VAL. This is the identity on
3820 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3821 on the stack, using and updating *SP as the stack pointer, and
3822 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3824 static struct value
*
3825 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3827 if (! VALUE_LVAL (val
))
3829 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3831 /* The following is taken from the structure-return code in
3832 call_function_by_hand. FIXME: Therefore, some refactoring seems
3834 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3836 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3837 reserving sufficient space. */
3839 if (gdbarch_frame_align_p (current_gdbarch
))
3840 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3841 VALUE_ADDRESS (val
) = *sp
;
3845 /* Stack grows upward. Align the frame, allocate space, and
3846 then again, re-align the frame. */
3847 if (gdbarch_frame_align_p (current_gdbarch
))
3848 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3849 VALUE_ADDRESS (val
) = *sp
;
3851 if (gdbarch_frame_align_p (current_gdbarch
))
3852 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3854 VALUE_LVAL (val
) = lval_memory
;
3856 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3862 /* Return the value ACTUAL, converted to be an appropriate value for a
3863 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3864 allocating any necessary descriptors (fat pointers), or copies of
3865 values not residing in memory, updating it as needed. */
3868 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3871 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3872 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3873 struct type
*formal_target
=
3874 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3875 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3876 struct type
*actual_target
=
3877 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3878 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3880 if (ada_is_array_descriptor_type (formal_target
)
3881 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3882 return make_array_descriptor (formal_type
, actual
, sp
);
3883 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3884 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3886 struct value
*result
;
3887 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3888 && ada_is_array_descriptor_type (actual_target
))
3889 result
= desc_data (actual
);
3890 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3892 if (VALUE_LVAL (actual
) != lval_memory
)
3895 actual_type
= ada_check_typedef (value_type (actual
));
3896 val
= allocate_value (actual_type
);
3897 memcpy ((char *) value_contents_raw (val
),
3898 (char *) value_contents (actual
),
3899 TYPE_LENGTH (actual_type
));
3900 actual
= ensure_lval (val
, sp
);
3902 result
= value_addr (actual
);
3906 return value_cast_pointers (formal_type
, result
);
3908 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3909 return ada_value_ind (actual
);
3915 /* Push a descriptor of type TYPE for array value ARR on the stack at
3916 *SP, updating *SP to reflect the new descriptor. Return either
3917 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3918 to-descriptor type rather than a descriptor type), a struct value *
3919 representing a pointer to this descriptor. */
3921 static struct value
*
3922 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3924 struct type
*bounds_type
= desc_bounds_type (type
);
3925 struct type
*desc_type
= desc_base_type (type
);
3926 struct value
*descriptor
= allocate_value (desc_type
);
3927 struct value
*bounds
= allocate_value (bounds_type
);
3930 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3932 modify_general_field (value_contents_writeable (bounds
),
3933 value_as_long (ada_array_bound (arr
, i
, 0)),
3934 desc_bound_bitpos (bounds_type
, i
, 0),
3935 desc_bound_bitsize (bounds_type
, i
, 0));
3936 modify_general_field (value_contents_writeable (bounds
),
3937 value_as_long (ada_array_bound (arr
, i
, 1)),
3938 desc_bound_bitpos (bounds_type
, i
, 1),
3939 desc_bound_bitsize (bounds_type
, i
, 1));
3942 bounds
= ensure_lval (bounds
, sp
);
3944 modify_general_field (value_contents_writeable (descriptor
),
3945 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3946 fat_pntr_data_bitpos (desc_type
),
3947 fat_pntr_data_bitsize (desc_type
));
3949 modify_general_field (value_contents_writeable (descriptor
),
3950 VALUE_ADDRESS (bounds
),
3951 fat_pntr_bounds_bitpos (desc_type
),
3952 fat_pntr_bounds_bitsize (desc_type
));
3954 descriptor
= ensure_lval (descriptor
, sp
);
3956 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3957 return value_addr (descriptor
);
3962 /* Dummy definitions for an experimental caching module that is not
3963 * used in the public sources. */
3966 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3967 struct symbol
**sym
, struct block
**block
)
3973 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3974 struct block
*block
)
3980 /* Return the result of a standard (literal, C-like) lookup of NAME in
3981 given DOMAIN, visible from lexical block BLOCK. */
3983 static struct symbol
*
3984 standard_lookup (const char *name
, const struct block
*block
,
3989 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3991 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3992 cache_symbol (name
, domain
, sym
, block_found
);
3997 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3998 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3999 since they contend in overloading in the same way. */
4001 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4005 for (i
= 0; i
< n
; i
+= 1)
4006 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4007 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4008 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4014 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4015 struct types. Otherwise, they may not. */
4018 equiv_types (struct type
*type0
, struct type
*type1
)
4022 if (type0
== NULL
|| type1
== NULL
4023 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4025 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4026 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4027 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4028 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4034 /* True iff SYM0 represents the same entity as SYM1, or one that is
4035 no more defined than that of SYM1. */
4038 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4042 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4043 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4046 switch (SYMBOL_CLASS (sym0
))
4052 struct type
*type0
= SYMBOL_TYPE (sym0
);
4053 struct type
*type1
= SYMBOL_TYPE (sym1
);
4054 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4055 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4056 int len0
= strlen (name0
);
4058 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4059 && (equiv_types (type0
, type1
)
4060 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4061 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4064 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4065 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4071 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4072 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4075 add_defn_to_vec (struct obstack
*obstackp
,
4077 struct block
*block
)
4081 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4083 /* Do not try to complete stub types, as the debugger is probably
4084 already scanning all symbols matching a certain name at the
4085 time when this function is called. Trying to replace the stub
4086 type by its associated full type will cause us to restart a scan
4087 which may lead to an infinite recursion. Instead, the client
4088 collecting the matching symbols will end up collecting several
4089 matches, with at least one of them complete. It can then filter
4090 out the stub ones if needed. */
4092 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4094 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4096 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4098 prevDefns
[i
].sym
= sym
;
4099 prevDefns
[i
].block
= block
;
4105 struct ada_symbol_info info
;
4109 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4113 /* Number of ada_symbol_info structures currently collected in
4114 current vector in *OBSTACKP. */
4117 num_defns_collected (struct obstack
*obstackp
)
4119 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4122 /* Vector of ada_symbol_info structures currently collected in current
4123 vector in *OBSTACKP. If FINISH, close off the vector and return
4124 its final address. */
4126 static struct ada_symbol_info
*
4127 defns_collected (struct obstack
*obstackp
, int finish
)
4130 return obstack_finish (obstackp
);
4132 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4135 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4136 Check the global symbols if GLOBAL, the static symbols if not.
4137 Do wild-card match if WILD. */
4139 static struct partial_symbol
*
4140 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4141 int global
, domain_enum
namespace, int wild
)
4143 struct partial_symbol
**start
;
4144 int name_len
= strlen (name
);
4145 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4154 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4155 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4159 for (i
= 0; i
< length
; i
+= 1)
4161 struct partial_symbol
*psym
= start
[i
];
4163 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4164 SYMBOL_DOMAIN (psym
), namespace)
4165 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4179 int M
= (U
+ i
) >> 1;
4180 struct partial_symbol
*psym
= start
[M
];
4181 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4183 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4185 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4196 struct partial_symbol
*psym
= start
[i
];
4198 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4199 SYMBOL_DOMAIN (psym
), namespace))
4201 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4209 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4223 int M
= (U
+ i
) >> 1;
4224 struct partial_symbol
*psym
= start
[M
];
4225 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4227 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4229 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4240 struct partial_symbol
*psym
= start
[i
];
4242 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4243 SYMBOL_DOMAIN (psym
), namespace))
4247 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4250 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4252 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4262 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4272 /* Find a symbol table containing symbol SYM or NULL if none. */
4274 static struct symtab
*
4275 symtab_for_sym (struct symbol
*sym
)
4278 struct objfile
*objfile
;
4280 struct symbol
*tmp_sym
;
4281 struct dict_iterator iter
;
4284 ALL_PRIMARY_SYMTABS (objfile
, s
)
4286 switch (SYMBOL_CLASS (sym
))
4294 case LOC_CONST_BYTES
:
4295 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4296 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4298 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4299 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4305 switch (SYMBOL_CLASS (sym
))
4310 case LOC_REGPARM_ADDR
:
4314 for (j
= FIRST_LOCAL_BLOCK
;
4315 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4317 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4318 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4329 /* Return a minimal symbol matching NAME according to Ada decoding
4330 rules. Returns NULL if there is no such minimal symbol. Names
4331 prefixed with "standard__" are handled specially: "standard__" is
4332 first stripped off, and only static and global symbols are searched. */
4334 struct minimal_symbol
*
4335 ada_lookup_simple_minsym (const char *name
)
4337 struct objfile
*objfile
;
4338 struct minimal_symbol
*msymbol
;
4341 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4343 name
+= sizeof ("standard__") - 1;
4347 wild_match
= (strstr (name
, "__") == NULL
);
4349 ALL_MSYMBOLS (objfile
, msymbol
)
4351 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4352 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4359 /* For all subprograms that statically enclose the subprogram of the
4360 selected frame, add symbols matching identifier NAME in DOMAIN
4361 and their blocks to the list of data in OBSTACKP, as for
4362 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4366 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4367 const char *name
, domain_enum
namespace,
4372 /* True if TYPE is definitely an artificial type supplied to a symbol
4373 for which no debugging information was given in the symbol file. */
4376 is_nondebugging_type (struct type
*type
)
4378 char *name
= ada_type_name (type
);
4379 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4382 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4383 duplicate other symbols in the list (The only case I know of where
4384 this happens is when object files containing stabs-in-ecoff are
4385 linked with files containing ordinary ecoff debugging symbols (or no
4386 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4387 Returns the number of items in the modified list. */
4390 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4397 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4398 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4399 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4401 for (j
= 0; j
< nsyms
; j
+= 1)
4404 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4405 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4406 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4407 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4408 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4409 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4412 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4413 syms
[k
- 1] = syms
[k
];
4426 /* Given a type that corresponds to a renaming entity, use the type name
4427 to extract the scope (package name or function name, fully qualified,
4428 and following the GNAT encoding convention) where this renaming has been
4429 defined. The string returned needs to be deallocated after use. */
4432 xget_renaming_scope (struct type
*renaming_type
)
4434 /* The renaming types adhere to the following convention:
4435 <scope>__<rename>___<XR extension>.
4436 So, to extract the scope, we search for the "___XR" extension,
4437 and then backtrack until we find the first "__". */
4439 const char *name
= type_name_no_tag (renaming_type
);
4440 char *suffix
= strstr (name
, "___XR");
4445 /* Now, backtrack a bit until we find the first "__". Start looking
4446 at suffix - 3, as the <rename> part is at least one character long. */
4448 for (last
= suffix
- 3; last
> name
; last
--)
4449 if (last
[0] == '_' && last
[1] == '_')
4452 /* Make a copy of scope and return it. */
4454 scope_len
= last
- name
;
4455 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4457 strncpy (scope
, name
, scope_len
);
4458 scope
[scope_len
] = '\0';
4463 /* Return nonzero if NAME corresponds to a package name. */
4466 is_package_name (const char *name
)
4468 /* Here, We take advantage of the fact that no symbols are generated
4469 for packages, while symbols are generated for each function.
4470 So the condition for NAME represent a package becomes equivalent
4471 to NAME not existing in our list of symbols. There is only one
4472 small complication with library-level functions (see below). */
4476 /* If it is a function that has not been defined at library level,
4477 then we should be able to look it up in the symbols. */
4478 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4481 /* Library-level function names start with "_ada_". See if function
4482 "_ada_" followed by NAME can be found. */
4484 /* Do a quick check that NAME does not contain "__", since library-level
4485 functions names cannot contain "__" in them. */
4486 if (strstr (name
, "__") != NULL
)
4489 fun_name
= xstrprintf ("_ada_%s", name
);
4491 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4494 /* Return nonzero if SYM corresponds to a renaming entity that is
4495 not visible from FUNCTION_NAME. */
4498 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4502 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4505 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4507 make_cleanup (xfree
, scope
);
4509 /* If the rename has been defined in a package, then it is visible. */
4510 if (is_package_name (scope
))
4513 /* Check that the rename is in the current function scope by checking
4514 that its name starts with SCOPE. */
4516 /* If the function name starts with "_ada_", it means that it is
4517 a library-level function. Strip this prefix before doing the
4518 comparison, as the encoding for the renaming does not contain
4520 if (strncmp (function_name
, "_ada_", 5) == 0)
4523 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4526 /* Remove entries from SYMS that corresponds to a renaming entity that
4527 is not visible from the function associated with CURRENT_BLOCK or
4528 that is superfluous due to the presence of more specific renaming
4529 information. Places surviving symbols in the initial entries of
4530 SYMS and returns the number of surviving symbols.
4533 First, in cases where an object renaming is implemented as a
4534 reference variable, GNAT may produce both the actual reference
4535 variable and the renaming encoding. In this case, we discard the
4538 Second, GNAT emits a type following a specified encoding for each renaming
4539 entity. Unfortunately, STABS currently does not support the definition
4540 of types that are local to a given lexical block, so all renamings types
4541 are emitted at library level. As a consequence, if an application
4542 contains two renaming entities using the same name, and a user tries to
4543 print the value of one of these entities, the result of the ada symbol
4544 lookup will also contain the wrong renaming type.
4546 This function partially covers for this limitation by attempting to
4547 remove from the SYMS list renaming symbols that should be visible
4548 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4549 method with the current information available. The implementation
4550 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4552 - When the user tries to print a rename in a function while there
4553 is another rename entity defined in a package: Normally, the
4554 rename in the function has precedence over the rename in the
4555 package, so the latter should be removed from the list. This is
4556 currently not the case.
4558 - This function will incorrectly remove valid renames if
4559 the CURRENT_BLOCK corresponds to a function which symbol name
4560 has been changed by an "Export" pragma. As a consequence,
4561 the user will be unable to print such rename entities. */
4564 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4565 int nsyms
, const struct block
*current_block
)
4567 struct symbol
*current_function
;
4568 char *current_function_name
;
4570 int is_new_style_renaming
;
4572 /* If there is both a renaming foo___XR... encoded as a variable and
4573 a simple variable foo in the same block, discard the latter.
4574 First, zero out such symbols, then compress. */
4575 is_new_style_renaming
= 0;
4576 for (i
= 0; i
< nsyms
; i
+= 1)
4578 struct symbol
*sym
= syms
[i
].sym
;
4579 struct block
*block
= syms
[i
].block
;
4583 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4585 name
= SYMBOL_LINKAGE_NAME (sym
);
4586 suffix
= strstr (name
, "___XR");
4590 int name_len
= suffix
- name
;
4592 is_new_style_renaming
= 1;
4593 for (j
= 0; j
< nsyms
; j
+= 1)
4594 if (i
!= j
&& syms
[j
].sym
!= NULL
4595 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4597 && block
== syms
[j
].block
)
4601 if (is_new_style_renaming
)
4605 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4606 if (syms
[j
].sym
!= NULL
)
4614 /* Extract the function name associated to CURRENT_BLOCK.
4615 Abort if unable to do so. */
4617 if (current_block
== NULL
)
4620 current_function
= block_linkage_function (current_block
);
4621 if (current_function
== NULL
)
4624 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4625 if (current_function_name
== NULL
)
4628 /* Check each of the symbols, and remove it from the list if it is
4629 a type corresponding to a renaming that is out of the scope of
4630 the current block. */
4635 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4636 == ADA_OBJECT_RENAMING
4637 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4640 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4641 syms
[j
- 1] = syms
[j
];
4651 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4652 scope and in global scopes, returning the number of matches. Sets
4653 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4654 indicating the symbols found and the blocks and symbol tables (if
4655 any) in which they were found. This vector are transient---good only to
4656 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4657 symbol match within the nest of blocks whose innermost member is BLOCK0,
4658 is the one match returned (no other matches in that or
4659 enclosing blocks is returned). If there are any matches in or
4660 surrounding BLOCK0, then these alone are returned. Otherwise, the
4661 search extends to global and file-scope (static) symbol tables.
4662 Names prefixed with "standard__" are handled specially: "standard__"
4663 is first stripped off, and only static and global symbols are searched. */
4666 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4667 domain_enum
namespace,
4668 struct ada_symbol_info
**results
)
4672 struct partial_symtab
*ps
;
4673 struct blockvector
*bv
;
4674 struct objfile
*objfile
;
4675 struct block
*block
;
4677 struct minimal_symbol
*msymbol
;
4683 obstack_free (&symbol_list_obstack
, NULL
);
4684 obstack_init (&symbol_list_obstack
);
4688 /* Search specified block and its superiors. */
4690 wild_match
= (strstr (name0
, "__") == NULL
);
4692 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4693 needed, but adding const will
4694 have a cascade effect. */
4695 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4699 name
= name0
+ sizeof ("standard__") - 1;
4703 while (block
!= NULL
)
4706 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4707 namespace, NULL
, wild_match
);
4709 /* If we found a non-function match, assume that's the one. */
4710 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4711 num_defns_collected (&symbol_list_obstack
)))
4714 block
= BLOCK_SUPERBLOCK (block
);
4717 /* If no luck so far, try to find NAME as a local symbol in some lexically
4718 enclosing subprogram. */
4719 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4720 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4721 name
, namespace, wild_match
);
4723 /* If we found ANY matches among non-global symbols, we're done. */
4725 if (num_defns_collected (&symbol_list_obstack
) > 0)
4729 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4732 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4736 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4737 tables, and psymtab's. */
4739 ALL_PRIMARY_SYMTABS (objfile
, s
)
4742 bv
= BLOCKVECTOR (s
);
4743 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4744 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4745 objfile
, wild_match
);
4748 if (namespace == VAR_DOMAIN
)
4750 ALL_MSYMBOLS (objfile
, msymbol
)
4752 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4754 switch (MSYMBOL_TYPE (msymbol
))
4756 case mst_solib_trampoline
:
4759 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4762 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4763 char *raw_name
= SYMBOL_LINKAGE_NAME (msymbol
);
4767 suffix
= strrchr (raw_name
, '.');
4769 suffix
= strrchr (raw_name
, '$');
4770 if (suffix
!= NULL
&& is_digits_suffix (suffix
+ 1))
4772 name1
= alloca (suffix
- raw_name
+ 1);
4773 strncpy (name1
, raw_name
, suffix
- raw_name
);
4774 name1
[suffix
- raw_name
] = '\0';
4779 bv
= BLOCKVECTOR (s
);
4780 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4781 ada_add_block_symbols (&symbol_list_obstack
, block
,
4782 name1
, namespace, objfile
, 0);
4784 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4786 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4787 ada_add_block_symbols (&symbol_list_obstack
, block
,
4788 name1
, namespace, objfile
, 0);
4796 ALL_PSYMTABS (objfile
, ps
)
4800 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4802 s
= PSYMTAB_TO_SYMTAB (ps
);
4805 bv
= BLOCKVECTOR (s
);
4806 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4807 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4808 namespace, objfile
, wild_match
);
4812 /* Now add symbols from all per-file blocks if we've gotten no hits
4813 (Not strictly correct, but perhaps better than an error).
4814 Do the symtabs first, then check the psymtabs. */
4816 if (num_defns_collected (&symbol_list_obstack
) == 0)
4819 ALL_PRIMARY_SYMTABS (objfile
, s
)
4822 bv
= BLOCKVECTOR (s
);
4823 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4824 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4825 objfile
, wild_match
);
4828 ALL_PSYMTABS (objfile
, ps
)
4832 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4834 s
= PSYMTAB_TO_SYMTAB (ps
);
4835 bv
= BLOCKVECTOR (s
);
4838 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4839 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4840 namespace, objfile
, wild_match
);
4846 ndefns
= num_defns_collected (&symbol_list_obstack
);
4847 *results
= defns_collected (&symbol_list_obstack
, 1);
4849 ndefns
= remove_extra_symbols (*results
, ndefns
);
4852 cache_symbol (name0
, namespace, NULL
, NULL
);
4854 if (ndefns
== 1 && cacheIfUnique
)
4855 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4857 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4863 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4864 domain_enum
namespace, struct block
**block_found
)
4866 struct ada_symbol_info
*candidates
;
4869 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4871 if (n_candidates
== 0)
4874 if (block_found
!= NULL
)
4875 *block_found
= candidates
[0].block
;
4877 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4880 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4881 scope and in global scopes, or NULL if none. NAME is folded and
4882 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4883 choosing the first symbol if there are multiple choices.
4884 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4885 table in which the symbol was found (in both cases, these
4886 assignments occur only if the pointers are non-null). */
4888 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4889 domain_enum
namespace, int *is_a_field_of_this
)
4891 if (is_a_field_of_this
!= NULL
)
4892 *is_a_field_of_this
= 0;
4895 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4896 block0
, namespace, NULL
);
4899 static struct symbol
*
4900 ada_lookup_symbol_nonlocal (const char *name
,
4901 const char *linkage_name
,
4902 const struct block
*block
,
4903 const domain_enum domain
)
4905 if (linkage_name
== NULL
)
4906 linkage_name
= name
;
4907 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4912 /* True iff STR is a possible encoded suffix of a normal Ada name
4913 that is to be ignored for matching purposes. Suffixes of parallel
4914 names (e.g., XVE) are not included here. Currently, the possible suffixes
4915 are given by any of the regular expressions:
4917 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4918 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4919 _E[0-9]+[bs]$ [protected object entry suffixes]
4920 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4922 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4923 match is performed. This sequence is used to differentiate homonyms,
4924 is an optional part of a valid name suffix. */
4927 is_name_suffix (const char *str
)
4930 const char *matching
;
4931 const int len
= strlen (str
);
4933 /* Skip optional leading __[0-9]+. */
4935 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4938 while (isdigit (str
[0]))
4944 if (str
[0] == '.' || str
[0] == '$')
4947 while (isdigit (matching
[0]))
4949 if (matching
[0] == '\0')
4955 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4958 while (isdigit (matching
[0]))
4960 if (matching
[0] == '\0')
4965 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4966 with a N at the end. Unfortunately, the compiler uses the same
4967 convention for other internal types it creates. So treating
4968 all entity names that end with an "N" as a name suffix causes
4969 some regressions. For instance, consider the case of an enumerated
4970 type. To support the 'Image attribute, it creates an array whose
4972 Having a single character like this as a suffix carrying some
4973 information is a bit risky. Perhaps we should change the encoding
4974 to be something like "_N" instead. In the meantime, do not do
4975 the following check. */
4976 /* Protected Object Subprograms */
4977 if (len
== 1 && str
[0] == 'N')
4982 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4985 while (isdigit (matching
[0]))
4987 if ((matching
[0] == 'b' || matching
[0] == 's')
4988 && matching
[1] == '\0')
4992 /* ??? We should not modify STR directly, as we are doing below. This
4993 is fine in this case, but may become problematic later if we find
4994 that this alternative did not work, and want to try matching
4995 another one from the begining of STR. Since we modified it, we
4996 won't be able to find the begining of the string anymore! */
5000 while (str
[0] != '_' && str
[0] != '\0')
5002 if (str
[0] != 'n' && str
[0] != 'b')
5008 if (str
[0] == '\000')
5013 if (str
[1] != '_' || str
[2] == '\000')
5017 if (strcmp (str
+ 3, "JM") == 0)
5019 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5020 the LJM suffix in favor of the JM one. But we will
5021 still accept LJM as a valid suffix for a reasonable
5022 amount of time, just to allow ourselves to debug programs
5023 compiled using an older version of GNAT. */
5024 if (strcmp (str
+ 3, "LJM") == 0)
5028 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5029 || str
[4] == 'U' || str
[4] == 'P')
5031 if (str
[4] == 'R' && str
[5] != 'T')
5035 if (!isdigit (str
[2]))
5037 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5038 if (!isdigit (str
[k
]) && str
[k
] != '_')
5042 if (str
[0] == '$' && isdigit (str
[1]))
5044 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5045 if (!isdigit (str
[k
]) && str
[k
] != '_')
5052 /* Return nonzero if the given string contains only digits.
5053 The empty string also matches. */
5056 is_digits_suffix (const char *str
)
5058 while (isdigit (str
[0]))
5060 return (str
[0] == '\0');
5063 /* Return non-zero if the string starting at NAME and ending before
5064 NAME_END contains no capital letters. */
5067 is_valid_name_for_wild_match (const char *name0
)
5069 const char *decoded_name
= ada_decode (name0
);
5072 /* If the decoded name starts with an angle bracket, it means that
5073 NAME0 does not follow the GNAT encoding format. It should then
5074 not be allowed as a possible wild match. */
5075 if (decoded_name
[0] == '<')
5078 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5079 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5085 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5086 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5087 informational suffixes of NAME (i.e., for which is_name_suffix is
5091 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5098 match
= strstr (start
, patn0
);
5103 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
5104 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
5105 && is_name_suffix (match
+ patn_len
))
5106 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
5112 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5113 vector *defn_symbols, updating the list of symbols in OBSTACKP
5114 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5115 OBJFILE is the section containing BLOCK.
5116 SYMTAB is recorded with each symbol added. */
5119 ada_add_block_symbols (struct obstack
*obstackp
,
5120 struct block
*block
, const char *name
,
5121 domain_enum domain
, struct objfile
*objfile
,
5124 struct dict_iterator iter
;
5125 int name_len
= strlen (name
);
5126 /* A matching argument symbol, if any. */
5127 struct symbol
*arg_sym
;
5128 /* Set true when we find a matching non-argument symbol. */
5137 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5139 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5140 SYMBOL_DOMAIN (sym
), domain
)
5141 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5143 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5145 else if (SYMBOL_IS_ARGUMENT (sym
))
5150 add_defn_to_vec (obstackp
,
5151 fixup_symbol_section (sym
, objfile
),
5159 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5161 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5162 SYMBOL_DOMAIN (sym
), domain
))
5164 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5166 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5168 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5170 if (SYMBOL_IS_ARGUMENT (sym
))
5175 add_defn_to_vec (obstackp
,
5176 fixup_symbol_section (sym
, objfile
),
5185 if (!found_sym
&& arg_sym
!= NULL
)
5187 add_defn_to_vec (obstackp
,
5188 fixup_symbol_section (arg_sym
, objfile
),
5197 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5199 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5200 SYMBOL_DOMAIN (sym
), domain
))
5204 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5207 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5209 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5214 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5216 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5218 if (SYMBOL_IS_ARGUMENT (sym
))
5223 add_defn_to_vec (obstackp
,
5224 fixup_symbol_section (sym
, objfile
),
5232 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5233 They aren't parameters, right? */
5234 if (!found_sym
&& arg_sym
!= NULL
)
5236 add_defn_to_vec (obstackp
,
5237 fixup_symbol_section (arg_sym
, objfile
),
5244 /* Symbol Completion */
5246 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5247 name in a form that's appropriate for the completion. The result
5248 does not need to be deallocated, but is only good until the next call.
5250 TEXT_LEN is equal to the length of TEXT.
5251 Perform a wild match if WILD_MATCH is set.
5252 ENCODED should be set if TEXT represents the start of a symbol name
5253 in its encoded form. */
5256 symbol_completion_match (const char *sym_name
,
5257 const char *text
, int text_len
,
5258 int wild_match
, int encoded
)
5261 const int verbatim_match
= (text
[0] == '<');
5266 /* Strip the leading angle bracket. */
5271 /* First, test against the fully qualified name of the symbol. */
5273 if (strncmp (sym_name
, text
, text_len
) == 0)
5276 if (match
&& !encoded
)
5278 /* One needed check before declaring a positive match is to verify
5279 that iff we are doing a verbatim match, the decoded version
5280 of the symbol name starts with '<'. Otherwise, this symbol name
5281 is not a suitable completion. */
5282 const char *sym_name_copy
= sym_name
;
5283 int has_angle_bracket
;
5285 sym_name
= ada_decode (sym_name
);
5286 has_angle_bracket
= (sym_name
[0] == '<');
5287 match
= (has_angle_bracket
== verbatim_match
);
5288 sym_name
= sym_name_copy
;
5291 if (match
&& !verbatim_match
)
5293 /* When doing non-verbatim match, another check that needs to
5294 be done is to verify that the potentially matching symbol name
5295 does not include capital letters, because the ada-mode would
5296 not be able to understand these symbol names without the
5297 angle bracket notation. */
5300 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5305 /* Second: Try wild matching... */
5307 if (!match
&& wild_match
)
5309 /* Since we are doing wild matching, this means that TEXT
5310 may represent an unqualified symbol name. We therefore must
5311 also compare TEXT against the unqualified name of the symbol. */
5312 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5314 if (strncmp (sym_name
, text
, text_len
) == 0)
5318 /* Finally: If we found a mach, prepare the result to return. */
5324 sym_name
= add_angle_brackets (sym_name
);
5327 sym_name
= ada_decode (sym_name
);
5332 typedef char *char_ptr
;
5333 DEF_VEC_P (char_ptr
);
5335 /* A companion function to ada_make_symbol_completion_list().
5336 Check if SYM_NAME represents a symbol which name would be suitable
5337 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5338 it is appended at the end of the given string vector SV.
5340 ORIG_TEXT is the string original string from the user command
5341 that needs to be completed. WORD is the entire command on which
5342 completion should be performed. These two parameters are used to
5343 determine which part of the symbol name should be added to the
5345 if WILD_MATCH is set, then wild matching is performed.
5346 ENCODED should be set if TEXT represents a symbol name in its
5347 encoded formed (in which case the completion should also be
5351 symbol_completion_add (VEC(char_ptr
) **sv
,
5352 const char *sym_name
,
5353 const char *text
, int text_len
,
5354 const char *orig_text
, const char *word
,
5355 int wild_match
, int encoded
)
5357 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5358 wild_match
, encoded
);
5364 /* We found a match, so add the appropriate completion to the given
5367 if (word
== orig_text
)
5369 completion
= xmalloc (strlen (match
) + 5);
5370 strcpy (completion
, match
);
5372 else if (word
> orig_text
)
5374 /* Return some portion of sym_name. */
5375 completion
= xmalloc (strlen (match
) + 5);
5376 strcpy (completion
, match
+ (word
- orig_text
));
5380 /* Return some of ORIG_TEXT plus sym_name. */
5381 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5382 strncpy (completion
, word
, orig_text
- word
);
5383 completion
[orig_text
- word
] = '\0';
5384 strcat (completion
, match
);
5387 VEC_safe_push (char_ptr
, *sv
, completion
);
5390 /* Return a list of possible symbol names completing TEXT0. The list
5391 is NULL terminated. WORD is the entire command on which completion
5395 ada_make_symbol_completion_list (char *text0
, char *word
)
5401 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5404 struct partial_symtab
*ps
;
5405 struct minimal_symbol
*msymbol
;
5406 struct objfile
*objfile
;
5407 struct block
*b
, *surrounding_static_block
= 0;
5409 struct dict_iterator iter
;
5411 if (text0
[0] == '<')
5413 text
= xstrdup (text0
);
5414 make_cleanup (xfree
, text
);
5415 text_len
= strlen (text
);
5421 text
= xstrdup (ada_encode (text0
));
5422 make_cleanup (xfree
, text
);
5423 text_len
= strlen (text
);
5424 for (i
= 0; i
< text_len
; i
++)
5425 text
[i
] = tolower (text
[i
]);
5427 encoded
= (strstr (text0
, "__") != NULL
);
5428 /* If the name contains a ".", then the user is entering a fully
5429 qualified entity name, and the match must not be done in wild
5430 mode. Similarly, if the user wants to complete what looks like
5431 an encoded name, the match must not be done in wild mode. */
5432 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5435 /* First, look at the partial symtab symbols. */
5436 ALL_PSYMTABS (objfile
, ps
)
5438 struct partial_symbol
**psym
;
5440 /* If the psymtab's been read in we'll get it when we search
5441 through the blockvector. */
5445 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5446 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5447 + ps
->n_global_syms
); psym
++)
5450 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5451 text
, text_len
, text0
, word
,
5452 wild_match
, encoded
);
5455 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5456 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5457 + ps
->n_static_syms
); psym
++)
5460 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5461 text
, text_len
, text0
, word
,
5462 wild_match
, encoded
);
5466 /* At this point scan through the misc symbol vectors and add each
5467 symbol you find to the list. Eventually we want to ignore
5468 anything that isn't a text symbol (everything else will be
5469 handled by the psymtab code above). */
5471 ALL_MSYMBOLS (objfile
, msymbol
)
5474 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5475 text
, text_len
, text0
, word
, wild_match
, encoded
);
5478 /* Search upwards from currently selected frame (so that we can
5479 complete on local vars. */
5481 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5483 if (!BLOCK_SUPERBLOCK (b
))
5484 surrounding_static_block
= b
; /* For elmin of dups */
5486 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5488 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5489 text
, text_len
, text0
, word
,
5490 wild_match
, encoded
);
5494 /* Go through the symtabs and check the externs and statics for
5495 symbols which match. */
5497 ALL_SYMTABS (objfile
, s
)
5500 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5501 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5503 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5504 text
, text_len
, text0
, word
,
5505 wild_match
, encoded
);
5509 ALL_SYMTABS (objfile
, s
)
5512 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5513 /* Don't do this block twice. */
5514 if (b
== surrounding_static_block
)
5516 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5518 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5519 text
, text_len
, text0
, word
,
5520 wild_match
, encoded
);
5524 /* Append the closing NULL entry. */
5525 VEC_safe_push (char_ptr
, completions
, NULL
);
5527 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5528 return the copy. It's unfortunate that we have to make a copy
5529 of an array that we're about to destroy, but there is nothing much
5530 we can do about it. Fortunately, it's typically not a very large
5533 const size_t completions_size
=
5534 VEC_length (char_ptr
, completions
) * sizeof (char *);
5535 char **result
= malloc (completions_size
);
5537 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5539 VEC_free (char_ptr
, completions
);
5546 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5547 for tagged types. */
5550 ada_is_dispatch_table_ptr_type (struct type
*type
)
5554 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5557 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5561 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5564 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5565 to be invisible to users. */
5568 ada_is_ignored_field (struct type
*type
, int field_num
)
5570 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5573 /* Check the name of that field. */
5575 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5577 /* Anonymous field names should not be printed.
5578 brobecker/2007-02-20: I don't think this can actually happen
5579 but we don't want to print the value of annonymous fields anyway. */
5583 /* A field named "_parent" is internally generated by GNAT for
5584 tagged types, and should not be printed either. */
5585 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5589 /* If this is the dispatch table of a tagged type, then ignore. */
5590 if (ada_is_tagged_type (type
, 1)
5591 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5594 /* Not a special field, so it should not be ignored. */
5598 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5599 pointer or reference type whose ultimate target has a tag field. */
5602 ada_is_tagged_type (struct type
*type
, int refok
)
5604 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5607 /* True iff TYPE represents the type of X'Tag */
5610 ada_is_tag_type (struct type
*type
)
5612 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5616 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5617 return (name
!= NULL
5618 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5622 /* The type of the tag on VAL. */
5625 ada_tag_type (struct value
*val
)
5627 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5630 /* The value of the tag on VAL. */
5633 ada_value_tag (struct value
*val
)
5635 return ada_value_struct_elt (val
, "_tag", 0);
5638 /* The value of the tag on the object of type TYPE whose contents are
5639 saved at VALADDR, if it is non-null, or is at memory address
5642 static struct value
*
5643 value_tag_from_contents_and_address (struct type
*type
,
5644 const gdb_byte
*valaddr
,
5647 int tag_byte_offset
, dummy1
, dummy2
;
5648 struct type
*tag_type
;
5649 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5652 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5654 : valaddr
+ tag_byte_offset
);
5655 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5657 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5662 static struct type
*
5663 type_from_tag (struct value
*tag
)
5665 const char *type_name
= ada_tag_name (tag
);
5666 if (type_name
!= NULL
)
5667 return ada_find_any_type (ada_encode (type_name
));
5678 static int ada_tag_name_1 (void *);
5679 static int ada_tag_name_2 (struct tag_args
*);
5681 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5682 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5683 The value stored in ARGS->name is valid until the next call to
5687 ada_tag_name_1 (void *args0
)
5689 struct tag_args
*args
= (struct tag_args
*) args0
;
5690 static char name
[1024];
5694 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5696 return ada_tag_name_2 (args
);
5697 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5700 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5701 for (p
= name
; *p
!= '\0'; p
+= 1)
5708 /* Utility function for ada_tag_name_1 that tries the second
5709 representation for the dispatch table (in which there is no
5710 explicit 'tsd' field in the referent of the tag pointer, and instead
5711 the tsd pointer is stored just before the dispatch table. */
5714 ada_tag_name_2 (struct tag_args
*args
)
5716 struct type
*info_type
;
5717 static char name
[1024];
5719 struct value
*val
, *valp
;
5722 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5723 if (info_type
== NULL
)
5725 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5726 valp
= value_cast (info_type
, args
->tag
);
5729 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5732 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5735 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5736 for (p
= name
; *p
!= '\0'; p
+= 1)
5743 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5747 ada_tag_name (struct value
*tag
)
5749 struct tag_args args
;
5750 if (!ada_is_tag_type (value_type (tag
)))
5754 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5758 /* The parent type of TYPE, or NULL if none. */
5761 ada_parent_type (struct type
*type
)
5765 type
= ada_check_typedef (type
);
5767 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5770 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5771 if (ada_is_parent_field (type
, i
))
5773 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5775 /* If the _parent field is a pointer, then dereference it. */
5776 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5777 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5778 /* If there is a parallel XVS type, get the actual base type. */
5779 parent_type
= ada_get_base_type (parent_type
);
5781 return ada_check_typedef (parent_type
);
5787 /* True iff field number FIELD_NUM of structure type TYPE contains the
5788 parent-type (inherited) fields of a derived type. Assumes TYPE is
5789 a structure type with at least FIELD_NUM+1 fields. */
5792 ada_is_parent_field (struct type
*type
, int field_num
)
5794 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5795 return (name
!= NULL
5796 && (strncmp (name
, "PARENT", 6) == 0
5797 || strncmp (name
, "_parent", 7) == 0));
5800 /* True iff field number FIELD_NUM of structure type TYPE is a
5801 transparent wrapper field (which should be silently traversed when doing
5802 field selection and flattened when printing). Assumes TYPE is a
5803 structure type with at least FIELD_NUM+1 fields. Such fields are always
5807 ada_is_wrapper_field (struct type
*type
, int field_num
)
5809 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5810 return (name
!= NULL
5811 && (strncmp (name
, "PARENT", 6) == 0
5812 || strcmp (name
, "REP") == 0
5813 || strncmp (name
, "_parent", 7) == 0
5814 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5817 /* True iff field number FIELD_NUM of structure or union type TYPE
5818 is a variant wrapper. Assumes TYPE is a structure type with at least
5819 FIELD_NUM+1 fields. */
5822 ada_is_variant_part (struct type
*type
, int field_num
)
5824 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5825 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5826 || (is_dynamic_field (type
, field_num
)
5827 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5828 == TYPE_CODE_UNION
)));
5831 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5832 whose discriminants are contained in the record type OUTER_TYPE,
5833 returns the type of the controlling discriminant for the variant. */
5836 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5838 char *name
= ada_variant_discrim_name (var_type
);
5840 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5842 return builtin_type_int
;
5847 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5848 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5849 represents a 'when others' clause; otherwise 0. */
5852 ada_is_others_clause (struct type
*type
, int field_num
)
5854 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5855 return (name
!= NULL
&& name
[0] == 'O');
5858 /* Assuming that TYPE0 is the type of the variant part of a record,
5859 returns the name of the discriminant controlling the variant.
5860 The value is valid until the next call to ada_variant_discrim_name. */
5863 ada_variant_discrim_name (struct type
*type0
)
5865 static char *result
= NULL
;
5866 static size_t result_len
= 0;
5869 const char *discrim_end
;
5870 const char *discrim_start
;
5872 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5873 type
= TYPE_TARGET_TYPE (type0
);
5877 name
= ada_type_name (type
);
5879 if (name
== NULL
|| name
[0] == '\000')
5882 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5885 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5888 if (discrim_end
== name
)
5891 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5894 if (discrim_start
== name
+ 1)
5896 if ((discrim_start
> name
+ 3
5897 && strncmp (discrim_start
- 3, "___", 3) == 0)
5898 || discrim_start
[-1] == '.')
5902 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5903 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5904 result
[discrim_end
- discrim_start
] = '\0';
5908 /* Scan STR for a subtype-encoded number, beginning at position K.
5909 Put the position of the character just past the number scanned in
5910 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5911 Return 1 if there was a valid number at the given position, and 0
5912 otherwise. A "subtype-encoded" number consists of the absolute value
5913 in decimal, followed by the letter 'm' to indicate a negative number.
5914 Assumes 0m does not occur. */
5917 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5921 if (!isdigit (str
[k
]))
5924 /* Do it the hard way so as not to make any assumption about
5925 the relationship of unsigned long (%lu scan format code) and
5928 while (isdigit (str
[k
]))
5930 RU
= RU
* 10 + (str
[k
] - '0');
5937 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5943 /* NOTE on the above: Technically, C does not say what the results of
5944 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5945 number representable as a LONGEST (although either would probably work
5946 in most implementations). When RU>0, the locution in the then branch
5947 above is always equivalent to the negative of RU. */
5954 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5955 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5956 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5959 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5961 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5974 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5983 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5984 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5986 if (val
>= L
&& val
<= U
)
5998 /* FIXME: Lots of redundancy below. Try to consolidate. */
6000 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6001 ARG_TYPE, extract and return the value of one of its (non-static)
6002 fields. FIELDNO says which field. Differs from value_primitive_field
6003 only in that it can handle packed values of arbitrary type. */
6005 static struct value
*
6006 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6007 struct type
*arg_type
)
6011 arg_type
= ada_check_typedef (arg_type
);
6012 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6014 /* Handle packed fields. */
6016 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6018 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6019 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6021 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6022 offset
+ bit_pos
/ 8,
6023 bit_pos
% 8, bit_size
, type
);
6026 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6029 /* Find field with name NAME in object of type TYPE. If found,
6030 set the following for each argument that is non-null:
6031 - *FIELD_TYPE_P to the field's type;
6032 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6033 an object of that type;
6034 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6035 - *BIT_SIZE_P to its size in bits if the field is packed, and
6037 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6038 fields up to but not including the desired field, or by the total
6039 number of fields if not found. A NULL value of NAME never
6040 matches; the function just counts visible fields in this case.
6042 Returns 1 if found, 0 otherwise. */
6045 find_struct_field (char *name
, struct type
*type
, int offset
,
6046 struct type
**field_type_p
,
6047 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6052 type
= ada_check_typedef (type
);
6054 if (field_type_p
!= NULL
)
6055 *field_type_p
= NULL
;
6056 if (byte_offset_p
!= NULL
)
6058 if (bit_offset_p
!= NULL
)
6060 if (bit_size_p
!= NULL
)
6063 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6065 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6066 int fld_offset
= offset
+ bit_pos
/ 8;
6067 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6069 if (t_field_name
== NULL
)
6072 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6074 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6075 if (field_type_p
!= NULL
)
6076 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6077 if (byte_offset_p
!= NULL
)
6078 *byte_offset_p
= fld_offset
;
6079 if (bit_offset_p
!= NULL
)
6080 *bit_offset_p
= bit_pos
% 8;
6081 if (bit_size_p
!= NULL
)
6082 *bit_size_p
= bit_size
;
6085 else if (ada_is_wrapper_field (type
, i
))
6087 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6088 field_type_p
, byte_offset_p
, bit_offset_p
,
6089 bit_size_p
, index_p
))
6092 else if (ada_is_variant_part (type
, i
))
6094 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6097 struct type
*field_type
6098 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6100 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6102 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6104 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6105 field_type_p
, byte_offset_p
,
6106 bit_offset_p
, bit_size_p
, index_p
))
6110 else if (index_p
!= NULL
)
6116 /* Number of user-visible fields in record type TYPE. */
6119 num_visible_fields (struct type
*type
)
6123 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6127 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6128 and search in it assuming it has (class) type TYPE.
6129 If found, return value, else return NULL.
6131 Searches recursively through wrapper fields (e.g., '_parent'). */
6133 static struct value
*
6134 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6138 type
= ada_check_typedef (type
);
6140 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6142 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6144 if (t_field_name
== NULL
)
6147 else if (field_name_match (t_field_name
, name
))
6148 return ada_value_primitive_field (arg
, offset
, i
, type
);
6150 else if (ada_is_wrapper_field (type
, i
))
6152 struct value
*v
= /* Do not let indent join lines here. */
6153 ada_search_struct_field (name
, arg
,
6154 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6155 TYPE_FIELD_TYPE (type
, i
));
6160 else if (ada_is_variant_part (type
, i
))
6162 /* PNH: Do we ever get here? See find_struct_field. */
6164 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6165 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6167 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6169 struct value
*v
= ada_search_struct_field
/* Force line break. */
6171 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6172 TYPE_FIELD_TYPE (field_type
, j
));
6181 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6182 int, struct type
*);
6185 /* Return field #INDEX in ARG, where the index is that returned by
6186 * find_struct_field through its INDEX_P argument. Adjust the address
6187 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6188 * If found, return value, else return NULL. */
6190 static struct value
*
6191 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6194 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6198 /* Auxiliary function for ada_index_struct_field. Like
6199 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6202 static struct value
*
6203 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6207 type
= ada_check_typedef (type
);
6209 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6211 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6213 else if (ada_is_wrapper_field (type
, i
))
6215 struct value
*v
= /* Do not let indent join lines here. */
6216 ada_index_struct_field_1 (index_p
, arg
,
6217 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6218 TYPE_FIELD_TYPE (type
, i
));
6223 else if (ada_is_variant_part (type
, i
))
6225 /* PNH: Do we ever get here? See ada_search_struct_field,
6226 find_struct_field. */
6227 error (_("Cannot assign this kind of variant record"));
6229 else if (*index_p
== 0)
6230 return ada_value_primitive_field (arg
, offset
, i
, type
);
6237 /* Given ARG, a value of type (pointer or reference to a)*
6238 structure/union, extract the component named NAME from the ultimate
6239 target structure/union and return it as a value with its
6240 appropriate type. If ARG is a pointer or reference and the field
6241 is not packed, returns a reference to the field, otherwise the
6242 value of the field (an lvalue if ARG is an lvalue).
6244 The routine searches for NAME among all members of the structure itself
6245 and (recursively) among all members of any wrapper members
6248 If NO_ERR, then simply return NULL in case of error, rather than
6252 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6254 struct type
*t
, *t1
;
6258 t1
= t
= ada_check_typedef (value_type (arg
));
6259 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6261 t1
= TYPE_TARGET_TYPE (t
);
6264 t1
= ada_check_typedef (t1
);
6265 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6267 arg
= coerce_ref (arg
);
6272 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6274 t1
= TYPE_TARGET_TYPE (t
);
6277 t1
= ada_check_typedef (t1
);
6278 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6280 arg
= value_ind (arg
);
6287 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6291 v
= ada_search_struct_field (name
, arg
, 0, t
);
6294 int bit_offset
, bit_size
, byte_offset
;
6295 struct type
*field_type
;
6298 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6299 address
= value_as_address (arg
);
6301 address
= unpack_pointer (t
, value_contents (arg
));
6303 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6304 if (find_struct_field (name
, t1
, 0,
6305 &field_type
, &byte_offset
, &bit_offset
,
6310 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6311 arg
= ada_coerce_ref (arg
);
6313 arg
= ada_value_ind (arg
);
6314 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6315 bit_offset
, bit_size
,
6319 v
= value_from_pointer (lookup_reference_type (field_type
),
6320 address
+ byte_offset
);
6324 if (v
!= NULL
|| no_err
)
6327 error (_("There is no member named %s."), name
);
6333 error (_("Attempt to extract a component of a value that is not a record."));
6336 /* Given a type TYPE, look up the type of the component of type named NAME.
6337 If DISPP is non-null, add its byte displacement from the beginning of a
6338 structure (pointed to by a value) of type TYPE to *DISPP (does not
6339 work for packed fields).
6341 Matches any field whose name has NAME as a prefix, possibly
6344 TYPE can be either a struct or union. If REFOK, TYPE may also
6345 be a (pointer or reference)+ to a struct or union, and the
6346 ultimate target type will be searched.
6348 Looks recursively into variant clauses and parent types.
6350 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6351 TYPE is not a type of the right kind. */
6353 static struct type
*
6354 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6355 int noerr
, int *dispp
)
6362 if (refok
&& type
!= NULL
)
6365 type
= ada_check_typedef (type
);
6366 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6367 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6369 type
= TYPE_TARGET_TYPE (type
);
6373 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6374 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6380 target_terminal_ours ();
6381 gdb_flush (gdb_stdout
);
6383 error (_("Type (null) is not a structure or union type"));
6386 /* XXX: type_sprint */
6387 fprintf_unfiltered (gdb_stderr
, _("Type "));
6388 type_print (type
, "", gdb_stderr
, -1);
6389 error (_(" is not a structure or union type"));
6394 type
= to_static_fixed_type (type
);
6396 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6398 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6402 if (t_field_name
== NULL
)
6405 else if (field_name_match (t_field_name
, name
))
6408 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6409 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6412 else if (ada_is_wrapper_field (type
, i
))
6415 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6420 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6425 else if (ada_is_variant_part (type
, i
))
6428 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6430 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6433 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6438 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6449 target_terminal_ours ();
6450 gdb_flush (gdb_stdout
);
6453 /* XXX: type_sprint */
6454 fprintf_unfiltered (gdb_stderr
, _("Type "));
6455 type_print (type
, "", gdb_stderr
, -1);
6456 error (_(" has no component named <null>"));
6460 /* XXX: type_sprint */
6461 fprintf_unfiltered (gdb_stderr
, _("Type "));
6462 type_print (type
, "", gdb_stderr
, -1);
6463 error (_(" has no component named %s"), name
);
6470 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6471 within a value of type OUTER_TYPE that is stored in GDB at
6472 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6473 numbering from 0) is applicable. Returns -1 if none are. */
6476 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6477 const gdb_byte
*outer_valaddr
)
6481 char *discrim_name
= ada_variant_discrim_name (var_type
);
6482 struct value
*outer
;
6483 struct value
*discrim
;
6484 LONGEST discrim_val
;
6486 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6487 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6488 if (discrim
== NULL
)
6490 discrim_val
= value_as_long (discrim
);
6493 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6495 if (ada_is_others_clause (var_type
, i
))
6497 else if (ada_in_variant (discrim_val
, var_type
, i
))
6501 return others_clause
;
6506 /* Dynamic-Sized Records */
6508 /* Strategy: The type ostensibly attached to a value with dynamic size
6509 (i.e., a size that is not statically recorded in the debugging
6510 data) does not accurately reflect the size or layout of the value.
6511 Our strategy is to convert these values to values with accurate,
6512 conventional types that are constructed on the fly. */
6514 /* There is a subtle and tricky problem here. In general, we cannot
6515 determine the size of dynamic records without its data. However,
6516 the 'struct value' data structure, which GDB uses to represent
6517 quantities in the inferior process (the target), requires the size
6518 of the type at the time of its allocation in order to reserve space
6519 for GDB's internal copy of the data. That's why the
6520 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6521 rather than struct value*s.
6523 However, GDB's internal history variables ($1, $2, etc.) are
6524 struct value*s containing internal copies of the data that are not, in
6525 general, the same as the data at their corresponding addresses in
6526 the target. Fortunately, the types we give to these values are all
6527 conventional, fixed-size types (as per the strategy described
6528 above), so that we don't usually have to perform the
6529 'to_fixed_xxx_type' conversions to look at their values.
6530 Unfortunately, there is one exception: if one of the internal
6531 history variables is an array whose elements are unconstrained
6532 records, then we will need to create distinct fixed types for each
6533 element selected. */
6535 /* The upshot of all of this is that many routines take a (type, host
6536 address, target address) triple as arguments to represent a value.
6537 The host address, if non-null, is supposed to contain an internal
6538 copy of the relevant data; otherwise, the program is to consult the
6539 target at the target address. */
6541 /* Assuming that VAL0 represents a pointer value, the result of
6542 dereferencing it. Differs from value_ind in its treatment of
6543 dynamic-sized types. */
6546 ada_value_ind (struct value
*val0
)
6548 struct value
*val
= unwrap_value (value_ind (val0
));
6549 return ada_to_fixed_value (val
);
6552 /* The value resulting from dereferencing any "reference to"
6553 qualifiers on VAL0. */
6555 static struct value
*
6556 ada_coerce_ref (struct value
*val0
)
6558 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6560 struct value
*val
= val0
;
6561 val
= coerce_ref (val
);
6562 val
= unwrap_value (val
);
6563 return ada_to_fixed_value (val
);
6569 /* Return OFF rounded upward if necessary to a multiple of
6570 ALIGNMENT (a power of 2). */
6573 align_value (unsigned int off
, unsigned int alignment
)
6575 return (off
+ alignment
- 1) & ~(alignment
- 1);
6578 /* Return the bit alignment required for field #F of template type TYPE. */
6581 field_alignment (struct type
*type
, int f
)
6583 const char *name
= TYPE_FIELD_NAME (type
, f
);
6587 /* The field name should never be null, unless the debugging information
6588 is somehow malformed. In this case, we assume the field does not
6589 require any alignment. */
6593 len
= strlen (name
);
6595 if (!isdigit (name
[len
- 1]))
6598 if (isdigit (name
[len
- 2]))
6599 align_offset
= len
- 2;
6601 align_offset
= len
- 1;
6603 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6604 return TARGET_CHAR_BIT
;
6606 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6609 /* Find a symbol named NAME. Ignores ambiguity. */
6612 ada_find_any_symbol (const char *name
)
6616 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6617 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6620 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6624 /* Find a type named NAME. Ignores ambiguity. */
6627 ada_find_any_type (const char *name
)
6629 struct symbol
*sym
= ada_find_any_symbol (name
);
6632 return SYMBOL_TYPE (sym
);
6637 /* Given NAME and an associated BLOCK, search all symbols for
6638 NAME suffixed with "___XR", which is the ``renaming'' symbol
6639 associated to NAME. Return this symbol if found, return
6643 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6647 sym
= find_old_style_renaming_symbol (name
, block
);
6652 /* Not right yet. FIXME pnh 7/20/2007. */
6653 sym
= ada_find_any_symbol (name
);
6654 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6660 static struct symbol
*
6661 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6663 const struct symbol
*function_sym
= block_linkage_function (block
);
6666 if (function_sym
!= NULL
)
6668 /* If the symbol is defined inside a function, NAME is not fully
6669 qualified. This means we need to prepend the function name
6670 as well as adding the ``___XR'' suffix to build the name of
6671 the associated renaming symbol. */
6672 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6673 /* Function names sometimes contain suffixes used
6674 for instance to qualify nested subprograms. When building
6675 the XR type name, we need to make sure that this suffix is
6676 not included. So do not include any suffix in the function
6677 name length below. */
6678 const int function_name_len
= ada_name_prefix_len (function_name
);
6679 const int rename_len
= function_name_len
+ 2 /* "__" */
6680 + strlen (name
) + 6 /* "___XR\0" */ ;
6682 /* Strip the suffix if necessary. */
6683 function_name
[function_name_len
] = '\0';
6685 /* Library-level functions are a special case, as GNAT adds
6686 a ``_ada_'' prefix to the function name to avoid namespace
6687 pollution. However, the renaming symbols themselves do not
6688 have this prefix, so we need to skip this prefix if present. */
6689 if (function_name_len
> 5 /* "_ada_" */
6690 && strstr (function_name
, "_ada_") == function_name
)
6691 function_name
= function_name
+ 5;
6693 rename
= (char *) alloca (rename_len
* sizeof (char));
6694 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6698 const int rename_len
= strlen (name
) + 6;
6699 rename
= (char *) alloca (rename_len
* sizeof (char));
6700 sprintf (rename
, "%s___XR", name
);
6703 return ada_find_any_symbol (rename
);
6706 /* Because of GNAT encoding conventions, several GDB symbols may match a
6707 given type name. If the type denoted by TYPE0 is to be preferred to
6708 that of TYPE1 for purposes of type printing, return non-zero;
6709 otherwise return 0. */
6712 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6716 else if (type0
== NULL
)
6718 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6720 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6722 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6724 else if (ada_is_packed_array_type (type0
))
6726 else if (ada_is_array_descriptor_type (type0
)
6727 && !ada_is_array_descriptor_type (type1
))
6731 const char *type0_name
= type_name_no_tag (type0
);
6732 const char *type1_name
= type_name_no_tag (type1
);
6734 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6735 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6741 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6742 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6745 ada_type_name (struct type
*type
)
6749 else if (TYPE_NAME (type
) != NULL
)
6750 return TYPE_NAME (type
);
6752 return TYPE_TAG_NAME (type
);
6755 /* Find a parallel type to TYPE whose name is formed by appending
6756 SUFFIX to the name of TYPE. */
6759 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6762 static size_t name_len
= 0;
6764 char *typename
= ada_type_name (type
);
6766 if (typename
== NULL
)
6769 len
= strlen (typename
);
6771 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6773 strcpy (name
, typename
);
6774 strcpy (name
+ len
, suffix
);
6776 return ada_find_any_type (name
);
6780 /* If TYPE is a variable-size record type, return the corresponding template
6781 type describing its fields. Otherwise, return NULL. */
6783 static struct type
*
6784 dynamic_template_type (struct type
*type
)
6786 type
= ada_check_typedef (type
);
6788 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6789 || ada_type_name (type
) == NULL
)
6793 int len
= strlen (ada_type_name (type
));
6794 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6797 return ada_find_parallel_type (type
, "___XVE");
6801 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6802 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6805 is_dynamic_field (struct type
*templ_type
, int field_num
)
6807 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6809 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6810 && strstr (name
, "___XVL") != NULL
;
6813 /* The index of the variant field of TYPE, or -1 if TYPE does not
6814 represent a variant record type. */
6817 variant_field_index (struct type
*type
)
6821 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6824 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6826 if (ada_is_variant_part (type
, f
))
6832 /* A record type with no fields. */
6834 static struct type
*
6835 empty_record (struct objfile
*objfile
)
6837 struct type
*type
= alloc_type (objfile
);
6838 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6839 TYPE_NFIELDS (type
) = 0;
6840 TYPE_FIELDS (type
) = NULL
;
6841 TYPE_NAME (type
) = "<empty>";
6842 TYPE_TAG_NAME (type
) = NULL
;
6843 TYPE_LENGTH (type
) = 0;
6847 /* An ordinary record type (with fixed-length fields) that describes
6848 the value of type TYPE at VALADDR or ADDRESS (see comments at
6849 the beginning of this section) VAL according to GNAT conventions.
6850 DVAL0 should describe the (portion of a) record that contains any
6851 necessary discriminants. It should be NULL if value_type (VAL) is
6852 an outer-level type (i.e., as opposed to a branch of a variant.) A
6853 variant field (unless unchecked) is replaced by a particular branch
6856 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6857 length are not statically known are discarded. As a consequence,
6858 VALADDR, ADDRESS and DVAL0 are ignored.
6860 NOTE: Limitations: For now, we assume that dynamic fields and
6861 variants occupy whole numbers of bytes. However, they need not be
6865 ada_template_to_fixed_record_type_1 (struct type
*type
,
6866 const gdb_byte
*valaddr
,
6867 CORE_ADDR address
, struct value
*dval0
,
6868 int keep_dynamic_fields
)
6870 struct value
*mark
= value_mark ();
6873 int nfields
, bit_len
;
6876 int fld_bit_len
, bit_incr
;
6879 /* Compute the number of fields in this record type that are going
6880 to be processed: unless keep_dynamic_fields, this includes only
6881 fields whose position and length are static will be processed. */
6882 if (keep_dynamic_fields
)
6883 nfields
= TYPE_NFIELDS (type
);
6887 while (nfields
< TYPE_NFIELDS (type
)
6888 && !ada_is_variant_part (type
, nfields
)
6889 && !is_dynamic_field (type
, nfields
))
6893 rtype
= alloc_type (TYPE_OBJFILE (type
));
6894 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6895 INIT_CPLUS_SPECIFIC (rtype
);
6896 TYPE_NFIELDS (rtype
) = nfields
;
6897 TYPE_FIELDS (rtype
) = (struct field
*)
6898 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6899 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6900 TYPE_NAME (rtype
) = ada_type_name (type
);
6901 TYPE_TAG_NAME (rtype
) = NULL
;
6902 TYPE_FIXED_INSTANCE (rtype
) = 1;
6908 for (f
= 0; f
< nfields
; f
+= 1)
6910 off
= align_value (off
, field_alignment (type
, f
))
6911 + TYPE_FIELD_BITPOS (type
, f
);
6912 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6913 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6915 if (ada_is_variant_part (type
, f
))
6918 fld_bit_len
= bit_incr
= 0;
6920 else if (is_dynamic_field (type
, f
))
6923 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6927 /* Get the fixed type of the field. Note that, in this case, we
6928 do not want to get the real type out of the tag: if the current
6929 field is the parent part of a tagged record, we will get the
6930 tag of the object. Clearly wrong: the real type of the parent
6931 is not the real type of the child. We would end up in an infinite
6933 TYPE_FIELD_TYPE (rtype
, f
) =
6936 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6937 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6938 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6939 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6940 bit_incr
= fld_bit_len
=
6941 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6945 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6946 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6947 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6948 bit_incr
= fld_bit_len
=
6949 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6951 bit_incr
= fld_bit_len
=
6952 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6954 if (off
+ fld_bit_len
> bit_len
)
6955 bit_len
= off
+ fld_bit_len
;
6957 TYPE_LENGTH (rtype
) =
6958 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6961 /* We handle the variant part, if any, at the end because of certain
6962 odd cases in which it is re-ordered so as NOT the last field of
6963 the record. This can happen in the presence of representation
6965 if (variant_field
>= 0)
6967 struct type
*branch_type
;
6969 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6972 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6977 to_fixed_variant_branch_type
6978 (TYPE_FIELD_TYPE (type
, variant_field
),
6979 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6980 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6981 if (branch_type
== NULL
)
6983 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6984 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6985 TYPE_NFIELDS (rtype
) -= 1;
6989 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6990 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6992 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6994 if (off
+ fld_bit_len
> bit_len
)
6995 bit_len
= off
+ fld_bit_len
;
6996 TYPE_LENGTH (rtype
) =
6997 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7001 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7002 should contain the alignment of that record, which should be a strictly
7003 positive value. If null or negative, then something is wrong, most
7004 probably in the debug info. In that case, we don't round up the size
7005 of the resulting type. If this record is not part of another structure,
7006 the current RTYPE length might be good enough for our purposes. */
7007 if (TYPE_LENGTH (type
) <= 0)
7009 if (TYPE_NAME (rtype
))
7010 warning (_("Invalid type size for `%s' detected: %d."),
7011 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7013 warning (_("Invalid type size for <unnamed> detected: %d."),
7014 TYPE_LENGTH (type
));
7018 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7019 TYPE_LENGTH (type
));
7022 value_free_to_mark (mark
);
7023 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7024 error (_("record type with dynamic size is larger than varsize-limit"));
7028 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7031 static struct type
*
7032 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7033 CORE_ADDR address
, struct value
*dval0
)
7035 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7039 /* An ordinary record type in which ___XVL-convention fields and
7040 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7041 static approximations, containing all possible fields. Uses
7042 no runtime values. Useless for use in values, but that's OK,
7043 since the results are used only for type determinations. Works on both
7044 structs and unions. Representation note: to save space, we memorize
7045 the result of this function in the TYPE_TARGET_TYPE of the
7048 static struct type
*
7049 template_to_static_fixed_type (struct type
*type0
)
7055 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7056 return TYPE_TARGET_TYPE (type0
);
7058 nfields
= TYPE_NFIELDS (type0
);
7061 for (f
= 0; f
< nfields
; f
+= 1)
7063 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7064 struct type
*new_type
;
7066 if (is_dynamic_field (type0
, f
))
7067 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7069 new_type
= static_unwrap_type (field_type
);
7070 if (type
== type0
&& new_type
!= field_type
)
7072 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
7073 TYPE_CODE (type
) = TYPE_CODE (type0
);
7074 INIT_CPLUS_SPECIFIC (type
);
7075 TYPE_NFIELDS (type
) = nfields
;
7076 TYPE_FIELDS (type
) = (struct field
*)
7077 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7078 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7079 sizeof (struct field
) * nfields
);
7080 TYPE_NAME (type
) = ada_type_name (type0
);
7081 TYPE_TAG_NAME (type
) = NULL
;
7082 TYPE_FIXED_INSTANCE (type
) = 1;
7083 TYPE_LENGTH (type
) = 0;
7085 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7086 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7091 /* Given an object of type TYPE whose contents are at VALADDR and
7092 whose address in memory is ADDRESS, returns a revision of TYPE,
7093 which should be a non-dynamic-sized record, in which the variant
7094 part, if any, is replaced with the appropriate branch. Looks
7095 for discriminant values in DVAL0, which can be NULL if the record
7096 contains the necessary discriminant values. */
7098 static struct type
*
7099 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7100 CORE_ADDR address
, struct value
*dval0
)
7102 struct value
*mark
= value_mark ();
7105 struct type
*branch_type
;
7106 int nfields
= TYPE_NFIELDS (type
);
7107 int variant_field
= variant_field_index (type
);
7109 if (variant_field
== -1)
7113 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7117 rtype
= alloc_type (TYPE_OBJFILE (type
));
7118 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7119 INIT_CPLUS_SPECIFIC (rtype
);
7120 TYPE_NFIELDS (rtype
) = nfields
;
7121 TYPE_FIELDS (rtype
) =
7122 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7123 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7124 sizeof (struct field
) * nfields
);
7125 TYPE_NAME (rtype
) = ada_type_name (type
);
7126 TYPE_TAG_NAME (rtype
) = NULL
;
7127 TYPE_FIXED_INSTANCE (rtype
) = 1;
7128 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7130 branch_type
= to_fixed_variant_branch_type
7131 (TYPE_FIELD_TYPE (type
, variant_field
),
7132 cond_offset_host (valaddr
,
7133 TYPE_FIELD_BITPOS (type
, variant_field
)
7135 cond_offset_target (address
,
7136 TYPE_FIELD_BITPOS (type
, variant_field
)
7137 / TARGET_CHAR_BIT
), dval
);
7138 if (branch_type
== NULL
)
7141 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7142 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7143 TYPE_NFIELDS (rtype
) -= 1;
7147 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7148 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7149 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7150 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7152 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7154 value_free_to_mark (mark
);
7158 /* An ordinary record type (with fixed-length fields) that describes
7159 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7160 beginning of this section]. Any necessary discriminants' values
7161 should be in DVAL, a record value; it may be NULL if the object
7162 at ADDR itself contains any necessary discriminant values.
7163 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7164 values from the record are needed. Except in the case that DVAL,
7165 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7166 unchecked) is replaced by a particular branch of the variant.
7168 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7169 is questionable and may be removed. It can arise during the
7170 processing of an unconstrained-array-of-record type where all the
7171 variant branches have exactly the same size. This is because in
7172 such cases, the compiler does not bother to use the XVS convention
7173 when encoding the record. I am currently dubious of this
7174 shortcut and suspect the compiler should be altered. FIXME. */
7176 static struct type
*
7177 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7178 CORE_ADDR address
, struct value
*dval
)
7180 struct type
*templ_type
;
7182 if (TYPE_FIXED_INSTANCE (type0
))
7185 templ_type
= dynamic_template_type (type0
);
7187 if (templ_type
!= NULL
)
7188 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7189 else if (variant_field_index (type0
) >= 0)
7191 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7193 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7198 TYPE_FIXED_INSTANCE (type0
) = 1;
7204 /* An ordinary record type (with fixed-length fields) that describes
7205 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7206 union type. Any necessary discriminants' values should be in DVAL,
7207 a record value. That is, this routine selects the appropriate
7208 branch of the union at ADDR according to the discriminant value
7209 indicated in the union's type name. */
7211 static struct type
*
7212 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7213 CORE_ADDR address
, struct value
*dval
)
7216 struct type
*templ_type
;
7217 struct type
*var_type
;
7219 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7220 var_type
= TYPE_TARGET_TYPE (var_type0
);
7222 var_type
= var_type0
;
7224 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7226 if (templ_type
!= NULL
)
7227 var_type
= templ_type
;
7230 ada_which_variant_applies (var_type
,
7231 value_type (dval
), value_contents (dval
));
7234 return empty_record (TYPE_OBJFILE (var_type
));
7235 else if (is_dynamic_field (var_type
, which
))
7236 return to_fixed_record_type
7237 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7238 valaddr
, address
, dval
);
7239 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7241 to_fixed_record_type
7242 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7244 return TYPE_FIELD_TYPE (var_type
, which
);
7247 /* Assuming that TYPE0 is an array type describing the type of a value
7248 at ADDR, and that DVAL describes a record containing any
7249 discriminants used in TYPE0, returns a type for the value that
7250 contains no dynamic components (that is, no components whose sizes
7251 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7252 true, gives an error message if the resulting type's size is over
7255 static struct type
*
7256 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7259 struct type
*index_type_desc
;
7260 struct type
*result
;
7262 if (ada_is_packed_array_type (type0
) /* revisit? */
7263 || TYPE_FIXED_INSTANCE (type0
))
7266 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7267 if (index_type_desc
== NULL
)
7269 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7270 /* NOTE: elt_type---the fixed version of elt_type0---should never
7271 depend on the contents of the array in properly constructed
7273 /* Create a fixed version of the array element type.
7274 We're not providing the address of an element here,
7275 and thus the actual object value cannot be inspected to do
7276 the conversion. This should not be a problem, since arrays of
7277 unconstrained objects are not allowed. In particular, all
7278 the elements of an array of a tagged type should all be of
7279 the same type specified in the debugging info. No need to
7280 consult the object tag. */
7281 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7283 if (elt_type0
== elt_type
)
7286 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7287 elt_type
, TYPE_INDEX_TYPE (type0
));
7292 struct type
*elt_type0
;
7295 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7296 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7298 /* NOTE: result---the fixed version of elt_type0---should never
7299 depend on the contents of the array in properly constructed
7301 /* Create a fixed version of the array element type.
7302 We're not providing the address of an element here,
7303 and thus the actual object value cannot be inspected to do
7304 the conversion. This should not be a problem, since arrays of
7305 unconstrained objects are not allowed. In particular, all
7306 the elements of an array of a tagged type should all be of
7307 the same type specified in the debugging info. No need to
7308 consult the object tag. */
7310 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7311 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7313 struct type
*range_type
=
7314 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7315 dval
, TYPE_OBJFILE (type0
));
7316 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7317 result
, range_type
);
7319 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7320 error (_("array type with dynamic size is larger than varsize-limit"));
7323 TYPE_FIXED_INSTANCE (result
) = 1;
7328 /* A standard type (containing no dynamically sized components)
7329 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7330 DVAL describes a record containing any discriminants used in TYPE0,
7331 and may be NULL if there are none, or if the object of type TYPE at
7332 ADDRESS or in VALADDR contains these discriminants.
7334 If CHECK_TAG is not null, in the case of tagged types, this function
7335 attempts to locate the object's tag and use it to compute the actual
7336 type. However, when ADDRESS is null, we cannot use it to determine the
7337 location of the tag, and therefore compute the tagged type's actual type.
7338 So we return the tagged type without consulting the tag. */
7340 static struct type
*
7341 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7342 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7344 type
= ada_check_typedef (type
);
7345 switch (TYPE_CODE (type
))
7349 case TYPE_CODE_STRUCT
:
7351 struct type
*static_type
= to_static_fixed_type (type
);
7352 struct type
*fixed_record_type
=
7353 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7354 /* If STATIC_TYPE is a tagged type and we know the object's address,
7355 then we can determine its tag, and compute the object's actual
7356 type from there. Note that we have to use the fixed record
7357 type (the parent part of the record may have dynamic fields
7358 and the way the location of _tag is expressed may depend on
7361 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7363 struct type
*real_type
=
7364 type_from_tag (value_tag_from_contents_and_address
7368 if (real_type
!= NULL
)
7369 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7371 return fixed_record_type
;
7373 case TYPE_CODE_ARRAY
:
7374 return to_fixed_array_type (type
, dval
, 1);
7375 case TYPE_CODE_UNION
:
7379 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7383 /* The same as ada_to_fixed_type_1, except that it preserves the type
7384 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7385 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7388 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7389 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7392 struct type
*fixed_type
=
7393 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7395 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7396 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7402 /* A standard (static-sized) type corresponding as well as possible to
7403 TYPE0, but based on no runtime data. */
7405 static struct type
*
7406 to_static_fixed_type (struct type
*type0
)
7413 if (TYPE_FIXED_INSTANCE (type0
))
7416 type0
= ada_check_typedef (type0
);
7418 switch (TYPE_CODE (type0
))
7422 case TYPE_CODE_STRUCT
:
7423 type
= dynamic_template_type (type0
);
7425 return template_to_static_fixed_type (type
);
7427 return template_to_static_fixed_type (type0
);
7428 case TYPE_CODE_UNION
:
7429 type
= ada_find_parallel_type (type0
, "___XVU");
7431 return template_to_static_fixed_type (type
);
7433 return template_to_static_fixed_type (type0
);
7437 /* A static approximation of TYPE with all type wrappers removed. */
7439 static struct type
*
7440 static_unwrap_type (struct type
*type
)
7442 if (ada_is_aligner_type (type
))
7444 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7445 if (ada_type_name (type1
) == NULL
)
7446 TYPE_NAME (type1
) = ada_type_name (type
);
7448 return static_unwrap_type (type1
);
7452 struct type
*raw_real_type
= ada_get_base_type (type
);
7453 if (raw_real_type
== type
)
7456 return to_static_fixed_type (raw_real_type
);
7460 /* In some cases, incomplete and private types require
7461 cross-references that are not resolved as records (for example,
7463 type FooP is access Foo;
7465 type Foo is array ...;
7466 ). In these cases, since there is no mechanism for producing
7467 cross-references to such types, we instead substitute for FooP a
7468 stub enumeration type that is nowhere resolved, and whose tag is
7469 the name of the actual type. Call these types "non-record stubs". */
7471 /* A type equivalent to TYPE that is not a non-record stub, if one
7472 exists, otherwise TYPE. */
7475 ada_check_typedef (struct type
*type
)
7480 CHECK_TYPEDEF (type
);
7481 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7482 || !TYPE_STUB (type
)
7483 || TYPE_TAG_NAME (type
) == NULL
)
7487 char *name
= TYPE_TAG_NAME (type
);
7488 struct type
*type1
= ada_find_any_type (name
);
7489 return (type1
== NULL
) ? type
: type1
;
7493 /* A value representing the data at VALADDR/ADDRESS as described by
7494 type TYPE0, but with a standard (static-sized) type that correctly
7495 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7496 type, then return VAL0 [this feature is simply to avoid redundant
7497 creation of struct values]. */
7499 static struct value
*
7500 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7503 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7504 if (type
== type0
&& val0
!= NULL
)
7507 return value_from_contents_and_address (type
, 0, address
);
7510 /* A value representing VAL, but with a standard (static-sized) type
7511 that correctly describes it. Does not necessarily create a new
7514 static struct value
*
7515 ada_to_fixed_value (struct value
*val
)
7517 return ada_to_fixed_value_create (value_type (val
),
7518 VALUE_ADDRESS (val
) + value_offset (val
),
7522 /* A value representing VAL, but with a standard (static-sized) type
7523 chosen to approximate the real type of VAL as well as possible, but
7524 without consulting any runtime values. For Ada dynamic-sized
7525 types, therefore, the type of the result is likely to be inaccurate. */
7528 ada_to_static_fixed_value (struct value
*val
)
7531 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7532 if (type
== value_type (val
))
7535 return coerce_unspec_val_to_type (val
, type
);
7541 /* Table mapping attribute numbers to names.
7542 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7544 static const char *attribute_names
[] = {
7562 ada_attribute_name (enum exp_opcode n
)
7564 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7565 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7567 return attribute_names
[0];
7570 /* Evaluate the 'POS attribute applied to ARG. */
7573 pos_atr (struct value
*arg
)
7575 struct value
*val
= coerce_ref (arg
);
7576 struct type
*type
= value_type (val
);
7578 if (!discrete_type_p (type
))
7579 error (_("'POS only defined on discrete types"));
7581 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7584 LONGEST v
= value_as_long (val
);
7586 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7588 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7591 error (_("enumeration value is invalid: can't find 'POS"));
7594 return value_as_long (val
);
7597 static struct value
*
7598 value_pos_atr (struct value
*arg
)
7600 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7603 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7605 static struct value
*
7606 value_val_atr (struct type
*type
, struct value
*arg
)
7608 if (!discrete_type_p (type
))
7609 error (_("'VAL only defined on discrete types"));
7610 if (!integer_type_p (value_type (arg
)))
7611 error (_("'VAL requires integral argument"));
7613 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7615 long pos
= value_as_long (arg
);
7616 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7617 error (_("argument to 'VAL out of range"));
7618 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7621 return value_from_longest (type
, value_as_long (arg
));
7627 /* True if TYPE appears to be an Ada character type.
7628 [At the moment, this is true only for Character and Wide_Character;
7629 It is a heuristic test that could stand improvement]. */
7632 ada_is_character_type (struct type
*type
)
7636 /* If the type code says it's a character, then assume it really is,
7637 and don't check any further. */
7638 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7641 /* Otherwise, assume it's a character type iff it is a discrete type
7642 with a known character type name. */
7643 name
= ada_type_name (type
);
7644 return (name
!= NULL
7645 && (TYPE_CODE (type
) == TYPE_CODE_INT
7646 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7647 && (strcmp (name
, "character") == 0
7648 || strcmp (name
, "wide_character") == 0
7649 || strcmp (name
, "wide_wide_character") == 0
7650 || strcmp (name
, "unsigned char") == 0));
7653 /* True if TYPE appears to be an Ada string type. */
7656 ada_is_string_type (struct type
*type
)
7658 type
= ada_check_typedef (type
);
7660 && TYPE_CODE (type
) != TYPE_CODE_PTR
7661 && (ada_is_simple_array_type (type
)
7662 || ada_is_array_descriptor_type (type
))
7663 && ada_array_arity (type
) == 1)
7665 struct type
*elttype
= ada_array_element_type (type
, 1);
7667 return ada_is_character_type (elttype
);
7674 /* True if TYPE is a struct type introduced by the compiler to force the
7675 alignment of a value. Such types have a single field with a
7676 distinctive name. */
7679 ada_is_aligner_type (struct type
*type
)
7681 type
= ada_check_typedef (type
);
7683 /* If we can find a parallel XVS type, then the XVS type should
7684 be used instead of this type. And hence, this is not an aligner
7686 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7689 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7690 && TYPE_NFIELDS (type
) == 1
7691 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7694 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7695 the parallel type. */
7698 ada_get_base_type (struct type
*raw_type
)
7700 struct type
*real_type_namer
;
7701 struct type
*raw_real_type
;
7703 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7706 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7707 if (real_type_namer
== NULL
7708 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7709 || TYPE_NFIELDS (real_type_namer
) != 1)
7712 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7713 if (raw_real_type
== NULL
)
7716 return raw_real_type
;
7719 /* The type of value designated by TYPE, with all aligners removed. */
7722 ada_aligned_type (struct type
*type
)
7724 if (ada_is_aligner_type (type
))
7725 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7727 return ada_get_base_type (type
);
7731 /* The address of the aligned value in an object at address VALADDR
7732 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7735 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7737 if (ada_is_aligner_type (type
))
7738 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7740 TYPE_FIELD_BITPOS (type
,
7741 0) / TARGET_CHAR_BIT
);
7748 /* The printed representation of an enumeration literal with encoded
7749 name NAME. The value is good to the next call of ada_enum_name. */
7751 ada_enum_name (const char *name
)
7753 static char *result
;
7754 static size_t result_len
= 0;
7757 /* First, unqualify the enumeration name:
7758 1. Search for the last '.' character. If we find one, then skip
7759 all the preceeding characters, the unqualified name starts
7760 right after that dot.
7761 2. Otherwise, we may be debugging on a target where the compiler
7762 translates dots into "__". Search forward for double underscores,
7763 but stop searching when we hit an overloading suffix, which is
7764 of the form "__" followed by digits. */
7766 tmp
= strrchr (name
, '.');
7771 while ((tmp
= strstr (name
, "__")) != NULL
)
7773 if (isdigit (tmp
[2]))
7783 if (name
[1] == 'U' || name
[1] == 'W')
7785 if (sscanf (name
+ 2, "%x", &v
) != 1)
7791 GROW_VECT (result
, result_len
, 16);
7792 if (isascii (v
) && isprint (v
))
7793 sprintf (result
, "'%c'", v
);
7794 else if (name
[1] == 'U')
7795 sprintf (result
, "[\"%02x\"]", v
);
7797 sprintf (result
, "[\"%04x\"]", v
);
7803 tmp
= strstr (name
, "__");
7805 tmp
= strstr (name
, "$");
7808 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7809 strncpy (result
, name
, tmp
- name
);
7810 result
[tmp
- name
] = '\0';
7818 static struct value
*
7819 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7822 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7823 (expect_type
, exp
, pos
, noside
);
7826 /* Evaluate the subexpression of EXP starting at *POS as for
7827 evaluate_type, updating *POS to point just past the evaluated
7830 static struct value
*
7831 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7833 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7834 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7837 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7840 static struct value
*
7841 unwrap_value (struct value
*val
)
7843 struct type
*type
= ada_check_typedef (value_type (val
));
7844 if (ada_is_aligner_type (type
))
7846 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7847 struct type
*val_type
= ada_check_typedef (value_type (v
));
7848 if (ada_type_name (val_type
) == NULL
)
7849 TYPE_NAME (val_type
) = ada_type_name (type
);
7851 return unwrap_value (v
);
7855 struct type
*raw_real_type
=
7856 ada_check_typedef (ada_get_base_type (type
));
7858 if (type
== raw_real_type
)
7862 coerce_unspec_val_to_type
7863 (val
, ada_to_fixed_type (raw_real_type
, 0,
7864 VALUE_ADDRESS (val
) + value_offset (val
),
7869 static struct value
*
7870 cast_to_fixed (struct type
*type
, struct value
*arg
)
7874 if (type
== value_type (arg
))
7876 else if (ada_is_fixed_point_type (value_type (arg
)))
7877 val
= ada_float_to_fixed (type
,
7878 ada_fixed_to_float (value_type (arg
),
7879 value_as_long (arg
)));
7883 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7884 val
= ada_float_to_fixed (type
, argd
);
7887 return value_from_longest (type
, val
);
7890 static struct value
*
7891 cast_from_fixed_to_double (struct value
*arg
)
7893 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7894 value_as_long (arg
));
7895 return value_from_double (builtin_type_double
, val
);
7898 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7899 return the converted value. */
7901 static struct value
*
7902 coerce_for_assign (struct type
*type
, struct value
*val
)
7904 struct type
*type2
= value_type (val
);
7908 type2
= ada_check_typedef (type2
);
7909 type
= ada_check_typedef (type
);
7911 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7912 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7914 val
= ada_value_ind (val
);
7915 type2
= value_type (val
);
7918 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7919 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7921 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7922 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7923 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7924 error (_("Incompatible types in assignment"));
7925 deprecated_set_value_type (val
, type
);
7930 static struct value
*
7931 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7934 struct type
*type1
, *type2
;
7937 arg1
= coerce_ref (arg1
);
7938 arg2
= coerce_ref (arg2
);
7939 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7940 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7942 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7943 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7944 return value_binop (arg1
, arg2
, op
);
7953 return value_binop (arg1
, arg2
, op
);
7956 v2
= value_as_long (arg2
);
7958 error (_("second operand of %s must not be zero."), op_string (op
));
7960 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7961 return value_binop (arg1
, arg2
, op
);
7963 v1
= value_as_long (arg1
);
7968 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7969 v
+= v
> 0 ? -1 : 1;
7977 /* Should not reach this point. */
7981 val
= allocate_value (type1
);
7982 store_unsigned_integer (value_contents_raw (val
),
7983 TYPE_LENGTH (value_type (val
)), v
);
7988 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7990 if (ada_is_direct_array_type (value_type (arg1
))
7991 || ada_is_direct_array_type (value_type (arg2
)))
7993 /* Automatically dereference any array reference before
7994 we attempt to perform the comparison. */
7995 arg1
= ada_coerce_ref (arg1
);
7996 arg2
= ada_coerce_ref (arg2
);
7998 arg1
= ada_coerce_to_simple_array (arg1
);
7999 arg2
= ada_coerce_to_simple_array (arg2
);
8000 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8001 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8002 error (_("Attempt to compare array with non-array"));
8003 /* FIXME: The following works only for types whose
8004 representations use all bits (no padding or undefined bits)
8005 and do not have user-defined equality. */
8007 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8008 && memcmp (value_contents (arg1
), value_contents (arg2
),
8009 TYPE_LENGTH (value_type (arg1
))) == 0;
8011 return value_equal (arg1
, arg2
);
8014 /* Total number of component associations in the aggregate starting at
8015 index PC in EXP. Assumes that index PC is the start of an
8019 num_component_specs (struct expression
*exp
, int pc
)
8022 m
= exp
->elts
[pc
+ 1].longconst
;
8025 for (i
= 0; i
< m
; i
+= 1)
8027 switch (exp
->elts
[pc
].opcode
)
8033 n
+= exp
->elts
[pc
+ 1].longconst
;
8036 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8041 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8042 component of LHS (a simple array or a record), updating *POS past
8043 the expression, assuming that LHS is contained in CONTAINER. Does
8044 not modify the inferior's memory, nor does it modify LHS (unless
8045 LHS == CONTAINER). */
8048 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8049 struct expression
*exp
, int *pos
)
8051 struct value
*mark
= value_mark ();
8053 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8055 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
8056 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8060 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8061 elt
= ada_to_fixed_value (unwrap_value (elt
));
8064 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8065 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8067 value_assign_to_component (container
, elt
,
8068 ada_evaluate_subexp (NULL
, exp
, pos
,
8071 value_free_to_mark (mark
);
8074 /* Assuming that LHS represents an lvalue having a record or array
8075 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8076 of that aggregate's value to LHS, advancing *POS past the
8077 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8078 lvalue containing LHS (possibly LHS itself). Does not modify
8079 the inferior's memory, nor does it modify the contents of
8080 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8082 static struct value
*
8083 assign_aggregate (struct value
*container
,
8084 struct value
*lhs
, struct expression
*exp
,
8085 int *pos
, enum noside noside
)
8087 struct type
*lhs_type
;
8088 int n
= exp
->elts
[*pos
+1].longconst
;
8089 LONGEST low_index
, high_index
;
8092 int max_indices
, num_indices
;
8093 int is_array_aggregate
;
8095 struct value
*mark
= value_mark ();
8098 if (noside
!= EVAL_NORMAL
)
8101 for (i
= 0; i
< n
; i
+= 1)
8102 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8106 container
= ada_coerce_ref (container
);
8107 if (ada_is_direct_array_type (value_type (container
)))
8108 container
= ada_coerce_to_simple_array (container
);
8109 lhs
= ada_coerce_ref (lhs
);
8110 if (!deprecated_value_modifiable (lhs
))
8111 error (_("Left operand of assignment is not a modifiable lvalue."));
8113 lhs_type
= value_type (lhs
);
8114 if (ada_is_direct_array_type (lhs_type
))
8116 lhs
= ada_coerce_to_simple_array (lhs
);
8117 lhs_type
= value_type (lhs
);
8118 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8119 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8120 is_array_aggregate
= 1;
8122 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8125 high_index
= num_visible_fields (lhs_type
) - 1;
8126 is_array_aggregate
= 0;
8129 error (_("Left-hand side must be array or record."));
8131 num_specs
= num_component_specs (exp
, *pos
- 3);
8132 max_indices
= 4 * num_specs
+ 4;
8133 indices
= alloca (max_indices
* sizeof (indices
[0]));
8134 indices
[0] = indices
[1] = low_index
- 1;
8135 indices
[2] = indices
[3] = high_index
+ 1;
8138 for (i
= 0; i
< n
; i
+= 1)
8140 switch (exp
->elts
[*pos
].opcode
)
8143 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8144 &num_indices
, max_indices
,
8145 low_index
, high_index
);
8148 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8149 &num_indices
, max_indices
,
8150 low_index
, high_index
);
8154 error (_("Misplaced 'others' clause"));
8155 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8156 num_indices
, low_index
, high_index
);
8159 error (_("Internal error: bad aggregate clause"));
8166 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8167 construct at *POS, updating *POS past the construct, given that
8168 the positions are relative to lower bound LOW, where HIGH is the
8169 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8170 updating *NUM_INDICES as needed. CONTAINER is as for
8171 assign_aggregate. */
8173 aggregate_assign_positional (struct value
*container
,
8174 struct value
*lhs
, struct expression
*exp
,
8175 int *pos
, LONGEST
*indices
, int *num_indices
,
8176 int max_indices
, LONGEST low
, LONGEST high
)
8178 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8180 if (ind
- 1 == high
)
8181 warning (_("Extra components in aggregate ignored."));
8184 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8186 assign_component (container
, lhs
, ind
, exp
, pos
);
8189 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8192 /* Assign into the components of LHS indexed by the OP_CHOICES
8193 construct at *POS, updating *POS past the construct, given that
8194 the allowable indices are LOW..HIGH. Record the indices assigned
8195 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8196 needed. CONTAINER is as for assign_aggregate. */
8198 aggregate_assign_from_choices (struct value
*container
,
8199 struct value
*lhs
, struct expression
*exp
,
8200 int *pos
, LONGEST
*indices
, int *num_indices
,
8201 int max_indices
, LONGEST low
, LONGEST high
)
8204 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8205 int choice_pos
, expr_pc
;
8206 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8208 choice_pos
= *pos
+= 3;
8210 for (j
= 0; j
< n_choices
; j
+= 1)
8211 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8213 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8215 for (j
= 0; j
< n_choices
; j
+= 1)
8217 LONGEST lower
, upper
;
8218 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8219 if (op
== OP_DISCRETE_RANGE
)
8222 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8224 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8229 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8240 name
= &exp
->elts
[choice_pos
+ 2].string
;
8243 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8246 error (_("Invalid record component association."));
8248 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8250 if (! find_struct_field (name
, value_type (lhs
), 0,
8251 NULL
, NULL
, NULL
, NULL
, &ind
))
8252 error (_("Unknown component name: %s."), name
);
8253 lower
= upper
= ind
;
8256 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8257 error (_("Index in component association out of bounds."));
8259 add_component_interval (lower
, upper
, indices
, num_indices
,
8261 while (lower
<= upper
)
8265 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8271 /* Assign the value of the expression in the OP_OTHERS construct in
8272 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8273 have not been previously assigned. The index intervals already assigned
8274 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8275 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8277 aggregate_assign_others (struct value
*container
,
8278 struct value
*lhs
, struct expression
*exp
,
8279 int *pos
, LONGEST
*indices
, int num_indices
,
8280 LONGEST low
, LONGEST high
)
8283 int expr_pc
= *pos
+1;
8285 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8288 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8292 assign_component (container
, lhs
, ind
, exp
, &pos
);
8295 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8298 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8299 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8300 modifying *SIZE as needed. It is an error if *SIZE exceeds
8301 MAX_SIZE. The resulting intervals do not overlap. */
8303 add_component_interval (LONGEST low
, LONGEST high
,
8304 LONGEST
* indices
, int *size
, int max_size
)
8307 for (i
= 0; i
< *size
; i
+= 2) {
8308 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8311 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8312 if (high
< indices
[kh
])
8314 if (low
< indices
[i
])
8316 indices
[i
+ 1] = indices
[kh
- 1];
8317 if (high
> indices
[i
+ 1])
8318 indices
[i
+ 1] = high
;
8319 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8320 *size
-= kh
- i
- 2;
8323 else if (high
< indices
[i
])
8327 if (*size
== max_size
)
8328 error (_("Internal error: miscounted aggregate components."));
8330 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8331 indices
[j
] = indices
[j
- 2];
8333 indices
[i
+ 1] = high
;
8336 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8339 static struct value
*
8340 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8342 if (type
== ada_check_typedef (value_type (arg2
)))
8345 if (ada_is_fixed_point_type (type
))
8346 return (cast_to_fixed (type
, arg2
));
8348 if (ada_is_fixed_point_type (value_type (arg2
)))
8349 return value_cast (type
, cast_from_fixed_to_double (arg2
));
8351 return value_cast (type
, arg2
);
8354 static struct value
*
8355 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8356 int *pos
, enum noside noside
)
8359 int tem
, tem2
, tem3
;
8361 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8364 struct value
**argvec
;
8368 op
= exp
->elts
[pc
].opcode
;
8374 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8375 arg1
= unwrap_value (arg1
);
8377 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8378 then we need to perform the conversion manually, because
8379 evaluate_subexp_standard doesn't do it. This conversion is
8380 necessary in Ada because the different kinds of float/fixed
8381 types in Ada have different representations.
8383 Similarly, we need to perform the conversion from OP_LONG
8385 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8386 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8392 struct value
*result
;
8394 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8395 /* The result type will have code OP_STRING, bashed there from
8396 OP_ARRAY. Bash it back. */
8397 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8398 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8404 type
= exp
->elts
[pc
+ 1].type
;
8405 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8406 if (noside
== EVAL_SKIP
)
8408 arg1
= ada_value_cast (type
, arg1
, noside
);
8413 type
= exp
->elts
[pc
+ 1].type
;
8414 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8417 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8418 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8420 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8421 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8423 return ada_value_assign (arg1
, arg1
);
8425 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8426 except if the lhs of our assignment is a convenience variable.
8427 In the case of assigning to a convenience variable, the lhs
8428 should be exactly the result of the evaluation of the rhs. */
8429 type
= value_type (arg1
);
8430 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8432 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8433 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8435 if (ada_is_fixed_point_type (value_type (arg1
)))
8436 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8437 else if (ada_is_fixed_point_type (value_type (arg2
)))
8439 (_("Fixed-point values must be assigned to fixed-point variables"));
8441 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8442 return ada_value_assign (arg1
, arg2
);
8445 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8446 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8447 if (noside
== EVAL_SKIP
)
8449 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8450 return (value_from_longest
8452 value_as_long (arg1
) + value_as_long (arg2
)));
8453 if ((ada_is_fixed_point_type (value_type (arg1
))
8454 || ada_is_fixed_point_type (value_type (arg2
)))
8455 && value_type (arg1
) != value_type (arg2
))
8456 error (_("Operands of fixed-point addition must have the same type"));
8457 /* Do the addition, and cast the result to the type of the first
8458 argument. We cannot cast the result to a reference type, so if
8459 ARG1 is a reference type, find its underlying type. */
8460 type
= value_type (arg1
);
8461 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8462 type
= TYPE_TARGET_TYPE (type
);
8463 return value_cast (type
, value_add (arg1
, arg2
));
8466 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8467 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8468 if (noside
== EVAL_SKIP
)
8470 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8471 return (value_from_longest
8473 value_as_long (arg1
) - value_as_long (arg2
)));
8474 if ((ada_is_fixed_point_type (value_type (arg1
))
8475 || ada_is_fixed_point_type (value_type (arg2
)))
8476 && value_type (arg1
) != value_type (arg2
))
8477 error (_("Operands of fixed-point subtraction must have the same type"));
8478 /* Do the substraction, and cast the result to the type of the first
8479 argument. We cannot cast the result to a reference type, so if
8480 ARG1 is a reference type, find its underlying type. */
8481 type
= value_type (arg1
);
8482 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8483 type
= TYPE_TARGET_TYPE (type
);
8484 return value_cast (type
, value_sub (arg1
, arg2
));
8488 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8489 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8490 if (noside
== EVAL_SKIP
)
8492 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8493 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8494 return value_zero (value_type (arg1
), not_lval
);
8497 if (ada_is_fixed_point_type (value_type (arg1
)))
8498 arg1
= cast_from_fixed_to_double (arg1
);
8499 if (ada_is_fixed_point_type (value_type (arg2
)))
8500 arg2
= cast_from_fixed_to_double (arg2
);
8501 return ada_value_binop (arg1
, arg2
, op
);
8506 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8507 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8508 if (noside
== EVAL_SKIP
)
8510 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8511 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8512 return value_zero (value_type (arg1
), not_lval
);
8514 return ada_value_binop (arg1
, arg2
, op
);
8517 case BINOP_NOTEQUAL
:
8518 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8519 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8520 if (noside
== EVAL_SKIP
)
8522 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8525 tem
= ada_value_equal (arg1
, arg2
);
8526 if (op
== BINOP_NOTEQUAL
)
8528 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8529 return value_from_longest (type
, (LONGEST
) tem
);
8532 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8533 if (noside
== EVAL_SKIP
)
8535 else if (ada_is_fixed_point_type (value_type (arg1
)))
8536 return value_cast (value_type (arg1
), value_neg (arg1
));
8538 return value_neg (arg1
);
8540 case BINOP_LOGICAL_AND
:
8541 case BINOP_LOGICAL_OR
:
8542 case UNOP_LOGICAL_NOT
:
8547 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8548 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8549 return value_cast (type
, val
);
8552 case BINOP_BITWISE_AND
:
8553 case BINOP_BITWISE_IOR
:
8554 case BINOP_BITWISE_XOR
:
8558 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8560 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8562 return value_cast (value_type (arg1
), val
);
8568 if (noside
== EVAL_SKIP
)
8573 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8574 /* Only encountered when an unresolved symbol occurs in a
8575 context other than a function call, in which case, it is
8577 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8578 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8579 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8581 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8582 if (ada_is_tagged_type (type
, 0))
8584 /* Tagged types are a little special in the fact that the real
8585 type is dynamic and can only be determined by inspecting the
8586 object's tag. This means that we need to get the object's
8587 value first (EVAL_NORMAL) and then extract the actual object
8590 Note that we cannot skip the final step where we extract
8591 the object type from its tag, because the EVAL_NORMAL phase
8592 results in dynamic components being resolved into fixed ones.
8593 This can cause problems when trying to print the type
8594 description of tagged types whose parent has a dynamic size:
8595 We use the type name of the "_parent" component in order
8596 to print the name of the ancestor type in the type description.
8597 If that component had a dynamic size, the resolution into
8598 a fixed type would result in the loss of that type name,
8599 thus preventing us from printing the name of the ancestor
8600 type in the type description. */
8601 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8602 return value_zero (type_from_tag (ada_value_tag (arg1
)), not_lval
);
8607 (to_static_fixed_type
8608 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8614 unwrap_value (evaluate_subexp_standard
8615 (expect_type
, exp
, pos
, noside
));
8616 return ada_to_fixed_value (arg1
);
8622 /* Allocate arg vector, including space for the function to be
8623 called in argvec[0] and a terminating NULL. */
8624 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8626 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8628 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8629 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8630 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8631 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8634 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8635 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8638 if (noside
== EVAL_SKIP
)
8642 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8643 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8644 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8645 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8646 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8647 argvec
[0] = value_addr (argvec
[0]);
8649 type
= ada_check_typedef (value_type (argvec
[0]));
8650 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8652 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8654 case TYPE_CODE_FUNC
:
8655 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8657 case TYPE_CODE_ARRAY
:
8659 case TYPE_CODE_STRUCT
:
8660 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8661 argvec
[0] = ada_value_ind (argvec
[0]);
8662 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8665 error (_("cannot subscript or call something of type `%s'"),
8666 ada_type_name (value_type (argvec
[0])));
8671 switch (TYPE_CODE (type
))
8673 case TYPE_CODE_FUNC
:
8674 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8675 return allocate_value (TYPE_TARGET_TYPE (type
));
8676 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8677 case TYPE_CODE_STRUCT
:
8681 arity
= ada_array_arity (type
);
8682 type
= ada_array_element_type (type
, nargs
);
8684 error (_("cannot subscript or call a record"));
8686 error (_("wrong number of subscripts; expecting %d"), arity
);
8687 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8688 return value_zero (ada_aligned_type (type
), lval_memory
);
8690 unwrap_value (ada_value_subscript
8691 (argvec
[0], nargs
, argvec
+ 1));
8693 case TYPE_CODE_ARRAY
:
8694 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8696 type
= ada_array_element_type (type
, nargs
);
8698 error (_("element type of array unknown"));
8700 return value_zero (ada_aligned_type (type
), lval_memory
);
8703 unwrap_value (ada_value_subscript
8704 (ada_coerce_to_simple_array (argvec
[0]),
8705 nargs
, argvec
+ 1));
8706 case TYPE_CODE_PTR
: /* Pointer to array */
8707 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8708 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8710 type
= ada_array_element_type (type
, nargs
);
8712 error (_("element type of array unknown"));
8714 return value_zero (ada_aligned_type (type
), lval_memory
);
8717 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8718 nargs
, argvec
+ 1));
8721 error (_("Attempt to index or call something other than an "
8722 "array or function"));
8727 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8728 struct value
*low_bound_val
=
8729 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8730 struct value
*high_bound_val
=
8731 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8734 low_bound_val
= coerce_ref (low_bound_val
);
8735 high_bound_val
= coerce_ref (high_bound_val
);
8736 low_bound
= pos_atr (low_bound_val
);
8737 high_bound
= pos_atr (high_bound_val
);
8739 if (noside
== EVAL_SKIP
)
8742 /* If this is a reference to an aligner type, then remove all
8744 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8745 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8746 TYPE_TARGET_TYPE (value_type (array
)) =
8747 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8749 if (ada_is_packed_array_type (value_type (array
)))
8750 error (_("cannot slice a packed array"));
8752 /* If this is a reference to an array or an array lvalue,
8753 convert to a pointer. */
8754 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8755 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8756 && VALUE_LVAL (array
) == lval_memory
))
8757 array
= value_addr (array
);
8759 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8760 && ada_is_array_descriptor_type (ada_check_typedef
8761 (value_type (array
))))
8762 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8764 array
= ada_coerce_to_simple_array_ptr (array
);
8766 /* If we have more than one level of pointer indirection,
8767 dereference the value until we get only one level. */
8768 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8769 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8771 array
= value_ind (array
);
8773 /* Make sure we really do have an array type before going further,
8774 to avoid a SEGV when trying to get the index type or the target
8775 type later down the road if the debug info generated by
8776 the compiler is incorrect or incomplete. */
8777 if (!ada_is_simple_array_type (value_type (array
)))
8778 error (_("cannot take slice of non-array"));
8780 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8782 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8783 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8787 struct type
*arr_type0
=
8788 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8790 return ada_value_slice_ptr (array
, arr_type0
,
8791 longest_to_int (low_bound
),
8792 longest_to_int (high_bound
));
8795 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8797 else if (high_bound
< low_bound
)
8798 return empty_array (value_type (array
), low_bound
);
8800 return ada_value_slice (array
, longest_to_int (low_bound
),
8801 longest_to_int (high_bound
));
8806 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8807 type
= exp
->elts
[pc
+ 1].type
;
8809 if (noside
== EVAL_SKIP
)
8812 switch (TYPE_CODE (type
))
8815 lim_warning (_("Membership test incompletely implemented; "
8816 "always returns true"));
8817 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8818 return value_from_longest (type
, (LONGEST
) 1);
8820 case TYPE_CODE_RANGE
:
8821 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
8822 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
8823 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8825 value_from_longest (type
,
8826 (value_less (arg1
, arg3
)
8827 || value_equal (arg1
, arg3
))
8828 && (value_less (arg2
, arg1
)
8829 || value_equal (arg2
, arg1
)));
8832 case BINOP_IN_BOUNDS
:
8834 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8835 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8837 if (noside
== EVAL_SKIP
)
8840 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8842 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8843 return value_zero (type
, not_lval
);
8846 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8848 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8849 error (_("invalid dimension number to 'range"));
8851 arg3
= ada_array_bound (arg2
, tem
, 1);
8852 arg2
= ada_array_bound (arg2
, tem
, 0);
8854 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8856 value_from_longest (type
,
8857 (value_less (arg1
, arg3
)
8858 || value_equal (arg1
, arg3
))
8859 && (value_less (arg2
, arg1
)
8860 || value_equal (arg2
, arg1
)));
8862 case TERNOP_IN_RANGE
:
8863 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8864 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8865 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8867 if (noside
== EVAL_SKIP
)
8870 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8872 value_from_longest (type
,
8873 (value_less (arg1
, arg3
)
8874 || value_equal (arg1
, arg3
))
8875 && (value_less (arg2
, arg1
)
8876 || value_equal (arg2
, arg1
)));
8882 struct type
*type_arg
;
8883 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8885 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8887 type_arg
= exp
->elts
[pc
+ 2].type
;
8891 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8895 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8896 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8897 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8900 if (noside
== EVAL_SKIP
)
8903 if (type_arg
== NULL
)
8905 arg1
= ada_coerce_ref (arg1
);
8907 if (ada_is_packed_array_type (value_type (arg1
)))
8908 arg1
= ada_coerce_to_simple_array (arg1
);
8910 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8911 error (_("invalid dimension number to '%s"),
8912 ada_attribute_name (op
));
8914 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8916 type
= ada_index_type (value_type (arg1
), tem
);
8919 (_("attempt to take bound of something that is not an array"));
8920 return allocate_value (type
);
8925 default: /* Should never happen. */
8926 error (_("unexpected attribute encountered"));
8928 return ada_array_bound (arg1
, tem
, 0);
8930 return ada_array_bound (arg1
, tem
, 1);
8932 return ada_array_length (arg1
, tem
);
8935 else if (discrete_type_p (type_arg
))
8937 struct type
*range_type
;
8938 char *name
= ada_type_name (type_arg
);
8940 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8942 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8943 if (range_type
== NULL
)
8944 range_type
= type_arg
;
8948 error (_("unexpected attribute encountered"));
8950 return value_from_longest
8951 (range_type
, discrete_type_low_bound (range_type
));
8953 return value_from_longest
8954 (range_type
, discrete_type_high_bound (range_type
));
8956 error (_("the 'length attribute applies only to array types"));
8959 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8960 error (_("unimplemented type attribute"));
8965 if (ada_is_packed_array_type (type_arg
))
8966 type_arg
= decode_packed_array_type (type_arg
);
8968 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8969 error (_("invalid dimension number to '%s"),
8970 ada_attribute_name (op
));
8972 type
= ada_index_type (type_arg
, tem
);
8975 (_("attempt to take bound of something that is not an array"));
8976 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8977 return allocate_value (type
);
8982 error (_("unexpected attribute encountered"));
8984 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8985 return value_from_longest (type
, low
);
8987 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8988 return value_from_longest (type
, high
);
8990 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8991 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8992 return value_from_longest (type
, high
- low
+ 1);
8998 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8999 if (noside
== EVAL_SKIP
)
9002 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9003 return value_zero (ada_tag_type (arg1
), not_lval
);
9005 return ada_value_tag (arg1
);
9009 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9010 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9011 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9012 if (noside
== EVAL_SKIP
)
9014 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9015 return value_zero (value_type (arg1
), not_lval
);
9017 return value_binop (arg1
, arg2
,
9018 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9020 case OP_ATR_MODULUS
:
9022 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
9023 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9025 if (noside
== EVAL_SKIP
)
9028 if (!ada_is_modular_type (type_arg
))
9029 error (_("'modulus must be applied to modular type"));
9031 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9032 ada_modulus (type_arg
));
9037 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9038 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9039 if (noside
== EVAL_SKIP
)
9041 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9042 return value_zero (builtin_type_int
, not_lval
);
9044 return value_pos_atr (arg1
);
9047 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9048 if (noside
== EVAL_SKIP
)
9050 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9051 return value_zero (builtin_type_int32
, not_lval
);
9053 return value_from_longest (builtin_type_int32
,
9055 * TYPE_LENGTH (value_type (arg1
)));
9058 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9059 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9060 type
= exp
->elts
[pc
+ 2].type
;
9061 if (noside
== EVAL_SKIP
)
9063 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9064 return value_zero (type
, not_lval
);
9066 return value_val_atr (type
, arg1
);
9069 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9070 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9071 if (noside
== EVAL_SKIP
)
9073 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9074 return value_zero (value_type (arg1
), not_lval
);
9076 return value_binop (arg1
, arg2
, op
);
9079 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9080 if (noside
== EVAL_SKIP
)
9086 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9087 if (noside
== EVAL_SKIP
)
9089 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9090 return value_neg (arg1
);
9095 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
9096 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
9097 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
9098 if (noside
== EVAL_SKIP
)
9100 type
= ada_check_typedef (value_type (arg1
));
9101 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9103 if (ada_is_array_descriptor_type (type
))
9104 /* GDB allows dereferencing GNAT array descriptors. */
9106 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9107 if (arrType
== NULL
)
9108 error (_("Attempt to dereference null array pointer."));
9109 return value_at_lazy (arrType
, 0);
9111 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9112 || TYPE_CODE (type
) == TYPE_CODE_REF
9113 /* In C you can dereference an array to get the 1st elt. */
9114 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9116 type
= to_static_fixed_type
9118 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9120 return value_zero (type
, lval_memory
);
9122 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9123 /* GDB allows dereferencing an int. */
9124 return value_zero (builtin_type_int
, lval_memory
);
9126 error (_("Attempt to take contents of a non-pointer value."));
9128 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9129 type
= ada_check_typedef (value_type (arg1
));
9131 if (ada_is_array_descriptor_type (type
))
9132 /* GDB allows dereferencing GNAT array descriptors. */
9133 return ada_coerce_to_simple_array (arg1
);
9135 return ada_value_ind (arg1
);
9137 case STRUCTOP_STRUCT
:
9138 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9139 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9140 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9141 if (noside
== EVAL_SKIP
)
9143 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9145 struct type
*type1
= value_type (arg1
);
9146 if (ada_is_tagged_type (type1
, 1))
9148 type
= ada_lookup_struct_elt_type (type1
,
9149 &exp
->elts
[pc
+ 2].string
,
9152 /* In this case, we assume that the field COULD exist
9153 in some extension of the type. Return an object of
9154 "type" void, which will match any formal
9155 (see ada_type_match). */
9156 return value_zero (builtin_type_void
, lval_memory
);
9160 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9163 return value_zero (ada_aligned_type (type
), lval_memory
);
9167 ada_to_fixed_value (unwrap_value
9168 (ada_value_struct_elt
9169 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9171 /* The value is not supposed to be used. This is here to make it
9172 easier to accommodate expressions that contain types. */
9174 if (noside
== EVAL_SKIP
)
9176 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9177 return allocate_value (exp
->elts
[pc
+ 1].type
);
9179 error (_("Attempt to use a type name as an expression"));
9184 case OP_DISCRETE_RANGE
:
9187 if (noside
== EVAL_NORMAL
)
9191 error (_("Undefined name, ambiguous name, or renaming used in "
9192 "component association: %s."), &exp
->elts
[pc
+2].string
);
9194 error (_("Aggregates only allowed on the right of an assignment"));
9196 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9199 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9201 for (tem
= 0; tem
< nargs
; tem
+= 1)
9202 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9207 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
9213 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9214 type name that encodes the 'small and 'delta information.
9215 Otherwise, return NULL. */
9218 fixed_type_info (struct type
*type
)
9220 const char *name
= ada_type_name (type
);
9221 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9223 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9225 const char *tail
= strstr (name
, "___XF_");
9231 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9232 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9237 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9240 ada_is_fixed_point_type (struct type
*type
)
9242 return fixed_type_info (type
) != NULL
;
9245 /* Return non-zero iff TYPE represents a System.Address type. */
9248 ada_is_system_address_type (struct type
*type
)
9250 return (TYPE_NAME (type
)
9251 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9254 /* Assuming that TYPE is the representation of an Ada fixed-point
9255 type, return its delta, or -1 if the type is malformed and the
9256 delta cannot be determined. */
9259 ada_delta (struct type
*type
)
9261 const char *encoding
= fixed_type_info (type
);
9264 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9267 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9270 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9271 factor ('SMALL value) associated with the type. */
9274 scaling_factor (struct type
*type
)
9276 const char *encoding
= fixed_type_info (type
);
9277 unsigned long num0
, den0
, num1
, den1
;
9280 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9285 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9287 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9291 /* Assuming that X is the representation of a value of fixed-point
9292 type TYPE, return its floating-point equivalent. */
9295 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9297 return (DOUBLEST
) x
*scaling_factor (type
);
9300 /* The representation of a fixed-point value of type TYPE
9301 corresponding to the value X. */
9304 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9306 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9310 /* VAX floating formats */
9312 /* Non-zero iff TYPE represents one of the special VAX floating-point
9316 ada_is_vax_floating_type (struct type
*type
)
9319 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9322 && (TYPE_CODE (type
) == TYPE_CODE_INT
9323 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9324 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9327 /* The type of special VAX floating-point type this is, assuming
9328 ada_is_vax_floating_point. */
9331 ada_vax_float_type_suffix (struct type
*type
)
9333 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9336 /* A value representing the special debugging function that outputs
9337 VAX floating-point values of the type represented by TYPE. Assumes
9338 ada_is_vax_floating_type (TYPE). */
9341 ada_vax_float_print_function (struct type
*type
)
9343 switch (ada_vax_float_type_suffix (type
))
9346 return get_var_value ("DEBUG_STRING_F", 0);
9348 return get_var_value ("DEBUG_STRING_D", 0);
9350 return get_var_value ("DEBUG_STRING_G", 0);
9352 error (_("invalid VAX floating-point type"));
9359 /* Scan STR beginning at position K for a discriminant name, and
9360 return the value of that discriminant field of DVAL in *PX. If
9361 PNEW_K is not null, put the position of the character beyond the
9362 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9363 not alter *PX and *PNEW_K if unsuccessful. */
9366 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9369 static char *bound_buffer
= NULL
;
9370 static size_t bound_buffer_len
= 0;
9373 struct value
*bound_val
;
9375 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9378 pend
= strstr (str
+ k
, "__");
9382 k
+= strlen (bound
);
9386 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9387 bound
= bound_buffer
;
9388 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9389 bound
[pend
- (str
+ k
)] = '\0';
9393 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9394 if (bound_val
== NULL
)
9397 *px
= value_as_long (bound_val
);
9403 /* Value of variable named NAME in the current environment. If
9404 no such variable found, then if ERR_MSG is null, returns 0, and
9405 otherwise causes an error with message ERR_MSG. */
9407 static struct value
*
9408 get_var_value (char *name
, char *err_msg
)
9410 struct ada_symbol_info
*syms
;
9413 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9418 if (err_msg
== NULL
)
9421 error (("%s"), err_msg
);
9424 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9427 /* Value of integer variable named NAME in the current environment. If
9428 no such variable found, returns 0, and sets *FLAG to 0. If
9429 successful, sets *FLAG to 1. */
9432 get_int_var_value (char *name
, int *flag
)
9434 struct value
*var_val
= get_var_value (name
, 0);
9446 return value_as_long (var_val
);
9451 /* Return a range type whose base type is that of the range type named
9452 NAME in the current environment, and whose bounds are calculated
9453 from NAME according to the GNAT range encoding conventions.
9454 Extract discriminant values, if needed, from DVAL. If a new type
9455 must be created, allocate in OBJFILE's space. The bounds
9456 information, in general, is encoded in NAME, the base type given in
9457 the named range type. */
9459 static struct type
*
9460 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9462 struct type
*raw_type
= ada_find_any_type (name
);
9463 struct type
*base_type
;
9466 if (raw_type
== NULL
)
9467 base_type
= builtin_type_int
;
9468 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9469 base_type
= TYPE_TARGET_TYPE (raw_type
);
9471 base_type
= raw_type
;
9473 subtype_info
= strstr (name
, "___XD");
9474 if (subtype_info
== NULL
)
9476 LONGEST L
= discrete_type_low_bound (raw_type
);
9477 LONGEST U
= discrete_type_high_bound (raw_type
);
9478 if (L
< INT_MIN
|| U
> INT_MAX
)
9481 return create_range_type (alloc_type (objfile
), raw_type
,
9482 discrete_type_low_bound (raw_type
),
9483 discrete_type_high_bound (raw_type
));
9487 static char *name_buf
= NULL
;
9488 static size_t name_len
= 0;
9489 int prefix_len
= subtype_info
- name
;
9495 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9496 strncpy (name_buf
, name
, prefix_len
);
9497 name_buf
[prefix_len
] = '\0';
9500 bounds_str
= strchr (subtype_info
, '_');
9503 if (*subtype_info
== 'L')
9505 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9506 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9508 if (bounds_str
[n
] == '_')
9510 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9517 strcpy (name_buf
+ prefix_len
, "___L");
9518 L
= get_int_var_value (name_buf
, &ok
);
9521 lim_warning (_("Unknown lower bound, using 1."));
9526 if (*subtype_info
== 'U')
9528 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9529 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9535 strcpy (name_buf
+ prefix_len
, "___U");
9536 U
= get_int_var_value (name_buf
, &ok
);
9539 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9544 if (objfile
== NULL
)
9545 objfile
= TYPE_OBJFILE (base_type
);
9546 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9547 TYPE_NAME (type
) = name
;
9552 /* True iff NAME is the name of a range type. */
9555 ada_is_range_type_name (const char *name
)
9557 return (name
!= NULL
&& strstr (name
, "___XD"));
9563 /* True iff TYPE is an Ada modular type. */
9566 ada_is_modular_type (struct type
*type
)
9568 struct type
*subranged_type
= base_type (type
);
9570 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9571 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9572 && TYPE_UNSIGNED (subranged_type
));
9575 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9578 ada_modulus (struct type
* type
)
9580 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9584 /* Ada exception catchpoint support:
9585 ---------------------------------
9587 We support 3 kinds of exception catchpoints:
9588 . catchpoints on Ada exceptions
9589 . catchpoints on unhandled Ada exceptions
9590 . catchpoints on failed assertions
9592 Exceptions raised during failed assertions, or unhandled exceptions
9593 could perfectly be caught with the general catchpoint on Ada exceptions.
9594 However, we can easily differentiate these two special cases, and having
9595 the option to distinguish these two cases from the rest can be useful
9596 to zero-in on certain situations.
9598 Exception catchpoints are a specialized form of breakpoint,
9599 since they rely on inserting breakpoints inside known routines
9600 of the GNAT runtime. The implementation therefore uses a standard
9601 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9604 Support in the runtime for exception catchpoints have been changed
9605 a few times already, and these changes affect the implementation
9606 of these catchpoints. In order to be able to support several
9607 variants of the runtime, we use a sniffer that will determine
9608 the runtime variant used by the program being debugged.
9610 At this time, we do not support the use of conditions on Ada exception
9611 catchpoints. The COND and COND_STRING fields are therefore set
9612 to NULL (most of the time, see below).
9614 Conditions where EXP_STRING, COND, and COND_STRING are used:
9616 When a user specifies the name of a specific exception in the case
9617 of catchpoints on Ada exceptions, we store the name of that exception
9618 in the EXP_STRING. We then translate this request into an actual
9619 condition stored in COND_STRING, and then parse it into an expression
9622 /* The different types of catchpoints that we introduced for catching
9625 enum exception_catchpoint_kind
9628 ex_catch_exception_unhandled
,
9632 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9634 /* A structure that describes how to support exception catchpoints
9635 for a given executable. */
9637 struct exception_support_info
9639 /* The name of the symbol to break on in order to insert
9640 a catchpoint on exceptions. */
9641 const char *catch_exception_sym
;
9643 /* The name of the symbol to break on in order to insert
9644 a catchpoint on unhandled exceptions. */
9645 const char *catch_exception_unhandled_sym
;
9647 /* The name of the symbol to break on in order to insert
9648 a catchpoint on failed assertions. */
9649 const char *catch_assert_sym
;
9651 /* Assuming that the inferior just triggered an unhandled exception
9652 catchpoint, this function is responsible for returning the address
9653 in inferior memory where the name of that exception is stored.
9654 Return zero if the address could not be computed. */
9655 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9658 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9659 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9661 /* The following exception support info structure describes how to
9662 implement exception catchpoints with the latest version of the
9663 Ada runtime (as of 2007-03-06). */
9665 static const struct exception_support_info default_exception_support_info
=
9667 "__gnat_debug_raise_exception", /* catch_exception_sym */
9668 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9669 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9670 ada_unhandled_exception_name_addr
9673 /* The following exception support info structure describes how to
9674 implement exception catchpoints with a slightly older version
9675 of the Ada runtime. */
9677 static const struct exception_support_info exception_support_info_fallback
=
9679 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9680 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9681 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9682 ada_unhandled_exception_name_addr_from_raise
9685 /* For each executable, we sniff which exception info structure to use
9686 and cache it in the following global variable. */
9688 static const struct exception_support_info
*exception_info
= NULL
;
9690 /* Inspect the Ada runtime and determine which exception info structure
9691 should be used to provide support for exception catchpoints.
9693 This function will always set exception_info, or raise an error. */
9696 ada_exception_support_info_sniffer (void)
9700 /* If the exception info is already known, then no need to recompute it. */
9701 if (exception_info
!= NULL
)
9704 /* Check the latest (default) exception support info. */
9705 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9709 exception_info
= &default_exception_support_info
;
9713 /* Try our fallback exception suport info. */
9714 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9718 exception_info
= &exception_support_info_fallback
;
9722 /* Sometimes, it is normal for us to not be able to find the routine
9723 we are looking for. This happens when the program is linked with
9724 the shared version of the GNAT runtime, and the program has not been
9725 started yet. Inform the user of these two possible causes if
9728 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9729 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9731 /* If the symbol does not exist, then check that the program is
9732 already started, to make sure that shared libraries have been
9733 loaded. If it is not started, this may mean that the symbol is
9734 in a shared library. */
9736 if (ptid_get_pid (inferior_ptid
) == 0)
9737 error (_("Unable to insert catchpoint. Try to start the program first."));
9739 /* At this point, we know that we are debugging an Ada program and
9740 that the inferior has been started, but we still are not able to
9741 find the run-time symbols. That can mean that we are in
9742 configurable run time mode, or that a-except as been optimized
9743 out by the linker... In any case, at this point it is not worth
9744 supporting this feature. */
9746 error (_("Cannot insert catchpoints in this configuration."));
9749 /* An observer of "executable_changed" events.
9750 Its role is to clear certain cached values that need to be recomputed
9751 each time a new executable is loaded by GDB. */
9754 ada_executable_changed_observer (void)
9756 /* If the executable changed, then it is possible that the Ada runtime
9757 is different. So we need to invalidate the exception support info
9759 exception_info
= NULL
;
9762 /* Return the name of the function at PC, NULL if could not find it.
9763 This function only checks the debugging information, not the symbol
9767 function_name_from_pc (CORE_ADDR pc
)
9771 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9777 /* True iff FRAME is very likely to be that of a function that is
9778 part of the runtime system. This is all very heuristic, but is
9779 intended to be used as advice as to what frames are uninteresting
9783 is_known_support_routine (struct frame_info
*frame
)
9785 struct symtab_and_line sal
;
9789 /* If this code does not have any debugging information (no symtab),
9790 This cannot be any user code. */
9792 find_frame_sal (frame
, &sal
);
9793 if (sal
.symtab
== NULL
)
9796 /* If there is a symtab, but the associated source file cannot be
9797 located, then assume this is not user code: Selecting a frame
9798 for which we cannot display the code would not be very helpful
9799 for the user. This should also take care of case such as VxWorks
9800 where the kernel has some debugging info provided for a few units. */
9802 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9805 /* Check the unit filename againt the Ada runtime file naming.
9806 We also check the name of the objfile against the name of some
9807 known system libraries that sometimes come with debugging info
9810 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9812 re_comp (known_runtime_file_name_patterns
[i
]);
9813 if (re_exec (sal
.symtab
->filename
))
9815 if (sal
.symtab
->objfile
!= NULL
9816 && re_exec (sal
.symtab
->objfile
->name
))
9820 /* Check whether the function is a GNAT-generated entity. */
9822 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9823 if (func_name
== NULL
)
9826 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9828 re_comp (known_auxiliary_function_name_patterns
[i
]);
9829 if (re_exec (func_name
))
9836 /* Find the first frame that contains debugging information and that is not
9837 part of the Ada run-time, starting from FI and moving upward. */
9840 ada_find_printable_frame (struct frame_info
*fi
)
9842 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9844 if (!is_known_support_routine (fi
))
9853 /* Assuming that the inferior just triggered an unhandled exception
9854 catchpoint, return the address in inferior memory where the name
9855 of the exception is stored.
9857 Return zero if the address could not be computed. */
9860 ada_unhandled_exception_name_addr (void)
9862 return parse_and_eval_address ("e.full_name");
9865 /* Same as ada_unhandled_exception_name_addr, except that this function
9866 should be used when the inferior uses an older version of the runtime,
9867 where the exception name needs to be extracted from a specific frame
9868 several frames up in the callstack. */
9871 ada_unhandled_exception_name_addr_from_raise (void)
9874 struct frame_info
*fi
;
9876 /* To determine the name of this exception, we need to select
9877 the frame corresponding to RAISE_SYM_NAME. This frame is
9878 at least 3 levels up, so we simply skip the first 3 frames
9879 without checking the name of their associated function. */
9880 fi
= get_current_frame ();
9881 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9883 fi
= get_prev_frame (fi
);
9887 const char *func_name
=
9888 function_name_from_pc (get_frame_address_in_block (fi
));
9889 if (func_name
!= NULL
9890 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9891 break; /* We found the frame we were looking for... */
9892 fi
= get_prev_frame (fi
);
9899 return parse_and_eval_address ("id.full_name");
9902 /* Assuming the inferior just triggered an Ada exception catchpoint
9903 (of any type), return the address in inferior memory where the name
9904 of the exception is stored, if applicable.
9906 Return zero if the address could not be computed, or if not relevant. */
9909 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9910 struct breakpoint
*b
)
9914 case ex_catch_exception
:
9915 return (parse_and_eval_address ("e.full_name"));
9918 case ex_catch_exception_unhandled
:
9919 return exception_info
->unhandled_exception_name_addr ();
9922 case ex_catch_assert
:
9923 return 0; /* Exception name is not relevant in this case. */
9927 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9931 return 0; /* Should never be reached. */
9934 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9935 any error that ada_exception_name_addr_1 might cause to be thrown.
9936 When an error is intercepted, a warning with the error message is printed,
9937 and zero is returned. */
9940 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9941 struct breakpoint
*b
)
9943 struct gdb_exception e
;
9944 CORE_ADDR result
= 0;
9946 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9948 result
= ada_exception_name_addr_1 (ex
, b
);
9953 warning (_("failed to get exception name: %s"), e
.message
);
9960 /* Implement the PRINT_IT method in the breakpoint_ops structure
9961 for all exception catchpoint kinds. */
9963 static enum print_stop_action
9964 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
9966 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
9967 char exception_name
[256];
9971 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
9972 exception_name
[sizeof (exception_name
) - 1] = '\0';
9975 ada_find_printable_frame (get_current_frame ());
9977 annotate_catchpoint (b
->number
);
9980 case ex_catch_exception
:
9982 printf_filtered (_("\nCatchpoint %d, %s at "),
9983 b
->number
, exception_name
);
9985 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
9987 case ex_catch_exception_unhandled
:
9989 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
9990 b
->number
, exception_name
);
9992 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
9995 case ex_catch_assert
:
9996 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10001 return PRINT_SRC_AND_LOC
;
10004 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10005 for all exception catchpoint kinds. */
10008 print_one_exception (enum exception_catchpoint_kind ex
,
10009 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10013 annotate_field (4);
10014 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10017 annotate_field (5);
10018 *last_addr
= b
->loc
->address
;
10021 case ex_catch_exception
:
10022 if (b
->exp_string
!= NULL
)
10024 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10026 ui_out_field_string (uiout
, "what", msg
);
10030 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10034 case ex_catch_exception_unhandled
:
10035 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10038 case ex_catch_assert
:
10039 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10043 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10048 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10049 for all exception catchpoint kinds. */
10052 print_mention_exception (enum exception_catchpoint_kind ex
,
10053 struct breakpoint
*b
)
10057 case ex_catch_exception
:
10058 if (b
->exp_string
!= NULL
)
10059 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10060 b
->number
, b
->exp_string
);
10062 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10066 case ex_catch_exception_unhandled
:
10067 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10071 case ex_catch_assert
:
10072 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10076 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10081 /* Virtual table for "catch exception" breakpoints. */
10083 static enum print_stop_action
10084 print_it_catch_exception (struct breakpoint
*b
)
10086 return print_it_exception (ex_catch_exception
, b
);
10090 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10092 print_one_exception (ex_catch_exception
, b
, last_addr
);
10096 print_mention_catch_exception (struct breakpoint
*b
)
10098 print_mention_exception (ex_catch_exception
, b
);
10101 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10103 print_it_catch_exception
,
10104 print_one_catch_exception
,
10105 print_mention_catch_exception
10108 /* Virtual table for "catch exception unhandled" breakpoints. */
10110 static enum print_stop_action
10111 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10113 return print_it_exception (ex_catch_exception_unhandled
, b
);
10117 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10119 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10123 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10125 print_mention_exception (ex_catch_exception_unhandled
, b
);
10128 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10129 print_it_catch_exception_unhandled
,
10130 print_one_catch_exception_unhandled
,
10131 print_mention_catch_exception_unhandled
10134 /* Virtual table for "catch assert" breakpoints. */
10136 static enum print_stop_action
10137 print_it_catch_assert (struct breakpoint
*b
)
10139 return print_it_exception (ex_catch_assert
, b
);
10143 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10145 print_one_exception (ex_catch_assert
, b
, last_addr
);
10149 print_mention_catch_assert (struct breakpoint
*b
)
10151 print_mention_exception (ex_catch_assert
, b
);
10154 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10155 print_it_catch_assert
,
10156 print_one_catch_assert
,
10157 print_mention_catch_assert
10160 /* Return non-zero if B is an Ada exception catchpoint. */
10163 ada_exception_catchpoint_p (struct breakpoint
*b
)
10165 return (b
->ops
== &catch_exception_breakpoint_ops
10166 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10167 || b
->ops
== &catch_assert_breakpoint_ops
);
10170 /* Return a newly allocated copy of the first space-separated token
10171 in ARGSP, and then adjust ARGSP to point immediately after that
10174 Return NULL if ARGPS does not contain any more tokens. */
10177 ada_get_next_arg (char **argsp
)
10179 char *args
= *argsp
;
10183 /* Skip any leading white space. */
10185 while (isspace (*args
))
10188 if (args
[0] == '\0')
10189 return NULL
; /* No more arguments. */
10191 /* Find the end of the current argument. */
10194 while (*end
!= '\0' && !isspace (*end
))
10197 /* Adjust ARGSP to point to the start of the next argument. */
10201 /* Make a copy of the current argument and return it. */
10203 result
= xmalloc (end
- args
+ 1);
10204 strncpy (result
, args
, end
- args
);
10205 result
[end
- args
] = '\0';
10210 /* Split the arguments specified in a "catch exception" command.
10211 Set EX to the appropriate catchpoint type.
10212 Set EXP_STRING to the name of the specific exception if
10213 specified by the user. */
10216 catch_ada_exception_command_split (char *args
,
10217 enum exception_catchpoint_kind
*ex
,
10220 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10221 char *exception_name
;
10223 exception_name
= ada_get_next_arg (&args
);
10224 make_cleanup (xfree
, exception_name
);
10226 /* Check that we do not have any more arguments. Anything else
10229 while (isspace (*args
))
10232 if (args
[0] != '\0')
10233 error (_("Junk at end of expression"));
10235 discard_cleanups (old_chain
);
10237 if (exception_name
== NULL
)
10239 /* Catch all exceptions. */
10240 *ex
= ex_catch_exception
;
10241 *exp_string
= NULL
;
10243 else if (strcmp (exception_name
, "unhandled") == 0)
10245 /* Catch unhandled exceptions. */
10246 *ex
= ex_catch_exception_unhandled
;
10247 *exp_string
= NULL
;
10251 /* Catch a specific exception. */
10252 *ex
= ex_catch_exception
;
10253 *exp_string
= exception_name
;
10257 /* Return the name of the symbol on which we should break in order to
10258 implement a catchpoint of the EX kind. */
10260 static const char *
10261 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10263 gdb_assert (exception_info
!= NULL
);
10267 case ex_catch_exception
:
10268 return (exception_info
->catch_exception_sym
);
10270 case ex_catch_exception_unhandled
:
10271 return (exception_info
->catch_exception_unhandled_sym
);
10273 case ex_catch_assert
:
10274 return (exception_info
->catch_assert_sym
);
10277 internal_error (__FILE__
, __LINE__
,
10278 _("unexpected catchpoint kind (%d)"), ex
);
10282 /* Return the breakpoint ops "virtual table" used for catchpoints
10285 static struct breakpoint_ops
*
10286 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10290 case ex_catch_exception
:
10291 return (&catch_exception_breakpoint_ops
);
10293 case ex_catch_exception_unhandled
:
10294 return (&catch_exception_unhandled_breakpoint_ops
);
10296 case ex_catch_assert
:
10297 return (&catch_assert_breakpoint_ops
);
10300 internal_error (__FILE__
, __LINE__
,
10301 _("unexpected catchpoint kind (%d)"), ex
);
10305 /* Return the condition that will be used to match the current exception
10306 being raised with the exception that the user wants to catch. This
10307 assumes that this condition is used when the inferior just triggered
10308 an exception catchpoint.
10310 The string returned is a newly allocated string that needs to be
10311 deallocated later. */
10314 ada_exception_catchpoint_cond_string (const char *exp_string
)
10316 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10319 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10321 static struct expression
*
10322 ada_parse_catchpoint_condition (char *cond_string
,
10323 struct symtab_and_line sal
)
10325 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10328 /* Return the symtab_and_line that should be used to insert an exception
10329 catchpoint of the TYPE kind.
10331 EX_STRING should contain the name of a specific exception
10332 that the catchpoint should catch, or NULL otherwise.
10334 The idea behind all the remaining parameters is that their names match
10335 the name of certain fields in the breakpoint structure that are used to
10336 handle exception catchpoints. This function returns the value to which
10337 these fields should be set, depending on the type of catchpoint we need
10340 If COND and COND_STRING are both non-NULL, any value they might
10341 hold will be free'ed, and then replaced by newly allocated ones.
10342 These parameters are left untouched otherwise. */
10344 static struct symtab_and_line
10345 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10346 char **addr_string
, char **cond_string
,
10347 struct expression
**cond
, struct breakpoint_ops
**ops
)
10349 const char *sym_name
;
10350 struct symbol
*sym
;
10351 struct symtab_and_line sal
;
10353 /* First, find out which exception support info to use. */
10354 ada_exception_support_info_sniffer ();
10356 /* Then lookup the function on which we will break in order to catch
10357 the Ada exceptions requested by the user. */
10359 sym_name
= ada_exception_sym_name (ex
);
10360 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10362 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10363 that should be compiled with debugging information. As a result, we
10364 expect to find that symbol in the symtabs. If we don't find it, then
10365 the target most likely does not support Ada exceptions, or we cannot
10366 insert exception breakpoints yet, because the GNAT runtime hasn't been
10369 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10370 in such a way that no debugging information is produced for the symbol
10371 we are looking for. In this case, we could search the minimal symbols
10372 as a fall-back mechanism. This would still be operating in degraded
10373 mode, however, as we would still be missing the debugging information
10374 that is needed in order to extract the name of the exception being
10375 raised (this name is printed in the catchpoint message, and is also
10376 used when trying to catch a specific exception). We do not handle
10377 this case for now. */
10380 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10382 /* Make sure that the symbol we found corresponds to a function. */
10383 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10384 error (_("Symbol \"%s\" is not a function (class = %d)"),
10385 sym_name
, SYMBOL_CLASS (sym
));
10387 sal
= find_function_start_sal (sym
, 1);
10389 /* Set ADDR_STRING. */
10391 *addr_string
= xstrdup (sym_name
);
10393 /* Set the COND and COND_STRING (if not NULL). */
10395 if (cond_string
!= NULL
&& cond
!= NULL
)
10397 if (*cond_string
!= NULL
)
10399 xfree (*cond_string
);
10400 *cond_string
= NULL
;
10407 if (exp_string
!= NULL
)
10409 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10410 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10415 *ops
= ada_exception_breakpoint_ops (ex
);
10420 /* Parse the arguments (ARGS) of the "catch exception" command.
10422 Set TYPE to the appropriate exception catchpoint type.
10423 If the user asked the catchpoint to catch only a specific
10424 exception, then save the exception name in ADDR_STRING.
10426 See ada_exception_sal for a description of all the remaining
10427 function arguments of this function. */
10429 struct symtab_and_line
10430 ada_decode_exception_location (char *args
, char **addr_string
,
10431 char **exp_string
, char **cond_string
,
10432 struct expression
**cond
,
10433 struct breakpoint_ops
**ops
)
10435 enum exception_catchpoint_kind ex
;
10437 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10438 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10442 struct symtab_and_line
10443 ada_decode_assert_location (char *args
, char **addr_string
,
10444 struct breakpoint_ops
**ops
)
10446 /* Check that no argument where provided at the end of the command. */
10450 while (isspace (*args
))
10453 error (_("Junk at end of arguments."));
10456 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10461 /* Information about operators given special treatment in functions
10463 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10465 #define ADA_OPERATORS \
10466 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10467 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10468 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10469 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10470 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10471 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10472 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10473 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10474 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10475 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10476 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10477 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10478 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10479 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10480 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10481 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10482 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10483 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10484 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10487 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10489 switch (exp
->elts
[pc
- 1].opcode
)
10492 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10495 #define OP_DEFN(op, len, args, binop) \
10496 case op: *oplenp = len; *argsp = args; break;
10502 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10507 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10513 ada_op_name (enum exp_opcode opcode
)
10518 return op_name_standard (opcode
);
10520 #define OP_DEFN(op, len, args, binop) case op: return #op;
10525 return "OP_AGGREGATE";
10527 return "OP_CHOICES";
10533 /* As for operator_length, but assumes PC is pointing at the first
10534 element of the operator, and gives meaningful results only for the
10535 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10538 ada_forward_operator_length (struct expression
*exp
, int pc
,
10539 int *oplenp
, int *argsp
)
10541 switch (exp
->elts
[pc
].opcode
)
10544 *oplenp
= *argsp
= 0;
10547 #define OP_DEFN(op, len, args, binop) \
10548 case op: *oplenp = len; *argsp = args; break;
10554 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10559 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10565 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10566 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10574 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10576 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10581 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10585 /* Ada attributes ('Foo). */
10588 case OP_ATR_LENGTH
:
10592 case OP_ATR_MODULUS
:
10599 case UNOP_IN_RANGE
:
10601 /* XXX: gdb_sprint_host_address, type_sprint */
10602 fprintf_filtered (stream
, _("Type @"));
10603 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10604 fprintf_filtered (stream
, " (");
10605 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10606 fprintf_filtered (stream
, ")");
10608 case BINOP_IN_BOUNDS
:
10609 fprintf_filtered (stream
, " (%d)",
10610 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10612 case TERNOP_IN_RANGE
:
10617 case OP_DISCRETE_RANGE
:
10618 case OP_POSITIONAL
:
10625 char *name
= &exp
->elts
[elt
+ 2].string
;
10626 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10627 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10632 return dump_subexp_body_standard (exp
, stream
, elt
);
10636 for (i
= 0; i
< nargs
; i
+= 1)
10637 elt
= dump_subexp (exp
, stream
, elt
);
10642 /* The Ada extension of print_subexp (q.v.). */
10645 ada_print_subexp (struct expression
*exp
, int *pos
,
10646 struct ui_file
*stream
, enum precedence prec
)
10648 int oplen
, nargs
, i
;
10650 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10652 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10659 print_subexp_standard (exp
, pos
, stream
, prec
);
10663 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10666 case BINOP_IN_BOUNDS
:
10667 /* XXX: sprint_subexp */
10668 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10669 fputs_filtered (" in ", stream
);
10670 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10671 fputs_filtered ("'range", stream
);
10672 if (exp
->elts
[pc
+ 1].longconst
> 1)
10673 fprintf_filtered (stream
, "(%ld)",
10674 (long) exp
->elts
[pc
+ 1].longconst
);
10677 case TERNOP_IN_RANGE
:
10678 if (prec
>= PREC_EQUAL
)
10679 fputs_filtered ("(", stream
);
10680 /* XXX: sprint_subexp */
10681 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10682 fputs_filtered (" in ", stream
);
10683 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10684 fputs_filtered (" .. ", stream
);
10685 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10686 if (prec
>= PREC_EQUAL
)
10687 fputs_filtered (")", stream
);
10692 case OP_ATR_LENGTH
:
10696 case OP_ATR_MODULUS
:
10701 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10703 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10704 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10708 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10709 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10713 for (tem
= 1; tem
< nargs
; tem
+= 1)
10715 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10716 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10718 fputs_filtered (")", stream
);
10723 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10724 fputs_filtered ("'(", stream
);
10725 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10726 fputs_filtered (")", stream
);
10729 case UNOP_IN_RANGE
:
10730 /* XXX: sprint_subexp */
10731 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10732 fputs_filtered (" in ", stream
);
10733 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10736 case OP_DISCRETE_RANGE
:
10737 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10738 fputs_filtered ("..", stream
);
10739 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10743 fputs_filtered ("others => ", stream
);
10744 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10748 for (i
= 0; i
< nargs
-1; i
+= 1)
10751 fputs_filtered ("|", stream
);
10752 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10754 fputs_filtered (" => ", stream
);
10755 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10758 case OP_POSITIONAL
:
10759 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10763 fputs_filtered ("(", stream
);
10764 for (i
= 0; i
< nargs
; i
+= 1)
10767 fputs_filtered (", ", stream
);
10768 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10770 fputs_filtered (")", stream
);
10775 /* Table mapping opcodes into strings for printing operators
10776 and precedences of the operators. */
10778 static const struct op_print ada_op_print_tab
[] = {
10779 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10780 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10781 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10782 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10783 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10784 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10785 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10786 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10787 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10788 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10789 {">", BINOP_GTR
, PREC_ORDER
, 0},
10790 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10791 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10792 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10793 {"+", BINOP_ADD
, PREC_ADD
, 0},
10794 {"-", BINOP_SUB
, PREC_ADD
, 0},
10795 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10796 {"*", BINOP_MUL
, PREC_MUL
, 0},
10797 {"/", BINOP_DIV
, PREC_MUL
, 0},
10798 {"rem", BINOP_REM
, PREC_MUL
, 0},
10799 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10800 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10801 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10802 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10803 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10804 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10805 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10806 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10807 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10808 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10809 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10813 enum ada_primitive_types
{
10814 ada_primitive_type_int
,
10815 ada_primitive_type_long
,
10816 ada_primitive_type_short
,
10817 ada_primitive_type_char
,
10818 ada_primitive_type_float
,
10819 ada_primitive_type_double
,
10820 ada_primitive_type_void
,
10821 ada_primitive_type_long_long
,
10822 ada_primitive_type_long_double
,
10823 ada_primitive_type_natural
,
10824 ada_primitive_type_positive
,
10825 ada_primitive_type_system_address
,
10826 nr_ada_primitive_types
10830 ada_language_arch_info (struct gdbarch
*gdbarch
,
10831 struct language_arch_info
*lai
)
10833 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10834 lai
->primitive_type_vector
10835 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10837 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10838 init_type (TYPE_CODE_INT
,
10839 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10840 0, "integer", (struct objfile
*) NULL
);
10841 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10842 init_type (TYPE_CODE_INT
,
10843 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10844 0, "long_integer", (struct objfile
*) NULL
);
10845 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10846 init_type (TYPE_CODE_INT
,
10847 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10848 0, "short_integer", (struct objfile
*) NULL
);
10849 lai
->string_char_type
=
10850 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10851 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10852 0, "character", (struct objfile
*) NULL
);
10853 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10854 init_type (TYPE_CODE_FLT
,
10855 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10856 0, "float", (struct objfile
*) NULL
);
10857 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10858 init_type (TYPE_CODE_FLT
,
10859 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10860 0, "long_float", (struct objfile
*) NULL
);
10861 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10862 init_type (TYPE_CODE_INT
,
10863 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10864 0, "long_long_integer", (struct objfile
*) NULL
);
10865 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10866 init_type (TYPE_CODE_FLT
,
10867 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10868 0, "long_long_float", (struct objfile
*) NULL
);
10869 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10870 init_type (TYPE_CODE_INT
,
10871 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10872 0, "natural", (struct objfile
*) NULL
);
10873 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10874 init_type (TYPE_CODE_INT
,
10875 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10876 0, "positive", (struct objfile
*) NULL
);
10877 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10879 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10880 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10881 (struct objfile
*) NULL
));
10882 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10883 = "system__address";
10885 lai
->bool_type_symbol
= "boolean";
10886 lai
->bool_type_default
= builtin
->builtin_bool
;
10889 /* Language vector */
10891 /* Not really used, but needed in the ada_language_defn. */
10894 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10896 ada_emit_char (c
, stream
, quoter
, 1);
10902 warnings_issued
= 0;
10903 return ada_parse ();
10906 static const struct exp_descriptor ada_exp_descriptor
= {
10908 ada_operator_length
,
10910 ada_dump_subexp_body
,
10911 ada_evaluate_subexp
10914 const struct language_defn ada_language_defn
= {
10915 "ada", /* Language name */
10919 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10920 that's not quite what this means. */
10922 &ada_exp_descriptor
,
10926 ada_printchar
, /* Print a character constant */
10927 ada_printstr
, /* Function to print string constant */
10928 emit_char
, /* Function to print single char (not used) */
10929 ada_print_type
, /* Print a type using appropriate syntax */
10930 ada_val_print
, /* Print a value using appropriate syntax */
10931 ada_value_print
, /* Print a top-level value */
10932 NULL
, /* Language specific skip_trampoline */
10933 NULL
, /* name_of_this */
10934 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10935 basic_lookup_transparent_type
, /* lookup_transparent_type */
10936 ada_la_decode
, /* Language specific symbol demangler */
10937 NULL
, /* Language specific class_name_from_physname */
10938 ada_op_print_tab
, /* expression operators for printing */
10939 0, /* c-style arrays */
10940 1, /* String lower bound */
10941 ada_get_gdb_completer_word_break_characters
,
10942 ada_make_symbol_completion_list
,
10943 ada_language_arch_info
,
10944 ada_print_array_index
,
10945 default_pass_by_reference
,
10950 _initialize_ada_language (void)
10952 add_language (&ada_language_defn
);
10954 varsize_limit
= 65536;
10956 obstack_init (&symbol_list_obstack
);
10958 decoded_names_store
= htab_create_alloc
10959 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
10960 NULL
, xcalloc
, xfree
);
10962 observer_attach_executable_changed (ada_executable_changed_observer
);