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"
63 /* Define whether or not the C operator '/' truncates towards zero for
64 differently signed operands (truncation direction is undefined in C).
65 Copied from valarith.c. */
67 #ifndef TRUNCATION_TOWARDS_ZERO
68 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
71 static void modify_general_field (struct type
*, char *, LONGEST
, int, int);
73 static struct type
*desc_base_type (struct type
*);
75 static struct type
*desc_bounds_type (struct type
*);
77 static struct value
*desc_bounds (struct value
*);
79 static int fat_pntr_bounds_bitpos (struct type
*);
81 static int fat_pntr_bounds_bitsize (struct type
*);
83 static struct type
*desc_data_target_type (struct type
*);
85 static struct value
*desc_data (struct value
*);
87 static int fat_pntr_data_bitpos (struct type
*);
89 static int fat_pntr_data_bitsize (struct type
*);
91 static struct value
*desc_one_bound (struct value
*, int, int);
93 static int desc_bound_bitpos (struct type
*, int, int);
95 static int desc_bound_bitsize (struct type
*, int, int);
97 static struct type
*desc_index_type (struct type
*, int);
99 static int desc_arity (struct type
*);
101 static int ada_type_match (struct type
*, struct type
*, int);
103 static int ada_args_match (struct symbol
*, struct value
**, int);
105 static struct value
*ensure_lval (struct value
*,
106 struct gdbarch
*, CORE_ADDR
*);
108 static struct value
*make_array_descriptor (struct type
*, struct value
*,
109 struct gdbarch
*, CORE_ADDR
*);
111 static void ada_add_block_symbols (struct obstack
*,
112 struct block
*, const char *,
113 domain_enum
, struct objfile
*, int);
115 static int is_nonfunction (struct ada_symbol_info
*, int);
117 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
120 static int num_defns_collected (struct obstack
*);
122 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
124 static struct value
*resolve_subexp (struct expression
**, int *, int,
127 static void replace_operator_with_call (struct expression
**, int, int, int,
128 struct symbol
*, struct block
*);
130 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
132 static char *ada_op_name (enum exp_opcode
);
134 static const char *ada_decoded_op_name (enum exp_opcode
);
136 static int numeric_type_p (struct type
*);
138 static int integer_type_p (struct type
*);
140 static int scalar_type_p (struct type
*);
142 static int discrete_type_p (struct type
*);
144 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
149 static struct symbol
*find_old_style_renaming_symbol (const char *,
152 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
155 static struct value
*evaluate_subexp_type (struct expression
*, int *);
157 static struct type
*ada_find_parallel_type_with_name (struct type
*,
160 static int is_dynamic_field (struct type
*, int);
162 static struct type
*to_fixed_variant_branch_type (struct type
*,
164 CORE_ADDR
, struct value
*);
166 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
168 static struct type
*to_fixed_range_type (char *, struct value
*,
171 static struct type
*to_static_fixed_type (struct type
*);
172 static struct type
*static_unwrap_type (struct type
*type
);
174 static struct value
*unwrap_value (struct value
*);
176 static struct type
*constrained_packed_array_type (struct type
*, long *);
178 static struct type
*decode_constrained_packed_array_type (struct type
*);
180 static long decode_packed_array_bitsize (struct type
*);
182 static struct value
*decode_constrained_packed_array (struct value
*);
184 static int ada_is_packed_array_type (struct type
*);
186 static int ada_is_unconstrained_packed_array_type (struct type
*);
188 static struct value
*value_subscript_packed (struct value
*, int,
191 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
193 static struct value
*coerce_unspec_val_to_type (struct value
*,
196 static struct value
*get_var_value (char *, char *);
198 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
200 static int equiv_types (struct type
*, struct type
*);
202 static int is_name_suffix (const char *);
204 static int wild_match (const char *, int, const char *);
206 static struct value
*ada_coerce_ref (struct value
*);
208 static LONGEST
pos_atr (struct value
*);
210 static struct value
*value_pos_atr (struct type
*, struct value
*);
212 static struct value
*value_val_atr (struct type
*, struct value
*);
214 static struct symbol
*standard_lookup (const char *, const struct block
*,
217 static struct value
*ada_search_struct_field (char *, struct value
*, int,
220 static struct value
*ada_value_primitive_field (struct value
*, int, int,
223 static int find_struct_field (char *, struct type
*, int,
224 struct type
**, int *, int *, int *, int *);
226 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
229 static struct value
*ada_to_fixed_value (struct value
*);
231 static int ada_resolve_function (struct ada_symbol_info
*, int,
232 struct value
**, int, const char *,
235 static struct value
*ada_coerce_to_simple_array (struct value
*);
237 static int ada_is_direct_array_type (struct type
*);
239 static void ada_language_arch_info (struct gdbarch
*,
240 struct language_arch_info
*);
242 static void check_size (const struct type
*);
244 static struct value
*ada_index_struct_field (int, struct value
*, int,
247 static struct value
*assign_aggregate (struct value
*, struct value
*,
248 struct expression
*, int *, enum noside
);
250 static void aggregate_assign_from_choices (struct value
*, struct value
*,
252 int *, LONGEST
*, int *,
253 int, LONGEST
, LONGEST
);
255 static void aggregate_assign_positional (struct value
*, struct value
*,
257 int *, LONGEST
*, int *, int,
261 static void aggregate_assign_others (struct value
*, struct value
*,
263 int *, LONGEST
*, int, LONGEST
, LONGEST
);
266 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
269 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
272 static void ada_forward_operator_length (struct expression
*, int, int *,
277 /* Maximum-sized dynamic type. */
278 static unsigned int varsize_limit
;
280 /* FIXME: brobecker/2003-09-17: No longer a const because it is
281 returned by a function that does not return a const char *. */
282 static char *ada_completer_word_break_characters
=
284 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
286 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
289 /* The name of the symbol to use to get the name of the main subprogram. */
290 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
291 = "__gnat_ada_main_program_name";
293 /* Limit on the number of warnings to raise per expression evaluation. */
294 static int warning_limit
= 2;
296 /* Number of warning messages issued; reset to 0 by cleanups after
297 expression evaluation. */
298 static int warnings_issued
= 0;
300 static const char *known_runtime_file_name_patterns
[] = {
301 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
304 static const char *known_auxiliary_function_name_patterns
[] = {
305 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
308 /* Space for allocating results of ada_lookup_symbol_list. */
309 static struct obstack symbol_list_obstack
;
313 /* Given DECODED_NAME a string holding a symbol name in its
314 decoded form (ie using the Ada dotted notation), returns
315 its unqualified name. */
318 ada_unqualified_name (const char *decoded_name
)
320 const char *result
= strrchr (decoded_name
, '.');
323 result
++; /* Skip the dot... */
325 result
= decoded_name
;
330 /* Return a string starting with '<', followed by STR, and '>'.
331 The result is good until the next call. */
334 add_angle_brackets (const char *str
)
336 static char *result
= NULL
;
339 result
= xstrprintf ("<%s>", str
);
344 ada_get_gdb_completer_word_break_characters (void)
346 return ada_completer_word_break_characters
;
349 /* Print an array element index using the Ada syntax. */
352 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
353 const struct value_print_options
*options
)
355 LA_VALUE_PRINT (index_value
, stream
, options
);
356 fprintf_filtered (stream
, " => ");
359 /* Assuming VECT points to an array of *SIZE objects of size
360 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
361 updating *SIZE as necessary and returning the (new) array. */
364 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
366 if (*size
< min_size
)
369 if (*size
< min_size
)
371 vect
= xrealloc (vect
, *size
* element_size
);
376 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
377 suffix of FIELD_NAME beginning "___". */
380 field_name_match (const char *field_name
, const char *target
)
382 int len
= strlen (target
);
384 (strncmp (field_name
, target
, len
) == 0
385 && (field_name
[len
] == '\0'
386 || (strncmp (field_name
+ len
, "___", 3) == 0
387 && strcmp (field_name
+ strlen (field_name
) - 6,
392 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
393 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
394 and return its index. This function also handles fields whose name
395 have ___ suffixes because the compiler sometimes alters their name
396 by adding such a suffix to represent fields with certain constraints.
397 If the field could not be found, return a negative number if
398 MAYBE_MISSING is set. Otherwise raise an error. */
401 ada_get_field_index (const struct type
*type
, const char *field_name
,
405 struct type
*struct_type
= check_typedef ((struct type
*) type
);
407 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
408 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
412 error (_("Unable to find field %s in struct %s. Aborting"),
413 field_name
, TYPE_NAME (struct_type
));
418 /* The length of the prefix of NAME prior to any "___" suffix. */
421 ada_name_prefix_len (const char *name
)
427 const char *p
= strstr (name
, "___");
429 return strlen (name
);
435 /* Return non-zero if SUFFIX is a suffix of STR.
436 Return zero if STR is null. */
439 is_suffix (const char *str
, const char *suffix
)
445 len2
= strlen (suffix
);
446 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
449 /* The contents of value VAL, treated as a value of type TYPE. The
450 result is an lval in memory if VAL is. */
452 static struct value
*
453 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
455 type
= ada_check_typedef (type
);
456 if (value_type (val
) == type
)
460 struct value
*result
;
462 /* Make sure that the object size is not unreasonable before
463 trying to allocate some memory for it. */
466 result
= allocate_value (type
);
467 set_value_component_location (result
, val
);
468 set_value_bitsize (result
, value_bitsize (val
));
469 set_value_bitpos (result
, value_bitpos (val
));
470 set_value_address (result
, value_address (val
));
472 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
473 set_value_lazy (result
, 1);
475 memcpy (value_contents_raw (result
), value_contents (val
),
481 static const gdb_byte
*
482 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
487 return valaddr
+ offset
;
491 cond_offset_target (CORE_ADDR address
, long offset
)
496 return address
+ offset
;
499 /* Issue a warning (as for the definition of warning in utils.c, but
500 with exactly one argument rather than ...), unless the limit on the
501 number of warnings has passed during the evaluation of the current
504 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
505 provided by "complaint". */
506 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
509 lim_warning (const char *format
, ...)
512 va_start (args
, format
);
514 warnings_issued
+= 1;
515 if (warnings_issued
<= warning_limit
)
516 vwarning (format
, args
);
521 /* Issue an error if the size of an object of type T is unreasonable,
522 i.e. if it would be a bad idea to allocate a value of this type in
526 check_size (const struct type
*type
)
528 if (TYPE_LENGTH (type
) > varsize_limit
)
529 error (_("object size is larger than varsize-limit"));
533 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
534 gdbtypes.h, but some of the necessary definitions in that file
535 seem to have gone missing. */
537 /* Maximum value of a SIZE-byte signed integer type. */
539 max_of_size (int size
)
541 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
542 return top_bit
| (top_bit
- 1);
545 /* Minimum value of a SIZE-byte signed integer type. */
547 min_of_size (int size
)
549 return -max_of_size (size
) - 1;
552 /* Maximum value of a SIZE-byte unsigned integer type. */
554 umax_of_size (int size
)
556 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
557 return top_bit
| (top_bit
- 1);
560 /* Maximum value of integral type T, as a signed quantity. */
562 max_of_type (struct type
*t
)
564 if (TYPE_UNSIGNED (t
))
565 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
567 return max_of_size (TYPE_LENGTH (t
));
570 /* Minimum value of integral type T, as a signed quantity. */
572 min_of_type (struct type
*t
)
574 if (TYPE_UNSIGNED (t
))
577 return min_of_size (TYPE_LENGTH (t
));
580 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
582 ada_discrete_type_high_bound (struct type
*type
)
584 switch (TYPE_CODE (type
))
586 case TYPE_CODE_RANGE
:
587 return TYPE_HIGH_BOUND (type
);
589 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
594 return max_of_type (type
);
596 error (_("Unexpected type in ada_discrete_type_high_bound."));
600 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
602 ada_discrete_type_low_bound (struct type
*type
)
604 switch (TYPE_CODE (type
))
606 case TYPE_CODE_RANGE
:
607 return TYPE_LOW_BOUND (type
);
609 return TYPE_FIELD_BITPOS (type
, 0);
614 return min_of_type (type
);
616 error (_("Unexpected type in ada_discrete_type_low_bound."));
620 /* The identity on non-range types. For range types, the underlying
621 non-range scalar type. */
624 base_type (struct type
*type
)
626 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
628 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
630 type
= TYPE_TARGET_TYPE (type
);
636 /* Language Selection */
638 /* If the main program is in Ada, return language_ada, otherwise return LANG
639 (the main program is in Ada iif the adainit symbol is found). */
642 ada_update_initial_language (enum language lang
)
644 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
645 (struct objfile
*) NULL
) != NULL
)
651 /* If the main procedure is written in Ada, then return its name.
652 The result is good until the next call. Return NULL if the main
653 procedure doesn't appear to be in Ada. */
658 struct minimal_symbol
*msym
;
659 static char *main_program_name
= NULL
;
661 /* For Ada, the name of the main procedure is stored in a specific
662 string constant, generated by the binder. Look for that symbol,
663 extract its address, and then read that string. If we didn't find
664 that string, then most probably the main procedure is not written
666 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
670 CORE_ADDR main_program_name_addr
;
673 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
674 if (main_program_name_addr
== 0)
675 error (_("Invalid address for Ada main program name."));
677 xfree (main_program_name
);
678 target_read_string (main_program_name_addr
, &main_program_name
,
683 return main_program_name
;
686 /* The main procedure doesn't seem to be in Ada. */
692 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
695 const struct ada_opname_map ada_opname_table
[] = {
696 {"Oadd", "\"+\"", BINOP_ADD
},
697 {"Osubtract", "\"-\"", BINOP_SUB
},
698 {"Omultiply", "\"*\"", BINOP_MUL
},
699 {"Odivide", "\"/\"", BINOP_DIV
},
700 {"Omod", "\"mod\"", BINOP_MOD
},
701 {"Orem", "\"rem\"", BINOP_REM
},
702 {"Oexpon", "\"**\"", BINOP_EXP
},
703 {"Olt", "\"<\"", BINOP_LESS
},
704 {"Ole", "\"<=\"", BINOP_LEQ
},
705 {"Ogt", "\">\"", BINOP_GTR
},
706 {"Oge", "\">=\"", BINOP_GEQ
},
707 {"Oeq", "\"=\"", BINOP_EQUAL
},
708 {"One", "\"/=\"", BINOP_NOTEQUAL
},
709 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
710 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
711 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
712 {"Oconcat", "\"&\"", BINOP_CONCAT
},
713 {"Oabs", "\"abs\"", UNOP_ABS
},
714 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
715 {"Oadd", "\"+\"", UNOP_PLUS
},
716 {"Osubtract", "\"-\"", UNOP_NEG
},
720 /* The "encoded" form of DECODED, according to GNAT conventions.
721 The result is valid until the next call to ada_encode. */
724 ada_encode (const char *decoded
)
726 static char *encoding_buffer
= NULL
;
727 static size_t encoding_buffer_size
= 0;
734 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
735 2 * strlen (decoded
) + 10);
738 for (p
= decoded
; *p
!= '\0'; p
+= 1)
742 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
747 const struct ada_opname_map
*mapping
;
749 for (mapping
= ada_opname_table
;
750 mapping
->encoded
!= NULL
751 && strncmp (mapping
->decoded
, p
,
752 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
754 if (mapping
->encoded
== NULL
)
755 error (_("invalid Ada operator name: %s"), p
);
756 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
757 k
+= strlen (mapping
->encoded
);
762 encoding_buffer
[k
] = *p
;
767 encoding_buffer
[k
] = '\0';
768 return encoding_buffer
;
771 /* Return NAME folded to lower case, or, if surrounded by single
772 quotes, unfolded, but with the quotes stripped away. Result good
776 ada_fold_name (const char *name
)
778 static char *fold_buffer
= NULL
;
779 static size_t fold_buffer_size
= 0;
781 int len
= strlen (name
);
782 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
786 strncpy (fold_buffer
, name
+ 1, len
- 2);
787 fold_buffer
[len
- 2] = '\000';
792 for (i
= 0; i
<= len
; i
+= 1)
793 fold_buffer
[i
] = tolower (name
[i
]);
799 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
802 is_lower_alphanum (const char c
)
804 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
807 /* Remove either of these suffixes:
812 These are suffixes introduced by the compiler for entities such as
813 nested subprogram for instance, in order to avoid name clashes.
814 They do not serve any purpose for the debugger. */
817 ada_remove_trailing_digits (const char *encoded
, int *len
)
819 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
822 while (i
> 0 && isdigit (encoded
[i
]))
824 if (i
>= 0 && encoded
[i
] == '.')
826 else if (i
>= 0 && encoded
[i
] == '$')
828 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
830 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
835 /* Remove the suffix introduced by the compiler for protected object
839 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
841 /* Remove trailing N. */
843 /* Protected entry subprograms are broken into two
844 separate subprograms: The first one is unprotected, and has
845 a 'N' suffix; the second is the protected version, and has
846 the 'P' suffix. The second calls the first one after handling
847 the protection. Since the P subprograms are internally generated,
848 we leave these names undecoded, giving the user a clue that this
849 entity is internal. */
852 && encoded
[*len
- 1] == 'N'
853 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
857 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
860 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
864 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
867 if (encoded
[i
] != 'X')
873 if (isalnum (encoded
[i
-1]))
877 /* If ENCODED follows the GNAT entity encoding conventions, then return
878 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
881 The resulting string is valid until the next call of ada_decode.
882 If the string is unchanged by decoding, the original string pointer
886 ada_decode (const char *encoded
)
893 static char *decoding_buffer
= NULL
;
894 static size_t decoding_buffer_size
= 0;
896 /* The name of the Ada main procedure starts with "_ada_".
897 This prefix is not part of the decoded name, so skip this part
898 if we see this prefix. */
899 if (strncmp (encoded
, "_ada_", 5) == 0)
902 /* If the name starts with '_', then it is not a properly encoded
903 name, so do not attempt to decode it. Similarly, if the name
904 starts with '<', the name should not be decoded. */
905 if (encoded
[0] == '_' || encoded
[0] == '<')
908 len0
= strlen (encoded
);
910 ada_remove_trailing_digits (encoded
, &len0
);
911 ada_remove_po_subprogram_suffix (encoded
, &len0
);
913 /* Remove the ___X.* suffix if present. Do not forget to verify that
914 the suffix is located before the current "end" of ENCODED. We want
915 to avoid re-matching parts of ENCODED that have previously been
916 marked as discarded (by decrementing LEN0). */
917 p
= strstr (encoded
, "___");
918 if (p
!= NULL
&& p
- encoded
< len0
- 3)
926 /* Remove any trailing TKB suffix. It tells us that this symbol
927 is for the body of a task, but that information does not actually
928 appear in the decoded name. */
930 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
933 /* Remove any trailing TB suffix. The TB suffix is slightly different
934 from the TKB suffix because it is used for non-anonymous task
937 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
940 /* Remove trailing "B" suffixes. */
941 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
943 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
946 /* Make decoded big enough for possible expansion by operator name. */
948 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
949 decoded
= decoding_buffer
;
951 /* Remove trailing __{digit}+ or trailing ${digit}+. */
953 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
956 while ((i
>= 0 && isdigit (encoded
[i
]))
957 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
959 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
961 else if (encoded
[i
] == '$')
965 /* The first few characters that are not alphabetic are not part
966 of any encoding we use, so we can copy them over verbatim. */
968 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
969 decoded
[j
] = encoded
[i
];
974 /* Is this a symbol function? */
975 if (at_start_name
&& encoded
[i
] == 'O')
978 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
980 int op_len
= strlen (ada_opname_table
[k
].encoded
);
981 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
983 && !isalnum (encoded
[i
+ op_len
]))
985 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
988 j
+= strlen (ada_opname_table
[k
].decoded
);
992 if (ada_opname_table
[k
].encoded
!= NULL
)
997 /* Replace "TK__" with "__", which will eventually be translated
998 into "." (just below). */
1000 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1003 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1004 be translated into "." (just below). These are internal names
1005 generated for anonymous blocks inside which our symbol is nested. */
1007 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1008 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1009 && isdigit (encoded
[i
+4]))
1013 while (k
< len0
&& isdigit (encoded
[k
]))
1014 k
++; /* Skip any extra digit. */
1016 /* Double-check that the "__B_{DIGITS}+" sequence we found
1017 is indeed followed by "__". */
1018 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1022 /* Remove _E{DIGITS}+[sb] */
1024 /* Just as for protected object subprograms, there are 2 categories
1025 of subprograms created by the compiler for each entry. The first
1026 one implements the actual entry code, and has a suffix following
1027 the convention above; the second one implements the barrier and
1028 uses the same convention as above, except that the 'E' is replaced
1031 Just as above, we do not decode the name of barrier functions
1032 to give the user a clue that the code he is debugging has been
1033 internally generated. */
1035 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1036 && isdigit (encoded
[i
+2]))
1040 while (k
< len0
&& isdigit (encoded
[k
]))
1044 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1047 /* Just as an extra precaution, make sure that if this
1048 suffix is followed by anything else, it is a '_'.
1049 Otherwise, we matched this sequence by accident. */
1051 || (k
< len0
&& encoded
[k
] == '_'))
1056 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1057 the GNAT front-end in protected object subprograms. */
1060 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1062 /* Backtrack a bit up until we reach either the begining of
1063 the encoded name, or "__". Make sure that we only find
1064 digits or lowercase characters. */
1065 const char *ptr
= encoded
+ i
- 1;
1067 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1070 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1074 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1076 /* This is a X[bn]* sequence not separated from the previous
1077 part of the name with a non-alpha-numeric character (in other
1078 words, immediately following an alpha-numeric character), then
1079 verify that it is placed at the end of the encoded name. If
1080 not, then the encoding is not valid and we should abort the
1081 decoding. Otherwise, just skip it, it is used in body-nested
1085 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1089 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1091 /* Replace '__' by '.'. */
1099 /* It's a character part of the decoded name, so just copy it
1101 decoded
[j
] = encoded
[i
];
1106 decoded
[j
] = '\000';
1108 /* Decoded names should never contain any uppercase character.
1109 Double-check this, and abort the decoding if we find one. */
1111 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1112 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1115 if (strcmp (decoded
, encoded
) == 0)
1121 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1122 decoded
= decoding_buffer
;
1123 if (encoded
[0] == '<')
1124 strcpy (decoded
, encoded
);
1126 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1131 /* Table for keeping permanent unique copies of decoded names. Once
1132 allocated, names in this table are never released. While this is a
1133 storage leak, it should not be significant unless there are massive
1134 changes in the set of decoded names in successive versions of a
1135 symbol table loaded during a single session. */
1136 static struct htab
*decoded_names_store
;
1138 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1139 in the language-specific part of GSYMBOL, if it has not been
1140 previously computed. Tries to save the decoded name in the same
1141 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1142 in any case, the decoded symbol has a lifetime at least that of
1144 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1145 const, but nevertheless modified to a semantically equivalent form
1146 when a decoded name is cached in it.
1150 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1153 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1154 if (*resultp
== NULL
)
1156 const char *decoded
= ada_decode (gsymbol
->name
);
1157 if (gsymbol
->obj_section
!= NULL
)
1159 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1160 *resultp
= obsavestring (decoded
, strlen (decoded
),
1161 &objf
->objfile_obstack
);
1163 /* Sometimes, we can't find a corresponding objfile, in which
1164 case, we put the result on the heap. Since we only decode
1165 when needed, we hope this usually does not cause a
1166 significant memory leak (FIXME). */
1167 if (*resultp
== NULL
)
1169 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1172 *slot
= xstrdup (decoded
);
1181 ada_la_decode (const char *encoded
, int options
)
1183 return xstrdup (ada_decode (encoded
));
1186 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1187 suffixes that encode debugging information or leading _ada_ on
1188 SYM_NAME (see is_name_suffix commentary for the debugging
1189 information that is ignored). If WILD, then NAME need only match a
1190 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1191 either argument is NULL. */
1194 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1196 if (sym_name
== NULL
|| name
== NULL
)
1199 return wild_match (name
, strlen (name
), sym_name
);
1202 int len_name
= strlen (name
);
1203 return (strncmp (sym_name
, name
, len_name
) == 0
1204 && is_name_suffix (sym_name
+ len_name
))
1205 || (strncmp (sym_name
, "_ada_", 5) == 0
1206 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1207 && is_name_suffix (sym_name
+ len_name
+ 5));
1214 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1216 static char *bound_name
[] = {
1217 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1218 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1221 /* Maximum number of array dimensions we are prepared to handle. */
1223 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1225 /* Like modify_field, but allows bitpos > wordlength. */
1228 modify_general_field (struct type
*type
, char *addr
,
1229 LONGEST fieldval
, int bitpos
, int bitsize
)
1231 modify_field (type
, addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1235 /* The desc_* routines return primitive portions of array descriptors
1238 /* The descriptor or array type, if any, indicated by TYPE; removes
1239 level of indirection, if needed. */
1241 static struct type
*
1242 desc_base_type (struct type
*type
)
1246 type
= ada_check_typedef (type
);
1248 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1249 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1250 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1255 /* True iff TYPE indicates a "thin" array pointer type. */
1258 is_thin_pntr (struct type
*type
)
1261 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1262 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1265 /* The descriptor type for thin pointer type TYPE. */
1267 static struct type
*
1268 thin_descriptor_type (struct type
*type
)
1270 struct type
*base_type
= desc_base_type (type
);
1271 if (base_type
== NULL
)
1273 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1277 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1278 if (alt_type
== NULL
)
1285 /* A pointer to the array data for thin-pointer value VAL. */
1287 static struct value
*
1288 thin_data_pntr (struct value
*val
)
1290 struct type
*type
= value_type (val
);
1291 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1292 data_type
= lookup_pointer_type (data_type
);
1294 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1295 return value_cast (data_type
, value_copy (val
));
1297 return value_from_longest (data_type
, value_address (val
));
1300 /* True iff TYPE indicates a "thick" array pointer type. */
1303 is_thick_pntr (struct type
*type
)
1305 type
= desc_base_type (type
);
1306 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1307 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1310 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1311 pointer to one, the type of its bounds data; otherwise, NULL. */
1313 static struct type
*
1314 desc_bounds_type (struct type
*type
)
1318 type
= desc_base_type (type
);
1322 else if (is_thin_pntr (type
))
1324 type
= thin_descriptor_type (type
);
1327 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1329 return ada_check_typedef (r
);
1331 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1333 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1335 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1340 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1341 one, a pointer to its bounds data. Otherwise NULL. */
1343 static struct value
*
1344 desc_bounds (struct value
*arr
)
1346 struct type
*type
= ada_check_typedef (value_type (arr
));
1347 if (is_thin_pntr (type
))
1349 struct type
*bounds_type
=
1350 desc_bounds_type (thin_descriptor_type (type
));
1353 if (bounds_type
== NULL
)
1354 error (_("Bad GNAT array descriptor"));
1356 /* NOTE: The following calculation is not really kosher, but
1357 since desc_type is an XVE-encoded type (and shouldn't be),
1358 the correct calculation is a real pain. FIXME (and fix GCC). */
1359 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1360 addr
= value_as_long (arr
);
1362 addr
= value_address (arr
);
1365 value_from_longest (lookup_pointer_type (bounds_type
),
1366 addr
- TYPE_LENGTH (bounds_type
));
1369 else if (is_thick_pntr (type
))
1370 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1371 _("Bad GNAT array descriptor"));
1376 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1377 position of the field containing the address of the bounds data. */
1380 fat_pntr_bounds_bitpos (struct type
*type
)
1382 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1385 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1386 size of the field containing the address of the bounds data. */
1389 fat_pntr_bounds_bitsize (struct type
*type
)
1391 type
= desc_base_type (type
);
1393 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1394 return TYPE_FIELD_BITSIZE (type
, 1);
1396 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1399 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1400 pointer to one, the type of its array data (a array-with-no-bounds type);
1401 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1404 static struct type
*
1405 desc_data_target_type (struct type
*type
)
1407 type
= desc_base_type (type
);
1409 /* NOTE: The following is bogus; see comment in desc_bounds. */
1410 if (is_thin_pntr (type
))
1411 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1412 else if (is_thick_pntr (type
))
1414 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1417 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1418 return TYPE_TARGET_TYPE (data_type
);
1424 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1427 static struct value
*
1428 desc_data (struct value
*arr
)
1430 struct type
*type
= value_type (arr
);
1431 if (is_thin_pntr (type
))
1432 return thin_data_pntr (arr
);
1433 else if (is_thick_pntr (type
))
1434 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1435 _("Bad GNAT array descriptor"));
1441 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1442 position of the field containing the address of the data. */
1445 fat_pntr_data_bitpos (struct type
*type
)
1447 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1450 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1451 size of the field containing the address of the data. */
1454 fat_pntr_data_bitsize (struct type
*type
)
1456 type
= desc_base_type (type
);
1458 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1459 return TYPE_FIELD_BITSIZE (type
, 0);
1461 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1464 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1465 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1466 bound, if WHICH is 1. The first bound is I=1. */
1468 static struct value
*
1469 desc_one_bound (struct value
*bounds
, int i
, int which
)
1471 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1472 _("Bad GNAT array descriptor bounds"));
1475 /* If BOUNDS is an array-bounds structure type, return the bit position
1476 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1477 bound, if WHICH is 1. The first bound is I=1. */
1480 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1482 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1485 /* If BOUNDS is an array-bounds structure type, return the bit field size
1486 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1487 bound, if WHICH is 1. The first bound is I=1. */
1490 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1492 type
= desc_base_type (type
);
1494 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1495 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1497 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1500 /* If TYPE is the type of an array-bounds structure, the type of its
1501 Ith bound (numbering from 1). Otherwise, NULL. */
1503 static struct type
*
1504 desc_index_type (struct type
*type
, int i
)
1506 type
= desc_base_type (type
);
1508 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1509 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1514 /* The number of index positions in the array-bounds type TYPE.
1515 Return 0 if TYPE is NULL. */
1518 desc_arity (struct type
*type
)
1520 type
= desc_base_type (type
);
1523 return TYPE_NFIELDS (type
) / 2;
1527 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1528 an array descriptor type (representing an unconstrained array
1532 ada_is_direct_array_type (struct type
*type
)
1536 type
= ada_check_typedef (type
);
1537 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1538 || ada_is_array_descriptor_type (type
));
1541 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1545 ada_is_array_type (struct type
*type
)
1548 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1549 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1550 type
= TYPE_TARGET_TYPE (type
);
1551 return ada_is_direct_array_type (type
);
1554 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1557 ada_is_simple_array_type (struct type
*type
)
1561 type
= ada_check_typedef (type
);
1562 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1563 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1564 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1567 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1570 ada_is_array_descriptor_type (struct type
*type
)
1572 struct type
*data_type
= desc_data_target_type (type
);
1576 type
= ada_check_typedef (type
);
1577 return (data_type
!= NULL
1578 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1579 && desc_arity (desc_bounds_type (type
)) > 0);
1582 /* Non-zero iff type is a partially mal-formed GNAT array
1583 descriptor. FIXME: This is to compensate for some problems with
1584 debugging output from GNAT. Re-examine periodically to see if it
1588 ada_is_bogus_array_descriptor (struct type
*type
)
1592 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1593 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1594 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1595 && !ada_is_array_descriptor_type (type
);
1599 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1600 (fat pointer) returns the type of the array data described---specifically,
1601 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1602 in from the descriptor; otherwise, they are left unspecified. If
1603 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1604 returns NULL. The result is simply the type of ARR if ARR is not
1607 ada_type_of_array (struct value
*arr
, int bounds
)
1609 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1610 return decode_constrained_packed_array_type (value_type (arr
));
1612 if (!ada_is_array_descriptor_type (value_type (arr
)))
1613 return value_type (arr
);
1617 struct type
*array_type
=
1618 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1620 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1621 TYPE_FIELD_BITSIZE (array_type
, 0) =
1622 decode_packed_array_bitsize (value_type (arr
));
1628 struct type
*elt_type
;
1630 struct value
*descriptor
;
1632 elt_type
= ada_array_element_type (value_type (arr
), -1);
1633 arity
= ada_array_arity (value_type (arr
));
1635 if (elt_type
== NULL
|| arity
== 0)
1636 return ada_check_typedef (value_type (arr
));
1638 descriptor
= desc_bounds (arr
);
1639 if (value_as_long (descriptor
) == 0)
1643 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1644 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1645 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1646 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1649 create_range_type (range_type
, value_type (low
),
1650 longest_to_int (value_as_long (low
)),
1651 longest_to_int (value_as_long (high
)));
1652 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1654 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1655 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1656 decode_packed_array_bitsize (value_type (arr
));
1659 return lookup_pointer_type (elt_type
);
1663 /* If ARR does not represent an array, returns ARR unchanged.
1664 Otherwise, returns either a standard GDB array with bounds set
1665 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1666 GDB array. Returns NULL if ARR is a null fat pointer. */
1669 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1671 if (ada_is_array_descriptor_type (value_type (arr
)))
1673 struct type
*arrType
= ada_type_of_array (arr
, 1);
1674 if (arrType
== NULL
)
1676 return value_cast (arrType
, value_copy (desc_data (arr
)));
1678 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1679 return decode_constrained_packed_array (arr
);
1684 /* If ARR does not represent an array, returns ARR unchanged.
1685 Otherwise, returns a standard GDB array describing ARR (which may
1686 be ARR itself if it already is in the proper form). */
1688 static struct value
*
1689 ada_coerce_to_simple_array (struct value
*arr
)
1691 if (ada_is_array_descriptor_type (value_type (arr
)))
1693 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1695 error (_("Bounds unavailable for null array pointer."));
1696 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1697 return value_ind (arrVal
);
1699 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1700 return decode_constrained_packed_array (arr
);
1705 /* If TYPE represents a GNAT array type, return it translated to an
1706 ordinary GDB array type (possibly with BITSIZE fields indicating
1707 packing). For other types, is the identity. */
1710 ada_coerce_to_simple_array_type (struct type
*type
)
1712 if (ada_is_constrained_packed_array_type (type
))
1713 return decode_constrained_packed_array_type (type
);
1715 if (ada_is_array_descriptor_type (type
))
1716 return ada_check_typedef (desc_data_target_type (type
));
1721 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1724 ada_is_packed_array_type (struct type
*type
)
1728 type
= desc_base_type (type
);
1729 type
= ada_check_typedef (type
);
1731 ada_type_name (type
) != NULL
1732 && strstr (ada_type_name (type
), "___XP") != NULL
;
1735 /* Non-zero iff TYPE represents a standard GNAT constrained
1736 packed-array type. */
1739 ada_is_constrained_packed_array_type (struct type
*type
)
1741 return ada_is_packed_array_type (type
)
1742 && !ada_is_array_descriptor_type (type
);
1745 /* Non-zero iff TYPE represents an array descriptor for a
1746 unconstrained packed-array type. */
1749 ada_is_unconstrained_packed_array_type (struct type
*type
)
1751 return ada_is_packed_array_type (type
)
1752 && ada_is_array_descriptor_type (type
);
1755 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1756 return the size of its elements in bits. */
1759 decode_packed_array_bitsize (struct type
*type
)
1761 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1766 raw_name
= ada_type_name (desc_base_type (type
));
1771 tail
= strstr (raw_name
, "___XP");
1773 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1776 (_("could not understand bit size information on packed array"));
1783 /* Given that TYPE is a standard GDB array type with all bounds filled
1784 in, and that the element size of its ultimate scalar constituents
1785 (that is, either its elements, or, if it is an array of arrays, its
1786 elements' elements, etc.) is *ELT_BITS, return an identical type,
1787 but with the bit sizes of its elements (and those of any
1788 constituent arrays) recorded in the BITSIZE components of its
1789 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1792 static struct type
*
1793 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
1795 struct type
*new_elt_type
;
1796 struct type
*new_type
;
1797 LONGEST low_bound
, high_bound
;
1799 type
= ada_check_typedef (type
);
1800 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1803 new_type
= alloc_type_copy (type
);
1805 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1807 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
1808 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1809 TYPE_NAME (new_type
) = ada_type_name (type
);
1811 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
1812 &low_bound
, &high_bound
) < 0)
1813 low_bound
= high_bound
= 0;
1814 if (high_bound
< low_bound
)
1815 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1818 *elt_bits
*= (high_bound
- low_bound
+ 1);
1819 TYPE_LENGTH (new_type
) =
1820 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1823 TYPE_FIXED_INSTANCE (new_type
) = 1;
1827 /* The array type encoded by TYPE, where
1828 ada_is_constrained_packed_array_type (TYPE). */
1830 static struct type
*
1831 decode_constrained_packed_array_type (struct type
*type
)
1834 struct block
**blocks
;
1835 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1838 struct type
*shadow_type
;
1843 raw_name
= ada_type_name (desc_base_type (type
));
1848 name
= (char *) alloca (strlen (raw_name
) + 1);
1849 tail
= strstr (raw_name
, "___XP");
1850 type
= desc_base_type (type
);
1852 memcpy (name
, raw_name
, tail
- raw_name
);
1853 name
[tail
- raw_name
] = '\000';
1855 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
1857 if (shadow_type
== NULL
)
1859 lim_warning (_("could not find bounds information on packed array"));
1862 CHECK_TYPEDEF (shadow_type
);
1864 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1866 lim_warning (_("could not understand bounds information on packed array"));
1870 bits
= decode_packed_array_bitsize (type
);
1871 return constrained_packed_array_type (shadow_type
, &bits
);
1874 /* Given that ARR is a struct value *indicating a GNAT constrained packed
1875 array, returns a simple array that denotes that array. Its type is a
1876 standard GDB array type except that the BITSIZEs of the array
1877 target types are set to the number of bits in each element, and the
1878 type length is set appropriately. */
1880 static struct value
*
1881 decode_constrained_packed_array (struct value
*arr
)
1885 arr
= ada_coerce_ref (arr
);
1887 /* If our value is a pointer, then dererence it. Make sure that
1888 this operation does not cause the target type to be fixed, as
1889 this would indirectly cause this array to be decoded. The rest
1890 of the routine assumes that the array hasn't been decoded yet,
1891 so we use the basic "value_ind" routine to perform the dereferencing,
1892 as opposed to using "ada_value_ind". */
1893 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1894 arr
= value_ind (arr
);
1896 type
= decode_constrained_packed_array_type (value_type (arr
));
1899 error (_("can't unpack array"));
1903 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
1904 && ada_is_modular_type (value_type (arr
)))
1906 /* This is a (right-justified) modular type representing a packed
1907 array with no wrapper. In order to interpret the value through
1908 the (left-justified) packed array type we just built, we must
1909 first left-justify it. */
1910 int bit_size
, bit_pos
;
1913 mod
= ada_modulus (value_type (arr
)) - 1;
1920 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1921 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1922 bit_pos
/ HOST_CHAR_BIT
,
1923 bit_pos
% HOST_CHAR_BIT
,
1928 return coerce_unspec_val_to_type (arr
, type
);
1932 /* The value of the element of packed array ARR at the ARITY indices
1933 given in IND. ARR must be a simple array. */
1935 static struct value
*
1936 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1939 int bits
, elt_off
, bit_off
;
1940 long elt_total_bit_offset
;
1941 struct type
*elt_type
;
1945 elt_total_bit_offset
= 0;
1946 elt_type
= ada_check_typedef (value_type (arr
));
1947 for (i
= 0; i
< arity
; i
+= 1)
1949 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1950 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1952 (_("attempt to do packed indexing of something other than a packed array"));
1955 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1956 LONGEST lowerbound
, upperbound
;
1959 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1961 lim_warning (_("don't know bounds of array"));
1962 lowerbound
= upperbound
= 0;
1965 idx
= pos_atr (ind
[i
]);
1966 if (idx
< lowerbound
|| idx
> upperbound
)
1967 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1968 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1969 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1970 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1973 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1974 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1976 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1981 /* Non-zero iff TYPE includes negative integer values. */
1984 has_negatives (struct type
*type
)
1986 switch (TYPE_CODE (type
))
1991 return !TYPE_UNSIGNED (type
);
1992 case TYPE_CODE_RANGE
:
1993 return TYPE_LOW_BOUND (type
) < 0;
1998 /* Create a new value of type TYPE from the contents of OBJ starting
1999 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2000 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2001 assigning through the result will set the field fetched from.
2002 VALADDR is ignored unless OBJ is NULL, in which case,
2003 VALADDR+OFFSET must address the start of storage containing the
2004 packed value. The value returned in this case is never an lval.
2005 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2008 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2009 long offset
, int bit_offset
, int bit_size
,
2013 int src
, /* Index into the source area */
2014 targ
, /* Index into the target area */
2015 srcBitsLeft
, /* Number of source bits left to move */
2016 nsrc
, ntarg
, /* Number of source and target bytes */
2017 unusedLS
, /* Number of bits in next significant
2018 byte of source that are unused */
2019 accumSize
; /* Number of meaningful bits in accum */
2020 unsigned char *bytes
; /* First byte containing data to unpack */
2021 unsigned char *unpacked
;
2022 unsigned long accum
; /* Staging area for bits being transferred */
2024 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2025 /* Transmit bytes from least to most significant; delta is the direction
2026 the indices move. */
2027 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2029 type
= ada_check_typedef (type
);
2033 v
= allocate_value (type
);
2034 bytes
= (unsigned char *) (valaddr
+ offset
);
2036 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2039 value_address (obj
) + offset
);
2040 bytes
= (unsigned char *) alloca (len
);
2041 read_memory (value_address (v
), bytes
, len
);
2045 v
= allocate_value (type
);
2046 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2052 set_value_component_location (v
, obj
);
2053 new_addr
= value_address (obj
) + offset
;
2054 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2055 set_value_bitsize (v
, bit_size
);
2056 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2059 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2061 set_value_address (v
, new_addr
);
2064 set_value_bitsize (v
, bit_size
);
2065 unpacked
= (unsigned char *) value_contents (v
);
2067 srcBitsLeft
= bit_size
;
2069 ntarg
= TYPE_LENGTH (type
);
2073 memset (unpacked
, 0, TYPE_LENGTH (type
));
2076 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2079 if (has_negatives (type
)
2080 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2084 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2087 switch (TYPE_CODE (type
))
2089 case TYPE_CODE_ARRAY
:
2090 case TYPE_CODE_UNION
:
2091 case TYPE_CODE_STRUCT
:
2092 /* Non-scalar values must be aligned at a byte boundary... */
2094 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2095 /* ... And are placed at the beginning (most-significant) bytes
2097 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2102 targ
= TYPE_LENGTH (type
) - 1;
2108 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2111 unusedLS
= bit_offset
;
2114 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2121 /* Mask for removing bits of the next source byte that are not
2122 part of the value. */
2123 unsigned int unusedMSMask
=
2124 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2126 /* Sign-extend bits for this byte. */
2127 unsigned int signMask
= sign
& ~unusedMSMask
;
2129 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2130 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2131 if (accumSize
>= HOST_CHAR_BIT
)
2133 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2134 accumSize
-= HOST_CHAR_BIT
;
2135 accum
>>= HOST_CHAR_BIT
;
2139 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2146 accum
|= sign
<< accumSize
;
2147 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2148 accumSize
-= HOST_CHAR_BIT
;
2149 accum
>>= HOST_CHAR_BIT
;
2157 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2158 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2161 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2162 int src_offset
, int n
, int bits_big_endian_p
)
2164 unsigned int accum
, mask
;
2165 int accum_bits
, chunk_size
;
2167 target
+= targ_offset
/ HOST_CHAR_BIT
;
2168 targ_offset
%= HOST_CHAR_BIT
;
2169 source
+= src_offset
/ HOST_CHAR_BIT
;
2170 src_offset
%= HOST_CHAR_BIT
;
2171 if (bits_big_endian_p
)
2173 accum
= (unsigned char) *source
;
2175 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2180 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2181 accum_bits
+= HOST_CHAR_BIT
;
2183 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2186 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2187 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2190 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2192 accum_bits
-= chunk_size
;
2199 accum
= (unsigned char) *source
>> src_offset
;
2201 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2205 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2206 accum_bits
+= HOST_CHAR_BIT
;
2208 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2211 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2212 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2214 accum_bits
-= chunk_size
;
2215 accum
>>= chunk_size
;
2222 /* Store the contents of FROMVAL into the location of TOVAL.
2223 Return a new value with the location of TOVAL and contents of
2224 FROMVAL. Handles assignment into packed fields that have
2225 floating-point or non-scalar types. */
2227 static struct value
*
2228 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2230 struct type
*type
= value_type (toval
);
2231 int bits
= value_bitsize (toval
);
2233 toval
= ada_coerce_ref (toval
);
2234 fromval
= ada_coerce_ref (fromval
);
2236 if (ada_is_direct_array_type (value_type (toval
)))
2237 toval
= ada_coerce_to_simple_array (toval
);
2238 if (ada_is_direct_array_type (value_type (fromval
)))
2239 fromval
= ada_coerce_to_simple_array (fromval
);
2241 if (!deprecated_value_modifiable (toval
))
2242 error (_("Left operand of assignment is not a modifiable lvalue."));
2244 if (VALUE_LVAL (toval
) == lval_memory
2246 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2247 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2249 int len
= (value_bitpos (toval
)
2250 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2252 char *buffer
= (char *) alloca (len
);
2254 CORE_ADDR to_addr
= value_address (toval
);
2256 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2257 fromval
= value_cast (type
, fromval
);
2259 read_memory (to_addr
, buffer
, len
);
2260 from_size
= value_bitsize (fromval
);
2262 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2263 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2264 move_bits (buffer
, value_bitpos (toval
),
2265 value_contents (fromval
), from_size
- bits
, bits
, 1);
2267 move_bits (buffer
, value_bitpos (toval
),
2268 value_contents (fromval
), 0, bits
, 0);
2269 write_memory (to_addr
, buffer
, len
);
2270 observer_notify_memory_changed (to_addr
, len
, buffer
);
2272 val
= value_copy (toval
);
2273 memcpy (value_contents_raw (val
), value_contents (fromval
),
2274 TYPE_LENGTH (type
));
2275 deprecated_set_value_type (val
, type
);
2280 return value_assign (toval
, fromval
);
2284 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2285 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2286 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2287 * COMPONENT, and not the inferior's memory. The current contents
2288 * of COMPONENT are ignored. */
2290 value_assign_to_component (struct value
*container
, struct value
*component
,
2293 LONGEST offset_in_container
=
2294 (LONGEST
) (value_address (component
) - value_address (container
));
2295 int bit_offset_in_container
=
2296 value_bitpos (component
) - value_bitpos (container
);
2299 val
= value_cast (value_type (component
), val
);
2301 if (value_bitsize (component
) == 0)
2302 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2304 bits
= value_bitsize (component
);
2306 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2307 move_bits (value_contents_writeable (container
) + offset_in_container
,
2308 value_bitpos (container
) + bit_offset_in_container
,
2309 value_contents (val
),
2310 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2313 move_bits (value_contents_writeable (container
) + offset_in_container
,
2314 value_bitpos (container
) + bit_offset_in_container
,
2315 value_contents (val
), 0, bits
, 0);
2318 /* The value of the element of array ARR at the ARITY indices given in IND.
2319 ARR may be either a simple array, GNAT array descriptor, or pointer
2323 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2327 struct type
*elt_type
;
2329 elt
= ada_coerce_to_simple_array (arr
);
2331 elt_type
= ada_check_typedef (value_type (elt
));
2332 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2333 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2334 return value_subscript_packed (elt
, arity
, ind
);
2336 for (k
= 0; k
< arity
; k
+= 1)
2338 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2339 error (_("too many subscripts (%d expected)"), k
);
2340 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2345 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2346 value of the element of *ARR at the ARITY indices given in
2347 IND. Does not read the entire array into memory. */
2349 static struct value
*
2350 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2355 for (k
= 0; k
< arity
; k
+= 1)
2359 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2360 error (_("too many subscripts (%d expected)"), k
);
2361 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2363 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2364 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2365 type
= TYPE_TARGET_TYPE (type
);
2368 return value_ind (arr
);
2371 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2372 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2373 elements starting at index LOW. The lower bound of this array is LOW, as
2375 static struct value
*
2376 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2379 CORE_ADDR base
= value_as_address (array_ptr
)
2380 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type
)))
2381 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2382 struct type
*index_type
=
2383 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2385 struct type
*slice_type
=
2386 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2387 return value_at_lazy (slice_type
, base
);
2391 static struct value
*
2392 ada_value_slice (struct value
*array
, int low
, int high
)
2394 struct type
*type
= value_type (array
);
2395 struct type
*index_type
=
2396 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2397 struct type
*slice_type
=
2398 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2399 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2402 /* If type is a record type in the form of a standard GNAT array
2403 descriptor, returns the number of dimensions for type. If arr is a
2404 simple array, returns the number of "array of"s that prefix its
2405 type designation. Otherwise, returns 0. */
2408 ada_array_arity (struct type
*type
)
2415 type
= desc_base_type (type
);
2418 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2419 return desc_arity (desc_bounds_type (type
));
2421 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2424 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2430 /* If TYPE is a record type in the form of a standard GNAT array
2431 descriptor or a simple array type, returns the element type for
2432 TYPE after indexing by NINDICES indices, or by all indices if
2433 NINDICES is -1. Otherwise, returns NULL. */
2436 ada_array_element_type (struct type
*type
, int nindices
)
2438 type
= desc_base_type (type
);
2440 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2443 struct type
*p_array_type
;
2445 p_array_type
= desc_data_target_type (type
);
2447 k
= ada_array_arity (type
);
2451 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2452 if (nindices
>= 0 && k
> nindices
)
2454 while (k
> 0 && p_array_type
!= NULL
)
2456 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2459 return p_array_type
;
2461 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2463 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2465 type
= TYPE_TARGET_TYPE (type
);
2474 /* The type of nth index in arrays of given type (n numbering from 1).
2475 Does not examine memory. Throws an error if N is invalid or TYPE
2476 is not an array type. NAME is the name of the Ada attribute being
2477 evaluated ('range, 'first, 'last, or 'length); it is used in building
2478 the error message. */
2480 static struct type
*
2481 ada_index_type (struct type
*type
, int n
, const char *name
)
2483 struct type
*result_type
;
2485 type
= desc_base_type (type
);
2487 if (n
< 0 || n
> ada_array_arity (type
))
2488 error (_("invalid dimension number to '%s"), name
);
2490 if (ada_is_simple_array_type (type
))
2494 for (i
= 1; i
< n
; i
+= 1)
2495 type
= TYPE_TARGET_TYPE (type
);
2496 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2497 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2498 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2499 perhaps stabsread.c would make more sense. */
2500 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2505 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2506 if (result_type
== NULL
)
2507 error (_("attempt to take bound of something that is not an array"));
2513 /* Given that arr is an array type, returns the lower bound of the
2514 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2515 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2516 array-descriptor type. It works for other arrays with bounds supplied
2517 by run-time quantities other than discriminants. */
2520 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
)
2522 struct type
*type
, *elt_type
, *index_type_desc
, *index_type
;
2525 gdb_assert (which
== 0 || which
== 1);
2527 if (ada_is_constrained_packed_array_type (arr_type
))
2528 arr_type
= decode_constrained_packed_array_type (arr_type
);
2530 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2531 return (LONGEST
) - which
;
2533 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2534 type
= TYPE_TARGET_TYPE (arr_type
);
2539 for (i
= n
; i
> 1; i
--)
2540 elt_type
= TYPE_TARGET_TYPE (type
);
2542 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2543 if (index_type_desc
!= NULL
)
2544 index_type
= to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2545 NULL
, TYPE_INDEX_TYPE (elt_type
));
2547 index_type
= TYPE_INDEX_TYPE (elt_type
);
2550 (LONGEST
) (which
== 0
2551 ? ada_discrete_type_low_bound (index_type
)
2552 : ada_discrete_type_high_bound (index_type
));
2555 /* Given that arr is an array value, returns the lower bound of the
2556 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2557 WHICH is 1. This routine will also work for arrays with bounds
2558 supplied by run-time quantities other than discriminants. */
2561 ada_array_bound (struct value
*arr
, int n
, int which
)
2563 struct type
*arr_type
= value_type (arr
);
2565 if (ada_is_constrained_packed_array_type (arr_type
))
2566 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2567 else if (ada_is_simple_array_type (arr_type
))
2568 return ada_array_bound_from_type (arr_type
, n
, which
);
2570 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2573 /* Given that arr is an array value, returns the length of the
2574 nth index. This routine will also work for arrays with bounds
2575 supplied by run-time quantities other than discriminants.
2576 Does not work for arrays indexed by enumeration types with representation
2577 clauses at the moment. */
2580 ada_array_length (struct value
*arr
, int n
)
2582 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2584 if (ada_is_constrained_packed_array_type (arr_type
))
2585 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2587 if (ada_is_simple_array_type (arr_type
))
2588 return (ada_array_bound_from_type (arr_type
, n
, 1)
2589 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2591 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2592 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2595 /* An empty array whose type is that of ARR_TYPE (an array type),
2596 with bounds LOW to LOW-1. */
2598 static struct value
*
2599 empty_array (struct type
*arr_type
, int low
)
2601 struct type
*index_type
=
2602 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2604 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2605 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2609 /* Name resolution */
2611 /* The "decoded" name for the user-definable Ada operator corresponding
2615 ada_decoded_op_name (enum exp_opcode op
)
2619 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2621 if (ada_opname_table
[i
].op
== op
)
2622 return ada_opname_table
[i
].decoded
;
2624 error (_("Could not find operator name for opcode"));
2628 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2629 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2630 undefined namespace) and converts operators that are
2631 user-defined into appropriate function calls. If CONTEXT_TYPE is
2632 non-null, it provides a preferred result type [at the moment, only
2633 type void has any effect---causing procedures to be preferred over
2634 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2635 return type is preferred. May change (expand) *EXP. */
2638 resolve (struct expression
**expp
, int void_context_p
)
2640 struct type
*context_type
= NULL
;
2644 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
2646 resolve_subexp (expp
, &pc
, 1, context_type
);
2649 /* Resolve the operator of the subexpression beginning at
2650 position *POS of *EXPP. "Resolving" consists of replacing
2651 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2652 with their resolutions, replacing built-in operators with
2653 function calls to user-defined operators, where appropriate, and,
2654 when DEPROCEDURE_P is non-zero, converting function-valued variables
2655 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2656 are as in ada_resolve, above. */
2658 static struct value
*
2659 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2660 struct type
*context_type
)
2664 struct expression
*exp
; /* Convenience: == *expp. */
2665 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2666 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2667 int nargs
; /* Number of operands. */
2674 /* Pass one: resolve operands, saving their types and updating *pos,
2679 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2680 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2685 resolve_subexp (expp
, pos
, 0, NULL
);
2687 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2692 resolve_subexp (expp
, pos
, 0, NULL
);
2697 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2700 case OP_ATR_MODULUS
:
2710 case TERNOP_IN_RANGE
:
2711 case BINOP_IN_BOUNDS
:
2717 case OP_DISCRETE_RANGE
:
2719 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2728 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2730 resolve_subexp (expp
, pos
, 1, NULL
);
2732 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2749 case BINOP_LOGICAL_AND
:
2750 case BINOP_LOGICAL_OR
:
2751 case BINOP_BITWISE_AND
:
2752 case BINOP_BITWISE_IOR
:
2753 case BINOP_BITWISE_XOR
:
2756 case BINOP_NOTEQUAL
:
2763 case BINOP_SUBSCRIPT
:
2771 case UNOP_LOGICAL_NOT
:
2787 case OP_INTERNALVAR
:
2797 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2800 case STRUCTOP_STRUCT
:
2801 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2814 error (_("Unexpected operator during name resolution"));
2817 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2818 for (i
= 0; i
< nargs
; i
+= 1)
2819 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2823 /* Pass two: perform any resolution on principal operator. */
2830 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2832 struct ada_symbol_info
*candidates
;
2836 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2837 (exp
->elts
[pc
+ 2].symbol
),
2838 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2841 if (n_candidates
> 1)
2843 /* Types tend to get re-introduced locally, so if there
2844 are any local symbols that are not types, first filter
2847 for (j
= 0; j
< n_candidates
; j
+= 1)
2848 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2853 case LOC_REGPARM_ADDR
:
2861 if (j
< n_candidates
)
2864 while (j
< n_candidates
)
2866 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2868 candidates
[j
] = candidates
[n_candidates
- 1];
2877 if (n_candidates
== 0)
2878 error (_("No definition found for %s"),
2879 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2880 else if (n_candidates
== 1)
2882 else if (deprocedure_p
2883 && !is_nonfunction (candidates
, n_candidates
))
2885 i
= ada_resolve_function
2886 (candidates
, n_candidates
, NULL
, 0,
2887 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2890 error (_("Could not find a match for %s"),
2891 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2895 printf_filtered (_("Multiple matches for %s\n"),
2896 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2897 user_select_syms (candidates
, n_candidates
, 1);
2901 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2902 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2903 if (innermost_block
== NULL
2904 || contained_in (candidates
[i
].block
, innermost_block
))
2905 innermost_block
= candidates
[i
].block
;
2909 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2912 replace_operator_with_call (expp
, pc
, 0, 0,
2913 exp
->elts
[pc
+ 2].symbol
,
2914 exp
->elts
[pc
+ 1].block
);
2921 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2922 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2924 struct ada_symbol_info
*candidates
;
2928 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2929 (exp
->elts
[pc
+ 5].symbol
),
2930 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2932 if (n_candidates
== 1)
2936 i
= ada_resolve_function
2937 (candidates
, n_candidates
,
2939 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2942 error (_("Could not find a match for %s"),
2943 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2946 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2947 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2948 if (innermost_block
== NULL
2949 || contained_in (candidates
[i
].block
, innermost_block
))
2950 innermost_block
= candidates
[i
].block
;
2961 case BINOP_BITWISE_AND
:
2962 case BINOP_BITWISE_IOR
:
2963 case BINOP_BITWISE_XOR
:
2965 case BINOP_NOTEQUAL
:
2973 case UNOP_LOGICAL_NOT
:
2975 if (possible_user_operator_p (op
, argvec
))
2977 struct ada_symbol_info
*candidates
;
2981 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2982 (struct block
*) NULL
, VAR_DOMAIN
,
2984 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2985 ada_decoded_op_name (op
), NULL
);
2989 replace_operator_with_call (expp
, pc
, nargs
, 1,
2990 candidates
[i
].sym
, candidates
[i
].block
);
3001 return evaluate_subexp_type (exp
, pos
);
3004 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3005 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3007 /* The term "match" here is rather loose. The match is heuristic and
3011 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3013 ftype
= ada_check_typedef (ftype
);
3014 atype
= ada_check_typedef (atype
);
3016 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3017 ftype
= TYPE_TARGET_TYPE (ftype
);
3018 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3019 atype
= TYPE_TARGET_TYPE (atype
);
3021 switch (TYPE_CODE (ftype
))
3024 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3026 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3027 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3028 TYPE_TARGET_TYPE (atype
), 0);
3031 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3033 case TYPE_CODE_ENUM
:
3034 case TYPE_CODE_RANGE
:
3035 switch (TYPE_CODE (atype
))
3038 case TYPE_CODE_ENUM
:
3039 case TYPE_CODE_RANGE
:
3045 case TYPE_CODE_ARRAY
:
3046 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3047 || ada_is_array_descriptor_type (atype
));
3049 case TYPE_CODE_STRUCT
:
3050 if (ada_is_array_descriptor_type (ftype
))
3051 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3052 || ada_is_array_descriptor_type (atype
));
3054 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3055 && !ada_is_array_descriptor_type (atype
));
3057 case TYPE_CODE_UNION
:
3059 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3063 /* Return non-zero if the formals of FUNC "sufficiently match" the
3064 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3065 may also be an enumeral, in which case it is treated as a 0-
3066 argument function. */
3069 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3072 struct type
*func_type
= SYMBOL_TYPE (func
);
3074 if (SYMBOL_CLASS (func
) == LOC_CONST
3075 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3076 return (n_actuals
== 0);
3077 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3080 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3083 for (i
= 0; i
< n_actuals
; i
+= 1)
3085 if (actuals
[i
] == NULL
)
3089 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3090 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3092 if (!ada_type_match (ftype
, atype
, 1))
3099 /* False iff function type FUNC_TYPE definitely does not produce a value
3100 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3101 FUNC_TYPE is not a valid function type with a non-null return type
3102 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3105 return_match (struct type
*func_type
, struct type
*context_type
)
3107 struct type
*return_type
;
3109 if (func_type
== NULL
)
3112 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3113 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3115 return_type
= base_type (func_type
);
3116 if (return_type
== NULL
)
3119 context_type
= base_type (context_type
);
3121 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3122 return context_type
== NULL
|| return_type
== context_type
;
3123 else if (context_type
== NULL
)
3124 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3126 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3130 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3131 function (if any) that matches the types of the NARGS arguments in
3132 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3133 that returns that type, then eliminate matches that don't. If
3134 CONTEXT_TYPE is void and there is at least one match that does not
3135 return void, eliminate all matches that do.
3137 Asks the user if there is more than one match remaining. Returns -1
3138 if there is no such symbol or none is selected. NAME is used
3139 solely for messages. May re-arrange and modify SYMS in
3140 the process; the index returned is for the modified vector. */
3143 ada_resolve_function (struct ada_symbol_info syms
[],
3144 int nsyms
, struct value
**args
, int nargs
,
3145 const char *name
, struct type
*context_type
)
3149 int m
; /* Number of hits */
3152 /* In the first pass of the loop, we only accept functions matching
3153 context_type. If none are found, we add a second pass of the loop
3154 where every function is accepted. */
3155 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3157 for (k
= 0; k
< nsyms
; k
+= 1)
3159 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3161 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3162 && (fallback
|| return_match (type
, context_type
)))
3174 printf_filtered (_("Multiple matches for %s\n"), name
);
3175 user_select_syms (syms
, m
, 1);
3181 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3182 in a listing of choices during disambiguation (see sort_choices, below).
3183 The idea is that overloadings of a subprogram name from the
3184 same package should sort in their source order. We settle for ordering
3185 such symbols by their trailing number (__N or $N). */
3188 encoded_ordered_before (char *N0
, char *N1
)
3192 else if (N0
== NULL
)
3197 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3199 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3201 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3202 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3206 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3209 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3211 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3212 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3214 return (strcmp (N0
, N1
) < 0);
3218 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3222 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3225 for (i
= 1; i
< nsyms
; i
+= 1)
3227 struct ada_symbol_info sym
= syms
[i
];
3230 for (j
= i
- 1; j
>= 0; j
-= 1)
3232 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3233 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3235 syms
[j
+ 1] = syms
[j
];
3241 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3242 by asking the user (if necessary), returning the number selected,
3243 and setting the first elements of SYMS items. Error if no symbols
3246 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3247 to be re-integrated one of these days. */
3250 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3253 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3255 int first_choice
= (max_results
== 1) ? 1 : 2;
3256 const char *select_mode
= multiple_symbols_select_mode ();
3258 if (max_results
< 1)
3259 error (_("Request to select 0 symbols!"));
3263 if (select_mode
== multiple_symbols_cancel
)
3265 canceled because the command is ambiguous\n\
3266 See set/show multiple-symbol."));
3268 /* If select_mode is "all", then return all possible symbols.
3269 Only do that if more than one symbol can be selected, of course.
3270 Otherwise, display the menu as usual. */
3271 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3274 printf_unfiltered (_("[0] cancel\n"));
3275 if (max_results
> 1)
3276 printf_unfiltered (_("[1] all\n"));
3278 sort_choices (syms
, nsyms
);
3280 for (i
= 0; i
< nsyms
; i
+= 1)
3282 if (syms
[i
].sym
== NULL
)
3285 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3287 struct symtab_and_line sal
=
3288 find_function_start_sal (syms
[i
].sym
, 1);
3289 if (sal
.symtab
== NULL
)
3290 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3292 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3295 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3296 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3297 sal
.symtab
->filename
, sal
.line
);
3303 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3304 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3305 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3306 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3308 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3309 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3311 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3312 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3313 else if (is_enumeral
3314 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3316 printf_unfiltered (("[%d] "), i
+ first_choice
);
3317 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3319 printf_unfiltered (_("'(%s) (enumeral)\n"),
3320 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3322 else if (symtab
!= NULL
)
3323 printf_unfiltered (is_enumeral
3324 ? _("[%d] %s in %s (enumeral)\n")
3325 : _("[%d] %s at %s:?\n"),
3327 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3330 printf_unfiltered (is_enumeral
3331 ? _("[%d] %s (enumeral)\n")
3332 : _("[%d] %s at ?\n"),
3334 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3338 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3341 for (i
= 0; i
< n_chosen
; i
+= 1)
3342 syms
[i
] = syms
[chosen
[i
]];
3347 /* Read and validate a set of numeric choices from the user in the
3348 range 0 .. N_CHOICES-1. Place the results in increasing
3349 order in CHOICES[0 .. N-1], and return N.
3351 The user types choices as a sequence of numbers on one line
3352 separated by blanks, encoding them as follows:
3354 + A choice of 0 means to cancel the selection, throwing an error.
3355 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3356 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3358 The user is not allowed to choose more than MAX_RESULTS values.
3360 ANNOTATION_SUFFIX, if present, is used to annotate the input
3361 prompts (for use with the -f switch). */
3364 get_selections (int *choices
, int n_choices
, int max_results
,
3365 int is_all_choice
, char *annotation_suffix
)
3370 int first_choice
= is_all_choice
? 2 : 1;
3372 prompt
= getenv ("PS2");
3376 args
= command_line_input (prompt
, 0, annotation_suffix
);
3379 error_no_arg (_("one or more choice numbers"));
3383 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3384 order, as given in args. Choices are validated. */
3390 while (isspace (*args
))
3392 if (*args
== '\0' && n_chosen
== 0)
3393 error_no_arg (_("one or more choice numbers"));
3394 else if (*args
== '\0')
3397 choice
= strtol (args
, &args2
, 10);
3398 if (args
== args2
|| choice
< 0
3399 || choice
> n_choices
+ first_choice
- 1)
3400 error (_("Argument must be choice number"));
3404 error (_("cancelled"));
3406 if (choice
< first_choice
)
3408 n_chosen
= n_choices
;
3409 for (j
= 0; j
< n_choices
; j
+= 1)
3413 choice
-= first_choice
;
3415 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3419 if (j
< 0 || choice
!= choices
[j
])
3422 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3423 choices
[k
+ 1] = choices
[k
];
3424 choices
[j
+ 1] = choice
;
3429 if (n_chosen
> max_results
)
3430 error (_("Select no more than %d of the above"), max_results
);
3435 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3436 on the function identified by SYM and BLOCK, and taking NARGS
3437 arguments. Update *EXPP as needed to hold more space. */
3440 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3441 int oplen
, struct symbol
*sym
,
3442 struct block
*block
)
3444 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3445 symbol, -oplen for operator being replaced). */
3446 struct expression
*newexp
= (struct expression
*)
3447 xmalloc (sizeof (struct expression
)
3448 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3449 struct expression
*exp
= *expp
;
3451 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3452 newexp
->language_defn
= exp
->language_defn
;
3453 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3454 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3455 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3457 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3458 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3460 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3461 newexp
->elts
[pc
+ 4].block
= block
;
3462 newexp
->elts
[pc
+ 5].symbol
= sym
;
3468 /* Type-class predicates */
3470 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3474 numeric_type_p (struct type
*type
)
3480 switch (TYPE_CODE (type
))
3485 case TYPE_CODE_RANGE
:
3486 return (type
== TYPE_TARGET_TYPE (type
)
3487 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3494 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3497 integer_type_p (struct type
*type
)
3503 switch (TYPE_CODE (type
))
3507 case TYPE_CODE_RANGE
:
3508 return (type
== TYPE_TARGET_TYPE (type
)
3509 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3516 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3519 scalar_type_p (struct type
*type
)
3525 switch (TYPE_CODE (type
))
3528 case TYPE_CODE_RANGE
:
3529 case TYPE_CODE_ENUM
:
3538 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3541 discrete_type_p (struct type
*type
)
3547 switch (TYPE_CODE (type
))
3550 case TYPE_CODE_RANGE
:
3551 case TYPE_CODE_ENUM
:
3552 case TYPE_CODE_BOOL
:
3560 /* Returns non-zero if OP with operands in the vector ARGS could be
3561 a user-defined function. Errs on the side of pre-defined operators
3562 (i.e., result 0). */
3565 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3567 struct type
*type0
=
3568 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3569 struct type
*type1
=
3570 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3584 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3588 case BINOP_BITWISE_AND
:
3589 case BINOP_BITWISE_IOR
:
3590 case BINOP_BITWISE_XOR
:
3591 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3594 case BINOP_NOTEQUAL
:
3599 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3602 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3605 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3609 case UNOP_LOGICAL_NOT
:
3611 return (!numeric_type_p (type0
));
3620 1. In the following, we assume that a renaming type's name may
3621 have an ___XD suffix. It would be nice if this went away at some
3623 2. We handle both the (old) purely type-based representation of
3624 renamings and the (new) variable-based encoding. At some point,
3625 it is devoutly to be hoped that the former goes away
3626 (FIXME: hilfinger-2007-07-09).
3627 3. Subprogram renamings are not implemented, although the XRS
3628 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3630 /* If SYM encodes a renaming,
3632 <renaming> renames <renamed entity>,
3634 sets *LEN to the length of the renamed entity's name,
3635 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3636 the string describing the subcomponent selected from the renamed
3637 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3638 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3639 are undefined). Otherwise, returns a value indicating the category
3640 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3641 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3642 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3643 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3644 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3645 may be NULL, in which case they are not assigned.
3647 [Currently, however, GCC does not generate subprogram renamings.] */
3649 enum ada_renaming_category
3650 ada_parse_renaming (struct symbol
*sym
,
3651 const char **renamed_entity
, int *len
,
3652 const char **renaming_expr
)
3654 enum ada_renaming_category kind
;
3659 return ADA_NOT_RENAMING
;
3660 switch (SYMBOL_CLASS (sym
))
3663 return ADA_NOT_RENAMING
;
3665 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3666 renamed_entity
, len
, renaming_expr
);
3670 case LOC_OPTIMIZED_OUT
:
3671 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3673 return ADA_NOT_RENAMING
;
3677 kind
= ADA_OBJECT_RENAMING
;
3681 kind
= ADA_EXCEPTION_RENAMING
;
3685 kind
= ADA_PACKAGE_RENAMING
;
3689 kind
= ADA_SUBPROGRAM_RENAMING
;
3693 return ADA_NOT_RENAMING
;
3697 if (renamed_entity
!= NULL
)
3698 *renamed_entity
= info
;
3699 suffix
= strstr (info
, "___XE");
3700 if (suffix
== NULL
|| suffix
== info
)
3701 return ADA_NOT_RENAMING
;
3703 *len
= strlen (info
) - strlen (suffix
);
3705 if (renaming_expr
!= NULL
)
3706 *renaming_expr
= suffix
;
3710 /* Assuming TYPE encodes a renaming according to the old encoding in
3711 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3712 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3713 ADA_NOT_RENAMING otherwise. */
3714 static enum ada_renaming_category
3715 parse_old_style_renaming (struct type
*type
,
3716 const char **renamed_entity
, int *len
,
3717 const char **renaming_expr
)
3719 enum ada_renaming_category kind
;
3724 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3725 || TYPE_NFIELDS (type
) != 1)
3726 return ADA_NOT_RENAMING
;
3728 name
= type_name_no_tag (type
);
3730 return ADA_NOT_RENAMING
;
3732 name
= strstr (name
, "___XR");
3734 return ADA_NOT_RENAMING
;
3739 kind
= ADA_OBJECT_RENAMING
;
3742 kind
= ADA_EXCEPTION_RENAMING
;
3745 kind
= ADA_PACKAGE_RENAMING
;
3748 kind
= ADA_SUBPROGRAM_RENAMING
;
3751 return ADA_NOT_RENAMING
;
3754 info
= TYPE_FIELD_NAME (type
, 0);
3756 return ADA_NOT_RENAMING
;
3757 if (renamed_entity
!= NULL
)
3758 *renamed_entity
= info
;
3759 suffix
= strstr (info
, "___XE");
3760 if (renaming_expr
!= NULL
)
3761 *renaming_expr
= suffix
+ 5;
3762 if (suffix
== NULL
|| suffix
== info
)
3763 return ADA_NOT_RENAMING
;
3765 *len
= suffix
- info
;
3771 /* Evaluation: Function Calls */
3773 /* Return an lvalue containing the value VAL. This is the identity on
3774 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3775 on the stack, using and updating *SP as the stack pointer, and
3776 returning an lvalue whose value_address points to the copy. */
3778 static struct value
*
3779 ensure_lval (struct value
*val
, struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3781 if (! VALUE_LVAL (val
))
3783 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3785 /* The following is taken from the structure-return code in
3786 call_function_by_hand. FIXME: Therefore, some refactoring seems
3788 if (gdbarch_inner_than (gdbarch
, 1, 2))
3790 /* Stack grows downward. Align SP and value_address (val) after
3791 reserving sufficient space. */
3793 if (gdbarch_frame_align_p (gdbarch
))
3794 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3795 set_value_address (val
, *sp
);
3799 /* Stack grows upward. Align the frame, allocate space, and
3800 then again, re-align the frame. */
3801 if (gdbarch_frame_align_p (gdbarch
))
3802 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3803 set_value_address (val
, *sp
);
3805 if (gdbarch_frame_align_p (gdbarch
))
3806 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3808 VALUE_LVAL (val
) = lval_memory
;
3810 write_memory (value_address (val
), value_contents_raw (val
), len
);
3816 /* Return the value ACTUAL, converted to be an appropriate value for a
3817 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3818 allocating any necessary descriptors (fat pointers), or copies of
3819 values not residing in memory, updating it as needed. */
3822 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3823 struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3825 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3826 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3827 struct type
*formal_target
=
3828 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3829 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3830 struct type
*actual_target
=
3831 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3832 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3834 if (ada_is_array_descriptor_type (formal_target
)
3835 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3836 return make_array_descriptor (formal_type
, actual
, gdbarch
, sp
);
3837 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3838 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3840 struct value
*result
;
3841 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3842 && ada_is_array_descriptor_type (actual_target
))
3843 result
= desc_data (actual
);
3844 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3846 if (VALUE_LVAL (actual
) != lval_memory
)
3849 actual_type
= ada_check_typedef (value_type (actual
));
3850 val
= allocate_value (actual_type
);
3851 memcpy ((char *) value_contents_raw (val
),
3852 (char *) value_contents (actual
),
3853 TYPE_LENGTH (actual_type
));
3854 actual
= ensure_lval (val
, gdbarch
, sp
);
3856 result
= value_addr (actual
);
3860 return value_cast_pointers (formal_type
, result
);
3862 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3863 return ada_value_ind (actual
);
3869 /* Push a descriptor of type TYPE for array value ARR on the stack at
3870 *SP, updating *SP to reflect the new descriptor. Return either
3871 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3872 to-descriptor type rather than a descriptor type), a struct value *
3873 representing a pointer to this descriptor. */
3875 static struct value
*
3876 make_array_descriptor (struct type
*type
, struct value
*arr
,
3877 struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3879 struct type
*bounds_type
= desc_bounds_type (type
);
3880 struct type
*desc_type
= desc_base_type (type
);
3881 struct value
*descriptor
= allocate_value (desc_type
);
3882 struct value
*bounds
= allocate_value (bounds_type
);
3885 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3887 modify_general_field (value_type (bounds
),
3888 value_contents_writeable (bounds
),
3889 ada_array_bound (arr
, i
, 0),
3890 desc_bound_bitpos (bounds_type
, i
, 0),
3891 desc_bound_bitsize (bounds_type
, i
, 0));
3892 modify_general_field (value_type (bounds
),
3893 value_contents_writeable (bounds
),
3894 ada_array_bound (arr
, i
, 1),
3895 desc_bound_bitpos (bounds_type
, i
, 1),
3896 desc_bound_bitsize (bounds_type
, i
, 1));
3899 bounds
= ensure_lval (bounds
, gdbarch
, sp
);
3901 modify_general_field (value_type (descriptor
),
3902 value_contents_writeable (descriptor
),
3903 value_address (ensure_lval (arr
, gdbarch
, sp
)),
3904 fat_pntr_data_bitpos (desc_type
),
3905 fat_pntr_data_bitsize (desc_type
));
3907 modify_general_field (value_type (descriptor
),
3908 value_contents_writeable (descriptor
),
3909 value_address (bounds
),
3910 fat_pntr_bounds_bitpos (desc_type
),
3911 fat_pntr_bounds_bitsize (desc_type
));
3913 descriptor
= ensure_lval (descriptor
, gdbarch
, sp
);
3915 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3916 return value_addr (descriptor
);
3921 /* Dummy definitions for an experimental caching module that is not
3922 * used in the public sources. */
3925 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3926 struct symbol
**sym
, struct block
**block
)
3932 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3933 struct block
*block
)
3939 /* Return the result of a standard (literal, C-like) lookup of NAME in
3940 given DOMAIN, visible from lexical block BLOCK. */
3942 static struct symbol
*
3943 standard_lookup (const char *name
, const struct block
*block
,
3948 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3950 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3951 cache_symbol (name
, domain
, sym
, block_found
);
3956 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3957 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3958 since they contend in overloading in the same way. */
3960 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3964 for (i
= 0; i
< n
; i
+= 1)
3965 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3966 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3967 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3973 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3974 struct types. Otherwise, they may not. */
3977 equiv_types (struct type
*type0
, struct type
*type1
)
3981 if (type0
== NULL
|| type1
== NULL
3982 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3984 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3985 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3986 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3987 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3993 /* True iff SYM0 represents the same entity as SYM1, or one that is
3994 no more defined than that of SYM1. */
3997 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4001 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4002 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4005 switch (SYMBOL_CLASS (sym0
))
4011 struct type
*type0
= SYMBOL_TYPE (sym0
);
4012 struct type
*type1
= SYMBOL_TYPE (sym1
);
4013 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4014 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4015 int len0
= strlen (name0
);
4017 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4018 && (equiv_types (type0
, type1
)
4019 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4020 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4023 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4024 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4030 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4031 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4034 add_defn_to_vec (struct obstack
*obstackp
,
4036 struct block
*block
)
4040 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4042 /* Do not try to complete stub types, as the debugger is probably
4043 already scanning all symbols matching a certain name at the
4044 time when this function is called. Trying to replace the stub
4045 type by its associated full type will cause us to restart a scan
4046 which may lead to an infinite recursion. Instead, the client
4047 collecting the matching symbols will end up collecting several
4048 matches, with at least one of them complete. It can then filter
4049 out the stub ones if needed. */
4051 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4053 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4055 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4057 prevDefns
[i
].sym
= sym
;
4058 prevDefns
[i
].block
= block
;
4064 struct ada_symbol_info info
;
4068 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4072 /* Number of ada_symbol_info structures currently collected in
4073 current vector in *OBSTACKP. */
4076 num_defns_collected (struct obstack
*obstackp
)
4078 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4081 /* Vector of ada_symbol_info structures currently collected in current
4082 vector in *OBSTACKP. If FINISH, close off the vector and return
4083 its final address. */
4085 static struct ada_symbol_info
*
4086 defns_collected (struct obstack
*obstackp
, int finish
)
4089 return obstack_finish (obstackp
);
4091 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4094 /* Return a minimal symbol matching NAME according to Ada decoding
4095 rules. Returns NULL if there is no such minimal symbol. Names
4096 prefixed with "standard__" are handled specially: "standard__" is
4097 first stripped off, and only static and global symbols are searched. */
4099 struct minimal_symbol
*
4100 ada_lookup_simple_minsym (const char *name
)
4102 struct objfile
*objfile
;
4103 struct minimal_symbol
*msymbol
;
4106 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4108 name
+= sizeof ("standard__") - 1;
4112 wild_match
= (strstr (name
, "__") == NULL
);
4114 ALL_MSYMBOLS (objfile
, msymbol
)
4116 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4117 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4124 /* For all subprograms that statically enclose the subprogram of the
4125 selected frame, add symbols matching identifier NAME in DOMAIN
4126 and their blocks to the list of data in OBSTACKP, as for
4127 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4131 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4132 const char *name
, domain_enum
namespace,
4137 /* True if TYPE is definitely an artificial type supplied to a symbol
4138 for which no debugging information was given in the symbol file. */
4141 is_nondebugging_type (struct type
*type
)
4143 char *name
= ada_type_name (type
);
4144 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4147 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4148 duplicate other symbols in the list (The only case I know of where
4149 this happens is when object files containing stabs-in-ecoff are
4150 linked with files containing ordinary ecoff debugging symbols (or no
4151 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4152 Returns the number of items in the modified list. */
4155 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4164 /* If two symbols have the same name and one of them is a stub type,
4165 the get rid of the stub. */
4167 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4168 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4170 for (j
= 0; j
< nsyms
; j
++)
4173 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4174 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4175 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4176 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4181 /* Two symbols with the same name, same class and same address
4182 should be identical. */
4184 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4185 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4186 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4188 for (j
= 0; j
< nsyms
; j
+= 1)
4191 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4192 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4193 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4194 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4195 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4196 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4203 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4204 syms
[j
- 1] = syms
[j
];
4213 /* Given a type that corresponds to a renaming entity, use the type name
4214 to extract the scope (package name or function name, fully qualified,
4215 and following the GNAT encoding convention) where this renaming has been
4216 defined. The string returned needs to be deallocated after use. */
4219 xget_renaming_scope (struct type
*renaming_type
)
4221 /* The renaming types adhere to the following convention:
4222 <scope>__<rename>___<XR extension>.
4223 So, to extract the scope, we search for the "___XR" extension,
4224 and then backtrack until we find the first "__". */
4226 const char *name
= type_name_no_tag (renaming_type
);
4227 char *suffix
= strstr (name
, "___XR");
4232 /* Now, backtrack a bit until we find the first "__". Start looking
4233 at suffix - 3, as the <rename> part is at least one character long. */
4235 for (last
= suffix
- 3; last
> name
; last
--)
4236 if (last
[0] == '_' && last
[1] == '_')
4239 /* Make a copy of scope and return it. */
4241 scope_len
= last
- name
;
4242 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4244 strncpy (scope
, name
, scope_len
);
4245 scope
[scope_len
] = '\0';
4250 /* Return nonzero if NAME corresponds to a package name. */
4253 is_package_name (const char *name
)
4255 /* Here, We take advantage of the fact that no symbols are generated
4256 for packages, while symbols are generated for each function.
4257 So the condition for NAME represent a package becomes equivalent
4258 to NAME not existing in our list of symbols. There is only one
4259 small complication with library-level functions (see below). */
4263 /* If it is a function that has not been defined at library level,
4264 then we should be able to look it up in the symbols. */
4265 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4268 /* Library-level function names start with "_ada_". See if function
4269 "_ada_" followed by NAME can be found. */
4271 /* Do a quick check that NAME does not contain "__", since library-level
4272 functions names cannot contain "__" in them. */
4273 if (strstr (name
, "__") != NULL
)
4276 fun_name
= xstrprintf ("_ada_%s", name
);
4278 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4281 /* Return nonzero if SYM corresponds to a renaming entity that is
4282 not visible from FUNCTION_NAME. */
4285 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4289 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4292 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4294 make_cleanup (xfree
, scope
);
4296 /* If the rename has been defined in a package, then it is visible. */
4297 if (is_package_name (scope
))
4300 /* Check that the rename is in the current function scope by checking
4301 that its name starts with SCOPE. */
4303 /* If the function name starts with "_ada_", it means that it is
4304 a library-level function. Strip this prefix before doing the
4305 comparison, as the encoding for the renaming does not contain
4307 if (strncmp (function_name
, "_ada_", 5) == 0)
4310 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4313 /* Remove entries from SYMS that corresponds to a renaming entity that
4314 is not visible from the function associated with CURRENT_BLOCK or
4315 that is superfluous due to the presence of more specific renaming
4316 information. Places surviving symbols in the initial entries of
4317 SYMS and returns the number of surviving symbols.
4320 First, in cases where an object renaming is implemented as a
4321 reference variable, GNAT may produce both the actual reference
4322 variable and the renaming encoding. In this case, we discard the
4325 Second, GNAT emits a type following a specified encoding for each renaming
4326 entity. Unfortunately, STABS currently does not support the definition
4327 of types that are local to a given lexical block, so all renamings types
4328 are emitted at library level. As a consequence, if an application
4329 contains two renaming entities using the same name, and a user tries to
4330 print the value of one of these entities, the result of the ada symbol
4331 lookup will also contain the wrong renaming type.
4333 This function partially covers for this limitation by attempting to
4334 remove from the SYMS list renaming symbols that should be visible
4335 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4336 method with the current information available. The implementation
4337 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4339 - When the user tries to print a rename in a function while there
4340 is another rename entity defined in a package: Normally, the
4341 rename in the function has precedence over the rename in the
4342 package, so the latter should be removed from the list. This is
4343 currently not the case.
4345 - This function will incorrectly remove valid renames if
4346 the CURRENT_BLOCK corresponds to a function which symbol name
4347 has been changed by an "Export" pragma. As a consequence,
4348 the user will be unable to print such rename entities. */
4351 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4352 int nsyms
, const struct block
*current_block
)
4354 struct symbol
*current_function
;
4355 char *current_function_name
;
4357 int is_new_style_renaming
;
4359 /* If there is both a renaming foo___XR... encoded as a variable and
4360 a simple variable foo in the same block, discard the latter.
4361 First, zero out such symbols, then compress. */
4362 is_new_style_renaming
= 0;
4363 for (i
= 0; i
< nsyms
; i
+= 1)
4365 struct symbol
*sym
= syms
[i
].sym
;
4366 struct block
*block
= syms
[i
].block
;
4370 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4372 name
= SYMBOL_LINKAGE_NAME (sym
);
4373 suffix
= strstr (name
, "___XR");
4377 int name_len
= suffix
- name
;
4379 is_new_style_renaming
= 1;
4380 for (j
= 0; j
< nsyms
; j
+= 1)
4381 if (i
!= j
&& syms
[j
].sym
!= NULL
4382 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4384 && block
== syms
[j
].block
)
4388 if (is_new_style_renaming
)
4392 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4393 if (syms
[j
].sym
!= NULL
)
4401 /* Extract the function name associated to CURRENT_BLOCK.
4402 Abort if unable to do so. */
4404 if (current_block
== NULL
)
4407 current_function
= block_linkage_function (current_block
);
4408 if (current_function
== NULL
)
4411 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4412 if (current_function_name
== NULL
)
4415 /* Check each of the symbols, and remove it from the list if it is
4416 a type corresponding to a renaming that is out of the scope of
4417 the current block. */
4422 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4423 == ADA_OBJECT_RENAMING
4424 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4427 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4428 syms
[j
- 1] = syms
[j
];
4438 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4439 whose name and domain match NAME and DOMAIN respectively.
4440 If no match was found, then extend the search to "enclosing"
4441 routines (in other words, if we're inside a nested function,
4442 search the symbols defined inside the enclosing functions).
4444 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4447 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4448 struct block
*block
, domain_enum domain
,
4451 int block_depth
= 0;
4453 while (block
!= NULL
)
4456 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4458 /* If we found a non-function match, assume that's the one. */
4459 if (is_nonfunction (defns_collected (obstackp
, 0),
4460 num_defns_collected (obstackp
)))
4463 block
= BLOCK_SUPERBLOCK (block
);
4466 /* If no luck so far, try to find NAME as a local symbol in some lexically
4467 enclosing subprogram. */
4468 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4469 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4472 /* An object of this type is used as the user_data argument when
4473 calling the map_ada_symtabs method. */
4475 struct ada_psym_data
4477 struct obstack
*obstackp
;
4484 /* Callback function for map_ada_symtabs. */
4487 ada_add_psyms (struct objfile
*objfile
, struct symtab
*s
, void *user_data
)
4489 struct ada_psym_data
*data
= user_data
;
4490 const int block_kind
= data
->global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4491 ada_add_block_symbols (data
->obstackp
,
4492 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4493 data
->name
, data
->domain
, objfile
, data
->wild_match
);
4496 /* Add to OBSTACKP all non-local symbols whose name and domain match
4497 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4498 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4501 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4502 domain_enum domain
, int global
,
4505 struct objfile
*objfile
;
4506 struct ada_psym_data data
;
4508 data
.obstackp
= obstackp
;
4510 data
.domain
= domain
;
4511 data
.global
= global
;
4512 data
.wild_match
= is_wild_match
;
4514 ALL_OBJFILES (objfile
)
4517 objfile
->sf
->qf
->map_ada_symtabs (objfile
, wild_match
, is_name_suffix
,
4518 ada_add_psyms
, name
,
4520 is_wild_match
, &data
);
4524 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4525 scope and in global scopes, returning the number of matches. Sets
4526 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4527 indicating the symbols found and the blocks and symbol tables (if
4528 any) in which they were found. This vector are transient---good only to
4529 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4530 symbol match within the nest of blocks whose innermost member is BLOCK0,
4531 is the one match returned (no other matches in that or
4532 enclosing blocks is returned). If there are any matches in or
4533 surrounding BLOCK0, then these alone are returned. Otherwise, the
4534 search extends to global and file-scope (static) symbol tables.
4535 Names prefixed with "standard__" are handled specially: "standard__"
4536 is first stripped off, and only static and global symbols are searched. */
4539 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4540 domain_enum
namespace,
4541 struct ada_symbol_info
**results
)
4544 struct block
*block
;
4550 obstack_free (&symbol_list_obstack
, NULL
);
4551 obstack_init (&symbol_list_obstack
);
4555 /* Search specified block and its superiors. */
4557 wild_match
= (strstr (name0
, "__") == NULL
);
4559 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4560 needed, but adding const will
4561 have a cascade effect. */
4563 /* Special case: If the user specifies a symbol name inside package
4564 Standard, do a non-wild matching of the symbol name without
4565 the "standard__" prefix. This was primarily introduced in order
4566 to allow the user to specifically access the standard exceptions
4567 using, for instance, Standard.Constraint_Error when Constraint_Error
4568 is ambiguous (due to the user defining its own Constraint_Error
4569 entity inside its program). */
4570 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4574 name
= name0
+ sizeof ("standard__") - 1;
4577 /* Check the non-global symbols. If we have ANY match, then we're done. */
4579 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4581 if (num_defns_collected (&symbol_list_obstack
) > 0)
4584 /* No non-global symbols found. Check our cache to see if we have
4585 already performed this search before. If we have, then return
4589 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4592 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4596 /* Search symbols from all global blocks. */
4598 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4601 /* Now add symbols from all per-file blocks if we've gotten no hits
4602 (not strictly correct, but perhaps better than an error). */
4604 if (num_defns_collected (&symbol_list_obstack
) == 0)
4605 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4609 ndefns
= num_defns_collected (&symbol_list_obstack
);
4610 *results
= defns_collected (&symbol_list_obstack
, 1);
4612 ndefns
= remove_extra_symbols (*results
, ndefns
);
4615 cache_symbol (name0
, namespace, NULL
, NULL
);
4617 if (ndefns
== 1 && cacheIfUnique
)
4618 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4620 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4626 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4627 domain_enum
namespace, struct block
**block_found
)
4629 struct ada_symbol_info
*candidates
;
4632 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4634 if (n_candidates
== 0)
4637 if (block_found
!= NULL
)
4638 *block_found
= candidates
[0].block
;
4640 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4643 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4644 scope and in global scopes, or NULL if none. NAME is folded and
4645 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4646 choosing the first symbol if there are multiple choices.
4647 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4648 table in which the symbol was found (in both cases, these
4649 assignments occur only if the pointers are non-null). */
4651 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4652 domain_enum
namespace, int *is_a_field_of_this
)
4654 if (is_a_field_of_this
!= NULL
)
4655 *is_a_field_of_this
= 0;
4658 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4659 block0
, namespace, NULL
);
4662 static struct symbol
*
4663 ada_lookup_symbol_nonlocal (const char *name
,
4664 const struct block
*block
,
4665 const domain_enum domain
)
4667 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
4671 /* True iff STR is a possible encoded suffix of a normal Ada name
4672 that is to be ignored for matching purposes. Suffixes of parallel
4673 names (e.g., XVE) are not included here. Currently, the possible suffixes
4674 are given by any of the regular expressions:
4676 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4677 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4678 _E[0-9]+[bs]$ [protected object entry suffixes]
4679 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4681 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4682 match is performed. This sequence is used to differentiate homonyms,
4683 is an optional part of a valid name suffix. */
4686 is_name_suffix (const char *str
)
4689 const char *matching
;
4690 const int len
= strlen (str
);
4692 /* Skip optional leading __[0-9]+. */
4694 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4697 while (isdigit (str
[0]))
4703 if (str
[0] == '.' || str
[0] == '$')
4706 while (isdigit (matching
[0]))
4708 if (matching
[0] == '\0')
4714 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4717 while (isdigit (matching
[0]))
4719 if (matching
[0] == '\0')
4724 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4725 with a N at the end. Unfortunately, the compiler uses the same
4726 convention for other internal types it creates. So treating
4727 all entity names that end with an "N" as a name suffix causes
4728 some regressions. For instance, consider the case of an enumerated
4729 type. To support the 'Image attribute, it creates an array whose
4731 Having a single character like this as a suffix carrying some
4732 information is a bit risky. Perhaps we should change the encoding
4733 to be something like "_N" instead. In the meantime, do not do
4734 the following check. */
4735 /* Protected Object Subprograms */
4736 if (len
== 1 && str
[0] == 'N')
4741 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4744 while (isdigit (matching
[0]))
4746 if ((matching
[0] == 'b' || matching
[0] == 's')
4747 && matching
[1] == '\0')
4751 /* ??? We should not modify STR directly, as we are doing below. This
4752 is fine in this case, but may become problematic later if we find
4753 that this alternative did not work, and want to try matching
4754 another one from the begining of STR. Since we modified it, we
4755 won't be able to find the begining of the string anymore! */
4759 while (str
[0] != '_' && str
[0] != '\0')
4761 if (str
[0] != 'n' && str
[0] != 'b')
4767 if (str
[0] == '\000')
4772 if (str
[1] != '_' || str
[2] == '\000')
4776 if (strcmp (str
+ 3, "JM") == 0)
4778 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4779 the LJM suffix in favor of the JM one. But we will
4780 still accept LJM as a valid suffix for a reasonable
4781 amount of time, just to allow ourselves to debug programs
4782 compiled using an older version of GNAT. */
4783 if (strcmp (str
+ 3, "LJM") == 0)
4787 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4788 || str
[4] == 'U' || str
[4] == 'P')
4790 if (str
[4] == 'R' && str
[5] != 'T')
4794 if (!isdigit (str
[2]))
4796 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4797 if (!isdigit (str
[k
]) && str
[k
] != '_')
4801 if (str
[0] == '$' && isdigit (str
[1]))
4803 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4804 if (!isdigit (str
[k
]) && str
[k
] != '_')
4811 /* Return non-zero if the string starting at NAME and ending before
4812 NAME_END contains no capital letters. */
4815 is_valid_name_for_wild_match (const char *name0
)
4817 const char *decoded_name
= ada_decode (name0
);
4820 /* If the decoded name starts with an angle bracket, it means that
4821 NAME0 does not follow the GNAT encoding format. It should then
4822 not be allowed as a possible wild match. */
4823 if (decoded_name
[0] == '<')
4826 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4827 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4833 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4834 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4835 informational suffixes of NAME (i.e., for which is_name_suffix is
4839 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4846 match
= strstr (start
, patn0
);
4851 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
4852 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
4853 && is_name_suffix (match
+ patn_len
))
4854 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
4859 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4860 vector *defn_symbols, updating the list of symbols in OBSTACKP
4861 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4862 OBJFILE is the section containing BLOCK.
4863 SYMTAB is recorded with each symbol added. */
4866 ada_add_block_symbols (struct obstack
*obstackp
,
4867 struct block
*block
, const char *name
,
4868 domain_enum domain
, struct objfile
*objfile
,
4871 struct dict_iterator iter
;
4872 int name_len
= strlen (name
);
4873 /* A matching argument symbol, if any. */
4874 struct symbol
*arg_sym
;
4875 /* Set true when we find a matching non-argument symbol. */
4884 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4886 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4887 SYMBOL_DOMAIN (sym
), domain
)
4888 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
4890 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4892 else if (SYMBOL_IS_ARGUMENT (sym
))
4897 add_defn_to_vec (obstackp
,
4898 fixup_symbol_section (sym
, objfile
),
4906 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4908 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4909 SYMBOL_DOMAIN (sym
), domain
))
4911 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
4913 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
4915 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
4917 if (SYMBOL_IS_ARGUMENT (sym
))
4922 add_defn_to_vec (obstackp
,
4923 fixup_symbol_section (sym
, objfile
),
4932 if (!found_sym
&& arg_sym
!= NULL
)
4934 add_defn_to_vec (obstackp
,
4935 fixup_symbol_section (arg_sym
, objfile
),
4944 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4946 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4947 SYMBOL_DOMAIN (sym
), domain
))
4951 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
4954 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
4956 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
4961 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
4963 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
4965 if (SYMBOL_IS_ARGUMENT (sym
))
4970 add_defn_to_vec (obstackp
,
4971 fixup_symbol_section (sym
, objfile
),
4979 /* NOTE: This really shouldn't be needed for _ada_ symbols.
4980 They aren't parameters, right? */
4981 if (!found_sym
&& arg_sym
!= NULL
)
4983 add_defn_to_vec (obstackp
,
4984 fixup_symbol_section (arg_sym
, objfile
),
4991 /* Symbol Completion */
4993 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
4994 name in a form that's appropriate for the completion. The result
4995 does not need to be deallocated, but is only good until the next call.
4997 TEXT_LEN is equal to the length of TEXT.
4998 Perform a wild match if WILD_MATCH is set.
4999 ENCODED should be set if TEXT represents the start of a symbol name
5000 in its encoded form. */
5003 symbol_completion_match (const char *sym_name
,
5004 const char *text
, int text_len
,
5005 int wild_match
, int encoded
)
5008 const int verbatim_match
= (text
[0] == '<');
5013 /* Strip the leading angle bracket. */
5018 /* First, test against the fully qualified name of the symbol. */
5020 if (strncmp (sym_name
, text
, text_len
) == 0)
5023 if (match
&& !encoded
)
5025 /* One needed check before declaring a positive match is to verify
5026 that iff we are doing a verbatim match, the decoded version
5027 of the symbol name starts with '<'. Otherwise, this symbol name
5028 is not a suitable completion. */
5029 const char *sym_name_copy
= sym_name
;
5030 int has_angle_bracket
;
5032 sym_name
= ada_decode (sym_name
);
5033 has_angle_bracket
= (sym_name
[0] == '<');
5034 match
= (has_angle_bracket
== verbatim_match
);
5035 sym_name
= sym_name_copy
;
5038 if (match
&& !verbatim_match
)
5040 /* When doing non-verbatim match, another check that needs to
5041 be done is to verify that the potentially matching symbol name
5042 does not include capital letters, because the ada-mode would
5043 not be able to understand these symbol names without the
5044 angle bracket notation. */
5047 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5052 /* Second: Try wild matching... */
5054 if (!match
&& wild_match
)
5056 /* Since we are doing wild matching, this means that TEXT
5057 may represent an unqualified symbol name. We therefore must
5058 also compare TEXT against the unqualified name of the symbol. */
5059 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5061 if (strncmp (sym_name
, text
, text_len
) == 0)
5065 /* Finally: If we found a mach, prepare the result to return. */
5071 sym_name
= add_angle_brackets (sym_name
);
5074 sym_name
= ada_decode (sym_name
);
5079 DEF_VEC_P (char_ptr
);
5081 /* A companion function to ada_make_symbol_completion_list().
5082 Check if SYM_NAME represents a symbol which name would be suitable
5083 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5084 it is appended at the end of the given string vector SV.
5086 ORIG_TEXT is the string original string from the user command
5087 that needs to be completed. WORD is the entire command on which
5088 completion should be performed. These two parameters are used to
5089 determine which part of the symbol name should be added to the
5091 if WILD_MATCH is set, then wild matching is performed.
5092 ENCODED should be set if TEXT represents a symbol name in its
5093 encoded formed (in which case the completion should also be
5097 symbol_completion_add (VEC(char_ptr
) **sv
,
5098 const char *sym_name
,
5099 const char *text
, int text_len
,
5100 const char *orig_text
, const char *word
,
5101 int wild_match
, int encoded
)
5103 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5104 wild_match
, encoded
);
5110 /* We found a match, so add the appropriate completion to the given
5113 if (word
== orig_text
)
5115 completion
= xmalloc (strlen (match
) + 5);
5116 strcpy (completion
, match
);
5118 else if (word
> orig_text
)
5120 /* Return some portion of sym_name. */
5121 completion
= xmalloc (strlen (match
) + 5);
5122 strcpy (completion
, match
+ (word
- orig_text
));
5126 /* Return some of ORIG_TEXT plus sym_name. */
5127 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5128 strncpy (completion
, word
, orig_text
- word
);
5129 completion
[orig_text
- word
] = '\0';
5130 strcat (completion
, match
);
5133 VEC_safe_push (char_ptr
, *sv
, completion
);
5136 /* An object of this type is passed as the user_data argument to the
5137 map_partial_symbol_names method. */
5138 struct add_partial_datum
5140 VEC(char_ptr
) **completions
;
5149 /* A callback for map_partial_symbol_names. */
5151 ada_add_partial_symbol_completions (const char *name
, void *user_data
)
5153 struct add_partial_datum
*data
= user_data
;
5154 symbol_completion_add (data
->completions
, name
,
5155 data
->text
, data
->text_len
, data
->text0
, data
->word
,
5156 data
->wild_match
, data
->encoded
);
5159 /* Return a list of possible symbol names completing TEXT0. The list
5160 is NULL terminated. WORD is the entire command on which completion
5164 ada_make_symbol_completion_list (char *text0
, char *word
)
5170 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5173 struct minimal_symbol
*msymbol
;
5174 struct objfile
*objfile
;
5175 struct block
*b
, *surrounding_static_block
= 0;
5177 struct dict_iterator iter
;
5179 if (text0
[0] == '<')
5181 text
= xstrdup (text0
);
5182 make_cleanup (xfree
, text
);
5183 text_len
= strlen (text
);
5189 text
= xstrdup (ada_encode (text0
));
5190 make_cleanup (xfree
, text
);
5191 text_len
= strlen (text
);
5192 for (i
= 0; i
< text_len
; i
++)
5193 text
[i
] = tolower (text
[i
]);
5195 encoded
= (strstr (text0
, "__") != NULL
);
5196 /* If the name contains a ".", then the user is entering a fully
5197 qualified entity name, and the match must not be done in wild
5198 mode. Similarly, if the user wants to complete what looks like
5199 an encoded name, the match must not be done in wild mode. */
5200 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5203 /* First, look at the partial symtab symbols. */
5205 struct add_partial_datum data
;
5207 data
.completions
= &completions
;
5209 data
.text_len
= text_len
;
5212 data
.wild_match
= wild_match
;
5213 data
.encoded
= encoded
;
5214 map_partial_symbol_names (ada_add_partial_symbol_completions
, &data
);
5217 /* At this point scan through the misc symbol vectors and add each
5218 symbol you find to the list. Eventually we want to ignore
5219 anything that isn't a text symbol (everything else will be
5220 handled by the psymtab code above). */
5222 ALL_MSYMBOLS (objfile
, msymbol
)
5225 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5226 text
, text_len
, text0
, word
, wild_match
, encoded
);
5229 /* Search upwards from currently selected frame (so that we can
5230 complete on local vars. */
5232 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5234 if (!BLOCK_SUPERBLOCK (b
))
5235 surrounding_static_block
= b
; /* For elmin of dups */
5237 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5239 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5240 text
, text_len
, text0
, word
,
5241 wild_match
, encoded
);
5245 /* Go through the symtabs and check the externs and statics for
5246 symbols which match. */
5248 ALL_SYMTABS (objfile
, s
)
5251 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5252 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5254 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5255 text
, text_len
, text0
, word
,
5256 wild_match
, encoded
);
5260 ALL_SYMTABS (objfile
, s
)
5263 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5264 /* Don't do this block twice. */
5265 if (b
== surrounding_static_block
)
5267 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5269 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5270 text
, text_len
, text0
, word
,
5271 wild_match
, encoded
);
5275 /* Append the closing NULL entry. */
5276 VEC_safe_push (char_ptr
, completions
, NULL
);
5278 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5279 return the copy. It's unfortunate that we have to make a copy
5280 of an array that we're about to destroy, but there is nothing much
5281 we can do about it. Fortunately, it's typically not a very large
5284 const size_t completions_size
=
5285 VEC_length (char_ptr
, completions
) * sizeof (char *);
5286 char **result
= malloc (completions_size
);
5288 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5290 VEC_free (char_ptr
, completions
);
5297 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5298 for tagged types. */
5301 ada_is_dispatch_table_ptr_type (struct type
*type
)
5305 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5308 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5312 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5315 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5316 to be invisible to users. */
5319 ada_is_ignored_field (struct type
*type
, int field_num
)
5321 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5324 /* Check the name of that field. */
5326 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5328 /* Anonymous field names should not be printed.
5329 brobecker/2007-02-20: I don't think this can actually happen
5330 but we don't want to print the value of annonymous fields anyway. */
5334 /* A field named "_parent" is internally generated by GNAT for
5335 tagged types, and should not be printed either. */
5336 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5340 /* If this is the dispatch table of a tagged type, then ignore. */
5341 if (ada_is_tagged_type (type
, 1)
5342 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5345 /* Not a special field, so it should not be ignored. */
5349 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5350 pointer or reference type whose ultimate target has a tag field. */
5353 ada_is_tagged_type (struct type
*type
, int refok
)
5355 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5358 /* True iff TYPE represents the type of X'Tag */
5361 ada_is_tag_type (struct type
*type
)
5363 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5367 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5368 return (name
!= NULL
5369 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5373 /* The type of the tag on VAL. */
5376 ada_tag_type (struct value
*val
)
5378 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5381 /* The value of the tag on VAL. */
5384 ada_value_tag (struct value
*val
)
5386 return ada_value_struct_elt (val
, "_tag", 0);
5389 /* The value of the tag on the object of type TYPE whose contents are
5390 saved at VALADDR, if it is non-null, or is at memory address
5393 static struct value
*
5394 value_tag_from_contents_and_address (struct type
*type
,
5395 const gdb_byte
*valaddr
,
5398 int tag_byte_offset
, dummy1
, dummy2
;
5399 struct type
*tag_type
;
5400 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5403 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5405 : valaddr
+ tag_byte_offset
);
5406 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5408 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5413 static struct type
*
5414 type_from_tag (struct value
*tag
)
5416 const char *type_name
= ada_tag_name (tag
);
5417 if (type_name
!= NULL
)
5418 return ada_find_any_type (ada_encode (type_name
));
5429 static int ada_tag_name_1 (void *);
5430 static int ada_tag_name_2 (struct tag_args
*);
5432 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5433 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5434 The value stored in ARGS->name is valid until the next call to
5438 ada_tag_name_1 (void *args0
)
5440 struct tag_args
*args
= (struct tag_args
*) args0
;
5441 static char name
[1024];
5445 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5447 return ada_tag_name_2 (args
);
5448 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5451 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5452 for (p
= name
; *p
!= '\0'; p
+= 1)
5459 /* Utility function for ada_tag_name_1 that tries the second
5460 representation for the dispatch table (in which there is no
5461 explicit 'tsd' field in the referent of the tag pointer, and instead
5462 the tsd pointer is stored just before the dispatch table. */
5465 ada_tag_name_2 (struct tag_args
*args
)
5467 struct type
*info_type
;
5468 static char name
[1024];
5470 struct value
*val
, *valp
;
5473 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5474 if (info_type
== NULL
)
5476 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5477 valp
= value_cast (info_type
, args
->tag
);
5480 val
= value_ind (value_ptradd (valp
, -1));
5483 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5486 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5487 for (p
= name
; *p
!= '\0'; p
+= 1)
5494 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5498 ada_tag_name (struct value
*tag
)
5500 struct tag_args args
;
5501 if (!ada_is_tag_type (value_type (tag
)))
5505 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5509 /* The parent type of TYPE, or NULL if none. */
5512 ada_parent_type (struct type
*type
)
5516 type
= ada_check_typedef (type
);
5518 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5521 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5522 if (ada_is_parent_field (type
, i
))
5524 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5526 /* If the _parent field is a pointer, then dereference it. */
5527 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5528 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5529 /* If there is a parallel XVS type, get the actual base type. */
5530 parent_type
= ada_get_base_type (parent_type
);
5532 return ada_check_typedef (parent_type
);
5538 /* True iff field number FIELD_NUM of structure type TYPE contains the
5539 parent-type (inherited) fields of a derived type. Assumes TYPE is
5540 a structure type with at least FIELD_NUM+1 fields. */
5543 ada_is_parent_field (struct type
*type
, int field_num
)
5545 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5546 return (name
!= NULL
5547 && (strncmp (name
, "PARENT", 6) == 0
5548 || strncmp (name
, "_parent", 7) == 0));
5551 /* True iff field number FIELD_NUM of structure type TYPE is a
5552 transparent wrapper field (which should be silently traversed when doing
5553 field selection and flattened when printing). Assumes TYPE is a
5554 structure type with at least FIELD_NUM+1 fields. Such fields are always
5558 ada_is_wrapper_field (struct type
*type
, int field_num
)
5560 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5561 return (name
!= NULL
5562 && (strncmp (name
, "PARENT", 6) == 0
5563 || strcmp (name
, "REP") == 0
5564 || strncmp (name
, "_parent", 7) == 0
5565 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5568 /* True iff field number FIELD_NUM of structure or union type TYPE
5569 is a variant wrapper. Assumes TYPE is a structure type with at least
5570 FIELD_NUM+1 fields. */
5573 ada_is_variant_part (struct type
*type
, int field_num
)
5575 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5576 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5577 || (is_dynamic_field (type
, field_num
)
5578 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5579 == TYPE_CODE_UNION
)));
5582 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5583 whose discriminants are contained in the record type OUTER_TYPE,
5584 returns the type of the controlling discriminant for the variant.
5585 May return NULL if the type could not be found. */
5588 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5590 char *name
= ada_variant_discrim_name (var_type
);
5591 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5594 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5595 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5596 represents a 'when others' clause; otherwise 0. */
5599 ada_is_others_clause (struct type
*type
, int field_num
)
5601 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5602 return (name
!= NULL
&& name
[0] == 'O');
5605 /* Assuming that TYPE0 is the type of the variant part of a record,
5606 returns the name of the discriminant controlling the variant.
5607 The value is valid until the next call to ada_variant_discrim_name. */
5610 ada_variant_discrim_name (struct type
*type0
)
5612 static char *result
= NULL
;
5613 static size_t result_len
= 0;
5616 const char *discrim_end
;
5617 const char *discrim_start
;
5619 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5620 type
= TYPE_TARGET_TYPE (type0
);
5624 name
= ada_type_name (type
);
5626 if (name
== NULL
|| name
[0] == '\000')
5629 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5632 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5635 if (discrim_end
== name
)
5638 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5641 if (discrim_start
== name
+ 1)
5643 if ((discrim_start
> name
+ 3
5644 && strncmp (discrim_start
- 3, "___", 3) == 0)
5645 || discrim_start
[-1] == '.')
5649 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5650 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5651 result
[discrim_end
- discrim_start
] = '\0';
5655 /* Scan STR for a subtype-encoded number, beginning at position K.
5656 Put the position of the character just past the number scanned in
5657 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5658 Return 1 if there was a valid number at the given position, and 0
5659 otherwise. A "subtype-encoded" number consists of the absolute value
5660 in decimal, followed by the letter 'm' to indicate a negative number.
5661 Assumes 0m does not occur. */
5664 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5668 if (!isdigit (str
[k
]))
5671 /* Do it the hard way so as not to make any assumption about
5672 the relationship of unsigned long (%lu scan format code) and
5675 while (isdigit (str
[k
]))
5677 RU
= RU
* 10 + (str
[k
] - '0');
5684 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5690 /* NOTE on the above: Technically, C does not say what the results of
5691 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5692 number representable as a LONGEST (although either would probably work
5693 in most implementations). When RU>0, the locution in the then branch
5694 above is always equivalent to the negative of RU. */
5701 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5702 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5703 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5706 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5708 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5721 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5730 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5731 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5733 if (val
>= L
&& val
<= U
)
5745 /* FIXME: Lots of redundancy below. Try to consolidate. */
5747 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5748 ARG_TYPE, extract and return the value of one of its (non-static)
5749 fields. FIELDNO says which field. Differs from value_primitive_field
5750 only in that it can handle packed values of arbitrary type. */
5752 static struct value
*
5753 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5754 struct type
*arg_type
)
5758 arg_type
= ada_check_typedef (arg_type
);
5759 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5761 /* Handle packed fields. */
5763 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5765 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5766 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5768 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5769 offset
+ bit_pos
/ 8,
5770 bit_pos
% 8, bit_size
, type
);
5773 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5776 /* Find field with name NAME in object of type TYPE. If found,
5777 set the following for each argument that is non-null:
5778 - *FIELD_TYPE_P to the field's type;
5779 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5780 an object of that type;
5781 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5782 - *BIT_SIZE_P to its size in bits if the field is packed, and
5784 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5785 fields up to but not including the desired field, or by the total
5786 number of fields if not found. A NULL value of NAME never
5787 matches; the function just counts visible fields in this case.
5789 Returns 1 if found, 0 otherwise. */
5792 find_struct_field (char *name
, struct type
*type
, int offset
,
5793 struct type
**field_type_p
,
5794 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5799 type
= ada_check_typedef (type
);
5801 if (field_type_p
!= NULL
)
5802 *field_type_p
= NULL
;
5803 if (byte_offset_p
!= NULL
)
5805 if (bit_offset_p
!= NULL
)
5807 if (bit_size_p
!= NULL
)
5810 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5812 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5813 int fld_offset
= offset
+ bit_pos
/ 8;
5814 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5816 if (t_field_name
== NULL
)
5819 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5821 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5822 if (field_type_p
!= NULL
)
5823 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5824 if (byte_offset_p
!= NULL
)
5825 *byte_offset_p
= fld_offset
;
5826 if (bit_offset_p
!= NULL
)
5827 *bit_offset_p
= bit_pos
% 8;
5828 if (bit_size_p
!= NULL
)
5829 *bit_size_p
= bit_size
;
5832 else if (ada_is_wrapper_field (type
, i
))
5834 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5835 field_type_p
, byte_offset_p
, bit_offset_p
,
5836 bit_size_p
, index_p
))
5839 else if (ada_is_variant_part (type
, i
))
5841 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5844 struct type
*field_type
5845 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5847 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5849 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5851 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5852 field_type_p
, byte_offset_p
,
5853 bit_offset_p
, bit_size_p
, index_p
))
5857 else if (index_p
!= NULL
)
5863 /* Number of user-visible fields in record type TYPE. */
5866 num_visible_fields (struct type
*type
)
5870 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5874 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5875 and search in it assuming it has (class) type TYPE.
5876 If found, return value, else return NULL.
5878 Searches recursively through wrapper fields (e.g., '_parent'). */
5880 static struct value
*
5881 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5885 type
= ada_check_typedef (type
);
5887 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5889 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5891 if (t_field_name
== NULL
)
5894 else if (field_name_match (t_field_name
, name
))
5895 return ada_value_primitive_field (arg
, offset
, i
, type
);
5897 else if (ada_is_wrapper_field (type
, i
))
5899 struct value
*v
= /* Do not let indent join lines here. */
5900 ada_search_struct_field (name
, arg
,
5901 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5902 TYPE_FIELD_TYPE (type
, i
));
5907 else if (ada_is_variant_part (type
, i
))
5909 /* PNH: Do we ever get here? See find_struct_field. */
5911 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5912 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
5914 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5916 struct value
*v
= ada_search_struct_field
/* Force line break. */
5918 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5919 TYPE_FIELD_TYPE (field_type
, j
));
5928 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
5929 int, struct type
*);
5932 /* Return field #INDEX in ARG, where the index is that returned by
5933 * find_struct_field through its INDEX_P argument. Adjust the address
5934 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
5935 * If found, return value, else return NULL. */
5937 static struct value
*
5938 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
5941 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
5945 /* Auxiliary function for ada_index_struct_field. Like
5946 * ada_index_struct_field, but takes index from *INDEX_P and modifies
5949 static struct value
*
5950 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
5954 type
= ada_check_typedef (type
);
5956 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5958 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
5960 else if (ada_is_wrapper_field (type
, i
))
5962 struct value
*v
= /* Do not let indent join lines here. */
5963 ada_index_struct_field_1 (index_p
, arg
,
5964 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5965 TYPE_FIELD_TYPE (type
, i
));
5970 else if (ada_is_variant_part (type
, i
))
5972 /* PNH: Do we ever get here? See ada_search_struct_field,
5973 find_struct_field. */
5974 error (_("Cannot assign this kind of variant record"));
5976 else if (*index_p
== 0)
5977 return ada_value_primitive_field (arg
, offset
, i
, type
);
5984 /* Given ARG, a value of type (pointer or reference to a)*
5985 structure/union, extract the component named NAME from the ultimate
5986 target structure/union and return it as a value with its
5989 The routine searches for NAME among all members of the structure itself
5990 and (recursively) among all members of any wrapper members
5993 If NO_ERR, then simply return NULL in case of error, rather than
5997 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
5999 struct type
*t
, *t1
;
6003 t1
= t
= ada_check_typedef (value_type (arg
));
6004 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6006 t1
= TYPE_TARGET_TYPE (t
);
6009 t1
= ada_check_typedef (t1
);
6010 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6012 arg
= coerce_ref (arg
);
6017 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6019 t1
= TYPE_TARGET_TYPE (t
);
6022 t1
= ada_check_typedef (t1
);
6023 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6025 arg
= value_ind (arg
);
6032 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6036 v
= ada_search_struct_field (name
, arg
, 0, t
);
6039 int bit_offset
, bit_size
, byte_offset
;
6040 struct type
*field_type
;
6043 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6044 address
= value_as_address (arg
);
6046 address
= unpack_pointer (t
, value_contents (arg
));
6048 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6049 if (find_struct_field (name
, t1
, 0,
6050 &field_type
, &byte_offset
, &bit_offset
,
6055 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6056 arg
= ada_coerce_ref (arg
);
6058 arg
= ada_value_ind (arg
);
6059 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6060 bit_offset
, bit_size
,
6064 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6068 if (v
!= NULL
|| no_err
)
6071 error (_("There is no member named %s."), name
);
6077 error (_("Attempt to extract a component of a value that is not a record."));
6080 /* Given a type TYPE, look up the type of the component of type named NAME.
6081 If DISPP is non-null, add its byte displacement from the beginning of a
6082 structure (pointed to by a value) of type TYPE to *DISPP (does not
6083 work for packed fields).
6085 Matches any field whose name has NAME as a prefix, possibly
6088 TYPE can be either a struct or union. If REFOK, TYPE may also
6089 be a (pointer or reference)+ to a struct or union, and the
6090 ultimate target type will be searched.
6092 Looks recursively into variant clauses and parent types.
6094 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6095 TYPE is not a type of the right kind. */
6097 static struct type
*
6098 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6099 int noerr
, int *dispp
)
6106 if (refok
&& type
!= NULL
)
6109 type
= ada_check_typedef (type
);
6110 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6111 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6113 type
= TYPE_TARGET_TYPE (type
);
6117 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6118 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6124 target_terminal_ours ();
6125 gdb_flush (gdb_stdout
);
6127 error (_("Type (null) is not a structure or union type"));
6130 /* XXX: type_sprint */
6131 fprintf_unfiltered (gdb_stderr
, _("Type "));
6132 type_print (type
, "", gdb_stderr
, -1);
6133 error (_(" is not a structure or union type"));
6138 type
= to_static_fixed_type (type
);
6140 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6142 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6146 if (t_field_name
== NULL
)
6149 else if (field_name_match (t_field_name
, name
))
6152 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6153 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6156 else if (ada_is_wrapper_field (type
, i
))
6159 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6164 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6169 else if (ada_is_variant_part (type
, i
))
6172 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6174 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6176 /* FIXME pnh 2008/01/26: We check for a field that is
6177 NOT wrapped in a struct, since the compiler sometimes
6178 generates these for unchecked variant types. Revisit
6179 if the compiler changes this practice. */
6180 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6182 if (v_field_name
!= NULL
6183 && field_name_match (v_field_name
, name
))
6184 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6186 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6192 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6203 target_terminal_ours ();
6204 gdb_flush (gdb_stdout
);
6207 /* XXX: type_sprint */
6208 fprintf_unfiltered (gdb_stderr
, _("Type "));
6209 type_print (type
, "", gdb_stderr
, -1);
6210 error (_(" has no component named <null>"));
6214 /* XXX: type_sprint */
6215 fprintf_unfiltered (gdb_stderr
, _("Type "));
6216 type_print (type
, "", gdb_stderr
, -1);
6217 error (_(" has no component named %s"), name
);
6224 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6225 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6226 represents an unchecked union (that is, the variant part of a
6227 record that is named in an Unchecked_Union pragma). */
6230 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6232 char *discrim_name
= ada_variant_discrim_name (var_type
);
6233 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6238 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6239 within a value of type OUTER_TYPE that is stored in GDB at
6240 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6241 numbering from 0) is applicable. Returns -1 if none are. */
6244 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6245 const gdb_byte
*outer_valaddr
)
6249 char *discrim_name
= ada_variant_discrim_name (var_type
);
6250 struct value
*outer
;
6251 struct value
*discrim
;
6252 LONGEST discrim_val
;
6254 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6255 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6256 if (discrim
== NULL
)
6258 discrim_val
= value_as_long (discrim
);
6261 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6263 if (ada_is_others_clause (var_type
, i
))
6265 else if (ada_in_variant (discrim_val
, var_type
, i
))
6269 return others_clause
;
6274 /* Dynamic-Sized Records */
6276 /* Strategy: The type ostensibly attached to a value with dynamic size
6277 (i.e., a size that is not statically recorded in the debugging
6278 data) does not accurately reflect the size or layout of the value.
6279 Our strategy is to convert these values to values with accurate,
6280 conventional types that are constructed on the fly. */
6282 /* There is a subtle and tricky problem here. In general, we cannot
6283 determine the size of dynamic records without its data. However,
6284 the 'struct value' data structure, which GDB uses to represent
6285 quantities in the inferior process (the target), requires the size
6286 of the type at the time of its allocation in order to reserve space
6287 for GDB's internal copy of the data. That's why the
6288 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6289 rather than struct value*s.
6291 However, GDB's internal history variables ($1, $2, etc.) are
6292 struct value*s containing internal copies of the data that are not, in
6293 general, the same as the data at their corresponding addresses in
6294 the target. Fortunately, the types we give to these values are all
6295 conventional, fixed-size types (as per the strategy described
6296 above), so that we don't usually have to perform the
6297 'to_fixed_xxx_type' conversions to look at their values.
6298 Unfortunately, there is one exception: if one of the internal
6299 history variables is an array whose elements are unconstrained
6300 records, then we will need to create distinct fixed types for each
6301 element selected. */
6303 /* The upshot of all of this is that many routines take a (type, host
6304 address, target address) triple as arguments to represent a value.
6305 The host address, if non-null, is supposed to contain an internal
6306 copy of the relevant data; otherwise, the program is to consult the
6307 target at the target address. */
6309 /* Assuming that VAL0 represents a pointer value, the result of
6310 dereferencing it. Differs from value_ind in its treatment of
6311 dynamic-sized types. */
6314 ada_value_ind (struct value
*val0
)
6316 struct value
*val
= unwrap_value (value_ind (val0
));
6317 return ada_to_fixed_value (val
);
6320 /* The value resulting from dereferencing any "reference to"
6321 qualifiers on VAL0. */
6323 static struct value
*
6324 ada_coerce_ref (struct value
*val0
)
6326 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6328 struct value
*val
= val0
;
6329 val
= coerce_ref (val
);
6330 val
= unwrap_value (val
);
6331 return ada_to_fixed_value (val
);
6337 /* Return OFF rounded upward if necessary to a multiple of
6338 ALIGNMENT (a power of 2). */
6341 align_value (unsigned int off
, unsigned int alignment
)
6343 return (off
+ alignment
- 1) & ~(alignment
- 1);
6346 /* Return the bit alignment required for field #F of template type TYPE. */
6349 field_alignment (struct type
*type
, int f
)
6351 const char *name
= TYPE_FIELD_NAME (type
, f
);
6355 /* The field name should never be null, unless the debugging information
6356 is somehow malformed. In this case, we assume the field does not
6357 require any alignment. */
6361 len
= strlen (name
);
6363 if (!isdigit (name
[len
- 1]))
6366 if (isdigit (name
[len
- 2]))
6367 align_offset
= len
- 2;
6369 align_offset
= len
- 1;
6371 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6372 return TARGET_CHAR_BIT
;
6374 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6377 /* Find a symbol named NAME. Ignores ambiguity. */
6380 ada_find_any_symbol (const char *name
)
6384 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6385 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6388 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6392 /* Find a type named NAME. Ignores ambiguity. This routine will look
6393 solely for types defined by debug info, it will not search the GDB
6397 ada_find_any_type (const char *name
)
6399 struct symbol
*sym
= ada_find_any_symbol (name
);
6402 return SYMBOL_TYPE (sym
);
6407 /* Given NAME and an associated BLOCK, search all symbols for
6408 NAME suffixed with "___XR", which is the ``renaming'' symbol
6409 associated to NAME. Return this symbol if found, return
6413 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6417 sym
= find_old_style_renaming_symbol (name
, block
);
6422 /* Not right yet. FIXME pnh 7/20/2007. */
6423 sym
= ada_find_any_symbol (name
);
6424 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6430 static struct symbol
*
6431 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6433 const struct symbol
*function_sym
= block_linkage_function (block
);
6436 if (function_sym
!= NULL
)
6438 /* If the symbol is defined inside a function, NAME is not fully
6439 qualified. This means we need to prepend the function name
6440 as well as adding the ``___XR'' suffix to build the name of
6441 the associated renaming symbol. */
6442 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6443 /* Function names sometimes contain suffixes used
6444 for instance to qualify nested subprograms. When building
6445 the XR type name, we need to make sure that this suffix is
6446 not included. So do not include any suffix in the function
6447 name length below. */
6448 int function_name_len
= ada_name_prefix_len (function_name
);
6449 const int rename_len
= function_name_len
+ 2 /* "__" */
6450 + strlen (name
) + 6 /* "___XR\0" */ ;
6452 /* Strip the suffix if necessary. */
6453 ada_remove_trailing_digits (function_name
, &function_name_len
);
6454 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
6455 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
6457 /* Library-level functions are a special case, as GNAT adds
6458 a ``_ada_'' prefix to the function name to avoid namespace
6459 pollution. However, the renaming symbols themselves do not
6460 have this prefix, so we need to skip this prefix if present. */
6461 if (function_name_len
> 5 /* "_ada_" */
6462 && strstr (function_name
, "_ada_") == function_name
)
6465 function_name_len
-= 5;
6468 rename
= (char *) alloca (rename_len
* sizeof (char));
6469 strncpy (rename
, function_name
, function_name_len
);
6470 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
6475 const int rename_len
= strlen (name
) + 6;
6476 rename
= (char *) alloca (rename_len
* sizeof (char));
6477 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6480 return ada_find_any_symbol (rename
);
6483 /* Because of GNAT encoding conventions, several GDB symbols may match a
6484 given type name. If the type denoted by TYPE0 is to be preferred to
6485 that of TYPE1 for purposes of type printing, return non-zero;
6486 otherwise return 0. */
6489 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6493 else if (type0
== NULL
)
6495 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6497 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6499 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6501 else if (ada_is_constrained_packed_array_type (type0
))
6503 else if (ada_is_array_descriptor_type (type0
)
6504 && !ada_is_array_descriptor_type (type1
))
6508 const char *type0_name
= type_name_no_tag (type0
);
6509 const char *type1_name
= type_name_no_tag (type1
);
6511 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6512 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6518 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6519 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6522 ada_type_name (struct type
*type
)
6526 else if (TYPE_NAME (type
) != NULL
)
6527 return TYPE_NAME (type
);
6529 return TYPE_TAG_NAME (type
);
6532 /* Search the list of "descriptive" types associated to TYPE for a type
6533 whose name is NAME. */
6535 static struct type
*
6536 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
6538 struct type
*result
;
6540 /* If there no descriptive-type info, then there is no parallel type
6542 if (!HAVE_GNAT_AUX_INFO (type
))
6545 result
= TYPE_DESCRIPTIVE_TYPE (type
);
6546 while (result
!= NULL
)
6548 char *result_name
= ada_type_name (result
);
6550 if (result_name
== NULL
)
6552 warning (_("unexpected null name on descriptive type"));
6556 /* If the names match, stop. */
6557 if (strcmp (result_name
, name
) == 0)
6560 /* Otherwise, look at the next item on the list, if any. */
6561 if (HAVE_GNAT_AUX_INFO (result
))
6562 result
= TYPE_DESCRIPTIVE_TYPE (result
);
6567 /* If we didn't find a match, see whether this is a packed array. With
6568 older compilers, the descriptive type information is either absent or
6569 irrelevant when it comes to packed arrays so the above lookup fails.
6570 Fall back to using a parallel lookup by name in this case. */
6571 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
6572 return ada_find_any_type (name
);
6577 /* Find a parallel type to TYPE with the specified NAME, using the
6578 descriptive type taken from the debugging information, if available,
6579 and otherwise using the (slower) name-based method. */
6581 static struct type
*
6582 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
6584 struct type
*result
= NULL
;
6586 if (HAVE_GNAT_AUX_INFO (type
))
6587 result
= find_parallel_type_by_descriptive_type (type
, name
);
6589 result
= ada_find_any_type (name
);
6594 /* Same as above, but specify the name of the parallel type by appending
6595 SUFFIX to the name of TYPE. */
6598 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6600 char *name
, *typename
= ada_type_name (type
);
6603 if (typename
== NULL
)
6606 len
= strlen (typename
);
6608 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
6610 strcpy (name
, typename
);
6611 strcpy (name
+ len
, suffix
);
6613 return ada_find_parallel_type_with_name (type
, name
);
6616 /* If TYPE is a variable-size record type, return the corresponding template
6617 type describing its fields. Otherwise, return NULL. */
6619 static struct type
*
6620 dynamic_template_type (struct type
*type
)
6622 type
= ada_check_typedef (type
);
6624 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6625 || ada_type_name (type
) == NULL
)
6629 int len
= strlen (ada_type_name (type
));
6630 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6633 return ada_find_parallel_type (type
, "___XVE");
6637 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6638 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6641 is_dynamic_field (struct type
*templ_type
, int field_num
)
6643 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6645 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6646 && strstr (name
, "___XVL") != NULL
;
6649 /* The index of the variant field of TYPE, or -1 if TYPE does not
6650 represent a variant record type. */
6653 variant_field_index (struct type
*type
)
6657 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6660 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6662 if (ada_is_variant_part (type
, f
))
6668 /* A record type with no fields. */
6670 static struct type
*
6671 empty_record (struct type
*template)
6673 struct type
*type
= alloc_type_copy (template);
6674 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6675 TYPE_NFIELDS (type
) = 0;
6676 TYPE_FIELDS (type
) = NULL
;
6677 INIT_CPLUS_SPECIFIC (type
);
6678 TYPE_NAME (type
) = "<empty>";
6679 TYPE_TAG_NAME (type
) = NULL
;
6680 TYPE_LENGTH (type
) = 0;
6684 /* An ordinary record type (with fixed-length fields) that describes
6685 the value of type TYPE at VALADDR or ADDRESS (see comments at
6686 the beginning of this section) VAL according to GNAT conventions.
6687 DVAL0 should describe the (portion of a) record that contains any
6688 necessary discriminants. It should be NULL if value_type (VAL) is
6689 an outer-level type (i.e., as opposed to a branch of a variant.) A
6690 variant field (unless unchecked) is replaced by a particular branch
6693 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6694 length are not statically known are discarded. As a consequence,
6695 VALADDR, ADDRESS and DVAL0 are ignored.
6697 NOTE: Limitations: For now, we assume that dynamic fields and
6698 variants occupy whole numbers of bytes. However, they need not be
6702 ada_template_to_fixed_record_type_1 (struct type
*type
,
6703 const gdb_byte
*valaddr
,
6704 CORE_ADDR address
, struct value
*dval0
,
6705 int keep_dynamic_fields
)
6707 struct value
*mark
= value_mark ();
6710 int nfields
, bit_len
;
6713 int fld_bit_len
, bit_incr
;
6716 /* Compute the number of fields in this record type that are going
6717 to be processed: unless keep_dynamic_fields, this includes only
6718 fields whose position and length are static will be processed. */
6719 if (keep_dynamic_fields
)
6720 nfields
= TYPE_NFIELDS (type
);
6724 while (nfields
< TYPE_NFIELDS (type
)
6725 && !ada_is_variant_part (type
, nfields
)
6726 && !is_dynamic_field (type
, nfields
))
6730 rtype
= alloc_type_copy (type
);
6731 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6732 INIT_CPLUS_SPECIFIC (rtype
);
6733 TYPE_NFIELDS (rtype
) = nfields
;
6734 TYPE_FIELDS (rtype
) = (struct field
*)
6735 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6736 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6737 TYPE_NAME (rtype
) = ada_type_name (type
);
6738 TYPE_TAG_NAME (rtype
) = NULL
;
6739 TYPE_FIXED_INSTANCE (rtype
) = 1;
6745 for (f
= 0; f
< nfields
; f
+= 1)
6747 off
= align_value (off
, field_alignment (type
, f
))
6748 + TYPE_FIELD_BITPOS (type
, f
);
6749 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6750 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6752 if (ada_is_variant_part (type
, f
))
6755 fld_bit_len
= bit_incr
= 0;
6757 else if (is_dynamic_field (type
, f
))
6759 const gdb_byte
*field_valaddr
= valaddr
;
6760 CORE_ADDR field_address
= address
;
6761 struct type
*field_type
=
6762 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
6766 /* rtype's length is computed based on the run-time
6767 value of discriminants. If the discriminants are not
6768 initialized, the type size may be completely bogus and
6769 GDB may fail to allocate a value for it. So check the
6770 size first before creating the value. */
6772 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6777 /* If the type referenced by this field is an aligner type, we need
6778 to unwrap that aligner type, because its size might not be set.
6779 Keeping the aligner type would cause us to compute the wrong
6780 size for this field, impacting the offset of the all the fields
6781 that follow this one. */
6782 if (ada_is_aligner_type (field_type
))
6784 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
6786 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
6787 field_address
= cond_offset_target (field_address
, field_offset
);
6788 field_type
= ada_aligned_type (field_type
);
6791 field_valaddr
= cond_offset_host (field_valaddr
,
6792 off
/ TARGET_CHAR_BIT
);
6793 field_address
= cond_offset_target (field_address
,
6794 off
/ TARGET_CHAR_BIT
);
6796 /* Get the fixed type of the field. Note that, in this case,
6797 we do not want to get the real type out of the tag: if
6798 the current field is the parent part of a tagged record,
6799 we will get the tag of the object. Clearly wrong: the real
6800 type of the parent is not the real type of the child. We
6801 would end up in an infinite loop. */
6802 field_type
= ada_get_base_type (field_type
);
6803 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
6804 field_address
, dval
, 0);
6806 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
6807 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6808 bit_incr
= fld_bit_len
=
6809 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6813 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
6815 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
6816 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6817 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6818 bit_incr
= fld_bit_len
=
6819 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6821 bit_incr
= fld_bit_len
=
6822 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
6824 if (off
+ fld_bit_len
> bit_len
)
6825 bit_len
= off
+ fld_bit_len
;
6827 TYPE_LENGTH (rtype
) =
6828 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6831 /* We handle the variant part, if any, at the end because of certain
6832 odd cases in which it is re-ordered so as NOT to be the last field of
6833 the record. This can happen in the presence of representation
6835 if (variant_field
>= 0)
6837 struct type
*branch_type
;
6839 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6842 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6847 to_fixed_variant_branch_type
6848 (TYPE_FIELD_TYPE (type
, variant_field
),
6849 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6850 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6851 if (branch_type
== NULL
)
6853 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6854 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6855 TYPE_NFIELDS (rtype
) -= 1;
6859 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6860 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6862 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6864 if (off
+ fld_bit_len
> bit_len
)
6865 bit_len
= off
+ fld_bit_len
;
6866 TYPE_LENGTH (rtype
) =
6867 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6871 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6872 should contain the alignment of that record, which should be a strictly
6873 positive value. If null or negative, then something is wrong, most
6874 probably in the debug info. In that case, we don't round up the size
6875 of the resulting type. If this record is not part of another structure,
6876 the current RTYPE length might be good enough for our purposes. */
6877 if (TYPE_LENGTH (type
) <= 0)
6879 if (TYPE_NAME (rtype
))
6880 warning (_("Invalid type size for `%s' detected: %d."),
6881 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6883 warning (_("Invalid type size for <unnamed> detected: %d."),
6884 TYPE_LENGTH (type
));
6888 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6889 TYPE_LENGTH (type
));
6892 value_free_to_mark (mark
);
6893 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6894 error (_("record type with dynamic size is larger than varsize-limit"));
6898 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6901 static struct type
*
6902 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6903 CORE_ADDR address
, struct value
*dval0
)
6905 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6909 /* An ordinary record type in which ___XVL-convention fields and
6910 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6911 static approximations, containing all possible fields. Uses
6912 no runtime values. Useless for use in values, but that's OK,
6913 since the results are used only for type determinations. Works on both
6914 structs and unions. Representation note: to save space, we memorize
6915 the result of this function in the TYPE_TARGET_TYPE of the
6918 static struct type
*
6919 template_to_static_fixed_type (struct type
*type0
)
6925 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6926 return TYPE_TARGET_TYPE (type0
);
6928 nfields
= TYPE_NFIELDS (type0
);
6931 for (f
= 0; f
< nfields
; f
+= 1)
6933 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6934 struct type
*new_type
;
6936 if (is_dynamic_field (type0
, f
))
6937 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6939 new_type
= static_unwrap_type (field_type
);
6940 if (type
== type0
&& new_type
!= field_type
)
6942 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
6943 TYPE_CODE (type
) = TYPE_CODE (type0
);
6944 INIT_CPLUS_SPECIFIC (type
);
6945 TYPE_NFIELDS (type
) = nfields
;
6946 TYPE_FIELDS (type
) = (struct field
*)
6947 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6948 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6949 sizeof (struct field
) * nfields
);
6950 TYPE_NAME (type
) = ada_type_name (type0
);
6951 TYPE_TAG_NAME (type
) = NULL
;
6952 TYPE_FIXED_INSTANCE (type
) = 1;
6953 TYPE_LENGTH (type
) = 0;
6955 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6956 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6961 /* Given an object of type TYPE whose contents are at VALADDR and
6962 whose address in memory is ADDRESS, returns a revision of TYPE,
6963 which should be a non-dynamic-sized record, in which the variant
6964 part, if any, is replaced with the appropriate branch. Looks
6965 for discriminant values in DVAL0, which can be NULL if the record
6966 contains the necessary discriminant values. */
6968 static struct type
*
6969 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6970 CORE_ADDR address
, struct value
*dval0
)
6972 struct value
*mark
= value_mark ();
6975 struct type
*branch_type
;
6976 int nfields
= TYPE_NFIELDS (type
);
6977 int variant_field
= variant_field_index (type
);
6979 if (variant_field
== -1)
6983 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6987 rtype
= alloc_type_copy (type
);
6988 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6989 INIT_CPLUS_SPECIFIC (rtype
);
6990 TYPE_NFIELDS (rtype
) = nfields
;
6991 TYPE_FIELDS (rtype
) =
6992 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6993 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6994 sizeof (struct field
) * nfields
);
6995 TYPE_NAME (rtype
) = ada_type_name (type
);
6996 TYPE_TAG_NAME (rtype
) = NULL
;
6997 TYPE_FIXED_INSTANCE (rtype
) = 1;
6998 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7000 branch_type
= to_fixed_variant_branch_type
7001 (TYPE_FIELD_TYPE (type
, variant_field
),
7002 cond_offset_host (valaddr
,
7003 TYPE_FIELD_BITPOS (type
, variant_field
)
7005 cond_offset_target (address
,
7006 TYPE_FIELD_BITPOS (type
, variant_field
)
7007 / TARGET_CHAR_BIT
), dval
);
7008 if (branch_type
== NULL
)
7011 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7012 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7013 TYPE_NFIELDS (rtype
) -= 1;
7017 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7018 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7019 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7020 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7022 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7024 value_free_to_mark (mark
);
7028 /* An ordinary record type (with fixed-length fields) that describes
7029 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7030 beginning of this section]. Any necessary discriminants' values
7031 should be in DVAL, a record value; it may be NULL if the object
7032 at ADDR itself contains any necessary discriminant values.
7033 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7034 values from the record are needed. Except in the case that DVAL,
7035 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7036 unchecked) is replaced by a particular branch of the variant.
7038 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7039 is questionable and may be removed. It can arise during the
7040 processing of an unconstrained-array-of-record type where all the
7041 variant branches have exactly the same size. This is because in
7042 such cases, the compiler does not bother to use the XVS convention
7043 when encoding the record. I am currently dubious of this
7044 shortcut and suspect the compiler should be altered. FIXME. */
7046 static struct type
*
7047 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7048 CORE_ADDR address
, struct value
*dval
)
7050 struct type
*templ_type
;
7052 if (TYPE_FIXED_INSTANCE (type0
))
7055 templ_type
= dynamic_template_type (type0
);
7057 if (templ_type
!= NULL
)
7058 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7059 else if (variant_field_index (type0
) >= 0)
7061 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7063 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7068 TYPE_FIXED_INSTANCE (type0
) = 1;
7074 /* An ordinary record type (with fixed-length fields) that describes
7075 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7076 union type. Any necessary discriminants' values should be in DVAL,
7077 a record value. That is, this routine selects the appropriate
7078 branch of the union at ADDR according to the discriminant value
7079 indicated in the union's type name. Returns VAR_TYPE0 itself if
7080 it represents a variant subject to a pragma Unchecked_Union. */
7082 static struct type
*
7083 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7084 CORE_ADDR address
, struct value
*dval
)
7087 struct type
*templ_type
;
7088 struct type
*var_type
;
7090 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7091 var_type
= TYPE_TARGET_TYPE (var_type0
);
7093 var_type
= var_type0
;
7095 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7097 if (templ_type
!= NULL
)
7098 var_type
= templ_type
;
7100 if (is_unchecked_variant (var_type
, value_type (dval
)))
7103 ada_which_variant_applies (var_type
,
7104 value_type (dval
), value_contents (dval
));
7107 return empty_record (var_type
);
7108 else if (is_dynamic_field (var_type
, which
))
7109 return to_fixed_record_type
7110 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7111 valaddr
, address
, dval
);
7112 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7114 to_fixed_record_type
7115 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7117 return TYPE_FIELD_TYPE (var_type
, which
);
7120 /* Assuming that TYPE0 is an array type describing the type of a value
7121 at ADDR, and that DVAL describes a record containing any
7122 discriminants used in TYPE0, returns a type for the value that
7123 contains no dynamic components (that is, no components whose sizes
7124 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7125 true, gives an error message if the resulting type's size is over
7128 static struct type
*
7129 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7132 struct type
*index_type_desc
;
7133 struct type
*result
;
7134 int constrained_packed_array_p
;
7136 if (TYPE_FIXED_INSTANCE (type0
))
7139 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7140 if (constrained_packed_array_p
)
7141 type0
= decode_constrained_packed_array_type (type0
);
7143 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7144 if (index_type_desc
== NULL
)
7146 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7147 /* NOTE: elt_type---the fixed version of elt_type0---should never
7148 depend on the contents of the array in properly constructed
7150 /* Create a fixed version of the array element type.
7151 We're not providing the address of an element here,
7152 and thus the actual object value cannot be inspected to do
7153 the conversion. This should not be a problem, since arrays of
7154 unconstrained objects are not allowed. In particular, all
7155 the elements of an array of a tagged type should all be of
7156 the same type specified in the debugging info. No need to
7157 consult the object tag. */
7158 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7160 /* Make sure we always create a new array type when dealing with
7161 packed array types, since we're going to fix-up the array
7162 type length and element bitsize a little further down. */
7163 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7166 result
= create_array_type (alloc_type_copy (type0
),
7167 elt_type
, TYPE_INDEX_TYPE (type0
));
7172 struct type
*elt_type0
;
7175 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7176 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7178 /* NOTE: result---the fixed version of elt_type0---should never
7179 depend on the contents of the array in properly constructed
7181 /* Create a fixed version of the array element type.
7182 We're not providing the address of an element here,
7183 and thus the actual object value cannot be inspected to do
7184 the conversion. This should not be a problem, since arrays of
7185 unconstrained objects are not allowed. In particular, all
7186 the elements of an array of a tagged type should all be of
7187 the same type specified in the debugging info. No need to
7188 consult the object tag. */
7190 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7193 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7195 struct type
*range_type
=
7196 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7197 dval
, TYPE_INDEX_TYPE (elt_type0
));
7198 result
= create_array_type (alloc_type_copy (elt_type0
),
7199 result
, range_type
);
7200 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7202 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7203 error (_("array type with dynamic size is larger than varsize-limit"));
7206 if (constrained_packed_array_p
)
7208 /* So far, the resulting type has been created as if the original
7209 type was a regular (non-packed) array type. As a result, the
7210 bitsize of the array elements needs to be set again, and the array
7211 length needs to be recomputed based on that bitsize. */
7212 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7213 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7215 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7216 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7217 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7218 TYPE_LENGTH (result
)++;
7221 TYPE_FIXED_INSTANCE (result
) = 1;
7226 /* A standard type (containing no dynamically sized components)
7227 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7228 DVAL describes a record containing any discriminants used in TYPE0,
7229 and may be NULL if there are none, or if the object of type TYPE at
7230 ADDRESS or in VALADDR contains these discriminants.
7232 If CHECK_TAG is not null, in the case of tagged types, this function
7233 attempts to locate the object's tag and use it to compute the actual
7234 type. However, when ADDRESS is null, we cannot use it to determine the
7235 location of the tag, and therefore compute the tagged type's actual type.
7236 So we return the tagged type without consulting the tag. */
7238 static struct type
*
7239 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7240 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7242 type
= ada_check_typedef (type
);
7243 switch (TYPE_CODE (type
))
7247 case TYPE_CODE_STRUCT
:
7249 struct type
*static_type
= to_static_fixed_type (type
);
7250 struct type
*fixed_record_type
=
7251 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7252 /* If STATIC_TYPE is a tagged type and we know the object's address,
7253 then we can determine its tag, and compute the object's actual
7254 type from there. Note that we have to use the fixed record
7255 type (the parent part of the record may have dynamic fields
7256 and the way the location of _tag is expressed may depend on
7259 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7261 struct type
*real_type
=
7262 type_from_tag (value_tag_from_contents_and_address
7266 if (real_type
!= NULL
)
7267 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7270 /* Check to see if there is a parallel ___XVZ variable.
7271 If there is, then it provides the actual size of our type. */
7272 else if (ada_type_name (fixed_record_type
) != NULL
)
7274 char *name
= ada_type_name (fixed_record_type
);
7275 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7279 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7280 size
= get_int_var_value (xvz_name
, &xvz_found
);
7281 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7283 fixed_record_type
= copy_type (fixed_record_type
);
7284 TYPE_LENGTH (fixed_record_type
) = size
;
7286 /* The FIXED_RECORD_TYPE may have be a stub. We have
7287 observed this when the debugging info is STABS, and
7288 apparently it is something that is hard to fix.
7290 In practice, we don't need the actual type definition
7291 at all, because the presence of the XVZ variable allows us
7292 to assume that there must be a XVS type as well, which we
7293 should be able to use later, when we need the actual type
7296 In the meantime, pretend that the "fixed" type we are
7297 returning is NOT a stub, because this can cause trouble
7298 when using this type to create new types targeting it.
7299 Indeed, the associated creation routines often check
7300 whether the target type is a stub and will try to replace
7301 it, thus using a type with the wrong size. This, in turn,
7302 might cause the new type to have the wrong size too.
7303 Consider the case of an array, for instance, where the size
7304 of the array is computed from the number of elements in
7305 our array multiplied by the size of its element. */
7306 TYPE_STUB (fixed_record_type
) = 0;
7309 return fixed_record_type
;
7311 case TYPE_CODE_ARRAY
:
7312 return to_fixed_array_type (type
, dval
, 1);
7313 case TYPE_CODE_UNION
:
7317 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7321 /* The same as ada_to_fixed_type_1, except that it preserves the type
7322 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7323 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7326 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7327 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7330 struct type
*fixed_type
=
7331 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7333 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7334 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7340 /* A standard (static-sized) type corresponding as well as possible to
7341 TYPE0, but based on no runtime data. */
7343 static struct type
*
7344 to_static_fixed_type (struct type
*type0
)
7351 if (TYPE_FIXED_INSTANCE (type0
))
7354 type0
= ada_check_typedef (type0
);
7356 switch (TYPE_CODE (type0
))
7360 case TYPE_CODE_STRUCT
:
7361 type
= dynamic_template_type (type0
);
7363 return template_to_static_fixed_type (type
);
7365 return template_to_static_fixed_type (type0
);
7366 case TYPE_CODE_UNION
:
7367 type
= ada_find_parallel_type (type0
, "___XVU");
7369 return template_to_static_fixed_type (type
);
7371 return template_to_static_fixed_type (type0
);
7375 /* A static approximation of TYPE with all type wrappers removed. */
7377 static struct type
*
7378 static_unwrap_type (struct type
*type
)
7380 if (ada_is_aligner_type (type
))
7382 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7383 if (ada_type_name (type1
) == NULL
)
7384 TYPE_NAME (type1
) = ada_type_name (type
);
7386 return static_unwrap_type (type1
);
7390 struct type
*raw_real_type
= ada_get_base_type (type
);
7391 if (raw_real_type
== type
)
7394 return to_static_fixed_type (raw_real_type
);
7398 /* In some cases, incomplete and private types require
7399 cross-references that are not resolved as records (for example,
7401 type FooP is access Foo;
7403 type Foo is array ...;
7404 ). In these cases, since there is no mechanism for producing
7405 cross-references to such types, we instead substitute for FooP a
7406 stub enumeration type that is nowhere resolved, and whose tag is
7407 the name of the actual type. Call these types "non-record stubs". */
7409 /* A type equivalent to TYPE that is not a non-record stub, if one
7410 exists, otherwise TYPE. */
7413 ada_check_typedef (struct type
*type
)
7418 CHECK_TYPEDEF (type
);
7419 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7420 || !TYPE_STUB (type
)
7421 || TYPE_TAG_NAME (type
) == NULL
)
7425 char *name
= TYPE_TAG_NAME (type
);
7426 struct type
*type1
= ada_find_any_type (name
);
7427 return (type1
== NULL
) ? type
: type1
;
7431 /* A value representing the data at VALADDR/ADDRESS as described by
7432 type TYPE0, but with a standard (static-sized) type that correctly
7433 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7434 type, then return VAL0 [this feature is simply to avoid redundant
7435 creation of struct values]. */
7437 static struct value
*
7438 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7441 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7442 if (type
== type0
&& val0
!= NULL
)
7445 return value_from_contents_and_address (type
, 0, address
);
7448 /* A value representing VAL, but with a standard (static-sized) type
7449 that correctly describes it. Does not necessarily create a new
7452 static struct value
*
7453 ada_to_fixed_value (struct value
*val
)
7455 return ada_to_fixed_value_create (value_type (val
),
7456 value_address (val
),
7463 /* Table mapping attribute numbers to names.
7464 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7466 static const char *attribute_names
[] = {
7484 ada_attribute_name (enum exp_opcode n
)
7486 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7487 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7489 return attribute_names
[0];
7492 /* Evaluate the 'POS attribute applied to ARG. */
7495 pos_atr (struct value
*arg
)
7497 struct value
*val
= coerce_ref (arg
);
7498 struct type
*type
= value_type (val
);
7500 if (!discrete_type_p (type
))
7501 error (_("'POS only defined on discrete types"));
7503 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7506 LONGEST v
= value_as_long (val
);
7508 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7510 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7513 error (_("enumeration value is invalid: can't find 'POS"));
7516 return value_as_long (val
);
7519 static struct value
*
7520 value_pos_atr (struct type
*type
, struct value
*arg
)
7522 return value_from_longest (type
, pos_atr (arg
));
7525 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7527 static struct value
*
7528 value_val_atr (struct type
*type
, struct value
*arg
)
7530 if (!discrete_type_p (type
))
7531 error (_("'VAL only defined on discrete types"));
7532 if (!integer_type_p (value_type (arg
)))
7533 error (_("'VAL requires integral argument"));
7535 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7537 long pos
= value_as_long (arg
);
7538 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7539 error (_("argument to 'VAL out of range"));
7540 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7543 return value_from_longest (type
, value_as_long (arg
));
7549 /* True if TYPE appears to be an Ada character type.
7550 [At the moment, this is true only for Character and Wide_Character;
7551 It is a heuristic test that could stand improvement]. */
7554 ada_is_character_type (struct type
*type
)
7558 /* If the type code says it's a character, then assume it really is,
7559 and don't check any further. */
7560 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7563 /* Otherwise, assume it's a character type iff it is a discrete type
7564 with a known character type name. */
7565 name
= ada_type_name (type
);
7566 return (name
!= NULL
7567 && (TYPE_CODE (type
) == TYPE_CODE_INT
7568 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7569 && (strcmp (name
, "character") == 0
7570 || strcmp (name
, "wide_character") == 0
7571 || strcmp (name
, "wide_wide_character") == 0
7572 || strcmp (name
, "unsigned char") == 0));
7575 /* True if TYPE appears to be an Ada string type. */
7578 ada_is_string_type (struct type
*type
)
7580 type
= ada_check_typedef (type
);
7582 && TYPE_CODE (type
) != TYPE_CODE_PTR
7583 && (ada_is_simple_array_type (type
)
7584 || ada_is_array_descriptor_type (type
))
7585 && ada_array_arity (type
) == 1)
7587 struct type
*elttype
= ada_array_element_type (type
, 1);
7589 return ada_is_character_type (elttype
);
7595 /* The compiler sometimes provides a parallel XVS type for a given
7596 PAD type. Normally, it is safe to follow the PAD type directly,
7597 but older versions of the compiler have a bug that causes the offset
7598 of its "F" field to be wrong. Following that field in that case
7599 would lead to incorrect results, but this can be worked around
7600 by ignoring the PAD type and using the associated XVS type instead.
7602 Set to True if the debugger should trust the contents of PAD types.
7603 Otherwise, ignore the PAD type if there is a parallel XVS type. */
7604 static int trust_pad_over_xvs
= 1;
7606 /* True if TYPE is a struct type introduced by the compiler to force the
7607 alignment of a value. Such types have a single field with a
7608 distinctive name. */
7611 ada_is_aligner_type (struct type
*type
)
7613 type
= ada_check_typedef (type
);
7615 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
7618 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7619 && TYPE_NFIELDS (type
) == 1
7620 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7623 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7624 the parallel type. */
7627 ada_get_base_type (struct type
*raw_type
)
7629 struct type
*real_type_namer
;
7630 struct type
*raw_real_type
;
7632 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7635 if (ada_is_aligner_type (raw_type
))
7636 /* The encoding specifies that we should always use the aligner type.
7637 So, even if this aligner type has an associated XVS type, we should
7640 According to the compiler gurus, an XVS type parallel to an aligner
7641 type may exist because of a stabs limitation. In stabs, aligner
7642 types are empty because the field has a variable-sized type, and
7643 thus cannot actually be used as an aligner type. As a result,
7644 we need the associated parallel XVS type to decode the type.
7645 Since the policy in the compiler is to not change the internal
7646 representation based on the debugging info format, we sometimes
7647 end up having a redundant XVS type parallel to the aligner type. */
7650 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7651 if (real_type_namer
== NULL
7652 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7653 || TYPE_NFIELDS (real_type_namer
) != 1)
7656 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
7658 /* This is an older encoding form where the base type needs to be
7659 looked up by name. We prefer the newer enconding because it is
7661 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7662 if (raw_real_type
== NULL
)
7665 return raw_real_type
;
7668 /* The field in our XVS type is a reference to the base type. */
7669 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
7672 /* The type of value designated by TYPE, with all aligners removed. */
7675 ada_aligned_type (struct type
*type
)
7677 if (ada_is_aligner_type (type
))
7678 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7680 return ada_get_base_type (type
);
7684 /* The address of the aligned value in an object at address VALADDR
7685 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7688 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7690 if (ada_is_aligner_type (type
))
7691 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7693 TYPE_FIELD_BITPOS (type
,
7694 0) / TARGET_CHAR_BIT
);
7701 /* The printed representation of an enumeration literal with encoded
7702 name NAME. The value is good to the next call of ada_enum_name. */
7704 ada_enum_name (const char *name
)
7706 static char *result
;
7707 static size_t result_len
= 0;
7710 /* First, unqualify the enumeration name:
7711 1. Search for the last '.' character. If we find one, then skip
7712 all the preceeding characters, the unqualified name starts
7713 right after that dot.
7714 2. Otherwise, we may be debugging on a target where the compiler
7715 translates dots into "__". Search forward for double underscores,
7716 but stop searching when we hit an overloading suffix, which is
7717 of the form "__" followed by digits. */
7719 tmp
= strrchr (name
, '.');
7724 while ((tmp
= strstr (name
, "__")) != NULL
)
7726 if (isdigit (tmp
[2]))
7736 if (name
[1] == 'U' || name
[1] == 'W')
7738 if (sscanf (name
+ 2, "%x", &v
) != 1)
7744 GROW_VECT (result
, result_len
, 16);
7745 if (isascii (v
) && isprint (v
))
7746 xsnprintf (result
, result_len
, "'%c'", v
);
7747 else if (name
[1] == 'U')
7748 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
7750 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
7756 tmp
= strstr (name
, "__");
7758 tmp
= strstr (name
, "$");
7761 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7762 strncpy (result
, name
, tmp
- name
);
7763 result
[tmp
- name
] = '\0';
7771 /* Evaluate the subexpression of EXP starting at *POS as for
7772 evaluate_type, updating *POS to point just past the evaluated
7775 static struct value
*
7776 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7778 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7781 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7784 static struct value
*
7785 unwrap_value (struct value
*val
)
7787 struct type
*type
= ada_check_typedef (value_type (val
));
7788 if (ada_is_aligner_type (type
))
7790 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7791 struct type
*val_type
= ada_check_typedef (value_type (v
));
7792 if (ada_type_name (val_type
) == NULL
)
7793 TYPE_NAME (val_type
) = ada_type_name (type
);
7795 return unwrap_value (v
);
7799 struct type
*raw_real_type
=
7800 ada_check_typedef (ada_get_base_type (type
));
7802 /* If there is no parallel XVS or XVE type, then the value is
7803 already unwrapped. Return it without further modification. */
7804 if ((type
== raw_real_type
)
7805 && ada_find_parallel_type (type
, "___XVE") == NULL
)
7809 coerce_unspec_val_to_type
7810 (val
, ada_to_fixed_type (raw_real_type
, 0,
7811 value_address (val
),
7816 static struct value
*
7817 cast_to_fixed (struct type
*type
, struct value
*arg
)
7821 if (type
== value_type (arg
))
7823 else if (ada_is_fixed_point_type (value_type (arg
)))
7824 val
= ada_float_to_fixed (type
,
7825 ada_fixed_to_float (value_type (arg
),
7826 value_as_long (arg
)));
7829 DOUBLEST argd
= value_as_double (arg
);
7830 val
= ada_float_to_fixed (type
, argd
);
7833 return value_from_longest (type
, val
);
7836 static struct value
*
7837 cast_from_fixed (struct type
*type
, struct value
*arg
)
7839 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7840 value_as_long (arg
));
7841 return value_from_double (type
, val
);
7844 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7845 return the converted value. */
7847 static struct value
*
7848 coerce_for_assign (struct type
*type
, struct value
*val
)
7850 struct type
*type2
= value_type (val
);
7854 type2
= ada_check_typedef (type2
);
7855 type
= ada_check_typedef (type
);
7857 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7858 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7860 val
= ada_value_ind (val
);
7861 type2
= value_type (val
);
7864 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7865 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7867 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7868 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7869 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7870 error (_("Incompatible types in assignment"));
7871 deprecated_set_value_type (val
, type
);
7876 static struct value
*
7877 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7880 struct type
*type1
, *type2
;
7883 arg1
= coerce_ref (arg1
);
7884 arg2
= coerce_ref (arg2
);
7885 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7886 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7888 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7889 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7890 return value_binop (arg1
, arg2
, op
);
7899 return value_binop (arg1
, arg2
, op
);
7902 v2
= value_as_long (arg2
);
7904 error (_("second operand of %s must not be zero."), op_string (op
));
7906 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7907 return value_binop (arg1
, arg2
, op
);
7909 v1
= value_as_long (arg1
);
7914 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7915 v
+= v
> 0 ? -1 : 1;
7923 /* Should not reach this point. */
7927 val
= allocate_value (type1
);
7928 store_unsigned_integer (value_contents_raw (val
),
7929 TYPE_LENGTH (value_type (val
)),
7930 gdbarch_byte_order (get_type_arch (type1
)), v
);
7935 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7937 if (ada_is_direct_array_type (value_type (arg1
))
7938 || ada_is_direct_array_type (value_type (arg2
)))
7940 /* Automatically dereference any array reference before
7941 we attempt to perform the comparison. */
7942 arg1
= ada_coerce_ref (arg1
);
7943 arg2
= ada_coerce_ref (arg2
);
7945 arg1
= ada_coerce_to_simple_array (arg1
);
7946 arg2
= ada_coerce_to_simple_array (arg2
);
7947 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7948 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7949 error (_("Attempt to compare array with non-array"));
7950 /* FIXME: The following works only for types whose
7951 representations use all bits (no padding or undefined bits)
7952 and do not have user-defined equality. */
7954 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7955 && memcmp (value_contents (arg1
), value_contents (arg2
),
7956 TYPE_LENGTH (value_type (arg1
))) == 0;
7958 return value_equal (arg1
, arg2
);
7961 /* Total number of component associations in the aggregate starting at
7962 index PC in EXP. Assumes that index PC is the start of an
7966 num_component_specs (struct expression
*exp
, int pc
)
7969 m
= exp
->elts
[pc
+ 1].longconst
;
7972 for (i
= 0; i
< m
; i
+= 1)
7974 switch (exp
->elts
[pc
].opcode
)
7980 n
+= exp
->elts
[pc
+ 1].longconst
;
7983 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7988 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7989 component of LHS (a simple array or a record), updating *POS past
7990 the expression, assuming that LHS is contained in CONTAINER. Does
7991 not modify the inferior's memory, nor does it modify LHS (unless
7992 LHS == CONTAINER). */
7995 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7996 struct expression
*exp
, int *pos
)
7998 struct value
*mark
= value_mark ();
8000 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8002 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8003 struct value
*index_val
= value_from_longest (index_type
, index
);
8004 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8008 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8009 elt
= ada_to_fixed_value (unwrap_value (elt
));
8012 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8013 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8015 value_assign_to_component (container
, elt
,
8016 ada_evaluate_subexp (NULL
, exp
, pos
,
8019 value_free_to_mark (mark
);
8022 /* Assuming that LHS represents an lvalue having a record or array
8023 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8024 of that aggregate's value to LHS, advancing *POS past the
8025 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8026 lvalue containing LHS (possibly LHS itself). Does not modify
8027 the inferior's memory, nor does it modify the contents of
8028 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8030 static struct value
*
8031 assign_aggregate (struct value
*container
,
8032 struct value
*lhs
, struct expression
*exp
,
8033 int *pos
, enum noside noside
)
8035 struct type
*lhs_type
;
8036 int n
= exp
->elts
[*pos
+1].longconst
;
8037 LONGEST low_index
, high_index
;
8040 int max_indices
, num_indices
;
8041 int is_array_aggregate
;
8043 struct value
*mark
= value_mark ();
8046 if (noside
!= EVAL_NORMAL
)
8049 for (i
= 0; i
< n
; i
+= 1)
8050 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8054 container
= ada_coerce_ref (container
);
8055 if (ada_is_direct_array_type (value_type (container
)))
8056 container
= ada_coerce_to_simple_array (container
);
8057 lhs
= ada_coerce_ref (lhs
);
8058 if (!deprecated_value_modifiable (lhs
))
8059 error (_("Left operand of assignment is not a modifiable lvalue."));
8061 lhs_type
= value_type (lhs
);
8062 if (ada_is_direct_array_type (lhs_type
))
8064 lhs
= ada_coerce_to_simple_array (lhs
);
8065 lhs_type
= value_type (lhs
);
8066 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8067 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8068 is_array_aggregate
= 1;
8070 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8073 high_index
= num_visible_fields (lhs_type
) - 1;
8074 is_array_aggregate
= 0;
8077 error (_("Left-hand side must be array or record."));
8079 num_specs
= num_component_specs (exp
, *pos
- 3);
8080 max_indices
= 4 * num_specs
+ 4;
8081 indices
= alloca (max_indices
* sizeof (indices
[0]));
8082 indices
[0] = indices
[1] = low_index
- 1;
8083 indices
[2] = indices
[3] = high_index
+ 1;
8086 for (i
= 0; i
< n
; i
+= 1)
8088 switch (exp
->elts
[*pos
].opcode
)
8091 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8092 &num_indices
, max_indices
,
8093 low_index
, high_index
);
8096 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8097 &num_indices
, max_indices
,
8098 low_index
, high_index
);
8102 error (_("Misplaced 'others' clause"));
8103 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8104 num_indices
, low_index
, high_index
);
8107 error (_("Internal error: bad aggregate clause"));
8114 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8115 construct at *POS, updating *POS past the construct, given that
8116 the positions are relative to lower bound LOW, where HIGH is the
8117 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8118 updating *NUM_INDICES as needed. CONTAINER is as for
8119 assign_aggregate. */
8121 aggregate_assign_positional (struct value
*container
,
8122 struct value
*lhs
, struct expression
*exp
,
8123 int *pos
, LONGEST
*indices
, int *num_indices
,
8124 int max_indices
, LONGEST low
, LONGEST high
)
8126 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8128 if (ind
- 1 == high
)
8129 warning (_("Extra components in aggregate ignored."));
8132 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8134 assign_component (container
, lhs
, ind
, exp
, pos
);
8137 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8140 /* Assign into the components of LHS indexed by the OP_CHOICES
8141 construct at *POS, updating *POS past the construct, given that
8142 the allowable indices are LOW..HIGH. Record the indices assigned
8143 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8144 needed. CONTAINER is as for assign_aggregate. */
8146 aggregate_assign_from_choices (struct value
*container
,
8147 struct value
*lhs
, struct expression
*exp
,
8148 int *pos
, LONGEST
*indices
, int *num_indices
,
8149 int max_indices
, LONGEST low
, LONGEST high
)
8152 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8153 int choice_pos
, expr_pc
;
8154 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8156 choice_pos
= *pos
+= 3;
8158 for (j
= 0; j
< n_choices
; j
+= 1)
8159 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8161 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8163 for (j
= 0; j
< n_choices
; j
+= 1)
8165 LONGEST lower
, upper
;
8166 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8167 if (op
== OP_DISCRETE_RANGE
)
8170 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8172 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8177 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8188 name
= &exp
->elts
[choice_pos
+ 2].string
;
8191 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8194 error (_("Invalid record component association."));
8196 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8198 if (! find_struct_field (name
, value_type (lhs
), 0,
8199 NULL
, NULL
, NULL
, NULL
, &ind
))
8200 error (_("Unknown component name: %s."), name
);
8201 lower
= upper
= ind
;
8204 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8205 error (_("Index in component association out of bounds."));
8207 add_component_interval (lower
, upper
, indices
, num_indices
,
8209 while (lower
<= upper
)
8213 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8219 /* Assign the value of the expression in the OP_OTHERS construct in
8220 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8221 have not been previously assigned. The index intervals already assigned
8222 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8223 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8225 aggregate_assign_others (struct value
*container
,
8226 struct value
*lhs
, struct expression
*exp
,
8227 int *pos
, LONGEST
*indices
, int num_indices
,
8228 LONGEST low
, LONGEST high
)
8231 int expr_pc
= *pos
+1;
8233 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8236 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8240 assign_component (container
, lhs
, ind
, exp
, &pos
);
8243 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8246 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8247 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8248 modifying *SIZE as needed. It is an error if *SIZE exceeds
8249 MAX_SIZE. The resulting intervals do not overlap. */
8251 add_component_interval (LONGEST low
, LONGEST high
,
8252 LONGEST
* indices
, int *size
, int max_size
)
8255 for (i
= 0; i
< *size
; i
+= 2) {
8256 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8259 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8260 if (high
< indices
[kh
])
8262 if (low
< indices
[i
])
8264 indices
[i
+ 1] = indices
[kh
- 1];
8265 if (high
> indices
[i
+ 1])
8266 indices
[i
+ 1] = high
;
8267 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8268 *size
-= kh
- i
- 2;
8271 else if (high
< indices
[i
])
8275 if (*size
== max_size
)
8276 error (_("Internal error: miscounted aggregate components."));
8278 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8279 indices
[j
] = indices
[j
- 2];
8281 indices
[i
+ 1] = high
;
8284 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8287 static struct value
*
8288 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8290 if (type
== ada_check_typedef (value_type (arg2
)))
8293 if (ada_is_fixed_point_type (type
))
8294 return (cast_to_fixed (type
, arg2
));
8296 if (ada_is_fixed_point_type (value_type (arg2
)))
8297 return cast_from_fixed (type
, arg2
);
8299 return value_cast (type
, arg2
);
8302 /* Evaluating Ada expressions, and printing their result.
8303 ------------------------------------------------------
8308 We usually evaluate an Ada expression in order to print its value.
8309 We also evaluate an expression in order to print its type, which
8310 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8311 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8312 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8313 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8316 Evaluating expressions is a little more complicated for Ada entities
8317 than it is for entities in languages such as C. The main reason for
8318 this is that Ada provides types whose definition might be dynamic.
8319 One example of such types is variant records. Or another example
8320 would be an array whose bounds can only be known at run time.
8322 The following description is a general guide as to what should be
8323 done (and what should NOT be done) in order to evaluate an expression
8324 involving such types, and when. This does not cover how the semantic
8325 information is encoded by GNAT as this is covered separatly. For the
8326 document used as the reference for the GNAT encoding, see exp_dbug.ads
8327 in the GNAT sources.
8329 Ideally, we should embed each part of this description next to its
8330 associated code. Unfortunately, the amount of code is so vast right
8331 now that it's hard to see whether the code handling a particular
8332 situation might be duplicated or not. One day, when the code is
8333 cleaned up, this guide might become redundant with the comments
8334 inserted in the code, and we might want to remove it.
8336 2. ``Fixing'' an Entity, the Simple Case:
8337 -----------------------------------------
8339 When evaluating Ada expressions, the tricky issue is that they may
8340 reference entities whose type contents and size are not statically
8341 known. Consider for instance a variant record:
8343 type Rec (Empty : Boolean := True) is record
8346 when False => Value : Integer;
8349 Yes : Rec := (Empty => False, Value => 1);
8350 No : Rec := (empty => True);
8352 The size and contents of that record depends on the value of the
8353 descriminant (Rec.Empty). At this point, neither the debugging
8354 information nor the associated type structure in GDB are able to
8355 express such dynamic types. So what the debugger does is to create
8356 "fixed" versions of the type that applies to the specific object.
8357 We also informally refer to this opperation as "fixing" an object,
8358 which means creating its associated fixed type.
8360 Example: when printing the value of variable "Yes" above, its fixed
8361 type would look like this:
8368 On the other hand, if we printed the value of "No", its fixed type
8375 Things become a little more complicated when trying to fix an entity
8376 with a dynamic type that directly contains another dynamic type,
8377 such as an array of variant records, for instance. There are
8378 two possible cases: Arrays, and records.
8380 3. ``Fixing'' Arrays:
8381 ---------------------
8383 The type structure in GDB describes an array in terms of its bounds,
8384 and the type of its elements. By design, all elements in the array
8385 have the same type and we cannot represent an array of variant elements
8386 using the current type structure in GDB. When fixing an array,
8387 we cannot fix the array element, as we would potentially need one
8388 fixed type per element of the array. As a result, the best we can do
8389 when fixing an array is to produce an array whose bounds and size
8390 are correct (allowing us to read it from memory), but without having
8391 touched its element type. Fixing each element will be done later,
8392 when (if) necessary.
8394 Arrays are a little simpler to handle than records, because the same
8395 amount of memory is allocated for each element of the array, even if
8396 the amount of space actually used by each element differs from element
8397 to element. Consider for instance the following array of type Rec:
8399 type Rec_Array is array (1 .. 2) of Rec;
8401 The actual amount of memory occupied by each element might be different
8402 from element to element, depending on the value of their discriminant.
8403 But the amount of space reserved for each element in the array remains
8404 fixed regardless. So we simply need to compute that size using
8405 the debugging information available, from which we can then determine
8406 the array size (we multiply the number of elements of the array by
8407 the size of each element).
8409 The simplest case is when we have an array of a constrained element
8410 type. For instance, consider the following type declarations:
8412 type Bounded_String (Max_Size : Integer) is
8414 Buffer : String (1 .. Max_Size);
8416 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
8418 In this case, the compiler describes the array as an array of
8419 variable-size elements (identified by its XVS suffix) for which
8420 the size can be read in the parallel XVZ variable.
8422 In the case of an array of an unconstrained element type, the compiler
8423 wraps the array element inside a private PAD type. This type should not
8424 be shown to the user, and must be "unwrap"'ed before printing. Note
8425 that we also use the adjective "aligner" in our code to designate
8426 these wrapper types.
8428 In some cases, the size allocated for each element is statically
8429 known. In that case, the PAD type already has the correct size,
8430 and the array element should remain unfixed.
8432 But there are cases when this size is not statically known.
8433 For instance, assuming that "Five" is an integer variable:
8435 type Dynamic is array (1 .. Five) of Integer;
8436 type Wrapper (Has_Length : Boolean := False) is record
8439 when True => Length : Integer;
8443 type Wrapper_Array is array (1 .. 2) of Wrapper;
8445 Hello : Wrapper_Array := (others => (Has_Length => True,
8446 Data => (others => 17),
8450 The debugging info would describe variable Hello as being an
8451 array of a PAD type. The size of that PAD type is not statically
8452 known, but can be determined using a parallel XVZ variable.
8453 In that case, a copy of the PAD type with the correct size should
8454 be used for the fixed array.
8456 3. ``Fixing'' record type objects:
8457 ----------------------------------
8459 Things are slightly different from arrays in the case of dynamic
8460 record types. In this case, in order to compute the associated
8461 fixed type, we need to determine the size and offset of each of
8462 its components. This, in turn, requires us to compute the fixed
8463 type of each of these components.
8465 Consider for instance the example:
8467 type Bounded_String (Max_Size : Natural) is record
8468 Str : String (1 .. Max_Size);
8471 My_String : Bounded_String (Max_Size => 10);
8473 In that case, the position of field "Length" depends on the size
8474 of field Str, which itself depends on the value of the Max_Size
8475 discriminant. In order to fix the type of variable My_String,
8476 we need to fix the type of field Str. Therefore, fixing a variant
8477 record requires us to fix each of its components.
8479 However, if a component does not have a dynamic size, the component
8480 should not be fixed. In particular, fields that use a PAD type
8481 should not fixed. Here is an example where this might happen
8482 (assuming type Rec above):
8484 type Container (Big : Boolean) is record
8488 when True => Another : Integer;
8492 My_Container : Container := (Big => False,
8493 First => (Empty => True),
8496 In that example, the compiler creates a PAD type for component First,
8497 whose size is constant, and then positions the component After just
8498 right after it. The offset of component After is therefore constant
8501 The debugger computes the position of each field based on an algorithm
8502 that uses, among other things, the actual position and size of the field
8503 preceding it. Let's now imagine that the user is trying to print
8504 the value of My_Container. If the type fixing was recursive, we would
8505 end up computing the offset of field After based on the size of the
8506 fixed version of field First. And since in our example First has
8507 only one actual field, the size of the fixed type is actually smaller
8508 than the amount of space allocated to that field, and thus we would
8509 compute the wrong offset of field After.
8511 To make things more complicated, we need to watch out for dynamic
8512 components of variant records (identified by the ___XVL suffix in
8513 the component name). Even if the target type is a PAD type, the size
8514 of that type might not be statically known. So the PAD type needs
8515 to be unwrapped and the resulting type needs to be fixed. Otherwise,
8516 we might end up with the wrong size for our component. This can be
8517 observed with the following type declarations:
8519 type Octal is new Integer range 0 .. 7;
8520 type Octal_Array is array (Positive range <>) of Octal;
8521 pragma Pack (Octal_Array);
8523 type Octal_Buffer (Size : Positive) is record
8524 Buffer : Octal_Array (1 .. Size);
8528 In that case, Buffer is a PAD type whose size is unset and needs
8529 to be computed by fixing the unwrapped type.
8531 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
8532 ----------------------------------------------------------
8534 Lastly, when should the sub-elements of an entity that remained unfixed
8535 thus far, be actually fixed?
8537 The answer is: Only when referencing that element. For instance
8538 when selecting one component of a record, this specific component
8539 should be fixed at that point in time. Or when printing the value
8540 of a record, each component should be fixed before its value gets
8541 printed. Similarly for arrays, the element of the array should be
8542 fixed when printing each element of the array, or when extracting
8543 one element out of that array. On the other hand, fixing should
8544 not be performed on the elements when taking a slice of an array!
8546 Note that one of the side-effects of miscomputing the offset and
8547 size of each field is that we end up also miscomputing the size
8548 of the containing type. This can have adverse results when computing
8549 the value of an entity. GDB fetches the value of an entity based
8550 on the size of its type, and thus a wrong size causes GDB to fetch
8551 the wrong amount of memory. In the case where the computed size is
8552 too small, GDB fetches too little data to print the value of our
8553 entiry. Results in this case as unpredicatble, as we usually read
8554 past the buffer containing the data =:-o. */
8556 /* Implement the evaluate_exp routine in the exp_descriptor structure
8557 for the Ada language. */
8559 static struct value
*
8560 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8561 int *pos
, enum noside noside
)
8564 int tem
, tem2
, tem3
;
8566 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8569 struct value
**argvec
;
8573 op
= exp
->elts
[pc
].opcode
;
8579 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8580 arg1
= unwrap_value (arg1
);
8582 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8583 then we need to perform the conversion manually, because
8584 evaluate_subexp_standard doesn't do it. This conversion is
8585 necessary in Ada because the different kinds of float/fixed
8586 types in Ada have different representations.
8588 Similarly, we need to perform the conversion from OP_LONG
8590 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8591 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8597 struct value
*result
;
8599 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8600 /* The result type will have code OP_STRING, bashed there from
8601 OP_ARRAY. Bash it back. */
8602 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8603 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8609 type
= exp
->elts
[pc
+ 1].type
;
8610 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8611 if (noside
== EVAL_SKIP
)
8613 arg1
= ada_value_cast (type
, arg1
, noside
);
8618 type
= exp
->elts
[pc
+ 1].type
;
8619 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8622 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8623 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8625 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8626 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8628 return ada_value_assign (arg1
, arg1
);
8630 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8631 except if the lhs of our assignment is a convenience variable.
8632 In the case of assigning to a convenience variable, the lhs
8633 should be exactly the result of the evaluation of the rhs. */
8634 type
= value_type (arg1
);
8635 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8637 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8638 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8640 if (ada_is_fixed_point_type (value_type (arg1
)))
8641 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8642 else if (ada_is_fixed_point_type (value_type (arg2
)))
8644 (_("Fixed-point values must be assigned to fixed-point variables"));
8646 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8647 return ada_value_assign (arg1
, arg2
);
8650 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8651 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8652 if (noside
== EVAL_SKIP
)
8654 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8655 return (value_from_longest
8657 value_as_long (arg1
) + value_as_long (arg2
)));
8658 if ((ada_is_fixed_point_type (value_type (arg1
))
8659 || ada_is_fixed_point_type (value_type (arg2
)))
8660 && value_type (arg1
) != value_type (arg2
))
8661 error (_("Operands of fixed-point addition must have the same type"));
8662 /* Do the addition, and cast the result to the type of the first
8663 argument. We cannot cast the result to a reference type, so if
8664 ARG1 is a reference type, find its underlying type. */
8665 type
= value_type (arg1
);
8666 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8667 type
= TYPE_TARGET_TYPE (type
);
8668 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8669 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8672 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8673 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8674 if (noside
== EVAL_SKIP
)
8676 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8677 return (value_from_longest
8679 value_as_long (arg1
) - value_as_long (arg2
)));
8680 if ((ada_is_fixed_point_type (value_type (arg1
))
8681 || ada_is_fixed_point_type (value_type (arg2
)))
8682 && value_type (arg1
) != value_type (arg2
))
8683 error (_("Operands of fixed-point subtraction must have the same type"));
8684 /* Do the substraction, and cast the result to the type of the first
8685 argument. We cannot cast the result to a reference type, so if
8686 ARG1 is a reference type, find its underlying type. */
8687 type
= value_type (arg1
);
8688 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8689 type
= TYPE_TARGET_TYPE (type
);
8690 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8691 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8697 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8698 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8699 if (noside
== EVAL_SKIP
)
8701 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8703 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8704 return value_zero (value_type (arg1
), not_lval
);
8708 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8709 if (ada_is_fixed_point_type (value_type (arg1
)))
8710 arg1
= cast_from_fixed (type
, arg1
);
8711 if (ada_is_fixed_point_type (value_type (arg2
)))
8712 arg2
= cast_from_fixed (type
, arg2
);
8713 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8714 return ada_value_binop (arg1
, arg2
, op
);
8718 case BINOP_NOTEQUAL
:
8719 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8720 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8721 if (noside
== EVAL_SKIP
)
8723 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8727 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8728 tem
= ada_value_equal (arg1
, arg2
);
8730 if (op
== BINOP_NOTEQUAL
)
8732 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8733 return value_from_longest (type
, (LONGEST
) tem
);
8736 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8737 if (noside
== EVAL_SKIP
)
8739 else if (ada_is_fixed_point_type (value_type (arg1
)))
8740 return value_cast (value_type (arg1
), value_neg (arg1
));
8743 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8744 return value_neg (arg1
);
8747 case BINOP_LOGICAL_AND
:
8748 case BINOP_LOGICAL_OR
:
8749 case UNOP_LOGICAL_NOT
:
8754 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8755 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8756 return value_cast (type
, val
);
8759 case BINOP_BITWISE_AND
:
8760 case BINOP_BITWISE_IOR
:
8761 case BINOP_BITWISE_XOR
:
8765 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8767 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8769 return value_cast (value_type (arg1
), val
);
8775 if (noside
== EVAL_SKIP
)
8780 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8781 /* Only encountered when an unresolved symbol occurs in a
8782 context other than a function call, in which case, it is
8784 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8785 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8786 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8788 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8789 /* Check to see if this is a tagged type. We also need to handle
8790 the case where the type is a reference to a tagged type, but
8791 we have to be careful to exclude pointers to tagged types.
8792 The latter should be shown as usual (as a pointer), whereas
8793 a reference should mostly be transparent to the user. */
8794 if (ada_is_tagged_type (type
, 0)
8795 || (TYPE_CODE(type
) == TYPE_CODE_REF
8796 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
8798 /* Tagged types are a little special in the fact that the real
8799 type is dynamic and can only be determined by inspecting the
8800 object's tag. This means that we need to get the object's
8801 value first (EVAL_NORMAL) and then extract the actual object
8804 Note that we cannot skip the final step where we extract
8805 the object type from its tag, because the EVAL_NORMAL phase
8806 results in dynamic components being resolved into fixed ones.
8807 This can cause problems when trying to print the type
8808 description of tagged types whose parent has a dynamic size:
8809 We use the type name of the "_parent" component in order
8810 to print the name of the ancestor type in the type description.
8811 If that component had a dynamic size, the resolution into
8812 a fixed type would result in the loss of that type name,
8813 thus preventing us from printing the name of the ancestor
8814 type in the type description. */
8815 struct type
*actual_type
;
8817 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8818 actual_type
= type_from_tag (ada_value_tag (arg1
));
8819 if (actual_type
== NULL
)
8820 /* If, for some reason, we were unable to determine
8821 the actual type from the tag, then use the static
8822 approximation that we just computed as a fallback.
8823 This can happen if the debugging information is
8824 incomplete, for instance. */
8827 return value_zero (actual_type
, not_lval
);
8832 (to_static_fixed_type
8833 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8838 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8839 arg1
= unwrap_value (arg1
);
8840 return ada_to_fixed_value (arg1
);
8846 /* Allocate arg vector, including space for the function to be
8847 called in argvec[0] and a terminating NULL. */
8848 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8850 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8852 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8853 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8854 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8855 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8858 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8859 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8862 if (noside
== EVAL_SKIP
)
8866 if (ada_is_constrained_packed_array_type
8867 (desc_base_type (value_type (argvec
[0]))))
8868 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8869 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8870 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
8871 /* This is a packed array that has already been fixed, and
8872 therefore already coerced to a simple array. Nothing further
8875 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8876 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8877 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8878 argvec
[0] = value_addr (argvec
[0]);
8880 type
= ada_check_typedef (value_type (argvec
[0]));
8881 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8883 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8885 case TYPE_CODE_FUNC
:
8886 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8888 case TYPE_CODE_ARRAY
:
8890 case TYPE_CODE_STRUCT
:
8891 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8892 argvec
[0] = ada_value_ind (argvec
[0]);
8893 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8896 error (_("cannot subscript or call something of type `%s'"),
8897 ada_type_name (value_type (argvec
[0])));
8902 switch (TYPE_CODE (type
))
8904 case TYPE_CODE_FUNC
:
8905 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8906 return allocate_value (TYPE_TARGET_TYPE (type
));
8907 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8908 case TYPE_CODE_STRUCT
:
8912 arity
= ada_array_arity (type
);
8913 type
= ada_array_element_type (type
, nargs
);
8915 error (_("cannot subscript or call a record"));
8917 error (_("wrong number of subscripts; expecting %d"), arity
);
8918 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8919 return value_zero (ada_aligned_type (type
), lval_memory
);
8921 unwrap_value (ada_value_subscript
8922 (argvec
[0], nargs
, argvec
+ 1));
8924 case TYPE_CODE_ARRAY
:
8925 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8927 type
= ada_array_element_type (type
, nargs
);
8929 error (_("element type of array unknown"));
8931 return value_zero (ada_aligned_type (type
), lval_memory
);
8934 unwrap_value (ada_value_subscript
8935 (ada_coerce_to_simple_array (argvec
[0]),
8936 nargs
, argvec
+ 1));
8937 case TYPE_CODE_PTR
: /* Pointer to array */
8938 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8939 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8941 type
= ada_array_element_type (type
, nargs
);
8943 error (_("element type of array unknown"));
8945 return value_zero (ada_aligned_type (type
), lval_memory
);
8948 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8949 nargs
, argvec
+ 1));
8952 error (_("Attempt to index or call something other than an "
8953 "array or function"));
8958 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8959 struct value
*low_bound_val
=
8960 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8961 struct value
*high_bound_val
=
8962 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8965 low_bound_val
= coerce_ref (low_bound_val
);
8966 high_bound_val
= coerce_ref (high_bound_val
);
8967 low_bound
= pos_atr (low_bound_val
);
8968 high_bound
= pos_atr (high_bound_val
);
8970 if (noside
== EVAL_SKIP
)
8973 /* If this is a reference to an aligner type, then remove all
8975 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8976 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8977 TYPE_TARGET_TYPE (value_type (array
)) =
8978 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8980 if (ada_is_constrained_packed_array_type (value_type (array
)))
8981 error (_("cannot slice a packed array"));
8983 /* If this is a reference to an array or an array lvalue,
8984 convert to a pointer. */
8985 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8986 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8987 && VALUE_LVAL (array
) == lval_memory
))
8988 array
= value_addr (array
);
8990 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8991 && ada_is_array_descriptor_type (ada_check_typedef
8992 (value_type (array
))))
8993 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8995 array
= ada_coerce_to_simple_array_ptr (array
);
8997 /* If we have more than one level of pointer indirection,
8998 dereference the value until we get only one level. */
8999 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9000 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9002 array
= value_ind (array
);
9004 /* Make sure we really do have an array type before going further,
9005 to avoid a SEGV when trying to get the index type or the target
9006 type later down the road if the debug info generated by
9007 the compiler is incorrect or incomplete. */
9008 if (!ada_is_simple_array_type (value_type (array
)))
9009 error (_("cannot take slice of non-array"));
9011 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
9013 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9014 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
9018 struct type
*arr_type0
=
9019 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
9021 return ada_value_slice_from_ptr (array
, arr_type0
,
9022 longest_to_int (low_bound
),
9023 longest_to_int (high_bound
));
9026 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9028 else if (high_bound
< low_bound
)
9029 return empty_array (value_type (array
), low_bound
);
9031 return ada_value_slice (array
, longest_to_int (low_bound
),
9032 longest_to_int (high_bound
));
9037 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9038 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9040 if (noside
== EVAL_SKIP
)
9043 switch (TYPE_CODE (type
))
9046 lim_warning (_("Membership test incompletely implemented; "
9047 "always returns true"));
9048 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9049 return value_from_longest (type
, (LONGEST
) 1);
9051 case TYPE_CODE_RANGE
:
9052 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9053 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9054 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9055 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9056 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9058 value_from_longest (type
,
9059 (value_less (arg1
, arg3
)
9060 || value_equal (arg1
, arg3
))
9061 && (value_less (arg2
, arg1
)
9062 || value_equal (arg2
, arg1
)));
9065 case BINOP_IN_BOUNDS
:
9067 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9068 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9070 if (noside
== EVAL_SKIP
)
9073 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9075 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9076 return value_zero (type
, not_lval
);
9079 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9081 type
= ada_index_type (value_type (arg2
), tem
, "range");
9083 type
= value_type (arg1
);
9085 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9086 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9088 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9089 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9090 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9092 value_from_longest (type
,
9093 (value_less (arg1
, arg3
)
9094 || value_equal (arg1
, arg3
))
9095 && (value_less (arg2
, arg1
)
9096 || value_equal (arg2
, arg1
)));
9098 case TERNOP_IN_RANGE
:
9099 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9100 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9101 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9103 if (noside
== EVAL_SKIP
)
9106 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9107 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9108 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9110 value_from_longest (type
,
9111 (value_less (arg1
, arg3
)
9112 || value_equal (arg1
, arg3
))
9113 && (value_less (arg2
, arg1
)
9114 || value_equal (arg2
, arg1
)));
9120 struct type
*type_arg
;
9121 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9123 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9125 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9129 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9133 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9134 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9135 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9138 if (noside
== EVAL_SKIP
)
9141 if (type_arg
== NULL
)
9143 arg1
= ada_coerce_ref (arg1
);
9145 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9146 arg1
= ada_coerce_to_simple_array (arg1
);
9148 type
= ada_index_type (value_type (arg1
), tem
,
9149 ada_attribute_name (op
));
9151 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9153 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9154 return allocate_value (type
);
9158 default: /* Should never happen. */
9159 error (_("unexpected attribute encountered"));
9161 return value_from_longest
9162 (type
, ada_array_bound (arg1
, tem
, 0));
9164 return value_from_longest
9165 (type
, ada_array_bound (arg1
, tem
, 1));
9167 return value_from_longest
9168 (type
, ada_array_length (arg1
, tem
));
9171 else if (discrete_type_p (type_arg
))
9173 struct type
*range_type
;
9174 char *name
= ada_type_name (type_arg
);
9176 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9177 range_type
= to_fixed_range_type (name
, NULL
, type_arg
);
9178 if (range_type
== NULL
)
9179 range_type
= type_arg
;
9183 error (_("unexpected attribute encountered"));
9185 return value_from_longest
9186 (range_type
, ada_discrete_type_low_bound (range_type
));
9188 return value_from_longest
9189 (range_type
, ada_discrete_type_high_bound (range_type
));
9191 error (_("the 'length attribute applies only to array types"));
9194 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9195 error (_("unimplemented type attribute"));
9200 if (ada_is_constrained_packed_array_type (type_arg
))
9201 type_arg
= decode_constrained_packed_array_type (type_arg
);
9203 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
9205 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9207 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9208 return allocate_value (type
);
9213 error (_("unexpected attribute encountered"));
9215 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9216 return value_from_longest (type
, low
);
9218 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9219 return value_from_longest (type
, high
);
9221 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9222 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9223 return value_from_longest (type
, high
- low
+ 1);
9229 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9230 if (noside
== EVAL_SKIP
)
9233 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9234 return value_zero (ada_tag_type (arg1
), not_lval
);
9236 return ada_value_tag (arg1
);
9240 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9241 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9242 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9243 if (noside
== EVAL_SKIP
)
9245 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9246 return value_zero (value_type (arg1
), not_lval
);
9249 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9250 return value_binop (arg1
, arg2
,
9251 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9254 case OP_ATR_MODULUS
:
9256 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9257 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9259 if (noside
== EVAL_SKIP
)
9262 if (!ada_is_modular_type (type_arg
))
9263 error (_("'modulus must be applied to modular type"));
9265 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9266 ada_modulus (type_arg
));
9271 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9272 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9273 if (noside
== EVAL_SKIP
)
9275 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9276 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9277 return value_zero (type
, not_lval
);
9279 return value_pos_atr (type
, arg1
);
9282 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9283 type
= value_type (arg1
);
9285 /* If the argument is a reference, then dereference its type, since
9286 the user is really asking for the size of the actual object,
9287 not the size of the pointer. */
9288 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9289 type
= TYPE_TARGET_TYPE (type
);
9291 if (noside
== EVAL_SKIP
)
9293 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9294 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
9296 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
9297 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9300 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9301 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9302 type
= exp
->elts
[pc
+ 2].type
;
9303 if (noside
== EVAL_SKIP
)
9305 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9306 return value_zero (type
, not_lval
);
9308 return value_val_atr (type
, arg1
);
9311 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9312 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9313 if (noside
== EVAL_SKIP
)
9315 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9316 return value_zero (value_type (arg1
), not_lval
);
9319 /* For integer exponentiation operations,
9320 only promote the first argument. */
9321 if (is_integral_type (value_type (arg2
)))
9322 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9324 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9326 return value_binop (arg1
, arg2
, op
);
9330 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9331 if (noside
== EVAL_SKIP
)
9337 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9338 if (noside
== EVAL_SKIP
)
9340 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9341 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9342 return value_neg (arg1
);
9347 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9348 if (noside
== EVAL_SKIP
)
9350 type
= ada_check_typedef (value_type (arg1
));
9351 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9353 if (ada_is_array_descriptor_type (type
))
9354 /* GDB allows dereferencing GNAT array descriptors. */
9356 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9357 if (arrType
== NULL
)
9358 error (_("Attempt to dereference null array pointer."));
9359 return value_at_lazy (arrType
, 0);
9361 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9362 || TYPE_CODE (type
) == TYPE_CODE_REF
9363 /* In C you can dereference an array to get the 1st elt. */
9364 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9366 type
= to_static_fixed_type
9368 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9370 return value_zero (type
, lval_memory
);
9372 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9374 /* GDB allows dereferencing an int. */
9375 if (expect_type
== NULL
)
9376 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9381 to_static_fixed_type (ada_aligned_type (expect_type
));
9382 return value_zero (expect_type
, lval_memory
);
9386 error (_("Attempt to take contents of a non-pointer value."));
9388 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9389 type
= ada_check_typedef (value_type (arg1
));
9391 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9392 /* GDB allows dereferencing an int. If we were given
9393 the expect_type, then use that as the target type.
9394 Otherwise, assume that the target type is an int. */
9396 if (expect_type
!= NULL
)
9397 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9400 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9401 (CORE_ADDR
) value_as_address (arg1
));
9404 if (ada_is_array_descriptor_type (type
))
9405 /* GDB allows dereferencing GNAT array descriptors. */
9406 return ada_coerce_to_simple_array (arg1
);
9408 return ada_value_ind (arg1
);
9410 case STRUCTOP_STRUCT
:
9411 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9412 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9413 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9414 if (noside
== EVAL_SKIP
)
9416 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9418 struct type
*type1
= value_type (arg1
);
9419 if (ada_is_tagged_type (type1
, 1))
9421 type
= ada_lookup_struct_elt_type (type1
,
9422 &exp
->elts
[pc
+ 2].string
,
9425 /* In this case, we assume that the field COULD exist
9426 in some extension of the type. Return an object of
9427 "type" void, which will match any formal
9428 (see ada_type_match). */
9429 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
9434 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9437 return value_zero (ada_aligned_type (type
), lval_memory
);
9440 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
9441 arg1
= unwrap_value (arg1
);
9442 return ada_to_fixed_value (arg1
);
9445 /* The value is not supposed to be used. This is here to make it
9446 easier to accommodate expressions that contain types. */
9448 if (noside
== EVAL_SKIP
)
9450 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9451 return allocate_value (exp
->elts
[pc
+ 1].type
);
9453 error (_("Attempt to use a type name as an expression"));
9458 case OP_DISCRETE_RANGE
:
9461 if (noside
== EVAL_NORMAL
)
9465 error (_("Undefined name, ambiguous name, or renaming used in "
9466 "component association: %s."), &exp
->elts
[pc
+2].string
);
9468 error (_("Aggregates only allowed on the right of an assignment"));
9470 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9473 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9475 for (tem
= 0; tem
< nargs
; tem
+= 1)
9476 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9481 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
9487 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9488 type name that encodes the 'small and 'delta information.
9489 Otherwise, return NULL. */
9492 fixed_type_info (struct type
*type
)
9494 const char *name
= ada_type_name (type
);
9495 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9497 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9499 const char *tail
= strstr (name
, "___XF_");
9505 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9506 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9511 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9514 ada_is_fixed_point_type (struct type
*type
)
9516 return fixed_type_info (type
) != NULL
;
9519 /* Return non-zero iff TYPE represents a System.Address type. */
9522 ada_is_system_address_type (struct type
*type
)
9524 return (TYPE_NAME (type
)
9525 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9528 /* Assuming that TYPE is the representation of an Ada fixed-point
9529 type, return its delta, or -1 if the type is malformed and the
9530 delta cannot be determined. */
9533 ada_delta (struct type
*type
)
9535 const char *encoding
= fixed_type_info (type
);
9538 /* Strictly speaking, num and den are encoded as integer. However,
9539 they may not fit into a long, and they will have to be converted
9540 to DOUBLEST anyway. So scan them as DOUBLEST. */
9541 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9548 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9549 factor ('SMALL value) associated with the type. */
9552 scaling_factor (struct type
*type
)
9554 const char *encoding
= fixed_type_info (type
);
9555 DOUBLEST num0
, den0
, num1
, den1
;
9558 /* Strictly speaking, num's and den's are encoded as integer. However,
9559 they may not fit into a long, and they will have to be converted
9560 to DOUBLEST anyway. So scan them as DOUBLEST. */
9561 n
= sscanf (encoding
,
9562 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9563 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9564 &num0
, &den0
, &num1
, &den1
);
9575 /* Assuming that X is the representation of a value of fixed-point
9576 type TYPE, return its floating-point equivalent. */
9579 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9581 return (DOUBLEST
) x
*scaling_factor (type
);
9584 /* The representation of a fixed-point value of type TYPE
9585 corresponding to the value X. */
9588 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9590 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9597 /* Scan STR beginning at position K for a discriminant name, and
9598 return the value of that discriminant field of DVAL in *PX. If
9599 PNEW_K is not null, put the position of the character beyond the
9600 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9601 not alter *PX and *PNEW_K if unsuccessful. */
9604 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9607 static char *bound_buffer
= NULL
;
9608 static size_t bound_buffer_len
= 0;
9611 struct value
*bound_val
;
9613 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9616 pend
= strstr (str
+ k
, "__");
9620 k
+= strlen (bound
);
9624 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9625 bound
= bound_buffer
;
9626 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9627 bound
[pend
- (str
+ k
)] = '\0';
9631 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9632 if (bound_val
== NULL
)
9635 *px
= value_as_long (bound_val
);
9641 /* Value of variable named NAME in the current environment. If
9642 no such variable found, then if ERR_MSG is null, returns 0, and
9643 otherwise causes an error with message ERR_MSG. */
9645 static struct value
*
9646 get_var_value (char *name
, char *err_msg
)
9648 struct ada_symbol_info
*syms
;
9651 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9656 if (err_msg
== NULL
)
9659 error (("%s"), err_msg
);
9662 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9665 /* Value of integer variable named NAME in the current environment. If
9666 no such variable found, returns 0, and sets *FLAG to 0. If
9667 successful, sets *FLAG to 1. */
9670 get_int_var_value (char *name
, int *flag
)
9672 struct value
*var_val
= get_var_value (name
, 0);
9684 return value_as_long (var_val
);
9689 /* Return a range type whose base type is that of the range type named
9690 NAME in the current environment, and whose bounds are calculated
9691 from NAME according to the GNAT range encoding conventions.
9692 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
9693 corresponding range type from debug information; fall back to using it
9694 if symbol lookup fails. If a new type must be created, allocate it
9695 like ORIG_TYPE was. The bounds information, in general, is encoded
9696 in NAME, the base type given in the named range type. */
9698 static struct type
*
9699 to_fixed_range_type (char *name
, struct value
*dval
, struct type
*orig_type
)
9701 struct type
*raw_type
= ada_find_any_type (name
);
9702 struct type
*base_type
;
9705 /* Fall back to the original type if symbol lookup failed. */
9706 if (raw_type
== NULL
)
9707 raw_type
= orig_type
;
9709 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9710 base_type
= TYPE_TARGET_TYPE (raw_type
);
9712 base_type
= raw_type
;
9714 subtype_info
= strstr (name
, "___XD");
9715 if (subtype_info
== NULL
)
9717 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
9718 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
9719 if (L
< INT_MIN
|| U
> INT_MAX
)
9722 return create_range_type (alloc_type_copy (orig_type
), raw_type
,
9723 ada_discrete_type_low_bound (raw_type
),
9724 ada_discrete_type_high_bound (raw_type
));
9728 static char *name_buf
= NULL
;
9729 static size_t name_len
= 0;
9730 int prefix_len
= subtype_info
- name
;
9736 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9737 strncpy (name_buf
, name
, prefix_len
);
9738 name_buf
[prefix_len
] = '\0';
9741 bounds_str
= strchr (subtype_info
, '_');
9744 if (*subtype_info
== 'L')
9746 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9747 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9749 if (bounds_str
[n
] == '_')
9751 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9758 strcpy (name_buf
+ prefix_len
, "___L");
9759 L
= get_int_var_value (name_buf
, &ok
);
9762 lim_warning (_("Unknown lower bound, using 1."));
9767 if (*subtype_info
== 'U')
9769 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9770 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9776 strcpy (name_buf
+ prefix_len
, "___U");
9777 U
= get_int_var_value (name_buf
, &ok
);
9780 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9785 type
= create_range_type (alloc_type_copy (orig_type
), base_type
, L
, U
);
9786 TYPE_NAME (type
) = name
;
9791 /* True iff NAME is the name of a range type. */
9794 ada_is_range_type_name (const char *name
)
9796 return (name
!= NULL
&& strstr (name
, "___XD"));
9802 /* True iff TYPE is an Ada modular type. */
9805 ada_is_modular_type (struct type
*type
)
9807 struct type
*subranged_type
= base_type (type
);
9809 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9810 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9811 && TYPE_UNSIGNED (subranged_type
));
9814 /* Try to determine the lower and upper bounds of the given modular type
9815 using the type name only. Return non-zero and set L and U as the lower
9816 and upper bounds (respectively) if successful. */
9819 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9821 char *name
= ada_type_name (type
);
9829 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9830 we are looking for static bounds, which means an __XDLU suffix.
9831 Moreover, we know that the lower bound of modular types is always
9832 zero, so the actual suffix should start with "__XDLU_0__", and
9833 then be followed by the upper bound value. */
9834 suffix
= strstr (name
, "__XDLU_0__");
9838 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9841 *modulus
= (ULONGEST
) U
+ 1;
9845 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9848 ada_modulus (struct type
*type
)
9850 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9854 /* Ada exception catchpoint support:
9855 ---------------------------------
9857 We support 3 kinds of exception catchpoints:
9858 . catchpoints on Ada exceptions
9859 . catchpoints on unhandled Ada exceptions
9860 . catchpoints on failed assertions
9862 Exceptions raised during failed assertions, or unhandled exceptions
9863 could perfectly be caught with the general catchpoint on Ada exceptions.
9864 However, we can easily differentiate these two special cases, and having
9865 the option to distinguish these two cases from the rest can be useful
9866 to zero-in on certain situations.
9868 Exception catchpoints are a specialized form of breakpoint,
9869 since they rely on inserting breakpoints inside known routines
9870 of the GNAT runtime. The implementation therefore uses a standard
9871 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9874 Support in the runtime for exception catchpoints have been changed
9875 a few times already, and these changes affect the implementation
9876 of these catchpoints. In order to be able to support several
9877 variants of the runtime, we use a sniffer that will determine
9878 the runtime variant used by the program being debugged.
9880 At this time, we do not support the use of conditions on Ada exception
9881 catchpoints. The COND and COND_STRING fields are therefore set
9882 to NULL (most of the time, see below).
9884 Conditions where EXP_STRING, COND, and COND_STRING are used:
9886 When a user specifies the name of a specific exception in the case
9887 of catchpoints on Ada exceptions, we store the name of that exception
9888 in the EXP_STRING. We then translate this request into an actual
9889 condition stored in COND_STRING, and then parse it into an expression
9892 /* The different types of catchpoints that we introduced for catching
9895 enum exception_catchpoint_kind
9898 ex_catch_exception_unhandled
,
9902 /* Ada's standard exceptions. */
9904 static char *standard_exc
[] = {
9911 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9913 /* A structure that describes how to support exception catchpoints
9914 for a given executable. */
9916 struct exception_support_info
9918 /* The name of the symbol to break on in order to insert
9919 a catchpoint on exceptions. */
9920 const char *catch_exception_sym
;
9922 /* The name of the symbol to break on in order to insert
9923 a catchpoint on unhandled exceptions. */
9924 const char *catch_exception_unhandled_sym
;
9926 /* The name of the symbol to break on in order to insert
9927 a catchpoint on failed assertions. */
9928 const char *catch_assert_sym
;
9930 /* Assuming that the inferior just triggered an unhandled exception
9931 catchpoint, this function is responsible for returning the address
9932 in inferior memory where the name of that exception is stored.
9933 Return zero if the address could not be computed. */
9934 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9937 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9938 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9940 /* The following exception support info structure describes how to
9941 implement exception catchpoints with the latest version of the
9942 Ada runtime (as of 2007-03-06). */
9944 static const struct exception_support_info default_exception_support_info
=
9946 "__gnat_debug_raise_exception", /* catch_exception_sym */
9947 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9948 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9949 ada_unhandled_exception_name_addr
9952 /* The following exception support info structure describes how to
9953 implement exception catchpoints with a slightly older version
9954 of the Ada runtime. */
9956 static const struct exception_support_info exception_support_info_fallback
=
9958 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9959 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9960 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9961 ada_unhandled_exception_name_addr_from_raise
9964 /* For each executable, we sniff which exception info structure to use
9965 and cache it in the following global variable. */
9967 static const struct exception_support_info
*exception_info
= NULL
;
9969 /* Inspect the Ada runtime and determine which exception info structure
9970 should be used to provide support for exception catchpoints.
9972 This function will always set exception_info, or raise an error. */
9975 ada_exception_support_info_sniffer (void)
9979 /* If the exception info is already known, then no need to recompute it. */
9980 if (exception_info
!= NULL
)
9983 /* Check the latest (default) exception support info. */
9984 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9988 exception_info
= &default_exception_support_info
;
9992 /* Try our fallback exception suport info. */
9993 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9997 exception_info
= &exception_support_info_fallback
;
10001 /* Sometimes, it is normal for us to not be able to find the routine
10002 we are looking for. This happens when the program is linked with
10003 the shared version of the GNAT runtime, and the program has not been
10004 started yet. Inform the user of these two possible causes if
10007 if (ada_update_initial_language (language_unknown
) != language_ada
)
10008 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10010 /* If the symbol does not exist, then check that the program is
10011 already started, to make sure that shared libraries have been
10012 loaded. If it is not started, this may mean that the symbol is
10013 in a shared library. */
10015 if (ptid_get_pid (inferior_ptid
) == 0)
10016 error (_("Unable to insert catchpoint. Try to start the program first."));
10018 /* At this point, we know that we are debugging an Ada program and
10019 that the inferior has been started, but we still are not able to
10020 find the run-time symbols. That can mean that we are in
10021 configurable run time mode, or that a-except as been optimized
10022 out by the linker... In any case, at this point it is not worth
10023 supporting this feature. */
10025 error (_("Cannot insert catchpoints in this configuration."));
10028 /* An observer of "executable_changed" events.
10029 Its role is to clear certain cached values that need to be recomputed
10030 each time a new executable is loaded by GDB. */
10033 ada_executable_changed_observer (void)
10035 /* If the executable changed, then it is possible that the Ada runtime
10036 is different. So we need to invalidate the exception support info
10038 exception_info
= NULL
;
10041 /* True iff FRAME is very likely to be that of a function that is
10042 part of the runtime system. This is all very heuristic, but is
10043 intended to be used as advice as to what frames are uninteresting
10047 is_known_support_routine (struct frame_info
*frame
)
10049 struct symtab_and_line sal
;
10051 enum language func_lang
;
10054 /* If this code does not have any debugging information (no symtab),
10055 This cannot be any user code. */
10057 find_frame_sal (frame
, &sal
);
10058 if (sal
.symtab
== NULL
)
10061 /* If there is a symtab, but the associated source file cannot be
10062 located, then assume this is not user code: Selecting a frame
10063 for which we cannot display the code would not be very helpful
10064 for the user. This should also take care of case such as VxWorks
10065 where the kernel has some debugging info provided for a few units. */
10067 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10070 /* Check the unit filename againt the Ada runtime file naming.
10071 We also check the name of the objfile against the name of some
10072 known system libraries that sometimes come with debugging info
10075 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10077 re_comp (known_runtime_file_name_patterns
[i
]);
10078 if (re_exec (sal
.symtab
->filename
))
10080 if (sal
.symtab
->objfile
!= NULL
10081 && re_exec (sal
.symtab
->objfile
->name
))
10085 /* Check whether the function is a GNAT-generated entity. */
10087 find_frame_funname (frame
, &func_name
, &func_lang
);
10088 if (func_name
== NULL
)
10091 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10093 re_comp (known_auxiliary_function_name_patterns
[i
]);
10094 if (re_exec (func_name
))
10101 /* Find the first frame that contains debugging information and that is not
10102 part of the Ada run-time, starting from FI and moving upward. */
10105 ada_find_printable_frame (struct frame_info
*fi
)
10107 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10109 if (!is_known_support_routine (fi
))
10118 /* Assuming that the inferior just triggered an unhandled exception
10119 catchpoint, return the address in inferior memory where the name
10120 of the exception is stored.
10122 Return zero if the address could not be computed. */
10125 ada_unhandled_exception_name_addr (void)
10127 return parse_and_eval_address ("e.full_name");
10130 /* Same as ada_unhandled_exception_name_addr, except that this function
10131 should be used when the inferior uses an older version of the runtime,
10132 where the exception name needs to be extracted from a specific frame
10133 several frames up in the callstack. */
10136 ada_unhandled_exception_name_addr_from_raise (void)
10139 struct frame_info
*fi
;
10141 /* To determine the name of this exception, we need to select
10142 the frame corresponding to RAISE_SYM_NAME. This frame is
10143 at least 3 levels up, so we simply skip the first 3 frames
10144 without checking the name of their associated function. */
10145 fi
= get_current_frame ();
10146 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10148 fi
= get_prev_frame (fi
);
10153 enum language func_lang
;
10155 find_frame_funname (fi
, &func_name
, &func_lang
);
10156 if (func_name
!= NULL
10157 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
10158 break; /* We found the frame we were looking for... */
10159 fi
= get_prev_frame (fi
);
10166 return parse_and_eval_address ("id.full_name");
10169 /* Assuming the inferior just triggered an Ada exception catchpoint
10170 (of any type), return the address in inferior memory where the name
10171 of the exception is stored, if applicable.
10173 Return zero if the address could not be computed, or if not relevant. */
10176 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10177 struct breakpoint
*b
)
10181 case ex_catch_exception
:
10182 return (parse_and_eval_address ("e.full_name"));
10185 case ex_catch_exception_unhandled
:
10186 return exception_info
->unhandled_exception_name_addr ();
10189 case ex_catch_assert
:
10190 return 0; /* Exception name is not relevant in this case. */
10194 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10198 return 0; /* Should never be reached. */
10201 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10202 any error that ada_exception_name_addr_1 might cause to be thrown.
10203 When an error is intercepted, a warning with the error message is printed,
10204 and zero is returned. */
10207 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10208 struct breakpoint
*b
)
10210 struct gdb_exception e
;
10211 CORE_ADDR result
= 0;
10213 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10215 result
= ada_exception_name_addr_1 (ex
, b
);
10220 warning (_("failed to get exception name: %s"), e
.message
);
10227 /* Implement the PRINT_IT method in the breakpoint_ops structure
10228 for all exception catchpoint kinds. */
10230 static enum print_stop_action
10231 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10233 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10234 char exception_name
[256];
10238 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10239 exception_name
[sizeof (exception_name
) - 1] = '\0';
10242 ada_find_printable_frame (get_current_frame ());
10244 annotate_catchpoint (b
->number
);
10247 case ex_catch_exception
:
10249 printf_filtered (_("\nCatchpoint %d, %s at "),
10250 b
->number
, exception_name
);
10252 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10254 case ex_catch_exception_unhandled
:
10256 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10257 b
->number
, exception_name
);
10259 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10262 case ex_catch_assert
:
10263 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10268 return PRINT_SRC_AND_LOC
;
10271 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10272 for all exception catchpoint kinds. */
10275 print_one_exception (enum exception_catchpoint_kind ex
,
10276 struct breakpoint
*b
, struct bp_location
**last_loc
)
10278 struct value_print_options opts
;
10280 get_user_print_options (&opts
);
10281 if (opts
.addressprint
)
10283 annotate_field (4);
10284 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
10287 annotate_field (5);
10288 *last_loc
= b
->loc
;
10291 case ex_catch_exception
:
10292 if (b
->exp_string
!= NULL
)
10294 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10296 ui_out_field_string (uiout
, "what", msg
);
10300 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10304 case ex_catch_exception_unhandled
:
10305 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10308 case ex_catch_assert
:
10309 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10313 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10318 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10319 for all exception catchpoint kinds. */
10322 print_mention_exception (enum exception_catchpoint_kind ex
,
10323 struct breakpoint
*b
)
10327 case ex_catch_exception
:
10328 if (b
->exp_string
!= NULL
)
10329 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10330 b
->number
, b
->exp_string
);
10332 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10336 case ex_catch_exception_unhandled
:
10337 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10341 case ex_catch_assert
:
10342 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10346 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10351 /* Virtual table for "catch exception" breakpoints. */
10353 static enum print_stop_action
10354 print_it_catch_exception (struct breakpoint
*b
)
10356 return print_it_exception (ex_catch_exception
, b
);
10360 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
10362 print_one_exception (ex_catch_exception
, b
, last_loc
);
10366 print_mention_catch_exception (struct breakpoint
*b
)
10368 print_mention_exception (ex_catch_exception
, b
);
10371 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10375 NULL
, /* breakpoint_hit */
10376 print_it_catch_exception
,
10377 print_one_catch_exception
,
10378 print_mention_catch_exception
10381 /* Virtual table for "catch exception unhandled" breakpoints. */
10383 static enum print_stop_action
10384 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10386 return print_it_exception (ex_catch_exception_unhandled
, b
);
10390 print_one_catch_exception_unhandled (struct breakpoint
*b
,
10391 struct bp_location
**last_loc
)
10393 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
10397 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10399 print_mention_exception (ex_catch_exception_unhandled
, b
);
10402 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10405 NULL
, /* breakpoint_hit */
10406 print_it_catch_exception_unhandled
,
10407 print_one_catch_exception_unhandled
,
10408 print_mention_catch_exception_unhandled
10411 /* Virtual table for "catch assert" breakpoints. */
10413 static enum print_stop_action
10414 print_it_catch_assert (struct breakpoint
*b
)
10416 return print_it_exception (ex_catch_assert
, b
);
10420 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
10422 print_one_exception (ex_catch_assert
, b
, last_loc
);
10426 print_mention_catch_assert (struct breakpoint
*b
)
10428 print_mention_exception (ex_catch_assert
, b
);
10431 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10434 NULL
, /* breakpoint_hit */
10435 print_it_catch_assert
,
10436 print_one_catch_assert
,
10437 print_mention_catch_assert
10440 /* Return non-zero if B is an Ada exception catchpoint. */
10443 ada_exception_catchpoint_p (struct breakpoint
*b
)
10445 return (b
->ops
== &catch_exception_breakpoint_ops
10446 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10447 || b
->ops
== &catch_assert_breakpoint_ops
);
10450 /* Return a newly allocated copy of the first space-separated token
10451 in ARGSP, and then adjust ARGSP to point immediately after that
10454 Return NULL if ARGPS does not contain any more tokens. */
10457 ada_get_next_arg (char **argsp
)
10459 char *args
= *argsp
;
10463 /* Skip any leading white space. */
10465 while (isspace (*args
))
10468 if (args
[0] == '\0')
10469 return NULL
; /* No more arguments. */
10471 /* Find the end of the current argument. */
10474 while (*end
!= '\0' && !isspace (*end
))
10477 /* Adjust ARGSP to point to the start of the next argument. */
10481 /* Make a copy of the current argument and return it. */
10483 result
= xmalloc (end
- args
+ 1);
10484 strncpy (result
, args
, end
- args
);
10485 result
[end
- args
] = '\0';
10490 /* Split the arguments specified in a "catch exception" command.
10491 Set EX to the appropriate catchpoint type.
10492 Set EXP_STRING to the name of the specific exception if
10493 specified by the user. */
10496 catch_ada_exception_command_split (char *args
,
10497 enum exception_catchpoint_kind
*ex
,
10500 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10501 char *exception_name
;
10503 exception_name
= ada_get_next_arg (&args
);
10504 make_cleanup (xfree
, exception_name
);
10506 /* Check that we do not have any more arguments. Anything else
10509 while (isspace (*args
))
10512 if (args
[0] != '\0')
10513 error (_("Junk at end of expression"));
10515 discard_cleanups (old_chain
);
10517 if (exception_name
== NULL
)
10519 /* Catch all exceptions. */
10520 *ex
= ex_catch_exception
;
10521 *exp_string
= NULL
;
10523 else if (strcmp (exception_name
, "unhandled") == 0)
10525 /* Catch unhandled exceptions. */
10526 *ex
= ex_catch_exception_unhandled
;
10527 *exp_string
= NULL
;
10531 /* Catch a specific exception. */
10532 *ex
= ex_catch_exception
;
10533 *exp_string
= exception_name
;
10537 /* Return the name of the symbol on which we should break in order to
10538 implement a catchpoint of the EX kind. */
10540 static const char *
10541 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10543 gdb_assert (exception_info
!= NULL
);
10547 case ex_catch_exception
:
10548 return (exception_info
->catch_exception_sym
);
10550 case ex_catch_exception_unhandled
:
10551 return (exception_info
->catch_exception_unhandled_sym
);
10553 case ex_catch_assert
:
10554 return (exception_info
->catch_assert_sym
);
10557 internal_error (__FILE__
, __LINE__
,
10558 _("unexpected catchpoint kind (%d)"), ex
);
10562 /* Return the breakpoint ops "virtual table" used for catchpoints
10565 static struct breakpoint_ops
*
10566 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10570 case ex_catch_exception
:
10571 return (&catch_exception_breakpoint_ops
);
10573 case ex_catch_exception_unhandled
:
10574 return (&catch_exception_unhandled_breakpoint_ops
);
10576 case ex_catch_assert
:
10577 return (&catch_assert_breakpoint_ops
);
10580 internal_error (__FILE__
, __LINE__
,
10581 _("unexpected catchpoint kind (%d)"), ex
);
10585 /* Return the condition that will be used to match the current exception
10586 being raised with the exception that the user wants to catch. This
10587 assumes that this condition is used when the inferior just triggered
10588 an exception catchpoint.
10590 The string returned is a newly allocated string that needs to be
10591 deallocated later. */
10594 ada_exception_catchpoint_cond_string (const char *exp_string
)
10598 /* The standard exceptions are a special case. They are defined in
10599 runtime units that have been compiled without debugging info; if
10600 EXP_STRING is the not-fully-qualified name of a standard
10601 exception (e.g. "constraint_error") then, during the evaluation
10602 of the condition expression, the symbol lookup on this name would
10603 *not* return this standard exception. The catchpoint condition
10604 may then be set only on user-defined exceptions which have the
10605 same not-fully-qualified name (e.g. my_package.constraint_error).
10607 To avoid this unexcepted behavior, these standard exceptions are
10608 systematically prefixed by "standard". This means that "catch
10609 exception constraint_error" is rewritten into "catch exception
10610 standard.constraint_error".
10612 If an exception named contraint_error is defined in another package of
10613 the inferior program, then the only way to specify this exception as a
10614 breakpoint condition is to use its fully-qualified named:
10615 e.g. my_package.constraint_error. */
10617 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10619 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10621 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10625 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10628 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10630 static struct expression
*
10631 ada_parse_catchpoint_condition (char *cond_string
,
10632 struct symtab_and_line sal
)
10634 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10637 /* Return the symtab_and_line that should be used to insert an exception
10638 catchpoint of the TYPE kind.
10640 EX_STRING should contain the name of a specific exception
10641 that the catchpoint should catch, or NULL otherwise.
10643 The idea behind all the remaining parameters is that their names match
10644 the name of certain fields in the breakpoint structure that are used to
10645 handle exception catchpoints. This function returns the value to which
10646 these fields should be set, depending on the type of catchpoint we need
10649 If COND and COND_STRING are both non-NULL, any value they might
10650 hold will be free'ed, and then replaced by newly allocated ones.
10651 These parameters are left untouched otherwise. */
10653 static struct symtab_and_line
10654 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10655 char **addr_string
, char **cond_string
,
10656 struct expression
**cond
, struct breakpoint_ops
**ops
)
10658 const char *sym_name
;
10659 struct symbol
*sym
;
10660 struct symtab_and_line sal
;
10662 /* First, find out which exception support info to use. */
10663 ada_exception_support_info_sniffer ();
10665 /* Then lookup the function on which we will break in order to catch
10666 the Ada exceptions requested by the user. */
10668 sym_name
= ada_exception_sym_name (ex
);
10669 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10671 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10672 that should be compiled with debugging information. As a result, we
10673 expect to find that symbol in the symtabs. If we don't find it, then
10674 the target most likely does not support Ada exceptions, or we cannot
10675 insert exception breakpoints yet, because the GNAT runtime hasn't been
10678 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10679 in such a way that no debugging information is produced for the symbol
10680 we are looking for. In this case, we could search the minimal symbols
10681 as a fall-back mechanism. This would still be operating in degraded
10682 mode, however, as we would still be missing the debugging information
10683 that is needed in order to extract the name of the exception being
10684 raised (this name is printed in the catchpoint message, and is also
10685 used when trying to catch a specific exception). We do not handle
10686 this case for now. */
10689 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10691 /* Make sure that the symbol we found corresponds to a function. */
10692 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10693 error (_("Symbol \"%s\" is not a function (class = %d)"),
10694 sym_name
, SYMBOL_CLASS (sym
));
10696 sal
= find_function_start_sal (sym
, 1);
10698 /* Set ADDR_STRING. */
10700 *addr_string
= xstrdup (sym_name
);
10702 /* Set the COND and COND_STRING (if not NULL). */
10704 if (cond_string
!= NULL
&& cond
!= NULL
)
10706 if (*cond_string
!= NULL
)
10708 xfree (*cond_string
);
10709 *cond_string
= NULL
;
10716 if (exp_string
!= NULL
)
10718 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10719 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10724 *ops
= ada_exception_breakpoint_ops (ex
);
10729 /* Parse the arguments (ARGS) of the "catch exception" command.
10731 Set TYPE to the appropriate exception catchpoint type.
10732 If the user asked the catchpoint to catch only a specific
10733 exception, then save the exception name in ADDR_STRING.
10735 See ada_exception_sal for a description of all the remaining
10736 function arguments of this function. */
10738 struct symtab_and_line
10739 ada_decode_exception_location (char *args
, char **addr_string
,
10740 char **exp_string
, char **cond_string
,
10741 struct expression
**cond
,
10742 struct breakpoint_ops
**ops
)
10744 enum exception_catchpoint_kind ex
;
10746 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10747 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10751 struct symtab_and_line
10752 ada_decode_assert_location (char *args
, char **addr_string
,
10753 struct breakpoint_ops
**ops
)
10755 /* Check that no argument where provided at the end of the command. */
10759 while (isspace (*args
))
10762 error (_("Junk at end of arguments."));
10765 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10770 /* Information about operators given special treatment in functions
10772 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10774 #define ADA_OPERATORS \
10775 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10776 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10777 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10778 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10779 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10780 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10781 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10782 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10783 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10784 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10785 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10786 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10787 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10788 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10789 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10790 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10791 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10792 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10793 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10796 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10798 switch (exp
->elts
[pc
- 1].opcode
)
10801 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10804 #define OP_DEFN(op, len, args, binop) \
10805 case op: *oplenp = len; *argsp = args; break;
10811 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10816 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10822 ada_op_name (enum exp_opcode opcode
)
10827 return op_name_standard (opcode
);
10829 #define OP_DEFN(op, len, args, binop) case op: return #op;
10834 return "OP_AGGREGATE";
10836 return "OP_CHOICES";
10842 /* As for operator_length, but assumes PC is pointing at the first
10843 element of the operator, and gives meaningful results only for the
10844 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10847 ada_forward_operator_length (struct expression
*exp
, int pc
,
10848 int *oplenp
, int *argsp
)
10850 switch (exp
->elts
[pc
].opcode
)
10853 *oplenp
= *argsp
= 0;
10856 #define OP_DEFN(op, len, args, binop) \
10857 case op: *oplenp = len; *argsp = args; break;
10863 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10868 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10874 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10875 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10883 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10885 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10890 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10894 /* Ada attributes ('Foo). */
10897 case OP_ATR_LENGTH
:
10901 case OP_ATR_MODULUS
:
10908 case UNOP_IN_RANGE
:
10910 /* XXX: gdb_sprint_host_address, type_sprint */
10911 fprintf_filtered (stream
, _("Type @"));
10912 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10913 fprintf_filtered (stream
, " (");
10914 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10915 fprintf_filtered (stream
, ")");
10917 case BINOP_IN_BOUNDS
:
10918 fprintf_filtered (stream
, " (%d)",
10919 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10921 case TERNOP_IN_RANGE
:
10926 case OP_DISCRETE_RANGE
:
10927 case OP_POSITIONAL
:
10934 char *name
= &exp
->elts
[elt
+ 2].string
;
10935 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10936 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10941 return dump_subexp_body_standard (exp
, stream
, elt
);
10945 for (i
= 0; i
< nargs
; i
+= 1)
10946 elt
= dump_subexp (exp
, stream
, elt
);
10951 /* The Ada extension of print_subexp (q.v.). */
10954 ada_print_subexp (struct expression
*exp
, int *pos
,
10955 struct ui_file
*stream
, enum precedence prec
)
10957 int oplen
, nargs
, i
;
10959 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10961 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10968 print_subexp_standard (exp
, pos
, stream
, prec
);
10972 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10975 case BINOP_IN_BOUNDS
:
10976 /* XXX: sprint_subexp */
10977 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10978 fputs_filtered (" in ", stream
);
10979 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10980 fputs_filtered ("'range", stream
);
10981 if (exp
->elts
[pc
+ 1].longconst
> 1)
10982 fprintf_filtered (stream
, "(%ld)",
10983 (long) exp
->elts
[pc
+ 1].longconst
);
10986 case TERNOP_IN_RANGE
:
10987 if (prec
>= PREC_EQUAL
)
10988 fputs_filtered ("(", stream
);
10989 /* XXX: sprint_subexp */
10990 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10991 fputs_filtered (" in ", stream
);
10992 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10993 fputs_filtered (" .. ", stream
);
10994 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10995 if (prec
>= PREC_EQUAL
)
10996 fputs_filtered (")", stream
);
11001 case OP_ATR_LENGTH
:
11005 case OP_ATR_MODULUS
:
11010 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11012 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
11013 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
11017 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11018 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
11022 for (tem
= 1; tem
< nargs
; tem
+= 1)
11024 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
11025 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
11027 fputs_filtered (")", stream
);
11032 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
11033 fputs_filtered ("'(", stream
);
11034 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
11035 fputs_filtered (")", stream
);
11038 case UNOP_IN_RANGE
:
11039 /* XXX: sprint_subexp */
11040 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11041 fputs_filtered (" in ", stream
);
11042 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
11045 case OP_DISCRETE_RANGE
:
11046 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11047 fputs_filtered ("..", stream
);
11048 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11052 fputs_filtered ("others => ", stream
);
11053 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11057 for (i
= 0; i
< nargs
-1; i
+= 1)
11060 fputs_filtered ("|", stream
);
11061 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11063 fputs_filtered (" => ", stream
);
11064 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11067 case OP_POSITIONAL
:
11068 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11072 fputs_filtered ("(", stream
);
11073 for (i
= 0; i
< nargs
; i
+= 1)
11076 fputs_filtered (", ", stream
);
11077 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11079 fputs_filtered (")", stream
);
11084 /* Table mapping opcodes into strings for printing operators
11085 and precedences of the operators. */
11087 static const struct op_print ada_op_print_tab
[] = {
11088 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
11089 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
11090 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
11091 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
11092 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
11093 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
11094 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
11095 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
11096 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
11097 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
11098 {">", BINOP_GTR
, PREC_ORDER
, 0},
11099 {"<", BINOP_LESS
, PREC_ORDER
, 0},
11100 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
11101 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
11102 {"+", BINOP_ADD
, PREC_ADD
, 0},
11103 {"-", BINOP_SUB
, PREC_ADD
, 0},
11104 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
11105 {"*", BINOP_MUL
, PREC_MUL
, 0},
11106 {"/", BINOP_DIV
, PREC_MUL
, 0},
11107 {"rem", BINOP_REM
, PREC_MUL
, 0},
11108 {"mod", BINOP_MOD
, PREC_MUL
, 0},
11109 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
11110 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
11111 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
11112 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
11113 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
11114 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
11115 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
11116 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
11117 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
11118 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
11122 enum ada_primitive_types
{
11123 ada_primitive_type_int
,
11124 ada_primitive_type_long
,
11125 ada_primitive_type_short
,
11126 ada_primitive_type_char
,
11127 ada_primitive_type_float
,
11128 ada_primitive_type_double
,
11129 ada_primitive_type_void
,
11130 ada_primitive_type_long_long
,
11131 ada_primitive_type_long_double
,
11132 ada_primitive_type_natural
,
11133 ada_primitive_type_positive
,
11134 ada_primitive_type_system_address
,
11135 nr_ada_primitive_types
11139 ada_language_arch_info (struct gdbarch
*gdbarch
,
11140 struct language_arch_info
*lai
)
11142 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
11143 lai
->primitive_type_vector
11144 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
11147 lai
->primitive_type_vector
[ada_primitive_type_int
]
11148 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11150 lai
->primitive_type_vector
[ada_primitive_type_long
]
11151 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
11152 0, "long_integer");
11153 lai
->primitive_type_vector
[ada_primitive_type_short
]
11154 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
11155 0, "short_integer");
11156 lai
->string_char_type
11157 = lai
->primitive_type_vector
[ada_primitive_type_char
]
11158 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
11159 lai
->primitive_type_vector
[ada_primitive_type_float
]
11160 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
11162 lai
->primitive_type_vector
[ada_primitive_type_double
]
11163 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11164 "long_float", NULL
);
11165 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
11166 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
11167 0, "long_long_integer");
11168 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
11169 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11170 "long_long_float", NULL
);
11171 lai
->primitive_type_vector
[ada_primitive_type_natural
]
11172 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11174 lai
->primitive_type_vector
[ada_primitive_type_positive
]
11175 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11177 lai
->primitive_type_vector
[ada_primitive_type_void
]
11178 = builtin
->builtin_void
;
11180 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
11181 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
11182 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
11183 = "system__address";
11185 lai
->bool_type_symbol
= NULL
;
11186 lai
->bool_type_default
= builtin
->builtin_bool
;
11189 /* Language vector */
11191 /* Not really used, but needed in the ada_language_defn. */
11194 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
11196 ada_emit_char (c
, type
, stream
, quoter
, 1);
11202 warnings_issued
= 0;
11203 return ada_parse ();
11206 static const struct exp_descriptor ada_exp_descriptor
= {
11208 ada_operator_length
,
11210 ada_dump_subexp_body
,
11211 ada_evaluate_subexp
11214 const struct language_defn ada_language_defn
= {
11215 "ada", /* Language name */
11219 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11220 that's not quite what this means. */
11222 macro_expansion_no
,
11223 &ada_exp_descriptor
,
11227 ada_printchar
, /* Print a character constant */
11228 ada_printstr
, /* Function to print string constant */
11229 emit_char
, /* Function to print single char (not used) */
11230 ada_print_type
, /* Print a type using appropriate syntax */
11231 default_print_typedef
, /* Print a typedef using appropriate syntax */
11232 ada_val_print
, /* Print a value using appropriate syntax */
11233 ada_value_print
, /* Print a top-level value */
11234 NULL
, /* Language specific skip_trampoline */
11235 NULL
, /* name_of_this */
11236 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11237 basic_lookup_transparent_type
, /* lookup_transparent_type */
11238 ada_la_decode
, /* Language specific symbol demangler */
11239 NULL
, /* Language specific class_name_from_physname */
11240 ada_op_print_tab
, /* expression operators for printing */
11241 0, /* c-style arrays */
11242 1, /* String lower bound */
11243 ada_get_gdb_completer_word_break_characters
,
11244 ada_make_symbol_completion_list
,
11245 ada_language_arch_info
,
11246 ada_print_array_index
,
11247 default_pass_by_reference
,
11252 /* Provide a prototype to silence -Wmissing-prototypes. */
11253 extern initialize_file_ftype _initialize_ada_language
;
11255 /* Command-list for the "set/show ada" prefix command. */
11256 static struct cmd_list_element
*set_ada_list
;
11257 static struct cmd_list_element
*show_ada_list
;
11259 /* Implement the "set ada" prefix command. */
11262 set_ada_command (char *arg
, int from_tty
)
11264 printf_unfiltered (_(\
11265 "\"set ada\" must be followed by the name of a setting.\n"));
11266 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
11269 /* Implement the "show ada" prefix command. */
11272 show_ada_command (char *args
, int from_tty
)
11274 cmd_show_list (show_ada_list
, from_tty
, "");
11278 _initialize_ada_language (void)
11280 add_language (&ada_language_defn
);
11282 add_prefix_cmd ("ada", no_class
, set_ada_command
,
11283 _("Prefix command for changing Ada-specfic settings"),
11284 &set_ada_list
, "set ada ", 0, &setlist
);
11286 add_prefix_cmd ("ada", no_class
, show_ada_command
,
11287 _("Generic command for showing Ada-specific settings."),
11288 &show_ada_list
, "show ada ", 0, &showlist
);
11290 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
11291 &trust_pad_over_xvs
, _("\
11292 Enable or disable an optimization trusting PAD types over XVS types"), _("\
11293 Show whether an optimization trusting PAD types over XVS types is activated"),
11295 This is related to the encoding used by the GNAT compiler. The debugger\n\
11296 should normally trust the contents of PAD types, but certain older versions\n\
11297 of GNAT have a bug that sometimes causes the information in the PAD type\n\
11298 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
11299 work around this bug. It is always safe to turn this option \"off\", but\n\
11300 this incurs a slight performance penalty, so it is recommended to NOT change\n\
11301 this option to \"off\" unless necessary."),
11302 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
11304 varsize_limit
= 65536;
11306 obstack_init (&symbol_list_obstack
);
11308 decoded_names_store
= htab_create_alloc
11309 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11310 NULL
, xcalloc
, xfree
);
11312 observer_attach_executable_changed (ada_executable_changed_observer
);