1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007, 2008,
4 2009 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
61 /* Define whether or not the C operator '/' truncates towards zero for
62 differently signed operands (truncation direction is undefined in C).
63 Copied from valarith.c. */
65 #ifndef TRUNCATION_TOWARDS_ZERO
66 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
69 static void modify_general_field (struct type
*, char *, LONGEST
, int, int);
71 static struct type
*desc_base_type (struct type
*);
73 static struct type
*desc_bounds_type (struct type
*);
75 static struct value
*desc_bounds (struct value
*);
77 static int fat_pntr_bounds_bitpos (struct type
*);
79 static int fat_pntr_bounds_bitsize (struct type
*);
81 static struct type
*desc_data_target_type (struct type
*);
83 static struct value
*desc_data (struct value
*);
85 static int fat_pntr_data_bitpos (struct type
*);
87 static int fat_pntr_data_bitsize (struct type
*);
89 static struct value
*desc_one_bound (struct value
*, int, int);
91 static int desc_bound_bitpos (struct type
*, int, int);
93 static int desc_bound_bitsize (struct type
*, int, int);
95 static struct type
*desc_index_type (struct type
*, int);
97 static int desc_arity (struct type
*);
99 static int ada_type_match (struct type
*, struct type
*, int);
101 static int ada_args_match (struct symbol
*, struct value
**, int);
103 static struct value
*ensure_lval (struct value
*,
104 struct gdbarch
*, CORE_ADDR
*);
106 static struct value
*make_array_descriptor (struct type
*, struct value
*,
107 struct gdbarch
*, CORE_ADDR
*);
109 static void ada_add_block_symbols (struct obstack
*,
110 struct block
*, const char *,
111 domain_enum
, struct objfile
*, int);
113 static int is_nonfunction (struct ada_symbol_info
*, int);
115 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
118 static int num_defns_collected (struct obstack
*);
120 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
122 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
123 *, const char *, int,
126 static struct value
*resolve_subexp (struct expression
**, int *, int,
129 static void replace_operator_with_call (struct expression
**, int, int, int,
130 struct symbol
*, struct block
*);
132 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
134 static char *ada_op_name (enum exp_opcode
);
136 static const char *ada_decoded_op_name (enum exp_opcode
);
138 static int numeric_type_p (struct type
*);
140 static int integer_type_p (struct type
*);
142 static int scalar_type_p (struct type
*);
144 static int discrete_type_p (struct type
*);
146 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
151 static struct symbol
*find_old_style_renaming_symbol (const char *,
154 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
157 static struct value
*evaluate_subexp_type (struct expression
*, int *);
159 static struct type
*ada_find_parallel_type_with_name (struct type
*,
162 static int is_dynamic_field (struct type
*, int);
164 static struct type
*to_fixed_variant_branch_type (struct type
*,
166 CORE_ADDR
, struct value
*);
168 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
170 static struct type
*to_fixed_range_type (char *, struct value
*,
173 static struct type
*to_static_fixed_type (struct type
*);
174 static struct type
*static_unwrap_type (struct type
*type
);
176 static struct value
*unwrap_value (struct value
*);
178 static struct type
*constrained_packed_array_type (struct type
*, long *);
180 static struct type
*decode_constrained_packed_array_type (struct type
*);
182 static long decode_packed_array_bitsize (struct type
*);
184 static struct value
*decode_constrained_packed_array (struct value
*);
186 static int ada_is_packed_array_type (struct type
*);
188 static int ada_is_unconstrained_packed_array_type (struct type
*);
190 static struct value
*value_subscript_packed (struct value
*, int,
193 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
195 static struct value
*coerce_unspec_val_to_type (struct value
*,
198 static struct value
*get_var_value (char *, char *);
200 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
202 static int equiv_types (struct type
*, struct type
*);
204 static int is_name_suffix (const char *);
206 static int wild_match (const char *, int, const char *);
208 static struct value
*ada_coerce_ref (struct value
*);
210 static LONGEST
pos_atr (struct value
*);
212 static struct value
*value_pos_atr (struct type
*, struct value
*);
214 static struct value
*value_val_atr (struct type
*, struct value
*);
216 static struct symbol
*standard_lookup (const char *, const struct block
*,
219 static struct value
*ada_search_struct_field (char *, struct value
*, int,
222 static struct value
*ada_value_primitive_field (struct value
*, int, int,
225 static int find_struct_field (char *, struct type
*, int,
226 struct type
**, int *, int *, int *, int *);
228 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
231 static struct value
*ada_to_fixed_value (struct value
*);
233 static int ada_resolve_function (struct ada_symbol_info
*, int,
234 struct value
**, int, const char *,
237 static struct value
*ada_coerce_to_simple_array (struct value
*);
239 static int ada_is_direct_array_type (struct type
*);
241 static void ada_language_arch_info (struct gdbarch
*,
242 struct language_arch_info
*);
244 static void check_size (const struct type
*);
246 static struct value
*ada_index_struct_field (int, struct value
*, int,
249 static struct value
*assign_aggregate (struct value
*, struct value
*,
250 struct expression
*, int *, enum noside
);
252 static void aggregate_assign_from_choices (struct value
*, struct value
*,
254 int *, LONGEST
*, int *,
255 int, LONGEST
, LONGEST
);
257 static void aggregate_assign_positional (struct value
*, struct value
*,
259 int *, LONGEST
*, int *, int,
263 static void aggregate_assign_others (struct value
*, struct value
*,
265 int *, LONGEST
*, int, LONGEST
, LONGEST
);
268 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
271 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
274 static void ada_forward_operator_length (struct expression
*, int, int *,
279 /* Maximum-sized dynamic type. */
280 static unsigned int varsize_limit
;
282 /* FIXME: brobecker/2003-09-17: No longer a const because it is
283 returned by a function that does not return a const char *. */
284 static char *ada_completer_word_break_characters
=
286 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
288 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
291 /* The name of the symbol to use to get the name of the main subprogram. */
292 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
293 = "__gnat_ada_main_program_name";
295 /* Limit on the number of warnings to raise per expression evaluation. */
296 static int warning_limit
= 2;
298 /* Number of warning messages issued; reset to 0 by cleanups after
299 expression evaluation. */
300 static int warnings_issued
= 0;
302 static const char *known_runtime_file_name_patterns
[] = {
303 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
306 static const char *known_auxiliary_function_name_patterns
[] = {
307 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
310 /* Space for allocating results of ada_lookup_symbol_list. */
311 static struct obstack symbol_list_obstack
;
315 /* Given DECODED_NAME a string holding a symbol name in its
316 decoded form (ie using the Ada dotted notation), returns
317 its unqualified name. */
320 ada_unqualified_name (const char *decoded_name
)
322 const char *result
= strrchr (decoded_name
, '.');
325 result
++; /* Skip the dot... */
327 result
= decoded_name
;
332 /* Return a string starting with '<', followed by STR, and '>'.
333 The result is good until the next call. */
336 add_angle_brackets (const char *str
)
338 static char *result
= NULL
;
341 result
= xstrprintf ("<%s>", str
);
346 ada_get_gdb_completer_word_break_characters (void)
348 return ada_completer_word_break_characters
;
351 /* Print an array element index using the Ada syntax. */
354 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
355 const struct value_print_options
*options
)
357 LA_VALUE_PRINT (index_value
, stream
, options
);
358 fprintf_filtered (stream
, " => ");
361 /* Assuming VECT points to an array of *SIZE objects of size
362 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
363 updating *SIZE as necessary and returning the (new) array. */
366 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
368 if (*size
< min_size
)
371 if (*size
< min_size
)
373 vect
= xrealloc (vect
, *size
* element_size
);
378 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
379 suffix of FIELD_NAME beginning "___". */
382 field_name_match (const char *field_name
, const char *target
)
384 int len
= strlen (target
);
386 (strncmp (field_name
, target
, len
) == 0
387 && (field_name
[len
] == '\0'
388 || (strncmp (field_name
+ len
, "___", 3) == 0
389 && strcmp (field_name
+ strlen (field_name
) - 6,
394 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
395 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
396 and return its index. This function also handles fields whose name
397 have ___ suffixes because the compiler sometimes alters their name
398 by adding such a suffix to represent fields with certain constraints.
399 If the field could not be found, return a negative number if
400 MAYBE_MISSING is set. Otherwise raise an error. */
403 ada_get_field_index (const struct type
*type
, const char *field_name
,
407 struct type
*struct_type
= check_typedef ((struct type
*) type
);
409 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
410 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
414 error (_("Unable to find field %s in struct %s. Aborting"),
415 field_name
, TYPE_NAME (struct_type
));
420 /* The length of the prefix of NAME prior to any "___" suffix. */
423 ada_name_prefix_len (const char *name
)
429 const char *p
= strstr (name
, "___");
431 return strlen (name
);
437 /* Return non-zero if SUFFIX is a suffix of STR.
438 Return zero if STR is null. */
441 is_suffix (const char *str
, const char *suffix
)
447 len2
= strlen (suffix
);
448 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
451 /* The contents of value VAL, treated as a value of type TYPE. The
452 result is an lval in memory if VAL is. */
454 static struct value
*
455 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
457 type
= ada_check_typedef (type
);
458 if (value_type (val
) == type
)
462 struct value
*result
;
464 /* Make sure that the object size is not unreasonable before
465 trying to allocate some memory for it. */
468 result
= allocate_value (type
);
469 set_value_component_location (result
, val
);
470 set_value_bitsize (result
, value_bitsize (val
));
471 set_value_bitpos (result
, value_bitpos (val
));
472 set_value_address (result
, value_address (val
));
474 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
475 set_value_lazy (result
, 1);
477 memcpy (value_contents_raw (result
), value_contents (val
),
483 static const gdb_byte
*
484 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
489 return valaddr
+ offset
;
493 cond_offset_target (CORE_ADDR address
, long offset
)
498 return address
+ offset
;
501 /* Issue a warning (as for the definition of warning in utils.c, but
502 with exactly one argument rather than ...), unless the limit on the
503 number of warnings has passed during the evaluation of the current
506 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
507 provided by "complaint". */
508 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
511 lim_warning (const char *format
, ...)
514 va_start (args
, format
);
516 warnings_issued
+= 1;
517 if (warnings_issued
<= warning_limit
)
518 vwarning (format
, args
);
523 /* Issue an error if the size of an object of type T is unreasonable,
524 i.e. if it would be a bad idea to allocate a value of this type in
528 check_size (const struct type
*type
)
530 if (TYPE_LENGTH (type
) > varsize_limit
)
531 error (_("object size is larger than varsize-limit"));
535 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
536 gdbtypes.h, but some of the necessary definitions in that file
537 seem to have gone missing. */
539 /* Maximum value of a SIZE-byte signed integer type. */
541 max_of_size (int size
)
543 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
544 return top_bit
| (top_bit
- 1);
547 /* Minimum value of a SIZE-byte signed integer type. */
549 min_of_size (int size
)
551 return -max_of_size (size
) - 1;
554 /* Maximum value of a SIZE-byte unsigned integer type. */
556 umax_of_size (int size
)
558 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
559 return top_bit
| (top_bit
- 1);
562 /* Maximum value of integral type T, as a signed quantity. */
564 max_of_type (struct type
*t
)
566 if (TYPE_UNSIGNED (t
))
567 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
569 return max_of_size (TYPE_LENGTH (t
));
572 /* Minimum value of integral type T, as a signed quantity. */
574 min_of_type (struct type
*t
)
576 if (TYPE_UNSIGNED (t
))
579 return min_of_size (TYPE_LENGTH (t
));
582 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
584 ada_discrete_type_high_bound (struct type
*type
)
586 switch (TYPE_CODE (type
))
588 case TYPE_CODE_RANGE
:
589 return TYPE_HIGH_BOUND (type
);
591 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
596 return max_of_type (type
);
598 error (_("Unexpected type in ada_discrete_type_high_bound."));
602 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
604 ada_discrete_type_low_bound (struct type
*type
)
606 switch (TYPE_CODE (type
))
608 case TYPE_CODE_RANGE
:
609 return TYPE_LOW_BOUND (type
);
611 return TYPE_FIELD_BITPOS (type
, 0);
616 return min_of_type (type
);
618 error (_("Unexpected type in ada_discrete_type_low_bound."));
622 /* The identity on non-range types. For range types, the underlying
623 non-range scalar type. */
626 base_type (struct type
*type
)
628 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
630 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
632 type
= TYPE_TARGET_TYPE (type
);
638 /* Language Selection */
640 /* If the main program is in Ada, return language_ada, otherwise return LANG
641 (the main program is in Ada iif the adainit symbol is found).
643 MAIN_PST is not used. */
646 ada_update_initial_language (enum language lang
,
647 struct partial_symtab
*main_pst
)
649 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
650 (struct objfile
*) NULL
) != NULL
)
656 /* If the main procedure is written in Ada, then return its name.
657 The result is good until the next call. Return NULL if the main
658 procedure doesn't appear to be in Ada. */
663 struct minimal_symbol
*msym
;
664 static char *main_program_name
= NULL
;
666 /* For Ada, the name of the main procedure is stored in a specific
667 string constant, generated by the binder. Look for that symbol,
668 extract its address, and then read that string. If we didn't find
669 that string, then most probably the main procedure is not written
671 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
675 CORE_ADDR main_program_name_addr
;
678 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
679 if (main_program_name_addr
== 0)
680 error (_("Invalid address for Ada main program name."));
682 xfree (main_program_name
);
683 target_read_string (main_program_name_addr
, &main_program_name
,
688 return main_program_name
;
691 /* The main procedure doesn't seem to be in Ada. */
697 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
700 const struct ada_opname_map ada_opname_table
[] = {
701 {"Oadd", "\"+\"", BINOP_ADD
},
702 {"Osubtract", "\"-\"", BINOP_SUB
},
703 {"Omultiply", "\"*\"", BINOP_MUL
},
704 {"Odivide", "\"/\"", BINOP_DIV
},
705 {"Omod", "\"mod\"", BINOP_MOD
},
706 {"Orem", "\"rem\"", BINOP_REM
},
707 {"Oexpon", "\"**\"", BINOP_EXP
},
708 {"Olt", "\"<\"", BINOP_LESS
},
709 {"Ole", "\"<=\"", BINOP_LEQ
},
710 {"Ogt", "\">\"", BINOP_GTR
},
711 {"Oge", "\">=\"", BINOP_GEQ
},
712 {"Oeq", "\"=\"", BINOP_EQUAL
},
713 {"One", "\"/=\"", BINOP_NOTEQUAL
},
714 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
715 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
716 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
717 {"Oconcat", "\"&\"", BINOP_CONCAT
},
718 {"Oabs", "\"abs\"", UNOP_ABS
},
719 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
720 {"Oadd", "\"+\"", UNOP_PLUS
},
721 {"Osubtract", "\"-\"", UNOP_NEG
},
725 /* The "encoded" form of DECODED, according to GNAT conventions.
726 The result is valid until the next call to ada_encode. */
729 ada_encode (const char *decoded
)
731 static char *encoding_buffer
= NULL
;
732 static size_t encoding_buffer_size
= 0;
739 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
740 2 * strlen (decoded
) + 10);
743 for (p
= decoded
; *p
!= '\0'; p
+= 1)
747 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
752 const struct ada_opname_map
*mapping
;
754 for (mapping
= ada_opname_table
;
755 mapping
->encoded
!= NULL
756 && strncmp (mapping
->decoded
, p
,
757 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
759 if (mapping
->encoded
== NULL
)
760 error (_("invalid Ada operator name: %s"), p
);
761 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
762 k
+= strlen (mapping
->encoded
);
767 encoding_buffer
[k
] = *p
;
772 encoding_buffer
[k
] = '\0';
773 return encoding_buffer
;
776 /* Return NAME folded to lower case, or, if surrounded by single
777 quotes, unfolded, but with the quotes stripped away. Result good
781 ada_fold_name (const char *name
)
783 static char *fold_buffer
= NULL
;
784 static size_t fold_buffer_size
= 0;
786 int len
= strlen (name
);
787 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
791 strncpy (fold_buffer
, name
+ 1, len
- 2);
792 fold_buffer
[len
- 2] = '\000';
797 for (i
= 0; i
<= len
; i
+= 1)
798 fold_buffer
[i
] = tolower (name
[i
]);
804 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
807 is_lower_alphanum (const char c
)
809 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
812 /* Remove either of these suffixes:
817 These are suffixes introduced by the compiler for entities such as
818 nested subprogram for instance, in order to avoid name clashes.
819 They do not serve any purpose for the debugger. */
822 ada_remove_trailing_digits (const char *encoded
, int *len
)
824 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
827 while (i
> 0 && isdigit (encoded
[i
]))
829 if (i
>= 0 && encoded
[i
] == '.')
831 else if (i
>= 0 && encoded
[i
] == '$')
833 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
835 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
840 /* Remove the suffix introduced by the compiler for protected object
844 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
846 /* Remove trailing N. */
848 /* Protected entry subprograms are broken into two
849 separate subprograms: The first one is unprotected, and has
850 a 'N' suffix; the second is the protected version, and has
851 the 'P' suffix. The second calls the first one after handling
852 the protection. Since the P subprograms are internally generated,
853 we leave these names undecoded, giving the user a clue that this
854 entity is internal. */
857 && encoded
[*len
- 1] == 'N'
858 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
862 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
865 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
869 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
872 if (encoded
[i
] != 'X')
878 if (isalnum (encoded
[i
-1]))
882 /* If ENCODED follows the GNAT entity encoding conventions, then return
883 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
886 The resulting string is valid until the next call of ada_decode.
887 If the string is unchanged by decoding, the original string pointer
891 ada_decode (const char *encoded
)
898 static char *decoding_buffer
= NULL
;
899 static size_t decoding_buffer_size
= 0;
901 /* The name of the Ada main procedure starts with "_ada_".
902 This prefix is not part of the decoded name, so skip this part
903 if we see this prefix. */
904 if (strncmp (encoded
, "_ada_", 5) == 0)
907 /* If the name starts with '_', then it is not a properly encoded
908 name, so do not attempt to decode it. Similarly, if the name
909 starts with '<', the name should not be decoded. */
910 if (encoded
[0] == '_' || encoded
[0] == '<')
913 len0
= strlen (encoded
);
915 ada_remove_trailing_digits (encoded
, &len0
);
916 ada_remove_po_subprogram_suffix (encoded
, &len0
);
918 /* Remove the ___X.* suffix if present. Do not forget to verify that
919 the suffix is located before the current "end" of ENCODED. We want
920 to avoid re-matching parts of ENCODED that have previously been
921 marked as discarded (by decrementing LEN0). */
922 p
= strstr (encoded
, "___");
923 if (p
!= NULL
&& p
- encoded
< len0
- 3)
931 /* Remove any trailing TKB suffix. It tells us that this symbol
932 is for the body of a task, but that information does not actually
933 appear in the decoded name. */
935 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
938 /* Remove any trailing TB suffix. The TB suffix is slightly different
939 from the TKB suffix because it is used for non-anonymous task
942 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
945 /* Remove trailing "B" suffixes. */
946 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
948 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
951 /* Make decoded big enough for possible expansion by operator name. */
953 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
954 decoded
= decoding_buffer
;
956 /* Remove trailing __{digit}+ or trailing ${digit}+. */
958 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
961 while ((i
>= 0 && isdigit (encoded
[i
]))
962 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
964 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
966 else if (encoded
[i
] == '$')
970 /* The first few characters that are not alphabetic are not part
971 of any encoding we use, so we can copy them over verbatim. */
973 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
974 decoded
[j
] = encoded
[i
];
979 /* Is this a symbol function? */
980 if (at_start_name
&& encoded
[i
] == 'O')
983 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
985 int op_len
= strlen (ada_opname_table
[k
].encoded
);
986 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
988 && !isalnum (encoded
[i
+ op_len
]))
990 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
993 j
+= strlen (ada_opname_table
[k
].decoded
);
997 if (ada_opname_table
[k
].encoded
!= NULL
)
1002 /* Replace "TK__" with "__", which will eventually be translated
1003 into "." (just below). */
1005 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1008 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1009 be translated into "." (just below). These are internal names
1010 generated for anonymous blocks inside which our symbol is nested. */
1012 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1013 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1014 && isdigit (encoded
[i
+4]))
1018 while (k
< len0
&& isdigit (encoded
[k
]))
1019 k
++; /* Skip any extra digit. */
1021 /* Double-check that the "__B_{DIGITS}+" sequence we found
1022 is indeed followed by "__". */
1023 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1027 /* Remove _E{DIGITS}+[sb] */
1029 /* Just as for protected object subprograms, there are 2 categories
1030 of subprograms created by the compiler for each entry. The first
1031 one implements the actual entry code, and has a suffix following
1032 the convention above; the second one implements the barrier and
1033 uses the same convention as above, except that the 'E' is replaced
1036 Just as above, we do not decode the name of barrier functions
1037 to give the user a clue that the code he is debugging has been
1038 internally generated. */
1040 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1041 && isdigit (encoded
[i
+2]))
1045 while (k
< len0
&& isdigit (encoded
[k
]))
1049 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1052 /* Just as an extra precaution, make sure that if this
1053 suffix is followed by anything else, it is a '_'.
1054 Otherwise, we matched this sequence by accident. */
1056 || (k
< len0
&& encoded
[k
] == '_'))
1061 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1062 the GNAT front-end in protected object subprograms. */
1065 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1067 /* Backtrack a bit up until we reach either the begining of
1068 the encoded name, or "__". Make sure that we only find
1069 digits or lowercase characters. */
1070 const char *ptr
= encoded
+ i
- 1;
1072 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1075 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1079 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1081 /* This is a X[bn]* sequence not separated from the previous
1082 part of the name with a non-alpha-numeric character (in other
1083 words, immediately following an alpha-numeric character), then
1084 verify that it is placed at the end of the encoded name. If
1085 not, then the encoding is not valid and we should abort the
1086 decoding. Otherwise, just skip it, it is used in body-nested
1090 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1094 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1096 /* Replace '__' by '.'. */
1104 /* It's a character part of the decoded name, so just copy it
1106 decoded
[j
] = encoded
[i
];
1111 decoded
[j
] = '\000';
1113 /* Decoded names should never contain any uppercase character.
1114 Double-check this, and abort the decoding if we find one. */
1116 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1117 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1120 if (strcmp (decoded
, encoded
) == 0)
1126 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1127 decoded
= decoding_buffer
;
1128 if (encoded
[0] == '<')
1129 strcpy (decoded
, encoded
);
1131 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1136 /* Table for keeping permanent unique copies of decoded names. Once
1137 allocated, names in this table are never released. While this is a
1138 storage leak, it should not be significant unless there are massive
1139 changes in the set of decoded names in successive versions of a
1140 symbol table loaded during a single session. */
1141 static struct htab
*decoded_names_store
;
1143 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1144 in the language-specific part of GSYMBOL, if it has not been
1145 previously computed. Tries to save the decoded name in the same
1146 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1147 in any case, the decoded symbol has a lifetime at least that of
1149 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1150 const, but nevertheless modified to a semantically equivalent form
1151 when a decoded name is cached in it.
1155 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1158 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1159 if (*resultp
== NULL
)
1161 const char *decoded
= ada_decode (gsymbol
->name
);
1162 if (gsymbol
->obj_section
!= NULL
)
1164 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1165 *resultp
= obsavestring (decoded
, strlen (decoded
),
1166 &objf
->objfile_obstack
);
1168 /* Sometimes, we can't find a corresponding objfile, in which
1169 case, we put the result on the heap. Since we only decode
1170 when needed, we hope this usually does not cause a
1171 significant memory leak (FIXME). */
1172 if (*resultp
== NULL
)
1174 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1177 *slot
= xstrdup (decoded
);
1186 ada_la_decode (const char *encoded
, int options
)
1188 return xstrdup (ada_decode (encoded
));
1191 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1192 suffixes that encode debugging information or leading _ada_ on
1193 SYM_NAME (see is_name_suffix commentary for the debugging
1194 information that is ignored). If WILD, then NAME need only match a
1195 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1196 either argument is NULL. */
1199 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1201 if (sym_name
== NULL
|| name
== NULL
)
1204 return wild_match (name
, strlen (name
), sym_name
);
1207 int len_name
= strlen (name
);
1208 return (strncmp (sym_name
, name
, len_name
) == 0
1209 && is_name_suffix (sym_name
+ len_name
))
1210 || (strncmp (sym_name
, "_ada_", 5) == 0
1211 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1212 && is_name_suffix (sym_name
+ len_name
+ 5));
1219 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1221 static char *bound_name
[] = {
1222 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1223 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1226 /* Maximum number of array dimensions we are prepared to handle. */
1228 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1230 /* Like modify_field, but allows bitpos > wordlength. */
1233 modify_general_field (struct type
*type
, char *addr
,
1234 LONGEST fieldval
, int bitpos
, int bitsize
)
1236 modify_field (type
, addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1240 /* The desc_* routines return primitive portions of array descriptors
1243 /* The descriptor or array type, if any, indicated by TYPE; removes
1244 level of indirection, if needed. */
1246 static struct type
*
1247 desc_base_type (struct type
*type
)
1251 type
= ada_check_typedef (type
);
1253 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1254 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1255 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1260 /* True iff TYPE indicates a "thin" array pointer type. */
1263 is_thin_pntr (struct type
*type
)
1266 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1267 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1270 /* The descriptor type for thin pointer type TYPE. */
1272 static struct type
*
1273 thin_descriptor_type (struct type
*type
)
1275 struct type
*base_type
= desc_base_type (type
);
1276 if (base_type
== NULL
)
1278 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1282 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1283 if (alt_type
== NULL
)
1290 /* A pointer to the array data for thin-pointer value VAL. */
1292 static struct value
*
1293 thin_data_pntr (struct value
*val
)
1295 struct type
*type
= value_type (val
);
1296 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1297 data_type
= lookup_pointer_type (data_type
);
1299 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1300 return value_cast (data_type
, value_copy (val
));
1302 return value_from_longest (data_type
, value_address (val
));
1305 /* True iff TYPE indicates a "thick" array pointer type. */
1308 is_thick_pntr (struct type
*type
)
1310 type
= desc_base_type (type
);
1311 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1312 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1315 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1316 pointer to one, the type of its bounds data; otherwise, NULL. */
1318 static struct type
*
1319 desc_bounds_type (struct type
*type
)
1323 type
= desc_base_type (type
);
1327 else if (is_thin_pntr (type
))
1329 type
= thin_descriptor_type (type
);
1332 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1334 return ada_check_typedef (r
);
1336 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1338 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1340 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1345 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1346 one, a pointer to its bounds data. Otherwise NULL. */
1348 static struct value
*
1349 desc_bounds (struct value
*arr
)
1351 struct type
*type
= ada_check_typedef (value_type (arr
));
1352 if (is_thin_pntr (type
))
1354 struct type
*bounds_type
=
1355 desc_bounds_type (thin_descriptor_type (type
));
1358 if (bounds_type
== NULL
)
1359 error (_("Bad GNAT array descriptor"));
1361 /* NOTE: The following calculation is not really kosher, but
1362 since desc_type is an XVE-encoded type (and shouldn't be),
1363 the correct calculation is a real pain. FIXME (and fix GCC). */
1364 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1365 addr
= value_as_long (arr
);
1367 addr
= value_address (arr
);
1370 value_from_longest (lookup_pointer_type (bounds_type
),
1371 addr
- TYPE_LENGTH (bounds_type
));
1374 else if (is_thick_pntr (type
))
1375 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1376 _("Bad GNAT array descriptor"));
1381 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1382 position of the field containing the address of the bounds data. */
1385 fat_pntr_bounds_bitpos (struct type
*type
)
1387 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1390 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1391 size of the field containing the address of the bounds data. */
1394 fat_pntr_bounds_bitsize (struct type
*type
)
1396 type
= desc_base_type (type
);
1398 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1399 return TYPE_FIELD_BITSIZE (type
, 1);
1401 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1404 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1405 pointer to one, the type of its array data (a array-with-no-bounds type);
1406 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1409 static struct type
*
1410 desc_data_target_type (struct type
*type
)
1412 type
= desc_base_type (type
);
1414 /* NOTE: The following is bogus; see comment in desc_bounds. */
1415 if (is_thin_pntr (type
))
1416 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1417 else if (is_thick_pntr (type
))
1419 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1422 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1423 return TYPE_TARGET_TYPE (data_type
);
1429 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1432 static struct value
*
1433 desc_data (struct value
*arr
)
1435 struct type
*type
= value_type (arr
);
1436 if (is_thin_pntr (type
))
1437 return thin_data_pntr (arr
);
1438 else if (is_thick_pntr (type
))
1439 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1440 _("Bad GNAT array descriptor"));
1446 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1447 position of the field containing the address of the data. */
1450 fat_pntr_data_bitpos (struct type
*type
)
1452 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1455 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1456 size of the field containing the address of the data. */
1459 fat_pntr_data_bitsize (struct type
*type
)
1461 type
= desc_base_type (type
);
1463 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1464 return TYPE_FIELD_BITSIZE (type
, 0);
1466 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1469 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1470 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1471 bound, if WHICH is 1. The first bound is I=1. */
1473 static struct value
*
1474 desc_one_bound (struct value
*bounds
, int i
, int which
)
1476 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1477 _("Bad GNAT array descriptor bounds"));
1480 /* If BOUNDS is an array-bounds structure type, return the bit position
1481 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1482 bound, if WHICH is 1. The first bound is I=1. */
1485 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1487 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1490 /* If BOUNDS is an array-bounds structure type, return the bit field size
1491 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1492 bound, if WHICH is 1. The first bound is I=1. */
1495 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1497 type
= desc_base_type (type
);
1499 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1500 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1502 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1505 /* If TYPE is the type of an array-bounds structure, the type of its
1506 Ith bound (numbering from 1). Otherwise, NULL. */
1508 static struct type
*
1509 desc_index_type (struct type
*type
, int i
)
1511 type
= desc_base_type (type
);
1513 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1514 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1519 /* The number of index positions in the array-bounds type TYPE.
1520 Return 0 if TYPE is NULL. */
1523 desc_arity (struct type
*type
)
1525 type
= desc_base_type (type
);
1528 return TYPE_NFIELDS (type
) / 2;
1532 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1533 an array descriptor type (representing an unconstrained array
1537 ada_is_direct_array_type (struct type
*type
)
1541 type
= ada_check_typedef (type
);
1542 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1543 || ada_is_array_descriptor_type (type
));
1546 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1550 ada_is_array_type (struct type
*type
)
1553 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1554 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1555 type
= TYPE_TARGET_TYPE (type
);
1556 return ada_is_direct_array_type (type
);
1559 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1562 ada_is_simple_array_type (struct type
*type
)
1566 type
= ada_check_typedef (type
);
1567 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1568 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1569 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1572 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1575 ada_is_array_descriptor_type (struct type
*type
)
1577 struct type
*data_type
= desc_data_target_type (type
);
1581 type
= ada_check_typedef (type
);
1582 return (data_type
!= NULL
1583 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1584 && desc_arity (desc_bounds_type (type
)) > 0);
1587 /* Non-zero iff type is a partially mal-formed GNAT array
1588 descriptor. FIXME: This is to compensate for some problems with
1589 debugging output from GNAT. Re-examine periodically to see if it
1593 ada_is_bogus_array_descriptor (struct type
*type
)
1597 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1598 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1599 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1600 && !ada_is_array_descriptor_type (type
);
1604 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1605 (fat pointer) returns the type of the array data described---specifically,
1606 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1607 in from the descriptor; otherwise, they are left unspecified. If
1608 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1609 returns NULL. The result is simply the type of ARR if ARR is not
1612 ada_type_of_array (struct value
*arr
, int bounds
)
1614 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1615 return decode_constrained_packed_array_type (value_type (arr
));
1617 if (!ada_is_array_descriptor_type (value_type (arr
)))
1618 return value_type (arr
);
1622 struct type
*array_type
=
1623 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1625 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1626 TYPE_FIELD_BITSIZE (array_type
, 0) =
1627 decode_packed_array_bitsize (value_type (arr
));
1633 struct type
*elt_type
;
1635 struct value
*descriptor
;
1637 elt_type
= ada_array_element_type (value_type (arr
), -1);
1638 arity
= ada_array_arity (value_type (arr
));
1640 if (elt_type
== NULL
|| arity
== 0)
1641 return ada_check_typedef (value_type (arr
));
1643 descriptor
= desc_bounds (arr
);
1644 if (value_as_long (descriptor
) == 0)
1648 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1649 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1650 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1651 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1654 create_range_type (range_type
, value_type (low
),
1655 longest_to_int (value_as_long (low
)),
1656 longest_to_int (value_as_long (high
)));
1657 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1659 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1660 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1661 decode_packed_array_bitsize (value_type (arr
));
1664 return lookup_pointer_type (elt_type
);
1668 /* If ARR does not represent an array, returns ARR unchanged.
1669 Otherwise, returns either a standard GDB array with bounds set
1670 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1671 GDB array. Returns NULL if ARR is a null fat pointer. */
1674 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1676 if (ada_is_array_descriptor_type (value_type (arr
)))
1678 struct type
*arrType
= ada_type_of_array (arr
, 1);
1679 if (arrType
== NULL
)
1681 return value_cast (arrType
, value_copy (desc_data (arr
)));
1683 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1684 return decode_constrained_packed_array (arr
);
1689 /* If ARR does not represent an array, returns ARR unchanged.
1690 Otherwise, returns a standard GDB array describing ARR (which may
1691 be ARR itself if it already is in the proper form). */
1693 static struct value
*
1694 ada_coerce_to_simple_array (struct value
*arr
)
1696 if (ada_is_array_descriptor_type (value_type (arr
)))
1698 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1700 error (_("Bounds unavailable for null array pointer."));
1701 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1702 return value_ind (arrVal
);
1704 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1705 return decode_constrained_packed_array (arr
);
1710 /* If TYPE represents a GNAT array type, return it translated to an
1711 ordinary GDB array type (possibly with BITSIZE fields indicating
1712 packing). For other types, is the identity. */
1715 ada_coerce_to_simple_array_type (struct type
*type
)
1717 if (ada_is_constrained_packed_array_type (type
))
1718 return decode_constrained_packed_array_type (type
);
1720 if (ada_is_array_descriptor_type (type
))
1721 return ada_check_typedef (desc_data_target_type (type
));
1726 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1729 ada_is_packed_array_type (struct type
*type
)
1733 type
= desc_base_type (type
);
1734 type
= ada_check_typedef (type
);
1736 ada_type_name (type
) != NULL
1737 && strstr (ada_type_name (type
), "___XP") != NULL
;
1740 /* Non-zero iff TYPE represents a standard GNAT constrained
1741 packed-array type. */
1744 ada_is_constrained_packed_array_type (struct type
*type
)
1746 return ada_is_packed_array_type (type
)
1747 && !ada_is_array_descriptor_type (type
);
1750 /* Non-zero iff TYPE represents an array descriptor for a
1751 unconstrained packed-array type. */
1754 ada_is_unconstrained_packed_array_type (struct type
*type
)
1756 return ada_is_packed_array_type (type
)
1757 && ada_is_array_descriptor_type (type
);
1760 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1761 return the size of its elements in bits. */
1764 decode_packed_array_bitsize (struct type
*type
)
1766 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1771 raw_name
= ada_type_name (desc_base_type (type
));
1776 tail
= strstr (raw_name
, "___XP");
1778 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1781 (_("could not understand bit size information on packed array"));
1788 /* Given that TYPE is a standard GDB array type with all bounds filled
1789 in, and that the element size of its ultimate scalar constituents
1790 (that is, either its elements, or, if it is an array of arrays, its
1791 elements' elements, etc.) is *ELT_BITS, return an identical type,
1792 but with the bit sizes of its elements (and those of any
1793 constituent arrays) recorded in the BITSIZE components of its
1794 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1797 static struct type
*
1798 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
1800 struct type
*new_elt_type
;
1801 struct type
*new_type
;
1802 LONGEST low_bound
, high_bound
;
1804 type
= ada_check_typedef (type
);
1805 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1808 new_type
= alloc_type_copy (type
);
1810 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1812 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
1813 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1814 TYPE_NAME (new_type
) = ada_type_name (type
);
1816 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
1817 &low_bound
, &high_bound
) < 0)
1818 low_bound
= high_bound
= 0;
1819 if (high_bound
< low_bound
)
1820 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1823 *elt_bits
*= (high_bound
- low_bound
+ 1);
1824 TYPE_LENGTH (new_type
) =
1825 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1828 TYPE_FIXED_INSTANCE (new_type
) = 1;
1832 /* The array type encoded by TYPE, where
1833 ada_is_constrained_packed_array_type (TYPE). */
1835 static struct type
*
1836 decode_constrained_packed_array_type (struct type
*type
)
1839 struct block
**blocks
;
1840 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1843 struct type
*shadow_type
;
1848 raw_name
= ada_type_name (desc_base_type (type
));
1853 name
= (char *) alloca (strlen (raw_name
) + 1);
1854 tail
= strstr (raw_name
, "___XP");
1855 type
= desc_base_type (type
);
1857 memcpy (name
, raw_name
, tail
- raw_name
);
1858 name
[tail
- raw_name
] = '\000';
1860 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
1862 if (shadow_type
== NULL
)
1864 lim_warning (_("could not find bounds information on packed array"));
1867 CHECK_TYPEDEF (shadow_type
);
1869 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1871 lim_warning (_("could not understand bounds information on packed array"));
1875 bits
= decode_packed_array_bitsize (type
);
1876 return constrained_packed_array_type (shadow_type
, &bits
);
1879 /* Given that ARR is a struct value *indicating a GNAT constrained packed
1880 array, returns a simple array that denotes that array. Its type is a
1881 standard GDB array type except that the BITSIZEs of the array
1882 target types are set to the number of bits in each element, and the
1883 type length is set appropriately. */
1885 static struct value
*
1886 decode_constrained_packed_array (struct value
*arr
)
1890 arr
= ada_coerce_ref (arr
);
1892 /* If our value is a pointer, then dererence it. Make sure that
1893 this operation does not cause the target type to be fixed, as
1894 this would indirectly cause this array to be decoded. The rest
1895 of the routine assumes that the array hasn't been decoded yet,
1896 so we use the basic "value_ind" routine to perform the dereferencing,
1897 as opposed to using "ada_value_ind". */
1898 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1899 arr
= value_ind (arr
);
1901 type
= decode_constrained_packed_array_type (value_type (arr
));
1904 error (_("can't unpack array"));
1908 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
1909 && ada_is_modular_type (value_type (arr
)))
1911 /* This is a (right-justified) modular type representing a packed
1912 array with no wrapper. In order to interpret the value through
1913 the (left-justified) packed array type we just built, we must
1914 first left-justify it. */
1915 int bit_size
, bit_pos
;
1918 mod
= ada_modulus (value_type (arr
)) - 1;
1925 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1926 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1927 bit_pos
/ HOST_CHAR_BIT
,
1928 bit_pos
% HOST_CHAR_BIT
,
1933 return coerce_unspec_val_to_type (arr
, type
);
1937 /* The value of the element of packed array ARR at the ARITY indices
1938 given in IND. ARR must be a simple array. */
1940 static struct value
*
1941 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1944 int bits
, elt_off
, bit_off
;
1945 long elt_total_bit_offset
;
1946 struct type
*elt_type
;
1950 elt_total_bit_offset
= 0;
1951 elt_type
= ada_check_typedef (value_type (arr
));
1952 for (i
= 0; i
< arity
; i
+= 1)
1954 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1955 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1957 (_("attempt to do packed indexing of something other than a packed array"));
1960 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1961 LONGEST lowerbound
, upperbound
;
1964 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1966 lim_warning (_("don't know bounds of array"));
1967 lowerbound
= upperbound
= 0;
1970 idx
= pos_atr (ind
[i
]);
1971 if (idx
< lowerbound
|| idx
> upperbound
)
1972 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1973 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1974 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1975 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1978 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1979 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1981 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1986 /* Non-zero iff TYPE includes negative integer values. */
1989 has_negatives (struct type
*type
)
1991 switch (TYPE_CODE (type
))
1996 return !TYPE_UNSIGNED (type
);
1997 case TYPE_CODE_RANGE
:
1998 return TYPE_LOW_BOUND (type
) < 0;
2003 /* Create a new value of type TYPE from the contents of OBJ starting
2004 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2005 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2006 assigning through the result will set the field fetched from.
2007 VALADDR is ignored unless OBJ is NULL, in which case,
2008 VALADDR+OFFSET must address the start of storage containing the
2009 packed value. The value returned in this case is never an lval.
2010 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2013 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2014 long offset
, int bit_offset
, int bit_size
,
2018 int src
, /* Index into the source area */
2019 targ
, /* Index into the target area */
2020 srcBitsLeft
, /* Number of source bits left to move */
2021 nsrc
, ntarg
, /* Number of source and target bytes */
2022 unusedLS
, /* Number of bits in next significant
2023 byte of source that are unused */
2024 accumSize
; /* Number of meaningful bits in accum */
2025 unsigned char *bytes
; /* First byte containing data to unpack */
2026 unsigned char *unpacked
;
2027 unsigned long accum
; /* Staging area for bits being transferred */
2029 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2030 /* Transmit bytes from least to most significant; delta is the direction
2031 the indices move. */
2032 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2034 type
= ada_check_typedef (type
);
2038 v
= allocate_value (type
);
2039 bytes
= (unsigned char *) (valaddr
+ offset
);
2041 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2044 value_address (obj
) + offset
);
2045 bytes
= (unsigned char *) alloca (len
);
2046 read_memory (value_address (v
), bytes
, len
);
2050 v
= allocate_value (type
);
2051 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2057 set_value_component_location (v
, obj
);
2058 new_addr
= value_address (obj
) + offset
;
2059 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2060 set_value_bitsize (v
, bit_size
);
2061 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2064 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2066 set_value_address (v
, new_addr
);
2069 set_value_bitsize (v
, bit_size
);
2070 unpacked
= (unsigned char *) value_contents (v
);
2072 srcBitsLeft
= bit_size
;
2074 ntarg
= TYPE_LENGTH (type
);
2078 memset (unpacked
, 0, TYPE_LENGTH (type
));
2081 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2084 if (has_negatives (type
)
2085 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2089 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2092 switch (TYPE_CODE (type
))
2094 case TYPE_CODE_ARRAY
:
2095 case TYPE_CODE_UNION
:
2096 case TYPE_CODE_STRUCT
:
2097 /* Non-scalar values must be aligned at a byte boundary... */
2099 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2100 /* ... And are placed at the beginning (most-significant) bytes
2102 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2107 targ
= TYPE_LENGTH (type
) - 1;
2113 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2116 unusedLS
= bit_offset
;
2119 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2126 /* Mask for removing bits of the next source byte that are not
2127 part of the value. */
2128 unsigned int unusedMSMask
=
2129 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2131 /* Sign-extend bits for this byte. */
2132 unsigned int signMask
= sign
& ~unusedMSMask
;
2134 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2135 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2136 if (accumSize
>= HOST_CHAR_BIT
)
2138 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2139 accumSize
-= HOST_CHAR_BIT
;
2140 accum
>>= HOST_CHAR_BIT
;
2144 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2151 accum
|= sign
<< accumSize
;
2152 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2153 accumSize
-= HOST_CHAR_BIT
;
2154 accum
>>= HOST_CHAR_BIT
;
2162 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2163 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2166 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2167 int src_offset
, int n
, int bits_big_endian_p
)
2169 unsigned int accum
, mask
;
2170 int accum_bits
, chunk_size
;
2172 target
+= targ_offset
/ HOST_CHAR_BIT
;
2173 targ_offset
%= HOST_CHAR_BIT
;
2174 source
+= src_offset
/ HOST_CHAR_BIT
;
2175 src_offset
%= HOST_CHAR_BIT
;
2176 if (bits_big_endian_p
)
2178 accum
= (unsigned char) *source
;
2180 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2185 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2186 accum_bits
+= HOST_CHAR_BIT
;
2188 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2191 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2192 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2195 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2197 accum_bits
-= chunk_size
;
2204 accum
= (unsigned char) *source
>> src_offset
;
2206 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2210 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2211 accum_bits
+= HOST_CHAR_BIT
;
2213 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2216 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2217 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2219 accum_bits
-= chunk_size
;
2220 accum
>>= chunk_size
;
2227 /* Store the contents of FROMVAL into the location of TOVAL.
2228 Return a new value with the location of TOVAL and contents of
2229 FROMVAL. Handles assignment into packed fields that have
2230 floating-point or non-scalar types. */
2232 static struct value
*
2233 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2235 struct type
*type
= value_type (toval
);
2236 int bits
= value_bitsize (toval
);
2238 toval
= ada_coerce_ref (toval
);
2239 fromval
= ada_coerce_ref (fromval
);
2241 if (ada_is_direct_array_type (value_type (toval
)))
2242 toval
= ada_coerce_to_simple_array (toval
);
2243 if (ada_is_direct_array_type (value_type (fromval
)))
2244 fromval
= ada_coerce_to_simple_array (fromval
);
2246 if (!deprecated_value_modifiable (toval
))
2247 error (_("Left operand of assignment is not a modifiable lvalue."));
2249 if (VALUE_LVAL (toval
) == lval_memory
2251 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2252 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2254 int len
= (value_bitpos (toval
)
2255 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2257 char *buffer
= (char *) alloca (len
);
2259 CORE_ADDR to_addr
= value_address (toval
);
2261 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2262 fromval
= value_cast (type
, fromval
);
2264 read_memory (to_addr
, buffer
, len
);
2265 from_size
= value_bitsize (fromval
);
2267 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2268 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2269 move_bits (buffer
, value_bitpos (toval
),
2270 value_contents (fromval
), from_size
- bits
, bits
, 1);
2272 move_bits (buffer
, value_bitpos (toval
),
2273 value_contents (fromval
), 0, bits
, 0);
2274 write_memory (to_addr
, buffer
, len
);
2275 observer_notify_memory_changed (to_addr
, len
, buffer
);
2277 val
= value_copy (toval
);
2278 memcpy (value_contents_raw (val
), value_contents (fromval
),
2279 TYPE_LENGTH (type
));
2280 deprecated_set_value_type (val
, type
);
2285 return value_assign (toval
, fromval
);
2289 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2290 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2291 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2292 * COMPONENT, and not the inferior's memory. The current contents
2293 * of COMPONENT are ignored. */
2295 value_assign_to_component (struct value
*container
, struct value
*component
,
2298 LONGEST offset_in_container
=
2299 (LONGEST
) (value_address (component
) - value_address (container
));
2300 int bit_offset_in_container
=
2301 value_bitpos (component
) - value_bitpos (container
);
2304 val
= value_cast (value_type (component
), val
);
2306 if (value_bitsize (component
) == 0)
2307 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2309 bits
= value_bitsize (component
);
2311 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2312 move_bits (value_contents_writeable (container
) + offset_in_container
,
2313 value_bitpos (container
) + bit_offset_in_container
,
2314 value_contents (val
),
2315 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2318 move_bits (value_contents_writeable (container
) + offset_in_container
,
2319 value_bitpos (container
) + bit_offset_in_container
,
2320 value_contents (val
), 0, bits
, 0);
2323 /* The value of the element of array ARR at the ARITY indices given in IND.
2324 ARR may be either a simple array, GNAT array descriptor, or pointer
2328 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2332 struct type
*elt_type
;
2334 elt
= ada_coerce_to_simple_array (arr
);
2336 elt_type
= ada_check_typedef (value_type (elt
));
2337 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2338 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2339 return value_subscript_packed (elt
, arity
, ind
);
2341 for (k
= 0; k
< arity
; k
+= 1)
2343 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2344 error (_("too many subscripts (%d expected)"), k
);
2345 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2350 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2351 value of the element of *ARR at the ARITY indices given in
2352 IND. Does not read the entire array into memory. */
2354 static struct value
*
2355 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2360 for (k
= 0; k
< arity
; k
+= 1)
2364 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2365 error (_("too many subscripts (%d expected)"), k
);
2366 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2368 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2369 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2370 type
= TYPE_TARGET_TYPE (type
);
2373 return value_ind (arr
);
2376 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2377 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2378 elements starting at index LOW. The lower bound of this array is LOW, as
2380 static struct value
*
2381 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2384 CORE_ADDR base
= value_as_address (array_ptr
)
2385 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type
)))
2386 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2387 struct type
*index_type
=
2388 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2390 struct type
*slice_type
=
2391 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2392 return value_at_lazy (slice_type
, base
);
2396 static struct value
*
2397 ada_value_slice (struct value
*array
, int low
, int high
)
2399 struct type
*type
= value_type (array
);
2400 struct type
*index_type
=
2401 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2402 struct type
*slice_type
=
2403 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2404 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2407 /* If type is a record type in the form of a standard GNAT array
2408 descriptor, returns the number of dimensions for type. If arr is a
2409 simple array, returns the number of "array of"s that prefix its
2410 type designation. Otherwise, returns 0. */
2413 ada_array_arity (struct type
*type
)
2420 type
= desc_base_type (type
);
2423 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2424 return desc_arity (desc_bounds_type (type
));
2426 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2429 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2435 /* If TYPE is a record type in the form of a standard GNAT array
2436 descriptor or a simple array type, returns the element type for
2437 TYPE after indexing by NINDICES indices, or by all indices if
2438 NINDICES is -1. Otherwise, returns NULL. */
2441 ada_array_element_type (struct type
*type
, int nindices
)
2443 type
= desc_base_type (type
);
2445 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2448 struct type
*p_array_type
;
2450 p_array_type
= desc_data_target_type (type
);
2452 k
= ada_array_arity (type
);
2456 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2457 if (nindices
>= 0 && k
> nindices
)
2459 while (k
> 0 && p_array_type
!= NULL
)
2461 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2464 return p_array_type
;
2466 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2468 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2470 type
= TYPE_TARGET_TYPE (type
);
2479 /* The type of nth index in arrays of given type (n numbering from 1).
2480 Does not examine memory. Throws an error if N is invalid or TYPE
2481 is not an array type. NAME is the name of the Ada attribute being
2482 evaluated ('range, 'first, 'last, or 'length); it is used in building
2483 the error message. */
2485 static struct type
*
2486 ada_index_type (struct type
*type
, int n
, const char *name
)
2488 struct type
*result_type
;
2490 type
= desc_base_type (type
);
2492 if (n
< 0 || n
> ada_array_arity (type
))
2493 error (_("invalid dimension number to '%s"), name
);
2495 if (ada_is_simple_array_type (type
))
2499 for (i
= 1; i
< n
; i
+= 1)
2500 type
= TYPE_TARGET_TYPE (type
);
2501 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2502 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2503 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2504 perhaps stabsread.c would make more sense. */
2505 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2510 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2511 if (result_type
== NULL
)
2512 error (_("attempt to take bound of something that is not an array"));
2518 /* Given that arr is an array type, returns the lower bound of the
2519 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2520 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2521 array-descriptor type. It works for other arrays with bounds supplied
2522 by run-time quantities other than discriminants. */
2525 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
)
2527 struct type
*type
, *elt_type
, *index_type_desc
, *index_type
;
2530 gdb_assert (which
== 0 || which
== 1);
2532 if (ada_is_constrained_packed_array_type (arr_type
))
2533 arr_type
= decode_constrained_packed_array_type (arr_type
);
2535 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2536 return (LONGEST
) - which
;
2538 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2539 type
= TYPE_TARGET_TYPE (arr_type
);
2544 for (i
= n
; i
> 1; i
--)
2545 elt_type
= TYPE_TARGET_TYPE (type
);
2547 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2548 if (index_type_desc
!= NULL
)
2549 index_type
= to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2550 NULL
, TYPE_INDEX_TYPE (elt_type
));
2552 index_type
= TYPE_INDEX_TYPE (elt_type
);
2555 (LONGEST
) (which
== 0
2556 ? ada_discrete_type_low_bound (index_type
)
2557 : ada_discrete_type_high_bound (index_type
));
2560 /* Given that arr is an array value, returns the lower bound of the
2561 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2562 WHICH is 1. This routine will also work for arrays with bounds
2563 supplied by run-time quantities other than discriminants. */
2566 ada_array_bound (struct value
*arr
, int n
, int which
)
2568 struct type
*arr_type
= value_type (arr
);
2570 if (ada_is_constrained_packed_array_type (arr_type
))
2571 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2572 else if (ada_is_simple_array_type (arr_type
))
2573 return ada_array_bound_from_type (arr_type
, n
, which
);
2575 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2578 /* Given that arr is an array value, returns the length of the
2579 nth index. This routine will also work for arrays with bounds
2580 supplied by run-time quantities other than discriminants.
2581 Does not work for arrays indexed by enumeration types with representation
2582 clauses at the moment. */
2585 ada_array_length (struct value
*arr
, int n
)
2587 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2589 if (ada_is_constrained_packed_array_type (arr_type
))
2590 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2592 if (ada_is_simple_array_type (arr_type
))
2593 return (ada_array_bound_from_type (arr_type
, n
, 1)
2594 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2596 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2597 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2600 /* An empty array whose type is that of ARR_TYPE (an array type),
2601 with bounds LOW to LOW-1. */
2603 static struct value
*
2604 empty_array (struct type
*arr_type
, int low
)
2606 struct type
*index_type
=
2607 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2609 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2610 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2614 /* Name resolution */
2616 /* The "decoded" name for the user-definable Ada operator corresponding
2620 ada_decoded_op_name (enum exp_opcode op
)
2624 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2626 if (ada_opname_table
[i
].op
== op
)
2627 return ada_opname_table
[i
].decoded
;
2629 error (_("Could not find operator name for opcode"));
2633 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2634 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2635 undefined namespace) and converts operators that are
2636 user-defined into appropriate function calls. If CONTEXT_TYPE is
2637 non-null, it provides a preferred result type [at the moment, only
2638 type void has any effect---causing procedures to be preferred over
2639 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2640 return type is preferred. May change (expand) *EXP. */
2643 resolve (struct expression
**expp
, int void_context_p
)
2645 struct type
*context_type
= NULL
;
2649 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
2651 resolve_subexp (expp
, &pc
, 1, context_type
);
2654 /* Resolve the operator of the subexpression beginning at
2655 position *POS of *EXPP. "Resolving" consists of replacing
2656 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2657 with their resolutions, replacing built-in operators with
2658 function calls to user-defined operators, where appropriate, and,
2659 when DEPROCEDURE_P is non-zero, converting function-valued variables
2660 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2661 are as in ada_resolve, above. */
2663 static struct value
*
2664 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2665 struct type
*context_type
)
2669 struct expression
*exp
; /* Convenience: == *expp. */
2670 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2671 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2672 int nargs
; /* Number of operands. */
2679 /* Pass one: resolve operands, saving their types and updating *pos,
2684 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2685 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2690 resolve_subexp (expp
, pos
, 0, NULL
);
2692 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2697 resolve_subexp (expp
, pos
, 0, NULL
);
2702 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2705 case OP_ATR_MODULUS
:
2715 case TERNOP_IN_RANGE
:
2716 case BINOP_IN_BOUNDS
:
2722 case OP_DISCRETE_RANGE
:
2724 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2733 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2735 resolve_subexp (expp
, pos
, 1, NULL
);
2737 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2754 case BINOP_LOGICAL_AND
:
2755 case BINOP_LOGICAL_OR
:
2756 case BINOP_BITWISE_AND
:
2757 case BINOP_BITWISE_IOR
:
2758 case BINOP_BITWISE_XOR
:
2761 case BINOP_NOTEQUAL
:
2768 case BINOP_SUBSCRIPT
:
2776 case UNOP_LOGICAL_NOT
:
2792 case OP_INTERNALVAR
:
2802 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2805 case STRUCTOP_STRUCT
:
2806 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2819 error (_("Unexpected operator during name resolution"));
2822 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2823 for (i
= 0; i
< nargs
; i
+= 1)
2824 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2828 /* Pass two: perform any resolution on principal operator. */
2835 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2837 struct ada_symbol_info
*candidates
;
2841 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2842 (exp
->elts
[pc
+ 2].symbol
),
2843 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2846 if (n_candidates
> 1)
2848 /* Types tend to get re-introduced locally, so if there
2849 are any local symbols that are not types, first filter
2852 for (j
= 0; j
< n_candidates
; j
+= 1)
2853 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2858 case LOC_REGPARM_ADDR
:
2866 if (j
< n_candidates
)
2869 while (j
< n_candidates
)
2871 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2873 candidates
[j
] = candidates
[n_candidates
- 1];
2882 if (n_candidates
== 0)
2883 error (_("No definition found for %s"),
2884 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2885 else if (n_candidates
== 1)
2887 else if (deprocedure_p
2888 && !is_nonfunction (candidates
, n_candidates
))
2890 i
= ada_resolve_function
2891 (candidates
, n_candidates
, NULL
, 0,
2892 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2895 error (_("Could not find a match for %s"),
2896 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2900 printf_filtered (_("Multiple matches for %s\n"),
2901 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2902 user_select_syms (candidates
, n_candidates
, 1);
2906 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2907 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2908 if (innermost_block
== NULL
2909 || contained_in (candidates
[i
].block
, innermost_block
))
2910 innermost_block
= candidates
[i
].block
;
2914 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2917 replace_operator_with_call (expp
, pc
, 0, 0,
2918 exp
->elts
[pc
+ 2].symbol
,
2919 exp
->elts
[pc
+ 1].block
);
2926 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2927 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2929 struct ada_symbol_info
*candidates
;
2933 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2934 (exp
->elts
[pc
+ 5].symbol
),
2935 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2937 if (n_candidates
== 1)
2941 i
= ada_resolve_function
2942 (candidates
, n_candidates
,
2944 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2947 error (_("Could not find a match for %s"),
2948 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2951 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2952 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2953 if (innermost_block
== NULL
2954 || contained_in (candidates
[i
].block
, innermost_block
))
2955 innermost_block
= candidates
[i
].block
;
2966 case BINOP_BITWISE_AND
:
2967 case BINOP_BITWISE_IOR
:
2968 case BINOP_BITWISE_XOR
:
2970 case BINOP_NOTEQUAL
:
2978 case UNOP_LOGICAL_NOT
:
2980 if (possible_user_operator_p (op
, argvec
))
2982 struct ada_symbol_info
*candidates
;
2986 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2987 (struct block
*) NULL
, VAR_DOMAIN
,
2989 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2990 ada_decoded_op_name (op
), NULL
);
2994 replace_operator_with_call (expp
, pc
, nargs
, 1,
2995 candidates
[i
].sym
, candidates
[i
].block
);
3006 return evaluate_subexp_type (exp
, pos
);
3009 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3010 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3012 /* The term "match" here is rather loose. The match is heuristic and
3016 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3018 ftype
= ada_check_typedef (ftype
);
3019 atype
= ada_check_typedef (atype
);
3021 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3022 ftype
= TYPE_TARGET_TYPE (ftype
);
3023 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3024 atype
= TYPE_TARGET_TYPE (atype
);
3026 switch (TYPE_CODE (ftype
))
3029 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3031 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3032 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3033 TYPE_TARGET_TYPE (atype
), 0);
3036 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3038 case TYPE_CODE_ENUM
:
3039 case TYPE_CODE_RANGE
:
3040 switch (TYPE_CODE (atype
))
3043 case TYPE_CODE_ENUM
:
3044 case TYPE_CODE_RANGE
:
3050 case TYPE_CODE_ARRAY
:
3051 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3052 || ada_is_array_descriptor_type (atype
));
3054 case TYPE_CODE_STRUCT
:
3055 if (ada_is_array_descriptor_type (ftype
))
3056 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3057 || ada_is_array_descriptor_type (atype
));
3059 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3060 && !ada_is_array_descriptor_type (atype
));
3062 case TYPE_CODE_UNION
:
3064 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3068 /* Return non-zero if the formals of FUNC "sufficiently match" the
3069 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3070 may also be an enumeral, in which case it is treated as a 0-
3071 argument function. */
3074 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3077 struct type
*func_type
= SYMBOL_TYPE (func
);
3079 if (SYMBOL_CLASS (func
) == LOC_CONST
3080 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3081 return (n_actuals
== 0);
3082 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3085 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3088 for (i
= 0; i
< n_actuals
; i
+= 1)
3090 if (actuals
[i
] == NULL
)
3094 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3095 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3097 if (!ada_type_match (ftype
, atype
, 1))
3104 /* False iff function type FUNC_TYPE definitely does not produce a value
3105 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3106 FUNC_TYPE is not a valid function type with a non-null return type
3107 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3110 return_match (struct type
*func_type
, struct type
*context_type
)
3112 struct type
*return_type
;
3114 if (func_type
== NULL
)
3117 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3118 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3120 return_type
= base_type (func_type
);
3121 if (return_type
== NULL
)
3124 context_type
= base_type (context_type
);
3126 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3127 return context_type
== NULL
|| return_type
== context_type
;
3128 else if (context_type
== NULL
)
3129 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3131 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3135 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3136 function (if any) that matches the types of the NARGS arguments in
3137 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3138 that returns that type, then eliminate matches that don't. If
3139 CONTEXT_TYPE is void and there is at least one match that does not
3140 return void, eliminate all matches that do.
3142 Asks the user if there is more than one match remaining. Returns -1
3143 if there is no such symbol or none is selected. NAME is used
3144 solely for messages. May re-arrange and modify SYMS in
3145 the process; the index returned is for the modified vector. */
3148 ada_resolve_function (struct ada_symbol_info syms
[],
3149 int nsyms
, struct value
**args
, int nargs
,
3150 const char *name
, struct type
*context_type
)
3154 int m
; /* Number of hits */
3157 /* In the first pass of the loop, we only accept functions matching
3158 context_type. If none are found, we add a second pass of the loop
3159 where every function is accepted. */
3160 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3162 for (k
= 0; k
< nsyms
; k
+= 1)
3164 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3166 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3167 && (fallback
|| return_match (type
, context_type
)))
3179 printf_filtered (_("Multiple matches for %s\n"), name
);
3180 user_select_syms (syms
, m
, 1);
3186 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3187 in a listing of choices during disambiguation (see sort_choices, below).
3188 The idea is that overloadings of a subprogram name from the
3189 same package should sort in their source order. We settle for ordering
3190 such symbols by their trailing number (__N or $N). */
3193 encoded_ordered_before (char *N0
, char *N1
)
3197 else if (N0
== NULL
)
3202 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3204 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3206 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3207 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3211 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3214 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3216 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3217 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3219 return (strcmp (N0
, N1
) < 0);
3223 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3227 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3230 for (i
= 1; i
< nsyms
; i
+= 1)
3232 struct ada_symbol_info sym
= syms
[i
];
3235 for (j
= i
- 1; j
>= 0; j
-= 1)
3237 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3238 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3240 syms
[j
+ 1] = syms
[j
];
3246 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3247 by asking the user (if necessary), returning the number selected,
3248 and setting the first elements of SYMS items. Error if no symbols
3251 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3252 to be re-integrated one of these days. */
3255 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3258 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3260 int first_choice
= (max_results
== 1) ? 1 : 2;
3261 const char *select_mode
= multiple_symbols_select_mode ();
3263 if (max_results
< 1)
3264 error (_("Request to select 0 symbols!"));
3268 if (select_mode
== multiple_symbols_cancel
)
3270 canceled because the command is ambiguous\n\
3271 See set/show multiple-symbol."));
3273 /* If select_mode is "all", then return all possible symbols.
3274 Only do that if more than one symbol can be selected, of course.
3275 Otherwise, display the menu as usual. */
3276 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3279 printf_unfiltered (_("[0] cancel\n"));
3280 if (max_results
> 1)
3281 printf_unfiltered (_("[1] all\n"));
3283 sort_choices (syms
, nsyms
);
3285 for (i
= 0; i
< nsyms
; i
+= 1)
3287 if (syms
[i
].sym
== NULL
)
3290 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3292 struct symtab_and_line sal
=
3293 find_function_start_sal (syms
[i
].sym
, 1);
3294 if (sal
.symtab
== NULL
)
3295 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3297 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3300 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3301 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3302 sal
.symtab
->filename
, sal
.line
);
3308 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3309 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3310 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3311 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3313 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3314 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3316 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3317 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3318 else if (is_enumeral
3319 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3321 printf_unfiltered (("[%d] "), i
+ first_choice
);
3322 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3324 printf_unfiltered (_("'(%s) (enumeral)\n"),
3325 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3327 else if (symtab
!= NULL
)
3328 printf_unfiltered (is_enumeral
3329 ? _("[%d] %s in %s (enumeral)\n")
3330 : _("[%d] %s at %s:?\n"),
3332 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3335 printf_unfiltered (is_enumeral
3336 ? _("[%d] %s (enumeral)\n")
3337 : _("[%d] %s at ?\n"),
3339 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3343 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3346 for (i
= 0; i
< n_chosen
; i
+= 1)
3347 syms
[i
] = syms
[chosen
[i
]];
3352 /* Read and validate a set of numeric choices from the user in the
3353 range 0 .. N_CHOICES-1. Place the results in increasing
3354 order in CHOICES[0 .. N-1], and return N.
3356 The user types choices as a sequence of numbers on one line
3357 separated by blanks, encoding them as follows:
3359 + A choice of 0 means to cancel the selection, throwing an error.
3360 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3361 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3363 The user is not allowed to choose more than MAX_RESULTS values.
3365 ANNOTATION_SUFFIX, if present, is used to annotate the input
3366 prompts (for use with the -f switch). */
3369 get_selections (int *choices
, int n_choices
, int max_results
,
3370 int is_all_choice
, char *annotation_suffix
)
3375 int first_choice
= is_all_choice
? 2 : 1;
3377 prompt
= getenv ("PS2");
3381 args
= command_line_input (prompt
, 0, annotation_suffix
);
3384 error_no_arg (_("one or more choice numbers"));
3388 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3389 order, as given in args. Choices are validated. */
3395 while (isspace (*args
))
3397 if (*args
== '\0' && n_chosen
== 0)
3398 error_no_arg (_("one or more choice numbers"));
3399 else if (*args
== '\0')
3402 choice
= strtol (args
, &args2
, 10);
3403 if (args
== args2
|| choice
< 0
3404 || choice
> n_choices
+ first_choice
- 1)
3405 error (_("Argument must be choice number"));
3409 error (_("cancelled"));
3411 if (choice
< first_choice
)
3413 n_chosen
= n_choices
;
3414 for (j
= 0; j
< n_choices
; j
+= 1)
3418 choice
-= first_choice
;
3420 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3424 if (j
< 0 || choice
!= choices
[j
])
3427 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3428 choices
[k
+ 1] = choices
[k
];
3429 choices
[j
+ 1] = choice
;
3434 if (n_chosen
> max_results
)
3435 error (_("Select no more than %d of the above"), max_results
);
3440 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3441 on the function identified by SYM and BLOCK, and taking NARGS
3442 arguments. Update *EXPP as needed to hold more space. */
3445 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3446 int oplen
, struct symbol
*sym
,
3447 struct block
*block
)
3449 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3450 symbol, -oplen for operator being replaced). */
3451 struct expression
*newexp
= (struct expression
*)
3452 xmalloc (sizeof (struct expression
)
3453 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3454 struct expression
*exp
= *expp
;
3456 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3457 newexp
->language_defn
= exp
->language_defn
;
3458 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3459 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3460 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3462 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3463 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3465 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3466 newexp
->elts
[pc
+ 4].block
= block
;
3467 newexp
->elts
[pc
+ 5].symbol
= sym
;
3473 /* Type-class predicates */
3475 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3479 numeric_type_p (struct type
*type
)
3485 switch (TYPE_CODE (type
))
3490 case TYPE_CODE_RANGE
:
3491 return (type
== TYPE_TARGET_TYPE (type
)
3492 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3499 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3502 integer_type_p (struct type
*type
)
3508 switch (TYPE_CODE (type
))
3512 case TYPE_CODE_RANGE
:
3513 return (type
== TYPE_TARGET_TYPE (type
)
3514 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3521 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3524 scalar_type_p (struct type
*type
)
3530 switch (TYPE_CODE (type
))
3533 case TYPE_CODE_RANGE
:
3534 case TYPE_CODE_ENUM
:
3543 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3546 discrete_type_p (struct type
*type
)
3552 switch (TYPE_CODE (type
))
3555 case TYPE_CODE_RANGE
:
3556 case TYPE_CODE_ENUM
:
3557 case TYPE_CODE_BOOL
:
3565 /* Returns non-zero if OP with operands in the vector ARGS could be
3566 a user-defined function. Errs on the side of pre-defined operators
3567 (i.e., result 0). */
3570 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3572 struct type
*type0
=
3573 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3574 struct type
*type1
=
3575 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3589 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3593 case BINOP_BITWISE_AND
:
3594 case BINOP_BITWISE_IOR
:
3595 case BINOP_BITWISE_XOR
:
3596 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3599 case BINOP_NOTEQUAL
:
3604 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3607 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3610 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3614 case UNOP_LOGICAL_NOT
:
3616 return (!numeric_type_p (type0
));
3625 1. In the following, we assume that a renaming type's name may
3626 have an ___XD suffix. It would be nice if this went away at some
3628 2. We handle both the (old) purely type-based representation of
3629 renamings and the (new) variable-based encoding. At some point,
3630 it is devoutly to be hoped that the former goes away
3631 (FIXME: hilfinger-2007-07-09).
3632 3. Subprogram renamings are not implemented, although the XRS
3633 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3635 /* If SYM encodes a renaming,
3637 <renaming> renames <renamed entity>,
3639 sets *LEN to the length of the renamed entity's name,
3640 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3641 the string describing the subcomponent selected from the renamed
3642 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3643 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3644 are undefined). Otherwise, returns a value indicating the category
3645 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3646 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3647 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3648 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3649 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3650 may be NULL, in which case they are not assigned.
3652 [Currently, however, GCC does not generate subprogram renamings.] */
3654 enum ada_renaming_category
3655 ada_parse_renaming (struct symbol
*sym
,
3656 const char **renamed_entity
, int *len
,
3657 const char **renaming_expr
)
3659 enum ada_renaming_category kind
;
3664 return ADA_NOT_RENAMING
;
3665 switch (SYMBOL_CLASS (sym
))
3668 return ADA_NOT_RENAMING
;
3670 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3671 renamed_entity
, len
, renaming_expr
);
3675 case LOC_OPTIMIZED_OUT
:
3676 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3678 return ADA_NOT_RENAMING
;
3682 kind
= ADA_OBJECT_RENAMING
;
3686 kind
= ADA_EXCEPTION_RENAMING
;
3690 kind
= ADA_PACKAGE_RENAMING
;
3694 kind
= ADA_SUBPROGRAM_RENAMING
;
3698 return ADA_NOT_RENAMING
;
3702 if (renamed_entity
!= NULL
)
3703 *renamed_entity
= info
;
3704 suffix
= strstr (info
, "___XE");
3705 if (suffix
== NULL
|| suffix
== info
)
3706 return ADA_NOT_RENAMING
;
3708 *len
= strlen (info
) - strlen (suffix
);
3710 if (renaming_expr
!= NULL
)
3711 *renaming_expr
= suffix
;
3715 /* Assuming TYPE encodes a renaming according to the old encoding in
3716 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3717 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3718 ADA_NOT_RENAMING otherwise. */
3719 static enum ada_renaming_category
3720 parse_old_style_renaming (struct type
*type
,
3721 const char **renamed_entity
, int *len
,
3722 const char **renaming_expr
)
3724 enum ada_renaming_category kind
;
3729 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3730 || TYPE_NFIELDS (type
) != 1)
3731 return ADA_NOT_RENAMING
;
3733 name
= type_name_no_tag (type
);
3735 return ADA_NOT_RENAMING
;
3737 name
= strstr (name
, "___XR");
3739 return ADA_NOT_RENAMING
;
3744 kind
= ADA_OBJECT_RENAMING
;
3747 kind
= ADA_EXCEPTION_RENAMING
;
3750 kind
= ADA_PACKAGE_RENAMING
;
3753 kind
= ADA_SUBPROGRAM_RENAMING
;
3756 return ADA_NOT_RENAMING
;
3759 info
= TYPE_FIELD_NAME (type
, 0);
3761 return ADA_NOT_RENAMING
;
3762 if (renamed_entity
!= NULL
)
3763 *renamed_entity
= info
;
3764 suffix
= strstr (info
, "___XE");
3765 if (renaming_expr
!= NULL
)
3766 *renaming_expr
= suffix
+ 5;
3767 if (suffix
== NULL
|| suffix
== info
)
3768 return ADA_NOT_RENAMING
;
3770 *len
= suffix
- info
;
3776 /* Evaluation: Function Calls */
3778 /* Return an lvalue containing the value VAL. This is the identity on
3779 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3780 on the stack, using and updating *SP as the stack pointer, and
3781 returning an lvalue whose value_address points to the copy. */
3783 static struct value
*
3784 ensure_lval (struct value
*val
, struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3786 if (! VALUE_LVAL (val
))
3788 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3790 /* The following is taken from the structure-return code in
3791 call_function_by_hand. FIXME: Therefore, some refactoring seems
3793 if (gdbarch_inner_than (gdbarch
, 1, 2))
3795 /* Stack grows downward. Align SP and value_address (val) after
3796 reserving sufficient space. */
3798 if (gdbarch_frame_align_p (gdbarch
))
3799 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3800 set_value_address (val
, *sp
);
3804 /* Stack grows upward. Align the frame, allocate space, and
3805 then again, re-align the frame. */
3806 if (gdbarch_frame_align_p (gdbarch
))
3807 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3808 set_value_address (val
, *sp
);
3810 if (gdbarch_frame_align_p (gdbarch
))
3811 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3813 VALUE_LVAL (val
) = lval_memory
;
3815 write_memory (value_address (val
), value_contents_raw (val
), len
);
3821 /* Return the value ACTUAL, converted to be an appropriate value for a
3822 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3823 allocating any necessary descriptors (fat pointers), or copies of
3824 values not residing in memory, updating it as needed. */
3827 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3828 struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3830 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3831 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3832 struct type
*formal_target
=
3833 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3834 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3835 struct type
*actual_target
=
3836 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3837 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3839 if (ada_is_array_descriptor_type (formal_target
)
3840 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3841 return make_array_descriptor (formal_type
, actual
, gdbarch
, sp
);
3842 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3843 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3845 struct value
*result
;
3846 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3847 && ada_is_array_descriptor_type (actual_target
))
3848 result
= desc_data (actual
);
3849 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3851 if (VALUE_LVAL (actual
) != lval_memory
)
3854 actual_type
= ada_check_typedef (value_type (actual
));
3855 val
= allocate_value (actual_type
);
3856 memcpy ((char *) value_contents_raw (val
),
3857 (char *) value_contents (actual
),
3858 TYPE_LENGTH (actual_type
));
3859 actual
= ensure_lval (val
, gdbarch
, sp
);
3861 result
= value_addr (actual
);
3865 return value_cast_pointers (formal_type
, result
);
3867 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3868 return ada_value_ind (actual
);
3874 /* Push a descriptor of type TYPE for array value ARR on the stack at
3875 *SP, updating *SP to reflect the new descriptor. Return either
3876 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3877 to-descriptor type rather than a descriptor type), a struct value *
3878 representing a pointer to this descriptor. */
3880 static struct value
*
3881 make_array_descriptor (struct type
*type
, struct value
*arr
,
3882 struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3884 struct type
*bounds_type
= desc_bounds_type (type
);
3885 struct type
*desc_type
= desc_base_type (type
);
3886 struct value
*descriptor
= allocate_value (desc_type
);
3887 struct value
*bounds
= allocate_value (bounds_type
);
3890 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3892 modify_general_field (value_type (bounds
),
3893 value_contents_writeable (bounds
),
3894 ada_array_bound (arr
, i
, 0),
3895 desc_bound_bitpos (bounds_type
, i
, 0),
3896 desc_bound_bitsize (bounds_type
, i
, 0));
3897 modify_general_field (value_type (bounds
),
3898 value_contents_writeable (bounds
),
3899 ada_array_bound (arr
, i
, 1),
3900 desc_bound_bitpos (bounds_type
, i
, 1),
3901 desc_bound_bitsize (bounds_type
, i
, 1));
3904 bounds
= ensure_lval (bounds
, gdbarch
, sp
);
3906 modify_general_field (value_type (descriptor
),
3907 value_contents_writeable (descriptor
),
3908 value_address (ensure_lval (arr
, gdbarch
, sp
)),
3909 fat_pntr_data_bitpos (desc_type
),
3910 fat_pntr_data_bitsize (desc_type
));
3912 modify_general_field (value_type (descriptor
),
3913 value_contents_writeable (descriptor
),
3914 value_address (bounds
),
3915 fat_pntr_bounds_bitpos (desc_type
),
3916 fat_pntr_bounds_bitsize (desc_type
));
3918 descriptor
= ensure_lval (descriptor
, gdbarch
, sp
);
3920 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3921 return value_addr (descriptor
);
3926 /* Dummy definitions for an experimental caching module that is not
3927 * used in the public sources. */
3930 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3931 struct symbol
**sym
, struct block
**block
)
3937 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3938 struct block
*block
)
3944 /* Return the result of a standard (literal, C-like) lookup of NAME in
3945 given DOMAIN, visible from lexical block BLOCK. */
3947 static struct symbol
*
3948 standard_lookup (const char *name
, const struct block
*block
,
3953 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3955 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3956 cache_symbol (name
, domain
, sym
, block_found
);
3961 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3962 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3963 since they contend in overloading in the same way. */
3965 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3969 for (i
= 0; i
< n
; i
+= 1)
3970 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3971 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3972 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3978 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3979 struct types. Otherwise, they may not. */
3982 equiv_types (struct type
*type0
, struct type
*type1
)
3986 if (type0
== NULL
|| type1
== NULL
3987 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3989 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3990 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3991 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3992 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3998 /* True iff SYM0 represents the same entity as SYM1, or one that is
3999 no more defined than that of SYM1. */
4002 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4006 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4007 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4010 switch (SYMBOL_CLASS (sym0
))
4016 struct type
*type0
= SYMBOL_TYPE (sym0
);
4017 struct type
*type1
= SYMBOL_TYPE (sym1
);
4018 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4019 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4020 int len0
= strlen (name0
);
4022 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4023 && (equiv_types (type0
, type1
)
4024 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4025 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4028 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4029 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4035 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4036 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4039 add_defn_to_vec (struct obstack
*obstackp
,
4041 struct block
*block
)
4045 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4047 /* Do not try to complete stub types, as the debugger is probably
4048 already scanning all symbols matching a certain name at the
4049 time when this function is called. Trying to replace the stub
4050 type by its associated full type will cause us to restart a scan
4051 which may lead to an infinite recursion. Instead, the client
4052 collecting the matching symbols will end up collecting several
4053 matches, with at least one of them complete. It can then filter
4054 out the stub ones if needed. */
4056 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4058 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4060 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4062 prevDefns
[i
].sym
= sym
;
4063 prevDefns
[i
].block
= block
;
4069 struct ada_symbol_info info
;
4073 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4077 /* Number of ada_symbol_info structures currently collected in
4078 current vector in *OBSTACKP. */
4081 num_defns_collected (struct obstack
*obstackp
)
4083 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4086 /* Vector of ada_symbol_info structures currently collected in current
4087 vector in *OBSTACKP. If FINISH, close off the vector and return
4088 its final address. */
4090 static struct ada_symbol_info
*
4091 defns_collected (struct obstack
*obstackp
, int finish
)
4094 return obstack_finish (obstackp
);
4096 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4099 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4100 Check the global symbols if GLOBAL, the static symbols if not.
4101 Do wild-card match if WILD. */
4103 static struct partial_symbol
*
4104 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4105 int global
, domain_enum
namespace, int wild
)
4107 struct partial_symbol
**start
;
4108 int name_len
= strlen (name
);
4109 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4118 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4119 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4123 for (i
= 0; i
< length
; i
+= 1)
4125 struct partial_symbol
*psym
= start
[i
];
4127 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4128 SYMBOL_DOMAIN (psym
), namespace)
4129 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4143 int M
= (U
+ i
) >> 1;
4144 struct partial_symbol
*psym
= start
[M
];
4145 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4147 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4149 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4160 struct partial_symbol
*psym
= start
[i
];
4162 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4163 SYMBOL_DOMAIN (psym
), namespace))
4165 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4173 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4187 int M
= (U
+ i
) >> 1;
4188 struct partial_symbol
*psym
= start
[M
];
4189 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4191 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4193 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4204 struct partial_symbol
*psym
= start
[i
];
4206 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4207 SYMBOL_DOMAIN (psym
), namespace))
4211 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4214 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4216 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4226 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4236 /* Return a minimal symbol matching NAME according to Ada decoding
4237 rules. Returns NULL if there is no such minimal symbol. Names
4238 prefixed with "standard__" are handled specially: "standard__" is
4239 first stripped off, and only static and global symbols are searched. */
4241 struct minimal_symbol
*
4242 ada_lookup_simple_minsym (const char *name
)
4244 struct objfile
*objfile
;
4245 struct minimal_symbol
*msymbol
;
4248 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4250 name
+= sizeof ("standard__") - 1;
4254 wild_match
= (strstr (name
, "__") == NULL
);
4256 ALL_MSYMBOLS (objfile
, msymbol
)
4258 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4259 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4266 /* For all subprograms that statically enclose the subprogram of the
4267 selected frame, add symbols matching identifier NAME in DOMAIN
4268 and their blocks to the list of data in OBSTACKP, as for
4269 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4273 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4274 const char *name
, domain_enum
namespace,
4279 /* True if TYPE is definitely an artificial type supplied to a symbol
4280 for which no debugging information was given in the symbol file. */
4283 is_nondebugging_type (struct type
*type
)
4285 char *name
= ada_type_name (type
);
4286 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4289 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4290 duplicate other symbols in the list (The only case I know of where
4291 this happens is when object files containing stabs-in-ecoff are
4292 linked with files containing ordinary ecoff debugging symbols (or no
4293 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4294 Returns the number of items in the modified list. */
4297 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4306 /* If two symbols have the same name and one of them is a stub type,
4307 the get rid of the stub. */
4309 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4310 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4312 for (j
= 0; j
< nsyms
; j
++)
4315 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4316 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4317 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4318 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4323 /* Two symbols with the same name, same class and same address
4324 should be identical. */
4326 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4327 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4328 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4330 for (j
= 0; j
< nsyms
; j
+= 1)
4333 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4334 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4335 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4336 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4337 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4338 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4345 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4346 syms
[j
- 1] = syms
[j
];
4355 /* Given a type that corresponds to a renaming entity, use the type name
4356 to extract the scope (package name or function name, fully qualified,
4357 and following the GNAT encoding convention) where this renaming has been
4358 defined. The string returned needs to be deallocated after use. */
4361 xget_renaming_scope (struct type
*renaming_type
)
4363 /* The renaming types adhere to the following convention:
4364 <scope>__<rename>___<XR extension>.
4365 So, to extract the scope, we search for the "___XR" extension,
4366 and then backtrack until we find the first "__". */
4368 const char *name
= type_name_no_tag (renaming_type
);
4369 char *suffix
= strstr (name
, "___XR");
4374 /* Now, backtrack a bit until we find the first "__". Start looking
4375 at suffix - 3, as the <rename> part is at least one character long. */
4377 for (last
= suffix
- 3; last
> name
; last
--)
4378 if (last
[0] == '_' && last
[1] == '_')
4381 /* Make a copy of scope and return it. */
4383 scope_len
= last
- name
;
4384 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4386 strncpy (scope
, name
, scope_len
);
4387 scope
[scope_len
] = '\0';
4392 /* Return nonzero if NAME corresponds to a package name. */
4395 is_package_name (const char *name
)
4397 /* Here, We take advantage of the fact that no symbols are generated
4398 for packages, while symbols are generated for each function.
4399 So the condition for NAME represent a package becomes equivalent
4400 to NAME not existing in our list of symbols. There is only one
4401 small complication with library-level functions (see below). */
4405 /* If it is a function that has not been defined at library level,
4406 then we should be able to look it up in the symbols. */
4407 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4410 /* Library-level function names start with "_ada_". See if function
4411 "_ada_" followed by NAME can be found. */
4413 /* Do a quick check that NAME does not contain "__", since library-level
4414 functions names cannot contain "__" in them. */
4415 if (strstr (name
, "__") != NULL
)
4418 fun_name
= xstrprintf ("_ada_%s", name
);
4420 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4423 /* Return nonzero if SYM corresponds to a renaming entity that is
4424 not visible from FUNCTION_NAME. */
4427 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4431 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4434 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4436 make_cleanup (xfree
, scope
);
4438 /* If the rename has been defined in a package, then it is visible. */
4439 if (is_package_name (scope
))
4442 /* Check that the rename is in the current function scope by checking
4443 that its name starts with SCOPE. */
4445 /* If the function name starts with "_ada_", it means that it is
4446 a library-level function. Strip this prefix before doing the
4447 comparison, as the encoding for the renaming does not contain
4449 if (strncmp (function_name
, "_ada_", 5) == 0)
4452 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4455 /* Remove entries from SYMS that corresponds to a renaming entity that
4456 is not visible from the function associated with CURRENT_BLOCK or
4457 that is superfluous due to the presence of more specific renaming
4458 information. Places surviving symbols in the initial entries of
4459 SYMS and returns the number of surviving symbols.
4462 First, in cases where an object renaming is implemented as a
4463 reference variable, GNAT may produce both the actual reference
4464 variable and the renaming encoding. In this case, we discard the
4467 Second, GNAT emits a type following a specified encoding for each renaming
4468 entity. Unfortunately, STABS currently does not support the definition
4469 of types that are local to a given lexical block, so all renamings types
4470 are emitted at library level. As a consequence, if an application
4471 contains two renaming entities using the same name, and a user tries to
4472 print the value of one of these entities, the result of the ada symbol
4473 lookup will also contain the wrong renaming type.
4475 This function partially covers for this limitation by attempting to
4476 remove from the SYMS list renaming symbols that should be visible
4477 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4478 method with the current information available. The implementation
4479 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4481 - When the user tries to print a rename in a function while there
4482 is another rename entity defined in a package: Normally, the
4483 rename in the function has precedence over the rename in the
4484 package, so the latter should be removed from the list. This is
4485 currently not the case.
4487 - This function will incorrectly remove valid renames if
4488 the CURRENT_BLOCK corresponds to a function which symbol name
4489 has been changed by an "Export" pragma. As a consequence,
4490 the user will be unable to print such rename entities. */
4493 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4494 int nsyms
, const struct block
*current_block
)
4496 struct symbol
*current_function
;
4497 char *current_function_name
;
4499 int is_new_style_renaming
;
4501 /* If there is both a renaming foo___XR... encoded as a variable and
4502 a simple variable foo in the same block, discard the latter.
4503 First, zero out such symbols, then compress. */
4504 is_new_style_renaming
= 0;
4505 for (i
= 0; i
< nsyms
; i
+= 1)
4507 struct symbol
*sym
= syms
[i
].sym
;
4508 struct block
*block
= syms
[i
].block
;
4512 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4514 name
= SYMBOL_LINKAGE_NAME (sym
);
4515 suffix
= strstr (name
, "___XR");
4519 int name_len
= suffix
- name
;
4521 is_new_style_renaming
= 1;
4522 for (j
= 0; j
< nsyms
; j
+= 1)
4523 if (i
!= j
&& syms
[j
].sym
!= NULL
4524 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4526 && block
== syms
[j
].block
)
4530 if (is_new_style_renaming
)
4534 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4535 if (syms
[j
].sym
!= NULL
)
4543 /* Extract the function name associated to CURRENT_BLOCK.
4544 Abort if unable to do so. */
4546 if (current_block
== NULL
)
4549 current_function
= block_linkage_function (current_block
);
4550 if (current_function
== NULL
)
4553 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4554 if (current_function_name
== NULL
)
4557 /* Check each of the symbols, and remove it from the list if it is
4558 a type corresponding to a renaming that is out of the scope of
4559 the current block. */
4564 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4565 == ADA_OBJECT_RENAMING
4566 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4569 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4570 syms
[j
- 1] = syms
[j
];
4580 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4581 whose name and domain match NAME and DOMAIN respectively.
4582 If no match was found, then extend the search to "enclosing"
4583 routines (in other words, if we're inside a nested function,
4584 search the symbols defined inside the enclosing functions).
4586 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4589 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4590 struct block
*block
, domain_enum domain
,
4593 int block_depth
= 0;
4595 while (block
!= NULL
)
4598 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4600 /* If we found a non-function match, assume that's the one. */
4601 if (is_nonfunction (defns_collected (obstackp
, 0),
4602 num_defns_collected (obstackp
)))
4605 block
= BLOCK_SUPERBLOCK (block
);
4608 /* If no luck so far, try to find NAME as a local symbol in some lexically
4609 enclosing subprogram. */
4610 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4611 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4614 /* Add to OBSTACKP all non-local symbols whose name and domain match
4615 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4616 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4619 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4620 domain_enum domain
, int global
,
4623 struct objfile
*objfile
;
4624 struct partial_symtab
*ps
;
4626 ALL_PSYMTABS (objfile
, ps
)
4630 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4632 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4633 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4635 if (s
== NULL
|| !s
->primary
)
4637 ada_add_block_symbols (obstackp
,
4638 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4639 name
, domain
, objfile
, wild_match
);
4644 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4645 scope and in global scopes, returning the number of matches. Sets
4646 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4647 indicating the symbols found and the blocks and symbol tables (if
4648 any) in which they were found. This vector are transient---good only to
4649 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4650 symbol match within the nest of blocks whose innermost member is BLOCK0,
4651 is the one match returned (no other matches in that or
4652 enclosing blocks is returned). If there are any matches in or
4653 surrounding BLOCK0, then these alone are returned. Otherwise, the
4654 search extends to global and file-scope (static) symbol tables.
4655 Names prefixed with "standard__" are handled specially: "standard__"
4656 is first stripped off, and only static and global symbols are searched. */
4659 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4660 domain_enum
namespace,
4661 struct ada_symbol_info
**results
)
4664 struct block
*block
;
4670 obstack_free (&symbol_list_obstack
, NULL
);
4671 obstack_init (&symbol_list_obstack
);
4675 /* Search specified block and its superiors. */
4677 wild_match
= (strstr (name0
, "__") == NULL
);
4679 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4680 needed, but adding const will
4681 have a cascade effect. */
4683 /* Special case: If the user specifies a symbol name inside package
4684 Standard, do a non-wild matching of the symbol name without
4685 the "standard__" prefix. This was primarily introduced in order
4686 to allow the user to specifically access the standard exceptions
4687 using, for instance, Standard.Constraint_Error when Constraint_Error
4688 is ambiguous (due to the user defining its own Constraint_Error
4689 entity inside its program). */
4690 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4694 name
= name0
+ sizeof ("standard__") - 1;
4697 /* Check the non-global symbols. If we have ANY match, then we're done. */
4699 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4701 if (num_defns_collected (&symbol_list_obstack
) > 0)
4704 /* No non-global symbols found. Check our cache to see if we have
4705 already performed this search before. If we have, then return
4709 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4712 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4716 /* Search symbols from all global blocks. */
4718 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4721 /* Now add symbols from all per-file blocks if we've gotten no hits
4722 (not strictly correct, but perhaps better than an error). */
4724 if (num_defns_collected (&symbol_list_obstack
) == 0)
4725 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4729 ndefns
= num_defns_collected (&symbol_list_obstack
);
4730 *results
= defns_collected (&symbol_list_obstack
, 1);
4732 ndefns
= remove_extra_symbols (*results
, ndefns
);
4735 cache_symbol (name0
, namespace, NULL
, NULL
);
4737 if (ndefns
== 1 && cacheIfUnique
)
4738 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4740 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4746 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4747 domain_enum
namespace, struct block
**block_found
)
4749 struct ada_symbol_info
*candidates
;
4752 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4754 if (n_candidates
== 0)
4757 if (block_found
!= NULL
)
4758 *block_found
= candidates
[0].block
;
4760 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4763 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4764 scope and in global scopes, or NULL if none. NAME is folded and
4765 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4766 choosing the first symbol if there are multiple choices.
4767 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4768 table in which the symbol was found (in both cases, these
4769 assignments occur only if the pointers are non-null). */
4771 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4772 domain_enum
namespace, int *is_a_field_of_this
)
4774 if (is_a_field_of_this
!= NULL
)
4775 *is_a_field_of_this
= 0;
4778 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4779 block0
, namespace, NULL
);
4782 static struct symbol
*
4783 ada_lookup_symbol_nonlocal (const char *name
,
4784 const char *linkage_name
,
4785 const struct block
*block
,
4786 const domain_enum domain
)
4788 if (linkage_name
== NULL
)
4789 linkage_name
= name
;
4790 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4795 /* True iff STR is a possible encoded suffix of a normal Ada name
4796 that is to be ignored for matching purposes. Suffixes of parallel
4797 names (e.g., XVE) are not included here. Currently, the possible suffixes
4798 are given by any of the regular expressions:
4800 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4801 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4802 _E[0-9]+[bs]$ [protected object entry suffixes]
4803 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4805 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4806 match is performed. This sequence is used to differentiate homonyms,
4807 is an optional part of a valid name suffix. */
4810 is_name_suffix (const char *str
)
4813 const char *matching
;
4814 const int len
= strlen (str
);
4816 /* Skip optional leading __[0-9]+. */
4818 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4821 while (isdigit (str
[0]))
4827 if (str
[0] == '.' || str
[0] == '$')
4830 while (isdigit (matching
[0]))
4832 if (matching
[0] == '\0')
4838 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4841 while (isdigit (matching
[0]))
4843 if (matching
[0] == '\0')
4848 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4849 with a N at the end. Unfortunately, the compiler uses the same
4850 convention for other internal types it creates. So treating
4851 all entity names that end with an "N" as a name suffix causes
4852 some regressions. For instance, consider the case of an enumerated
4853 type. To support the 'Image attribute, it creates an array whose
4855 Having a single character like this as a suffix carrying some
4856 information is a bit risky. Perhaps we should change the encoding
4857 to be something like "_N" instead. In the meantime, do not do
4858 the following check. */
4859 /* Protected Object Subprograms */
4860 if (len
== 1 && str
[0] == 'N')
4865 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4868 while (isdigit (matching
[0]))
4870 if ((matching
[0] == 'b' || matching
[0] == 's')
4871 && matching
[1] == '\0')
4875 /* ??? We should not modify STR directly, as we are doing below. This
4876 is fine in this case, but may become problematic later if we find
4877 that this alternative did not work, and want to try matching
4878 another one from the begining of STR. Since we modified it, we
4879 won't be able to find the begining of the string anymore! */
4883 while (str
[0] != '_' && str
[0] != '\0')
4885 if (str
[0] != 'n' && str
[0] != 'b')
4891 if (str
[0] == '\000')
4896 if (str
[1] != '_' || str
[2] == '\000')
4900 if (strcmp (str
+ 3, "JM") == 0)
4902 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4903 the LJM suffix in favor of the JM one. But we will
4904 still accept LJM as a valid suffix for a reasonable
4905 amount of time, just to allow ourselves to debug programs
4906 compiled using an older version of GNAT. */
4907 if (strcmp (str
+ 3, "LJM") == 0)
4911 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4912 || str
[4] == 'U' || str
[4] == 'P')
4914 if (str
[4] == 'R' && str
[5] != 'T')
4918 if (!isdigit (str
[2]))
4920 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4921 if (!isdigit (str
[k
]) && str
[k
] != '_')
4925 if (str
[0] == '$' && isdigit (str
[1]))
4927 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4928 if (!isdigit (str
[k
]) && str
[k
] != '_')
4935 /* Return non-zero if the string starting at NAME and ending before
4936 NAME_END contains no capital letters. */
4939 is_valid_name_for_wild_match (const char *name0
)
4941 const char *decoded_name
= ada_decode (name0
);
4944 /* If the decoded name starts with an angle bracket, it means that
4945 NAME0 does not follow the GNAT encoding format. It should then
4946 not be allowed as a possible wild match. */
4947 if (decoded_name
[0] == '<')
4950 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4951 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4957 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4958 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4959 informational suffixes of NAME (i.e., for which is_name_suffix is
4963 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4970 match
= strstr (start
, patn0
);
4975 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
4976 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
4977 && is_name_suffix (match
+ patn_len
))
4978 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
4983 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4984 vector *defn_symbols, updating the list of symbols in OBSTACKP
4985 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4986 OBJFILE is the section containing BLOCK.
4987 SYMTAB is recorded with each symbol added. */
4990 ada_add_block_symbols (struct obstack
*obstackp
,
4991 struct block
*block
, const char *name
,
4992 domain_enum domain
, struct objfile
*objfile
,
4995 struct dict_iterator iter
;
4996 int name_len
= strlen (name
);
4997 /* A matching argument symbol, if any. */
4998 struct symbol
*arg_sym
;
4999 /* Set true when we find a matching non-argument symbol. */
5008 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5010 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5011 SYMBOL_DOMAIN (sym
), domain
)
5012 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5014 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5016 else if (SYMBOL_IS_ARGUMENT (sym
))
5021 add_defn_to_vec (obstackp
,
5022 fixup_symbol_section (sym
, objfile
),
5030 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5032 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5033 SYMBOL_DOMAIN (sym
), domain
))
5035 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5037 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5039 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5041 if (SYMBOL_IS_ARGUMENT (sym
))
5046 add_defn_to_vec (obstackp
,
5047 fixup_symbol_section (sym
, objfile
),
5056 if (!found_sym
&& arg_sym
!= NULL
)
5058 add_defn_to_vec (obstackp
,
5059 fixup_symbol_section (arg_sym
, objfile
),
5068 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5070 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5071 SYMBOL_DOMAIN (sym
), domain
))
5075 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5078 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5080 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5085 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5087 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5089 if (SYMBOL_IS_ARGUMENT (sym
))
5094 add_defn_to_vec (obstackp
,
5095 fixup_symbol_section (sym
, objfile
),
5103 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5104 They aren't parameters, right? */
5105 if (!found_sym
&& arg_sym
!= NULL
)
5107 add_defn_to_vec (obstackp
,
5108 fixup_symbol_section (arg_sym
, objfile
),
5115 /* Symbol Completion */
5117 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5118 name in a form that's appropriate for the completion. The result
5119 does not need to be deallocated, but is only good until the next call.
5121 TEXT_LEN is equal to the length of TEXT.
5122 Perform a wild match if WILD_MATCH is set.
5123 ENCODED should be set if TEXT represents the start of a symbol name
5124 in its encoded form. */
5127 symbol_completion_match (const char *sym_name
,
5128 const char *text
, int text_len
,
5129 int wild_match
, int encoded
)
5132 const int verbatim_match
= (text
[0] == '<');
5137 /* Strip the leading angle bracket. */
5142 /* First, test against the fully qualified name of the symbol. */
5144 if (strncmp (sym_name
, text
, text_len
) == 0)
5147 if (match
&& !encoded
)
5149 /* One needed check before declaring a positive match is to verify
5150 that iff we are doing a verbatim match, the decoded version
5151 of the symbol name starts with '<'. Otherwise, this symbol name
5152 is not a suitable completion. */
5153 const char *sym_name_copy
= sym_name
;
5154 int has_angle_bracket
;
5156 sym_name
= ada_decode (sym_name
);
5157 has_angle_bracket
= (sym_name
[0] == '<');
5158 match
= (has_angle_bracket
== verbatim_match
);
5159 sym_name
= sym_name_copy
;
5162 if (match
&& !verbatim_match
)
5164 /* When doing non-verbatim match, another check that needs to
5165 be done is to verify that the potentially matching symbol name
5166 does not include capital letters, because the ada-mode would
5167 not be able to understand these symbol names without the
5168 angle bracket notation. */
5171 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5176 /* Second: Try wild matching... */
5178 if (!match
&& wild_match
)
5180 /* Since we are doing wild matching, this means that TEXT
5181 may represent an unqualified symbol name. We therefore must
5182 also compare TEXT against the unqualified name of the symbol. */
5183 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5185 if (strncmp (sym_name
, text
, text_len
) == 0)
5189 /* Finally: If we found a mach, prepare the result to return. */
5195 sym_name
= add_angle_brackets (sym_name
);
5198 sym_name
= ada_decode (sym_name
);
5203 typedef char *char_ptr
;
5204 DEF_VEC_P (char_ptr
);
5206 /* A companion function to ada_make_symbol_completion_list().
5207 Check if SYM_NAME represents a symbol which name would be suitable
5208 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5209 it is appended at the end of the given string vector SV.
5211 ORIG_TEXT is the string original string from the user command
5212 that needs to be completed. WORD is the entire command on which
5213 completion should be performed. These two parameters are used to
5214 determine which part of the symbol name should be added to the
5216 if WILD_MATCH is set, then wild matching is performed.
5217 ENCODED should be set if TEXT represents a symbol name in its
5218 encoded formed (in which case the completion should also be
5222 symbol_completion_add (VEC(char_ptr
) **sv
,
5223 const char *sym_name
,
5224 const char *text
, int text_len
,
5225 const char *orig_text
, const char *word
,
5226 int wild_match
, int encoded
)
5228 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5229 wild_match
, encoded
);
5235 /* We found a match, so add the appropriate completion to the given
5238 if (word
== orig_text
)
5240 completion
= xmalloc (strlen (match
) + 5);
5241 strcpy (completion
, match
);
5243 else if (word
> orig_text
)
5245 /* Return some portion of sym_name. */
5246 completion
= xmalloc (strlen (match
) + 5);
5247 strcpy (completion
, match
+ (word
- orig_text
));
5251 /* Return some of ORIG_TEXT plus sym_name. */
5252 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5253 strncpy (completion
, word
, orig_text
- word
);
5254 completion
[orig_text
- word
] = '\0';
5255 strcat (completion
, match
);
5258 VEC_safe_push (char_ptr
, *sv
, completion
);
5261 /* Return a list of possible symbol names completing TEXT0. The list
5262 is NULL terminated. WORD is the entire command on which completion
5266 ada_make_symbol_completion_list (char *text0
, char *word
)
5272 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5275 struct partial_symtab
*ps
;
5276 struct minimal_symbol
*msymbol
;
5277 struct objfile
*objfile
;
5278 struct block
*b
, *surrounding_static_block
= 0;
5280 struct dict_iterator iter
;
5282 if (text0
[0] == '<')
5284 text
= xstrdup (text0
);
5285 make_cleanup (xfree
, text
);
5286 text_len
= strlen (text
);
5292 text
= xstrdup (ada_encode (text0
));
5293 make_cleanup (xfree
, text
);
5294 text_len
= strlen (text
);
5295 for (i
= 0; i
< text_len
; i
++)
5296 text
[i
] = tolower (text
[i
]);
5298 encoded
= (strstr (text0
, "__") != NULL
);
5299 /* If the name contains a ".", then the user is entering a fully
5300 qualified entity name, and the match must not be done in wild
5301 mode. Similarly, if the user wants to complete what looks like
5302 an encoded name, the match must not be done in wild mode. */
5303 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5306 /* First, look at the partial symtab symbols. */
5307 ALL_PSYMTABS (objfile
, ps
)
5309 struct partial_symbol
**psym
;
5311 /* If the psymtab's been read in we'll get it when we search
5312 through the blockvector. */
5316 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5317 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5318 + ps
->n_global_syms
); psym
++)
5321 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5322 text
, text_len
, text0
, word
,
5323 wild_match
, encoded
);
5326 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5327 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5328 + ps
->n_static_syms
); psym
++)
5331 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5332 text
, text_len
, text0
, word
,
5333 wild_match
, encoded
);
5337 /* At this point scan through the misc symbol vectors and add each
5338 symbol you find to the list. Eventually we want to ignore
5339 anything that isn't a text symbol (everything else will be
5340 handled by the psymtab code above). */
5342 ALL_MSYMBOLS (objfile
, msymbol
)
5345 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5346 text
, text_len
, text0
, word
, wild_match
, encoded
);
5349 /* Search upwards from currently selected frame (so that we can
5350 complete on local vars. */
5352 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5354 if (!BLOCK_SUPERBLOCK (b
))
5355 surrounding_static_block
= b
; /* For elmin of dups */
5357 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5359 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5360 text
, text_len
, text0
, word
,
5361 wild_match
, encoded
);
5365 /* Go through the symtabs and check the externs and statics for
5366 symbols which match. */
5368 ALL_SYMTABS (objfile
, s
)
5371 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5372 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5374 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5375 text
, text_len
, text0
, word
,
5376 wild_match
, encoded
);
5380 ALL_SYMTABS (objfile
, s
)
5383 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5384 /* Don't do this block twice. */
5385 if (b
== surrounding_static_block
)
5387 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5389 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5390 text
, text_len
, text0
, word
,
5391 wild_match
, encoded
);
5395 /* Append the closing NULL entry. */
5396 VEC_safe_push (char_ptr
, completions
, NULL
);
5398 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5399 return the copy. It's unfortunate that we have to make a copy
5400 of an array that we're about to destroy, but there is nothing much
5401 we can do about it. Fortunately, it's typically not a very large
5404 const size_t completions_size
=
5405 VEC_length (char_ptr
, completions
) * sizeof (char *);
5406 char **result
= malloc (completions_size
);
5408 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5410 VEC_free (char_ptr
, completions
);
5417 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5418 for tagged types. */
5421 ada_is_dispatch_table_ptr_type (struct type
*type
)
5425 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5428 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5432 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5435 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5436 to be invisible to users. */
5439 ada_is_ignored_field (struct type
*type
, int field_num
)
5441 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5444 /* Check the name of that field. */
5446 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5448 /* Anonymous field names should not be printed.
5449 brobecker/2007-02-20: I don't think this can actually happen
5450 but we don't want to print the value of annonymous fields anyway. */
5454 /* A field named "_parent" is internally generated by GNAT for
5455 tagged types, and should not be printed either. */
5456 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5460 /* If this is the dispatch table of a tagged type, then ignore. */
5461 if (ada_is_tagged_type (type
, 1)
5462 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5465 /* Not a special field, so it should not be ignored. */
5469 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5470 pointer or reference type whose ultimate target has a tag field. */
5473 ada_is_tagged_type (struct type
*type
, int refok
)
5475 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5478 /* True iff TYPE represents the type of X'Tag */
5481 ada_is_tag_type (struct type
*type
)
5483 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5487 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5488 return (name
!= NULL
5489 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5493 /* The type of the tag on VAL. */
5496 ada_tag_type (struct value
*val
)
5498 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5501 /* The value of the tag on VAL. */
5504 ada_value_tag (struct value
*val
)
5506 return ada_value_struct_elt (val
, "_tag", 0);
5509 /* The value of the tag on the object of type TYPE whose contents are
5510 saved at VALADDR, if it is non-null, or is at memory address
5513 static struct value
*
5514 value_tag_from_contents_and_address (struct type
*type
,
5515 const gdb_byte
*valaddr
,
5518 int tag_byte_offset
, dummy1
, dummy2
;
5519 struct type
*tag_type
;
5520 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5523 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5525 : valaddr
+ tag_byte_offset
);
5526 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5528 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5533 static struct type
*
5534 type_from_tag (struct value
*tag
)
5536 const char *type_name
= ada_tag_name (tag
);
5537 if (type_name
!= NULL
)
5538 return ada_find_any_type (ada_encode (type_name
));
5549 static int ada_tag_name_1 (void *);
5550 static int ada_tag_name_2 (struct tag_args
*);
5552 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5553 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5554 The value stored in ARGS->name is valid until the next call to
5558 ada_tag_name_1 (void *args0
)
5560 struct tag_args
*args
= (struct tag_args
*) args0
;
5561 static char name
[1024];
5565 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5567 return ada_tag_name_2 (args
);
5568 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5571 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5572 for (p
= name
; *p
!= '\0'; p
+= 1)
5579 /* Utility function for ada_tag_name_1 that tries the second
5580 representation for the dispatch table (in which there is no
5581 explicit 'tsd' field in the referent of the tag pointer, and instead
5582 the tsd pointer is stored just before the dispatch table. */
5585 ada_tag_name_2 (struct tag_args
*args
)
5587 struct type
*info_type
;
5588 static char name
[1024];
5590 struct value
*val
, *valp
;
5593 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5594 if (info_type
== NULL
)
5596 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5597 valp
= value_cast (info_type
, args
->tag
);
5600 val
= value_ind (value_ptradd (valp
, -1));
5603 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5606 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5607 for (p
= name
; *p
!= '\0'; p
+= 1)
5614 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5618 ada_tag_name (struct value
*tag
)
5620 struct tag_args args
;
5621 if (!ada_is_tag_type (value_type (tag
)))
5625 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5629 /* The parent type of TYPE, or NULL if none. */
5632 ada_parent_type (struct type
*type
)
5636 type
= ada_check_typedef (type
);
5638 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5641 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5642 if (ada_is_parent_field (type
, i
))
5644 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5646 /* If the _parent field is a pointer, then dereference it. */
5647 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5648 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5649 /* If there is a parallel XVS type, get the actual base type. */
5650 parent_type
= ada_get_base_type (parent_type
);
5652 return ada_check_typedef (parent_type
);
5658 /* True iff field number FIELD_NUM of structure type TYPE contains the
5659 parent-type (inherited) fields of a derived type. Assumes TYPE is
5660 a structure type with at least FIELD_NUM+1 fields. */
5663 ada_is_parent_field (struct type
*type
, int field_num
)
5665 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5666 return (name
!= NULL
5667 && (strncmp (name
, "PARENT", 6) == 0
5668 || strncmp (name
, "_parent", 7) == 0));
5671 /* True iff field number FIELD_NUM of structure type TYPE is a
5672 transparent wrapper field (which should be silently traversed when doing
5673 field selection and flattened when printing). Assumes TYPE is a
5674 structure type with at least FIELD_NUM+1 fields. Such fields are always
5678 ada_is_wrapper_field (struct type
*type
, int field_num
)
5680 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5681 return (name
!= NULL
5682 && (strncmp (name
, "PARENT", 6) == 0
5683 || strcmp (name
, "REP") == 0
5684 || strncmp (name
, "_parent", 7) == 0
5685 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5688 /* True iff field number FIELD_NUM of structure or union type TYPE
5689 is a variant wrapper. Assumes TYPE is a structure type with at least
5690 FIELD_NUM+1 fields. */
5693 ada_is_variant_part (struct type
*type
, int field_num
)
5695 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5696 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5697 || (is_dynamic_field (type
, field_num
)
5698 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5699 == TYPE_CODE_UNION
)));
5702 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5703 whose discriminants are contained in the record type OUTER_TYPE,
5704 returns the type of the controlling discriminant for the variant.
5705 May return NULL if the type could not be found. */
5708 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5710 char *name
= ada_variant_discrim_name (var_type
);
5711 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5714 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5715 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5716 represents a 'when others' clause; otherwise 0. */
5719 ada_is_others_clause (struct type
*type
, int field_num
)
5721 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5722 return (name
!= NULL
&& name
[0] == 'O');
5725 /* Assuming that TYPE0 is the type of the variant part of a record,
5726 returns the name of the discriminant controlling the variant.
5727 The value is valid until the next call to ada_variant_discrim_name. */
5730 ada_variant_discrim_name (struct type
*type0
)
5732 static char *result
= NULL
;
5733 static size_t result_len
= 0;
5736 const char *discrim_end
;
5737 const char *discrim_start
;
5739 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5740 type
= TYPE_TARGET_TYPE (type0
);
5744 name
= ada_type_name (type
);
5746 if (name
== NULL
|| name
[0] == '\000')
5749 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5752 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5755 if (discrim_end
== name
)
5758 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5761 if (discrim_start
== name
+ 1)
5763 if ((discrim_start
> name
+ 3
5764 && strncmp (discrim_start
- 3, "___", 3) == 0)
5765 || discrim_start
[-1] == '.')
5769 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5770 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5771 result
[discrim_end
- discrim_start
] = '\0';
5775 /* Scan STR for a subtype-encoded number, beginning at position K.
5776 Put the position of the character just past the number scanned in
5777 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5778 Return 1 if there was a valid number at the given position, and 0
5779 otherwise. A "subtype-encoded" number consists of the absolute value
5780 in decimal, followed by the letter 'm' to indicate a negative number.
5781 Assumes 0m does not occur. */
5784 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5788 if (!isdigit (str
[k
]))
5791 /* Do it the hard way so as not to make any assumption about
5792 the relationship of unsigned long (%lu scan format code) and
5795 while (isdigit (str
[k
]))
5797 RU
= RU
* 10 + (str
[k
] - '0');
5804 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5810 /* NOTE on the above: Technically, C does not say what the results of
5811 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5812 number representable as a LONGEST (although either would probably work
5813 in most implementations). When RU>0, the locution in the then branch
5814 above is always equivalent to the negative of RU. */
5821 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5822 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5823 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5826 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5828 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5841 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5850 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5851 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5853 if (val
>= L
&& val
<= U
)
5865 /* FIXME: Lots of redundancy below. Try to consolidate. */
5867 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5868 ARG_TYPE, extract and return the value of one of its (non-static)
5869 fields. FIELDNO says which field. Differs from value_primitive_field
5870 only in that it can handle packed values of arbitrary type. */
5872 static struct value
*
5873 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5874 struct type
*arg_type
)
5878 arg_type
= ada_check_typedef (arg_type
);
5879 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5881 /* Handle packed fields. */
5883 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5885 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5886 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5888 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5889 offset
+ bit_pos
/ 8,
5890 bit_pos
% 8, bit_size
, type
);
5893 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5896 /* Find field with name NAME in object of type TYPE. If found,
5897 set the following for each argument that is non-null:
5898 - *FIELD_TYPE_P to the field's type;
5899 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5900 an object of that type;
5901 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5902 - *BIT_SIZE_P to its size in bits if the field is packed, and
5904 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5905 fields up to but not including the desired field, or by the total
5906 number of fields if not found. A NULL value of NAME never
5907 matches; the function just counts visible fields in this case.
5909 Returns 1 if found, 0 otherwise. */
5912 find_struct_field (char *name
, struct type
*type
, int offset
,
5913 struct type
**field_type_p
,
5914 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5919 type
= ada_check_typedef (type
);
5921 if (field_type_p
!= NULL
)
5922 *field_type_p
= NULL
;
5923 if (byte_offset_p
!= NULL
)
5925 if (bit_offset_p
!= NULL
)
5927 if (bit_size_p
!= NULL
)
5930 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5932 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5933 int fld_offset
= offset
+ bit_pos
/ 8;
5934 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5936 if (t_field_name
== NULL
)
5939 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5941 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5942 if (field_type_p
!= NULL
)
5943 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5944 if (byte_offset_p
!= NULL
)
5945 *byte_offset_p
= fld_offset
;
5946 if (bit_offset_p
!= NULL
)
5947 *bit_offset_p
= bit_pos
% 8;
5948 if (bit_size_p
!= NULL
)
5949 *bit_size_p
= bit_size
;
5952 else if (ada_is_wrapper_field (type
, i
))
5954 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5955 field_type_p
, byte_offset_p
, bit_offset_p
,
5956 bit_size_p
, index_p
))
5959 else if (ada_is_variant_part (type
, i
))
5961 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5964 struct type
*field_type
5965 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5967 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5969 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5971 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5972 field_type_p
, byte_offset_p
,
5973 bit_offset_p
, bit_size_p
, index_p
))
5977 else if (index_p
!= NULL
)
5983 /* Number of user-visible fields in record type TYPE. */
5986 num_visible_fields (struct type
*type
)
5990 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5994 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5995 and search in it assuming it has (class) type TYPE.
5996 If found, return value, else return NULL.
5998 Searches recursively through wrapper fields (e.g., '_parent'). */
6000 static struct value
*
6001 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6005 type
= ada_check_typedef (type
);
6007 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6009 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6011 if (t_field_name
== NULL
)
6014 else if (field_name_match (t_field_name
, name
))
6015 return ada_value_primitive_field (arg
, offset
, i
, type
);
6017 else if (ada_is_wrapper_field (type
, i
))
6019 struct value
*v
= /* Do not let indent join lines here. */
6020 ada_search_struct_field (name
, arg
,
6021 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6022 TYPE_FIELD_TYPE (type
, i
));
6027 else if (ada_is_variant_part (type
, i
))
6029 /* PNH: Do we ever get here? See find_struct_field. */
6031 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6032 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6034 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6036 struct value
*v
= ada_search_struct_field
/* Force line break. */
6038 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6039 TYPE_FIELD_TYPE (field_type
, j
));
6048 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6049 int, struct type
*);
6052 /* Return field #INDEX in ARG, where the index is that returned by
6053 * find_struct_field through its INDEX_P argument. Adjust the address
6054 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6055 * If found, return value, else return NULL. */
6057 static struct value
*
6058 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6061 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6065 /* Auxiliary function for ada_index_struct_field. Like
6066 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6069 static struct value
*
6070 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6074 type
= ada_check_typedef (type
);
6076 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6078 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6080 else if (ada_is_wrapper_field (type
, i
))
6082 struct value
*v
= /* Do not let indent join lines here. */
6083 ada_index_struct_field_1 (index_p
, arg
,
6084 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6085 TYPE_FIELD_TYPE (type
, i
));
6090 else if (ada_is_variant_part (type
, i
))
6092 /* PNH: Do we ever get here? See ada_search_struct_field,
6093 find_struct_field. */
6094 error (_("Cannot assign this kind of variant record"));
6096 else if (*index_p
== 0)
6097 return ada_value_primitive_field (arg
, offset
, i
, type
);
6104 /* Given ARG, a value of type (pointer or reference to a)*
6105 structure/union, extract the component named NAME from the ultimate
6106 target structure/union and return it as a value with its
6109 The routine searches for NAME among all members of the structure itself
6110 and (recursively) among all members of any wrapper members
6113 If NO_ERR, then simply return NULL in case of error, rather than
6117 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6119 struct type
*t
, *t1
;
6123 t1
= t
= ada_check_typedef (value_type (arg
));
6124 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6126 t1
= TYPE_TARGET_TYPE (t
);
6129 t1
= ada_check_typedef (t1
);
6130 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6132 arg
= coerce_ref (arg
);
6137 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6139 t1
= TYPE_TARGET_TYPE (t
);
6142 t1
= ada_check_typedef (t1
);
6143 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6145 arg
= value_ind (arg
);
6152 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6156 v
= ada_search_struct_field (name
, arg
, 0, t
);
6159 int bit_offset
, bit_size
, byte_offset
;
6160 struct type
*field_type
;
6163 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6164 address
= value_as_address (arg
);
6166 address
= unpack_pointer (t
, value_contents (arg
));
6168 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6169 if (find_struct_field (name
, t1
, 0,
6170 &field_type
, &byte_offset
, &bit_offset
,
6175 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6176 arg
= ada_coerce_ref (arg
);
6178 arg
= ada_value_ind (arg
);
6179 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6180 bit_offset
, bit_size
,
6184 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6188 if (v
!= NULL
|| no_err
)
6191 error (_("There is no member named %s."), name
);
6197 error (_("Attempt to extract a component of a value that is not a record."));
6200 /* Given a type TYPE, look up the type of the component of type named NAME.
6201 If DISPP is non-null, add its byte displacement from the beginning of a
6202 structure (pointed to by a value) of type TYPE to *DISPP (does not
6203 work for packed fields).
6205 Matches any field whose name has NAME as a prefix, possibly
6208 TYPE can be either a struct or union. If REFOK, TYPE may also
6209 be a (pointer or reference)+ to a struct or union, and the
6210 ultimate target type will be searched.
6212 Looks recursively into variant clauses and parent types.
6214 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6215 TYPE is not a type of the right kind. */
6217 static struct type
*
6218 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6219 int noerr
, int *dispp
)
6226 if (refok
&& type
!= NULL
)
6229 type
= ada_check_typedef (type
);
6230 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6231 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6233 type
= TYPE_TARGET_TYPE (type
);
6237 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6238 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6244 target_terminal_ours ();
6245 gdb_flush (gdb_stdout
);
6247 error (_("Type (null) is not a structure or union type"));
6250 /* XXX: type_sprint */
6251 fprintf_unfiltered (gdb_stderr
, _("Type "));
6252 type_print (type
, "", gdb_stderr
, -1);
6253 error (_(" is not a structure or union type"));
6258 type
= to_static_fixed_type (type
);
6260 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6262 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6266 if (t_field_name
== NULL
)
6269 else if (field_name_match (t_field_name
, name
))
6272 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6273 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6276 else if (ada_is_wrapper_field (type
, i
))
6279 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6284 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6289 else if (ada_is_variant_part (type
, i
))
6292 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6294 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6296 /* FIXME pnh 2008/01/26: We check for a field that is
6297 NOT wrapped in a struct, since the compiler sometimes
6298 generates these for unchecked variant types. Revisit
6299 if the compiler changes this practice. */
6300 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6302 if (v_field_name
!= NULL
6303 && field_name_match (v_field_name
, name
))
6304 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6306 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6312 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6323 target_terminal_ours ();
6324 gdb_flush (gdb_stdout
);
6327 /* XXX: type_sprint */
6328 fprintf_unfiltered (gdb_stderr
, _("Type "));
6329 type_print (type
, "", gdb_stderr
, -1);
6330 error (_(" has no component named <null>"));
6334 /* XXX: type_sprint */
6335 fprintf_unfiltered (gdb_stderr
, _("Type "));
6336 type_print (type
, "", gdb_stderr
, -1);
6337 error (_(" has no component named %s"), name
);
6344 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6345 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6346 represents an unchecked union (that is, the variant part of a
6347 record that is named in an Unchecked_Union pragma). */
6350 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6352 char *discrim_name
= ada_variant_discrim_name (var_type
);
6353 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6358 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6359 within a value of type OUTER_TYPE that is stored in GDB at
6360 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6361 numbering from 0) is applicable. Returns -1 if none are. */
6364 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6365 const gdb_byte
*outer_valaddr
)
6369 char *discrim_name
= ada_variant_discrim_name (var_type
);
6370 struct value
*outer
;
6371 struct value
*discrim
;
6372 LONGEST discrim_val
;
6374 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6375 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6376 if (discrim
== NULL
)
6378 discrim_val
= value_as_long (discrim
);
6381 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6383 if (ada_is_others_clause (var_type
, i
))
6385 else if (ada_in_variant (discrim_val
, var_type
, i
))
6389 return others_clause
;
6394 /* Dynamic-Sized Records */
6396 /* Strategy: The type ostensibly attached to a value with dynamic size
6397 (i.e., a size that is not statically recorded in the debugging
6398 data) does not accurately reflect the size or layout of the value.
6399 Our strategy is to convert these values to values with accurate,
6400 conventional types that are constructed on the fly. */
6402 /* There is a subtle and tricky problem here. In general, we cannot
6403 determine the size of dynamic records without its data. However,
6404 the 'struct value' data structure, which GDB uses to represent
6405 quantities in the inferior process (the target), requires the size
6406 of the type at the time of its allocation in order to reserve space
6407 for GDB's internal copy of the data. That's why the
6408 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6409 rather than struct value*s.
6411 However, GDB's internal history variables ($1, $2, etc.) are
6412 struct value*s containing internal copies of the data that are not, in
6413 general, the same as the data at their corresponding addresses in
6414 the target. Fortunately, the types we give to these values are all
6415 conventional, fixed-size types (as per the strategy described
6416 above), so that we don't usually have to perform the
6417 'to_fixed_xxx_type' conversions to look at their values.
6418 Unfortunately, there is one exception: if one of the internal
6419 history variables is an array whose elements are unconstrained
6420 records, then we will need to create distinct fixed types for each
6421 element selected. */
6423 /* The upshot of all of this is that many routines take a (type, host
6424 address, target address) triple as arguments to represent a value.
6425 The host address, if non-null, is supposed to contain an internal
6426 copy of the relevant data; otherwise, the program is to consult the
6427 target at the target address. */
6429 /* Assuming that VAL0 represents a pointer value, the result of
6430 dereferencing it. Differs from value_ind in its treatment of
6431 dynamic-sized types. */
6434 ada_value_ind (struct value
*val0
)
6436 struct value
*val
= unwrap_value (value_ind (val0
));
6437 return ada_to_fixed_value (val
);
6440 /* The value resulting from dereferencing any "reference to"
6441 qualifiers on VAL0. */
6443 static struct value
*
6444 ada_coerce_ref (struct value
*val0
)
6446 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6448 struct value
*val
= val0
;
6449 val
= coerce_ref (val
);
6450 val
= unwrap_value (val
);
6451 return ada_to_fixed_value (val
);
6457 /* Return OFF rounded upward if necessary to a multiple of
6458 ALIGNMENT (a power of 2). */
6461 align_value (unsigned int off
, unsigned int alignment
)
6463 return (off
+ alignment
- 1) & ~(alignment
- 1);
6466 /* Return the bit alignment required for field #F of template type TYPE. */
6469 field_alignment (struct type
*type
, int f
)
6471 const char *name
= TYPE_FIELD_NAME (type
, f
);
6475 /* The field name should never be null, unless the debugging information
6476 is somehow malformed. In this case, we assume the field does not
6477 require any alignment. */
6481 len
= strlen (name
);
6483 if (!isdigit (name
[len
- 1]))
6486 if (isdigit (name
[len
- 2]))
6487 align_offset
= len
- 2;
6489 align_offset
= len
- 1;
6491 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6492 return TARGET_CHAR_BIT
;
6494 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6497 /* Find a symbol named NAME. Ignores ambiguity. */
6500 ada_find_any_symbol (const char *name
)
6504 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6505 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6508 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6512 /* Find a type named NAME. Ignores ambiguity. This routine will look
6513 solely for types defined by debug info, it will not search the GDB
6517 ada_find_any_type (const char *name
)
6519 struct symbol
*sym
= ada_find_any_symbol (name
);
6522 return SYMBOL_TYPE (sym
);
6527 /* Given NAME and an associated BLOCK, search all symbols for
6528 NAME suffixed with "___XR", which is the ``renaming'' symbol
6529 associated to NAME. Return this symbol if found, return
6533 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6537 sym
= find_old_style_renaming_symbol (name
, block
);
6542 /* Not right yet. FIXME pnh 7/20/2007. */
6543 sym
= ada_find_any_symbol (name
);
6544 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6550 static struct symbol
*
6551 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6553 const struct symbol
*function_sym
= block_linkage_function (block
);
6556 if (function_sym
!= NULL
)
6558 /* If the symbol is defined inside a function, NAME is not fully
6559 qualified. This means we need to prepend the function name
6560 as well as adding the ``___XR'' suffix to build the name of
6561 the associated renaming symbol. */
6562 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6563 /* Function names sometimes contain suffixes used
6564 for instance to qualify nested subprograms. When building
6565 the XR type name, we need to make sure that this suffix is
6566 not included. So do not include any suffix in the function
6567 name length below. */
6568 int function_name_len
= ada_name_prefix_len (function_name
);
6569 const int rename_len
= function_name_len
+ 2 /* "__" */
6570 + strlen (name
) + 6 /* "___XR\0" */ ;
6572 /* Strip the suffix if necessary. */
6573 ada_remove_trailing_digits (function_name
, &function_name_len
);
6574 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
6575 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
6577 /* Library-level functions are a special case, as GNAT adds
6578 a ``_ada_'' prefix to the function name to avoid namespace
6579 pollution. However, the renaming symbols themselves do not
6580 have this prefix, so we need to skip this prefix if present. */
6581 if (function_name_len
> 5 /* "_ada_" */
6582 && strstr (function_name
, "_ada_") == function_name
)
6585 function_name_len
-= 5;
6588 rename
= (char *) alloca (rename_len
* sizeof (char));
6589 strncpy (rename
, function_name
, function_name_len
);
6590 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
6595 const int rename_len
= strlen (name
) + 6;
6596 rename
= (char *) alloca (rename_len
* sizeof (char));
6597 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6600 return ada_find_any_symbol (rename
);
6603 /* Because of GNAT encoding conventions, several GDB symbols may match a
6604 given type name. If the type denoted by TYPE0 is to be preferred to
6605 that of TYPE1 for purposes of type printing, return non-zero;
6606 otherwise return 0. */
6609 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6613 else if (type0
== NULL
)
6615 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6617 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6619 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6621 else if (ada_is_constrained_packed_array_type (type0
))
6623 else if (ada_is_array_descriptor_type (type0
)
6624 && !ada_is_array_descriptor_type (type1
))
6628 const char *type0_name
= type_name_no_tag (type0
);
6629 const char *type1_name
= type_name_no_tag (type1
);
6631 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6632 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6638 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6639 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6642 ada_type_name (struct type
*type
)
6646 else if (TYPE_NAME (type
) != NULL
)
6647 return TYPE_NAME (type
);
6649 return TYPE_TAG_NAME (type
);
6652 /* Search the list of "descriptive" types associated to TYPE for a type
6653 whose name is NAME. */
6655 static struct type
*
6656 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
6658 struct type
*result
;
6660 /* If there no descriptive-type info, then there is no parallel type
6662 if (!HAVE_GNAT_AUX_INFO (type
))
6665 result
= TYPE_DESCRIPTIVE_TYPE (type
);
6666 while (result
!= NULL
)
6668 char *result_name
= ada_type_name (result
);
6670 if (result_name
== NULL
)
6672 warning (_("unexpected null name on descriptive type"));
6676 /* If the names match, stop. */
6677 if (strcmp (result_name
, name
) == 0)
6680 /* Otherwise, look at the next item on the list, if any. */
6681 if (HAVE_GNAT_AUX_INFO (result
))
6682 result
= TYPE_DESCRIPTIVE_TYPE (result
);
6687 /* If we didn't find a match, see whether this is a packed array. With
6688 older compilers, the descriptive type information is either absent or
6689 irrelevant when it comes to packed arrays so the above lookup fails.
6690 Fall back to using a parallel lookup by name in this case. */
6691 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
6692 return ada_find_any_type (name
);
6697 /* Find a parallel type to TYPE with the specified NAME, using the
6698 descriptive type taken from the debugging information, if available,
6699 and otherwise using the (slower) name-based method. */
6701 static struct type
*
6702 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
6704 struct type
*result
= NULL
;
6706 if (HAVE_GNAT_AUX_INFO (type
))
6707 result
= find_parallel_type_by_descriptive_type (type
, name
);
6709 result
= ada_find_any_type (name
);
6714 /* Same as above, but specify the name of the parallel type by appending
6715 SUFFIX to the name of TYPE. */
6718 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6720 char *name
, *typename
= ada_type_name (type
);
6723 if (typename
== NULL
)
6726 len
= strlen (typename
);
6728 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
6730 strcpy (name
, typename
);
6731 strcpy (name
+ len
, suffix
);
6733 return ada_find_parallel_type_with_name (type
, name
);
6736 /* If TYPE is a variable-size record type, return the corresponding template
6737 type describing its fields. Otherwise, return NULL. */
6739 static struct type
*
6740 dynamic_template_type (struct type
*type
)
6742 type
= ada_check_typedef (type
);
6744 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6745 || ada_type_name (type
) == NULL
)
6749 int len
= strlen (ada_type_name (type
));
6750 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6753 return ada_find_parallel_type (type
, "___XVE");
6757 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6758 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6761 is_dynamic_field (struct type
*templ_type
, int field_num
)
6763 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6765 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6766 && strstr (name
, "___XVL") != NULL
;
6769 /* The index of the variant field of TYPE, or -1 if TYPE does not
6770 represent a variant record type. */
6773 variant_field_index (struct type
*type
)
6777 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6780 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6782 if (ada_is_variant_part (type
, f
))
6788 /* A record type with no fields. */
6790 static struct type
*
6791 empty_record (struct type
*template)
6793 struct type
*type
= alloc_type_copy (template);
6794 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6795 TYPE_NFIELDS (type
) = 0;
6796 TYPE_FIELDS (type
) = NULL
;
6797 INIT_CPLUS_SPECIFIC (type
);
6798 TYPE_NAME (type
) = "<empty>";
6799 TYPE_TAG_NAME (type
) = NULL
;
6800 TYPE_LENGTH (type
) = 0;
6804 /* An ordinary record type (with fixed-length fields) that describes
6805 the value of type TYPE at VALADDR or ADDRESS (see comments at
6806 the beginning of this section) VAL according to GNAT conventions.
6807 DVAL0 should describe the (portion of a) record that contains any
6808 necessary discriminants. It should be NULL if value_type (VAL) is
6809 an outer-level type (i.e., as opposed to a branch of a variant.) A
6810 variant field (unless unchecked) is replaced by a particular branch
6813 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6814 length are not statically known are discarded. As a consequence,
6815 VALADDR, ADDRESS and DVAL0 are ignored.
6817 NOTE: Limitations: For now, we assume that dynamic fields and
6818 variants occupy whole numbers of bytes. However, they need not be
6822 ada_template_to_fixed_record_type_1 (struct type
*type
,
6823 const gdb_byte
*valaddr
,
6824 CORE_ADDR address
, struct value
*dval0
,
6825 int keep_dynamic_fields
)
6827 struct value
*mark
= value_mark ();
6830 int nfields
, bit_len
;
6833 int fld_bit_len
, bit_incr
;
6836 /* Compute the number of fields in this record type that are going
6837 to be processed: unless keep_dynamic_fields, this includes only
6838 fields whose position and length are static will be processed. */
6839 if (keep_dynamic_fields
)
6840 nfields
= TYPE_NFIELDS (type
);
6844 while (nfields
< TYPE_NFIELDS (type
)
6845 && !ada_is_variant_part (type
, nfields
)
6846 && !is_dynamic_field (type
, nfields
))
6850 rtype
= alloc_type_copy (type
);
6851 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6852 INIT_CPLUS_SPECIFIC (rtype
);
6853 TYPE_NFIELDS (rtype
) = nfields
;
6854 TYPE_FIELDS (rtype
) = (struct field
*)
6855 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6856 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6857 TYPE_NAME (rtype
) = ada_type_name (type
);
6858 TYPE_TAG_NAME (rtype
) = NULL
;
6859 TYPE_FIXED_INSTANCE (rtype
) = 1;
6865 for (f
= 0; f
< nfields
; f
+= 1)
6867 off
= align_value (off
, field_alignment (type
, f
))
6868 + TYPE_FIELD_BITPOS (type
, f
);
6869 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6870 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6872 if (ada_is_variant_part (type
, f
))
6875 fld_bit_len
= bit_incr
= 0;
6877 else if (is_dynamic_field (type
, f
))
6879 const gdb_byte
*field_valaddr
= valaddr
;
6880 CORE_ADDR field_address
= address
;
6881 struct type
*field_type
=
6882 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
6886 /* rtype's length is computed based on the run-time
6887 value of discriminants. If the discriminants are not
6888 initialized, the type size may be completely bogus and
6889 GDB may fail to allocate a value for it. So check the
6890 size first before creating the value. */
6892 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6897 /* If the type referenced by this field is an aligner type, we need
6898 to unwrap that aligner type, because its size might not be set.
6899 Keeping the aligner type would cause us to compute the wrong
6900 size for this field, impacting the offset of the all the fields
6901 that follow this one. */
6902 if (ada_is_aligner_type (field_type
))
6904 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
6906 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
6907 field_address
= cond_offset_target (field_address
, field_offset
);
6908 field_type
= ada_aligned_type (field_type
);
6911 field_valaddr
= cond_offset_host (field_valaddr
,
6912 off
/ TARGET_CHAR_BIT
);
6913 field_address
= cond_offset_target (field_address
,
6914 off
/ TARGET_CHAR_BIT
);
6916 /* Get the fixed type of the field. Note that, in this case,
6917 we do not want to get the real type out of the tag: if
6918 the current field is the parent part of a tagged record,
6919 we will get the tag of the object. Clearly wrong: the real
6920 type of the parent is not the real type of the child. We
6921 would end up in an infinite loop. */
6922 field_type
= ada_get_base_type (field_type
);
6923 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
6924 field_address
, dval
, 0);
6926 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
6927 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6928 bit_incr
= fld_bit_len
=
6929 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6933 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
6935 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
6936 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6937 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6938 bit_incr
= fld_bit_len
=
6939 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6941 bit_incr
= fld_bit_len
=
6942 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
6944 if (off
+ fld_bit_len
> bit_len
)
6945 bit_len
= off
+ fld_bit_len
;
6947 TYPE_LENGTH (rtype
) =
6948 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6951 /* We handle the variant part, if any, at the end because of certain
6952 odd cases in which it is re-ordered so as NOT to be the last field of
6953 the record. This can happen in the presence of representation
6955 if (variant_field
>= 0)
6957 struct type
*branch_type
;
6959 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6962 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6967 to_fixed_variant_branch_type
6968 (TYPE_FIELD_TYPE (type
, variant_field
),
6969 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6970 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6971 if (branch_type
== NULL
)
6973 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6974 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6975 TYPE_NFIELDS (rtype
) -= 1;
6979 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6980 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6982 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6984 if (off
+ fld_bit_len
> bit_len
)
6985 bit_len
= off
+ fld_bit_len
;
6986 TYPE_LENGTH (rtype
) =
6987 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6991 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6992 should contain the alignment of that record, which should be a strictly
6993 positive value. If null or negative, then something is wrong, most
6994 probably in the debug info. In that case, we don't round up the size
6995 of the resulting type. If this record is not part of another structure,
6996 the current RTYPE length might be good enough for our purposes. */
6997 if (TYPE_LENGTH (type
) <= 0)
6999 if (TYPE_NAME (rtype
))
7000 warning (_("Invalid type size for `%s' detected: %d."),
7001 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7003 warning (_("Invalid type size for <unnamed> detected: %d."),
7004 TYPE_LENGTH (type
));
7008 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7009 TYPE_LENGTH (type
));
7012 value_free_to_mark (mark
);
7013 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7014 error (_("record type with dynamic size is larger than varsize-limit"));
7018 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7021 static struct type
*
7022 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7023 CORE_ADDR address
, struct value
*dval0
)
7025 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7029 /* An ordinary record type in which ___XVL-convention fields and
7030 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7031 static approximations, containing all possible fields. Uses
7032 no runtime values. Useless for use in values, but that's OK,
7033 since the results are used only for type determinations. Works on both
7034 structs and unions. Representation note: to save space, we memorize
7035 the result of this function in the TYPE_TARGET_TYPE of the
7038 static struct type
*
7039 template_to_static_fixed_type (struct type
*type0
)
7045 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7046 return TYPE_TARGET_TYPE (type0
);
7048 nfields
= TYPE_NFIELDS (type0
);
7051 for (f
= 0; f
< nfields
; f
+= 1)
7053 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7054 struct type
*new_type
;
7056 if (is_dynamic_field (type0
, f
))
7057 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7059 new_type
= static_unwrap_type (field_type
);
7060 if (type
== type0
&& new_type
!= field_type
)
7062 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7063 TYPE_CODE (type
) = TYPE_CODE (type0
);
7064 INIT_CPLUS_SPECIFIC (type
);
7065 TYPE_NFIELDS (type
) = nfields
;
7066 TYPE_FIELDS (type
) = (struct field
*)
7067 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7068 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7069 sizeof (struct field
) * nfields
);
7070 TYPE_NAME (type
) = ada_type_name (type0
);
7071 TYPE_TAG_NAME (type
) = NULL
;
7072 TYPE_FIXED_INSTANCE (type
) = 1;
7073 TYPE_LENGTH (type
) = 0;
7075 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7076 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7081 /* Given an object of type TYPE whose contents are at VALADDR and
7082 whose address in memory is ADDRESS, returns a revision of TYPE,
7083 which should be a non-dynamic-sized record, in which the variant
7084 part, if any, is replaced with the appropriate branch. Looks
7085 for discriminant values in DVAL0, which can be NULL if the record
7086 contains the necessary discriminant values. */
7088 static struct type
*
7089 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7090 CORE_ADDR address
, struct value
*dval0
)
7092 struct value
*mark
= value_mark ();
7095 struct type
*branch_type
;
7096 int nfields
= TYPE_NFIELDS (type
);
7097 int variant_field
= variant_field_index (type
);
7099 if (variant_field
== -1)
7103 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7107 rtype
= alloc_type_copy (type
);
7108 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7109 INIT_CPLUS_SPECIFIC (rtype
);
7110 TYPE_NFIELDS (rtype
) = nfields
;
7111 TYPE_FIELDS (rtype
) =
7112 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7113 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7114 sizeof (struct field
) * nfields
);
7115 TYPE_NAME (rtype
) = ada_type_name (type
);
7116 TYPE_TAG_NAME (rtype
) = NULL
;
7117 TYPE_FIXED_INSTANCE (rtype
) = 1;
7118 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7120 branch_type
= to_fixed_variant_branch_type
7121 (TYPE_FIELD_TYPE (type
, variant_field
),
7122 cond_offset_host (valaddr
,
7123 TYPE_FIELD_BITPOS (type
, variant_field
)
7125 cond_offset_target (address
,
7126 TYPE_FIELD_BITPOS (type
, variant_field
)
7127 / TARGET_CHAR_BIT
), dval
);
7128 if (branch_type
== NULL
)
7131 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7132 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7133 TYPE_NFIELDS (rtype
) -= 1;
7137 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7138 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7139 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7140 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7142 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7144 value_free_to_mark (mark
);
7148 /* An ordinary record type (with fixed-length fields) that describes
7149 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7150 beginning of this section]. Any necessary discriminants' values
7151 should be in DVAL, a record value; it may be NULL if the object
7152 at ADDR itself contains any necessary discriminant values.
7153 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7154 values from the record are needed. Except in the case that DVAL,
7155 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7156 unchecked) is replaced by a particular branch of the variant.
7158 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7159 is questionable and may be removed. It can arise during the
7160 processing of an unconstrained-array-of-record type where all the
7161 variant branches have exactly the same size. This is because in
7162 such cases, the compiler does not bother to use the XVS convention
7163 when encoding the record. I am currently dubious of this
7164 shortcut and suspect the compiler should be altered. FIXME. */
7166 static struct type
*
7167 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7168 CORE_ADDR address
, struct value
*dval
)
7170 struct type
*templ_type
;
7172 if (TYPE_FIXED_INSTANCE (type0
))
7175 templ_type
= dynamic_template_type (type0
);
7177 if (templ_type
!= NULL
)
7178 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7179 else if (variant_field_index (type0
) >= 0)
7181 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7183 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7188 TYPE_FIXED_INSTANCE (type0
) = 1;
7194 /* An ordinary record type (with fixed-length fields) that describes
7195 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7196 union type. Any necessary discriminants' values should be in DVAL,
7197 a record value. That is, this routine selects the appropriate
7198 branch of the union at ADDR according to the discriminant value
7199 indicated in the union's type name. Returns VAR_TYPE0 itself if
7200 it represents a variant subject to a pragma Unchecked_Union. */
7202 static struct type
*
7203 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7204 CORE_ADDR address
, struct value
*dval
)
7207 struct type
*templ_type
;
7208 struct type
*var_type
;
7210 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7211 var_type
= TYPE_TARGET_TYPE (var_type0
);
7213 var_type
= var_type0
;
7215 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7217 if (templ_type
!= NULL
)
7218 var_type
= templ_type
;
7220 if (is_unchecked_variant (var_type
, value_type (dval
)))
7223 ada_which_variant_applies (var_type
,
7224 value_type (dval
), value_contents (dval
));
7227 return empty_record (var_type
);
7228 else if (is_dynamic_field (var_type
, which
))
7229 return to_fixed_record_type
7230 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7231 valaddr
, address
, dval
);
7232 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7234 to_fixed_record_type
7235 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7237 return TYPE_FIELD_TYPE (var_type
, which
);
7240 /* Assuming that TYPE0 is an array type describing the type of a value
7241 at ADDR, and that DVAL describes a record containing any
7242 discriminants used in TYPE0, returns a type for the value that
7243 contains no dynamic components (that is, no components whose sizes
7244 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7245 true, gives an error message if the resulting type's size is over
7248 static struct type
*
7249 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7252 struct type
*index_type_desc
;
7253 struct type
*result
;
7254 int constrained_packed_array_p
;
7256 if (TYPE_FIXED_INSTANCE (type0
))
7259 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7260 if (constrained_packed_array_p
)
7261 type0
= decode_constrained_packed_array_type (type0
);
7263 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7264 if (index_type_desc
== NULL
)
7266 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7267 /* NOTE: elt_type---the fixed version of elt_type0---should never
7268 depend on the contents of the array in properly constructed
7270 /* Create a fixed version of the array element type.
7271 We're not providing the address of an element here,
7272 and thus the actual object value cannot be inspected to do
7273 the conversion. This should not be a problem, since arrays of
7274 unconstrained objects are not allowed. In particular, all
7275 the elements of an array of a tagged type should all be of
7276 the same type specified in the debugging info. No need to
7277 consult the object tag. */
7278 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7280 /* Make sure we always create a new array type when dealing with
7281 packed array types, since we're going to fix-up the array
7282 type length and element bitsize a little further down. */
7283 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7286 result
= create_array_type (alloc_type_copy (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);
7313 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7315 struct type
*range_type
=
7316 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7317 dval
, TYPE_INDEX_TYPE (elt_type0
));
7318 result
= create_array_type (alloc_type_copy (elt_type0
),
7319 result
, range_type
);
7320 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7322 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7323 error (_("array type with dynamic size is larger than varsize-limit"));
7326 if (constrained_packed_array_p
)
7328 /* So far, the resulting type has been created as if the original
7329 type was a regular (non-packed) array type. As a result, the
7330 bitsize of the array elements needs to be set again, and the array
7331 length needs to be recomputed based on that bitsize. */
7332 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7333 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7335 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7336 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7337 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7338 TYPE_LENGTH (result
)++;
7341 TYPE_FIXED_INSTANCE (result
) = 1;
7346 /* A standard type (containing no dynamically sized components)
7347 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7348 DVAL describes a record containing any discriminants used in TYPE0,
7349 and may be NULL if there are none, or if the object of type TYPE at
7350 ADDRESS or in VALADDR contains these discriminants.
7352 If CHECK_TAG is not null, in the case of tagged types, this function
7353 attempts to locate the object's tag and use it to compute the actual
7354 type. However, when ADDRESS is null, we cannot use it to determine the
7355 location of the tag, and therefore compute the tagged type's actual type.
7356 So we return the tagged type without consulting the tag. */
7358 static struct type
*
7359 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7360 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7362 type
= ada_check_typedef (type
);
7363 switch (TYPE_CODE (type
))
7367 case TYPE_CODE_STRUCT
:
7369 struct type
*static_type
= to_static_fixed_type (type
);
7370 struct type
*fixed_record_type
=
7371 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7372 /* If STATIC_TYPE is a tagged type and we know the object's address,
7373 then we can determine its tag, and compute the object's actual
7374 type from there. Note that we have to use the fixed record
7375 type (the parent part of the record may have dynamic fields
7376 and the way the location of _tag is expressed may depend on
7379 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7381 struct type
*real_type
=
7382 type_from_tag (value_tag_from_contents_and_address
7386 if (real_type
!= NULL
)
7387 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7390 /* Check to see if there is a parallel ___XVZ variable.
7391 If there is, then it provides the actual size of our type. */
7392 else if (ada_type_name (fixed_record_type
) != NULL
)
7394 char *name
= ada_type_name (fixed_record_type
);
7395 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7399 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7400 size
= get_int_var_value (xvz_name
, &xvz_found
);
7401 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7403 fixed_record_type
= copy_type (fixed_record_type
);
7404 TYPE_LENGTH (fixed_record_type
) = size
;
7406 /* The FIXED_RECORD_TYPE may have be a stub. We have
7407 observed this when the debugging info is STABS, and
7408 apparently it is something that is hard to fix.
7410 In practice, we don't need the actual type definition
7411 at all, because the presence of the XVZ variable allows us
7412 to assume that there must be a XVS type as well, which we
7413 should be able to use later, when we need the actual type
7416 In the meantime, pretend that the "fixed" type we are
7417 returning is NOT a stub, because this can cause trouble
7418 when using this type to create new types targeting it.
7419 Indeed, the associated creation routines often check
7420 whether the target type is a stub and will try to replace
7421 it, thus using a type with the wrong size. This, in turn,
7422 might cause the new type to have the wrong size too.
7423 Consider the case of an array, for instance, where the size
7424 of the array is computed from the number of elements in
7425 our array multiplied by the size of its element. */
7426 TYPE_STUB (fixed_record_type
) = 0;
7429 return fixed_record_type
;
7431 case TYPE_CODE_ARRAY
:
7432 return to_fixed_array_type (type
, dval
, 1);
7433 case TYPE_CODE_UNION
:
7437 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7441 /* The same as ada_to_fixed_type_1, except that it preserves the type
7442 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7443 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7446 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7447 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7450 struct type
*fixed_type
=
7451 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7453 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7454 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7460 /* A standard (static-sized) type corresponding as well as possible to
7461 TYPE0, but based on no runtime data. */
7463 static struct type
*
7464 to_static_fixed_type (struct type
*type0
)
7471 if (TYPE_FIXED_INSTANCE (type0
))
7474 type0
= ada_check_typedef (type0
);
7476 switch (TYPE_CODE (type0
))
7480 case TYPE_CODE_STRUCT
:
7481 type
= dynamic_template_type (type0
);
7483 return template_to_static_fixed_type (type
);
7485 return template_to_static_fixed_type (type0
);
7486 case TYPE_CODE_UNION
:
7487 type
= ada_find_parallel_type (type0
, "___XVU");
7489 return template_to_static_fixed_type (type
);
7491 return template_to_static_fixed_type (type0
);
7495 /* A static approximation of TYPE with all type wrappers removed. */
7497 static struct type
*
7498 static_unwrap_type (struct type
*type
)
7500 if (ada_is_aligner_type (type
))
7502 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7503 if (ada_type_name (type1
) == NULL
)
7504 TYPE_NAME (type1
) = ada_type_name (type
);
7506 return static_unwrap_type (type1
);
7510 struct type
*raw_real_type
= ada_get_base_type (type
);
7511 if (raw_real_type
== type
)
7514 return to_static_fixed_type (raw_real_type
);
7518 /* In some cases, incomplete and private types require
7519 cross-references that are not resolved as records (for example,
7521 type FooP is access Foo;
7523 type Foo is array ...;
7524 ). In these cases, since there is no mechanism for producing
7525 cross-references to such types, we instead substitute for FooP a
7526 stub enumeration type that is nowhere resolved, and whose tag is
7527 the name of the actual type. Call these types "non-record stubs". */
7529 /* A type equivalent to TYPE that is not a non-record stub, if one
7530 exists, otherwise TYPE. */
7533 ada_check_typedef (struct type
*type
)
7538 CHECK_TYPEDEF (type
);
7539 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7540 || !TYPE_STUB (type
)
7541 || TYPE_TAG_NAME (type
) == NULL
)
7545 char *name
= TYPE_TAG_NAME (type
);
7546 struct type
*type1
= ada_find_any_type (name
);
7547 return (type1
== NULL
) ? type
: type1
;
7551 /* A value representing the data at VALADDR/ADDRESS as described by
7552 type TYPE0, but with a standard (static-sized) type that correctly
7553 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7554 type, then return VAL0 [this feature is simply to avoid redundant
7555 creation of struct values]. */
7557 static struct value
*
7558 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7561 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7562 if (type
== type0
&& val0
!= NULL
)
7565 return value_from_contents_and_address (type
, 0, address
);
7568 /* A value representing VAL, but with a standard (static-sized) type
7569 that correctly describes it. Does not necessarily create a new
7572 static struct value
*
7573 ada_to_fixed_value (struct value
*val
)
7575 return ada_to_fixed_value_create (value_type (val
),
7576 value_address (val
),
7583 /* Table mapping attribute numbers to names.
7584 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7586 static const char *attribute_names
[] = {
7604 ada_attribute_name (enum exp_opcode n
)
7606 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7607 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7609 return attribute_names
[0];
7612 /* Evaluate the 'POS attribute applied to ARG. */
7615 pos_atr (struct value
*arg
)
7617 struct value
*val
= coerce_ref (arg
);
7618 struct type
*type
= value_type (val
);
7620 if (!discrete_type_p (type
))
7621 error (_("'POS only defined on discrete types"));
7623 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7626 LONGEST v
= value_as_long (val
);
7628 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7630 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7633 error (_("enumeration value is invalid: can't find 'POS"));
7636 return value_as_long (val
);
7639 static struct value
*
7640 value_pos_atr (struct type
*type
, struct value
*arg
)
7642 return value_from_longest (type
, pos_atr (arg
));
7645 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7647 static struct value
*
7648 value_val_atr (struct type
*type
, struct value
*arg
)
7650 if (!discrete_type_p (type
))
7651 error (_("'VAL only defined on discrete types"));
7652 if (!integer_type_p (value_type (arg
)))
7653 error (_("'VAL requires integral argument"));
7655 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7657 long pos
= value_as_long (arg
);
7658 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7659 error (_("argument to 'VAL out of range"));
7660 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7663 return value_from_longest (type
, value_as_long (arg
));
7669 /* True if TYPE appears to be an Ada character type.
7670 [At the moment, this is true only for Character and Wide_Character;
7671 It is a heuristic test that could stand improvement]. */
7674 ada_is_character_type (struct type
*type
)
7678 /* If the type code says it's a character, then assume it really is,
7679 and don't check any further. */
7680 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7683 /* Otherwise, assume it's a character type iff it is a discrete type
7684 with a known character type name. */
7685 name
= ada_type_name (type
);
7686 return (name
!= NULL
7687 && (TYPE_CODE (type
) == TYPE_CODE_INT
7688 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7689 && (strcmp (name
, "character") == 0
7690 || strcmp (name
, "wide_character") == 0
7691 || strcmp (name
, "wide_wide_character") == 0
7692 || strcmp (name
, "unsigned char") == 0));
7695 /* True if TYPE appears to be an Ada string type. */
7698 ada_is_string_type (struct type
*type
)
7700 type
= ada_check_typedef (type
);
7702 && TYPE_CODE (type
) != TYPE_CODE_PTR
7703 && (ada_is_simple_array_type (type
)
7704 || ada_is_array_descriptor_type (type
))
7705 && ada_array_arity (type
) == 1)
7707 struct type
*elttype
= ada_array_element_type (type
, 1);
7709 return ada_is_character_type (elttype
);
7715 /* The compiler sometimes provides a parallel XVS type for a given
7716 PAD type. Normally, it is safe to follow the PAD type directly,
7717 but older versions of the compiler have a bug that causes the offset
7718 of its "F" field to be wrong. Following that field in that case
7719 would lead to incorrect results, but this can be worked around
7720 by ignoring the PAD type and using the associated XVS type instead.
7722 Set to True if the debugger should trust the contents of PAD types.
7723 Otherwise, ignore the PAD type if there is a parallel XVS type. */
7724 static int trust_pad_over_xvs
= 1;
7726 /* True if TYPE is a struct type introduced by the compiler to force the
7727 alignment of a value. Such types have a single field with a
7728 distinctive name. */
7731 ada_is_aligner_type (struct type
*type
)
7733 type
= ada_check_typedef (type
);
7735 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
7738 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7739 && TYPE_NFIELDS (type
) == 1
7740 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7743 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7744 the parallel type. */
7747 ada_get_base_type (struct type
*raw_type
)
7749 struct type
*real_type_namer
;
7750 struct type
*raw_real_type
;
7752 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7755 if (ada_is_aligner_type (raw_type
))
7756 /* The encoding specifies that we should always use the aligner type.
7757 So, even if this aligner type has an associated XVS type, we should
7760 According to the compiler gurus, an XVS type parallel to an aligner
7761 type may exist because of a stabs limitation. In stabs, aligner
7762 types are empty because the field has a variable-sized type, and
7763 thus cannot actually be used as an aligner type. As a result,
7764 we need the associated parallel XVS type to decode the type.
7765 Since the policy in the compiler is to not change the internal
7766 representation based on the debugging info format, we sometimes
7767 end up having a redundant XVS type parallel to the aligner type. */
7770 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7771 if (real_type_namer
== NULL
7772 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7773 || TYPE_NFIELDS (real_type_namer
) != 1)
7776 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
7778 /* This is an older encoding form where the base type needs to be
7779 looked up by name. We prefer the newer enconding because it is
7781 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7782 if (raw_real_type
== NULL
)
7785 return raw_real_type
;
7788 /* The field in our XVS type is a reference to the base type. */
7789 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
7792 /* The type of value designated by TYPE, with all aligners removed. */
7795 ada_aligned_type (struct type
*type
)
7797 if (ada_is_aligner_type (type
))
7798 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7800 return ada_get_base_type (type
);
7804 /* The address of the aligned value in an object at address VALADDR
7805 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7808 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7810 if (ada_is_aligner_type (type
))
7811 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7813 TYPE_FIELD_BITPOS (type
,
7814 0) / TARGET_CHAR_BIT
);
7821 /* The printed representation of an enumeration literal with encoded
7822 name NAME. The value is good to the next call of ada_enum_name. */
7824 ada_enum_name (const char *name
)
7826 static char *result
;
7827 static size_t result_len
= 0;
7830 /* First, unqualify the enumeration name:
7831 1. Search for the last '.' character. If we find one, then skip
7832 all the preceeding characters, the unqualified name starts
7833 right after that dot.
7834 2. Otherwise, we may be debugging on a target where the compiler
7835 translates dots into "__". Search forward for double underscores,
7836 but stop searching when we hit an overloading suffix, which is
7837 of the form "__" followed by digits. */
7839 tmp
= strrchr (name
, '.');
7844 while ((tmp
= strstr (name
, "__")) != NULL
)
7846 if (isdigit (tmp
[2]))
7856 if (name
[1] == 'U' || name
[1] == 'W')
7858 if (sscanf (name
+ 2, "%x", &v
) != 1)
7864 GROW_VECT (result
, result_len
, 16);
7865 if (isascii (v
) && isprint (v
))
7866 xsnprintf (result
, result_len
, "'%c'", v
);
7867 else if (name
[1] == 'U')
7868 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
7870 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
7876 tmp
= strstr (name
, "__");
7878 tmp
= strstr (name
, "$");
7881 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7882 strncpy (result
, name
, tmp
- name
);
7883 result
[tmp
- name
] = '\0';
7891 /* Evaluate the subexpression of EXP starting at *POS as for
7892 evaluate_type, updating *POS to point just past the evaluated
7895 static struct value
*
7896 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7898 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7901 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7904 static struct value
*
7905 unwrap_value (struct value
*val
)
7907 struct type
*type
= ada_check_typedef (value_type (val
));
7908 if (ada_is_aligner_type (type
))
7910 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7911 struct type
*val_type
= ada_check_typedef (value_type (v
));
7912 if (ada_type_name (val_type
) == NULL
)
7913 TYPE_NAME (val_type
) = ada_type_name (type
);
7915 return unwrap_value (v
);
7919 struct type
*raw_real_type
=
7920 ada_check_typedef (ada_get_base_type (type
));
7922 /* If there is no parallel XVS or XVE type, then the value is
7923 already unwrapped. Return it without further modification. */
7924 if ((type
== raw_real_type
)
7925 && ada_find_parallel_type (type
, "___XVE") == NULL
)
7929 coerce_unspec_val_to_type
7930 (val
, ada_to_fixed_type (raw_real_type
, 0,
7931 value_address (val
),
7936 static struct value
*
7937 cast_to_fixed (struct type
*type
, struct value
*arg
)
7941 if (type
== value_type (arg
))
7943 else if (ada_is_fixed_point_type (value_type (arg
)))
7944 val
= ada_float_to_fixed (type
,
7945 ada_fixed_to_float (value_type (arg
),
7946 value_as_long (arg
)));
7949 DOUBLEST argd
= value_as_double (arg
);
7950 val
= ada_float_to_fixed (type
, argd
);
7953 return value_from_longest (type
, val
);
7956 static struct value
*
7957 cast_from_fixed (struct type
*type
, struct value
*arg
)
7959 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7960 value_as_long (arg
));
7961 return value_from_double (type
, val
);
7964 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7965 return the converted value. */
7967 static struct value
*
7968 coerce_for_assign (struct type
*type
, struct value
*val
)
7970 struct type
*type2
= value_type (val
);
7974 type2
= ada_check_typedef (type2
);
7975 type
= ada_check_typedef (type
);
7977 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7978 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7980 val
= ada_value_ind (val
);
7981 type2
= value_type (val
);
7984 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7985 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7987 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7988 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7989 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7990 error (_("Incompatible types in assignment"));
7991 deprecated_set_value_type (val
, type
);
7996 static struct value
*
7997 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8000 struct type
*type1
, *type2
;
8003 arg1
= coerce_ref (arg1
);
8004 arg2
= coerce_ref (arg2
);
8005 type1
= base_type (ada_check_typedef (value_type (arg1
)));
8006 type2
= base_type (ada_check_typedef (value_type (arg2
)));
8008 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8009 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8010 return value_binop (arg1
, arg2
, op
);
8019 return value_binop (arg1
, arg2
, op
);
8022 v2
= value_as_long (arg2
);
8024 error (_("second operand of %s must not be zero."), op_string (op
));
8026 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8027 return value_binop (arg1
, arg2
, op
);
8029 v1
= value_as_long (arg1
);
8034 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8035 v
+= v
> 0 ? -1 : 1;
8043 /* Should not reach this point. */
8047 val
= allocate_value (type1
);
8048 store_unsigned_integer (value_contents_raw (val
),
8049 TYPE_LENGTH (value_type (val
)),
8050 gdbarch_byte_order (get_type_arch (type1
)), v
);
8055 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8057 if (ada_is_direct_array_type (value_type (arg1
))
8058 || ada_is_direct_array_type (value_type (arg2
)))
8060 /* Automatically dereference any array reference before
8061 we attempt to perform the comparison. */
8062 arg1
= ada_coerce_ref (arg1
);
8063 arg2
= ada_coerce_ref (arg2
);
8065 arg1
= ada_coerce_to_simple_array (arg1
);
8066 arg2
= ada_coerce_to_simple_array (arg2
);
8067 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8068 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8069 error (_("Attempt to compare array with non-array"));
8070 /* FIXME: The following works only for types whose
8071 representations use all bits (no padding or undefined bits)
8072 and do not have user-defined equality. */
8074 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8075 && memcmp (value_contents (arg1
), value_contents (arg2
),
8076 TYPE_LENGTH (value_type (arg1
))) == 0;
8078 return value_equal (arg1
, arg2
);
8081 /* Total number of component associations in the aggregate starting at
8082 index PC in EXP. Assumes that index PC is the start of an
8086 num_component_specs (struct expression
*exp
, int pc
)
8089 m
= exp
->elts
[pc
+ 1].longconst
;
8092 for (i
= 0; i
< m
; i
+= 1)
8094 switch (exp
->elts
[pc
].opcode
)
8100 n
+= exp
->elts
[pc
+ 1].longconst
;
8103 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8108 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8109 component of LHS (a simple array or a record), updating *POS past
8110 the expression, assuming that LHS is contained in CONTAINER. Does
8111 not modify the inferior's memory, nor does it modify LHS (unless
8112 LHS == CONTAINER). */
8115 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8116 struct expression
*exp
, int *pos
)
8118 struct value
*mark
= value_mark ();
8120 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8122 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8123 struct value
*index_val
= value_from_longest (index_type
, index
);
8124 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8128 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8129 elt
= ada_to_fixed_value (unwrap_value (elt
));
8132 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8133 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8135 value_assign_to_component (container
, elt
,
8136 ada_evaluate_subexp (NULL
, exp
, pos
,
8139 value_free_to_mark (mark
);
8142 /* Assuming that LHS represents an lvalue having a record or array
8143 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8144 of that aggregate's value to LHS, advancing *POS past the
8145 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8146 lvalue containing LHS (possibly LHS itself). Does not modify
8147 the inferior's memory, nor does it modify the contents of
8148 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8150 static struct value
*
8151 assign_aggregate (struct value
*container
,
8152 struct value
*lhs
, struct expression
*exp
,
8153 int *pos
, enum noside noside
)
8155 struct type
*lhs_type
;
8156 int n
= exp
->elts
[*pos
+1].longconst
;
8157 LONGEST low_index
, high_index
;
8160 int max_indices
, num_indices
;
8161 int is_array_aggregate
;
8163 struct value
*mark
= value_mark ();
8166 if (noside
!= EVAL_NORMAL
)
8169 for (i
= 0; i
< n
; i
+= 1)
8170 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8174 container
= ada_coerce_ref (container
);
8175 if (ada_is_direct_array_type (value_type (container
)))
8176 container
= ada_coerce_to_simple_array (container
);
8177 lhs
= ada_coerce_ref (lhs
);
8178 if (!deprecated_value_modifiable (lhs
))
8179 error (_("Left operand of assignment is not a modifiable lvalue."));
8181 lhs_type
= value_type (lhs
);
8182 if (ada_is_direct_array_type (lhs_type
))
8184 lhs
= ada_coerce_to_simple_array (lhs
);
8185 lhs_type
= value_type (lhs
);
8186 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8187 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8188 is_array_aggregate
= 1;
8190 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8193 high_index
= num_visible_fields (lhs_type
) - 1;
8194 is_array_aggregate
= 0;
8197 error (_("Left-hand side must be array or record."));
8199 num_specs
= num_component_specs (exp
, *pos
- 3);
8200 max_indices
= 4 * num_specs
+ 4;
8201 indices
= alloca (max_indices
* sizeof (indices
[0]));
8202 indices
[0] = indices
[1] = low_index
- 1;
8203 indices
[2] = indices
[3] = high_index
+ 1;
8206 for (i
= 0; i
< n
; i
+= 1)
8208 switch (exp
->elts
[*pos
].opcode
)
8211 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8212 &num_indices
, max_indices
,
8213 low_index
, high_index
);
8216 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8217 &num_indices
, max_indices
,
8218 low_index
, high_index
);
8222 error (_("Misplaced 'others' clause"));
8223 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8224 num_indices
, low_index
, high_index
);
8227 error (_("Internal error: bad aggregate clause"));
8234 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8235 construct at *POS, updating *POS past the construct, given that
8236 the positions are relative to lower bound LOW, where HIGH is the
8237 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8238 updating *NUM_INDICES as needed. CONTAINER is as for
8239 assign_aggregate. */
8241 aggregate_assign_positional (struct value
*container
,
8242 struct value
*lhs
, struct expression
*exp
,
8243 int *pos
, LONGEST
*indices
, int *num_indices
,
8244 int max_indices
, LONGEST low
, LONGEST high
)
8246 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8248 if (ind
- 1 == high
)
8249 warning (_("Extra components in aggregate ignored."));
8252 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8254 assign_component (container
, lhs
, ind
, exp
, pos
);
8257 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8260 /* Assign into the components of LHS indexed by the OP_CHOICES
8261 construct at *POS, updating *POS past the construct, given that
8262 the allowable indices are LOW..HIGH. Record the indices assigned
8263 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8264 needed. CONTAINER is as for assign_aggregate. */
8266 aggregate_assign_from_choices (struct value
*container
,
8267 struct value
*lhs
, struct expression
*exp
,
8268 int *pos
, LONGEST
*indices
, int *num_indices
,
8269 int max_indices
, LONGEST low
, LONGEST high
)
8272 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8273 int choice_pos
, expr_pc
;
8274 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8276 choice_pos
= *pos
+= 3;
8278 for (j
= 0; j
< n_choices
; j
+= 1)
8279 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8281 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8283 for (j
= 0; j
< n_choices
; j
+= 1)
8285 LONGEST lower
, upper
;
8286 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8287 if (op
== OP_DISCRETE_RANGE
)
8290 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8292 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8297 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8308 name
= &exp
->elts
[choice_pos
+ 2].string
;
8311 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8314 error (_("Invalid record component association."));
8316 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8318 if (! find_struct_field (name
, value_type (lhs
), 0,
8319 NULL
, NULL
, NULL
, NULL
, &ind
))
8320 error (_("Unknown component name: %s."), name
);
8321 lower
= upper
= ind
;
8324 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8325 error (_("Index in component association out of bounds."));
8327 add_component_interval (lower
, upper
, indices
, num_indices
,
8329 while (lower
<= upper
)
8333 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8339 /* Assign the value of the expression in the OP_OTHERS construct in
8340 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8341 have not been previously assigned. The index intervals already assigned
8342 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8343 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8345 aggregate_assign_others (struct value
*container
,
8346 struct value
*lhs
, struct expression
*exp
,
8347 int *pos
, LONGEST
*indices
, int num_indices
,
8348 LONGEST low
, LONGEST high
)
8351 int expr_pc
= *pos
+1;
8353 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8356 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8360 assign_component (container
, lhs
, ind
, exp
, &pos
);
8363 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8366 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8367 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8368 modifying *SIZE as needed. It is an error if *SIZE exceeds
8369 MAX_SIZE. The resulting intervals do not overlap. */
8371 add_component_interval (LONGEST low
, LONGEST high
,
8372 LONGEST
* indices
, int *size
, int max_size
)
8375 for (i
= 0; i
< *size
; i
+= 2) {
8376 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8379 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8380 if (high
< indices
[kh
])
8382 if (low
< indices
[i
])
8384 indices
[i
+ 1] = indices
[kh
- 1];
8385 if (high
> indices
[i
+ 1])
8386 indices
[i
+ 1] = high
;
8387 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8388 *size
-= kh
- i
- 2;
8391 else if (high
< indices
[i
])
8395 if (*size
== max_size
)
8396 error (_("Internal error: miscounted aggregate components."));
8398 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8399 indices
[j
] = indices
[j
- 2];
8401 indices
[i
+ 1] = high
;
8404 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8407 static struct value
*
8408 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8410 if (type
== ada_check_typedef (value_type (arg2
)))
8413 if (ada_is_fixed_point_type (type
))
8414 return (cast_to_fixed (type
, arg2
));
8416 if (ada_is_fixed_point_type (value_type (arg2
)))
8417 return cast_from_fixed (type
, arg2
);
8419 return value_cast (type
, arg2
);
8422 /* Evaluating Ada expressions, and printing their result.
8423 ------------------------------------------------------
8428 We usually evaluate an Ada expression in order to print its value.
8429 We also evaluate an expression in order to print its type, which
8430 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8431 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8432 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8433 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8436 Evaluating expressions is a little more complicated for Ada entities
8437 than it is for entities in languages such as C. The main reason for
8438 this is that Ada provides types whose definition might be dynamic.
8439 One example of such types is variant records. Or another example
8440 would be an array whose bounds can only be known at run time.
8442 The following description is a general guide as to what should be
8443 done (and what should NOT be done) in order to evaluate an expression
8444 involving such types, and when. This does not cover how the semantic
8445 information is encoded by GNAT as this is covered separatly. For the
8446 document used as the reference for the GNAT encoding, see exp_dbug.ads
8447 in the GNAT sources.
8449 Ideally, we should embed each part of this description next to its
8450 associated code. Unfortunately, the amount of code is so vast right
8451 now that it's hard to see whether the code handling a particular
8452 situation might be duplicated or not. One day, when the code is
8453 cleaned up, this guide might become redundant with the comments
8454 inserted in the code, and we might want to remove it.
8456 2. ``Fixing'' an Entity, the Simple Case:
8457 -----------------------------------------
8459 When evaluating Ada expressions, the tricky issue is that they may
8460 reference entities whose type contents and size are not statically
8461 known. Consider for instance a variant record:
8463 type Rec (Empty : Boolean := True) is record
8466 when False => Value : Integer;
8469 Yes : Rec := (Empty => False, Value => 1);
8470 No : Rec := (empty => True);
8472 The size and contents of that record depends on the value of the
8473 descriminant (Rec.Empty). At this point, neither the debugging
8474 information nor the associated type structure in GDB are able to
8475 express such dynamic types. So what the debugger does is to create
8476 "fixed" versions of the type that applies to the specific object.
8477 We also informally refer to this opperation as "fixing" an object,
8478 which means creating its associated fixed type.
8480 Example: when printing the value of variable "Yes" above, its fixed
8481 type would look like this:
8488 On the other hand, if we printed the value of "No", its fixed type
8495 Things become a little more complicated when trying to fix an entity
8496 with a dynamic type that directly contains another dynamic type,
8497 such as an array of variant records, for instance. There are
8498 two possible cases: Arrays, and records.
8500 3. ``Fixing'' Arrays:
8501 ---------------------
8503 The type structure in GDB describes an array in terms of its bounds,
8504 and the type of its elements. By design, all elements in the array
8505 have the same type and we cannot represent an array of variant elements
8506 using the current type structure in GDB. When fixing an array,
8507 we cannot fix the array element, as we would potentially need one
8508 fixed type per element of the array. As a result, the best we can do
8509 when fixing an array is to produce an array whose bounds and size
8510 are correct (allowing us to read it from memory), but without having
8511 touched its element type. Fixing each element will be done later,
8512 when (if) necessary.
8514 Arrays are a little simpler to handle than records, because the same
8515 amount of memory is allocated for each element of the array, even if
8516 the amount of space actually used by each element differs from element
8517 to element. Consider for instance the following array of type Rec:
8519 type Rec_Array is array (1 .. 2) of Rec;
8521 The actual amount of memory occupied by each element might be different
8522 from element to element, depending on the value of their discriminant.
8523 But the amount of space reserved for each element in the array remains
8524 fixed regardless. So we simply need to compute that size using
8525 the debugging information available, from which we can then determine
8526 the array size (we multiply the number of elements of the array by
8527 the size of each element).
8529 The simplest case is when we have an array of a constrained element
8530 type. For instance, consider the following type declarations:
8532 type Bounded_String (Max_Size : Integer) is
8534 Buffer : String (1 .. Max_Size);
8536 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
8538 In this case, the compiler describes the array as an array of
8539 variable-size elements (identified by its XVS suffix) for which
8540 the size can be read in the parallel XVZ variable.
8542 In the case of an array of an unconstrained element type, the compiler
8543 wraps the array element inside a private PAD type. This type should not
8544 be shown to the user, and must be "unwrap"'ed before printing. Note
8545 that we also use the adjective "aligner" in our code to designate
8546 these wrapper types.
8548 In some cases, the size allocated for each element is statically
8549 known. In that case, the PAD type already has the correct size,
8550 and the array element should remain unfixed.
8552 But there are cases when this size is not statically known.
8553 For instance, assuming that "Five" is an integer variable:
8555 type Dynamic is array (1 .. Five) of Integer;
8556 type Wrapper (Has_Length : Boolean := False) is record
8559 when True => Length : Integer;
8563 type Wrapper_Array is array (1 .. 2) of Wrapper;
8565 Hello : Wrapper_Array := (others => (Has_Length => True,
8566 Data => (others => 17),
8570 The debugging info would describe variable Hello as being an
8571 array of a PAD type. The size of that PAD type is not statically
8572 known, but can be determined using a parallel XVZ variable.
8573 In that case, a copy of the PAD type with the correct size should
8574 be used for the fixed array.
8576 3. ``Fixing'' record type objects:
8577 ----------------------------------
8579 Things are slightly different from arrays in the case of dynamic
8580 record types. In this case, in order to compute the associated
8581 fixed type, we need to determine the size and offset of each of
8582 its components. This, in turn, requires us to compute the fixed
8583 type of each of these components.
8585 Consider for instance the example:
8587 type Bounded_String (Max_Size : Natural) is record
8588 Str : String (1 .. Max_Size);
8591 My_String : Bounded_String (Max_Size => 10);
8593 In that case, the position of field "Length" depends on the size
8594 of field Str, which itself depends on the value of the Max_Size
8595 discriminant. In order to fix the type of variable My_String,
8596 we need to fix the type of field Str. Therefore, fixing a variant
8597 record requires us to fix each of its components.
8599 However, if a component does not have a dynamic size, the component
8600 should not be fixed. In particular, fields that use a PAD type
8601 should not fixed. Here is an example where this might happen
8602 (assuming type Rec above):
8604 type Container (Big : Boolean) is record
8608 when True => Another : Integer;
8612 My_Container : Container := (Big => False,
8613 First => (Empty => True),
8616 In that example, the compiler creates a PAD type for component First,
8617 whose size is constant, and then positions the component After just
8618 right after it. The offset of component After is therefore constant
8621 The debugger computes the position of each field based on an algorithm
8622 that uses, among other things, the actual position and size of the field
8623 preceding it. Let's now imagine that the user is trying to print
8624 the value of My_Container. If the type fixing was recursive, we would
8625 end up computing the offset of field After based on the size of the
8626 fixed version of field First. And since in our example First has
8627 only one actual field, the size of the fixed type is actually smaller
8628 than the amount of space allocated to that field, and thus we would
8629 compute the wrong offset of field After.
8631 To make things more complicated, we need to watch out for dynamic
8632 components of variant records (identified by the ___XVL suffix in
8633 the component name). Even if the target type is a PAD type, the size
8634 of that type might not be statically known. So the PAD type needs
8635 to be unwrapped and the resulting type needs to be fixed. Otherwise,
8636 we might end up with the wrong size for our component. This can be
8637 observed with the following type declarations:
8639 type Octal is new Integer range 0 .. 7;
8640 type Octal_Array is array (Positive range <>) of Octal;
8641 pragma Pack (Octal_Array);
8643 type Octal_Buffer (Size : Positive) is record
8644 Buffer : Octal_Array (1 .. Size);
8648 In that case, Buffer is a PAD type whose size is unset and needs
8649 to be computed by fixing the unwrapped type.
8651 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
8652 ----------------------------------------------------------
8654 Lastly, when should the sub-elements of an entity that remained unfixed
8655 thus far, be actually fixed?
8657 The answer is: Only when referencing that element. For instance
8658 when selecting one component of a record, this specific component
8659 should be fixed at that point in time. Or when printing the value
8660 of a record, each component should be fixed before its value gets
8661 printed. Similarly for arrays, the element of the array should be
8662 fixed when printing each element of the array, or when extracting
8663 one element out of that array. On the other hand, fixing should
8664 not be performed on the elements when taking a slice of an array!
8666 Note that one of the side-effects of miscomputing the offset and
8667 size of each field is that we end up also miscomputing the size
8668 of the containing type. This can have adverse results when computing
8669 the value of an entity. GDB fetches the value of an entity based
8670 on the size of its type, and thus a wrong size causes GDB to fetch
8671 the wrong amount of memory. In the case where the computed size is
8672 too small, GDB fetches too little data to print the value of our
8673 entiry. Results in this case as unpredicatble, as we usually read
8674 past the buffer containing the data =:-o. */
8676 /* Implement the evaluate_exp routine in the exp_descriptor structure
8677 for the Ada language. */
8679 static struct value
*
8680 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8681 int *pos
, enum noside noside
)
8684 int tem
, tem2
, tem3
;
8686 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8689 struct value
**argvec
;
8693 op
= exp
->elts
[pc
].opcode
;
8699 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8700 arg1
= unwrap_value (arg1
);
8702 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8703 then we need to perform the conversion manually, because
8704 evaluate_subexp_standard doesn't do it. This conversion is
8705 necessary in Ada because the different kinds of float/fixed
8706 types in Ada have different representations.
8708 Similarly, we need to perform the conversion from OP_LONG
8710 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8711 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8717 struct value
*result
;
8719 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8720 /* The result type will have code OP_STRING, bashed there from
8721 OP_ARRAY. Bash it back. */
8722 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8723 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8729 type
= exp
->elts
[pc
+ 1].type
;
8730 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8731 if (noside
== EVAL_SKIP
)
8733 arg1
= ada_value_cast (type
, arg1
, noside
);
8738 type
= exp
->elts
[pc
+ 1].type
;
8739 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8742 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8743 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8745 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8746 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8748 return ada_value_assign (arg1
, arg1
);
8750 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8751 except if the lhs of our assignment is a convenience variable.
8752 In the case of assigning to a convenience variable, the lhs
8753 should be exactly the result of the evaluation of the rhs. */
8754 type
= value_type (arg1
);
8755 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8757 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8758 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8760 if (ada_is_fixed_point_type (value_type (arg1
)))
8761 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8762 else if (ada_is_fixed_point_type (value_type (arg2
)))
8764 (_("Fixed-point values must be assigned to fixed-point variables"));
8766 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8767 return ada_value_assign (arg1
, arg2
);
8770 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8771 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8772 if (noside
== EVAL_SKIP
)
8774 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8775 return (value_from_longest
8777 value_as_long (arg1
) + value_as_long (arg2
)));
8778 if ((ada_is_fixed_point_type (value_type (arg1
))
8779 || ada_is_fixed_point_type (value_type (arg2
)))
8780 && value_type (arg1
) != value_type (arg2
))
8781 error (_("Operands of fixed-point addition must have the same type"));
8782 /* Do the addition, and cast the result to the type of the first
8783 argument. We cannot cast the result to a reference type, so if
8784 ARG1 is a reference type, find its underlying type. */
8785 type
= value_type (arg1
);
8786 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8787 type
= TYPE_TARGET_TYPE (type
);
8788 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8789 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8792 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8793 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8794 if (noside
== EVAL_SKIP
)
8796 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8797 return (value_from_longest
8799 value_as_long (arg1
) - value_as_long (arg2
)));
8800 if ((ada_is_fixed_point_type (value_type (arg1
))
8801 || ada_is_fixed_point_type (value_type (arg2
)))
8802 && value_type (arg1
) != value_type (arg2
))
8803 error (_("Operands of fixed-point subtraction must have the same type"));
8804 /* Do the substraction, and cast the result to the type of the first
8805 argument. We cannot cast the result to a reference type, so if
8806 ARG1 is a reference type, find its underlying type. */
8807 type
= value_type (arg1
);
8808 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8809 type
= TYPE_TARGET_TYPE (type
);
8810 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8811 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8817 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8818 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8819 if (noside
== EVAL_SKIP
)
8821 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8823 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8824 return value_zero (value_type (arg1
), not_lval
);
8828 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8829 if (ada_is_fixed_point_type (value_type (arg1
)))
8830 arg1
= cast_from_fixed (type
, arg1
);
8831 if (ada_is_fixed_point_type (value_type (arg2
)))
8832 arg2
= cast_from_fixed (type
, arg2
);
8833 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8834 return ada_value_binop (arg1
, arg2
, op
);
8838 case BINOP_NOTEQUAL
:
8839 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8840 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8841 if (noside
== EVAL_SKIP
)
8843 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8847 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8848 tem
= ada_value_equal (arg1
, arg2
);
8850 if (op
== BINOP_NOTEQUAL
)
8852 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8853 return value_from_longest (type
, (LONGEST
) tem
);
8856 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8857 if (noside
== EVAL_SKIP
)
8859 else if (ada_is_fixed_point_type (value_type (arg1
)))
8860 return value_cast (value_type (arg1
), value_neg (arg1
));
8863 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8864 return value_neg (arg1
);
8867 case BINOP_LOGICAL_AND
:
8868 case BINOP_LOGICAL_OR
:
8869 case UNOP_LOGICAL_NOT
:
8874 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8875 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8876 return value_cast (type
, val
);
8879 case BINOP_BITWISE_AND
:
8880 case BINOP_BITWISE_IOR
:
8881 case BINOP_BITWISE_XOR
:
8885 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8887 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8889 return value_cast (value_type (arg1
), val
);
8895 if (noside
== EVAL_SKIP
)
8900 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8901 /* Only encountered when an unresolved symbol occurs in a
8902 context other than a function call, in which case, it is
8904 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8905 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8906 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8908 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8909 /* Check to see if this is a tagged type. We also need to handle
8910 the case where the type is a reference to a tagged type, but
8911 we have to be careful to exclude pointers to tagged types.
8912 The latter should be shown as usual (as a pointer), whereas
8913 a reference should mostly be transparent to the user. */
8914 if (ada_is_tagged_type (type
, 0)
8915 || (TYPE_CODE(type
) == TYPE_CODE_REF
8916 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
8918 /* Tagged types are a little special in the fact that the real
8919 type is dynamic and can only be determined by inspecting the
8920 object's tag. This means that we need to get the object's
8921 value first (EVAL_NORMAL) and then extract the actual object
8924 Note that we cannot skip the final step where we extract
8925 the object type from its tag, because the EVAL_NORMAL phase
8926 results in dynamic components being resolved into fixed ones.
8927 This can cause problems when trying to print the type
8928 description of tagged types whose parent has a dynamic size:
8929 We use the type name of the "_parent" component in order
8930 to print the name of the ancestor type in the type description.
8931 If that component had a dynamic size, the resolution into
8932 a fixed type would result in the loss of that type name,
8933 thus preventing us from printing the name of the ancestor
8934 type in the type description. */
8935 struct type
*actual_type
;
8937 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8938 actual_type
= type_from_tag (ada_value_tag (arg1
));
8939 if (actual_type
== NULL
)
8940 /* If, for some reason, we were unable to determine
8941 the actual type from the tag, then use the static
8942 approximation that we just computed as a fallback.
8943 This can happen if the debugging information is
8944 incomplete, for instance. */
8947 return value_zero (actual_type
, not_lval
);
8952 (to_static_fixed_type
8953 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8958 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8959 arg1
= unwrap_value (arg1
);
8960 return ada_to_fixed_value (arg1
);
8966 /* Allocate arg vector, including space for the function to be
8967 called in argvec[0] and a terminating NULL. */
8968 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8970 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8972 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8973 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8974 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8975 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8978 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8979 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8982 if (noside
== EVAL_SKIP
)
8986 if (ada_is_constrained_packed_array_type
8987 (desc_base_type (value_type (argvec
[0]))))
8988 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8989 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8990 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
8991 /* This is a packed array that has already been fixed, and
8992 therefore already coerced to a simple array. Nothing further
8995 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8996 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8997 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8998 argvec
[0] = value_addr (argvec
[0]);
9000 type
= ada_check_typedef (value_type (argvec
[0]));
9001 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
9003 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
9005 case TYPE_CODE_FUNC
:
9006 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9008 case TYPE_CODE_ARRAY
:
9010 case TYPE_CODE_STRUCT
:
9011 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
9012 argvec
[0] = ada_value_ind (argvec
[0]);
9013 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9016 error (_("cannot subscript or call something of type `%s'"),
9017 ada_type_name (value_type (argvec
[0])));
9022 switch (TYPE_CODE (type
))
9024 case TYPE_CODE_FUNC
:
9025 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9026 return allocate_value (TYPE_TARGET_TYPE (type
));
9027 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
9028 case TYPE_CODE_STRUCT
:
9032 arity
= ada_array_arity (type
);
9033 type
= ada_array_element_type (type
, nargs
);
9035 error (_("cannot subscript or call a record"));
9037 error (_("wrong number of subscripts; expecting %d"), arity
);
9038 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9039 return value_zero (ada_aligned_type (type
), lval_memory
);
9041 unwrap_value (ada_value_subscript
9042 (argvec
[0], nargs
, argvec
+ 1));
9044 case TYPE_CODE_ARRAY
:
9045 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9047 type
= ada_array_element_type (type
, nargs
);
9049 error (_("element type of array unknown"));
9051 return value_zero (ada_aligned_type (type
), lval_memory
);
9054 unwrap_value (ada_value_subscript
9055 (ada_coerce_to_simple_array (argvec
[0]),
9056 nargs
, argvec
+ 1));
9057 case TYPE_CODE_PTR
: /* Pointer to array */
9058 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
9059 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9061 type
= ada_array_element_type (type
, nargs
);
9063 error (_("element type of array unknown"));
9065 return value_zero (ada_aligned_type (type
), lval_memory
);
9068 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
9069 nargs
, argvec
+ 1));
9072 error (_("Attempt to index or call something other than an "
9073 "array or function"));
9078 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9079 struct value
*low_bound_val
=
9080 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9081 struct value
*high_bound_val
=
9082 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9085 low_bound_val
= coerce_ref (low_bound_val
);
9086 high_bound_val
= coerce_ref (high_bound_val
);
9087 low_bound
= pos_atr (low_bound_val
);
9088 high_bound
= pos_atr (high_bound_val
);
9090 if (noside
== EVAL_SKIP
)
9093 /* If this is a reference to an aligner type, then remove all
9095 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9096 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9097 TYPE_TARGET_TYPE (value_type (array
)) =
9098 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9100 if (ada_is_constrained_packed_array_type (value_type (array
)))
9101 error (_("cannot slice a packed array"));
9103 /* If this is a reference to an array or an array lvalue,
9104 convert to a pointer. */
9105 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9106 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
9107 && VALUE_LVAL (array
) == lval_memory
))
9108 array
= value_addr (array
);
9110 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9111 && ada_is_array_descriptor_type (ada_check_typedef
9112 (value_type (array
))))
9113 return empty_array (ada_type_of_array (array
, 0), low_bound
);
9115 array
= ada_coerce_to_simple_array_ptr (array
);
9117 /* If we have more than one level of pointer indirection,
9118 dereference the value until we get only one level. */
9119 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9120 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9122 array
= value_ind (array
);
9124 /* Make sure we really do have an array type before going further,
9125 to avoid a SEGV when trying to get the index type or the target
9126 type later down the road if the debug info generated by
9127 the compiler is incorrect or incomplete. */
9128 if (!ada_is_simple_array_type (value_type (array
)))
9129 error (_("cannot take slice of non-array"));
9131 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
9133 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9134 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
9138 struct type
*arr_type0
=
9139 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
9141 return ada_value_slice_from_ptr (array
, arr_type0
,
9142 longest_to_int (low_bound
),
9143 longest_to_int (high_bound
));
9146 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9148 else if (high_bound
< low_bound
)
9149 return empty_array (value_type (array
), low_bound
);
9151 return ada_value_slice (array
, longest_to_int (low_bound
),
9152 longest_to_int (high_bound
));
9157 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9158 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9160 if (noside
== EVAL_SKIP
)
9163 switch (TYPE_CODE (type
))
9166 lim_warning (_("Membership test incompletely implemented; "
9167 "always returns true"));
9168 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9169 return value_from_longest (type
, (LONGEST
) 1);
9171 case TYPE_CODE_RANGE
:
9172 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9173 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9174 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9175 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9176 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9178 value_from_longest (type
,
9179 (value_less (arg1
, arg3
)
9180 || value_equal (arg1
, arg3
))
9181 && (value_less (arg2
, arg1
)
9182 || value_equal (arg2
, arg1
)));
9185 case BINOP_IN_BOUNDS
:
9187 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9188 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9190 if (noside
== EVAL_SKIP
)
9193 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9195 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9196 return value_zero (type
, not_lval
);
9199 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9201 type
= ada_index_type (value_type (arg2
), tem
, "range");
9203 type
= value_type (arg1
);
9205 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9206 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9208 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9209 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9210 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9212 value_from_longest (type
,
9213 (value_less (arg1
, arg3
)
9214 || value_equal (arg1
, arg3
))
9215 && (value_less (arg2
, arg1
)
9216 || value_equal (arg2
, arg1
)));
9218 case TERNOP_IN_RANGE
:
9219 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9220 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9221 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9223 if (noside
== EVAL_SKIP
)
9226 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9227 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9228 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9230 value_from_longest (type
,
9231 (value_less (arg1
, arg3
)
9232 || value_equal (arg1
, arg3
))
9233 && (value_less (arg2
, arg1
)
9234 || value_equal (arg2
, arg1
)));
9240 struct type
*type_arg
;
9241 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9243 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9245 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9249 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9253 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9254 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9255 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9258 if (noside
== EVAL_SKIP
)
9261 if (type_arg
== NULL
)
9263 arg1
= ada_coerce_ref (arg1
);
9265 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9266 arg1
= ada_coerce_to_simple_array (arg1
);
9268 type
= ada_index_type (value_type (arg1
), tem
,
9269 ada_attribute_name (op
));
9271 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9273 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9274 return allocate_value (type
);
9278 default: /* Should never happen. */
9279 error (_("unexpected attribute encountered"));
9281 return value_from_longest
9282 (type
, ada_array_bound (arg1
, tem
, 0));
9284 return value_from_longest
9285 (type
, ada_array_bound (arg1
, tem
, 1));
9287 return value_from_longest
9288 (type
, ada_array_length (arg1
, tem
));
9291 else if (discrete_type_p (type_arg
))
9293 struct type
*range_type
;
9294 char *name
= ada_type_name (type_arg
);
9296 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9297 range_type
= to_fixed_range_type (name
, NULL
, type_arg
);
9298 if (range_type
== NULL
)
9299 range_type
= type_arg
;
9303 error (_("unexpected attribute encountered"));
9305 return value_from_longest
9306 (range_type
, ada_discrete_type_low_bound (range_type
));
9308 return value_from_longest
9309 (range_type
, ada_discrete_type_high_bound (range_type
));
9311 error (_("the 'length attribute applies only to array types"));
9314 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9315 error (_("unimplemented type attribute"));
9320 if (ada_is_constrained_packed_array_type (type_arg
))
9321 type_arg
= decode_constrained_packed_array_type (type_arg
);
9323 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
9325 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9327 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9328 return allocate_value (type
);
9333 error (_("unexpected attribute encountered"));
9335 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9336 return value_from_longest (type
, low
);
9338 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9339 return value_from_longest (type
, high
);
9341 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9342 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9343 return value_from_longest (type
, high
- low
+ 1);
9349 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9350 if (noside
== EVAL_SKIP
)
9353 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9354 return value_zero (ada_tag_type (arg1
), not_lval
);
9356 return ada_value_tag (arg1
);
9360 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9361 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9362 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9363 if (noside
== EVAL_SKIP
)
9365 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9366 return value_zero (value_type (arg1
), not_lval
);
9369 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9370 return value_binop (arg1
, arg2
,
9371 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9374 case OP_ATR_MODULUS
:
9376 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9377 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9379 if (noside
== EVAL_SKIP
)
9382 if (!ada_is_modular_type (type_arg
))
9383 error (_("'modulus must be applied to modular type"));
9385 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9386 ada_modulus (type_arg
));
9391 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9392 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9393 if (noside
== EVAL_SKIP
)
9395 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9396 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9397 return value_zero (type
, not_lval
);
9399 return value_pos_atr (type
, arg1
);
9402 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9403 type
= value_type (arg1
);
9405 /* If the argument is a reference, then dereference its type, since
9406 the user is really asking for the size of the actual object,
9407 not the size of the pointer. */
9408 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9409 type
= TYPE_TARGET_TYPE (type
);
9411 if (noside
== EVAL_SKIP
)
9413 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9414 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
9416 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
9417 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9420 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9421 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9422 type
= exp
->elts
[pc
+ 2].type
;
9423 if (noside
== EVAL_SKIP
)
9425 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9426 return value_zero (type
, not_lval
);
9428 return value_val_atr (type
, arg1
);
9431 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9432 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9433 if (noside
== EVAL_SKIP
)
9435 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9436 return value_zero (value_type (arg1
), not_lval
);
9439 /* For integer exponentiation operations,
9440 only promote the first argument. */
9441 if (is_integral_type (value_type (arg2
)))
9442 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9444 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9446 return value_binop (arg1
, arg2
, op
);
9450 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9451 if (noside
== EVAL_SKIP
)
9457 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9458 if (noside
== EVAL_SKIP
)
9460 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9461 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9462 return value_neg (arg1
);
9467 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9468 if (noside
== EVAL_SKIP
)
9470 type
= ada_check_typedef (value_type (arg1
));
9471 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9473 if (ada_is_array_descriptor_type (type
))
9474 /* GDB allows dereferencing GNAT array descriptors. */
9476 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9477 if (arrType
== NULL
)
9478 error (_("Attempt to dereference null array pointer."));
9479 return value_at_lazy (arrType
, 0);
9481 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9482 || TYPE_CODE (type
) == TYPE_CODE_REF
9483 /* In C you can dereference an array to get the 1st elt. */
9484 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9486 type
= to_static_fixed_type
9488 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9490 return value_zero (type
, lval_memory
);
9492 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9494 /* GDB allows dereferencing an int. */
9495 if (expect_type
== NULL
)
9496 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9501 to_static_fixed_type (ada_aligned_type (expect_type
));
9502 return value_zero (expect_type
, lval_memory
);
9506 error (_("Attempt to take contents of a non-pointer value."));
9508 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9509 type
= ada_check_typedef (value_type (arg1
));
9511 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9512 /* GDB allows dereferencing an int. If we were given
9513 the expect_type, then use that as the target type.
9514 Otherwise, assume that the target type is an int. */
9516 if (expect_type
!= NULL
)
9517 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9520 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9521 (CORE_ADDR
) value_as_address (arg1
));
9524 if (ada_is_array_descriptor_type (type
))
9525 /* GDB allows dereferencing GNAT array descriptors. */
9526 return ada_coerce_to_simple_array (arg1
);
9528 return ada_value_ind (arg1
);
9530 case STRUCTOP_STRUCT
:
9531 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9532 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9533 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9534 if (noside
== EVAL_SKIP
)
9536 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9538 struct type
*type1
= value_type (arg1
);
9539 if (ada_is_tagged_type (type1
, 1))
9541 type
= ada_lookup_struct_elt_type (type1
,
9542 &exp
->elts
[pc
+ 2].string
,
9545 /* In this case, we assume that the field COULD exist
9546 in some extension of the type. Return an object of
9547 "type" void, which will match any formal
9548 (see ada_type_match). */
9549 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
9554 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9557 return value_zero (ada_aligned_type (type
), lval_memory
);
9560 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
9561 arg1
= unwrap_value (arg1
);
9562 return ada_to_fixed_value (arg1
);
9565 /* The value is not supposed to be used. This is here to make it
9566 easier to accommodate expressions that contain types. */
9568 if (noside
== EVAL_SKIP
)
9570 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9571 return allocate_value (exp
->elts
[pc
+ 1].type
);
9573 error (_("Attempt to use a type name as an expression"));
9578 case OP_DISCRETE_RANGE
:
9581 if (noside
== EVAL_NORMAL
)
9585 error (_("Undefined name, ambiguous name, or renaming used in "
9586 "component association: %s."), &exp
->elts
[pc
+2].string
);
9588 error (_("Aggregates only allowed on the right of an assignment"));
9590 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9593 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9595 for (tem
= 0; tem
< nargs
; tem
+= 1)
9596 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9601 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
9607 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9608 type name that encodes the 'small and 'delta information.
9609 Otherwise, return NULL. */
9612 fixed_type_info (struct type
*type
)
9614 const char *name
= ada_type_name (type
);
9615 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9617 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9619 const char *tail
= strstr (name
, "___XF_");
9625 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9626 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9631 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9634 ada_is_fixed_point_type (struct type
*type
)
9636 return fixed_type_info (type
) != NULL
;
9639 /* Return non-zero iff TYPE represents a System.Address type. */
9642 ada_is_system_address_type (struct type
*type
)
9644 return (TYPE_NAME (type
)
9645 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9648 /* Assuming that TYPE is the representation of an Ada fixed-point
9649 type, return its delta, or -1 if the type is malformed and the
9650 delta cannot be determined. */
9653 ada_delta (struct type
*type
)
9655 const char *encoding
= fixed_type_info (type
);
9658 /* Strictly speaking, num and den are encoded as integer. However,
9659 they may not fit into a long, and they will have to be converted
9660 to DOUBLEST anyway. So scan them as DOUBLEST. */
9661 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9668 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9669 factor ('SMALL value) associated with the type. */
9672 scaling_factor (struct type
*type
)
9674 const char *encoding
= fixed_type_info (type
);
9675 DOUBLEST num0
, den0
, num1
, den1
;
9678 /* Strictly speaking, num's and den's are encoded as integer. However,
9679 they may not fit into a long, and they will have to be converted
9680 to DOUBLEST anyway. So scan them as DOUBLEST. */
9681 n
= sscanf (encoding
,
9682 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9683 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9684 &num0
, &den0
, &num1
, &den1
);
9695 /* Assuming that X is the representation of a value of fixed-point
9696 type TYPE, return its floating-point equivalent. */
9699 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9701 return (DOUBLEST
) x
*scaling_factor (type
);
9704 /* The representation of a fixed-point value of type TYPE
9705 corresponding to the value X. */
9708 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9710 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9717 /* Scan STR beginning at position K for a discriminant name, and
9718 return the value of that discriminant field of DVAL in *PX. If
9719 PNEW_K is not null, put the position of the character beyond the
9720 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9721 not alter *PX and *PNEW_K if unsuccessful. */
9724 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9727 static char *bound_buffer
= NULL
;
9728 static size_t bound_buffer_len
= 0;
9731 struct value
*bound_val
;
9733 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9736 pend
= strstr (str
+ k
, "__");
9740 k
+= strlen (bound
);
9744 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9745 bound
= bound_buffer
;
9746 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9747 bound
[pend
- (str
+ k
)] = '\0';
9751 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9752 if (bound_val
== NULL
)
9755 *px
= value_as_long (bound_val
);
9761 /* Value of variable named NAME in the current environment. If
9762 no such variable found, then if ERR_MSG is null, returns 0, and
9763 otherwise causes an error with message ERR_MSG. */
9765 static struct value
*
9766 get_var_value (char *name
, char *err_msg
)
9768 struct ada_symbol_info
*syms
;
9771 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9776 if (err_msg
== NULL
)
9779 error (("%s"), err_msg
);
9782 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9785 /* Value of integer variable named NAME in the current environment. If
9786 no such variable found, returns 0, and sets *FLAG to 0. If
9787 successful, sets *FLAG to 1. */
9790 get_int_var_value (char *name
, int *flag
)
9792 struct value
*var_val
= get_var_value (name
, 0);
9804 return value_as_long (var_val
);
9809 /* Return a range type whose base type is that of the range type named
9810 NAME in the current environment, and whose bounds are calculated
9811 from NAME according to the GNAT range encoding conventions.
9812 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
9813 corresponding range type from debug information; fall back to using it
9814 if symbol lookup fails. If a new type must be created, allocate it
9815 like ORIG_TYPE was. The bounds information, in general, is encoded
9816 in NAME, the base type given in the named range type. */
9818 static struct type
*
9819 to_fixed_range_type (char *name
, struct value
*dval
, struct type
*orig_type
)
9821 struct type
*raw_type
= ada_find_any_type (name
);
9822 struct type
*base_type
;
9825 /* Fall back to the original type if symbol lookup failed. */
9826 if (raw_type
== NULL
)
9827 raw_type
= orig_type
;
9829 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9830 base_type
= TYPE_TARGET_TYPE (raw_type
);
9832 base_type
= raw_type
;
9834 subtype_info
= strstr (name
, "___XD");
9835 if (subtype_info
== NULL
)
9837 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
9838 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
9839 if (L
< INT_MIN
|| U
> INT_MAX
)
9842 return create_range_type (alloc_type_copy (orig_type
), raw_type
,
9843 ada_discrete_type_low_bound (raw_type
),
9844 ada_discrete_type_high_bound (raw_type
));
9848 static char *name_buf
= NULL
;
9849 static size_t name_len
= 0;
9850 int prefix_len
= subtype_info
- name
;
9856 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9857 strncpy (name_buf
, name
, prefix_len
);
9858 name_buf
[prefix_len
] = '\0';
9861 bounds_str
= strchr (subtype_info
, '_');
9864 if (*subtype_info
== 'L')
9866 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9867 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9869 if (bounds_str
[n
] == '_')
9871 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9878 strcpy (name_buf
+ prefix_len
, "___L");
9879 L
= get_int_var_value (name_buf
, &ok
);
9882 lim_warning (_("Unknown lower bound, using 1."));
9887 if (*subtype_info
== 'U')
9889 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9890 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9896 strcpy (name_buf
+ prefix_len
, "___U");
9897 U
= get_int_var_value (name_buf
, &ok
);
9900 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9905 type
= create_range_type (alloc_type_copy (orig_type
), base_type
, L
, U
);
9906 TYPE_NAME (type
) = name
;
9911 /* True iff NAME is the name of a range type. */
9914 ada_is_range_type_name (const char *name
)
9916 return (name
!= NULL
&& strstr (name
, "___XD"));
9922 /* True iff TYPE is an Ada modular type. */
9925 ada_is_modular_type (struct type
*type
)
9927 struct type
*subranged_type
= base_type (type
);
9929 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9930 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9931 && TYPE_UNSIGNED (subranged_type
));
9934 /* Try to determine the lower and upper bounds of the given modular type
9935 using the type name only. Return non-zero and set L and U as the lower
9936 and upper bounds (respectively) if successful. */
9939 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9941 char *name
= ada_type_name (type
);
9949 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9950 we are looking for static bounds, which means an __XDLU suffix.
9951 Moreover, we know that the lower bound of modular types is always
9952 zero, so the actual suffix should start with "__XDLU_0__", and
9953 then be followed by the upper bound value. */
9954 suffix
= strstr (name
, "__XDLU_0__");
9958 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9961 *modulus
= (ULONGEST
) U
+ 1;
9965 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9968 ada_modulus (struct type
*type
)
9970 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9974 /* Ada exception catchpoint support:
9975 ---------------------------------
9977 We support 3 kinds of exception catchpoints:
9978 . catchpoints on Ada exceptions
9979 . catchpoints on unhandled Ada exceptions
9980 . catchpoints on failed assertions
9982 Exceptions raised during failed assertions, or unhandled exceptions
9983 could perfectly be caught with the general catchpoint on Ada exceptions.
9984 However, we can easily differentiate these two special cases, and having
9985 the option to distinguish these two cases from the rest can be useful
9986 to zero-in on certain situations.
9988 Exception catchpoints are a specialized form of breakpoint,
9989 since they rely on inserting breakpoints inside known routines
9990 of the GNAT runtime. The implementation therefore uses a standard
9991 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9994 Support in the runtime for exception catchpoints have been changed
9995 a few times already, and these changes affect the implementation
9996 of these catchpoints. In order to be able to support several
9997 variants of the runtime, we use a sniffer that will determine
9998 the runtime variant used by the program being debugged.
10000 At this time, we do not support the use of conditions on Ada exception
10001 catchpoints. The COND and COND_STRING fields are therefore set
10002 to NULL (most of the time, see below).
10004 Conditions where EXP_STRING, COND, and COND_STRING are used:
10006 When a user specifies the name of a specific exception in the case
10007 of catchpoints on Ada exceptions, we store the name of that exception
10008 in the EXP_STRING. We then translate this request into an actual
10009 condition stored in COND_STRING, and then parse it into an expression
10012 /* The different types of catchpoints that we introduced for catching
10015 enum exception_catchpoint_kind
10017 ex_catch_exception
,
10018 ex_catch_exception_unhandled
,
10022 /* Ada's standard exceptions. */
10024 static char *standard_exc
[] = {
10025 "constraint_error",
10031 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
10033 /* A structure that describes how to support exception catchpoints
10034 for a given executable. */
10036 struct exception_support_info
10038 /* The name of the symbol to break on in order to insert
10039 a catchpoint on exceptions. */
10040 const char *catch_exception_sym
;
10042 /* The name of the symbol to break on in order to insert
10043 a catchpoint on unhandled exceptions. */
10044 const char *catch_exception_unhandled_sym
;
10046 /* The name of the symbol to break on in order to insert
10047 a catchpoint on failed assertions. */
10048 const char *catch_assert_sym
;
10050 /* Assuming that the inferior just triggered an unhandled exception
10051 catchpoint, this function is responsible for returning the address
10052 in inferior memory where the name of that exception is stored.
10053 Return zero if the address could not be computed. */
10054 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
10057 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
10058 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
10060 /* The following exception support info structure describes how to
10061 implement exception catchpoints with the latest version of the
10062 Ada runtime (as of 2007-03-06). */
10064 static const struct exception_support_info default_exception_support_info
=
10066 "__gnat_debug_raise_exception", /* catch_exception_sym */
10067 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10068 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10069 ada_unhandled_exception_name_addr
10072 /* The following exception support info structure describes how to
10073 implement exception catchpoints with a slightly older version
10074 of the Ada runtime. */
10076 static const struct exception_support_info exception_support_info_fallback
=
10078 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10079 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10080 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10081 ada_unhandled_exception_name_addr_from_raise
10084 /* For each executable, we sniff which exception info structure to use
10085 and cache it in the following global variable. */
10087 static const struct exception_support_info
*exception_info
= NULL
;
10089 /* Inspect the Ada runtime and determine which exception info structure
10090 should be used to provide support for exception catchpoints.
10092 This function will always set exception_info, or raise an error. */
10095 ada_exception_support_info_sniffer (void)
10097 struct symbol
*sym
;
10099 /* If the exception info is already known, then no need to recompute it. */
10100 if (exception_info
!= NULL
)
10103 /* Check the latest (default) exception support info. */
10104 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
10108 exception_info
= &default_exception_support_info
;
10112 /* Try our fallback exception suport info. */
10113 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
10117 exception_info
= &exception_support_info_fallback
;
10121 /* Sometimes, it is normal for us to not be able to find the routine
10122 we are looking for. This happens when the program is linked with
10123 the shared version of the GNAT runtime, and the program has not been
10124 started yet. Inform the user of these two possible causes if
10127 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
10128 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10130 /* If the symbol does not exist, then check that the program is
10131 already started, to make sure that shared libraries have been
10132 loaded. If it is not started, this may mean that the symbol is
10133 in a shared library. */
10135 if (ptid_get_pid (inferior_ptid
) == 0)
10136 error (_("Unable to insert catchpoint. Try to start the program first."));
10138 /* At this point, we know that we are debugging an Ada program and
10139 that the inferior has been started, but we still are not able to
10140 find the run-time symbols. That can mean that we are in
10141 configurable run time mode, or that a-except as been optimized
10142 out by the linker... In any case, at this point it is not worth
10143 supporting this feature. */
10145 error (_("Cannot insert catchpoints in this configuration."));
10148 /* An observer of "executable_changed" events.
10149 Its role is to clear certain cached values that need to be recomputed
10150 each time a new executable is loaded by GDB. */
10153 ada_executable_changed_observer (void)
10155 /* If the executable changed, then it is possible that the Ada runtime
10156 is different. So we need to invalidate the exception support info
10158 exception_info
= NULL
;
10161 /* True iff FRAME is very likely to be that of a function that is
10162 part of the runtime system. This is all very heuristic, but is
10163 intended to be used as advice as to what frames are uninteresting
10167 is_known_support_routine (struct frame_info
*frame
)
10169 struct symtab_and_line sal
;
10171 enum language func_lang
;
10174 /* If this code does not have any debugging information (no symtab),
10175 This cannot be any user code. */
10177 find_frame_sal (frame
, &sal
);
10178 if (sal
.symtab
== NULL
)
10181 /* If there is a symtab, but the associated source file cannot be
10182 located, then assume this is not user code: Selecting a frame
10183 for which we cannot display the code would not be very helpful
10184 for the user. This should also take care of case such as VxWorks
10185 where the kernel has some debugging info provided for a few units. */
10187 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10190 /* Check the unit filename againt the Ada runtime file naming.
10191 We also check the name of the objfile against the name of some
10192 known system libraries that sometimes come with debugging info
10195 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10197 re_comp (known_runtime_file_name_patterns
[i
]);
10198 if (re_exec (sal
.symtab
->filename
))
10200 if (sal
.symtab
->objfile
!= NULL
10201 && re_exec (sal
.symtab
->objfile
->name
))
10205 /* Check whether the function is a GNAT-generated entity. */
10207 find_frame_funname (frame
, &func_name
, &func_lang
);
10208 if (func_name
== NULL
)
10211 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10213 re_comp (known_auxiliary_function_name_patterns
[i
]);
10214 if (re_exec (func_name
))
10221 /* Find the first frame that contains debugging information and that is not
10222 part of the Ada run-time, starting from FI and moving upward. */
10225 ada_find_printable_frame (struct frame_info
*fi
)
10227 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10229 if (!is_known_support_routine (fi
))
10238 /* Assuming that the inferior just triggered an unhandled exception
10239 catchpoint, return the address in inferior memory where the name
10240 of the exception is stored.
10242 Return zero if the address could not be computed. */
10245 ada_unhandled_exception_name_addr (void)
10247 return parse_and_eval_address ("e.full_name");
10250 /* Same as ada_unhandled_exception_name_addr, except that this function
10251 should be used when the inferior uses an older version of the runtime,
10252 where the exception name needs to be extracted from a specific frame
10253 several frames up in the callstack. */
10256 ada_unhandled_exception_name_addr_from_raise (void)
10259 struct frame_info
*fi
;
10261 /* To determine the name of this exception, we need to select
10262 the frame corresponding to RAISE_SYM_NAME. This frame is
10263 at least 3 levels up, so we simply skip the first 3 frames
10264 without checking the name of their associated function. */
10265 fi
= get_current_frame ();
10266 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10268 fi
= get_prev_frame (fi
);
10273 enum language func_lang
;
10275 find_frame_funname (fi
, &func_name
, &func_lang
);
10276 if (func_name
!= NULL
10277 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
10278 break; /* We found the frame we were looking for... */
10279 fi
= get_prev_frame (fi
);
10286 return parse_and_eval_address ("id.full_name");
10289 /* Assuming the inferior just triggered an Ada exception catchpoint
10290 (of any type), return the address in inferior memory where the name
10291 of the exception is stored, if applicable.
10293 Return zero if the address could not be computed, or if not relevant. */
10296 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10297 struct breakpoint
*b
)
10301 case ex_catch_exception
:
10302 return (parse_and_eval_address ("e.full_name"));
10305 case ex_catch_exception_unhandled
:
10306 return exception_info
->unhandled_exception_name_addr ();
10309 case ex_catch_assert
:
10310 return 0; /* Exception name is not relevant in this case. */
10314 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10318 return 0; /* Should never be reached. */
10321 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10322 any error that ada_exception_name_addr_1 might cause to be thrown.
10323 When an error is intercepted, a warning with the error message is printed,
10324 and zero is returned. */
10327 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10328 struct breakpoint
*b
)
10330 struct gdb_exception e
;
10331 CORE_ADDR result
= 0;
10333 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10335 result
= ada_exception_name_addr_1 (ex
, b
);
10340 warning (_("failed to get exception name: %s"), e
.message
);
10347 /* Implement the PRINT_IT method in the breakpoint_ops structure
10348 for all exception catchpoint kinds. */
10350 static enum print_stop_action
10351 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10353 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10354 char exception_name
[256];
10358 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10359 exception_name
[sizeof (exception_name
) - 1] = '\0';
10362 ada_find_printable_frame (get_current_frame ());
10364 annotate_catchpoint (b
->number
);
10367 case ex_catch_exception
:
10369 printf_filtered (_("\nCatchpoint %d, %s at "),
10370 b
->number
, exception_name
);
10372 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10374 case ex_catch_exception_unhandled
:
10376 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10377 b
->number
, exception_name
);
10379 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10382 case ex_catch_assert
:
10383 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10388 return PRINT_SRC_AND_LOC
;
10391 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10392 for all exception catchpoint kinds. */
10395 print_one_exception (enum exception_catchpoint_kind ex
,
10396 struct breakpoint
*b
, struct bp_location
**last_loc
)
10398 struct value_print_options opts
;
10400 get_user_print_options (&opts
);
10401 if (opts
.addressprint
)
10403 annotate_field (4);
10404 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
10407 annotate_field (5);
10408 *last_loc
= b
->loc
;
10411 case ex_catch_exception
:
10412 if (b
->exp_string
!= NULL
)
10414 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10416 ui_out_field_string (uiout
, "what", msg
);
10420 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10424 case ex_catch_exception_unhandled
:
10425 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10428 case ex_catch_assert
:
10429 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10433 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10438 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10439 for all exception catchpoint kinds. */
10442 print_mention_exception (enum exception_catchpoint_kind ex
,
10443 struct breakpoint
*b
)
10447 case ex_catch_exception
:
10448 if (b
->exp_string
!= NULL
)
10449 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10450 b
->number
, b
->exp_string
);
10452 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10456 case ex_catch_exception_unhandled
:
10457 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10461 case ex_catch_assert
:
10462 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10466 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10471 /* Virtual table for "catch exception" breakpoints. */
10473 static enum print_stop_action
10474 print_it_catch_exception (struct breakpoint
*b
)
10476 return print_it_exception (ex_catch_exception
, b
);
10480 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
10482 print_one_exception (ex_catch_exception
, b
, last_loc
);
10486 print_mention_catch_exception (struct breakpoint
*b
)
10488 print_mention_exception (ex_catch_exception
, b
);
10491 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10495 NULL
, /* breakpoint_hit */
10496 print_it_catch_exception
,
10497 print_one_catch_exception
,
10498 print_mention_catch_exception
10501 /* Virtual table for "catch exception unhandled" breakpoints. */
10503 static enum print_stop_action
10504 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10506 return print_it_exception (ex_catch_exception_unhandled
, b
);
10510 print_one_catch_exception_unhandled (struct breakpoint
*b
,
10511 struct bp_location
**last_loc
)
10513 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
10517 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10519 print_mention_exception (ex_catch_exception_unhandled
, b
);
10522 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10525 NULL
, /* breakpoint_hit */
10526 print_it_catch_exception_unhandled
,
10527 print_one_catch_exception_unhandled
,
10528 print_mention_catch_exception_unhandled
10531 /* Virtual table for "catch assert" breakpoints. */
10533 static enum print_stop_action
10534 print_it_catch_assert (struct breakpoint
*b
)
10536 return print_it_exception (ex_catch_assert
, b
);
10540 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
10542 print_one_exception (ex_catch_assert
, b
, last_loc
);
10546 print_mention_catch_assert (struct breakpoint
*b
)
10548 print_mention_exception (ex_catch_assert
, b
);
10551 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10554 NULL
, /* breakpoint_hit */
10555 print_it_catch_assert
,
10556 print_one_catch_assert
,
10557 print_mention_catch_assert
10560 /* Return non-zero if B is an Ada exception catchpoint. */
10563 ada_exception_catchpoint_p (struct breakpoint
*b
)
10565 return (b
->ops
== &catch_exception_breakpoint_ops
10566 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10567 || b
->ops
== &catch_assert_breakpoint_ops
);
10570 /* Return a newly allocated copy of the first space-separated token
10571 in ARGSP, and then adjust ARGSP to point immediately after that
10574 Return NULL if ARGPS does not contain any more tokens. */
10577 ada_get_next_arg (char **argsp
)
10579 char *args
= *argsp
;
10583 /* Skip any leading white space. */
10585 while (isspace (*args
))
10588 if (args
[0] == '\0')
10589 return NULL
; /* No more arguments. */
10591 /* Find the end of the current argument. */
10594 while (*end
!= '\0' && !isspace (*end
))
10597 /* Adjust ARGSP to point to the start of the next argument. */
10601 /* Make a copy of the current argument and return it. */
10603 result
= xmalloc (end
- args
+ 1);
10604 strncpy (result
, args
, end
- args
);
10605 result
[end
- args
] = '\0';
10610 /* Split the arguments specified in a "catch exception" command.
10611 Set EX to the appropriate catchpoint type.
10612 Set EXP_STRING to the name of the specific exception if
10613 specified by the user. */
10616 catch_ada_exception_command_split (char *args
,
10617 enum exception_catchpoint_kind
*ex
,
10620 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10621 char *exception_name
;
10623 exception_name
= ada_get_next_arg (&args
);
10624 make_cleanup (xfree
, exception_name
);
10626 /* Check that we do not have any more arguments. Anything else
10629 while (isspace (*args
))
10632 if (args
[0] != '\0')
10633 error (_("Junk at end of expression"));
10635 discard_cleanups (old_chain
);
10637 if (exception_name
== NULL
)
10639 /* Catch all exceptions. */
10640 *ex
= ex_catch_exception
;
10641 *exp_string
= NULL
;
10643 else if (strcmp (exception_name
, "unhandled") == 0)
10645 /* Catch unhandled exceptions. */
10646 *ex
= ex_catch_exception_unhandled
;
10647 *exp_string
= NULL
;
10651 /* Catch a specific exception. */
10652 *ex
= ex_catch_exception
;
10653 *exp_string
= exception_name
;
10657 /* Return the name of the symbol on which we should break in order to
10658 implement a catchpoint of the EX kind. */
10660 static const char *
10661 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10663 gdb_assert (exception_info
!= NULL
);
10667 case ex_catch_exception
:
10668 return (exception_info
->catch_exception_sym
);
10670 case ex_catch_exception_unhandled
:
10671 return (exception_info
->catch_exception_unhandled_sym
);
10673 case ex_catch_assert
:
10674 return (exception_info
->catch_assert_sym
);
10677 internal_error (__FILE__
, __LINE__
,
10678 _("unexpected catchpoint kind (%d)"), ex
);
10682 /* Return the breakpoint ops "virtual table" used for catchpoints
10685 static struct breakpoint_ops
*
10686 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10690 case ex_catch_exception
:
10691 return (&catch_exception_breakpoint_ops
);
10693 case ex_catch_exception_unhandled
:
10694 return (&catch_exception_unhandled_breakpoint_ops
);
10696 case ex_catch_assert
:
10697 return (&catch_assert_breakpoint_ops
);
10700 internal_error (__FILE__
, __LINE__
,
10701 _("unexpected catchpoint kind (%d)"), ex
);
10705 /* Return the condition that will be used to match the current exception
10706 being raised with the exception that the user wants to catch. This
10707 assumes that this condition is used when the inferior just triggered
10708 an exception catchpoint.
10710 The string returned is a newly allocated string that needs to be
10711 deallocated later. */
10714 ada_exception_catchpoint_cond_string (const char *exp_string
)
10718 /* The standard exceptions are a special case. They are defined in
10719 runtime units that have been compiled without debugging info; if
10720 EXP_STRING is the not-fully-qualified name of a standard
10721 exception (e.g. "constraint_error") then, during the evaluation
10722 of the condition expression, the symbol lookup on this name would
10723 *not* return this standard exception. The catchpoint condition
10724 may then be set only on user-defined exceptions which have the
10725 same not-fully-qualified name (e.g. my_package.constraint_error).
10727 To avoid this unexcepted behavior, these standard exceptions are
10728 systematically prefixed by "standard". This means that "catch
10729 exception constraint_error" is rewritten into "catch exception
10730 standard.constraint_error".
10732 If an exception named contraint_error is defined in another package of
10733 the inferior program, then the only way to specify this exception as a
10734 breakpoint condition is to use its fully-qualified named:
10735 e.g. my_package.constraint_error. */
10737 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10739 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10741 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10745 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10748 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10750 static struct expression
*
10751 ada_parse_catchpoint_condition (char *cond_string
,
10752 struct symtab_and_line sal
)
10754 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10757 /* Return the symtab_and_line that should be used to insert an exception
10758 catchpoint of the TYPE kind.
10760 EX_STRING should contain the name of a specific exception
10761 that the catchpoint should catch, or NULL otherwise.
10763 The idea behind all the remaining parameters is that their names match
10764 the name of certain fields in the breakpoint structure that are used to
10765 handle exception catchpoints. This function returns the value to which
10766 these fields should be set, depending on the type of catchpoint we need
10769 If COND and COND_STRING are both non-NULL, any value they might
10770 hold will be free'ed, and then replaced by newly allocated ones.
10771 These parameters are left untouched otherwise. */
10773 static struct symtab_and_line
10774 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10775 char **addr_string
, char **cond_string
,
10776 struct expression
**cond
, struct breakpoint_ops
**ops
)
10778 const char *sym_name
;
10779 struct symbol
*sym
;
10780 struct symtab_and_line sal
;
10782 /* First, find out which exception support info to use. */
10783 ada_exception_support_info_sniffer ();
10785 /* Then lookup the function on which we will break in order to catch
10786 the Ada exceptions requested by the user. */
10788 sym_name
= ada_exception_sym_name (ex
);
10789 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10791 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10792 that should be compiled with debugging information. As a result, we
10793 expect to find that symbol in the symtabs. If we don't find it, then
10794 the target most likely does not support Ada exceptions, or we cannot
10795 insert exception breakpoints yet, because the GNAT runtime hasn't been
10798 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10799 in such a way that no debugging information is produced for the symbol
10800 we are looking for. In this case, we could search the minimal symbols
10801 as a fall-back mechanism. This would still be operating in degraded
10802 mode, however, as we would still be missing the debugging information
10803 that is needed in order to extract the name of the exception being
10804 raised (this name is printed in the catchpoint message, and is also
10805 used when trying to catch a specific exception). We do not handle
10806 this case for now. */
10809 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10811 /* Make sure that the symbol we found corresponds to a function. */
10812 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10813 error (_("Symbol \"%s\" is not a function (class = %d)"),
10814 sym_name
, SYMBOL_CLASS (sym
));
10816 sal
= find_function_start_sal (sym
, 1);
10818 /* Set ADDR_STRING. */
10820 *addr_string
= xstrdup (sym_name
);
10822 /* Set the COND and COND_STRING (if not NULL). */
10824 if (cond_string
!= NULL
&& cond
!= NULL
)
10826 if (*cond_string
!= NULL
)
10828 xfree (*cond_string
);
10829 *cond_string
= NULL
;
10836 if (exp_string
!= NULL
)
10838 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10839 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10844 *ops
= ada_exception_breakpoint_ops (ex
);
10849 /* Parse the arguments (ARGS) of the "catch exception" command.
10851 Set TYPE to the appropriate exception catchpoint type.
10852 If the user asked the catchpoint to catch only a specific
10853 exception, then save the exception name in ADDR_STRING.
10855 See ada_exception_sal for a description of all the remaining
10856 function arguments of this function. */
10858 struct symtab_and_line
10859 ada_decode_exception_location (char *args
, char **addr_string
,
10860 char **exp_string
, char **cond_string
,
10861 struct expression
**cond
,
10862 struct breakpoint_ops
**ops
)
10864 enum exception_catchpoint_kind ex
;
10866 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10867 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10871 struct symtab_and_line
10872 ada_decode_assert_location (char *args
, char **addr_string
,
10873 struct breakpoint_ops
**ops
)
10875 /* Check that no argument where provided at the end of the command. */
10879 while (isspace (*args
))
10882 error (_("Junk at end of arguments."));
10885 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10890 /* Information about operators given special treatment in functions
10892 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10894 #define ADA_OPERATORS \
10895 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10896 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10897 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10898 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10899 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10900 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10901 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10902 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10903 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10904 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10905 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10906 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10907 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10908 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10909 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10910 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10911 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10912 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10913 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10916 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10918 switch (exp
->elts
[pc
- 1].opcode
)
10921 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10924 #define OP_DEFN(op, len, args, binop) \
10925 case op: *oplenp = len; *argsp = args; break;
10931 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10936 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10942 ada_op_name (enum exp_opcode opcode
)
10947 return op_name_standard (opcode
);
10949 #define OP_DEFN(op, len, args, binop) case op: return #op;
10954 return "OP_AGGREGATE";
10956 return "OP_CHOICES";
10962 /* As for operator_length, but assumes PC is pointing at the first
10963 element of the operator, and gives meaningful results only for the
10964 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10967 ada_forward_operator_length (struct expression
*exp
, int pc
,
10968 int *oplenp
, int *argsp
)
10970 switch (exp
->elts
[pc
].opcode
)
10973 *oplenp
= *argsp
= 0;
10976 #define OP_DEFN(op, len, args, binop) \
10977 case op: *oplenp = len; *argsp = args; break;
10983 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10988 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10994 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10995 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
11003 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
11005 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
11010 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
11014 /* Ada attributes ('Foo). */
11017 case OP_ATR_LENGTH
:
11021 case OP_ATR_MODULUS
:
11028 case UNOP_IN_RANGE
:
11030 /* XXX: gdb_sprint_host_address, type_sprint */
11031 fprintf_filtered (stream
, _("Type @"));
11032 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
11033 fprintf_filtered (stream
, " (");
11034 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
11035 fprintf_filtered (stream
, ")");
11037 case BINOP_IN_BOUNDS
:
11038 fprintf_filtered (stream
, " (%d)",
11039 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
11041 case TERNOP_IN_RANGE
:
11046 case OP_DISCRETE_RANGE
:
11047 case OP_POSITIONAL
:
11054 char *name
= &exp
->elts
[elt
+ 2].string
;
11055 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
11056 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
11061 return dump_subexp_body_standard (exp
, stream
, elt
);
11065 for (i
= 0; i
< nargs
; i
+= 1)
11066 elt
= dump_subexp (exp
, stream
, elt
);
11071 /* The Ada extension of print_subexp (q.v.). */
11074 ada_print_subexp (struct expression
*exp
, int *pos
,
11075 struct ui_file
*stream
, enum precedence prec
)
11077 int oplen
, nargs
, i
;
11079 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
11081 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11088 print_subexp_standard (exp
, pos
, stream
, prec
);
11092 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
11095 case BINOP_IN_BOUNDS
:
11096 /* XXX: sprint_subexp */
11097 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11098 fputs_filtered (" in ", stream
);
11099 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11100 fputs_filtered ("'range", stream
);
11101 if (exp
->elts
[pc
+ 1].longconst
> 1)
11102 fprintf_filtered (stream
, "(%ld)",
11103 (long) exp
->elts
[pc
+ 1].longconst
);
11106 case TERNOP_IN_RANGE
:
11107 if (prec
>= PREC_EQUAL
)
11108 fputs_filtered ("(", stream
);
11109 /* XXX: sprint_subexp */
11110 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11111 fputs_filtered (" in ", stream
);
11112 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11113 fputs_filtered (" .. ", stream
);
11114 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11115 if (prec
>= PREC_EQUAL
)
11116 fputs_filtered (")", stream
);
11121 case OP_ATR_LENGTH
:
11125 case OP_ATR_MODULUS
:
11130 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11132 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
11133 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
11137 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11138 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
11142 for (tem
= 1; tem
< nargs
; tem
+= 1)
11144 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
11145 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
11147 fputs_filtered (")", stream
);
11152 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
11153 fputs_filtered ("'(", stream
);
11154 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
11155 fputs_filtered (")", stream
);
11158 case UNOP_IN_RANGE
:
11159 /* XXX: sprint_subexp */
11160 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11161 fputs_filtered (" in ", stream
);
11162 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
11165 case OP_DISCRETE_RANGE
:
11166 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11167 fputs_filtered ("..", stream
);
11168 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11172 fputs_filtered ("others => ", stream
);
11173 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11177 for (i
= 0; i
< nargs
-1; i
+= 1)
11180 fputs_filtered ("|", stream
);
11181 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11183 fputs_filtered (" => ", stream
);
11184 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11187 case OP_POSITIONAL
:
11188 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11192 fputs_filtered ("(", stream
);
11193 for (i
= 0; i
< nargs
; i
+= 1)
11196 fputs_filtered (", ", stream
);
11197 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11199 fputs_filtered (")", stream
);
11204 /* Table mapping opcodes into strings for printing operators
11205 and precedences of the operators. */
11207 static const struct op_print ada_op_print_tab
[] = {
11208 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
11209 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
11210 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
11211 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
11212 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
11213 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
11214 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
11215 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
11216 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
11217 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
11218 {">", BINOP_GTR
, PREC_ORDER
, 0},
11219 {"<", BINOP_LESS
, PREC_ORDER
, 0},
11220 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
11221 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
11222 {"+", BINOP_ADD
, PREC_ADD
, 0},
11223 {"-", BINOP_SUB
, PREC_ADD
, 0},
11224 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
11225 {"*", BINOP_MUL
, PREC_MUL
, 0},
11226 {"/", BINOP_DIV
, PREC_MUL
, 0},
11227 {"rem", BINOP_REM
, PREC_MUL
, 0},
11228 {"mod", BINOP_MOD
, PREC_MUL
, 0},
11229 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
11230 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
11231 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
11232 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
11233 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
11234 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
11235 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
11236 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
11237 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
11238 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
11242 enum ada_primitive_types
{
11243 ada_primitive_type_int
,
11244 ada_primitive_type_long
,
11245 ada_primitive_type_short
,
11246 ada_primitive_type_char
,
11247 ada_primitive_type_float
,
11248 ada_primitive_type_double
,
11249 ada_primitive_type_void
,
11250 ada_primitive_type_long_long
,
11251 ada_primitive_type_long_double
,
11252 ada_primitive_type_natural
,
11253 ada_primitive_type_positive
,
11254 ada_primitive_type_system_address
,
11255 nr_ada_primitive_types
11259 ada_language_arch_info (struct gdbarch
*gdbarch
,
11260 struct language_arch_info
*lai
)
11262 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
11263 lai
->primitive_type_vector
11264 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
11267 lai
->primitive_type_vector
[ada_primitive_type_int
]
11268 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11270 lai
->primitive_type_vector
[ada_primitive_type_long
]
11271 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
11272 0, "long_integer");
11273 lai
->primitive_type_vector
[ada_primitive_type_short
]
11274 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
11275 0, "short_integer");
11276 lai
->string_char_type
11277 = lai
->primitive_type_vector
[ada_primitive_type_char
]
11278 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
11279 lai
->primitive_type_vector
[ada_primitive_type_float
]
11280 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
11282 lai
->primitive_type_vector
[ada_primitive_type_double
]
11283 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11284 "long_float", NULL
);
11285 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
11286 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
11287 0, "long_long_integer");
11288 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
11289 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11290 "long_long_float", NULL
);
11291 lai
->primitive_type_vector
[ada_primitive_type_natural
]
11292 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11294 lai
->primitive_type_vector
[ada_primitive_type_positive
]
11295 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11297 lai
->primitive_type_vector
[ada_primitive_type_void
]
11298 = builtin
->builtin_void
;
11300 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
11301 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
11302 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
11303 = "system__address";
11305 lai
->bool_type_symbol
= NULL
;
11306 lai
->bool_type_default
= builtin
->builtin_bool
;
11309 /* Language vector */
11311 /* Not really used, but needed in the ada_language_defn. */
11314 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
11316 ada_emit_char (c
, type
, stream
, quoter
, 1);
11322 warnings_issued
= 0;
11323 return ada_parse ();
11326 static const struct exp_descriptor ada_exp_descriptor
= {
11328 ada_operator_length
,
11330 ada_dump_subexp_body
,
11331 ada_evaluate_subexp
11334 const struct language_defn ada_language_defn
= {
11335 "ada", /* Language name */
11339 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11340 that's not quite what this means. */
11342 macro_expansion_no
,
11343 &ada_exp_descriptor
,
11347 ada_printchar
, /* Print a character constant */
11348 ada_printstr
, /* Function to print string constant */
11349 emit_char
, /* Function to print single char (not used) */
11350 ada_print_type
, /* Print a type using appropriate syntax */
11351 default_print_typedef
, /* Print a typedef using appropriate syntax */
11352 ada_val_print
, /* Print a value using appropriate syntax */
11353 ada_value_print
, /* Print a top-level value */
11354 NULL
, /* Language specific skip_trampoline */
11355 NULL
, /* name_of_this */
11356 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11357 basic_lookup_transparent_type
, /* lookup_transparent_type */
11358 ada_la_decode
, /* Language specific symbol demangler */
11359 NULL
, /* Language specific class_name_from_physname */
11360 ada_op_print_tab
, /* expression operators for printing */
11361 0, /* c-style arrays */
11362 1, /* String lower bound */
11363 ada_get_gdb_completer_word_break_characters
,
11364 ada_make_symbol_completion_list
,
11365 ada_language_arch_info
,
11366 ada_print_array_index
,
11367 default_pass_by_reference
,
11372 /* Provide a prototype to silence -Wmissing-prototypes. */
11373 extern initialize_file_ftype _initialize_ada_language
;
11375 /* Command-list for the "set/show ada" prefix command. */
11376 static struct cmd_list_element
*set_ada_list
;
11377 static struct cmd_list_element
*show_ada_list
;
11379 /* Implement the "set ada" prefix command. */
11382 set_ada_command (char *arg
, int from_tty
)
11384 printf_unfiltered (_(\
11385 "\"set ada\" must be followed by the name of a setting.\n"));
11386 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
11389 /* Implement the "show ada" prefix command. */
11392 show_ada_command (char *args
, int from_tty
)
11394 cmd_show_list (show_ada_list
, from_tty
, "");
11398 _initialize_ada_language (void)
11400 add_language (&ada_language_defn
);
11402 add_prefix_cmd ("ada", no_class
, set_ada_command
,
11403 _("Prefix command for changing Ada-specfic settings"),
11404 &set_ada_list
, "set ada ", 0, &setlist
);
11406 add_prefix_cmd ("ada", no_class
, show_ada_command
,
11407 _("Generic command for showing Ada-specific settings."),
11408 &show_ada_list
, "show ada ", 0, &showlist
);
11410 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
11411 &trust_pad_over_xvs
, _("\
11412 Enable or disable an optimization trusting PAD types over XVS types"), _("\
11413 Show whether an optimization trusting PAD types over XVS types is activated"),
11415 This is related to the encoding used by the GNAT compiler. The debugger\n\
11416 should normally trust the contents of PAD types, but certain older versions\n\
11417 of GNAT have a bug that sometimes causes the information in the PAD type\n\
11418 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
11419 work around this bug. It is always safe to turn this option \"off\", but\n\
11420 this incurs a slight performance penalty, so it is recommended to NOT change\n\
11421 this option to \"off\" unless necessary."),
11422 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
11424 varsize_limit
= 65536;
11426 obstack_init (&symbol_list_obstack
);
11428 decoded_names_store
= htab_create_alloc
11429 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11430 NULL
, xcalloc
, xfree
);
11432 observer_attach_executable_changed (ada_executable_changed_observer
);