1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007, 2008,
4 2009 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
60 /* Define whether or not the C operator '/' truncates towards zero for
61 differently signed operands (truncation direction is undefined in C).
62 Copied from valarith.c. */
64 #ifndef TRUNCATION_TOWARDS_ZERO
65 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
68 static void modify_general_field (struct type
*, char *, LONGEST
, int, int);
70 static struct type
*desc_base_type (struct type
*);
72 static struct type
*desc_bounds_type (struct type
*);
74 static struct value
*desc_bounds (struct value
*);
76 static int fat_pntr_bounds_bitpos (struct type
*);
78 static int fat_pntr_bounds_bitsize (struct type
*);
80 static struct type
*desc_data_target_type (struct type
*);
82 static struct value
*desc_data (struct value
*);
84 static int fat_pntr_data_bitpos (struct type
*);
86 static int fat_pntr_data_bitsize (struct type
*);
88 static struct value
*desc_one_bound (struct value
*, int, int);
90 static int desc_bound_bitpos (struct type
*, int, int);
92 static int desc_bound_bitsize (struct type
*, int, int);
94 static struct type
*desc_index_type (struct type
*, int);
96 static int desc_arity (struct type
*);
98 static int ada_type_match (struct type
*, struct type
*, int);
100 static int ada_args_match (struct symbol
*, struct value
**, int);
102 static struct value
*ensure_lval (struct value
*,
103 struct gdbarch
*, CORE_ADDR
*);
105 static struct value
*make_array_descriptor (struct type
*, struct value
*,
106 struct gdbarch
*, CORE_ADDR
*);
108 static void ada_add_block_symbols (struct obstack
*,
109 struct block
*, const char *,
110 domain_enum
, struct objfile
*, int);
112 static int is_nonfunction (struct ada_symbol_info
*, int);
114 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
117 static int num_defns_collected (struct obstack
*);
119 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
121 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
122 *, const char *, int,
125 static struct value
*resolve_subexp (struct expression
**, int *, int,
128 static void replace_operator_with_call (struct expression
**, int, int, int,
129 struct symbol
*, struct block
*);
131 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
133 static char *ada_op_name (enum exp_opcode
);
135 static const char *ada_decoded_op_name (enum exp_opcode
);
137 static int numeric_type_p (struct type
*);
139 static int integer_type_p (struct type
*);
141 static int scalar_type_p (struct type
*);
143 static int discrete_type_p (struct type
*);
145 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
150 static struct symbol
*find_old_style_renaming_symbol (const char *,
153 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
156 static struct value
*evaluate_subexp_type (struct expression
*, int *);
158 static struct type
*ada_find_parallel_type_with_name (struct type
*,
161 static int is_dynamic_field (struct type
*, int);
163 static struct type
*to_fixed_variant_branch_type (struct type
*,
165 CORE_ADDR
, struct value
*);
167 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
169 static struct type
*to_fixed_range_type (char *, struct value
*,
172 static struct type
*to_static_fixed_type (struct type
*);
173 static struct type
*static_unwrap_type (struct type
*type
);
175 static struct value
*unwrap_value (struct value
*);
177 static struct type
*constrained_packed_array_type (struct type
*, long *);
179 static struct type
*decode_constrained_packed_array_type (struct type
*);
181 static long decode_packed_array_bitsize (struct type
*);
183 static struct value
*decode_constrained_packed_array (struct value
*);
185 static int ada_is_packed_array_type (struct type
*);
187 static int ada_is_unconstrained_packed_array_type (struct type
*);
189 static struct value
*value_subscript_packed (struct value
*, int,
192 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
194 static struct value
*coerce_unspec_val_to_type (struct value
*,
197 static struct value
*get_var_value (char *, char *);
199 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
201 static int equiv_types (struct type
*, struct type
*);
203 static int is_name_suffix (const char *);
205 static int wild_match (const char *, int, const char *);
207 static struct value
*ada_coerce_ref (struct value
*);
209 static LONGEST
pos_atr (struct value
*);
211 static struct value
*value_pos_atr (struct type
*, struct value
*);
213 static struct value
*value_val_atr (struct type
*, struct value
*);
215 static struct symbol
*standard_lookup (const char *, const struct block
*,
218 static struct value
*ada_search_struct_field (char *, struct value
*, int,
221 static struct value
*ada_value_primitive_field (struct value
*, int, int,
224 static int find_struct_field (char *, struct type
*, int,
225 struct type
**, int *, int *, int *, int *);
227 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
230 static struct value
*ada_to_fixed_value (struct value
*);
232 static int ada_resolve_function (struct ada_symbol_info
*, int,
233 struct value
**, int, const char *,
236 static struct value
*ada_coerce_to_simple_array (struct value
*);
238 static int ada_is_direct_array_type (struct type
*);
240 static void ada_language_arch_info (struct gdbarch
*,
241 struct language_arch_info
*);
243 static void check_size (const struct type
*);
245 static struct value
*ada_index_struct_field (int, struct value
*, int,
248 static struct value
*assign_aggregate (struct value
*, struct value
*,
249 struct expression
*, int *, enum noside
);
251 static void aggregate_assign_from_choices (struct value
*, struct value
*,
253 int *, LONGEST
*, int *,
254 int, LONGEST
, LONGEST
);
256 static void aggregate_assign_positional (struct value
*, struct value
*,
258 int *, LONGEST
*, int *, int,
262 static void aggregate_assign_others (struct value
*, struct value
*,
264 int *, LONGEST
*, int, LONGEST
, LONGEST
);
267 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
270 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
273 static void ada_forward_operator_length (struct expression
*, int, int *,
278 /* Maximum-sized dynamic type. */
279 static unsigned int varsize_limit
;
281 /* FIXME: brobecker/2003-09-17: No longer a const because it is
282 returned by a function that does not return a const char *. */
283 static char *ada_completer_word_break_characters
=
285 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
287 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
290 /* The name of the symbol to use to get the name of the main subprogram. */
291 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
292 = "__gnat_ada_main_program_name";
294 /* Limit on the number of warnings to raise per expression evaluation. */
295 static int warning_limit
= 2;
297 /* Number of warning messages issued; reset to 0 by cleanups after
298 expression evaluation. */
299 static int warnings_issued
= 0;
301 static const char *known_runtime_file_name_patterns
[] = {
302 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
305 static const char *known_auxiliary_function_name_patterns
[] = {
306 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
309 /* Space for allocating results of ada_lookup_symbol_list. */
310 static struct obstack symbol_list_obstack
;
314 /* Given DECODED_NAME a string holding a symbol name in its
315 decoded form (ie using the Ada dotted notation), returns
316 its unqualified name. */
319 ada_unqualified_name (const char *decoded_name
)
321 const char *result
= strrchr (decoded_name
, '.');
324 result
++; /* Skip the dot... */
326 result
= decoded_name
;
331 /* Return a string starting with '<', followed by STR, and '>'.
332 The result is good until the next call. */
335 add_angle_brackets (const char *str
)
337 static char *result
= NULL
;
340 result
= xstrprintf ("<%s>", str
);
345 ada_get_gdb_completer_word_break_characters (void)
347 return ada_completer_word_break_characters
;
350 /* Print an array element index using the Ada syntax. */
353 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
354 const struct value_print_options
*options
)
356 LA_VALUE_PRINT (index_value
, stream
, options
);
357 fprintf_filtered (stream
, " => ");
360 /* Assuming VECT points to an array of *SIZE objects of size
361 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
362 updating *SIZE as necessary and returning the (new) array. */
365 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
367 if (*size
< min_size
)
370 if (*size
< min_size
)
372 vect
= xrealloc (vect
, *size
* element_size
);
377 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
378 suffix of FIELD_NAME beginning "___". */
381 field_name_match (const char *field_name
, const char *target
)
383 int len
= strlen (target
);
385 (strncmp (field_name
, target
, len
) == 0
386 && (field_name
[len
] == '\0'
387 || (strncmp (field_name
+ len
, "___", 3) == 0
388 && strcmp (field_name
+ strlen (field_name
) - 6,
393 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
394 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
395 and return its index. This function also handles fields whose name
396 have ___ suffixes because the compiler sometimes alters their name
397 by adding such a suffix to represent fields with certain constraints.
398 If the field could not be found, return a negative number if
399 MAYBE_MISSING is set. Otherwise raise an error. */
402 ada_get_field_index (const struct type
*type
, const char *field_name
,
406 struct type
*struct_type
= check_typedef ((struct type
*) type
);
408 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
409 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
413 error (_("Unable to find field %s in struct %s. Aborting"),
414 field_name
, TYPE_NAME (struct_type
));
419 /* The length of the prefix of NAME prior to any "___" suffix. */
422 ada_name_prefix_len (const char *name
)
428 const char *p
= strstr (name
, "___");
430 return strlen (name
);
436 /* Return non-zero if SUFFIX is a suffix of STR.
437 Return zero if STR is null. */
440 is_suffix (const char *str
, const char *suffix
)
446 len2
= strlen (suffix
);
447 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
450 /* The contents of value VAL, treated as a value of type TYPE. The
451 result is an lval in memory if VAL is. */
453 static struct value
*
454 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
456 type
= ada_check_typedef (type
);
457 if (value_type (val
) == type
)
461 struct value
*result
;
463 /* Make sure that the object size is not unreasonable before
464 trying to allocate some memory for it. */
467 result
= allocate_value (type
);
468 set_value_component_location (result
, val
);
469 set_value_bitsize (result
, value_bitsize (val
));
470 set_value_bitpos (result
, value_bitpos (val
));
471 set_value_address (result
, value_address (val
));
473 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
474 set_value_lazy (result
, 1);
476 memcpy (value_contents_raw (result
), value_contents (val
),
482 static const gdb_byte
*
483 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
488 return valaddr
+ offset
;
492 cond_offset_target (CORE_ADDR address
, long offset
)
497 return address
+ offset
;
500 /* Issue a warning (as for the definition of warning in utils.c, but
501 with exactly one argument rather than ...), unless the limit on the
502 number of warnings has passed during the evaluation of the current
505 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
506 provided by "complaint". */
507 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
510 lim_warning (const char *format
, ...)
513 va_start (args
, format
);
515 warnings_issued
+= 1;
516 if (warnings_issued
<= warning_limit
)
517 vwarning (format
, args
);
522 /* Issue an error if the size of an object of type T is unreasonable,
523 i.e. if it would be a bad idea to allocate a value of this type in
527 check_size (const struct type
*type
)
529 if (TYPE_LENGTH (type
) > varsize_limit
)
530 error (_("object size is larger than varsize-limit"));
534 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
535 gdbtypes.h, but some of the necessary definitions in that file
536 seem to have gone missing. */
538 /* Maximum value of a SIZE-byte signed integer type. */
540 max_of_size (int size
)
542 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
543 return top_bit
| (top_bit
- 1);
546 /* Minimum value of a SIZE-byte signed integer type. */
548 min_of_size (int size
)
550 return -max_of_size (size
) - 1;
553 /* Maximum value of a SIZE-byte unsigned integer type. */
555 umax_of_size (int size
)
557 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
558 return top_bit
| (top_bit
- 1);
561 /* Maximum value of integral type T, as a signed quantity. */
563 max_of_type (struct type
*t
)
565 if (TYPE_UNSIGNED (t
))
566 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
568 return max_of_size (TYPE_LENGTH (t
));
571 /* Minimum value of integral type T, as a signed quantity. */
573 min_of_type (struct type
*t
)
575 if (TYPE_UNSIGNED (t
))
578 return min_of_size (TYPE_LENGTH (t
));
581 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
583 ada_discrete_type_high_bound (struct type
*type
)
585 switch (TYPE_CODE (type
))
587 case TYPE_CODE_RANGE
:
588 return TYPE_HIGH_BOUND (type
);
590 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
595 return max_of_type (type
);
597 error (_("Unexpected type in ada_discrete_type_high_bound."));
601 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
603 ada_discrete_type_low_bound (struct type
*type
)
605 switch (TYPE_CODE (type
))
607 case TYPE_CODE_RANGE
:
608 return TYPE_LOW_BOUND (type
);
610 return TYPE_FIELD_BITPOS (type
, 0);
615 return min_of_type (type
);
617 error (_("Unexpected type in ada_discrete_type_low_bound."));
621 /* The identity on non-range types. For range types, the underlying
622 non-range scalar type. */
625 base_type (struct type
*type
)
627 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
629 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
631 type
= TYPE_TARGET_TYPE (type
);
637 /* Language Selection */
639 /* If the main program is in Ada, return language_ada, otherwise return LANG
640 (the main program is in Ada iif the adainit symbol is found).
642 MAIN_PST is not used. */
645 ada_update_initial_language (enum language lang
,
646 struct partial_symtab
*main_pst
)
648 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
649 (struct objfile
*) NULL
) != NULL
)
655 /* If the main procedure is written in Ada, then return its name.
656 The result is good until the next call. Return NULL if the main
657 procedure doesn't appear to be in Ada. */
662 struct minimal_symbol
*msym
;
663 static char *main_program_name
= NULL
;
665 /* For Ada, the name of the main procedure is stored in a specific
666 string constant, generated by the binder. Look for that symbol,
667 extract its address, and then read that string. If we didn't find
668 that string, then most probably the main procedure is not written
670 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
674 CORE_ADDR main_program_name_addr
;
677 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
678 if (main_program_name_addr
== 0)
679 error (_("Invalid address for Ada main program name."));
681 xfree (main_program_name
);
682 target_read_string (main_program_name_addr
, &main_program_name
,
687 return main_program_name
;
690 /* The main procedure doesn't seem to be in Ada. */
696 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
699 const struct ada_opname_map ada_opname_table
[] = {
700 {"Oadd", "\"+\"", BINOP_ADD
},
701 {"Osubtract", "\"-\"", BINOP_SUB
},
702 {"Omultiply", "\"*\"", BINOP_MUL
},
703 {"Odivide", "\"/\"", BINOP_DIV
},
704 {"Omod", "\"mod\"", BINOP_MOD
},
705 {"Orem", "\"rem\"", BINOP_REM
},
706 {"Oexpon", "\"**\"", BINOP_EXP
},
707 {"Olt", "\"<\"", BINOP_LESS
},
708 {"Ole", "\"<=\"", BINOP_LEQ
},
709 {"Ogt", "\">\"", BINOP_GTR
},
710 {"Oge", "\">=\"", BINOP_GEQ
},
711 {"Oeq", "\"=\"", BINOP_EQUAL
},
712 {"One", "\"/=\"", BINOP_NOTEQUAL
},
713 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
714 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
715 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
716 {"Oconcat", "\"&\"", BINOP_CONCAT
},
717 {"Oabs", "\"abs\"", UNOP_ABS
},
718 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
719 {"Oadd", "\"+\"", UNOP_PLUS
},
720 {"Osubtract", "\"-\"", UNOP_NEG
},
724 /* The "encoded" form of DECODED, according to GNAT conventions.
725 The result is valid until the next call to ada_encode. */
728 ada_encode (const char *decoded
)
730 static char *encoding_buffer
= NULL
;
731 static size_t encoding_buffer_size
= 0;
738 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
739 2 * strlen (decoded
) + 10);
742 for (p
= decoded
; *p
!= '\0'; p
+= 1)
746 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
751 const struct ada_opname_map
*mapping
;
753 for (mapping
= ada_opname_table
;
754 mapping
->encoded
!= NULL
755 && strncmp (mapping
->decoded
, p
,
756 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
758 if (mapping
->encoded
== NULL
)
759 error (_("invalid Ada operator name: %s"), p
);
760 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
761 k
+= strlen (mapping
->encoded
);
766 encoding_buffer
[k
] = *p
;
771 encoding_buffer
[k
] = '\0';
772 return encoding_buffer
;
775 /* Return NAME folded to lower case, or, if surrounded by single
776 quotes, unfolded, but with the quotes stripped away. Result good
780 ada_fold_name (const char *name
)
782 static char *fold_buffer
= NULL
;
783 static size_t fold_buffer_size
= 0;
785 int len
= strlen (name
);
786 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
790 strncpy (fold_buffer
, name
+ 1, len
- 2);
791 fold_buffer
[len
- 2] = '\000';
796 for (i
= 0; i
<= len
; i
+= 1)
797 fold_buffer
[i
] = tolower (name
[i
]);
803 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
806 is_lower_alphanum (const char c
)
808 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
811 /* Remove either of these suffixes:
816 These are suffixes introduced by the compiler for entities such as
817 nested subprogram for instance, in order to avoid name clashes.
818 They do not serve any purpose for the debugger. */
821 ada_remove_trailing_digits (const char *encoded
, int *len
)
823 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
826 while (i
> 0 && isdigit (encoded
[i
]))
828 if (i
>= 0 && encoded
[i
] == '.')
830 else if (i
>= 0 && encoded
[i
] == '$')
832 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
834 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
839 /* Remove the suffix introduced by the compiler for protected object
843 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
845 /* Remove trailing N. */
847 /* Protected entry subprograms are broken into two
848 separate subprograms: The first one is unprotected, and has
849 a 'N' suffix; the second is the protected version, and has
850 the 'P' suffix. The second calls the first one after handling
851 the protection. Since the P subprograms are internally generated,
852 we leave these names undecoded, giving the user a clue that this
853 entity is internal. */
856 && encoded
[*len
- 1] == 'N'
857 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
861 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
864 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
868 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
871 if (encoded
[i
] != 'X')
877 if (isalnum (encoded
[i
-1]))
881 /* If ENCODED follows the GNAT entity encoding conventions, then return
882 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
885 The resulting string is valid until the next call of ada_decode.
886 If the string is unchanged by decoding, the original string pointer
890 ada_decode (const char *encoded
)
897 static char *decoding_buffer
= NULL
;
898 static size_t decoding_buffer_size
= 0;
900 /* The name of the Ada main procedure starts with "_ada_".
901 This prefix is not part of the decoded name, so skip this part
902 if we see this prefix. */
903 if (strncmp (encoded
, "_ada_", 5) == 0)
906 /* If the name starts with '_', then it is not a properly encoded
907 name, so do not attempt to decode it. Similarly, if the name
908 starts with '<', the name should not be decoded. */
909 if (encoded
[0] == '_' || encoded
[0] == '<')
912 len0
= strlen (encoded
);
914 ada_remove_trailing_digits (encoded
, &len0
);
915 ada_remove_po_subprogram_suffix (encoded
, &len0
);
917 /* Remove the ___X.* suffix if present. Do not forget to verify that
918 the suffix is located before the current "end" of ENCODED. We want
919 to avoid re-matching parts of ENCODED that have previously been
920 marked as discarded (by decrementing LEN0). */
921 p
= strstr (encoded
, "___");
922 if (p
!= NULL
&& p
- encoded
< len0
- 3)
930 /* Remove any trailing TKB suffix. It tells us that this symbol
931 is for the body of a task, but that information does not actually
932 appear in the decoded name. */
934 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
937 /* Remove any trailing TB suffix. The TB suffix is slightly different
938 from the TKB suffix because it is used for non-anonymous task
941 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
944 /* Remove trailing "B" suffixes. */
945 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
947 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
950 /* Make decoded big enough for possible expansion by operator name. */
952 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
953 decoded
= decoding_buffer
;
955 /* Remove trailing __{digit}+ or trailing ${digit}+. */
957 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
960 while ((i
>= 0 && isdigit (encoded
[i
]))
961 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
963 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
965 else if (encoded
[i
] == '$')
969 /* The first few characters that are not alphabetic are not part
970 of any encoding we use, so we can copy them over verbatim. */
972 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
973 decoded
[j
] = encoded
[i
];
978 /* Is this a symbol function? */
979 if (at_start_name
&& encoded
[i
] == 'O')
982 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
984 int op_len
= strlen (ada_opname_table
[k
].encoded
);
985 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
987 && !isalnum (encoded
[i
+ op_len
]))
989 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
992 j
+= strlen (ada_opname_table
[k
].decoded
);
996 if (ada_opname_table
[k
].encoded
!= NULL
)
1001 /* Replace "TK__" with "__", which will eventually be translated
1002 into "." (just below). */
1004 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1007 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1008 be translated into "." (just below). These are internal names
1009 generated for anonymous blocks inside which our symbol is nested. */
1011 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1012 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1013 && isdigit (encoded
[i
+4]))
1017 while (k
< len0
&& isdigit (encoded
[k
]))
1018 k
++; /* Skip any extra digit. */
1020 /* Double-check that the "__B_{DIGITS}+" sequence we found
1021 is indeed followed by "__". */
1022 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1026 /* Remove _E{DIGITS}+[sb] */
1028 /* Just as for protected object subprograms, there are 2 categories
1029 of subprograms created by the compiler for each entry. The first
1030 one implements the actual entry code, and has a suffix following
1031 the convention above; the second one implements the barrier and
1032 uses the same convention as above, except that the 'E' is replaced
1035 Just as above, we do not decode the name of barrier functions
1036 to give the user a clue that the code he is debugging has been
1037 internally generated. */
1039 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1040 && isdigit (encoded
[i
+2]))
1044 while (k
< len0
&& isdigit (encoded
[k
]))
1048 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1051 /* Just as an extra precaution, make sure that if this
1052 suffix is followed by anything else, it is a '_'.
1053 Otherwise, we matched this sequence by accident. */
1055 || (k
< len0
&& encoded
[k
] == '_'))
1060 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1061 the GNAT front-end in protected object subprograms. */
1064 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1066 /* Backtrack a bit up until we reach either the begining of
1067 the encoded name, or "__". Make sure that we only find
1068 digits or lowercase characters. */
1069 const char *ptr
= encoded
+ i
- 1;
1071 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1074 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1078 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1080 /* This is a X[bn]* sequence not separated from the previous
1081 part of the name with a non-alpha-numeric character (in other
1082 words, immediately following an alpha-numeric character), then
1083 verify that it is placed at the end of the encoded name. If
1084 not, then the encoding is not valid and we should abort the
1085 decoding. Otherwise, just skip it, it is used in body-nested
1089 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1093 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1095 /* Replace '__' by '.'. */
1103 /* It's a character part of the decoded name, so just copy it
1105 decoded
[j
] = encoded
[i
];
1110 decoded
[j
] = '\000';
1112 /* Decoded names should never contain any uppercase character.
1113 Double-check this, and abort the decoding if we find one. */
1115 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1116 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1119 if (strcmp (decoded
, encoded
) == 0)
1125 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1126 decoded
= decoding_buffer
;
1127 if (encoded
[0] == '<')
1128 strcpy (decoded
, encoded
);
1130 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1135 /* Table for keeping permanent unique copies of decoded names. Once
1136 allocated, names in this table are never released. While this is a
1137 storage leak, it should not be significant unless there are massive
1138 changes in the set of decoded names in successive versions of a
1139 symbol table loaded during a single session. */
1140 static struct htab
*decoded_names_store
;
1142 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1143 in the language-specific part of GSYMBOL, if it has not been
1144 previously computed. Tries to save the decoded name in the same
1145 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1146 in any case, the decoded symbol has a lifetime at least that of
1148 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1149 const, but nevertheless modified to a semantically equivalent form
1150 when a decoded name is cached in it.
1154 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1157 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1158 if (*resultp
== NULL
)
1160 const char *decoded
= ada_decode (gsymbol
->name
);
1161 if (gsymbol
->obj_section
!= NULL
)
1163 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1164 *resultp
= obsavestring (decoded
, strlen (decoded
),
1165 &objf
->objfile_obstack
);
1167 /* Sometimes, we can't find a corresponding objfile, in which
1168 case, we put the result on the heap. Since we only decode
1169 when needed, we hope this usually does not cause a
1170 significant memory leak (FIXME). */
1171 if (*resultp
== NULL
)
1173 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1176 *slot
= xstrdup (decoded
);
1185 ada_la_decode (const char *encoded
, int options
)
1187 return xstrdup (ada_decode (encoded
));
1190 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1191 suffixes that encode debugging information or leading _ada_ on
1192 SYM_NAME (see is_name_suffix commentary for the debugging
1193 information that is ignored). If WILD, then NAME need only match a
1194 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1195 either argument is NULL. */
1198 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1200 if (sym_name
== NULL
|| name
== NULL
)
1203 return wild_match (name
, strlen (name
), sym_name
);
1206 int len_name
= strlen (name
);
1207 return (strncmp (sym_name
, name
, len_name
) == 0
1208 && is_name_suffix (sym_name
+ len_name
))
1209 || (strncmp (sym_name
, "_ada_", 5) == 0
1210 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1211 && is_name_suffix (sym_name
+ len_name
+ 5));
1218 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1220 static char *bound_name
[] = {
1221 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1222 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1225 /* Maximum number of array dimensions we are prepared to handle. */
1227 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1229 /* Like modify_field, but allows bitpos > wordlength. */
1232 modify_general_field (struct type
*type
, char *addr
,
1233 LONGEST fieldval
, int bitpos
, int bitsize
)
1235 modify_field (type
, addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1239 /* The desc_* routines return primitive portions of array descriptors
1242 /* The descriptor or array type, if any, indicated by TYPE; removes
1243 level of indirection, if needed. */
1245 static struct type
*
1246 desc_base_type (struct type
*type
)
1250 type
= ada_check_typedef (type
);
1252 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1253 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1254 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1259 /* True iff TYPE indicates a "thin" array pointer type. */
1262 is_thin_pntr (struct type
*type
)
1265 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1266 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1269 /* The descriptor type for thin pointer type TYPE. */
1271 static struct type
*
1272 thin_descriptor_type (struct type
*type
)
1274 struct type
*base_type
= desc_base_type (type
);
1275 if (base_type
== NULL
)
1277 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1281 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1282 if (alt_type
== NULL
)
1289 /* A pointer to the array data for thin-pointer value VAL. */
1291 static struct value
*
1292 thin_data_pntr (struct value
*val
)
1294 struct type
*type
= value_type (val
);
1295 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1296 data_type
= lookup_pointer_type (data_type
);
1298 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1299 return value_cast (data_type
, value_copy (val
));
1301 return value_from_longest (data_type
, value_address (val
));
1304 /* True iff TYPE indicates a "thick" array pointer type. */
1307 is_thick_pntr (struct type
*type
)
1309 type
= desc_base_type (type
);
1310 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1311 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1314 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1315 pointer to one, the type of its bounds data; otherwise, NULL. */
1317 static struct type
*
1318 desc_bounds_type (struct type
*type
)
1322 type
= desc_base_type (type
);
1326 else if (is_thin_pntr (type
))
1328 type
= thin_descriptor_type (type
);
1331 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1333 return ada_check_typedef (r
);
1335 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1337 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1339 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1344 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1345 one, a pointer to its bounds data. Otherwise NULL. */
1347 static struct value
*
1348 desc_bounds (struct value
*arr
)
1350 struct type
*type
= ada_check_typedef (value_type (arr
));
1351 if (is_thin_pntr (type
))
1353 struct type
*bounds_type
=
1354 desc_bounds_type (thin_descriptor_type (type
));
1357 if (bounds_type
== NULL
)
1358 error (_("Bad GNAT array descriptor"));
1360 /* NOTE: The following calculation is not really kosher, but
1361 since desc_type is an XVE-encoded type (and shouldn't be),
1362 the correct calculation is a real pain. FIXME (and fix GCC). */
1363 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1364 addr
= value_as_long (arr
);
1366 addr
= value_address (arr
);
1369 value_from_longest (lookup_pointer_type (bounds_type
),
1370 addr
- TYPE_LENGTH (bounds_type
));
1373 else if (is_thick_pntr (type
))
1374 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1375 _("Bad GNAT array descriptor"));
1380 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1381 position of the field containing the address of the bounds data. */
1384 fat_pntr_bounds_bitpos (struct type
*type
)
1386 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1389 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1390 size of the field containing the address of the bounds data. */
1393 fat_pntr_bounds_bitsize (struct type
*type
)
1395 type
= desc_base_type (type
);
1397 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1398 return TYPE_FIELD_BITSIZE (type
, 1);
1400 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1403 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1404 pointer to one, the type of its array data (a array-with-no-bounds type);
1405 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1408 static struct type
*
1409 desc_data_target_type (struct type
*type
)
1411 type
= desc_base_type (type
);
1413 /* NOTE: The following is bogus; see comment in desc_bounds. */
1414 if (is_thin_pntr (type
))
1415 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1416 else if (is_thick_pntr (type
))
1418 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1421 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1422 return TYPE_TARGET_TYPE (data_type
);
1428 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1431 static struct value
*
1432 desc_data (struct value
*arr
)
1434 struct type
*type
= value_type (arr
);
1435 if (is_thin_pntr (type
))
1436 return thin_data_pntr (arr
);
1437 else if (is_thick_pntr (type
))
1438 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1439 _("Bad GNAT array descriptor"));
1445 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1446 position of the field containing the address of the data. */
1449 fat_pntr_data_bitpos (struct type
*type
)
1451 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1454 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1455 size of the field containing the address of the data. */
1458 fat_pntr_data_bitsize (struct type
*type
)
1460 type
= desc_base_type (type
);
1462 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1463 return TYPE_FIELD_BITSIZE (type
, 0);
1465 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1468 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1469 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1470 bound, if WHICH is 1. The first bound is I=1. */
1472 static struct value
*
1473 desc_one_bound (struct value
*bounds
, int i
, int which
)
1475 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1476 _("Bad GNAT array descriptor bounds"));
1479 /* If BOUNDS is an array-bounds structure type, return the bit position
1480 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1481 bound, if WHICH is 1. The first bound is I=1. */
1484 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1486 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1489 /* If BOUNDS is an array-bounds structure type, return the bit field size
1490 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1491 bound, if WHICH is 1. The first bound is I=1. */
1494 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1496 type
= desc_base_type (type
);
1498 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1499 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1501 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1504 /* If TYPE is the type of an array-bounds structure, the type of its
1505 Ith bound (numbering from 1). Otherwise, NULL. */
1507 static struct type
*
1508 desc_index_type (struct type
*type
, int i
)
1510 type
= desc_base_type (type
);
1512 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1513 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1518 /* The number of index positions in the array-bounds type TYPE.
1519 Return 0 if TYPE is NULL. */
1522 desc_arity (struct type
*type
)
1524 type
= desc_base_type (type
);
1527 return TYPE_NFIELDS (type
) / 2;
1531 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1532 an array descriptor type (representing an unconstrained array
1536 ada_is_direct_array_type (struct type
*type
)
1540 type
= ada_check_typedef (type
);
1541 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1542 || ada_is_array_descriptor_type (type
));
1545 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1549 ada_is_array_type (struct type
*type
)
1552 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1553 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1554 type
= TYPE_TARGET_TYPE (type
);
1555 return ada_is_direct_array_type (type
);
1558 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1561 ada_is_simple_array_type (struct type
*type
)
1565 type
= ada_check_typedef (type
);
1566 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1567 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1568 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1571 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1574 ada_is_array_descriptor_type (struct type
*type
)
1576 struct type
*data_type
= desc_data_target_type (type
);
1580 type
= ada_check_typedef (type
);
1581 return (data_type
!= NULL
1582 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1583 && desc_arity (desc_bounds_type (type
)) > 0);
1586 /* Non-zero iff type is a partially mal-formed GNAT array
1587 descriptor. FIXME: This is to compensate for some problems with
1588 debugging output from GNAT. Re-examine periodically to see if it
1592 ada_is_bogus_array_descriptor (struct type
*type
)
1596 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1597 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1598 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1599 && !ada_is_array_descriptor_type (type
);
1603 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1604 (fat pointer) returns the type of the array data described---specifically,
1605 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1606 in from the descriptor; otherwise, they are left unspecified. If
1607 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1608 returns NULL. The result is simply the type of ARR if ARR is not
1611 ada_type_of_array (struct value
*arr
, int bounds
)
1613 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1614 return decode_constrained_packed_array_type (value_type (arr
));
1616 if (!ada_is_array_descriptor_type (value_type (arr
)))
1617 return value_type (arr
);
1621 struct type
*array_type
=
1622 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1624 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1625 TYPE_FIELD_BITSIZE (array_type
, 0) =
1626 decode_packed_array_bitsize (value_type (arr
));
1632 struct type
*elt_type
;
1634 struct value
*descriptor
;
1636 elt_type
= ada_array_element_type (value_type (arr
), -1);
1637 arity
= ada_array_arity (value_type (arr
));
1639 if (elt_type
== NULL
|| arity
== 0)
1640 return ada_check_typedef (value_type (arr
));
1642 descriptor
= desc_bounds (arr
);
1643 if (value_as_long (descriptor
) == 0)
1647 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1648 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1649 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1650 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1653 create_range_type (range_type
, value_type (low
),
1654 longest_to_int (value_as_long (low
)),
1655 longest_to_int (value_as_long (high
)));
1656 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1658 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1659 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1660 decode_packed_array_bitsize (value_type (arr
));
1663 return lookup_pointer_type (elt_type
);
1667 /* If ARR does not represent an array, returns ARR unchanged.
1668 Otherwise, returns either a standard GDB array with bounds set
1669 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1670 GDB array. Returns NULL if ARR is a null fat pointer. */
1673 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1675 if (ada_is_array_descriptor_type (value_type (arr
)))
1677 struct type
*arrType
= ada_type_of_array (arr
, 1);
1678 if (arrType
== NULL
)
1680 return value_cast (arrType
, value_copy (desc_data (arr
)));
1682 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1683 return decode_constrained_packed_array (arr
);
1688 /* If ARR does not represent an array, returns ARR unchanged.
1689 Otherwise, returns a standard GDB array describing ARR (which may
1690 be ARR itself if it already is in the proper form). */
1692 static struct value
*
1693 ada_coerce_to_simple_array (struct value
*arr
)
1695 if (ada_is_array_descriptor_type (value_type (arr
)))
1697 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1699 error (_("Bounds unavailable for null array pointer."));
1700 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1701 return value_ind (arrVal
);
1703 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1704 return decode_constrained_packed_array (arr
);
1709 /* If TYPE represents a GNAT array type, return it translated to an
1710 ordinary GDB array type (possibly with BITSIZE fields indicating
1711 packing). For other types, is the identity. */
1714 ada_coerce_to_simple_array_type (struct type
*type
)
1716 if (ada_is_constrained_packed_array_type (type
))
1717 return decode_constrained_packed_array_type (type
);
1719 if (ada_is_array_descriptor_type (type
))
1720 return ada_check_typedef (desc_data_target_type (type
));
1725 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1728 ada_is_packed_array_type (struct type
*type
)
1732 type
= desc_base_type (type
);
1733 type
= ada_check_typedef (type
);
1735 ada_type_name (type
) != NULL
1736 && strstr (ada_type_name (type
), "___XP") != NULL
;
1739 /* Non-zero iff TYPE represents a standard GNAT constrained
1740 packed-array type. */
1743 ada_is_constrained_packed_array_type (struct type
*type
)
1745 return ada_is_packed_array_type (type
)
1746 && !ada_is_array_descriptor_type (type
);
1749 /* Non-zero iff TYPE represents an array descriptor for a
1750 unconstrained packed-array type. */
1753 ada_is_unconstrained_packed_array_type (struct type
*type
)
1755 return ada_is_packed_array_type (type
)
1756 && ada_is_array_descriptor_type (type
);
1759 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1760 return the size of its elements in bits. */
1763 decode_packed_array_bitsize (struct type
*type
)
1765 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1770 raw_name
= ada_type_name (desc_base_type (type
));
1775 tail
= strstr (raw_name
, "___XP");
1777 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1780 (_("could not understand bit size information on packed array"));
1787 /* Given that TYPE is a standard GDB array type with all bounds filled
1788 in, and that the element size of its ultimate scalar constituents
1789 (that is, either its elements, or, if it is an array of arrays, its
1790 elements' elements, etc.) is *ELT_BITS, return an identical type,
1791 but with the bit sizes of its elements (and those of any
1792 constituent arrays) recorded in the BITSIZE components of its
1793 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1796 static struct type
*
1797 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
1799 struct type
*new_elt_type
;
1800 struct type
*new_type
;
1801 LONGEST low_bound
, high_bound
;
1803 type
= ada_check_typedef (type
);
1804 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1807 new_type
= alloc_type_copy (type
);
1809 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1811 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
1812 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1813 TYPE_NAME (new_type
) = ada_type_name (type
);
1815 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
1816 &low_bound
, &high_bound
) < 0)
1817 low_bound
= high_bound
= 0;
1818 if (high_bound
< low_bound
)
1819 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1822 *elt_bits
*= (high_bound
- low_bound
+ 1);
1823 TYPE_LENGTH (new_type
) =
1824 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1827 TYPE_FIXED_INSTANCE (new_type
) = 1;
1831 /* The array type encoded by TYPE, where
1832 ada_is_constrained_packed_array_type (TYPE). */
1834 static struct type
*
1835 decode_constrained_packed_array_type (struct type
*type
)
1838 struct block
**blocks
;
1839 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1842 struct type
*shadow_type
;
1847 raw_name
= ada_type_name (desc_base_type (type
));
1852 name
= (char *) alloca (strlen (raw_name
) + 1);
1853 tail
= strstr (raw_name
, "___XP");
1854 type
= desc_base_type (type
);
1856 memcpy (name
, raw_name
, tail
- raw_name
);
1857 name
[tail
- raw_name
] = '\000';
1859 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
1861 if (shadow_type
== NULL
)
1863 lim_warning (_("could not find bounds information on packed array"));
1866 CHECK_TYPEDEF (shadow_type
);
1868 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1870 lim_warning (_("could not understand bounds information on packed array"));
1874 bits
= decode_packed_array_bitsize (type
);
1875 return constrained_packed_array_type (shadow_type
, &bits
);
1878 /* Given that ARR is a struct value *indicating a GNAT constrained packed
1879 array, returns a simple array that denotes that array. Its type is a
1880 standard GDB array type except that the BITSIZEs of the array
1881 target types are set to the number of bits in each element, and the
1882 type length is set appropriately. */
1884 static struct value
*
1885 decode_constrained_packed_array (struct value
*arr
)
1889 arr
= ada_coerce_ref (arr
);
1891 /* If our value is a pointer, then dererence it. Make sure that
1892 this operation does not cause the target type to be fixed, as
1893 this would indirectly cause this array to be decoded. The rest
1894 of the routine assumes that the array hasn't been decoded yet,
1895 so we use the basic "value_ind" routine to perform the dereferencing,
1896 as opposed to using "ada_value_ind". */
1897 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1898 arr
= value_ind (arr
);
1900 type
= decode_constrained_packed_array_type (value_type (arr
));
1903 error (_("can't unpack array"));
1907 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
1908 && ada_is_modular_type (value_type (arr
)))
1910 /* This is a (right-justified) modular type representing a packed
1911 array with no wrapper. In order to interpret the value through
1912 the (left-justified) packed array type we just built, we must
1913 first left-justify it. */
1914 int bit_size
, bit_pos
;
1917 mod
= ada_modulus (value_type (arr
)) - 1;
1924 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1925 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1926 bit_pos
/ HOST_CHAR_BIT
,
1927 bit_pos
% HOST_CHAR_BIT
,
1932 return coerce_unspec_val_to_type (arr
, type
);
1936 /* The value of the element of packed array ARR at the ARITY indices
1937 given in IND. ARR must be a simple array. */
1939 static struct value
*
1940 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1943 int bits
, elt_off
, bit_off
;
1944 long elt_total_bit_offset
;
1945 struct type
*elt_type
;
1949 elt_total_bit_offset
= 0;
1950 elt_type
= ada_check_typedef (value_type (arr
));
1951 for (i
= 0; i
< arity
; i
+= 1)
1953 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1954 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1956 (_("attempt to do packed indexing of something other than a packed array"));
1959 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1960 LONGEST lowerbound
, upperbound
;
1963 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1965 lim_warning (_("don't know bounds of array"));
1966 lowerbound
= upperbound
= 0;
1969 idx
= pos_atr (ind
[i
]);
1970 if (idx
< lowerbound
|| idx
> upperbound
)
1971 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1972 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1973 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1974 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1977 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1978 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1980 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1985 /* Non-zero iff TYPE includes negative integer values. */
1988 has_negatives (struct type
*type
)
1990 switch (TYPE_CODE (type
))
1995 return !TYPE_UNSIGNED (type
);
1996 case TYPE_CODE_RANGE
:
1997 return TYPE_LOW_BOUND (type
) < 0;
2002 /* Create a new value of type TYPE from the contents of OBJ starting
2003 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2004 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2005 assigning through the result will set the field fetched from.
2006 VALADDR is ignored unless OBJ is NULL, in which case,
2007 VALADDR+OFFSET must address the start of storage containing the
2008 packed value. The value returned in this case is never an lval.
2009 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2012 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2013 long offset
, int bit_offset
, int bit_size
,
2017 int src
, /* Index into the source area */
2018 targ
, /* Index into the target area */
2019 srcBitsLeft
, /* Number of source bits left to move */
2020 nsrc
, ntarg
, /* Number of source and target bytes */
2021 unusedLS
, /* Number of bits in next significant
2022 byte of source that are unused */
2023 accumSize
; /* Number of meaningful bits in accum */
2024 unsigned char *bytes
; /* First byte containing data to unpack */
2025 unsigned char *unpacked
;
2026 unsigned long accum
; /* Staging area for bits being transferred */
2028 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2029 /* Transmit bytes from least to most significant; delta is the direction
2030 the indices move. */
2031 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2033 type
= ada_check_typedef (type
);
2037 v
= allocate_value (type
);
2038 bytes
= (unsigned char *) (valaddr
+ offset
);
2040 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2043 value_address (obj
) + offset
);
2044 bytes
= (unsigned char *) alloca (len
);
2045 read_memory (value_address (v
), bytes
, len
);
2049 v
= allocate_value (type
);
2050 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2056 set_value_component_location (v
, obj
);
2057 new_addr
= value_address (obj
) + offset
;
2058 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2059 set_value_bitsize (v
, bit_size
);
2060 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2063 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2065 set_value_address (v
, new_addr
);
2068 set_value_bitsize (v
, bit_size
);
2069 unpacked
= (unsigned char *) value_contents (v
);
2071 srcBitsLeft
= bit_size
;
2073 ntarg
= TYPE_LENGTH (type
);
2077 memset (unpacked
, 0, TYPE_LENGTH (type
));
2080 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2083 if (has_negatives (type
)
2084 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2088 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2091 switch (TYPE_CODE (type
))
2093 case TYPE_CODE_ARRAY
:
2094 case TYPE_CODE_UNION
:
2095 case TYPE_CODE_STRUCT
:
2096 /* Non-scalar values must be aligned at a byte boundary... */
2098 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2099 /* ... And are placed at the beginning (most-significant) bytes
2101 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2106 targ
= TYPE_LENGTH (type
) - 1;
2112 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2115 unusedLS
= bit_offset
;
2118 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2125 /* Mask for removing bits of the next source byte that are not
2126 part of the value. */
2127 unsigned int unusedMSMask
=
2128 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2130 /* Sign-extend bits for this byte. */
2131 unsigned int signMask
= sign
& ~unusedMSMask
;
2133 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2134 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2135 if (accumSize
>= HOST_CHAR_BIT
)
2137 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2138 accumSize
-= HOST_CHAR_BIT
;
2139 accum
>>= HOST_CHAR_BIT
;
2143 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2150 accum
|= sign
<< accumSize
;
2151 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2152 accumSize
-= HOST_CHAR_BIT
;
2153 accum
>>= HOST_CHAR_BIT
;
2161 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2162 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2165 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2166 int src_offset
, int n
, int bits_big_endian_p
)
2168 unsigned int accum
, mask
;
2169 int accum_bits
, chunk_size
;
2171 target
+= targ_offset
/ HOST_CHAR_BIT
;
2172 targ_offset
%= HOST_CHAR_BIT
;
2173 source
+= src_offset
/ HOST_CHAR_BIT
;
2174 src_offset
%= HOST_CHAR_BIT
;
2175 if (bits_big_endian_p
)
2177 accum
= (unsigned char) *source
;
2179 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2184 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2185 accum_bits
+= HOST_CHAR_BIT
;
2187 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2190 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2191 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2194 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2196 accum_bits
-= chunk_size
;
2203 accum
= (unsigned char) *source
>> src_offset
;
2205 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2209 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2210 accum_bits
+= HOST_CHAR_BIT
;
2212 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2215 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2216 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2218 accum_bits
-= chunk_size
;
2219 accum
>>= chunk_size
;
2226 /* Store the contents of FROMVAL into the location of TOVAL.
2227 Return a new value with the location of TOVAL and contents of
2228 FROMVAL. Handles assignment into packed fields that have
2229 floating-point or non-scalar types. */
2231 static struct value
*
2232 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2234 struct type
*type
= value_type (toval
);
2235 int bits
= value_bitsize (toval
);
2237 toval
= ada_coerce_ref (toval
);
2238 fromval
= ada_coerce_ref (fromval
);
2240 if (ada_is_direct_array_type (value_type (toval
)))
2241 toval
= ada_coerce_to_simple_array (toval
);
2242 if (ada_is_direct_array_type (value_type (fromval
)))
2243 fromval
= ada_coerce_to_simple_array (fromval
);
2245 if (!deprecated_value_modifiable (toval
))
2246 error (_("Left operand of assignment is not a modifiable lvalue."));
2248 if (VALUE_LVAL (toval
) == lval_memory
2250 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2251 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2253 int len
= (value_bitpos (toval
)
2254 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2256 char *buffer
= (char *) alloca (len
);
2258 CORE_ADDR to_addr
= value_address (toval
);
2260 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2261 fromval
= value_cast (type
, fromval
);
2263 read_memory (to_addr
, buffer
, len
);
2264 from_size
= value_bitsize (fromval
);
2266 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2267 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2268 move_bits (buffer
, value_bitpos (toval
),
2269 value_contents (fromval
), from_size
- bits
, bits
, 1);
2271 move_bits (buffer
, value_bitpos (toval
),
2272 value_contents (fromval
), 0, bits
, 0);
2273 write_memory (to_addr
, buffer
, len
);
2274 observer_notify_memory_changed (to_addr
, len
, buffer
);
2276 val
= value_copy (toval
);
2277 memcpy (value_contents_raw (val
), value_contents (fromval
),
2278 TYPE_LENGTH (type
));
2279 deprecated_set_value_type (val
, type
);
2284 return value_assign (toval
, fromval
);
2288 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2289 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2290 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2291 * COMPONENT, and not the inferior's memory. The current contents
2292 * of COMPONENT are ignored. */
2294 value_assign_to_component (struct value
*container
, struct value
*component
,
2297 LONGEST offset_in_container
=
2298 (LONGEST
) (value_address (component
) - value_address (container
));
2299 int bit_offset_in_container
=
2300 value_bitpos (component
) - value_bitpos (container
);
2303 val
= value_cast (value_type (component
), val
);
2305 if (value_bitsize (component
) == 0)
2306 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2308 bits
= value_bitsize (component
);
2310 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2311 move_bits (value_contents_writeable (container
) + offset_in_container
,
2312 value_bitpos (container
) + bit_offset_in_container
,
2313 value_contents (val
),
2314 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2317 move_bits (value_contents_writeable (container
) + offset_in_container
,
2318 value_bitpos (container
) + bit_offset_in_container
,
2319 value_contents (val
), 0, bits
, 0);
2322 /* The value of the element of array ARR at the ARITY indices given in IND.
2323 ARR may be either a simple array, GNAT array descriptor, or pointer
2327 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2331 struct type
*elt_type
;
2333 elt
= ada_coerce_to_simple_array (arr
);
2335 elt_type
= ada_check_typedef (value_type (elt
));
2336 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2337 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2338 return value_subscript_packed (elt
, arity
, ind
);
2340 for (k
= 0; k
< arity
; k
+= 1)
2342 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2343 error (_("too many subscripts (%d expected)"), k
);
2344 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2349 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2350 value of the element of *ARR at the ARITY indices given in
2351 IND. Does not read the entire array into memory. */
2353 static struct value
*
2354 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2359 for (k
= 0; k
< arity
; k
+= 1)
2363 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2364 error (_("too many subscripts (%d expected)"), k
);
2365 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2367 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2368 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2369 type
= TYPE_TARGET_TYPE (type
);
2372 return value_ind (arr
);
2375 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2376 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2377 elements starting at index LOW. The lower bound of this array is LOW, as
2379 static struct value
*
2380 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2383 CORE_ADDR base
= value_as_address (array_ptr
)
2384 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type
)))
2385 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2386 struct type
*index_type
=
2387 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2389 struct type
*slice_type
=
2390 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2391 return value_at_lazy (slice_type
, base
);
2395 static struct value
*
2396 ada_value_slice (struct value
*array
, int low
, int high
)
2398 struct type
*type
= value_type (array
);
2399 struct type
*index_type
=
2400 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2401 struct type
*slice_type
=
2402 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2403 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2406 /* If type is a record type in the form of a standard GNAT array
2407 descriptor, returns the number of dimensions for type. If arr is a
2408 simple array, returns the number of "array of"s that prefix its
2409 type designation. Otherwise, returns 0. */
2412 ada_array_arity (struct type
*type
)
2419 type
= desc_base_type (type
);
2422 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2423 return desc_arity (desc_bounds_type (type
));
2425 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2428 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2434 /* If TYPE is a record type in the form of a standard GNAT array
2435 descriptor or a simple array type, returns the element type for
2436 TYPE after indexing by NINDICES indices, or by all indices if
2437 NINDICES is -1. Otherwise, returns NULL. */
2440 ada_array_element_type (struct type
*type
, int nindices
)
2442 type
= desc_base_type (type
);
2444 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2447 struct type
*p_array_type
;
2449 p_array_type
= desc_data_target_type (type
);
2451 k
= ada_array_arity (type
);
2455 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2456 if (nindices
>= 0 && k
> nindices
)
2458 while (k
> 0 && p_array_type
!= NULL
)
2460 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2463 return p_array_type
;
2465 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2467 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2469 type
= TYPE_TARGET_TYPE (type
);
2478 /* The type of nth index in arrays of given type (n numbering from 1).
2479 Does not examine memory. Throws an error if N is invalid or TYPE
2480 is not an array type. NAME is the name of the Ada attribute being
2481 evaluated ('range, 'first, 'last, or 'length); it is used in building
2482 the error message. */
2484 static struct type
*
2485 ada_index_type (struct type
*type
, int n
, const char *name
)
2487 struct type
*result_type
;
2489 type
= desc_base_type (type
);
2491 if (n
< 0 || n
> ada_array_arity (type
))
2492 error (_("invalid dimension number to '%s"), name
);
2494 if (ada_is_simple_array_type (type
))
2498 for (i
= 1; i
< n
; i
+= 1)
2499 type
= TYPE_TARGET_TYPE (type
);
2500 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2501 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2502 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2503 perhaps stabsread.c would make more sense. */
2504 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2509 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2510 if (result_type
== NULL
)
2511 error (_("attempt to take bound of something that is not an array"));
2517 /* Given that arr is an array type, returns the lower bound of the
2518 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2519 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2520 array-descriptor type. It works for other arrays with bounds supplied
2521 by run-time quantities other than discriminants. */
2524 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
)
2526 struct type
*type
, *elt_type
, *index_type_desc
, *index_type
;
2529 gdb_assert (which
== 0 || which
== 1);
2531 if (ada_is_constrained_packed_array_type (arr_type
))
2532 arr_type
= decode_constrained_packed_array_type (arr_type
);
2534 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2535 return (LONGEST
) - which
;
2537 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2538 type
= TYPE_TARGET_TYPE (arr_type
);
2543 for (i
= n
; i
> 1; i
--)
2544 elt_type
= TYPE_TARGET_TYPE (type
);
2546 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2547 if (index_type_desc
!= NULL
)
2548 index_type
= to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2549 NULL
, TYPE_INDEX_TYPE (elt_type
));
2551 index_type
= TYPE_INDEX_TYPE (elt_type
);
2554 (LONGEST
) (which
== 0
2555 ? ada_discrete_type_low_bound (index_type
)
2556 : ada_discrete_type_high_bound (index_type
));
2559 /* Given that arr is an array value, returns the lower bound of the
2560 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2561 WHICH is 1. This routine will also work for arrays with bounds
2562 supplied by run-time quantities other than discriminants. */
2565 ada_array_bound (struct value
*arr
, int n
, int which
)
2567 struct type
*arr_type
= value_type (arr
);
2569 if (ada_is_constrained_packed_array_type (arr_type
))
2570 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2571 else if (ada_is_simple_array_type (arr_type
))
2572 return ada_array_bound_from_type (arr_type
, n
, which
);
2574 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2577 /* Given that arr is an array value, returns the length of the
2578 nth index. This routine will also work for arrays with bounds
2579 supplied by run-time quantities other than discriminants.
2580 Does not work for arrays indexed by enumeration types with representation
2581 clauses at the moment. */
2584 ada_array_length (struct value
*arr
, int n
)
2586 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2588 if (ada_is_constrained_packed_array_type (arr_type
))
2589 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2591 if (ada_is_simple_array_type (arr_type
))
2592 return (ada_array_bound_from_type (arr_type
, n
, 1)
2593 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2595 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2596 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2599 /* An empty array whose type is that of ARR_TYPE (an array type),
2600 with bounds LOW to LOW-1. */
2602 static struct value
*
2603 empty_array (struct type
*arr_type
, int low
)
2605 struct type
*index_type
=
2606 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2608 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2609 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2613 /* Name resolution */
2615 /* The "decoded" name for the user-definable Ada operator corresponding
2619 ada_decoded_op_name (enum exp_opcode op
)
2623 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2625 if (ada_opname_table
[i
].op
== op
)
2626 return ada_opname_table
[i
].decoded
;
2628 error (_("Could not find operator name for opcode"));
2632 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2633 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2634 undefined namespace) and converts operators that are
2635 user-defined into appropriate function calls. If CONTEXT_TYPE is
2636 non-null, it provides a preferred result type [at the moment, only
2637 type void has any effect---causing procedures to be preferred over
2638 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2639 return type is preferred. May change (expand) *EXP. */
2642 resolve (struct expression
**expp
, int void_context_p
)
2644 struct type
*context_type
= NULL
;
2648 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
2650 resolve_subexp (expp
, &pc
, 1, context_type
);
2653 /* Resolve the operator of the subexpression beginning at
2654 position *POS of *EXPP. "Resolving" consists of replacing
2655 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2656 with their resolutions, replacing built-in operators with
2657 function calls to user-defined operators, where appropriate, and,
2658 when DEPROCEDURE_P is non-zero, converting function-valued variables
2659 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2660 are as in ada_resolve, above. */
2662 static struct value
*
2663 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2664 struct type
*context_type
)
2668 struct expression
*exp
; /* Convenience: == *expp. */
2669 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2670 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2671 int nargs
; /* Number of operands. */
2678 /* Pass one: resolve operands, saving their types and updating *pos,
2683 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2684 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2689 resolve_subexp (expp
, pos
, 0, NULL
);
2691 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2696 resolve_subexp (expp
, pos
, 0, NULL
);
2701 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2704 case OP_ATR_MODULUS
:
2714 case TERNOP_IN_RANGE
:
2715 case BINOP_IN_BOUNDS
:
2721 case OP_DISCRETE_RANGE
:
2723 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2732 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2734 resolve_subexp (expp
, pos
, 1, NULL
);
2736 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2753 case BINOP_LOGICAL_AND
:
2754 case BINOP_LOGICAL_OR
:
2755 case BINOP_BITWISE_AND
:
2756 case BINOP_BITWISE_IOR
:
2757 case BINOP_BITWISE_XOR
:
2760 case BINOP_NOTEQUAL
:
2767 case BINOP_SUBSCRIPT
:
2775 case UNOP_LOGICAL_NOT
:
2791 case OP_INTERNALVAR
:
2801 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2804 case STRUCTOP_STRUCT
:
2805 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2818 error (_("Unexpected operator during name resolution"));
2821 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2822 for (i
= 0; i
< nargs
; i
+= 1)
2823 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2827 /* Pass two: perform any resolution on principal operator. */
2834 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2836 struct ada_symbol_info
*candidates
;
2840 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2841 (exp
->elts
[pc
+ 2].symbol
),
2842 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2845 if (n_candidates
> 1)
2847 /* Types tend to get re-introduced locally, so if there
2848 are any local symbols that are not types, first filter
2851 for (j
= 0; j
< n_candidates
; j
+= 1)
2852 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2857 case LOC_REGPARM_ADDR
:
2865 if (j
< n_candidates
)
2868 while (j
< n_candidates
)
2870 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2872 candidates
[j
] = candidates
[n_candidates
- 1];
2881 if (n_candidates
== 0)
2882 error (_("No definition found for %s"),
2883 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2884 else if (n_candidates
== 1)
2886 else if (deprocedure_p
2887 && !is_nonfunction (candidates
, n_candidates
))
2889 i
= ada_resolve_function
2890 (candidates
, n_candidates
, NULL
, 0,
2891 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2894 error (_("Could not find a match for %s"),
2895 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2899 printf_filtered (_("Multiple matches for %s\n"),
2900 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2901 user_select_syms (candidates
, n_candidates
, 1);
2905 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2906 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2907 if (innermost_block
== NULL
2908 || contained_in (candidates
[i
].block
, innermost_block
))
2909 innermost_block
= candidates
[i
].block
;
2913 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2916 replace_operator_with_call (expp
, pc
, 0, 0,
2917 exp
->elts
[pc
+ 2].symbol
,
2918 exp
->elts
[pc
+ 1].block
);
2925 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2926 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2928 struct ada_symbol_info
*candidates
;
2932 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2933 (exp
->elts
[pc
+ 5].symbol
),
2934 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2936 if (n_candidates
== 1)
2940 i
= ada_resolve_function
2941 (candidates
, n_candidates
,
2943 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2946 error (_("Could not find a match for %s"),
2947 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2950 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2951 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2952 if (innermost_block
== NULL
2953 || contained_in (candidates
[i
].block
, innermost_block
))
2954 innermost_block
= candidates
[i
].block
;
2965 case BINOP_BITWISE_AND
:
2966 case BINOP_BITWISE_IOR
:
2967 case BINOP_BITWISE_XOR
:
2969 case BINOP_NOTEQUAL
:
2977 case UNOP_LOGICAL_NOT
:
2979 if (possible_user_operator_p (op
, argvec
))
2981 struct ada_symbol_info
*candidates
;
2985 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2986 (struct block
*) NULL
, VAR_DOMAIN
,
2988 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2989 ada_decoded_op_name (op
), NULL
);
2993 replace_operator_with_call (expp
, pc
, nargs
, 1,
2994 candidates
[i
].sym
, candidates
[i
].block
);
3005 return evaluate_subexp_type (exp
, pos
);
3008 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3009 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3011 /* The term "match" here is rather loose. The match is heuristic and
3015 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3017 ftype
= ada_check_typedef (ftype
);
3018 atype
= ada_check_typedef (atype
);
3020 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3021 ftype
= TYPE_TARGET_TYPE (ftype
);
3022 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3023 atype
= TYPE_TARGET_TYPE (atype
);
3025 switch (TYPE_CODE (ftype
))
3028 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3030 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3031 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3032 TYPE_TARGET_TYPE (atype
), 0);
3035 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3037 case TYPE_CODE_ENUM
:
3038 case TYPE_CODE_RANGE
:
3039 switch (TYPE_CODE (atype
))
3042 case TYPE_CODE_ENUM
:
3043 case TYPE_CODE_RANGE
:
3049 case TYPE_CODE_ARRAY
:
3050 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3051 || ada_is_array_descriptor_type (atype
));
3053 case TYPE_CODE_STRUCT
:
3054 if (ada_is_array_descriptor_type (ftype
))
3055 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3056 || ada_is_array_descriptor_type (atype
));
3058 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3059 && !ada_is_array_descriptor_type (atype
));
3061 case TYPE_CODE_UNION
:
3063 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3067 /* Return non-zero if the formals of FUNC "sufficiently match" the
3068 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3069 may also be an enumeral, in which case it is treated as a 0-
3070 argument function. */
3073 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3076 struct type
*func_type
= SYMBOL_TYPE (func
);
3078 if (SYMBOL_CLASS (func
) == LOC_CONST
3079 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3080 return (n_actuals
== 0);
3081 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3084 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3087 for (i
= 0; i
< n_actuals
; i
+= 1)
3089 if (actuals
[i
] == NULL
)
3093 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3094 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3096 if (!ada_type_match (ftype
, atype
, 1))
3103 /* False iff function type FUNC_TYPE definitely does not produce a value
3104 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3105 FUNC_TYPE is not a valid function type with a non-null return type
3106 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3109 return_match (struct type
*func_type
, struct type
*context_type
)
3111 struct type
*return_type
;
3113 if (func_type
== NULL
)
3116 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3117 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3119 return_type
= base_type (func_type
);
3120 if (return_type
== NULL
)
3123 context_type
= base_type (context_type
);
3125 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3126 return context_type
== NULL
|| return_type
== context_type
;
3127 else if (context_type
== NULL
)
3128 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3130 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3134 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3135 function (if any) that matches the types of the NARGS arguments in
3136 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3137 that returns that type, then eliminate matches that don't. If
3138 CONTEXT_TYPE is void and there is at least one match that does not
3139 return void, eliminate all matches that do.
3141 Asks the user if there is more than one match remaining. Returns -1
3142 if there is no such symbol or none is selected. NAME is used
3143 solely for messages. May re-arrange and modify SYMS in
3144 the process; the index returned is for the modified vector. */
3147 ada_resolve_function (struct ada_symbol_info syms
[],
3148 int nsyms
, struct value
**args
, int nargs
,
3149 const char *name
, struct type
*context_type
)
3153 int m
; /* Number of hits */
3156 /* In the first pass of the loop, we only accept functions matching
3157 context_type. If none are found, we add a second pass of the loop
3158 where every function is accepted. */
3159 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3161 for (k
= 0; k
< nsyms
; k
+= 1)
3163 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3165 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3166 && (fallback
|| return_match (type
, context_type
)))
3178 printf_filtered (_("Multiple matches for %s\n"), name
);
3179 user_select_syms (syms
, m
, 1);
3185 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3186 in a listing of choices during disambiguation (see sort_choices, below).
3187 The idea is that overloadings of a subprogram name from the
3188 same package should sort in their source order. We settle for ordering
3189 such symbols by their trailing number (__N or $N). */
3192 encoded_ordered_before (char *N0
, char *N1
)
3196 else if (N0
== NULL
)
3201 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3203 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3205 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3206 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3210 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3213 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3215 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3216 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3218 return (strcmp (N0
, N1
) < 0);
3222 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3226 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3229 for (i
= 1; i
< nsyms
; i
+= 1)
3231 struct ada_symbol_info sym
= syms
[i
];
3234 for (j
= i
- 1; j
>= 0; j
-= 1)
3236 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3237 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3239 syms
[j
+ 1] = syms
[j
];
3245 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3246 by asking the user (if necessary), returning the number selected,
3247 and setting the first elements of SYMS items. Error if no symbols
3250 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3251 to be re-integrated one of these days. */
3254 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3257 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3259 int first_choice
= (max_results
== 1) ? 1 : 2;
3260 const char *select_mode
= multiple_symbols_select_mode ();
3262 if (max_results
< 1)
3263 error (_("Request to select 0 symbols!"));
3267 if (select_mode
== multiple_symbols_cancel
)
3269 canceled because the command is ambiguous\n\
3270 See set/show multiple-symbol."));
3272 /* If select_mode is "all", then return all possible symbols.
3273 Only do that if more than one symbol can be selected, of course.
3274 Otherwise, display the menu as usual. */
3275 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3278 printf_unfiltered (_("[0] cancel\n"));
3279 if (max_results
> 1)
3280 printf_unfiltered (_("[1] all\n"));
3282 sort_choices (syms
, nsyms
);
3284 for (i
= 0; i
< nsyms
; i
+= 1)
3286 if (syms
[i
].sym
== NULL
)
3289 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3291 struct symtab_and_line sal
=
3292 find_function_start_sal (syms
[i
].sym
, 1);
3293 if (sal
.symtab
== NULL
)
3294 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3296 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3299 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3300 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3301 sal
.symtab
->filename
, sal
.line
);
3307 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3308 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3309 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3310 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3312 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3313 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3315 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3316 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3317 else if (is_enumeral
3318 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3320 printf_unfiltered (("[%d] "), i
+ first_choice
);
3321 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3323 printf_unfiltered (_("'(%s) (enumeral)\n"),
3324 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3326 else if (symtab
!= NULL
)
3327 printf_unfiltered (is_enumeral
3328 ? _("[%d] %s in %s (enumeral)\n")
3329 : _("[%d] %s at %s:?\n"),
3331 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3334 printf_unfiltered (is_enumeral
3335 ? _("[%d] %s (enumeral)\n")
3336 : _("[%d] %s at ?\n"),
3338 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3342 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3345 for (i
= 0; i
< n_chosen
; i
+= 1)
3346 syms
[i
] = syms
[chosen
[i
]];
3351 /* Read and validate a set of numeric choices from the user in the
3352 range 0 .. N_CHOICES-1. Place the results in increasing
3353 order in CHOICES[0 .. N-1], and return N.
3355 The user types choices as a sequence of numbers on one line
3356 separated by blanks, encoding them as follows:
3358 + A choice of 0 means to cancel the selection, throwing an error.
3359 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3360 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3362 The user is not allowed to choose more than MAX_RESULTS values.
3364 ANNOTATION_SUFFIX, if present, is used to annotate the input
3365 prompts (for use with the -f switch). */
3368 get_selections (int *choices
, int n_choices
, int max_results
,
3369 int is_all_choice
, char *annotation_suffix
)
3374 int first_choice
= is_all_choice
? 2 : 1;
3376 prompt
= getenv ("PS2");
3380 args
= command_line_input (prompt
, 0, annotation_suffix
);
3383 error_no_arg (_("one or more choice numbers"));
3387 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3388 order, as given in args. Choices are validated. */
3394 while (isspace (*args
))
3396 if (*args
== '\0' && n_chosen
== 0)
3397 error_no_arg (_("one or more choice numbers"));
3398 else if (*args
== '\0')
3401 choice
= strtol (args
, &args2
, 10);
3402 if (args
== args2
|| choice
< 0
3403 || choice
> n_choices
+ first_choice
- 1)
3404 error (_("Argument must be choice number"));
3408 error (_("cancelled"));
3410 if (choice
< first_choice
)
3412 n_chosen
= n_choices
;
3413 for (j
= 0; j
< n_choices
; j
+= 1)
3417 choice
-= first_choice
;
3419 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3423 if (j
< 0 || choice
!= choices
[j
])
3426 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3427 choices
[k
+ 1] = choices
[k
];
3428 choices
[j
+ 1] = choice
;
3433 if (n_chosen
> max_results
)
3434 error (_("Select no more than %d of the above"), max_results
);
3439 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3440 on the function identified by SYM and BLOCK, and taking NARGS
3441 arguments. Update *EXPP as needed to hold more space. */
3444 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3445 int oplen
, struct symbol
*sym
,
3446 struct block
*block
)
3448 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3449 symbol, -oplen for operator being replaced). */
3450 struct expression
*newexp
= (struct expression
*)
3451 xmalloc (sizeof (struct expression
)
3452 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3453 struct expression
*exp
= *expp
;
3455 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3456 newexp
->language_defn
= exp
->language_defn
;
3457 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3458 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3459 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3461 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3462 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3464 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3465 newexp
->elts
[pc
+ 4].block
= block
;
3466 newexp
->elts
[pc
+ 5].symbol
= sym
;
3472 /* Type-class predicates */
3474 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3478 numeric_type_p (struct type
*type
)
3484 switch (TYPE_CODE (type
))
3489 case TYPE_CODE_RANGE
:
3490 return (type
== TYPE_TARGET_TYPE (type
)
3491 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3498 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3501 integer_type_p (struct type
*type
)
3507 switch (TYPE_CODE (type
))
3511 case TYPE_CODE_RANGE
:
3512 return (type
== TYPE_TARGET_TYPE (type
)
3513 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3520 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3523 scalar_type_p (struct type
*type
)
3529 switch (TYPE_CODE (type
))
3532 case TYPE_CODE_RANGE
:
3533 case TYPE_CODE_ENUM
:
3542 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3545 discrete_type_p (struct type
*type
)
3551 switch (TYPE_CODE (type
))
3554 case TYPE_CODE_RANGE
:
3555 case TYPE_CODE_ENUM
:
3556 case TYPE_CODE_BOOL
:
3564 /* Returns non-zero if OP with operands in the vector ARGS could be
3565 a user-defined function. Errs on the side of pre-defined operators
3566 (i.e., result 0). */
3569 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3571 struct type
*type0
=
3572 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3573 struct type
*type1
=
3574 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3588 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3592 case BINOP_BITWISE_AND
:
3593 case BINOP_BITWISE_IOR
:
3594 case BINOP_BITWISE_XOR
:
3595 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3598 case BINOP_NOTEQUAL
:
3603 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3606 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3609 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3613 case UNOP_LOGICAL_NOT
:
3615 return (!numeric_type_p (type0
));
3624 1. In the following, we assume that a renaming type's name may
3625 have an ___XD suffix. It would be nice if this went away at some
3627 2. We handle both the (old) purely type-based representation of
3628 renamings and the (new) variable-based encoding. At some point,
3629 it is devoutly to be hoped that the former goes away
3630 (FIXME: hilfinger-2007-07-09).
3631 3. Subprogram renamings are not implemented, although the XRS
3632 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3634 /* If SYM encodes a renaming,
3636 <renaming> renames <renamed entity>,
3638 sets *LEN to the length of the renamed entity's name,
3639 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3640 the string describing the subcomponent selected from the renamed
3641 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3642 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3643 are undefined). Otherwise, returns a value indicating the category
3644 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3645 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3646 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3647 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3648 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3649 may be NULL, in which case they are not assigned.
3651 [Currently, however, GCC does not generate subprogram renamings.] */
3653 enum ada_renaming_category
3654 ada_parse_renaming (struct symbol
*sym
,
3655 const char **renamed_entity
, int *len
,
3656 const char **renaming_expr
)
3658 enum ada_renaming_category kind
;
3663 return ADA_NOT_RENAMING
;
3664 switch (SYMBOL_CLASS (sym
))
3667 return ADA_NOT_RENAMING
;
3669 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3670 renamed_entity
, len
, renaming_expr
);
3674 case LOC_OPTIMIZED_OUT
:
3675 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3677 return ADA_NOT_RENAMING
;
3681 kind
= ADA_OBJECT_RENAMING
;
3685 kind
= ADA_EXCEPTION_RENAMING
;
3689 kind
= ADA_PACKAGE_RENAMING
;
3693 kind
= ADA_SUBPROGRAM_RENAMING
;
3697 return ADA_NOT_RENAMING
;
3701 if (renamed_entity
!= NULL
)
3702 *renamed_entity
= info
;
3703 suffix
= strstr (info
, "___XE");
3704 if (suffix
== NULL
|| suffix
== info
)
3705 return ADA_NOT_RENAMING
;
3707 *len
= strlen (info
) - strlen (suffix
);
3709 if (renaming_expr
!= NULL
)
3710 *renaming_expr
= suffix
;
3714 /* Assuming TYPE encodes a renaming according to the old encoding in
3715 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3716 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3717 ADA_NOT_RENAMING otherwise. */
3718 static enum ada_renaming_category
3719 parse_old_style_renaming (struct type
*type
,
3720 const char **renamed_entity
, int *len
,
3721 const char **renaming_expr
)
3723 enum ada_renaming_category kind
;
3728 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3729 || TYPE_NFIELDS (type
) != 1)
3730 return ADA_NOT_RENAMING
;
3732 name
= type_name_no_tag (type
);
3734 return ADA_NOT_RENAMING
;
3736 name
= strstr (name
, "___XR");
3738 return ADA_NOT_RENAMING
;
3743 kind
= ADA_OBJECT_RENAMING
;
3746 kind
= ADA_EXCEPTION_RENAMING
;
3749 kind
= ADA_PACKAGE_RENAMING
;
3752 kind
= ADA_SUBPROGRAM_RENAMING
;
3755 return ADA_NOT_RENAMING
;
3758 info
= TYPE_FIELD_NAME (type
, 0);
3760 return ADA_NOT_RENAMING
;
3761 if (renamed_entity
!= NULL
)
3762 *renamed_entity
= info
;
3763 suffix
= strstr (info
, "___XE");
3764 if (renaming_expr
!= NULL
)
3765 *renaming_expr
= suffix
+ 5;
3766 if (suffix
== NULL
|| suffix
== info
)
3767 return ADA_NOT_RENAMING
;
3769 *len
= suffix
- info
;
3775 /* Evaluation: Function Calls */
3777 /* Return an lvalue containing the value VAL. This is the identity on
3778 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3779 on the stack, using and updating *SP as the stack pointer, and
3780 returning an lvalue whose value_address points to the copy. */
3782 static struct value
*
3783 ensure_lval (struct value
*val
, struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3785 if (! VALUE_LVAL (val
))
3787 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3789 /* The following is taken from the structure-return code in
3790 call_function_by_hand. FIXME: Therefore, some refactoring seems
3792 if (gdbarch_inner_than (gdbarch
, 1, 2))
3794 /* Stack grows downward. Align SP and value_address (val) after
3795 reserving sufficient space. */
3797 if (gdbarch_frame_align_p (gdbarch
))
3798 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3799 set_value_address (val
, *sp
);
3803 /* Stack grows upward. Align the frame, allocate space, and
3804 then again, re-align the frame. */
3805 if (gdbarch_frame_align_p (gdbarch
))
3806 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3807 set_value_address (val
, *sp
);
3809 if (gdbarch_frame_align_p (gdbarch
))
3810 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3812 VALUE_LVAL (val
) = lval_memory
;
3814 write_memory (value_address (val
), value_contents_raw (val
), len
);
3820 /* Return the value ACTUAL, converted to be an appropriate value for a
3821 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3822 allocating any necessary descriptors (fat pointers), or copies of
3823 values not residing in memory, updating it as needed. */
3826 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3827 struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3829 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3830 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3831 struct type
*formal_target
=
3832 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3833 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3834 struct type
*actual_target
=
3835 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3836 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3838 if (ada_is_array_descriptor_type (formal_target
)
3839 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3840 return make_array_descriptor (formal_type
, actual
, gdbarch
, sp
);
3841 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3842 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3844 struct value
*result
;
3845 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3846 && ada_is_array_descriptor_type (actual_target
))
3847 result
= desc_data (actual
);
3848 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3850 if (VALUE_LVAL (actual
) != lval_memory
)
3853 actual_type
= ada_check_typedef (value_type (actual
));
3854 val
= allocate_value (actual_type
);
3855 memcpy ((char *) value_contents_raw (val
),
3856 (char *) value_contents (actual
),
3857 TYPE_LENGTH (actual_type
));
3858 actual
= ensure_lval (val
, gdbarch
, sp
);
3860 result
= value_addr (actual
);
3864 return value_cast_pointers (formal_type
, result
);
3866 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3867 return ada_value_ind (actual
);
3873 /* Push a descriptor of type TYPE for array value ARR on the stack at
3874 *SP, updating *SP to reflect the new descriptor. Return either
3875 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3876 to-descriptor type rather than a descriptor type), a struct value *
3877 representing a pointer to this descriptor. */
3879 static struct value
*
3880 make_array_descriptor (struct type
*type
, struct value
*arr
,
3881 struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3883 struct type
*bounds_type
= desc_bounds_type (type
);
3884 struct type
*desc_type
= desc_base_type (type
);
3885 struct value
*descriptor
= allocate_value (desc_type
);
3886 struct value
*bounds
= allocate_value (bounds_type
);
3889 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3891 modify_general_field (value_type (bounds
),
3892 value_contents_writeable (bounds
),
3893 ada_array_bound (arr
, i
, 0),
3894 desc_bound_bitpos (bounds_type
, i
, 0),
3895 desc_bound_bitsize (bounds_type
, i
, 0));
3896 modify_general_field (value_type (bounds
),
3897 value_contents_writeable (bounds
),
3898 ada_array_bound (arr
, i
, 1),
3899 desc_bound_bitpos (bounds_type
, i
, 1),
3900 desc_bound_bitsize (bounds_type
, i
, 1));
3903 bounds
= ensure_lval (bounds
, gdbarch
, sp
);
3905 modify_general_field (value_type (descriptor
),
3906 value_contents_writeable (descriptor
),
3907 value_address (ensure_lval (arr
, gdbarch
, sp
)),
3908 fat_pntr_data_bitpos (desc_type
),
3909 fat_pntr_data_bitsize (desc_type
));
3911 modify_general_field (value_type (descriptor
),
3912 value_contents_writeable (descriptor
),
3913 value_address (bounds
),
3914 fat_pntr_bounds_bitpos (desc_type
),
3915 fat_pntr_bounds_bitsize (desc_type
));
3917 descriptor
= ensure_lval (descriptor
, gdbarch
, sp
);
3919 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3920 return value_addr (descriptor
);
3925 /* Dummy definitions for an experimental caching module that is not
3926 * used in the public sources. */
3929 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3930 struct symbol
**sym
, struct block
**block
)
3936 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3937 struct block
*block
)
3943 /* Return the result of a standard (literal, C-like) lookup of NAME in
3944 given DOMAIN, visible from lexical block BLOCK. */
3946 static struct symbol
*
3947 standard_lookup (const char *name
, const struct block
*block
,
3952 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3954 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3955 cache_symbol (name
, domain
, sym
, block_found
);
3960 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3961 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3962 since they contend in overloading in the same way. */
3964 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3968 for (i
= 0; i
< n
; i
+= 1)
3969 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3970 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3971 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3977 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3978 struct types. Otherwise, they may not. */
3981 equiv_types (struct type
*type0
, struct type
*type1
)
3985 if (type0
== NULL
|| type1
== NULL
3986 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3988 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3989 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3990 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3991 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3997 /* True iff SYM0 represents the same entity as SYM1, or one that is
3998 no more defined than that of SYM1. */
4001 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4005 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4006 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4009 switch (SYMBOL_CLASS (sym0
))
4015 struct type
*type0
= SYMBOL_TYPE (sym0
);
4016 struct type
*type1
= SYMBOL_TYPE (sym1
);
4017 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4018 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4019 int len0
= strlen (name0
);
4021 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4022 && (equiv_types (type0
, type1
)
4023 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4024 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4027 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4028 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4034 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4035 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4038 add_defn_to_vec (struct obstack
*obstackp
,
4040 struct block
*block
)
4044 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4046 /* Do not try to complete stub types, as the debugger is probably
4047 already scanning all symbols matching a certain name at the
4048 time when this function is called. Trying to replace the stub
4049 type by its associated full type will cause us to restart a scan
4050 which may lead to an infinite recursion. Instead, the client
4051 collecting the matching symbols will end up collecting several
4052 matches, with at least one of them complete. It can then filter
4053 out the stub ones if needed. */
4055 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4057 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4059 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4061 prevDefns
[i
].sym
= sym
;
4062 prevDefns
[i
].block
= block
;
4068 struct ada_symbol_info info
;
4072 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4076 /* Number of ada_symbol_info structures currently collected in
4077 current vector in *OBSTACKP. */
4080 num_defns_collected (struct obstack
*obstackp
)
4082 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4085 /* Vector of ada_symbol_info structures currently collected in current
4086 vector in *OBSTACKP. If FINISH, close off the vector and return
4087 its final address. */
4089 static struct ada_symbol_info
*
4090 defns_collected (struct obstack
*obstackp
, int finish
)
4093 return obstack_finish (obstackp
);
4095 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4098 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4099 Check the global symbols if GLOBAL, the static symbols if not.
4100 Do wild-card match if WILD. */
4102 static struct partial_symbol
*
4103 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4104 int global
, domain_enum
namespace, int wild
)
4106 struct partial_symbol
**start
;
4107 int name_len
= strlen (name
);
4108 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4117 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4118 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4122 for (i
= 0; i
< length
; i
+= 1)
4124 struct partial_symbol
*psym
= start
[i
];
4126 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4127 SYMBOL_DOMAIN (psym
), namespace)
4128 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4142 int M
= (U
+ i
) >> 1;
4143 struct partial_symbol
*psym
= start
[M
];
4144 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4146 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4148 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4159 struct partial_symbol
*psym
= start
[i
];
4161 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4162 SYMBOL_DOMAIN (psym
), namespace))
4164 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4172 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4186 int M
= (U
+ i
) >> 1;
4187 struct partial_symbol
*psym
= start
[M
];
4188 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4190 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4192 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4203 struct partial_symbol
*psym
= start
[i
];
4205 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4206 SYMBOL_DOMAIN (psym
), namespace))
4210 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4213 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4215 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4225 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4235 /* Return a minimal symbol matching NAME according to Ada decoding
4236 rules. Returns NULL if there is no such minimal symbol. Names
4237 prefixed with "standard__" are handled specially: "standard__" is
4238 first stripped off, and only static and global symbols are searched. */
4240 struct minimal_symbol
*
4241 ada_lookup_simple_minsym (const char *name
)
4243 struct objfile
*objfile
;
4244 struct minimal_symbol
*msymbol
;
4247 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4249 name
+= sizeof ("standard__") - 1;
4253 wild_match
= (strstr (name
, "__") == NULL
);
4255 ALL_MSYMBOLS (objfile
, msymbol
)
4257 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4258 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4265 /* For all subprograms that statically enclose the subprogram of the
4266 selected frame, add symbols matching identifier NAME in DOMAIN
4267 and their blocks to the list of data in OBSTACKP, as for
4268 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4272 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4273 const char *name
, domain_enum
namespace,
4278 /* True if TYPE is definitely an artificial type supplied to a symbol
4279 for which no debugging information was given in the symbol file. */
4282 is_nondebugging_type (struct type
*type
)
4284 char *name
= ada_type_name (type
);
4285 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4288 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4289 duplicate other symbols in the list (The only case I know of where
4290 this happens is when object files containing stabs-in-ecoff are
4291 linked with files containing ordinary ecoff debugging symbols (or no
4292 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4293 Returns the number of items in the modified list. */
4296 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4305 /* If two symbols have the same name and one of them is a stub type,
4306 the get rid of the stub. */
4308 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4309 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4311 for (j
= 0; j
< nsyms
; j
++)
4314 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4315 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4316 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4317 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4322 /* Two symbols with the same name, same class and same address
4323 should be identical. */
4325 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4326 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4327 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4329 for (j
= 0; j
< nsyms
; j
+= 1)
4332 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4333 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4334 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4335 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4336 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4337 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4344 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4345 syms
[j
- 1] = syms
[j
];
4354 /* Given a type that corresponds to a renaming entity, use the type name
4355 to extract the scope (package name or function name, fully qualified,
4356 and following the GNAT encoding convention) where this renaming has been
4357 defined. The string returned needs to be deallocated after use. */
4360 xget_renaming_scope (struct type
*renaming_type
)
4362 /* The renaming types adhere to the following convention:
4363 <scope>__<rename>___<XR extension>.
4364 So, to extract the scope, we search for the "___XR" extension,
4365 and then backtrack until we find the first "__". */
4367 const char *name
= type_name_no_tag (renaming_type
);
4368 char *suffix
= strstr (name
, "___XR");
4373 /* Now, backtrack a bit until we find the first "__". Start looking
4374 at suffix - 3, as the <rename> part is at least one character long. */
4376 for (last
= suffix
- 3; last
> name
; last
--)
4377 if (last
[0] == '_' && last
[1] == '_')
4380 /* Make a copy of scope and return it. */
4382 scope_len
= last
- name
;
4383 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4385 strncpy (scope
, name
, scope_len
);
4386 scope
[scope_len
] = '\0';
4391 /* Return nonzero if NAME corresponds to a package name. */
4394 is_package_name (const char *name
)
4396 /* Here, We take advantage of the fact that no symbols are generated
4397 for packages, while symbols are generated for each function.
4398 So the condition for NAME represent a package becomes equivalent
4399 to NAME not existing in our list of symbols. There is only one
4400 small complication with library-level functions (see below). */
4404 /* If it is a function that has not been defined at library level,
4405 then we should be able to look it up in the symbols. */
4406 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4409 /* Library-level function names start with "_ada_". See if function
4410 "_ada_" followed by NAME can be found. */
4412 /* Do a quick check that NAME does not contain "__", since library-level
4413 functions names cannot contain "__" in them. */
4414 if (strstr (name
, "__") != NULL
)
4417 fun_name
= xstrprintf ("_ada_%s", name
);
4419 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4422 /* Return nonzero if SYM corresponds to a renaming entity that is
4423 not visible from FUNCTION_NAME. */
4426 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4430 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4433 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4435 make_cleanup (xfree
, scope
);
4437 /* If the rename has been defined in a package, then it is visible. */
4438 if (is_package_name (scope
))
4441 /* Check that the rename is in the current function scope by checking
4442 that its name starts with SCOPE. */
4444 /* If the function name starts with "_ada_", it means that it is
4445 a library-level function. Strip this prefix before doing the
4446 comparison, as the encoding for the renaming does not contain
4448 if (strncmp (function_name
, "_ada_", 5) == 0)
4451 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4454 /* Remove entries from SYMS that corresponds to a renaming entity that
4455 is not visible from the function associated with CURRENT_BLOCK or
4456 that is superfluous due to the presence of more specific renaming
4457 information. Places surviving symbols in the initial entries of
4458 SYMS and returns the number of surviving symbols.
4461 First, in cases where an object renaming is implemented as a
4462 reference variable, GNAT may produce both the actual reference
4463 variable and the renaming encoding. In this case, we discard the
4466 Second, GNAT emits a type following a specified encoding for each renaming
4467 entity. Unfortunately, STABS currently does not support the definition
4468 of types that are local to a given lexical block, so all renamings types
4469 are emitted at library level. As a consequence, if an application
4470 contains two renaming entities using the same name, and a user tries to
4471 print the value of one of these entities, the result of the ada symbol
4472 lookup will also contain the wrong renaming type.
4474 This function partially covers for this limitation by attempting to
4475 remove from the SYMS list renaming symbols that should be visible
4476 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4477 method with the current information available. The implementation
4478 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4480 - When the user tries to print a rename in a function while there
4481 is another rename entity defined in a package: Normally, the
4482 rename in the function has precedence over the rename in the
4483 package, so the latter should be removed from the list. This is
4484 currently not the case.
4486 - This function will incorrectly remove valid renames if
4487 the CURRENT_BLOCK corresponds to a function which symbol name
4488 has been changed by an "Export" pragma. As a consequence,
4489 the user will be unable to print such rename entities. */
4492 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4493 int nsyms
, const struct block
*current_block
)
4495 struct symbol
*current_function
;
4496 char *current_function_name
;
4498 int is_new_style_renaming
;
4500 /* If there is both a renaming foo___XR... encoded as a variable and
4501 a simple variable foo in the same block, discard the latter.
4502 First, zero out such symbols, then compress. */
4503 is_new_style_renaming
= 0;
4504 for (i
= 0; i
< nsyms
; i
+= 1)
4506 struct symbol
*sym
= syms
[i
].sym
;
4507 struct block
*block
= syms
[i
].block
;
4511 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4513 name
= SYMBOL_LINKAGE_NAME (sym
);
4514 suffix
= strstr (name
, "___XR");
4518 int name_len
= suffix
- name
;
4520 is_new_style_renaming
= 1;
4521 for (j
= 0; j
< nsyms
; j
+= 1)
4522 if (i
!= j
&& syms
[j
].sym
!= NULL
4523 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4525 && block
== syms
[j
].block
)
4529 if (is_new_style_renaming
)
4533 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4534 if (syms
[j
].sym
!= NULL
)
4542 /* Extract the function name associated to CURRENT_BLOCK.
4543 Abort if unable to do so. */
4545 if (current_block
== NULL
)
4548 current_function
= block_linkage_function (current_block
);
4549 if (current_function
== NULL
)
4552 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4553 if (current_function_name
== NULL
)
4556 /* Check each of the symbols, and remove it from the list if it is
4557 a type corresponding to a renaming that is out of the scope of
4558 the current block. */
4563 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4564 == ADA_OBJECT_RENAMING
4565 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4568 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4569 syms
[j
- 1] = syms
[j
];
4579 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4580 whose name and domain match NAME and DOMAIN respectively.
4581 If no match was found, then extend the search to "enclosing"
4582 routines (in other words, if we're inside a nested function,
4583 search the symbols defined inside the enclosing functions).
4585 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4588 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4589 struct block
*block
, domain_enum domain
,
4592 int block_depth
= 0;
4594 while (block
!= NULL
)
4597 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4599 /* If we found a non-function match, assume that's the one. */
4600 if (is_nonfunction (defns_collected (obstackp
, 0),
4601 num_defns_collected (obstackp
)))
4604 block
= BLOCK_SUPERBLOCK (block
);
4607 /* If no luck so far, try to find NAME as a local symbol in some lexically
4608 enclosing subprogram. */
4609 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4610 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4613 /* Add to OBSTACKP all non-local symbols whose name and domain match
4614 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4615 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4618 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4619 domain_enum domain
, int global
,
4622 struct objfile
*objfile
;
4623 struct partial_symtab
*ps
;
4625 ALL_PSYMTABS (objfile
, ps
)
4629 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4631 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4632 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4634 if (s
== NULL
|| !s
->primary
)
4636 ada_add_block_symbols (obstackp
,
4637 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4638 name
, domain
, objfile
, wild_match
);
4643 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4644 scope and in global scopes, returning the number of matches. Sets
4645 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4646 indicating the symbols found and the blocks and symbol tables (if
4647 any) in which they were found. This vector are transient---good only to
4648 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4649 symbol match within the nest of blocks whose innermost member is BLOCK0,
4650 is the one match returned (no other matches in that or
4651 enclosing blocks is returned). If there are any matches in or
4652 surrounding BLOCK0, then these alone are returned. Otherwise, the
4653 search extends to global and file-scope (static) symbol tables.
4654 Names prefixed with "standard__" are handled specially: "standard__"
4655 is first stripped off, and only static and global symbols are searched. */
4658 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4659 domain_enum
namespace,
4660 struct ada_symbol_info
**results
)
4663 struct block
*block
;
4669 obstack_free (&symbol_list_obstack
, NULL
);
4670 obstack_init (&symbol_list_obstack
);
4674 /* Search specified block and its superiors. */
4676 wild_match
= (strstr (name0
, "__") == NULL
);
4678 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4679 needed, but adding const will
4680 have a cascade effect. */
4682 /* Special case: If the user specifies a symbol name inside package
4683 Standard, do a non-wild matching of the symbol name without
4684 the "standard__" prefix. This was primarily introduced in order
4685 to allow the user to specifically access the standard exceptions
4686 using, for instance, Standard.Constraint_Error when Constraint_Error
4687 is ambiguous (due to the user defining its own Constraint_Error
4688 entity inside its program). */
4689 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4693 name
= name0
+ sizeof ("standard__") - 1;
4696 /* Check the non-global symbols. If we have ANY match, then we're done. */
4698 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4700 if (num_defns_collected (&symbol_list_obstack
) > 0)
4703 /* No non-global symbols found. Check our cache to see if we have
4704 already performed this search before. If we have, then return
4708 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4711 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4715 /* Search symbols from all global blocks. */
4717 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4720 /* Now add symbols from all per-file blocks if we've gotten no hits
4721 (not strictly correct, but perhaps better than an error). */
4723 if (num_defns_collected (&symbol_list_obstack
) == 0)
4724 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4728 ndefns
= num_defns_collected (&symbol_list_obstack
);
4729 *results
= defns_collected (&symbol_list_obstack
, 1);
4731 ndefns
= remove_extra_symbols (*results
, ndefns
);
4734 cache_symbol (name0
, namespace, NULL
, NULL
);
4736 if (ndefns
== 1 && cacheIfUnique
)
4737 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4739 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4745 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4746 domain_enum
namespace, struct block
**block_found
)
4748 struct ada_symbol_info
*candidates
;
4751 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4753 if (n_candidates
== 0)
4756 if (block_found
!= NULL
)
4757 *block_found
= candidates
[0].block
;
4759 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4762 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4763 scope and in global scopes, or NULL if none. NAME is folded and
4764 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4765 choosing the first symbol if there are multiple choices.
4766 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4767 table in which the symbol was found (in both cases, these
4768 assignments occur only if the pointers are non-null). */
4770 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4771 domain_enum
namespace, int *is_a_field_of_this
)
4773 if (is_a_field_of_this
!= NULL
)
4774 *is_a_field_of_this
= 0;
4777 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4778 block0
, namespace, NULL
);
4781 static struct symbol
*
4782 ada_lookup_symbol_nonlocal (const char *name
,
4783 const char *linkage_name
,
4784 const struct block
*block
,
4785 const domain_enum domain
)
4787 if (linkage_name
== NULL
)
4788 linkage_name
= name
;
4789 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4794 /* True iff STR is a possible encoded suffix of a normal Ada name
4795 that is to be ignored for matching purposes. Suffixes of parallel
4796 names (e.g., XVE) are not included here. Currently, the possible suffixes
4797 are given by any of the regular expressions:
4799 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4800 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4801 _E[0-9]+[bs]$ [protected object entry suffixes]
4802 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4804 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4805 match is performed. This sequence is used to differentiate homonyms,
4806 is an optional part of a valid name suffix. */
4809 is_name_suffix (const char *str
)
4812 const char *matching
;
4813 const int len
= strlen (str
);
4815 /* Skip optional leading __[0-9]+. */
4817 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4820 while (isdigit (str
[0]))
4826 if (str
[0] == '.' || str
[0] == '$')
4829 while (isdigit (matching
[0]))
4831 if (matching
[0] == '\0')
4837 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4840 while (isdigit (matching
[0]))
4842 if (matching
[0] == '\0')
4847 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4848 with a N at the end. Unfortunately, the compiler uses the same
4849 convention for other internal types it creates. So treating
4850 all entity names that end with an "N" as a name suffix causes
4851 some regressions. For instance, consider the case of an enumerated
4852 type. To support the 'Image attribute, it creates an array whose
4854 Having a single character like this as a suffix carrying some
4855 information is a bit risky. Perhaps we should change the encoding
4856 to be something like "_N" instead. In the meantime, do not do
4857 the following check. */
4858 /* Protected Object Subprograms */
4859 if (len
== 1 && str
[0] == 'N')
4864 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4867 while (isdigit (matching
[0]))
4869 if ((matching
[0] == 'b' || matching
[0] == 's')
4870 && matching
[1] == '\0')
4874 /* ??? We should not modify STR directly, as we are doing below. This
4875 is fine in this case, but may become problematic later if we find
4876 that this alternative did not work, and want to try matching
4877 another one from the begining of STR. Since we modified it, we
4878 won't be able to find the begining of the string anymore! */
4882 while (str
[0] != '_' && str
[0] != '\0')
4884 if (str
[0] != 'n' && str
[0] != 'b')
4890 if (str
[0] == '\000')
4895 if (str
[1] != '_' || str
[2] == '\000')
4899 if (strcmp (str
+ 3, "JM") == 0)
4901 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4902 the LJM suffix in favor of the JM one. But we will
4903 still accept LJM as a valid suffix for a reasonable
4904 amount of time, just to allow ourselves to debug programs
4905 compiled using an older version of GNAT. */
4906 if (strcmp (str
+ 3, "LJM") == 0)
4910 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4911 || str
[4] == 'U' || str
[4] == 'P')
4913 if (str
[4] == 'R' && str
[5] != 'T')
4917 if (!isdigit (str
[2]))
4919 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4920 if (!isdigit (str
[k
]) && str
[k
] != '_')
4924 if (str
[0] == '$' && isdigit (str
[1]))
4926 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4927 if (!isdigit (str
[k
]) && str
[k
] != '_')
4934 /* Return non-zero if the string starting at NAME and ending before
4935 NAME_END contains no capital letters. */
4938 is_valid_name_for_wild_match (const char *name0
)
4940 const char *decoded_name
= ada_decode (name0
);
4943 /* If the decoded name starts with an angle bracket, it means that
4944 NAME0 does not follow the GNAT encoding format. It should then
4945 not be allowed as a possible wild match. */
4946 if (decoded_name
[0] == '<')
4949 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4950 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4956 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4957 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4958 informational suffixes of NAME (i.e., for which is_name_suffix is
4962 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4969 match
= strstr (start
, patn0
);
4974 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
4975 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
4976 && is_name_suffix (match
+ patn_len
))
4977 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
4982 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4983 vector *defn_symbols, updating the list of symbols in OBSTACKP
4984 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4985 OBJFILE is the section containing BLOCK.
4986 SYMTAB is recorded with each symbol added. */
4989 ada_add_block_symbols (struct obstack
*obstackp
,
4990 struct block
*block
, const char *name
,
4991 domain_enum domain
, struct objfile
*objfile
,
4994 struct dict_iterator iter
;
4995 int name_len
= strlen (name
);
4996 /* A matching argument symbol, if any. */
4997 struct symbol
*arg_sym
;
4998 /* Set true when we find a matching non-argument symbol. */
5007 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5009 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5010 SYMBOL_DOMAIN (sym
), domain
)
5011 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5013 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5015 else if (SYMBOL_IS_ARGUMENT (sym
))
5020 add_defn_to_vec (obstackp
,
5021 fixup_symbol_section (sym
, objfile
),
5029 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5031 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5032 SYMBOL_DOMAIN (sym
), domain
))
5034 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5036 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5038 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5040 if (SYMBOL_IS_ARGUMENT (sym
))
5045 add_defn_to_vec (obstackp
,
5046 fixup_symbol_section (sym
, objfile
),
5055 if (!found_sym
&& arg_sym
!= NULL
)
5057 add_defn_to_vec (obstackp
,
5058 fixup_symbol_section (arg_sym
, objfile
),
5067 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5069 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5070 SYMBOL_DOMAIN (sym
), domain
))
5074 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5077 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5079 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5084 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5086 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5088 if (SYMBOL_IS_ARGUMENT (sym
))
5093 add_defn_to_vec (obstackp
,
5094 fixup_symbol_section (sym
, objfile
),
5102 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5103 They aren't parameters, right? */
5104 if (!found_sym
&& arg_sym
!= NULL
)
5106 add_defn_to_vec (obstackp
,
5107 fixup_symbol_section (arg_sym
, objfile
),
5114 /* Symbol Completion */
5116 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5117 name in a form that's appropriate for the completion. The result
5118 does not need to be deallocated, but is only good until the next call.
5120 TEXT_LEN is equal to the length of TEXT.
5121 Perform a wild match if WILD_MATCH is set.
5122 ENCODED should be set if TEXT represents the start of a symbol name
5123 in its encoded form. */
5126 symbol_completion_match (const char *sym_name
,
5127 const char *text
, int text_len
,
5128 int wild_match
, int encoded
)
5131 const int verbatim_match
= (text
[0] == '<');
5136 /* Strip the leading angle bracket. */
5141 /* First, test against the fully qualified name of the symbol. */
5143 if (strncmp (sym_name
, text
, text_len
) == 0)
5146 if (match
&& !encoded
)
5148 /* One needed check before declaring a positive match is to verify
5149 that iff we are doing a verbatim match, the decoded version
5150 of the symbol name starts with '<'. Otherwise, this symbol name
5151 is not a suitable completion. */
5152 const char *sym_name_copy
= sym_name
;
5153 int has_angle_bracket
;
5155 sym_name
= ada_decode (sym_name
);
5156 has_angle_bracket
= (sym_name
[0] == '<');
5157 match
= (has_angle_bracket
== verbatim_match
);
5158 sym_name
= sym_name_copy
;
5161 if (match
&& !verbatim_match
)
5163 /* When doing non-verbatim match, another check that needs to
5164 be done is to verify that the potentially matching symbol name
5165 does not include capital letters, because the ada-mode would
5166 not be able to understand these symbol names without the
5167 angle bracket notation. */
5170 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5175 /* Second: Try wild matching... */
5177 if (!match
&& wild_match
)
5179 /* Since we are doing wild matching, this means that TEXT
5180 may represent an unqualified symbol name. We therefore must
5181 also compare TEXT against the unqualified name of the symbol. */
5182 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5184 if (strncmp (sym_name
, text
, text_len
) == 0)
5188 /* Finally: If we found a mach, prepare the result to return. */
5194 sym_name
= add_angle_brackets (sym_name
);
5197 sym_name
= ada_decode (sym_name
);
5202 typedef char *char_ptr
;
5203 DEF_VEC_P (char_ptr
);
5205 /* A companion function to ada_make_symbol_completion_list().
5206 Check if SYM_NAME represents a symbol which name would be suitable
5207 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5208 it is appended at the end of the given string vector SV.
5210 ORIG_TEXT is the string original string from the user command
5211 that needs to be completed. WORD is the entire command on which
5212 completion should be performed. These two parameters are used to
5213 determine which part of the symbol name should be added to the
5215 if WILD_MATCH is set, then wild matching is performed.
5216 ENCODED should be set if TEXT represents a symbol name in its
5217 encoded formed (in which case the completion should also be
5221 symbol_completion_add (VEC(char_ptr
) **sv
,
5222 const char *sym_name
,
5223 const char *text
, int text_len
,
5224 const char *orig_text
, const char *word
,
5225 int wild_match
, int encoded
)
5227 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5228 wild_match
, encoded
);
5234 /* We found a match, so add the appropriate completion to the given
5237 if (word
== orig_text
)
5239 completion
= xmalloc (strlen (match
) + 5);
5240 strcpy (completion
, match
);
5242 else if (word
> orig_text
)
5244 /* Return some portion of sym_name. */
5245 completion
= xmalloc (strlen (match
) + 5);
5246 strcpy (completion
, match
+ (word
- orig_text
));
5250 /* Return some of ORIG_TEXT plus sym_name. */
5251 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5252 strncpy (completion
, word
, orig_text
- word
);
5253 completion
[orig_text
- word
] = '\0';
5254 strcat (completion
, match
);
5257 VEC_safe_push (char_ptr
, *sv
, completion
);
5260 /* Return a list of possible symbol names completing TEXT0. The list
5261 is NULL terminated. WORD is the entire command on which completion
5265 ada_make_symbol_completion_list (char *text0
, char *word
)
5271 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5274 struct partial_symtab
*ps
;
5275 struct minimal_symbol
*msymbol
;
5276 struct objfile
*objfile
;
5277 struct block
*b
, *surrounding_static_block
= 0;
5279 struct dict_iterator iter
;
5281 if (text0
[0] == '<')
5283 text
= xstrdup (text0
);
5284 make_cleanup (xfree
, text
);
5285 text_len
= strlen (text
);
5291 text
= xstrdup (ada_encode (text0
));
5292 make_cleanup (xfree
, text
);
5293 text_len
= strlen (text
);
5294 for (i
= 0; i
< text_len
; i
++)
5295 text
[i
] = tolower (text
[i
]);
5297 encoded
= (strstr (text0
, "__") != NULL
);
5298 /* If the name contains a ".", then the user is entering a fully
5299 qualified entity name, and the match must not be done in wild
5300 mode. Similarly, if the user wants to complete what looks like
5301 an encoded name, the match must not be done in wild mode. */
5302 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5305 /* First, look at the partial symtab symbols. */
5306 ALL_PSYMTABS (objfile
, ps
)
5308 struct partial_symbol
**psym
;
5310 /* If the psymtab's been read in we'll get it when we search
5311 through the blockvector. */
5315 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5316 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5317 + ps
->n_global_syms
); psym
++)
5320 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5321 text
, text_len
, text0
, word
,
5322 wild_match
, encoded
);
5325 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5326 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5327 + ps
->n_static_syms
); psym
++)
5330 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5331 text
, text_len
, text0
, word
,
5332 wild_match
, encoded
);
5336 /* At this point scan through the misc symbol vectors and add each
5337 symbol you find to the list. Eventually we want to ignore
5338 anything that isn't a text symbol (everything else will be
5339 handled by the psymtab code above). */
5341 ALL_MSYMBOLS (objfile
, msymbol
)
5344 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5345 text
, text_len
, text0
, word
, wild_match
, encoded
);
5348 /* Search upwards from currently selected frame (so that we can
5349 complete on local vars. */
5351 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5353 if (!BLOCK_SUPERBLOCK (b
))
5354 surrounding_static_block
= b
; /* For elmin of dups */
5356 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5358 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5359 text
, text_len
, text0
, word
,
5360 wild_match
, encoded
);
5364 /* Go through the symtabs and check the externs and statics for
5365 symbols which match. */
5367 ALL_SYMTABS (objfile
, s
)
5370 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5371 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5373 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5374 text
, text_len
, text0
, word
,
5375 wild_match
, encoded
);
5379 ALL_SYMTABS (objfile
, s
)
5382 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5383 /* Don't do this block twice. */
5384 if (b
== surrounding_static_block
)
5386 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5388 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5389 text
, text_len
, text0
, word
,
5390 wild_match
, encoded
);
5394 /* Append the closing NULL entry. */
5395 VEC_safe_push (char_ptr
, completions
, NULL
);
5397 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5398 return the copy. It's unfortunate that we have to make a copy
5399 of an array that we're about to destroy, but there is nothing much
5400 we can do about it. Fortunately, it's typically not a very large
5403 const size_t completions_size
=
5404 VEC_length (char_ptr
, completions
) * sizeof (char *);
5405 char **result
= malloc (completions_size
);
5407 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5409 VEC_free (char_ptr
, completions
);
5416 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5417 for tagged types. */
5420 ada_is_dispatch_table_ptr_type (struct type
*type
)
5424 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5427 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5431 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5434 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5435 to be invisible to users. */
5438 ada_is_ignored_field (struct type
*type
, int field_num
)
5440 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5443 /* Check the name of that field. */
5445 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5447 /* Anonymous field names should not be printed.
5448 brobecker/2007-02-20: I don't think this can actually happen
5449 but we don't want to print the value of annonymous fields anyway. */
5453 /* A field named "_parent" is internally generated by GNAT for
5454 tagged types, and should not be printed either. */
5455 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5459 /* If this is the dispatch table of a tagged type, then ignore. */
5460 if (ada_is_tagged_type (type
, 1)
5461 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5464 /* Not a special field, so it should not be ignored. */
5468 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5469 pointer or reference type whose ultimate target has a tag field. */
5472 ada_is_tagged_type (struct type
*type
, int refok
)
5474 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5477 /* True iff TYPE represents the type of X'Tag */
5480 ada_is_tag_type (struct type
*type
)
5482 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5486 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5487 return (name
!= NULL
5488 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5492 /* The type of the tag on VAL. */
5495 ada_tag_type (struct value
*val
)
5497 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5500 /* The value of the tag on VAL. */
5503 ada_value_tag (struct value
*val
)
5505 return ada_value_struct_elt (val
, "_tag", 0);
5508 /* The value of the tag on the object of type TYPE whose contents are
5509 saved at VALADDR, if it is non-null, or is at memory address
5512 static struct value
*
5513 value_tag_from_contents_and_address (struct type
*type
,
5514 const gdb_byte
*valaddr
,
5517 int tag_byte_offset
, dummy1
, dummy2
;
5518 struct type
*tag_type
;
5519 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5522 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5524 : valaddr
+ tag_byte_offset
);
5525 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5527 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5532 static struct type
*
5533 type_from_tag (struct value
*tag
)
5535 const char *type_name
= ada_tag_name (tag
);
5536 if (type_name
!= NULL
)
5537 return ada_find_any_type (ada_encode (type_name
));
5548 static int ada_tag_name_1 (void *);
5549 static int ada_tag_name_2 (struct tag_args
*);
5551 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5552 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5553 The value stored in ARGS->name is valid until the next call to
5557 ada_tag_name_1 (void *args0
)
5559 struct tag_args
*args
= (struct tag_args
*) args0
;
5560 static char name
[1024];
5564 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5566 return ada_tag_name_2 (args
);
5567 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5570 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5571 for (p
= name
; *p
!= '\0'; p
+= 1)
5578 /* Utility function for ada_tag_name_1 that tries the second
5579 representation for the dispatch table (in which there is no
5580 explicit 'tsd' field in the referent of the tag pointer, and instead
5581 the tsd pointer is stored just before the dispatch table. */
5584 ada_tag_name_2 (struct tag_args
*args
)
5586 struct type
*info_type
;
5587 static char name
[1024];
5589 struct value
*val
, *valp
;
5592 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5593 if (info_type
== NULL
)
5595 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5596 valp
= value_cast (info_type
, args
->tag
);
5599 val
= value_ind (value_ptradd (valp
, -1));
5602 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5605 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5606 for (p
= name
; *p
!= '\0'; p
+= 1)
5613 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5617 ada_tag_name (struct value
*tag
)
5619 struct tag_args args
;
5620 if (!ada_is_tag_type (value_type (tag
)))
5624 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5628 /* The parent type of TYPE, or NULL if none. */
5631 ada_parent_type (struct type
*type
)
5635 type
= ada_check_typedef (type
);
5637 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5640 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5641 if (ada_is_parent_field (type
, i
))
5643 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5645 /* If the _parent field is a pointer, then dereference it. */
5646 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5647 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5648 /* If there is a parallel XVS type, get the actual base type. */
5649 parent_type
= ada_get_base_type (parent_type
);
5651 return ada_check_typedef (parent_type
);
5657 /* True iff field number FIELD_NUM of structure type TYPE contains the
5658 parent-type (inherited) fields of a derived type. Assumes TYPE is
5659 a structure type with at least FIELD_NUM+1 fields. */
5662 ada_is_parent_field (struct type
*type
, int field_num
)
5664 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5665 return (name
!= NULL
5666 && (strncmp (name
, "PARENT", 6) == 0
5667 || strncmp (name
, "_parent", 7) == 0));
5670 /* True iff field number FIELD_NUM of structure type TYPE is a
5671 transparent wrapper field (which should be silently traversed when doing
5672 field selection and flattened when printing). Assumes TYPE is a
5673 structure type with at least FIELD_NUM+1 fields. Such fields are always
5677 ada_is_wrapper_field (struct type
*type
, int field_num
)
5679 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5680 return (name
!= NULL
5681 && (strncmp (name
, "PARENT", 6) == 0
5682 || strcmp (name
, "REP") == 0
5683 || strncmp (name
, "_parent", 7) == 0
5684 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5687 /* True iff field number FIELD_NUM of structure or union type TYPE
5688 is a variant wrapper. Assumes TYPE is a structure type with at least
5689 FIELD_NUM+1 fields. */
5692 ada_is_variant_part (struct type
*type
, int field_num
)
5694 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5695 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5696 || (is_dynamic_field (type
, field_num
)
5697 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5698 == TYPE_CODE_UNION
)));
5701 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5702 whose discriminants are contained in the record type OUTER_TYPE,
5703 returns the type of the controlling discriminant for the variant.
5704 May return NULL if the type could not be found. */
5707 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5709 char *name
= ada_variant_discrim_name (var_type
);
5710 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5713 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5714 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5715 represents a 'when others' clause; otherwise 0. */
5718 ada_is_others_clause (struct type
*type
, int field_num
)
5720 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5721 return (name
!= NULL
&& name
[0] == 'O');
5724 /* Assuming that TYPE0 is the type of the variant part of a record,
5725 returns the name of the discriminant controlling the variant.
5726 The value is valid until the next call to ada_variant_discrim_name. */
5729 ada_variant_discrim_name (struct type
*type0
)
5731 static char *result
= NULL
;
5732 static size_t result_len
= 0;
5735 const char *discrim_end
;
5736 const char *discrim_start
;
5738 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5739 type
= TYPE_TARGET_TYPE (type0
);
5743 name
= ada_type_name (type
);
5745 if (name
== NULL
|| name
[0] == '\000')
5748 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5751 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5754 if (discrim_end
== name
)
5757 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5760 if (discrim_start
== name
+ 1)
5762 if ((discrim_start
> name
+ 3
5763 && strncmp (discrim_start
- 3, "___", 3) == 0)
5764 || discrim_start
[-1] == '.')
5768 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5769 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5770 result
[discrim_end
- discrim_start
] = '\0';
5774 /* Scan STR for a subtype-encoded number, beginning at position K.
5775 Put the position of the character just past the number scanned in
5776 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5777 Return 1 if there was a valid number at the given position, and 0
5778 otherwise. A "subtype-encoded" number consists of the absolute value
5779 in decimal, followed by the letter 'm' to indicate a negative number.
5780 Assumes 0m does not occur. */
5783 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5787 if (!isdigit (str
[k
]))
5790 /* Do it the hard way so as not to make any assumption about
5791 the relationship of unsigned long (%lu scan format code) and
5794 while (isdigit (str
[k
]))
5796 RU
= RU
* 10 + (str
[k
] - '0');
5803 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5809 /* NOTE on the above: Technically, C does not say what the results of
5810 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5811 number representable as a LONGEST (although either would probably work
5812 in most implementations). When RU>0, the locution in the then branch
5813 above is always equivalent to the negative of RU. */
5820 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5821 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5822 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5825 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5827 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5840 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5849 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5850 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5852 if (val
>= L
&& val
<= U
)
5864 /* FIXME: Lots of redundancy below. Try to consolidate. */
5866 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5867 ARG_TYPE, extract and return the value of one of its (non-static)
5868 fields. FIELDNO says which field. Differs from value_primitive_field
5869 only in that it can handle packed values of arbitrary type. */
5871 static struct value
*
5872 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5873 struct type
*arg_type
)
5877 arg_type
= ada_check_typedef (arg_type
);
5878 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5880 /* Handle packed fields. */
5882 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5884 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5885 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5887 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5888 offset
+ bit_pos
/ 8,
5889 bit_pos
% 8, bit_size
, type
);
5892 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5895 /* Find field with name NAME in object of type TYPE. If found,
5896 set the following for each argument that is non-null:
5897 - *FIELD_TYPE_P to the field's type;
5898 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5899 an object of that type;
5900 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5901 - *BIT_SIZE_P to its size in bits if the field is packed, and
5903 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5904 fields up to but not including the desired field, or by the total
5905 number of fields if not found. A NULL value of NAME never
5906 matches; the function just counts visible fields in this case.
5908 Returns 1 if found, 0 otherwise. */
5911 find_struct_field (char *name
, struct type
*type
, int offset
,
5912 struct type
**field_type_p
,
5913 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5918 type
= ada_check_typedef (type
);
5920 if (field_type_p
!= NULL
)
5921 *field_type_p
= NULL
;
5922 if (byte_offset_p
!= NULL
)
5924 if (bit_offset_p
!= NULL
)
5926 if (bit_size_p
!= NULL
)
5929 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5931 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5932 int fld_offset
= offset
+ bit_pos
/ 8;
5933 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5935 if (t_field_name
== NULL
)
5938 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5940 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5941 if (field_type_p
!= NULL
)
5942 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5943 if (byte_offset_p
!= NULL
)
5944 *byte_offset_p
= fld_offset
;
5945 if (bit_offset_p
!= NULL
)
5946 *bit_offset_p
= bit_pos
% 8;
5947 if (bit_size_p
!= NULL
)
5948 *bit_size_p
= bit_size
;
5951 else if (ada_is_wrapper_field (type
, i
))
5953 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5954 field_type_p
, byte_offset_p
, bit_offset_p
,
5955 bit_size_p
, index_p
))
5958 else if (ada_is_variant_part (type
, i
))
5960 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5963 struct type
*field_type
5964 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5966 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5968 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5970 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5971 field_type_p
, byte_offset_p
,
5972 bit_offset_p
, bit_size_p
, index_p
))
5976 else if (index_p
!= NULL
)
5982 /* Number of user-visible fields in record type TYPE. */
5985 num_visible_fields (struct type
*type
)
5989 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5993 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5994 and search in it assuming it has (class) type TYPE.
5995 If found, return value, else return NULL.
5997 Searches recursively through wrapper fields (e.g., '_parent'). */
5999 static struct value
*
6000 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6004 type
= ada_check_typedef (type
);
6006 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6008 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6010 if (t_field_name
== NULL
)
6013 else if (field_name_match (t_field_name
, name
))
6014 return ada_value_primitive_field (arg
, offset
, i
, type
);
6016 else if (ada_is_wrapper_field (type
, i
))
6018 struct value
*v
= /* Do not let indent join lines here. */
6019 ada_search_struct_field (name
, arg
,
6020 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6021 TYPE_FIELD_TYPE (type
, i
));
6026 else if (ada_is_variant_part (type
, i
))
6028 /* PNH: Do we ever get here? See find_struct_field. */
6030 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6031 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6033 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6035 struct value
*v
= ada_search_struct_field
/* Force line break. */
6037 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6038 TYPE_FIELD_TYPE (field_type
, j
));
6047 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6048 int, struct type
*);
6051 /* Return field #INDEX in ARG, where the index is that returned by
6052 * find_struct_field through its INDEX_P argument. Adjust the address
6053 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6054 * If found, return value, else return NULL. */
6056 static struct value
*
6057 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6060 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6064 /* Auxiliary function for ada_index_struct_field. Like
6065 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6068 static struct value
*
6069 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6073 type
= ada_check_typedef (type
);
6075 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6077 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6079 else if (ada_is_wrapper_field (type
, i
))
6081 struct value
*v
= /* Do not let indent join lines here. */
6082 ada_index_struct_field_1 (index_p
, arg
,
6083 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6084 TYPE_FIELD_TYPE (type
, i
));
6089 else if (ada_is_variant_part (type
, i
))
6091 /* PNH: Do we ever get here? See ada_search_struct_field,
6092 find_struct_field. */
6093 error (_("Cannot assign this kind of variant record"));
6095 else if (*index_p
== 0)
6096 return ada_value_primitive_field (arg
, offset
, i
, type
);
6103 /* Given ARG, a value of type (pointer or reference to a)*
6104 structure/union, extract the component named NAME from the ultimate
6105 target structure/union and return it as a value with its
6108 The routine searches for NAME among all members of the structure itself
6109 and (recursively) among all members of any wrapper members
6112 If NO_ERR, then simply return NULL in case of error, rather than
6116 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6118 struct type
*t
, *t1
;
6122 t1
= t
= ada_check_typedef (value_type (arg
));
6123 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6125 t1
= TYPE_TARGET_TYPE (t
);
6128 t1
= ada_check_typedef (t1
);
6129 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6131 arg
= coerce_ref (arg
);
6136 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6138 t1
= TYPE_TARGET_TYPE (t
);
6141 t1
= ada_check_typedef (t1
);
6142 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6144 arg
= value_ind (arg
);
6151 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6155 v
= ada_search_struct_field (name
, arg
, 0, t
);
6158 int bit_offset
, bit_size
, byte_offset
;
6159 struct type
*field_type
;
6162 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6163 address
= value_as_address (arg
);
6165 address
= unpack_pointer (t
, value_contents (arg
));
6167 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6168 if (find_struct_field (name
, t1
, 0,
6169 &field_type
, &byte_offset
, &bit_offset
,
6174 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6175 arg
= ada_coerce_ref (arg
);
6177 arg
= ada_value_ind (arg
);
6178 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6179 bit_offset
, bit_size
,
6183 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6187 if (v
!= NULL
|| no_err
)
6190 error (_("There is no member named %s."), name
);
6196 error (_("Attempt to extract a component of a value that is not a record."));
6199 /* Given a type TYPE, look up the type of the component of type named NAME.
6200 If DISPP is non-null, add its byte displacement from the beginning of a
6201 structure (pointed to by a value) of type TYPE to *DISPP (does not
6202 work for packed fields).
6204 Matches any field whose name has NAME as a prefix, possibly
6207 TYPE can be either a struct or union. If REFOK, TYPE may also
6208 be a (pointer or reference)+ to a struct or union, and the
6209 ultimate target type will be searched.
6211 Looks recursively into variant clauses and parent types.
6213 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6214 TYPE is not a type of the right kind. */
6216 static struct type
*
6217 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6218 int noerr
, int *dispp
)
6225 if (refok
&& type
!= NULL
)
6228 type
= ada_check_typedef (type
);
6229 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6230 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6232 type
= TYPE_TARGET_TYPE (type
);
6236 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6237 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6243 target_terminal_ours ();
6244 gdb_flush (gdb_stdout
);
6246 error (_("Type (null) is not a structure or union type"));
6249 /* XXX: type_sprint */
6250 fprintf_unfiltered (gdb_stderr
, _("Type "));
6251 type_print (type
, "", gdb_stderr
, -1);
6252 error (_(" is not a structure or union type"));
6257 type
= to_static_fixed_type (type
);
6259 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6261 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6265 if (t_field_name
== NULL
)
6268 else if (field_name_match (t_field_name
, name
))
6271 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6272 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6275 else if (ada_is_wrapper_field (type
, i
))
6278 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6283 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6288 else if (ada_is_variant_part (type
, i
))
6291 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6293 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6295 /* FIXME pnh 2008/01/26: We check for a field that is
6296 NOT wrapped in a struct, since the compiler sometimes
6297 generates these for unchecked variant types. Revisit
6298 if the compiler changes this practice. */
6299 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6301 if (v_field_name
!= NULL
6302 && field_name_match (v_field_name
, name
))
6303 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6305 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6311 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6322 target_terminal_ours ();
6323 gdb_flush (gdb_stdout
);
6326 /* XXX: type_sprint */
6327 fprintf_unfiltered (gdb_stderr
, _("Type "));
6328 type_print (type
, "", gdb_stderr
, -1);
6329 error (_(" has no component named <null>"));
6333 /* XXX: type_sprint */
6334 fprintf_unfiltered (gdb_stderr
, _("Type "));
6335 type_print (type
, "", gdb_stderr
, -1);
6336 error (_(" has no component named %s"), name
);
6343 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6344 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6345 represents an unchecked union (that is, the variant part of a
6346 record that is named in an Unchecked_Union pragma). */
6349 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6351 char *discrim_name
= ada_variant_discrim_name (var_type
);
6352 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6357 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6358 within a value of type OUTER_TYPE that is stored in GDB at
6359 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6360 numbering from 0) is applicable. Returns -1 if none are. */
6363 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6364 const gdb_byte
*outer_valaddr
)
6368 char *discrim_name
= ada_variant_discrim_name (var_type
);
6369 struct value
*outer
;
6370 struct value
*discrim
;
6371 LONGEST discrim_val
;
6373 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6374 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6375 if (discrim
== NULL
)
6377 discrim_val
= value_as_long (discrim
);
6380 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6382 if (ada_is_others_clause (var_type
, i
))
6384 else if (ada_in_variant (discrim_val
, var_type
, i
))
6388 return others_clause
;
6393 /* Dynamic-Sized Records */
6395 /* Strategy: The type ostensibly attached to a value with dynamic size
6396 (i.e., a size that is not statically recorded in the debugging
6397 data) does not accurately reflect the size or layout of the value.
6398 Our strategy is to convert these values to values with accurate,
6399 conventional types that are constructed on the fly. */
6401 /* There is a subtle and tricky problem here. In general, we cannot
6402 determine the size of dynamic records without its data. However,
6403 the 'struct value' data structure, which GDB uses to represent
6404 quantities in the inferior process (the target), requires the size
6405 of the type at the time of its allocation in order to reserve space
6406 for GDB's internal copy of the data. That's why the
6407 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6408 rather than struct value*s.
6410 However, GDB's internal history variables ($1, $2, etc.) are
6411 struct value*s containing internal copies of the data that are not, in
6412 general, the same as the data at their corresponding addresses in
6413 the target. Fortunately, the types we give to these values are all
6414 conventional, fixed-size types (as per the strategy described
6415 above), so that we don't usually have to perform the
6416 'to_fixed_xxx_type' conversions to look at their values.
6417 Unfortunately, there is one exception: if one of the internal
6418 history variables is an array whose elements are unconstrained
6419 records, then we will need to create distinct fixed types for each
6420 element selected. */
6422 /* The upshot of all of this is that many routines take a (type, host
6423 address, target address) triple as arguments to represent a value.
6424 The host address, if non-null, is supposed to contain an internal
6425 copy of the relevant data; otherwise, the program is to consult the
6426 target at the target address. */
6428 /* Assuming that VAL0 represents a pointer value, the result of
6429 dereferencing it. Differs from value_ind in its treatment of
6430 dynamic-sized types. */
6433 ada_value_ind (struct value
*val0
)
6435 struct value
*val
= unwrap_value (value_ind (val0
));
6436 return ada_to_fixed_value (val
);
6439 /* The value resulting from dereferencing any "reference to"
6440 qualifiers on VAL0. */
6442 static struct value
*
6443 ada_coerce_ref (struct value
*val0
)
6445 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6447 struct value
*val
= val0
;
6448 val
= coerce_ref (val
);
6449 val
= unwrap_value (val
);
6450 return ada_to_fixed_value (val
);
6456 /* Return OFF rounded upward if necessary to a multiple of
6457 ALIGNMENT (a power of 2). */
6460 align_value (unsigned int off
, unsigned int alignment
)
6462 return (off
+ alignment
- 1) & ~(alignment
- 1);
6465 /* Return the bit alignment required for field #F of template type TYPE. */
6468 field_alignment (struct type
*type
, int f
)
6470 const char *name
= TYPE_FIELD_NAME (type
, f
);
6474 /* The field name should never be null, unless the debugging information
6475 is somehow malformed. In this case, we assume the field does not
6476 require any alignment. */
6480 len
= strlen (name
);
6482 if (!isdigit (name
[len
- 1]))
6485 if (isdigit (name
[len
- 2]))
6486 align_offset
= len
- 2;
6488 align_offset
= len
- 1;
6490 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6491 return TARGET_CHAR_BIT
;
6493 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6496 /* Find a symbol named NAME. Ignores ambiguity. */
6499 ada_find_any_symbol (const char *name
)
6503 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6504 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6507 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6511 /* Find a type named NAME. Ignores ambiguity. This routine will look
6512 solely for types defined by debug info, it will not search the GDB
6516 ada_find_any_type (const char *name
)
6518 struct symbol
*sym
= ada_find_any_symbol (name
);
6521 return SYMBOL_TYPE (sym
);
6526 /* Given NAME and an associated BLOCK, search all symbols for
6527 NAME suffixed with "___XR", which is the ``renaming'' symbol
6528 associated to NAME. Return this symbol if found, return
6532 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6536 sym
= find_old_style_renaming_symbol (name
, block
);
6541 /* Not right yet. FIXME pnh 7/20/2007. */
6542 sym
= ada_find_any_symbol (name
);
6543 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6549 static struct symbol
*
6550 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6552 const struct symbol
*function_sym
= block_linkage_function (block
);
6555 if (function_sym
!= NULL
)
6557 /* If the symbol is defined inside a function, NAME is not fully
6558 qualified. This means we need to prepend the function name
6559 as well as adding the ``___XR'' suffix to build the name of
6560 the associated renaming symbol. */
6561 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6562 /* Function names sometimes contain suffixes used
6563 for instance to qualify nested subprograms. When building
6564 the XR type name, we need to make sure that this suffix is
6565 not included. So do not include any suffix in the function
6566 name length below. */
6567 int function_name_len
= ada_name_prefix_len (function_name
);
6568 const int rename_len
= function_name_len
+ 2 /* "__" */
6569 + strlen (name
) + 6 /* "___XR\0" */ ;
6571 /* Strip the suffix if necessary. */
6572 ada_remove_trailing_digits (function_name
, &function_name_len
);
6573 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
6574 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
6576 /* Library-level functions are a special case, as GNAT adds
6577 a ``_ada_'' prefix to the function name to avoid namespace
6578 pollution. However, the renaming symbols themselves do not
6579 have this prefix, so we need to skip this prefix if present. */
6580 if (function_name_len
> 5 /* "_ada_" */
6581 && strstr (function_name
, "_ada_") == function_name
)
6584 function_name_len
-= 5;
6587 rename
= (char *) alloca (rename_len
* sizeof (char));
6588 strncpy (rename
, function_name
, function_name_len
);
6589 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
6594 const int rename_len
= strlen (name
) + 6;
6595 rename
= (char *) alloca (rename_len
* sizeof (char));
6596 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6599 return ada_find_any_symbol (rename
);
6602 /* Because of GNAT encoding conventions, several GDB symbols may match a
6603 given type name. If the type denoted by TYPE0 is to be preferred to
6604 that of TYPE1 for purposes of type printing, return non-zero;
6605 otherwise return 0. */
6608 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6612 else if (type0
== NULL
)
6614 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6616 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6618 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6620 else if (ada_is_constrained_packed_array_type (type0
))
6622 else if (ada_is_array_descriptor_type (type0
)
6623 && !ada_is_array_descriptor_type (type1
))
6627 const char *type0_name
= type_name_no_tag (type0
);
6628 const char *type1_name
= type_name_no_tag (type1
);
6630 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6631 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6637 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6638 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6641 ada_type_name (struct type
*type
)
6645 else if (TYPE_NAME (type
) != NULL
)
6646 return TYPE_NAME (type
);
6648 return TYPE_TAG_NAME (type
);
6651 /* Search the list of "descriptive" types associated to TYPE for a type
6652 whose name is NAME. */
6654 static struct type
*
6655 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
6657 struct type
*result
;
6659 /* If there no descriptive-type info, then there is no parallel type
6661 if (!HAVE_GNAT_AUX_INFO (type
))
6664 result
= TYPE_DESCRIPTIVE_TYPE (type
);
6665 while (result
!= NULL
)
6667 char *result_name
= ada_type_name (result
);
6669 if (result_name
== NULL
)
6671 warning (_("unexpected null name on descriptive type"));
6675 /* If the names match, stop. */
6676 if (strcmp (result_name
, name
) == 0)
6679 /* Otherwise, look at the next item on the list, if any. */
6680 if (HAVE_GNAT_AUX_INFO (result
))
6681 result
= TYPE_DESCRIPTIVE_TYPE (result
);
6686 /* If we didn't find a match, see whether this is a packed array. With
6687 older compilers, the descriptive type information is either absent or
6688 irrelevant when it comes to packed arrays so the above lookup fails.
6689 Fall back to using a parallel lookup by name in this case. */
6690 if (result
== NULL
&& ada_is_packed_array_type (type
))
6691 return ada_find_any_type (name
);
6696 /* Find a parallel type to TYPE with the specified NAME, using the
6697 descriptive type taken from the debugging information, if available,
6698 and otherwise using the (slower) name-based method. */
6700 static struct type
*
6701 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
6703 struct type
*result
= NULL
;
6705 if (HAVE_GNAT_AUX_INFO (type
))
6706 result
= find_parallel_type_by_descriptive_type (type
, name
);
6708 result
= ada_find_any_type (name
);
6713 /* Same as above, but specify the name of the parallel type by appending
6714 SUFFIX to the name of TYPE. */
6717 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6719 char *name
, *typename
= ada_type_name (type
);
6722 if (typename
== NULL
)
6725 len
= strlen (typename
);
6727 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
6729 strcpy (name
, typename
);
6730 strcpy (name
+ len
, suffix
);
6732 return ada_find_parallel_type_with_name (type
, name
);
6735 /* If TYPE is a variable-size record type, return the corresponding template
6736 type describing its fields. Otherwise, return NULL. */
6738 static struct type
*
6739 dynamic_template_type (struct type
*type
)
6741 type
= ada_check_typedef (type
);
6743 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6744 || ada_type_name (type
) == NULL
)
6748 int len
= strlen (ada_type_name (type
));
6749 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6752 return ada_find_parallel_type (type
, "___XVE");
6756 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6757 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6760 is_dynamic_field (struct type
*templ_type
, int field_num
)
6762 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6764 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6765 && strstr (name
, "___XVL") != NULL
;
6768 /* The index of the variant field of TYPE, or -1 if TYPE does not
6769 represent a variant record type. */
6772 variant_field_index (struct type
*type
)
6776 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6779 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6781 if (ada_is_variant_part (type
, f
))
6787 /* A record type with no fields. */
6789 static struct type
*
6790 empty_record (struct type
*template)
6792 struct type
*type
= alloc_type_copy (template);
6793 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6794 TYPE_NFIELDS (type
) = 0;
6795 TYPE_FIELDS (type
) = NULL
;
6796 INIT_CPLUS_SPECIFIC (type
);
6797 TYPE_NAME (type
) = "<empty>";
6798 TYPE_TAG_NAME (type
) = NULL
;
6799 TYPE_LENGTH (type
) = 0;
6803 /* An ordinary record type (with fixed-length fields) that describes
6804 the value of type TYPE at VALADDR or ADDRESS (see comments at
6805 the beginning of this section) VAL according to GNAT conventions.
6806 DVAL0 should describe the (portion of a) record that contains any
6807 necessary discriminants. It should be NULL if value_type (VAL) is
6808 an outer-level type (i.e., as opposed to a branch of a variant.) A
6809 variant field (unless unchecked) is replaced by a particular branch
6812 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6813 length are not statically known are discarded. As a consequence,
6814 VALADDR, ADDRESS and DVAL0 are ignored.
6816 NOTE: Limitations: For now, we assume that dynamic fields and
6817 variants occupy whole numbers of bytes. However, they need not be
6821 ada_template_to_fixed_record_type_1 (struct type
*type
,
6822 const gdb_byte
*valaddr
,
6823 CORE_ADDR address
, struct value
*dval0
,
6824 int keep_dynamic_fields
)
6826 struct value
*mark
= value_mark ();
6829 int nfields
, bit_len
;
6832 int fld_bit_len
, bit_incr
;
6835 /* Compute the number of fields in this record type that are going
6836 to be processed: unless keep_dynamic_fields, this includes only
6837 fields whose position and length are static will be processed. */
6838 if (keep_dynamic_fields
)
6839 nfields
= TYPE_NFIELDS (type
);
6843 while (nfields
< TYPE_NFIELDS (type
)
6844 && !ada_is_variant_part (type
, nfields
)
6845 && !is_dynamic_field (type
, nfields
))
6849 rtype
= alloc_type_copy (type
);
6850 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6851 INIT_CPLUS_SPECIFIC (rtype
);
6852 TYPE_NFIELDS (rtype
) = nfields
;
6853 TYPE_FIELDS (rtype
) = (struct field
*)
6854 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6855 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6856 TYPE_NAME (rtype
) = ada_type_name (type
);
6857 TYPE_TAG_NAME (rtype
) = NULL
;
6858 TYPE_FIXED_INSTANCE (rtype
) = 1;
6864 for (f
= 0; f
< nfields
; f
+= 1)
6866 off
= align_value (off
, field_alignment (type
, f
))
6867 + TYPE_FIELD_BITPOS (type
, f
);
6868 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6869 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6871 if (ada_is_variant_part (type
, f
))
6874 fld_bit_len
= bit_incr
= 0;
6876 else if (is_dynamic_field (type
, f
))
6878 const gdb_byte
*field_valaddr
= valaddr
;
6879 CORE_ADDR field_address
= address
;
6880 struct type
*field_type
=
6881 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
6885 /* rtype's length is computed based on the run-time
6886 value of discriminants. If the discriminants are not
6887 initialized, the type size may be completely bogus and
6888 GDB may fail to allocate a value for it. So check the
6889 size first before creating the value. */
6891 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6896 /* If the type referenced by this field is an aligner type, we need
6897 to unwrap that aligner type, because its size might not be set.
6898 Keeping the aligner type would cause us to compute the wrong
6899 size for this field, impacting the offset of the all the fields
6900 that follow this one. */
6901 if (ada_is_aligner_type (field_type
))
6903 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
6905 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
6906 field_address
= cond_offset_target (field_address
, field_offset
);
6907 field_type
= ada_aligned_type (field_type
);
6910 field_valaddr
= cond_offset_host (field_valaddr
,
6911 off
/ TARGET_CHAR_BIT
);
6912 field_address
= cond_offset_target (field_address
,
6913 off
/ TARGET_CHAR_BIT
);
6915 /* Get the fixed type of the field. Note that, in this case,
6916 we do not want to get the real type out of the tag: if
6917 the current field is the parent part of a tagged record,
6918 we will get the tag of the object. Clearly wrong: the real
6919 type of the parent is not the real type of the child. We
6920 would end up in an infinite loop. */
6921 field_type
= ada_get_base_type (field_type
);
6922 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
6923 field_address
, dval
, 0);
6925 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
6926 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6927 bit_incr
= fld_bit_len
=
6928 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6932 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6933 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6934 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6935 bit_incr
= fld_bit_len
=
6936 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6938 bit_incr
= fld_bit_len
=
6939 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6941 if (off
+ fld_bit_len
> bit_len
)
6942 bit_len
= off
+ fld_bit_len
;
6944 TYPE_LENGTH (rtype
) =
6945 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6948 /* We handle the variant part, if any, at the end because of certain
6949 odd cases in which it is re-ordered so as NOT to be the last field of
6950 the record. This can happen in the presence of representation
6952 if (variant_field
>= 0)
6954 struct type
*branch_type
;
6956 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6959 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6964 to_fixed_variant_branch_type
6965 (TYPE_FIELD_TYPE (type
, variant_field
),
6966 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6967 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6968 if (branch_type
== NULL
)
6970 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6971 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6972 TYPE_NFIELDS (rtype
) -= 1;
6976 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6977 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6979 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6981 if (off
+ fld_bit_len
> bit_len
)
6982 bit_len
= off
+ fld_bit_len
;
6983 TYPE_LENGTH (rtype
) =
6984 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6988 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6989 should contain the alignment of that record, which should be a strictly
6990 positive value. If null or negative, then something is wrong, most
6991 probably in the debug info. In that case, we don't round up the size
6992 of the resulting type. If this record is not part of another structure,
6993 the current RTYPE length might be good enough for our purposes. */
6994 if (TYPE_LENGTH (type
) <= 0)
6996 if (TYPE_NAME (rtype
))
6997 warning (_("Invalid type size for `%s' detected: %d."),
6998 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7000 warning (_("Invalid type size for <unnamed> detected: %d."),
7001 TYPE_LENGTH (type
));
7005 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7006 TYPE_LENGTH (type
));
7009 value_free_to_mark (mark
);
7010 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7011 error (_("record type with dynamic size is larger than varsize-limit"));
7015 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7018 static struct type
*
7019 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7020 CORE_ADDR address
, struct value
*dval0
)
7022 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7026 /* An ordinary record type in which ___XVL-convention fields and
7027 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7028 static approximations, containing all possible fields. Uses
7029 no runtime values. Useless for use in values, but that's OK,
7030 since the results are used only for type determinations. Works on both
7031 structs and unions. Representation note: to save space, we memorize
7032 the result of this function in the TYPE_TARGET_TYPE of the
7035 static struct type
*
7036 template_to_static_fixed_type (struct type
*type0
)
7042 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7043 return TYPE_TARGET_TYPE (type0
);
7045 nfields
= TYPE_NFIELDS (type0
);
7048 for (f
= 0; f
< nfields
; f
+= 1)
7050 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7051 struct type
*new_type
;
7053 if (is_dynamic_field (type0
, f
))
7054 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7056 new_type
= static_unwrap_type (field_type
);
7057 if (type
== type0
&& new_type
!= field_type
)
7059 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7060 TYPE_CODE (type
) = TYPE_CODE (type0
);
7061 INIT_CPLUS_SPECIFIC (type
);
7062 TYPE_NFIELDS (type
) = nfields
;
7063 TYPE_FIELDS (type
) = (struct field
*)
7064 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7065 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7066 sizeof (struct field
) * nfields
);
7067 TYPE_NAME (type
) = ada_type_name (type0
);
7068 TYPE_TAG_NAME (type
) = NULL
;
7069 TYPE_FIXED_INSTANCE (type
) = 1;
7070 TYPE_LENGTH (type
) = 0;
7072 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7073 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7078 /* Given an object of type TYPE whose contents are at VALADDR and
7079 whose address in memory is ADDRESS, returns a revision of TYPE,
7080 which should be a non-dynamic-sized record, in which the variant
7081 part, if any, is replaced with the appropriate branch. Looks
7082 for discriminant values in DVAL0, which can be NULL if the record
7083 contains the necessary discriminant values. */
7085 static struct type
*
7086 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7087 CORE_ADDR address
, struct value
*dval0
)
7089 struct value
*mark
= value_mark ();
7092 struct type
*branch_type
;
7093 int nfields
= TYPE_NFIELDS (type
);
7094 int variant_field
= variant_field_index (type
);
7096 if (variant_field
== -1)
7100 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7104 rtype
= alloc_type_copy (type
);
7105 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7106 INIT_CPLUS_SPECIFIC (rtype
);
7107 TYPE_NFIELDS (rtype
) = nfields
;
7108 TYPE_FIELDS (rtype
) =
7109 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7110 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7111 sizeof (struct field
) * nfields
);
7112 TYPE_NAME (rtype
) = ada_type_name (type
);
7113 TYPE_TAG_NAME (rtype
) = NULL
;
7114 TYPE_FIXED_INSTANCE (rtype
) = 1;
7115 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7117 branch_type
= to_fixed_variant_branch_type
7118 (TYPE_FIELD_TYPE (type
, variant_field
),
7119 cond_offset_host (valaddr
,
7120 TYPE_FIELD_BITPOS (type
, variant_field
)
7122 cond_offset_target (address
,
7123 TYPE_FIELD_BITPOS (type
, variant_field
)
7124 / TARGET_CHAR_BIT
), dval
);
7125 if (branch_type
== NULL
)
7128 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7129 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7130 TYPE_NFIELDS (rtype
) -= 1;
7134 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7135 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7136 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7137 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7139 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7141 value_free_to_mark (mark
);
7145 /* An ordinary record type (with fixed-length fields) that describes
7146 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7147 beginning of this section]. Any necessary discriminants' values
7148 should be in DVAL, a record value; it may be NULL if the object
7149 at ADDR itself contains any necessary discriminant values.
7150 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7151 values from the record are needed. Except in the case that DVAL,
7152 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7153 unchecked) is replaced by a particular branch of the variant.
7155 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7156 is questionable and may be removed. It can arise during the
7157 processing of an unconstrained-array-of-record type where all the
7158 variant branches have exactly the same size. This is because in
7159 such cases, the compiler does not bother to use the XVS convention
7160 when encoding the record. I am currently dubious of this
7161 shortcut and suspect the compiler should be altered. FIXME. */
7163 static struct type
*
7164 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7165 CORE_ADDR address
, struct value
*dval
)
7167 struct type
*templ_type
;
7169 if (TYPE_FIXED_INSTANCE (type0
))
7172 templ_type
= dynamic_template_type (type0
);
7174 if (templ_type
!= NULL
)
7175 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7176 else if (variant_field_index (type0
) >= 0)
7178 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7180 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7185 TYPE_FIXED_INSTANCE (type0
) = 1;
7191 /* An ordinary record type (with fixed-length fields) that describes
7192 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7193 union type. Any necessary discriminants' values should be in DVAL,
7194 a record value. That is, this routine selects the appropriate
7195 branch of the union at ADDR according to the discriminant value
7196 indicated in the union's type name. Returns VAR_TYPE0 itself if
7197 it represents a variant subject to a pragma Unchecked_Union. */
7199 static struct type
*
7200 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7201 CORE_ADDR address
, struct value
*dval
)
7204 struct type
*templ_type
;
7205 struct type
*var_type
;
7207 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7208 var_type
= TYPE_TARGET_TYPE (var_type0
);
7210 var_type
= var_type0
;
7212 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7214 if (templ_type
!= NULL
)
7215 var_type
= templ_type
;
7217 if (is_unchecked_variant (var_type
, value_type (dval
)))
7220 ada_which_variant_applies (var_type
,
7221 value_type (dval
), value_contents (dval
));
7224 return empty_record (var_type
);
7225 else if (is_dynamic_field (var_type
, which
))
7226 return to_fixed_record_type
7227 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7228 valaddr
, address
, dval
);
7229 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7231 to_fixed_record_type
7232 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7234 return TYPE_FIELD_TYPE (var_type
, which
);
7237 /* Assuming that TYPE0 is an array type describing the type of a value
7238 at ADDR, and that DVAL describes a record containing any
7239 discriminants used in TYPE0, returns a type for the value that
7240 contains no dynamic components (that is, no components whose sizes
7241 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7242 true, gives an error message if the resulting type's size is over
7245 static struct type
*
7246 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7249 struct type
*index_type_desc
;
7250 struct type
*result
;
7251 int constrained_packed_array_p
;
7253 if (TYPE_FIXED_INSTANCE (type0
))
7256 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7257 if (constrained_packed_array_p
)
7258 type0
= decode_constrained_packed_array_type (type0
);
7260 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7261 if (index_type_desc
== NULL
)
7263 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7264 /* NOTE: elt_type---the fixed version of elt_type0---should never
7265 depend on the contents of the array in properly constructed
7267 /* Create a fixed version of the array element type.
7268 We're not providing the address of an element here,
7269 and thus the actual object value cannot be inspected to do
7270 the conversion. This should not be a problem, since arrays of
7271 unconstrained objects are not allowed. In particular, all
7272 the elements of an array of a tagged type should all be of
7273 the same type specified in the debugging info. No need to
7274 consult the object tag. */
7275 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7277 /* Make sure we always create a new array type when dealing with
7278 packed array types, since we're going to fix-up the array
7279 type length and element bitsize a little further down. */
7280 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7283 result
= create_array_type (alloc_type_copy (type0
),
7284 elt_type
, TYPE_INDEX_TYPE (type0
));
7289 struct type
*elt_type0
;
7292 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7293 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7295 /* NOTE: result---the fixed version of elt_type0---should never
7296 depend on the contents of the array in properly constructed
7298 /* Create a fixed version of the array element type.
7299 We're not providing the address of an element here,
7300 and thus the actual object value cannot be inspected to do
7301 the conversion. This should not be a problem, since arrays of
7302 unconstrained objects are not allowed. In particular, all
7303 the elements of an array of a tagged type should all be of
7304 the same type specified in the debugging info. No need to
7305 consult the object tag. */
7307 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7310 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7312 struct type
*range_type
=
7313 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7314 dval
, TYPE_INDEX_TYPE (elt_type0
));
7315 result
= create_array_type (alloc_type_copy (elt_type0
),
7316 result
, range_type
);
7317 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7319 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7320 error (_("array type with dynamic size is larger than varsize-limit"));
7323 if (constrained_packed_array_p
)
7325 /* So far, the resulting type has been created as if the original
7326 type was a regular (non-packed) array type. As a result, the
7327 bitsize of the array elements needs to be set again, and the array
7328 length needs to be recomputed based on that bitsize. */
7329 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7330 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7332 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7333 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7334 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7335 TYPE_LENGTH (result
)++;
7338 TYPE_FIXED_INSTANCE (result
) = 1;
7343 /* A standard type (containing no dynamically sized components)
7344 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7345 DVAL describes a record containing any discriminants used in TYPE0,
7346 and may be NULL if there are none, or if the object of type TYPE at
7347 ADDRESS or in VALADDR contains these discriminants.
7349 If CHECK_TAG is not null, in the case of tagged types, this function
7350 attempts to locate the object's tag and use it to compute the actual
7351 type. However, when ADDRESS is null, we cannot use it to determine the
7352 location of the tag, and therefore compute the tagged type's actual type.
7353 So we return the tagged type without consulting the tag. */
7355 static struct type
*
7356 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7357 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7359 type
= ada_check_typedef (type
);
7360 switch (TYPE_CODE (type
))
7364 case TYPE_CODE_STRUCT
:
7366 struct type
*static_type
= to_static_fixed_type (type
);
7367 struct type
*fixed_record_type
=
7368 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7369 /* If STATIC_TYPE is a tagged type and we know the object's address,
7370 then we can determine its tag, and compute the object's actual
7371 type from there. Note that we have to use the fixed record
7372 type (the parent part of the record may have dynamic fields
7373 and the way the location of _tag is expressed may depend on
7376 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7378 struct type
*real_type
=
7379 type_from_tag (value_tag_from_contents_and_address
7383 if (real_type
!= NULL
)
7384 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7387 /* Check to see if there is a parallel ___XVZ variable.
7388 If there is, then it provides the actual size of our type. */
7389 else if (ada_type_name (fixed_record_type
) != NULL
)
7391 char *name
= ada_type_name (fixed_record_type
);
7392 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7396 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7397 size
= get_int_var_value (xvz_name
, &xvz_found
);
7398 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7400 fixed_record_type
= copy_type (fixed_record_type
);
7401 TYPE_LENGTH (fixed_record_type
) = size
;
7403 /* The FIXED_RECORD_TYPE may have be a stub. We have
7404 observed this when the debugging info is STABS, and
7405 apparently it is something that is hard to fix.
7407 In practice, we don't need the actual type definition
7408 at all, because the presence of the XVZ variable allows us
7409 to assume that there must be a XVS type as well, which we
7410 should be able to use later, when we need the actual type
7413 In the meantime, pretend that the "fixed" type we are
7414 returning is NOT a stub, because this can cause trouble
7415 when using this type to create new types targeting it.
7416 Indeed, the associated creation routines often check
7417 whether the target type is a stub and will try to replace
7418 it, thus using a type with the wrong size. This, in turn,
7419 might cause the new type to have the wrong size too.
7420 Consider the case of an array, for instance, where the size
7421 of the array is computed from the number of elements in
7422 our array multiplied by the size of its element. */
7423 TYPE_STUB (fixed_record_type
) = 0;
7426 return fixed_record_type
;
7428 case TYPE_CODE_ARRAY
:
7429 return to_fixed_array_type (type
, dval
, 1);
7430 case TYPE_CODE_UNION
:
7434 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7438 /* The same as ada_to_fixed_type_1, except that it preserves the type
7439 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7440 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7443 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7444 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7447 struct type
*fixed_type
=
7448 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7450 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7451 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7457 /* A standard (static-sized) type corresponding as well as possible to
7458 TYPE0, but based on no runtime data. */
7460 static struct type
*
7461 to_static_fixed_type (struct type
*type0
)
7468 if (TYPE_FIXED_INSTANCE (type0
))
7471 type0
= ada_check_typedef (type0
);
7473 switch (TYPE_CODE (type0
))
7477 case TYPE_CODE_STRUCT
:
7478 type
= dynamic_template_type (type0
);
7480 return template_to_static_fixed_type (type
);
7482 return template_to_static_fixed_type (type0
);
7483 case TYPE_CODE_UNION
:
7484 type
= ada_find_parallel_type (type0
, "___XVU");
7486 return template_to_static_fixed_type (type
);
7488 return template_to_static_fixed_type (type0
);
7492 /* A static approximation of TYPE with all type wrappers removed. */
7494 static struct type
*
7495 static_unwrap_type (struct type
*type
)
7497 if (ada_is_aligner_type (type
))
7499 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7500 if (ada_type_name (type1
) == NULL
)
7501 TYPE_NAME (type1
) = ada_type_name (type
);
7503 return static_unwrap_type (type1
);
7507 struct type
*raw_real_type
= ada_get_base_type (type
);
7508 if (raw_real_type
== type
)
7511 return to_static_fixed_type (raw_real_type
);
7515 /* In some cases, incomplete and private types require
7516 cross-references that are not resolved as records (for example,
7518 type FooP is access Foo;
7520 type Foo is array ...;
7521 ). In these cases, since there is no mechanism for producing
7522 cross-references to such types, we instead substitute for FooP a
7523 stub enumeration type that is nowhere resolved, and whose tag is
7524 the name of the actual type. Call these types "non-record stubs". */
7526 /* A type equivalent to TYPE that is not a non-record stub, if one
7527 exists, otherwise TYPE. */
7530 ada_check_typedef (struct type
*type
)
7535 CHECK_TYPEDEF (type
);
7536 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7537 || !TYPE_STUB (type
)
7538 || TYPE_TAG_NAME (type
) == NULL
)
7542 char *name
= TYPE_TAG_NAME (type
);
7543 struct type
*type1
= ada_find_any_type (name
);
7544 return (type1
== NULL
) ? type
: type1
;
7548 /* A value representing the data at VALADDR/ADDRESS as described by
7549 type TYPE0, but with a standard (static-sized) type that correctly
7550 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7551 type, then return VAL0 [this feature is simply to avoid redundant
7552 creation of struct values]. */
7554 static struct value
*
7555 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7558 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7559 if (type
== type0
&& val0
!= NULL
)
7562 return value_from_contents_and_address (type
, 0, address
);
7565 /* A value representing VAL, but with a standard (static-sized) type
7566 that correctly describes it. Does not necessarily create a new
7569 static struct value
*
7570 ada_to_fixed_value (struct value
*val
)
7572 return ada_to_fixed_value_create (value_type (val
),
7573 value_address (val
),
7577 /* A value representing VAL, but with a standard (static-sized) type
7578 chosen to approximate the real type of VAL as well as possible, but
7579 without consulting any runtime values. For Ada dynamic-sized
7580 types, therefore, the type of the result is likely to be inaccurate. */
7582 static struct value
*
7583 ada_to_static_fixed_value (struct value
*val
)
7586 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7587 if (type
== value_type (val
))
7590 return coerce_unspec_val_to_type (val
, type
);
7596 /* Table mapping attribute numbers to names.
7597 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7599 static const char *attribute_names
[] = {
7617 ada_attribute_name (enum exp_opcode n
)
7619 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7620 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7622 return attribute_names
[0];
7625 /* Evaluate the 'POS attribute applied to ARG. */
7628 pos_atr (struct value
*arg
)
7630 struct value
*val
= coerce_ref (arg
);
7631 struct type
*type
= value_type (val
);
7633 if (!discrete_type_p (type
))
7634 error (_("'POS only defined on discrete types"));
7636 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7639 LONGEST v
= value_as_long (val
);
7641 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7643 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7646 error (_("enumeration value is invalid: can't find 'POS"));
7649 return value_as_long (val
);
7652 static struct value
*
7653 value_pos_atr (struct type
*type
, struct value
*arg
)
7655 return value_from_longest (type
, pos_atr (arg
));
7658 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7660 static struct value
*
7661 value_val_atr (struct type
*type
, struct value
*arg
)
7663 if (!discrete_type_p (type
))
7664 error (_("'VAL only defined on discrete types"));
7665 if (!integer_type_p (value_type (arg
)))
7666 error (_("'VAL requires integral argument"));
7668 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7670 long pos
= value_as_long (arg
);
7671 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7672 error (_("argument to 'VAL out of range"));
7673 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7676 return value_from_longest (type
, value_as_long (arg
));
7682 /* True if TYPE appears to be an Ada character type.
7683 [At the moment, this is true only for Character and Wide_Character;
7684 It is a heuristic test that could stand improvement]. */
7687 ada_is_character_type (struct type
*type
)
7691 /* If the type code says it's a character, then assume it really is,
7692 and don't check any further. */
7693 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7696 /* Otherwise, assume it's a character type iff it is a discrete type
7697 with a known character type name. */
7698 name
= ada_type_name (type
);
7699 return (name
!= NULL
7700 && (TYPE_CODE (type
) == TYPE_CODE_INT
7701 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7702 && (strcmp (name
, "character") == 0
7703 || strcmp (name
, "wide_character") == 0
7704 || strcmp (name
, "wide_wide_character") == 0
7705 || strcmp (name
, "unsigned char") == 0));
7708 /* True if TYPE appears to be an Ada string type. */
7711 ada_is_string_type (struct type
*type
)
7713 type
= ada_check_typedef (type
);
7715 && TYPE_CODE (type
) != TYPE_CODE_PTR
7716 && (ada_is_simple_array_type (type
)
7717 || ada_is_array_descriptor_type (type
))
7718 && ada_array_arity (type
) == 1)
7720 struct type
*elttype
= ada_array_element_type (type
, 1);
7722 return ada_is_character_type (elttype
);
7729 /* True if TYPE is a struct type introduced by the compiler to force the
7730 alignment of a value. Such types have a single field with a
7731 distinctive name. */
7734 ada_is_aligner_type (struct type
*type
)
7736 type
= ada_check_typedef (type
);
7738 /* If we can find a parallel XVS type, then the XVS type should
7739 be used instead of this type. And hence, this is not an aligner
7741 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7744 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7745 && TYPE_NFIELDS (type
) == 1
7746 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7749 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7750 the parallel type. */
7753 ada_get_base_type (struct type
*raw_type
)
7755 struct type
*real_type_namer
;
7756 struct type
*raw_real_type
;
7758 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7761 if (ada_is_aligner_type (raw_type
))
7762 /* The encoding specifies that we should always use the aligner type.
7763 So, even if this aligner type has an associated XVS type, we should
7766 According to the compiler gurus, an XVS type parallel to an aligner
7767 type may exist because of a stabs limitation. In stabs, aligner
7768 types are empty because the field has a variable-sized type, and
7769 thus cannot actually be used as an aligner type. As a result,
7770 we need the associated parallel XVS type to decode the type.
7771 Since the policy in the compiler is to not change the internal
7772 representation based on the debugging info format, we sometimes
7773 end up having a redundant XVS type parallel to the aligner type. */
7776 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7777 if (real_type_namer
== NULL
7778 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7779 || TYPE_NFIELDS (real_type_namer
) != 1)
7782 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7783 if (raw_real_type
== NULL
)
7786 return raw_real_type
;
7789 /* The type of value designated by TYPE, with all aligners removed. */
7792 ada_aligned_type (struct type
*type
)
7794 if (ada_is_aligner_type (type
))
7795 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7797 return ada_get_base_type (type
);
7801 /* The address of the aligned value in an object at address VALADDR
7802 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7805 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7807 if (ada_is_aligner_type (type
))
7808 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7810 TYPE_FIELD_BITPOS (type
,
7811 0) / TARGET_CHAR_BIT
);
7818 /* The printed representation of an enumeration literal with encoded
7819 name NAME. The value is good to the next call of ada_enum_name. */
7821 ada_enum_name (const char *name
)
7823 static char *result
;
7824 static size_t result_len
= 0;
7827 /* First, unqualify the enumeration name:
7828 1. Search for the last '.' character. If we find one, then skip
7829 all the preceeding characters, the unqualified name starts
7830 right after that dot.
7831 2. Otherwise, we may be debugging on a target where the compiler
7832 translates dots into "__". Search forward for double underscores,
7833 but stop searching when we hit an overloading suffix, which is
7834 of the form "__" followed by digits. */
7836 tmp
= strrchr (name
, '.');
7841 while ((tmp
= strstr (name
, "__")) != NULL
)
7843 if (isdigit (tmp
[2]))
7853 if (name
[1] == 'U' || name
[1] == 'W')
7855 if (sscanf (name
+ 2, "%x", &v
) != 1)
7861 GROW_VECT (result
, result_len
, 16);
7862 if (isascii (v
) && isprint (v
))
7863 xsnprintf (result
, result_len
, "'%c'", v
);
7864 else if (name
[1] == 'U')
7865 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
7867 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
7873 tmp
= strstr (name
, "__");
7875 tmp
= strstr (name
, "$");
7878 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7879 strncpy (result
, name
, tmp
- name
);
7880 result
[tmp
- name
] = '\0';
7888 /* Evaluate the subexpression of EXP starting at *POS as for
7889 evaluate_type, updating *POS to point just past the evaluated
7892 static struct value
*
7893 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7895 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7898 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7901 static struct value
*
7902 unwrap_value (struct value
*val
)
7904 struct type
*type
= ada_check_typedef (value_type (val
));
7905 if (ada_is_aligner_type (type
))
7907 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7908 struct type
*val_type
= ada_check_typedef (value_type (v
));
7909 if (ada_type_name (val_type
) == NULL
)
7910 TYPE_NAME (val_type
) = ada_type_name (type
);
7912 return unwrap_value (v
);
7916 struct type
*raw_real_type
=
7917 ada_check_typedef (ada_get_base_type (type
));
7919 if (type
== raw_real_type
)
7923 coerce_unspec_val_to_type
7924 (val
, ada_to_fixed_type (raw_real_type
, 0,
7925 value_address (val
),
7930 static struct value
*
7931 cast_to_fixed (struct type
*type
, struct value
*arg
)
7935 if (type
== value_type (arg
))
7937 else if (ada_is_fixed_point_type (value_type (arg
)))
7938 val
= ada_float_to_fixed (type
,
7939 ada_fixed_to_float (value_type (arg
),
7940 value_as_long (arg
)));
7943 DOUBLEST argd
= value_as_double (arg
);
7944 val
= ada_float_to_fixed (type
, argd
);
7947 return value_from_longest (type
, val
);
7950 static struct value
*
7951 cast_from_fixed (struct type
*type
, struct value
*arg
)
7953 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7954 value_as_long (arg
));
7955 return value_from_double (type
, val
);
7958 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7959 return the converted value. */
7961 static struct value
*
7962 coerce_for_assign (struct type
*type
, struct value
*val
)
7964 struct type
*type2
= value_type (val
);
7968 type2
= ada_check_typedef (type2
);
7969 type
= ada_check_typedef (type
);
7971 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7972 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7974 val
= ada_value_ind (val
);
7975 type2
= value_type (val
);
7978 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7979 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7981 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7982 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7983 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7984 error (_("Incompatible types in assignment"));
7985 deprecated_set_value_type (val
, type
);
7990 static struct value
*
7991 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7994 struct type
*type1
, *type2
;
7997 arg1
= coerce_ref (arg1
);
7998 arg2
= coerce_ref (arg2
);
7999 type1
= base_type (ada_check_typedef (value_type (arg1
)));
8000 type2
= base_type (ada_check_typedef (value_type (arg2
)));
8002 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8003 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8004 return value_binop (arg1
, arg2
, op
);
8013 return value_binop (arg1
, arg2
, op
);
8016 v2
= value_as_long (arg2
);
8018 error (_("second operand of %s must not be zero."), op_string (op
));
8020 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8021 return value_binop (arg1
, arg2
, op
);
8023 v1
= value_as_long (arg1
);
8028 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8029 v
+= v
> 0 ? -1 : 1;
8037 /* Should not reach this point. */
8041 val
= allocate_value (type1
);
8042 store_unsigned_integer (value_contents_raw (val
),
8043 TYPE_LENGTH (value_type (val
)),
8044 gdbarch_byte_order (get_type_arch (type1
)), v
);
8049 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8051 if (ada_is_direct_array_type (value_type (arg1
))
8052 || ada_is_direct_array_type (value_type (arg2
)))
8054 /* Automatically dereference any array reference before
8055 we attempt to perform the comparison. */
8056 arg1
= ada_coerce_ref (arg1
);
8057 arg2
= ada_coerce_ref (arg2
);
8059 arg1
= ada_coerce_to_simple_array (arg1
);
8060 arg2
= ada_coerce_to_simple_array (arg2
);
8061 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8062 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8063 error (_("Attempt to compare array with non-array"));
8064 /* FIXME: The following works only for types whose
8065 representations use all bits (no padding or undefined bits)
8066 and do not have user-defined equality. */
8068 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8069 && memcmp (value_contents (arg1
), value_contents (arg2
),
8070 TYPE_LENGTH (value_type (arg1
))) == 0;
8072 return value_equal (arg1
, arg2
);
8075 /* Total number of component associations in the aggregate starting at
8076 index PC in EXP. Assumes that index PC is the start of an
8080 num_component_specs (struct expression
*exp
, int pc
)
8083 m
= exp
->elts
[pc
+ 1].longconst
;
8086 for (i
= 0; i
< m
; i
+= 1)
8088 switch (exp
->elts
[pc
].opcode
)
8094 n
+= exp
->elts
[pc
+ 1].longconst
;
8097 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8102 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8103 component of LHS (a simple array or a record), updating *POS past
8104 the expression, assuming that LHS is contained in CONTAINER. Does
8105 not modify the inferior's memory, nor does it modify LHS (unless
8106 LHS == CONTAINER). */
8109 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8110 struct expression
*exp
, int *pos
)
8112 struct value
*mark
= value_mark ();
8114 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8116 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8117 struct value
*index_val
= value_from_longest (index_type
, index
);
8118 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8122 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8123 elt
= ada_to_fixed_value (unwrap_value (elt
));
8126 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8127 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8129 value_assign_to_component (container
, elt
,
8130 ada_evaluate_subexp (NULL
, exp
, pos
,
8133 value_free_to_mark (mark
);
8136 /* Assuming that LHS represents an lvalue having a record or array
8137 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8138 of that aggregate's value to LHS, advancing *POS past the
8139 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8140 lvalue containing LHS (possibly LHS itself). Does not modify
8141 the inferior's memory, nor does it modify the contents of
8142 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8144 static struct value
*
8145 assign_aggregate (struct value
*container
,
8146 struct value
*lhs
, struct expression
*exp
,
8147 int *pos
, enum noside noside
)
8149 struct type
*lhs_type
;
8150 int n
= exp
->elts
[*pos
+1].longconst
;
8151 LONGEST low_index
, high_index
;
8154 int max_indices
, num_indices
;
8155 int is_array_aggregate
;
8157 struct value
*mark
= value_mark ();
8160 if (noside
!= EVAL_NORMAL
)
8163 for (i
= 0; i
< n
; i
+= 1)
8164 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8168 container
= ada_coerce_ref (container
);
8169 if (ada_is_direct_array_type (value_type (container
)))
8170 container
= ada_coerce_to_simple_array (container
);
8171 lhs
= ada_coerce_ref (lhs
);
8172 if (!deprecated_value_modifiable (lhs
))
8173 error (_("Left operand of assignment is not a modifiable lvalue."));
8175 lhs_type
= value_type (lhs
);
8176 if (ada_is_direct_array_type (lhs_type
))
8178 lhs
= ada_coerce_to_simple_array (lhs
);
8179 lhs_type
= value_type (lhs
);
8180 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8181 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8182 is_array_aggregate
= 1;
8184 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8187 high_index
= num_visible_fields (lhs_type
) - 1;
8188 is_array_aggregate
= 0;
8191 error (_("Left-hand side must be array or record."));
8193 num_specs
= num_component_specs (exp
, *pos
- 3);
8194 max_indices
= 4 * num_specs
+ 4;
8195 indices
= alloca (max_indices
* sizeof (indices
[0]));
8196 indices
[0] = indices
[1] = low_index
- 1;
8197 indices
[2] = indices
[3] = high_index
+ 1;
8200 for (i
= 0; i
< n
; i
+= 1)
8202 switch (exp
->elts
[*pos
].opcode
)
8205 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8206 &num_indices
, max_indices
,
8207 low_index
, high_index
);
8210 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8211 &num_indices
, max_indices
,
8212 low_index
, high_index
);
8216 error (_("Misplaced 'others' clause"));
8217 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8218 num_indices
, low_index
, high_index
);
8221 error (_("Internal error: bad aggregate clause"));
8228 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8229 construct at *POS, updating *POS past the construct, given that
8230 the positions are relative to lower bound LOW, where HIGH is the
8231 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8232 updating *NUM_INDICES as needed. CONTAINER is as for
8233 assign_aggregate. */
8235 aggregate_assign_positional (struct value
*container
,
8236 struct value
*lhs
, struct expression
*exp
,
8237 int *pos
, LONGEST
*indices
, int *num_indices
,
8238 int max_indices
, LONGEST low
, LONGEST high
)
8240 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8242 if (ind
- 1 == high
)
8243 warning (_("Extra components in aggregate ignored."));
8246 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8248 assign_component (container
, lhs
, ind
, exp
, pos
);
8251 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8254 /* Assign into the components of LHS indexed by the OP_CHOICES
8255 construct at *POS, updating *POS past the construct, given that
8256 the allowable indices are LOW..HIGH. Record the indices assigned
8257 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8258 needed. CONTAINER is as for assign_aggregate. */
8260 aggregate_assign_from_choices (struct value
*container
,
8261 struct value
*lhs
, struct expression
*exp
,
8262 int *pos
, LONGEST
*indices
, int *num_indices
,
8263 int max_indices
, LONGEST low
, LONGEST high
)
8266 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8267 int choice_pos
, expr_pc
;
8268 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8270 choice_pos
= *pos
+= 3;
8272 for (j
= 0; j
< n_choices
; j
+= 1)
8273 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8275 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8277 for (j
= 0; j
< n_choices
; j
+= 1)
8279 LONGEST lower
, upper
;
8280 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8281 if (op
== OP_DISCRETE_RANGE
)
8284 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8286 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8291 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8302 name
= &exp
->elts
[choice_pos
+ 2].string
;
8305 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8308 error (_("Invalid record component association."));
8310 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8312 if (! find_struct_field (name
, value_type (lhs
), 0,
8313 NULL
, NULL
, NULL
, NULL
, &ind
))
8314 error (_("Unknown component name: %s."), name
);
8315 lower
= upper
= ind
;
8318 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8319 error (_("Index in component association out of bounds."));
8321 add_component_interval (lower
, upper
, indices
, num_indices
,
8323 while (lower
<= upper
)
8327 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8333 /* Assign the value of the expression in the OP_OTHERS construct in
8334 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8335 have not been previously assigned. The index intervals already assigned
8336 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8337 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8339 aggregate_assign_others (struct value
*container
,
8340 struct value
*lhs
, struct expression
*exp
,
8341 int *pos
, LONGEST
*indices
, int num_indices
,
8342 LONGEST low
, LONGEST high
)
8345 int expr_pc
= *pos
+1;
8347 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8350 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8354 assign_component (container
, lhs
, ind
, exp
, &pos
);
8357 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8360 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8361 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8362 modifying *SIZE as needed. It is an error if *SIZE exceeds
8363 MAX_SIZE. The resulting intervals do not overlap. */
8365 add_component_interval (LONGEST low
, LONGEST high
,
8366 LONGEST
* indices
, int *size
, int max_size
)
8369 for (i
= 0; i
< *size
; i
+= 2) {
8370 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8373 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8374 if (high
< indices
[kh
])
8376 if (low
< indices
[i
])
8378 indices
[i
+ 1] = indices
[kh
- 1];
8379 if (high
> indices
[i
+ 1])
8380 indices
[i
+ 1] = high
;
8381 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8382 *size
-= kh
- i
- 2;
8385 else if (high
< indices
[i
])
8389 if (*size
== max_size
)
8390 error (_("Internal error: miscounted aggregate components."));
8392 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8393 indices
[j
] = indices
[j
- 2];
8395 indices
[i
+ 1] = high
;
8398 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8401 static struct value
*
8402 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8404 if (type
== ada_check_typedef (value_type (arg2
)))
8407 if (ada_is_fixed_point_type (type
))
8408 return (cast_to_fixed (type
, arg2
));
8410 if (ada_is_fixed_point_type (value_type (arg2
)))
8411 return cast_from_fixed (type
, arg2
);
8413 return value_cast (type
, arg2
);
8416 /* Evaluating Ada expressions, and printing their result.
8417 ------------------------------------------------------
8422 We usually evaluate an Ada expression in order to print its value.
8423 We also evaluate an expression in order to print its type, which
8424 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8425 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8426 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8427 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8430 Evaluating expressions is a little more complicated for Ada entities
8431 than it is for entities in languages such as C. The main reason for
8432 this is that Ada provides types whose definition might be dynamic.
8433 One example of such types is variant records. Or another example
8434 would be an array whose bounds can only be known at run time.
8436 The following description is a general guide as to what should be
8437 done (and what should NOT be done) in order to evaluate an expression
8438 involving such types, and when. This does not cover how the semantic
8439 information is encoded by GNAT as this is covered separatly. For the
8440 document used as the reference for the GNAT encoding, see exp_dbug.ads
8441 in the GNAT sources.
8443 Ideally, we should embed each part of this description next to its
8444 associated code. Unfortunately, the amount of code is so vast right
8445 now that it's hard to see whether the code handling a particular
8446 situation might be duplicated or not. One day, when the code is
8447 cleaned up, this guide might become redundant with the comments
8448 inserted in the code, and we might want to remove it.
8450 2. ``Fixing'' an Entity, the Simple Case:
8451 -----------------------------------------
8453 When evaluating Ada expressions, the tricky issue is that they may
8454 reference entities whose type contents and size are not statically
8455 known. Consider for instance a variant record:
8457 type Rec (Empty : Boolean := True) is record
8460 when False => Value : Integer;
8463 Yes : Rec := (Empty => False, Value => 1);
8464 No : Rec := (empty => True);
8466 The size and contents of that record depends on the value of the
8467 descriminant (Rec.Empty). At this point, neither the debugging
8468 information nor the associated type structure in GDB are able to
8469 express such dynamic types. So what the debugger does is to create
8470 "fixed" versions of the type that applies to the specific object.
8471 We also informally refer to this opperation as "fixing" an object,
8472 which means creating its associated fixed type.
8474 Example: when printing the value of variable "Yes" above, its fixed
8475 type would look like this:
8482 On the other hand, if we printed the value of "No", its fixed type
8489 Things become a little more complicated when trying to fix an entity
8490 with a dynamic type that directly contains another dynamic type,
8491 such as an array of variant records, for instance. There are
8492 two possible cases: Arrays, and records.
8494 3. ``Fixing'' Arrays:
8495 ---------------------
8497 The type structure in GDB describes an array in terms of its bounds,
8498 and the type of its elements. By design, all elements in the array
8499 have the same type and we cannot represent an array of variant elements
8500 using the current type structure in GDB. When fixing an array,
8501 we cannot fix the array element, as we would potentially need one
8502 fixed type per element of the array. As a result, the best we can do
8503 when fixing an array is to produce an array whose bounds and size
8504 are correct (allowing us to read it from memory), but without having
8505 touched its element type. Fixing each element will be done later,
8506 when (if) necessary.
8508 Arrays are a little simpler to handle than records, because the same
8509 amount of memory is allocated for each element of the array, even if
8510 the amount of space actually used by each element differs from element
8511 to element. Consider for instance the following array of type Rec:
8513 type Rec_Array is array (1 .. 2) of Rec;
8515 The actual amount of memory occupied by each element might be different
8516 from element to element, depending on the value of their discriminant.
8517 But the amount of space reserved for each element in the array remains
8518 fixed regardless. So we simply need to compute that size using
8519 the debugging information available, from which we can then determine
8520 the array size (we multiply the number of elements of the array by
8521 the size of each element).
8523 The simplest case is when we have an array of a constrained element
8524 type. For instance, consider the following type declarations:
8526 type Bounded_String (Max_Size : Integer) is
8528 Buffer : String (1 .. Max_Size);
8530 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
8532 In this case, the compiler describes the array as an array of
8533 variable-size elements (identified by its XVS suffix) for which
8534 the size can be read in the parallel XVZ variable.
8536 In the case of an array of an unconstrained element type, the compiler
8537 wraps the array element inside a private PAD type. This type should not
8538 be shown to the user, and must be "unwrap"'ed before printing. Note
8539 that we also use the adjective "aligner" in our code to designate
8540 these wrapper types.
8542 In some cases, the size allocated for each element is statically
8543 known. In that case, the PAD type already has the correct size,
8544 and the array element should remain unfixed.
8546 But there are cases when this size is not statically known.
8547 For instance, assuming that "Five" is an integer variable:
8549 type Dynamic is array (1 .. Five) of Integer;
8550 type Wrapper (Has_Length : Boolean := False) is record
8553 when True => Length : Integer;
8557 type Wrapper_Array is array (1 .. 2) of Wrapper;
8559 Hello : Wrapper_Array := (others => (Has_Length => True,
8560 Data => (others => 17),
8564 The debugging info would describe variable Hello as being an
8565 array of a PAD type. The size of that PAD type is not statically
8566 known, but can be determined using a parallel XVZ variable.
8567 In that case, a copy of the PAD type with the correct size should
8568 be used for the fixed array.
8570 3. ``Fixing'' record type objects:
8571 ----------------------------------
8573 Things are slightly different from arrays in the case of dynamic
8574 record types. In this case, in order to compute the associated
8575 fixed type, we need to determine the size and offset of each of
8576 its components. This, in turn, requires us to compute the fixed
8577 type of each of these components.
8579 Consider for instance the example:
8581 type Bounded_String (Max_Size : Natural) is record
8582 Str : String (1 .. Max_Size);
8585 My_String : Bounded_String (Max_Size => 10);
8587 In that case, the position of field "Length" depends on the size
8588 of field Str, which itself depends on the value of the Max_Size
8589 discriminant. In order to fix the type of variable My_String,
8590 we need to fix the type of field Str. Therefore, fixing a variant
8591 record requires us to fix each of its components.
8593 However, if a component does not have a dynamic size, the component
8594 should not be fixed. In particular, fields that use a PAD type
8595 should not fixed. Here is an example where this might happen
8596 (assuming type Rec above):
8598 type Container (Big : Boolean) is record
8602 when True => Another : Integer;
8606 My_Container : Container := (Big => False,
8607 First => (Empty => True),
8610 In that example, the compiler creates a PAD type for component First,
8611 whose size is constant, and then positions the component After just
8612 right after it. The offset of component After is therefore constant
8615 The debugger computes the position of each field based on an algorithm
8616 that uses, among other things, the actual position and size of the field
8617 preceding it. Let's now imagine that the user is trying to print
8618 the value of My_Container. If the type fixing was recursive, we would
8619 end up computing the offset of field After based on the size of the
8620 fixed version of field First. And since in our example First has
8621 only one actual field, the size of the fixed type is actually smaller
8622 than the amount of space allocated to that field, and thus we would
8623 compute the wrong offset of field After.
8625 To make things more complicated, we need to watch out for dynamic
8626 components of variant records (identified by the ___XVL suffix in
8627 the component name). Even if the target type is a PAD type, the size
8628 of that type might not be statically known. So the PAD type needs
8629 to be unwrapped and the resulting type needs to be fixed. Otherwise,
8630 we might end up with the wrong size for our component. This can be
8631 observed with the following type declarations:
8633 type Octal is new Integer range 0 .. 7;
8634 type Octal_Array is array (Positive range <>) of Octal;
8635 pragma Pack (Octal_Array);
8637 type Octal_Buffer (Size : Positive) is record
8638 Buffer : Octal_Array (1 .. Size);
8642 In that case, Buffer is a PAD type whose size is unset and needs
8643 to be computed by fixing the unwrapped type.
8645 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
8646 ----------------------------------------------------------
8648 Lastly, when should the sub-elements of an entity that remained unfixed
8649 thus far, be actually fixed?
8651 The answer is: Only when referencing that element. For instance
8652 when selecting one component of a record, this specific component
8653 should be fixed at that point in time. Or when printing the value
8654 of a record, each component should be fixed before its value gets
8655 printed. Similarly for arrays, the element of the array should be
8656 fixed when printing each element of the array, or when extracting
8657 one element out of that array. On the other hand, fixing should
8658 not be performed on the elements when taking a slice of an array!
8660 Note that one of the side-effects of miscomputing the offset and
8661 size of each field is that we end up also miscomputing the size
8662 of the containing type. This can have adverse results when computing
8663 the value of an entity. GDB fetches the value of an entity based
8664 on the size of its type, and thus a wrong size causes GDB to fetch
8665 the wrong amount of memory. In the case where the computed size is
8666 too small, GDB fetches too little data to print the value of our
8667 entiry. Results in this case as unpredicatble, as we usually read
8668 past the buffer containing the data =:-o. */
8670 /* Implement the evaluate_exp routine in the exp_descriptor structure
8671 for the Ada language. */
8673 static struct value
*
8674 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8675 int *pos
, enum noside noside
)
8678 int tem
, tem2
, tem3
;
8680 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8683 struct value
**argvec
;
8687 op
= exp
->elts
[pc
].opcode
;
8693 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8694 arg1
= unwrap_value (arg1
);
8696 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8697 then we need to perform the conversion manually, because
8698 evaluate_subexp_standard doesn't do it. This conversion is
8699 necessary in Ada because the different kinds of float/fixed
8700 types in Ada have different representations.
8702 Similarly, we need to perform the conversion from OP_LONG
8704 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8705 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8711 struct value
*result
;
8713 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8714 /* The result type will have code OP_STRING, bashed there from
8715 OP_ARRAY. Bash it back. */
8716 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8717 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8723 type
= exp
->elts
[pc
+ 1].type
;
8724 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8725 if (noside
== EVAL_SKIP
)
8727 arg1
= ada_value_cast (type
, arg1
, noside
);
8732 type
= exp
->elts
[pc
+ 1].type
;
8733 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8736 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8737 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8739 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8740 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8742 return ada_value_assign (arg1
, arg1
);
8744 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8745 except if the lhs of our assignment is a convenience variable.
8746 In the case of assigning to a convenience variable, the lhs
8747 should be exactly the result of the evaluation of the rhs. */
8748 type
= value_type (arg1
);
8749 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8751 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8752 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8754 if (ada_is_fixed_point_type (value_type (arg1
)))
8755 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8756 else if (ada_is_fixed_point_type (value_type (arg2
)))
8758 (_("Fixed-point values must be assigned to fixed-point variables"));
8760 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8761 return ada_value_assign (arg1
, arg2
);
8764 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8765 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8766 if (noside
== EVAL_SKIP
)
8768 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8769 return (value_from_longest
8771 value_as_long (arg1
) + value_as_long (arg2
)));
8772 if ((ada_is_fixed_point_type (value_type (arg1
))
8773 || ada_is_fixed_point_type (value_type (arg2
)))
8774 && value_type (arg1
) != value_type (arg2
))
8775 error (_("Operands of fixed-point addition must have the same type"));
8776 /* Do the addition, and cast the result to the type of the first
8777 argument. We cannot cast the result to a reference type, so if
8778 ARG1 is a reference type, find its underlying type. */
8779 type
= value_type (arg1
);
8780 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8781 type
= TYPE_TARGET_TYPE (type
);
8782 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8783 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8786 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8787 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8788 if (noside
== EVAL_SKIP
)
8790 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8791 return (value_from_longest
8793 value_as_long (arg1
) - value_as_long (arg2
)));
8794 if ((ada_is_fixed_point_type (value_type (arg1
))
8795 || ada_is_fixed_point_type (value_type (arg2
)))
8796 && value_type (arg1
) != value_type (arg2
))
8797 error (_("Operands of fixed-point subtraction must have the same type"));
8798 /* Do the substraction, and cast the result to the type of the first
8799 argument. We cannot cast the result to a reference type, so if
8800 ARG1 is a reference type, find its underlying type. */
8801 type
= value_type (arg1
);
8802 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8803 type
= TYPE_TARGET_TYPE (type
);
8804 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8805 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8811 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8812 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8813 if (noside
== EVAL_SKIP
)
8815 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8817 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8818 return value_zero (value_type (arg1
), not_lval
);
8822 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8823 if (ada_is_fixed_point_type (value_type (arg1
)))
8824 arg1
= cast_from_fixed (type
, arg1
);
8825 if (ada_is_fixed_point_type (value_type (arg2
)))
8826 arg2
= cast_from_fixed (type
, arg2
);
8827 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8828 return ada_value_binop (arg1
, arg2
, op
);
8832 case BINOP_NOTEQUAL
:
8833 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8834 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8835 if (noside
== EVAL_SKIP
)
8837 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8841 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8842 tem
= ada_value_equal (arg1
, arg2
);
8844 if (op
== BINOP_NOTEQUAL
)
8846 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8847 return value_from_longest (type
, (LONGEST
) tem
);
8850 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8851 if (noside
== EVAL_SKIP
)
8853 else if (ada_is_fixed_point_type (value_type (arg1
)))
8854 return value_cast (value_type (arg1
), value_neg (arg1
));
8857 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8858 return value_neg (arg1
);
8861 case BINOP_LOGICAL_AND
:
8862 case BINOP_LOGICAL_OR
:
8863 case UNOP_LOGICAL_NOT
:
8868 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8869 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8870 return value_cast (type
, val
);
8873 case BINOP_BITWISE_AND
:
8874 case BINOP_BITWISE_IOR
:
8875 case BINOP_BITWISE_XOR
:
8879 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8881 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8883 return value_cast (value_type (arg1
), val
);
8889 if (noside
== EVAL_SKIP
)
8894 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8895 /* Only encountered when an unresolved symbol occurs in a
8896 context other than a function call, in which case, it is
8898 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8899 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8900 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8902 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8903 if (ada_is_tagged_type (type
, 0))
8905 /* Tagged types are a little special in the fact that the real
8906 type is dynamic and can only be determined by inspecting the
8907 object's tag. This means that we need to get the object's
8908 value first (EVAL_NORMAL) and then extract the actual object
8911 Note that we cannot skip the final step where we extract
8912 the object type from its tag, because the EVAL_NORMAL phase
8913 results in dynamic components being resolved into fixed ones.
8914 This can cause problems when trying to print the type
8915 description of tagged types whose parent has a dynamic size:
8916 We use the type name of the "_parent" component in order
8917 to print the name of the ancestor type in the type description.
8918 If that component had a dynamic size, the resolution into
8919 a fixed type would result in the loss of that type name,
8920 thus preventing us from printing the name of the ancestor
8921 type in the type description. */
8922 struct type
*actual_type
;
8924 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8925 actual_type
= type_from_tag (ada_value_tag (arg1
));
8926 if (actual_type
== NULL
)
8927 /* If, for some reason, we were unable to determine
8928 the actual type from the tag, then use the static
8929 approximation that we just computed as a fallback.
8930 This can happen if the debugging information is
8931 incomplete, for instance. */
8934 return value_zero (actual_type
, not_lval
);
8939 (to_static_fixed_type
8940 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8945 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8946 arg1
= unwrap_value (arg1
);
8947 return ada_to_fixed_value (arg1
);
8953 /* Allocate arg vector, including space for the function to be
8954 called in argvec[0] and a terminating NULL. */
8955 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8957 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8959 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8960 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8961 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8962 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8965 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8966 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8969 if (noside
== EVAL_SKIP
)
8973 if (ada_is_constrained_packed_array_type
8974 (desc_base_type (value_type (argvec
[0]))))
8975 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8976 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8977 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
8978 /* This is a packed array that has already been fixed, and
8979 therefore already coerced to a simple array. Nothing further
8982 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8983 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8984 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8985 argvec
[0] = value_addr (argvec
[0]);
8987 type
= ada_check_typedef (value_type (argvec
[0]));
8988 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8990 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8992 case TYPE_CODE_FUNC
:
8993 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8995 case TYPE_CODE_ARRAY
:
8997 case TYPE_CODE_STRUCT
:
8998 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8999 argvec
[0] = ada_value_ind (argvec
[0]);
9000 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9003 error (_("cannot subscript or call something of type `%s'"),
9004 ada_type_name (value_type (argvec
[0])));
9009 switch (TYPE_CODE (type
))
9011 case TYPE_CODE_FUNC
:
9012 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9013 return allocate_value (TYPE_TARGET_TYPE (type
));
9014 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
9015 case TYPE_CODE_STRUCT
:
9019 arity
= ada_array_arity (type
);
9020 type
= ada_array_element_type (type
, nargs
);
9022 error (_("cannot subscript or call a record"));
9024 error (_("wrong number of subscripts; expecting %d"), arity
);
9025 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9026 return value_zero (ada_aligned_type (type
), lval_memory
);
9028 unwrap_value (ada_value_subscript
9029 (argvec
[0], nargs
, argvec
+ 1));
9031 case TYPE_CODE_ARRAY
:
9032 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9034 type
= ada_array_element_type (type
, nargs
);
9036 error (_("element type of array unknown"));
9038 return value_zero (ada_aligned_type (type
), lval_memory
);
9041 unwrap_value (ada_value_subscript
9042 (ada_coerce_to_simple_array (argvec
[0]),
9043 nargs
, argvec
+ 1));
9044 case TYPE_CODE_PTR
: /* Pointer to array */
9045 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
9046 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9048 type
= ada_array_element_type (type
, nargs
);
9050 error (_("element type of array unknown"));
9052 return value_zero (ada_aligned_type (type
), lval_memory
);
9055 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
9056 nargs
, argvec
+ 1));
9059 error (_("Attempt to index or call something other than an "
9060 "array or function"));
9065 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9066 struct value
*low_bound_val
=
9067 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9068 struct value
*high_bound_val
=
9069 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9072 low_bound_val
= coerce_ref (low_bound_val
);
9073 high_bound_val
= coerce_ref (high_bound_val
);
9074 low_bound
= pos_atr (low_bound_val
);
9075 high_bound
= pos_atr (high_bound_val
);
9077 if (noside
== EVAL_SKIP
)
9080 /* If this is a reference to an aligner type, then remove all
9082 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9083 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9084 TYPE_TARGET_TYPE (value_type (array
)) =
9085 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9087 if (ada_is_constrained_packed_array_type (value_type (array
)))
9088 error (_("cannot slice a packed array"));
9090 /* If this is a reference to an array or an array lvalue,
9091 convert to a pointer. */
9092 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9093 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
9094 && VALUE_LVAL (array
) == lval_memory
))
9095 array
= value_addr (array
);
9097 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9098 && ada_is_array_descriptor_type (ada_check_typedef
9099 (value_type (array
))))
9100 return empty_array (ada_type_of_array (array
, 0), low_bound
);
9102 array
= ada_coerce_to_simple_array_ptr (array
);
9104 /* If we have more than one level of pointer indirection,
9105 dereference the value until we get only one level. */
9106 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9107 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9109 array
= value_ind (array
);
9111 /* Make sure we really do have an array type before going further,
9112 to avoid a SEGV when trying to get the index type or the target
9113 type later down the road if the debug info generated by
9114 the compiler is incorrect or incomplete. */
9115 if (!ada_is_simple_array_type (value_type (array
)))
9116 error (_("cannot take slice of non-array"));
9118 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
9120 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9121 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
9125 struct type
*arr_type0
=
9126 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
9128 return ada_value_slice_from_ptr (array
, arr_type0
,
9129 longest_to_int (low_bound
),
9130 longest_to_int (high_bound
));
9133 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9135 else if (high_bound
< low_bound
)
9136 return empty_array (value_type (array
), low_bound
);
9138 return ada_value_slice (array
, longest_to_int (low_bound
),
9139 longest_to_int (high_bound
));
9144 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9145 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9147 if (noside
== EVAL_SKIP
)
9150 switch (TYPE_CODE (type
))
9153 lim_warning (_("Membership test incompletely implemented; "
9154 "always returns true"));
9155 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9156 return value_from_longest (type
, (LONGEST
) 1);
9158 case TYPE_CODE_RANGE
:
9159 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9160 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9161 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9162 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9163 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9165 value_from_longest (type
,
9166 (value_less (arg1
, arg3
)
9167 || value_equal (arg1
, arg3
))
9168 && (value_less (arg2
, arg1
)
9169 || value_equal (arg2
, arg1
)));
9172 case BINOP_IN_BOUNDS
:
9174 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9175 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9177 if (noside
== EVAL_SKIP
)
9180 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9182 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9183 return value_zero (type
, not_lval
);
9186 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9188 type
= ada_index_type (value_type (arg2
), tem
, "range");
9190 type
= value_type (arg1
);
9192 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9193 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9195 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9196 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9197 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9199 value_from_longest (type
,
9200 (value_less (arg1
, arg3
)
9201 || value_equal (arg1
, arg3
))
9202 && (value_less (arg2
, arg1
)
9203 || value_equal (arg2
, arg1
)));
9205 case TERNOP_IN_RANGE
:
9206 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9207 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9208 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9210 if (noside
== EVAL_SKIP
)
9213 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9214 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9215 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9217 value_from_longest (type
,
9218 (value_less (arg1
, arg3
)
9219 || value_equal (arg1
, arg3
))
9220 && (value_less (arg2
, arg1
)
9221 || value_equal (arg2
, arg1
)));
9227 struct type
*type_arg
;
9228 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9230 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9232 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9236 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9240 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9241 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9242 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9245 if (noside
== EVAL_SKIP
)
9248 if (type_arg
== NULL
)
9250 arg1
= ada_coerce_ref (arg1
);
9252 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9253 arg1
= ada_coerce_to_simple_array (arg1
);
9255 type
= ada_index_type (value_type (arg1
), tem
,
9256 ada_attribute_name (op
));
9258 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9260 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9261 return allocate_value (type
);
9265 default: /* Should never happen. */
9266 error (_("unexpected attribute encountered"));
9268 return value_from_longest
9269 (type
, ada_array_bound (arg1
, tem
, 0));
9271 return value_from_longest
9272 (type
, ada_array_bound (arg1
, tem
, 1));
9274 return value_from_longest
9275 (type
, ada_array_length (arg1
, tem
));
9278 else if (discrete_type_p (type_arg
))
9280 struct type
*range_type
;
9281 char *name
= ada_type_name (type_arg
);
9283 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9284 range_type
= to_fixed_range_type (name
, NULL
, type_arg
);
9285 if (range_type
== NULL
)
9286 range_type
= type_arg
;
9290 error (_("unexpected attribute encountered"));
9292 return value_from_longest
9293 (range_type
, ada_discrete_type_low_bound (range_type
));
9295 return value_from_longest
9296 (range_type
, ada_discrete_type_high_bound (range_type
));
9298 error (_("the 'length attribute applies only to array types"));
9301 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9302 error (_("unimplemented type attribute"));
9307 if (ada_is_constrained_packed_array_type (type_arg
))
9308 type_arg
= decode_constrained_packed_array_type (type_arg
);
9310 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
9312 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9314 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9315 return allocate_value (type
);
9320 error (_("unexpected attribute encountered"));
9322 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9323 return value_from_longest (type
, low
);
9325 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9326 return value_from_longest (type
, high
);
9328 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9329 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9330 return value_from_longest (type
, high
- low
+ 1);
9336 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9337 if (noside
== EVAL_SKIP
)
9340 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9341 return value_zero (ada_tag_type (arg1
), not_lval
);
9343 return ada_value_tag (arg1
);
9347 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9348 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9349 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9350 if (noside
== EVAL_SKIP
)
9352 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9353 return value_zero (value_type (arg1
), not_lval
);
9356 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9357 return value_binop (arg1
, arg2
,
9358 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9361 case OP_ATR_MODULUS
:
9363 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9364 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9366 if (noside
== EVAL_SKIP
)
9369 if (!ada_is_modular_type (type_arg
))
9370 error (_("'modulus must be applied to modular type"));
9372 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9373 ada_modulus (type_arg
));
9378 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9379 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9380 if (noside
== EVAL_SKIP
)
9382 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9383 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9384 return value_zero (type
, not_lval
);
9386 return value_pos_atr (type
, arg1
);
9389 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9390 type
= value_type (arg1
);
9392 /* If the argument is a reference, then dereference its type, since
9393 the user is really asking for the size of the actual object,
9394 not the size of the pointer. */
9395 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9396 type
= TYPE_TARGET_TYPE (type
);
9398 if (noside
== EVAL_SKIP
)
9400 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9401 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
9403 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
9404 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9407 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9408 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9409 type
= exp
->elts
[pc
+ 2].type
;
9410 if (noside
== EVAL_SKIP
)
9412 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9413 return value_zero (type
, not_lval
);
9415 return value_val_atr (type
, arg1
);
9418 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9419 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9420 if (noside
== EVAL_SKIP
)
9422 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9423 return value_zero (value_type (arg1
), not_lval
);
9426 /* For integer exponentiation operations,
9427 only promote the first argument. */
9428 if (is_integral_type (value_type (arg2
)))
9429 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9431 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9433 return value_binop (arg1
, arg2
, op
);
9437 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9438 if (noside
== EVAL_SKIP
)
9444 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9445 if (noside
== EVAL_SKIP
)
9447 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9448 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9449 return value_neg (arg1
);
9454 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9455 if (noside
== EVAL_SKIP
)
9457 type
= ada_check_typedef (value_type (arg1
));
9458 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9460 if (ada_is_array_descriptor_type (type
))
9461 /* GDB allows dereferencing GNAT array descriptors. */
9463 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9464 if (arrType
== NULL
)
9465 error (_("Attempt to dereference null array pointer."));
9466 return value_at_lazy (arrType
, 0);
9468 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9469 || TYPE_CODE (type
) == TYPE_CODE_REF
9470 /* In C you can dereference an array to get the 1st elt. */
9471 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9473 type
= to_static_fixed_type
9475 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9477 return value_zero (type
, lval_memory
);
9479 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9481 /* GDB allows dereferencing an int. */
9482 if (expect_type
== NULL
)
9483 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9488 to_static_fixed_type (ada_aligned_type (expect_type
));
9489 return value_zero (expect_type
, lval_memory
);
9493 error (_("Attempt to take contents of a non-pointer value."));
9495 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9496 type
= ada_check_typedef (value_type (arg1
));
9498 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9499 /* GDB allows dereferencing an int. If we were given
9500 the expect_type, then use that as the target type.
9501 Otherwise, assume that the target type is an int. */
9503 if (expect_type
!= NULL
)
9504 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9507 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9508 (CORE_ADDR
) value_as_address (arg1
));
9511 if (ada_is_array_descriptor_type (type
))
9512 /* GDB allows dereferencing GNAT array descriptors. */
9513 return ada_coerce_to_simple_array (arg1
);
9515 return ada_value_ind (arg1
);
9517 case STRUCTOP_STRUCT
:
9518 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9519 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9520 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9521 if (noside
== EVAL_SKIP
)
9523 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9525 struct type
*type1
= value_type (arg1
);
9526 if (ada_is_tagged_type (type1
, 1))
9528 type
= ada_lookup_struct_elt_type (type1
,
9529 &exp
->elts
[pc
+ 2].string
,
9532 /* In this case, we assume that the field COULD exist
9533 in some extension of the type. Return an object of
9534 "type" void, which will match any formal
9535 (see ada_type_match). */
9536 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
9541 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9544 return value_zero (ada_aligned_type (type
), lval_memory
);
9547 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
9548 arg1
= unwrap_value (arg1
);
9549 return ada_to_fixed_value (arg1
);
9552 /* The value is not supposed to be used. This is here to make it
9553 easier to accommodate expressions that contain types. */
9555 if (noside
== EVAL_SKIP
)
9557 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9558 return allocate_value (exp
->elts
[pc
+ 1].type
);
9560 error (_("Attempt to use a type name as an expression"));
9565 case OP_DISCRETE_RANGE
:
9568 if (noside
== EVAL_NORMAL
)
9572 error (_("Undefined name, ambiguous name, or renaming used in "
9573 "component association: %s."), &exp
->elts
[pc
+2].string
);
9575 error (_("Aggregates only allowed on the right of an assignment"));
9577 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9580 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9582 for (tem
= 0; tem
< nargs
; tem
+= 1)
9583 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9588 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
9594 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9595 type name that encodes the 'small and 'delta information.
9596 Otherwise, return NULL. */
9599 fixed_type_info (struct type
*type
)
9601 const char *name
= ada_type_name (type
);
9602 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9604 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9606 const char *tail
= strstr (name
, "___XF_");
9612 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9613 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9618 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9621 ada_is_fixed_point_type (struct type
*type
)
9623 return fixed_type_info (type
) != NULL
;
9626 /* Return non-zero iff TYPE represents a System.Address type. */
9629 ada_is_system_address_type (struct type
*type
)
9631 return (TYPE_NAME (type
)
9632 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9635 /* Assuming that TYPE is the representation of an Ada fixed-point
9636 type, return its delta, or -1 if the type is malformed and the
9637 delta cannot be determined. */
9640 ada_delta (struct type
*type
)
9642 const char *encoding
= fixed_type_info (type
);
9645 /* Strictly speaking, num and den are encoded as integer. However,
9646 they may not fit into a long, and they will have to be converted
9647 to DOUBLEST anyway. So scan them as DOUBLEST. */
9648 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9655 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9656 factor ('SMALL value) associated with the type. */
9659 scaling_factor (struct type
*type
)
9661 const char *encoding
= fixed_type_info (type
);
9662 DOUBLEST num0
, den0
, num1
, den1
;
9665 /* Strictly speaking, num's and den's are encoded as integer. However,
9666 they may not fit into a long, and they will have to be converted
9667 to DOUBLEST anyway. So scan them as DOUBLEST. */
9668 n
= sscanf (encoding
,
9669 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9670 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9671 &num0
, &den0
, &num1
, &den1
);
9682 /* Assuming that X is the representation of a value of fixed-point
9683 type TYPE, return its floating-point equivalent. */
9686 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9688 return (DOUBLEST
) x
*scaling_factor (type
);
9691 /* The representation of a fixed-point value of type TYPE
9692 corresponding to the value X. */
9695 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9697 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9704 /* Scan STR beginning at position K for a discriminant name, and
9705 return the value of that discriminant field of DVAL in *PX. If
9706 PNEW_K is not null, put the position of the character beyond the
9707 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9708 not alter *PX and *PNEW_K if unsuccessful. */
9711 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9714 static char *bound_buffer
= NULL
;
9715 static size_t bound_buffer_len
= 0;
9718 struct value
*bound_val
;
9720 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9723 pend
= strstr (str
+ k
, "__");
9727 k
+= strlen (bound
);
9731 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9732 bound
= bound_buffer
;
9733 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9734 bound
[pend
- (str
+ k
)] = '\0';
9738 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9739 if (bound_val
== NULL
)
9742 *px
= value_as_long (bound_val
);
9748 /* Value of variable named NAME in the current environment. If
9749 no such variable found, then if ERR_MSG is null, returns 0, and
9750 otherwise causes an error with message ERR_MSG. */
9752 static struct value
*
9753 get_var_value (char *name
, char *err_msg
)
9755 struct ada_symbol_info
*syms
;
9758 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9763 if (err_msg
== NULL
)
9766 error (("%s"), err_msg
);
9769 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9772 /* Value of integer variable named NAME in the current environment. If
9773 no such variable found, returns 0, and sets *FLAG to 0. If
9774 successful, sets *FLAG to 1. */
9777 get_int_var_value (char *name
, int *flag
)
9779 struct value
*var_val
= get_var_value (name
, 0);
9791 return value_as_long (var_val
);
9796 /* Return a range type whose base type is that of the range type named
9797 NAME in the current environment, and whose bounds are calculated
9798 from NAME according to the GNAT range encoding conventions.
9799 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
9800 corresponding range type from debug information; fall back to using it
9801 if symbol lookup fails. If a new type must be created, allocate it
9802 like ORIG_TYPE was. The bounds information, in general, is encoded
9803 in NAME, the base type given in the named range type. */
9805 static struct type
*
9806 to_fixed_range_type (char *name
, struct value
*dval
, struct type
*orig_type
)
9808 struct type
*raw_type
= ada_find_any_type (name
);
9809 struct type
*base_type
;
9812 /* Fall back to the original type if symbol lookup failed. */
9813 if (raw_type
== NULL
)
9814 raw_type
= orig_type
;
9816 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9817 base_type
= TYPE_TARGET_TYPE (raw_type
);
9819 base_type
= raw_type
;
9821 subtype_info
= strstr (name
, "___XD");
9822 if (subtype_info
== NULL
)
9824 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
9825 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
9826 if (L
< INT_MIN
|| U
> INT_MAX
)
9829 return create_range_type (alloc_type_copy (orig_type
), raw_type
,
9830 ada_discrete_type_low_bound (raw_type
),
9831 ada_discrete_type_high_bound (raw_type
));
9835 static char *name_buf
= NULL
;
9836 static size_t name_len
= 0;
9837 int prefix_len
= subtype_info
- name
;
9843 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9844 strncpy (name_buf
, name
, prefix_len
);
9845 name_buf
[prefix_len
] = '\0';
9848 bounds_str
= strchr (subtype_info
, '_');
9851 if (*subtype_info
== 'L')
9853 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9854 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9856 if (bounds_str
[n
] == '_')
9858 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9865 strcpy (name_buf
+ prefix_len
, "___L");
9866 L
= get_int_var_value (name_buf
, &ok
);
9869 lim_warning (_("Unknown lower bound, using 1."));
9874 if (*subtype_info
== 'U')
9876 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9877 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9883 strcpy (name_buf
+ prefix_len
, "___U");
9884 U
= get_int_var_value (name_buf
, &ok
);
9887 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9892 type
= create_range_type (alloc_type_copy (orig_type
), base_type
, L
, U
);
9893 TYPE_NAME (type
) = name
;
9898 /* True iff NAME is the name of a range type. */
9901 ada_is_range_type_name (const char *name
)
9903 return (name
!= NULL
&& strstr (name
, "___XD"));
9909 /* True iff TYPE is an Ada modular type. */
9912 ada_is_modular_type (struct type
*type
)
9914 struct type
*subranged_type
= base_type (type
);
9916 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9917 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9918 && TYPE_UNSIGNED (subranged_type
));
9921 /* Try to determine the lower and upper bounds of the given modular type
9922 using the type name only. Return non-zero and set L and U as the lower
9923 and upper bounds (respectively) if successful. */
9926 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9928 char *name
= ada_type_name (type
);
9936 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9937 we are looking for static bounds, which means an __XDLU suffix.
9938 Moreover, we know that the lower bound of modular types is always
9939 zero, so the actual suffix should start with "__XDLU_0__", and
9940 then be followed by the upper bound value. */
9941 suffix
= strstr (name
, "__XDLU_0__");
9945 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9948 *modulus
= (ULONGEST
) U
+ 1;
9952 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9955 ada_modulus (struct type
*type
)
9957 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9961 /* Ada exception catchpoint support:
9962 ---------------------------------
9964 We support 3 kinds of exception catchpoints:
9965 . catchpoints on Ada exceptions
9966 . catchpoints on unhandled Ada exceptions
9967 . catchpoints on failed assertions
9969 Exceptions raised during failed assertions, or unhandled exceptions
9970 could perfectly be caught with the general catchpoint on Ada exceptions.
9971 However, we can easily differentiate these two special cases, and having
9972 the option to distinguish these two cases from the rest can be useful
9973 to zero-in on certain situations.
9975 Exception catchpoints are a specialized form of breakpoint,
9976 since they rely on inserting breakpoints inside known routines
9977 of the GNAT runtime. The implementation therefore uses a standard
9978 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9981 Support in the runtime for exception catchpoints have been changed
9982 a few times already, and these changes affect the implementation
9983 of these catchpoints. In order to be able to support several
9984 variants of the runtime, we use a sniffer that will determine
9985 the runtime variant used by the program being debugged.
9987 At this time, we do not support the use of conditions on Ada exception
9988 catchpoints. The COND and COND_STRING fields are therefore set
9989 to NULL (most of the time, see below).
9991 Conditions where EXP_STRING, COND, and COND_STRING are used:
9993 When a user specifies the name of a specific exception in the case
9994 of catchpoints on Ada exceptions, we store the name of that exception
9995 in the EXP_STRING. We then translate this request into an actual
9996 condition stored in COND_STRING, and then parse it into an expression
9999 /* The different types of catchpoints that we introduced for catching
10002 enum exception_catchpoint_kind
10004 ex_catch_exception
,
10005 ex_catch_exception_unhandled
,
10009 /* Ada's standard exceptions. */
10011 static char *standard_exc
[] = {
10012 "constraint_error",
10018 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
10020 /* A structure that describes how to support exception catchpoints
10021 for a given executable. */
10023 struct exception_support_info
10025 /* The name of the symbol to break on in order to insert
10026 a catchpoint on exceptions. */
10027 const char *catch_exception_sym
;
10029 /* The name of the symbol to break on in order to insert
10030 a catchpoint on unhandled exceptions. */
10031 const char *catch_exception_unhandled_sym
;
10033 /* The name of the symbol to break on in order to insert
10034 a catchpoint on failed assertions. */
10035 const char *catch_assert_sym
;
10037 /* Assuming that the inferior just triggered an unhandled exception
10038 catchpoint, this function is responsible for returning the address
10039 in inferior memory where the name of that exception is stored.
10040 Return zero if the address could not be computed. */
10041 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
10044 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
10045 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
10047 /* The following exception support info structure describes how to
10048 implement exception catchpoints with the latest version of the
10049 Ada runtime (as of 2007-03-06). */
10051 static const struct exception_support_info default_exception_support_info
=
10053 "__gnat_debug_raise_exception", /* catch_exception_sym */
10054 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10055 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10056 ada_unhandled_exception_name_addr
10059 /* The following exception support info structure describes how to
10060 implement exception catchpoints with a slightly older version
10061 of the Ada runtime. */
10063 static const struct exception_support_info exception_support_info_fallback
=
10065 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10066 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10067 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10068 ada_unhandled_exception_name_addr_from_raise
10071 /* For each executable, we sniff which exception info structure to use
10072 and cache it in the following global variable. */
10074 static const struct exception_support_info
*exception_info
= NULL
;
10076 /* Inspect the Ada runtime and determine which exception info structure
10077 should be used to provide support for exception catchpoints.
10079 This function will always set exception_info, or raise an error. */
10082 ada_exception_support_info_sniffer (void)
10084 struct symbol
*sym
;
10086 /* If the exception info is already known, then no need to recompute it. */
10087 if (exception_info
!= NULL
)
10090 /* Check the latest (default) exception support info. */
10091 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
10095 exception_info
= &default_exception_support_info
;
10099 /* Try our fallback exception suport info. */
10100 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
10104 exception_info
= &exception_support_info_fallback
;
10108 /* Sometimes, it is normal for us to not be able to find the routine
10109 we are looking for. This happens when the program is linked with
10110 the shared version of the GNAT runtime, and the program has not been
10111 started yet. Inform the user of these two possible causes if
10114 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
10115 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10117 /* If the symbol does not exist, then check that the program is
10118 already started, to make sure that shared libraries have been
10119 loaded. If it is not started, this may mean that the symbol is
10120 in a shared library. */
10122 if (ptid_get_pid (inferior_ptid
) == 0)
10123 error (_("Unable to insert catchpoint. Try to start the program first."));
10125 /* At this point, we know that we are debugging an Ada program and
10126 that the inferior has been started, but we still are not able to
10127 find the run-time symbols. That can mean that we are in
10128 configurable run time mode, or that a-except as been optimized
10129 out by the linker... In any case, at this point it is not worth
10130 supporting this feature. */
10132 error (_("Cannot insert catchpoints in this configuration."));
10135 /* An observer of "executable_changed" events.
10136 Its role is to clear certain cached values that need to be recomputed
10137 each time a new executable is loaded by GDB. */
10140 ada_executable_changed_observer (void)
10142 /* If the executable changed, then it is possible that the Ada runtime
10143 is different. So we need to invalidate the exception support info
10145 exception_info
= NULL
;
10148 /* Return the name of the function at PC, NULL if could not find it.
10149 This function only checks the debugging information, not the symbol
10153 function_name_from_pc (CORE_ADDR pc
)
10157 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
10163 /* True iff FRAME is very likely to be that of a function that is
10164 part of the runtime system. This is all very heuristic, but is
10165 intended to be used as advice as to what frames are uninteresting
10169 is_known_support_routine (struct frame_info
*frame
)
10171 struct symtab_and_line sal
;
10175 /* If this code does not have any debugging information (no symtab),
10176 This cannot be any user code. */
10178 find_frame_sal (frame
, &sal
);
10179 if (sal
.symtab
== NULL
)
10182 /* If there is a symtab, but the associated source file cannot be
10183 located, then assume this is not user code: Selecting a frame
10184 for which we cannot display the code would not be very helpful
10185 for the user. This should also take care of case such as VxWorks
10186 where the kernel has some debugging info provided for a few units. */
10188 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10191 /* Check the unit filename againt the Ada runtime file naming.
10192 We also check the name of the objfile against the name of some
10193 known system libraries that sometimes come with debugging info
10196 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10198 re_comp (known_runtime_file_name_patterns
[i
]);
10199 if (re_exec (sal
.symtab
->filename
))
10201 if (sal
.symtab
->objfile
!= NULL
10202 && re_exec (sal
.symtab
->objfile
->name
))
10206 /* Check whether the function is a GNAT-generated entity. */
10208 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
10209 if (func_name
== NULL
)
10212 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10214 re_comp (known_auxiliary_function_name_patterns
[i
]);
10215 if (re_exec (func_name
))
10222 /* Find the first frame that contains debugging information and that is not
10223 part of the Ada run-time, starting from FI and moving upward. */
10226 ada_find_printable_frame (struct frame_info
*fi
)
10228 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10230 if (!is_known_support_routine (fi
))
10239 /* Assuming that the inferior just triggered an unhandled exception
10240 catchpoint, return the address in inferior memory where the name
10241 of the exception is stored.
10243 Return zero if the address could not be computed. */
10246 ada_unhandled_exception_name_addr (void)
10248 return parse_and_eval_address ("e.full_name");
10251 /* Same as ada_unhandled_exception_name_addr, except that this function
10252 should be used when the inferior uses an older version of the runtime,
10253 where the exception name needs to be extracted from a specific frame
10254 several frames up in the callstack. */
10257 ada_unhandled_exception_name_addr_from_raise (void)
10260 struct frame_info
*fi
;
10262 /* To determine the name of this exception, we need to select
10263 the frame corresponding to RAISE_SYM_NAME. This frame is
10264 at least 3 levels up, so we simply skip the first 3 frames
10265 without checking the name of their associated function. */
10266 fi
= get_current_frame ();
10267 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10269 fi
= get_prev_frame (fi
);
10273 const char *func_name
=
10274 function_name_from_pc (get_frame_address_in_block (fi
));
10275 if (func_name
!= NULL
10276 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
10277 break; /* We found the frame we were looking for... */
10278 fi
= get_prev_frame (fi
);
10285 return parse_and_eval_address ("id.full_name");
10288 /* Assuming the inferior just triggered an Ada exception catchpoint
10289 (of any type), return the address in inferior memory where the name
10290 of the exception is stored, if applicable.
10292 Return zero if the address could not be computed, or if not relevant. */
10295 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10296 struct breakpoint
*b
)
10300 case ex_catch_exception
:
10301 return (parse_and_eval_address ("e.full_name"));
10304 case ex_catch_exception_unhandled
:
10305 return exception_info
->unhandled_exception_name_addr ();
10308 case ex_catch_assert
:
10309 return 0; /* Exception name is not relevant in this case. */
10313 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10317 return 0; /* Should never be reached. */
10320 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10321 any error that ada_exception_name_addr_1 might cause to be thrown.
10322 When an error is intercepted, a warning with the error message is printed,
10323 and zero is returned. */
10326 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10327 struct breakpoint
*b
)
10329 struct gdb_exception e
;
10330 CORE_ADDR result
= 0;
10332 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10334 result
= ada_exception_name_addr_1 (ex
, b
);
10339 warning (_("failed to get exception name: %s"), e
.message
);
10346 /* Implement the PRINT_IT method in the breakpoint_ops structure
10347 for all exception catchpoint kinds. */
10349 static enum print_stop_action
10350 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10352 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10353 char exception_name
[256];
10357 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10358 exception_name
[sizeof (exception_name
) - 1] = '\0';
10361 ada_find_printable_frame (get_current_frame ());
10363 annotate_catchpoint (b
->number
);
10366 case ex_catch_exception
:
10368 printf_filtered (_("\nCatchpoint %d, %s at "),
10369 b
->number
, exception_name
);
10371 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10373 case ex_catch_exception_unhandled
:
10375 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10376 b
->number
, exception_name
);
10378 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10381 case ex_catch_assert
:
10382 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10387 return PRINT_SRC_AND_LOC
;
10390 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10391 for all exception catchpoint kinds. */
10394 print_one_exception (enum exception_catchpoint_kind ex
,
10395 struct breakpoint
*b
, struct bp_location
**last_loc
)
10397 struct value_print_options opts
;
10399 get_user_print_options (&opts
);
10400 if (opts
.addressprint
)
10402 annotate_field (4);
10403 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
10406 annotate_field (5);
10407 *last_loc
= b
->loc
;
10410 case ex_catch_exception
:
10411 if (b
->exp_string
!= NULL
)
10413 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10415 ui_out_field_string (uiout
, "what", msg
);
10419 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10423 case ex_catch_exception_unhandled
:
10424 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10427 case ex_catch_assert
:
10428 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10432 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10437 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10438 for all exception catchpoint kinds. */
10441 print_mention_exception (enum exception_catchpoint_kind ex
,
10442 struct breakpoint
*b
)
10446 case ex_catch_exception
:
10447 if (b
->exp_string
!= NULL
)
10448 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10449 b
->number
, b
->exp_string
);
10451 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10455 case ex_catch_exception_unhandled
:
10456 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10460 case ex_catch_assert
:
10461 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10465 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10470 /* Virtual table for "catch exception" breakpoints. */
10472 static enum print_stop_action
10473 print_it_catch_exception (struct breakpoint
*b
)
10475 return print_it_exception (ex_catch_exception
, b
);
10479 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
10481 print_one_exception (ex_catch_exception
, b
, last_loc
);
10485 print_mention_catch_exception (struct breakpoint
*b
)
10487 print_mention_exception (ex_catch_exception
, b
);
10490 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10494 NULL
, /* breakpoint_hit */
10495 print_it_catch_exception
,
10496 print_one_catch_exception
,
10497 print_mention_catch_exception
10500 /* Virtual table for "catch exception unhandled" breakpoints. */
10502 static enum print_stop_action
10503 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10505 return print_it_exception (ex_catch_exception_unhandled
, b
);
10509 print_one_catch_exception_unhandled (struct breakpoint
*b
,
10510 struct bp_location
**last_loc
)
10512 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
10516 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10518 print_mention_exception (ex_catch_exception_unhandled
, b
);
10521 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10524 NULL
, /* breakpoint_hit */
10525 print_it_catch_exception_unhandled
,
10526 print_one_catch_exception_unhandled
,
10527 print_mention_catch_exception_unhandled
10530 /* Virtual table for "catch assert" breakpoints. */
10532 static enum print_stop_action
10533 print_it_catch_assert (struct breakpoint
*b
)
10535 return print_it_exception (ex_catch_assert
, b
);
10539 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
10541 print_one_exception (ex_catch_assert
, b
, last_loc
);
10545 print_mention_catch_assert (struct breakpoint
*b
)
10547 print_mention_exception (ex_catch_assert
, b
);
10550 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10553 NULL
, /* breakpoint_hit */
10554 print_it_catch_assert
,
10555 print_one_catch_assert
,
10556 print_mention_catch_assert
10559 /* Return non-zero if B is an Ada exception catchpoint. */
10562 ada_exception_catchpoint_p (struct breakpoint
*b
)
10564 return (b
->ops
== &catch_exception_breakpoint_ops
10565 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10566 || b
->ops
== &catch_assert_breakpoint_ops
);
10569 /* Return a newly allocated copy of the first space-separated token
10570 in ARGSP, and then adjust ARGSP to point immediately after that
10573 Return NULL if ARGPS does not contain any more tokens. */
10576 ada_get_next_arg (char **argsp
)
10578 char *args
= *argsp
;
10582 /* Skip any leading white space. */
10584 while (isspace (*args
))
10587 if (args
[0] == '\0')
10588 return NULL
; /* No more arguments. */
10590 /* Find the end of the current argument. */
10593 while (*end
!= '\0' && !isspace (*end
))
10596 /* Adjust ARGSP to point to the start of the next argument. */
10600 /* Make a copy of the current argument and return it. */
10602 result
= xmalloc (end
- args
+ 1);
10603 strncpy (result
, args
, end
- args
);
10604 result
[end
- args
] = '\0';
10609 /* Split the arguments specified in a "catch exception" command.
10610 Set EX to the appropriate catchpoint type.
10611 Set EXP_STRING to the name of the specific exception if
10612 specified by the user. */
10615 catch_ada_exception_command_split (char *args
,
10616 enum exception_catchpoint_kind
*ex
,
10619 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10620 char *exception_name
;
10622 exception_name
= ada_get_next_arg (&args
);
10623 make_cleanup (xfree
, exception_name
);
10625 /* Check that we do not have any more arguments. Anything else
10628 while (isspace (*args
))
10631 if (args
[0] != '\0')
10632 error (_("Junk at end of expression"));
10634 discard_cleanups (old_chain
);
10636 if (exception_name
== NULL
)
10638 /* Catch all exceptions. */
10639 *ex
= ex_catch_exception
;
10640 *exp_string
= NULL
;
10642 else if (strcmp (exception_name
, "unhandled") == 0)
10644 /* Catch unhandled exceptions. */
10645 *ex
= ex_catch_exception_unhandled
;
10646 *exp_string
= NULL
;
10650 /* Catch a specific exception. */
10651 *ex
= ex_catch_exception
;
10652 *exp_string
= exception_name
;
10656 /* Return the name of the symbol on which we should break in order to
10657 implement a catchpoint of the EX kind. */
10659 static const char *
10660 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10662 gdb_assert (exception_info
!= NULL
);
10666 case ex_catch_exception
:
10667 return (exception_info
->catch_exception_sym
);
10669 case ex_catch_exception_unhandled
:
10670 return (exception_info
->catch_exception_unhandled_sym
);
10672 case ex_catch_assert
:
10673 return (exception_info
->catch_assert_sym
);
10676 internal_error (__FILE__
, __LINE__
,
10677 _("unexpected catchpoint kind (%d)"), ex
);
10681 /* Return the breakpoint ops "virtual table" used for catchpoints
10684 static struct breakpoint_ops
*
10685 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10689 case ex_catch_exception
:
10690 return (&catch_exception_breakpoint_ops
);
10692 case ex_catch_exception_unhandled
:
10693 return (&catch_exception_unhandled_breakpoint_ops
);
10695 case ex_catch_assert
:
10696 return (&catch_assert_breakpoint_ops
);
10699 internal_error (__FILE__
, __LINE__
,
10700 _("unexpected catchpoint kind (%d)"), ex
);
10704 /* Return the condition that will be used to match the current exception
10705 being raised with the exception that the user wants to catch. This
10706 assumes that this condition is used when the inferior just triggered
10707 an exception catchpoint.
10709 The string returned is a newly allocated string that needs to be
10710 deallocated later. */
10713 ada_exception_catchpoint_cond_string (const char *exp_string
)
10717 /* The standard exceptions are a special case. They are defined in
10718 runtime units that have been compiled without debugging info; if
10719 EXP_STRING is the not-fully-qualified name of a standard
10720 exception (e.g. "constraint_error") then, during the evaluation
10721 of the condition expression, the symbol lookup on this name would
10722 *not* return this standard exception. The catchpoint condition
10723 may then be set only on user-defined exceptions which have the
10724 same not-fully-qualified name (e.g. my_package.constraint_error).
10726 To avoid this unexcepted behavior, these standard exceptions are
10727 systematically prefixed by "standard". This means that "catch
10728 exception constraint_error" is rewritten into "catch exception
10729 standard.constraint_error".
10731 If an exception named contraint_error is defined in another package of
10732 the inferior program, then the only way to specify this exception as a
10733 breakpoint condition is to use its fully-qualified named:
10734 e.g. my_package.constraint_error. */
10736 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10738 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10740 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10744 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10747 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10749 static struct expression
*
10750 ada_parse_catchpoint_condition (char *cond_string
,
10751 struct symtab_and_line sal
)
10753 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10756 /* Return the symtab_and_line that should be used to insert an exception
10757 catchpoint of the TYPE kind.
10759 EX_STRING should contain the name of a specific exception
10760 that the catchpoint should catch, or NULL otherwise.
10762 The idea behind all the remaining parameters is that their names match
10763 the name of certain fields in the breakpoint structure that are used to
10764 handle exception catchpoints. This function returns the value to which
10765 these fields should be set, depending on the type of catchpoint we need
10768 If COND and COND_STRING are both non-NULL, any value they might
10769 hold will be free'ed, and then replaced by newly allocated ones.
10770 These parameters are left untouched otherwise. */
10772 static struct symtab_and_line
10773 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10774 char **addr_string
, char **cond_string
,
10775 struct expression
**cond
, struct breakpoint_ops
**ops
)
10777 const char *sym_name
;
10778 struct symbol
*sym
;
10779 struct symtab_and_line sal
;
10781 /* First, find out which exception support info to use. */
10782 ada_exception_support_info_sniffer ();
10784 /* Then lookup the function on which we will break in order to catch
10785 the Ada exceptions requested by the user. */
10787 sym_name
= ada_exception_sym_name (ex
);
10788 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10790 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10791 that should be compiled with debugging information. As a result, we
10792 expect to find that symbol in the symtabs. If we don't find it, then
10793 the target most likely does not support Ada exceptions, or we cannot
10794 insert exception breakpoints yet, because the GNAT runtime hasn't been
10797 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10798 in such a way that no debugging information is produced for the symbol
10799 we are looking for. In this case, we could search the minimal symbols
10800 as a fall-back mechanism. This would still be operating in degraded
10801 mode, however, as we would still be missing the debugging information
10802 that is needed in order to extract the name of the exception being
10803 raised (this name is printed in the catchpoint message, and is also
10804 used when trying to catch a specific exception). We do not handle
10805 this case for now. */
10808 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10810 /* Make sure that the symbol we found corresponds to a function. */
10811 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10812 error (_("Symbol \"%s\" is not a function (class = %d)"),
10813 sym_name
, SYMBOL_CLASS (sym
));
10815 sal
= find_function_start_sal (sym
, 1);
10817 /* Set ADDR_STRING. */
10819 *addr_string
= xstrdup (sym_name
);
10821 /* Set the COND and COND_STRING (if not NULL). */
10823 if (cond_string
!= NULL
&& cond
!= NULL
)
10825 if (*cond_string
!= NULL
)
10827 xfree (*cond_string
);
10828 *cond_string
= NULL
;
10835 if (exp_string
!= NULL
)
10837 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10838 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10843 *ops
= ada_exception_breakpoint_ops (ex
);
10848 /* Parse the arguments (ARGS) of the "catch exception" command.
10850 Set TYPE to the appropriate exception catchpoint type.
10851 If the user asked the catchpoint to catch only a specific
10852 exception, then save the exception name in ADDR_STRING.
10854 See ada_exception_sal for a description of all the remaining
10855 function arguments of this function. */
10857 struct symtab_and_line
10858 ada_decode_exception_location (char *args
, char **addr_string
,
10859 char **exp_string
, char **cond_string
,
10860 struct expression
**cond
,
10861 struct breakpoint_ops
**ops
)
10863 enum exception_catchpoint_kind ex
;
10865 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10866 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10870 struct symtab_and_line
10871 ada_decode_assert_location (char *args
, char **addr_string
,
10872 struct breakpoint_ops
**ops
)
10874 /* Check that no argument where provided at the end of the command. */
10878 while (isspace (*args
))
10881 error (_("Junk at end of arguments."));
10884 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10889 /* Information about operators given special treatment in functions
10891 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10893 #define ADA_OPERATORS \
10894 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10895 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10896 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10897 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10898 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10899 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10900 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10901 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10902 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10903 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10904 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10905 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10906 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10907 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10908 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10909 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10910 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10911 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10912 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10915 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10917 switch (exp
->elts
[pc
- 1].opcode
)
10920 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10923 #define OP_DEFN(op, len, args, binop) \
10924 case op: *oplenp = len; *argsp = args; break;
10930 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10935 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10941 ada_op_name (enum exp_opcode opcode
)
10946 return op_name_standard (opcode
);
10948 #define OP_DEFN(op, len, args, binop) case op: return #op;
10953 return "OP_AGGREGATE";
10955 return "OP_CHOICES";
10961 /* As for operator_length, but assumes PC is pointing at the first
10962 element of the operator, and gives meaningful results only for the
10963 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10966 ada_forward_operator_length (struct expression
*exp
, int pc
,
10967 int *oplenp
, int *argsp
)
10969 switch (exp
->elts
[pc
].opcode
)
10972 *oplenp
= *argsp
= 0;
10975 #define OP_DEFN(op, len, args, binop) \
10976 case op: *oplenp = len; *argsp = args; break;
10982 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10987 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10993 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10994 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
11002 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
11004 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
11009 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
11013 /* Ada attributes ('Foo). */
11016 case OP_ATR_LENGTH
:
11020 case OP_ATR_MODULUS
:
11027 case UNOP_IN_RANGE
:
11029 /* XXX: gdb_sprint_host_address, type_sprint */
11030 fprintf_filtered (stream
, _("Type @"));
11031 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
11032 fprintf_filtered (stream
, " (");
11033 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
11034 fprintf_filtered (stream
, ")");
11036 case BINOP_IN_BOUNDS
:
11037 fprintf_filtered (stream
, " (%d)",
11038 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
11040 case TERNOP_IN_RANGE
:
11045 case OP_DISCRETE_RANGE
:
11046 case OP_POSITIONAL
:
11053 char *name
= &exp
->elts
[elt
+ 2].string
;
11054 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
11055 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
11060 return dump_subexp_body_standard (exp
, stream
, elt
);
11064 for (i
= 0; i
< nargs
; i
+= 1)
11065 elt
= dump_subexp (exp
, stream
, elt
);
11070 /* The Ada extension of print_subexp (q.v.). */
11073 ada_print_subexp (struct expression
*exp
, int *pos
,
11074 struct ui_file
*stream
, enum precedence prec
)
11076 int oplen
, nargs
, i
;
11078 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
11080 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11087 print_subexp_standard (exp
, pos
, stream
, prec
);
11091 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
11094 case BINOP_IN_BOUNDS
:
11095 /* XXX: sprint_subexp */
11096 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11097 fputs_filtered (" in ", stream
);
11098 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11099 fputs_filtered ("'range", stream
);
11100 if (exp
->elts
[pc
+ 1].longconst
> 1)
11101 fprintf_filtered (stream
, "(%ld)",
11102 (long) exp
->elts
[pc
+ 1].longconst
);
11105 case TERNOP_IN_RANGE
:
11106 if (prec
>= PREC_EQUAL
)
11107 fputs_filtered ("(", stream
);
11108 /* XXX: sprint_subexp */
11109 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11110 fputs_filtered (" in ", stream
);
11111 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11112 fputs_filtered (" .. ", stream
);
11113 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11114 if (prec
>= PREC_EQUAL
)
11115 fputs_filtered (")", stream
);
11120 case OP_ATR_LENGTH
:
11124 case OP_ATR_MODULUS
:
11129 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11131 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
11132 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
11136 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11137 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
11141 for (tem
= 1; tem
< nargs
; tem
+= 1)
11143 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
11144 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
11146 fputs_filtered (")", stream
);
11151 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
11152 fputs_filtered ("'(", stream
);
11153 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
11154 fputs_filtered (")", stream
);
11157 case UNOP_IN_RANGE
:
11158 /* XXX: sprint_subexp */
11159 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11160 fputs_filtered (" in ", stream
);
11161 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
11164 case OP_DISCRETE_RANGE
:
11165 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11166 fputs_filtered ("..", stream
);
11167 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11171 fputs_filtered ("others => ", stream
);
11172 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11176 for (i
= 0; i
< nargs
-1; i
+= 1)
11179 fputs_filtered ("|", stream
);
11180 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11182 fputs_filtered (" => ", stream
);
11183 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11186 case OP_POSITIONAL
:
11187 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11191 fputs_filtered ("(", stream
);
11192 for (i
= 0; i
< nargs
; i
+= 1)
11195 fputs_filtered (", ", stream
);
11196 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11198 fputs_filtered (")", stream
);
11203 /* Table mapping opcodes into strings for printing operators
11204 and precedences of the operators. */
11206 static const struct op_print ada_op_print_tab
[] = {
11207 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
11208 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
11209 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
11210 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
11211 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
11212 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
11213 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
11214 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
11215 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
11216 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
11217 {">", BINOP_GTR
, PREC_ORDER
, 0},
11218 {"<", BINOP_LESS
, PREC_ORDER
, 0},
11219 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
11220 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
11221 {"+", BINOP_ADD
, PREC_ADD
, 0},
11222 {"-", BINOP_SUB
, PREC_ADD
, 0},
11223 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
11224 {"*", BINOP_MUL
, PREC_MUL
, 0},
11225 {"/", BINOP_DIV
, PREC_MUL
, 0},
11226 {"rem", BINOP_REM
, PREC_MUL
, 0},
11227 {"mod", BINOP_MOD
, PREC_MUL
, 0},
11228 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
11229 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
11230 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
11231 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
11232 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
11233 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
11234 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
11235 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
11236 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
11237 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
11241 enum ada_primitive_types
{
11242 ada_primitive_type_int
,
11243 ada_primitive_type_long
,
11244 ada_primitive_type_short
,
11245 ada_primitive_type_char
,
11246 ada_primitive_type_float
,
11247 ada_primitive_type_double
,
11248 ada_primitive_type_void
,
11249 ada_primitive_type_long_long
,
11250 ada_primitive_type_long_double
,
11251 ada_primitive_type_natural
,
11252 ada_primitive_type_positive
,
11253 ada_primitive_type_system_address
,
11254 nr_ada_primitive_types
11258 ada_language_arch_info (struct gdbarch
*gdbarch
,
11259 struct language_arch_info
*lai
)
11261 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
11262 lai
->primitive_type_vector
11263 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
11266 lai
->primitive_type_vector
[ada_primitive_type_int
]
11267 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11269 lai
->primitive_type_vector
[ada_primitive_type_long
]
11270 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
11271 0, "long_integer");
11272 lai
->primitive_type_vector
[ada_primitive_type_short
]
11273 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
11274 0, "short_integer");
11275 lai
->string_char_type
11276 = lai
->primitive_type_vector
[ada_primitive_type_char
]
11277 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
11278 lai
->primitive_type_vector
[ada_primitive_type_float
]
11279 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
11281 lai
->primitive_type_vector
[ada_primitive_type_double
]
11282 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11283 "long_float", NULL
);
11284 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
11285 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
11286 0, "long_long_integer");
11287 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
11288 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11289 "long_long_float", NULL
);
11290 lai
->primitive_type_vector
[ada_primitive_type_natural
]
11291 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11293 lai
->primitive_type_vector
[ada_primitive_type_positive
]
11294 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11296 lai
->primitive_type_vector
[ada_primitive_type_void
]
11297 = builtin
->builtin_void
;
11299 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
11300 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
11301 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
11302 = "system__address";
11304 lai
->bool_type_symbol
= NULL
;
11305 lai
->bool_type_default
= builtin
->builtin_bool
;
11308 /* Language vector */
11310 /* Not really used, but needed in the ada_language_defn. */
11313 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
11315 ada_emit_char (c
, type
, stream
, quoter
, 1);
11321 warnings_issued
= 0;
11322 return ada_parse ();
11325 static const struct exp_descriptor ada_exp_descriptor
= {
11327 ada_operator_length
,
11329 ada_dump_subexp_body
,
11330 ada_evaluate_subexp
11333 const struct language_defn ada_language_defn
= {
11334 "ada", /* Language name */
11338 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11339 that's not quite what this means. */
11341 macro_expansion_no
,
11342 &ada_exp_descriptor
,
11346 ada_printchar
, /* Print a character constant */
11347 ada_printstr
, /* Function to print string constant */
11348 emit_char
, /* Function to print single char (not used) */
11349 ada_print_type
, /* Print a type using appropriate syntax */
11350 default_print_typedef
, /* Print a typedef using appropriate syntax */
11351 ada_val_print
, /* Print a value using appropriate syntax */
11352 ada_value_print
, /* Print a top-level value */
11353 NULL
, /* Language specific skip_trampoline */
11354 NULL
, /* name_of_this */
11355 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11356 basic_lookup_transparent_type
, /* lookup_transparent_type */
11357 ada_la_decode
, /* Language specific symbol demangler */
11358 NULL
, /* Language specific class_name_from_physname */
11359 ada_op_print_tab
, /* expression operators for printing */
11360 0, /* c-style arrays */
11361 1, /* String lower bound */
11362 ada_get_gdb_completer_word_break_characters
,
11363 ada_make_symbol_completion_list
,
11364 ada_language_arch_info
,
11365 ada_print_array_index
,
11366 default_pass_by_reference
,
11371 /* Provide a prototype to silence -Wmissing-prototypes. */
11372 extern initialize_file_ftype _initialize_ada_language
;
11375 _initialize_ada_language (void)
11377 add_language (&ada_language_defn
);
11379 varsize_limit
= 65536;
11381 obstack_init (&symbol_list_obstack
);
11383 decoded_names_store
= htab_create_alloc
11384 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11385 NULL
, xcalloc
, xfree
);
11387 observer_attach_executable_changed (ada_executable_changed_observer
);