1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007
4 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
60 /* Define whether or not the C operator '/' truncates towards zero for
61 differently signed operands (truncation direction is undefined in C).
62 Copied from valarith.c. */
64 #ifndef TRUNCATION_TOWARDS_ZERO
65 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
68 static void extract_string (CORE_ADDR addr
, char *buf
);
70 static void modify_general_field (char *, LONGEST
, int, int);
72 static struct type
*desc_base_type (struct type
*);
74 static struct type
*desc_bounds_type (struct type
*);
76 static struct value
*desc_bounds (struct value
*);
78 static int fat_pntr_bounds_bitpos (struct type
*);
80 static int fat_pntr_bounds_bitsize (struct type
*);
82 static struct type
*desc_data_type (struct type
*);
84 static struct value
*desc_data (struct value
*);
86 static int fat_pntr_data_bitpos (struct type
*);
88 static int fat_pntr_data_bitsize (struct type
*);
90 static struct value
*desc_one_bound (struct value
*, int, int);
92 static int desc_bound_bitpos (struct type
*, int, int);
94 static int desc_bound_bitsize (struct type
*, int, int);
96 static struct type
*desc_index_type (struct type
*, int);
98 static int desc_arity (struct type
*);
100 static int ada_type_match (struct type
*, struct type
*, int);
102 static int ada_args_match (struct symbol
*, struct value
**, int);
104 static struct value
*ensure_lval (struct value
*, CORE_ADDR
*);
106 static struct value
*convert_actual (struct value
*, struct type
*,
109 static struct value
*make_array_descriptor (struct type
*, struct value
*,
112 static void ada_add_block_symbols (struct obstack
*,
113 struct block
*, const char *,
114 domain_enum
, struct objfile
*, int);
116 static int is_nonfunction (struct ada_symbol_info
*, int);
118 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
121 static int num_defns_collected (struct obstack
*);
123 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
125 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
126 *, const char *, int,
129 static struct symtab
*symtab_for_sym (struct symbol
*);
131 static struct value
*resolve_subexp (struct expression
**, int *, int,
134 static void replace_operator_with_call (struct expression
**, int, int, int,
135 struct symbol
*, struct block
*);
137 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
139 static char *ada_op_name (enum exp_opcode
);
141 static const char *ada_decoded_op_name (enum exp_opcode
);
143 static int numeric_type_p (struct type
*);
145 static int integer_type_p (struct type
*);
147 static int scalar_type_p (struct type
*);
149 static int discrete_type_p (struct type
*);
151 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
156 static struct symbol
*find_old_style_renaming_symbol (const char *,
159 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
162 static struct value
*evaluate_subexp (struct type
*, struct expression
*,
165 static struct value
*evaluate_subexp_type (struct expression
*, int *);
167 static int is_dynamic_field (struct type
*, int);
169 static struct type
*to_fixed_variant_branch_type (struct type
*,
171 CORE_ADDR
, struct value
*);
173 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
175 static struct type
*to_fixed_range_type (char *, struct value
*,
178 static struct type
*to_static_fixed_type (struct type
*);
179 static struct type
*static_unwrap_type (struct type
*type
);
181 static struct value
*unwrap_value (struct value
*);
183 static struct type
*packed_array_type (struct type
*, long *);
185 static struct type
*decode_packed_array_type (struct type
*);
187 static struct value
*decode_packed_array (struct value
*);
189 static struct value
*value_subscript_packed (struct value
*, int,
192 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int);
194 static struct value
*coerce_unspec_val_to_type (struct value
*,
197 static struct value
*get_var_value (char *, char *);
199 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
201 static int equiv_types (struct type
*, struct type
*);
203 static int is_name_suffix (const char *);
205 static int is_digits_suffix (const char *str
);
207 static int wild_match (const char *, int, const char *);
209 static struct value
*ada_coerce_ref (struct value
*);
211 static LONGEST
pos_atr (struct value
*);
213 static struct value
*value_pos_atr (struct type
*, struct value
*);
215 static struct value
*value_val_atr (struct type
*, struct value
*);
217 static struct symbol
*standard_lookup (const char *, const struct block
*,
220 static struct value
*ada_search_struct_field (char *, struct value
*, int,
223 static struct value
*ada_value_primitive_field (struct value
*, int, int,
226 static int find_struct_field (char *, struct type
*, int,
227 struct type
**, int *, int *, int *, int *);
229 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
232 static struct value
*ada_to_fixed_value (struct value
*);
234 static int ada_resolve_function (struct ada_symbol_info
*, int,
235 struct value
**, int, const char *,
238 static struct value
*ada_coerce_to_simple_array (struct value
*);
240 static int ada_is_direct_array_type (struct type
*);
242 static void ada_language_arch_info (struct gdbarch
*,
243 struct language_arch_info
*);
245 static void check_size (const struct type
*);
247 static struct value
*ada_index_struct_field (int, struct value
*, int,
250 static struct value
*assign_aggregate (struct value
*, struct value
*,
251 struct expression
*, int *, enum noside
);
253 static void aggregate_assign_from_choices (struct value
*, struct value
*,
255 int *, LONGEST
*, int *,
256 int, LONGEST
, LONGEST
);
258 static void aggregate_assign_positional (struct value
*, struct value
*,
260 int *, LONGEST
*, int *, int,
264 static void aggregate_assign_others (struct value
*, struct value
*,
266 int *, LONGEST
*, int, LONGEST
, LONGEST
);
269 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
272 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
275 static void ada_forward_operator_length (struct expression
*, int, int *,
280 /* Maximum-sized dynamic type. */
281 static unsigned int varsize_limit
;
283 /* FIXME: brobecker/2003-09-17: No longer a const because it is
284 returned by a function that does not return a const char *. */
285 static char *ada_completer_word_break_characters
=
287 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
289 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
292 /* The name of the symbol to use to get the name of the main subprogram. */
293 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
294 = "__gnat_ada_main_program_name";
296 /* Limit on the number of warnings to raise per expression evaluation. */
297 static int warning_limit
= 2;
299 /* Number of warning messages issued; reset to 0 by cleanups after
300 expression evaluation. */
301 static int warnings_issued
= 0;
303 static const char *known_runtime_file_name_patterns
[] = {
304 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
307 static const char *known_auxiliary_function_name_patterns
[] = {
308 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
311 /* Space for allocating results of ada_lookup_symbol_list. */
312 static struct obstack symbol_list_obstack
;
316 /* Given DECODED_NAME a string holding a symbol name in its
317 decoded form (ie using the Ada dotted notation), returns
318 its unqualified name. */
321 ada_unqualified_name (const char *decoded_name
)
323 const char *result
= strrchr (decoded_name
, '.');
326 result
++; /* Skip the dot... */
328 result
= decoded_name
;
333 /* Return a string starting with '<', followed by STR, and '>'.
334 The result is good until the next call. */
337 add_angle_brackets (const char *str
)
339 static char *result
= NULL
;
342 result
= (char *) xmalloc ((strlen (str
) + 3) * sizeof (char));
344 sprintf (result
, "<%s>", str
);
349 ada_get_gdb_completer_word_break_characters (void)
351 return ada_completer_word_break_characters
;
354 /* Print an array element index using the Ada syntax. */
357 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
358 int format
, enum val_prettyprint pretty
)
360 LA_VALUE_PRINT (index_value
, stream
, format
, pretty
);
361 fprintf_filtered (stream
, " => ");
364 /* Read the string located at ADDR from the inferior and store the
368 extract_string (CORE_ADDR addr
, char *buf
)
372 /* Loop, reading one byte at a time, until we reach the '\000'
373 end-of-string marker. */
376 target_read_memory (addr
+ char_index
* sizeof (char),
377 buf
+ char_index
* sizeof (char), sizeof (char));
380 while (buf
[char_index
- 1] != '\000');
383 /* Assuming VECT points to an array of *SIZE objects of size
384 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
385 updating *SIZE as necessary and returning the (new) array. */
388 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
390 if (*size
< min_size
)
393 if (*size
< min_size
)
395 vect
= xrealloc (vect
, *size
* element_size
);
400 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
401 suffix of FIELD_NAME beginning "___". */
404 field_name_match (const char *field_name
, const char *target
)
406 int len
= strlen (target
);
408 (strncmp (field_name
, target
, len
) == 0
409 && (field_name
[len
] == '\0'
410 || (strncmp (field_name
+ len
, "___", 3) == 0
411 && strcmp (field_name
+ strlen (field_name
) - 6,
416 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
417 FIELD_NAME, and return its index. This function also handles fields
418 whose name have ___ suffixes because the compiler sometimes alters
419 their name by adding such a suffix to represent fields with certain
420 constraints. If the field could not be found, return a negative
421 number if MAYBE_MISSING is set. Otherwise raise an error. */
424 ada_get_field_index (const struct type
*type
, const char *field_name
,
428 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (type
); fieldno
++)
429 if (field_name_match (TYPE_FIELD_NAME (type
, fieldno
), field_name
))
433 error (_("Unable to find field %s in struct %s. Aborting"),
434 field_name
, TYPE_NAME (type
));
439 /* The length of the prefix of NAME prior to any "___" suffix. */
442 ada_name_prefix_len (const char *name
)
448 const char *p
= strstr (name
, "___");
450 return strlen (name
);
456 /* Return non-zero if SUFFIX is a suffix of STR.
457 Return zero if STR is null. */
460 is_suffix (const char *str
, const char *suffix
)
466 len2
= strlen (suffix
);
467 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
470 /* Create a value of type TYPE whose contents come from VALADDR, if it
471 is non-null, and whose memory address (in the inferior) is
475 value_from_contents_and_address (struct type
*type
,
476 const gdb_byte
*valaddr
,
479 struct value
*v
= allocate_value (type
);
481 set_value_lazy (v
, 1);
483 memcpy (value_contents_raw (v
), valaddr
, TYPE_LENGTH (type
));
484 VALUE_ADDRESS (v
) = address
;
486 VALUE_LVAL (v
) = lval_memory
;
490 /* The contents of value VAL, treated as a value of type TYPE. The
491 result is an lval in memory if VAL is. */
493 static struct value
*
494 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
496 type
= ada_check_typedef (type
);
497 if (value_type (val
) == type
)
501 struct value
*result
;
503 /* Make sure that the object size is not unreasonable before
504 trying to allocate some memory for it. */
507 result
= allocate_value (type
);
508 VALUE_LVAL (result
) = VALUE_LVAL (val
);
509 set_value_bitsize (result
, value_bitsize (val
));
510 set_value_bitpos (result
, value_bitpos (val
));
511 VALUE_ADDRESS (result
) = VALUE_ADDRESS (val
) + value_offset (val
);
513 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
514 set_value_lazy (result
, 1);
516 memcpy (value_contents_raw (result
), value_contents (val
),
522 static const gdb_byte
*
523 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
528 return valaddr
+ offset
;
532 cond_offset_target (CORE_ADDR address
, long offset
)
537 return address
+ offset
;
540 /* Issue a warning (as for the definition of warning in utils.c, but
541 with exactly one argument rather than ...), unless the limit on the
542 number of warnings has passed during the evaluation of the current
545 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
546 provided by "complaint". */
547 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
550 lim_warning (const char *format
, ...)
553 va_start (args
, format
);
555 warnings_issued
+= 1;
556 if (warnings_issued
<= warning_limit
)
557 vwarning (format
, args
);
562 /* Issue an error if the size of an object of type T is unreasonable,
563 i.e. if it would be a bad idea to allocate a value of this type in
567 check_size (const struct type
*type
)
569 if (TYPE_LENGTH (type
) > varsize_limit
)
570 error (_("object size is larger than varsize-limit"));
574 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
575 gdbtypes.h, but some of the necessary definitions in that file
576 seem to have gone missing. */
578 /* Maximum value of a SIZE-byte signed integer type. */
580 max_of_size (int size
)
582 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
583 return top_bit
| (top_bit
- 1);
586 /* Minimum value of a SIZE-byte signed integer type. */
588 min_of_size (int size
)
590 return -max_of_size (size
) - 1;
593 /* Maximum value of a SIZE-byte unsigned integer type. */
595 umax_of_size (int size
)
597 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
598 return top_bit
| (top_bit
- 1);
601 /* Maximum value of integral type T, as a signed quantity. */
603 max_of_type (struct type
*t
)
605 if (TYPE_UNSIGNED (t
))
606 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
608 return max_of_size (TYPE_LENGTH (t
));
611 /* Minimum value of integral type T, as a signed quantity. */
613 min_of_type (struct type
*t
)
615 if (TYPE_UNSIGNED (t
))
618 return min_of_size (TYPE_LENGTH (t
));
621 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
623 discrete_type_high_bound (struct type
*type
)
625 switch (TYPE_CODE (type
))
627 case TYPE_CODE_RANGE
:
628 return TYPE_HIGH_BOUND (type
);
630 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
635 return max_of_type (type
);
637 error (_("Unexpected type in discrete_type_high_bound."));
641 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
643 discrete_type_low_bound (struct type
*type
)
645 switch (TYPE_CODE (type
))
647 case TYPE_CODE_RANGE
:
648 return TYPE_LOW_BOUND (type
);
650 return TYPE_FIELD_BITPOS (type
, 0);
655 return min_of_type (type
);
657 error (_("Unexpected type in discrete_type_low_bound."));
661 /* The identity on non-range types. For range types, the underlying
662 non-range scalar type. */
665 base_type (struct type
*type
)
667 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
669 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
671 type
= TYPE_TARGET_TYPE (type
);
677 /* Language Selection */
679 /* If the main program is in Ada, return language_ada, otherwise return LANG
680 (the main program is in Ada iif the adainit symbol is found).
682 MAIN_PST is not used. */
685 ada_update_initial_language (enum language lang
,
686 struct partial_symtab
*main_pst
)
688 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
689 (struct objfile
*) NULL
) != NULL
)
695 /* If the main procedure is written in Ada, then return its name.
696 The result is good until the next call. Return NULL if the main
697 procedure doesn't appear to be in Ada. */
702 struct minimal_symbol
*msym
;
703 CORE_ADDR main_program_name_addr
;
704 static char main_program_name
[1024];
706 /* For Ada, the name of the main procedure is stored in a specific
707 string constant, generated by the binder. Look for that symbol,
708 extract its address, and then read that string. If we didn't find
709 that string, then most probably the main procedure is not written
711 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
715 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
716 if (main_program_name_addr
== 0)
717 error (_("Invalid address for Ada main program name."));
719 extract_string (main_program_name_addr
, main_program_name
);
720 return main_program_name
;
723 /* The main procedure doesn't seem to be in Ada. */
729 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
732 const struct ada_opname_map ada_opname_table
[] = {
733 {"Oadd", "\"+\"", BINOP_ADD
},
734 {"Osubtract", "\"-\"", BINOP_SUB
},
735 {"Omultiply", "\"*\"", BINOP_MUL
},
736 {"Odivide", "\"/\"", BINOP_DIV
},
737 {"Omod", "\"mod\"", BINOP_MOD
},
738 {"Orem", "\"rem\"", BINOP_REM
},
739 {"Oexpon", "\"**\"", BINOP_EXP
},
740 {"Olt", "\"<\"", BINOP_LESS
},
741 {"Ole", "\"<=\"", BINOP_LEQ
},
742 {"Ogt", "\">\"", BINOP_GTR
},
743 {"Oge", "\">=\"", BINOP_GEQ
},
744 {"Oeq", "\"=\"", BINOP_EQUAL
},
745 {"One", "\"/=\"", BINOP_NOTEQUAL
},
746 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
747 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
748 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
749 {"Oconcat", "\"&\"", BINOP_CONCAT
},
750 {"Oabs", "\"abs\"", UNOP_ABS
},
751 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
752 {"Oadd", "\"+\"", UNOP_PLUS
},
753 {"Osubtract", "\"-\"", UNOP_NEG
},
757 /* Return non-zero if STR should be suppressed in info listings. */
760 is_suppressed_name (const char *str
)
762 if (strncmp (str
, "_ada_", 5) == 0)
764 if (str
[0] == '_' || str
[0] == '\000')
769 const char *suffix
= strstr (str
, "___");
770 if (suffix
!= NULL
&& suffix
[3] != 'X')
773 suffix
= str
+ strlen (str
);
774 for (p
= suffix
- 1; p
!= str
; p
-= 1)
778 if (p
[0] == 'X' && p
[-1] != '_')
782 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
783 if (strncmp (ada_opname_table
[i
].encoded
, p
,
784 strlen (ada_opname_table
[i
].encoded
)) == 0)
793 /* The "encoded" form of DECODED, according to GNAT conventions.
794 The result is valid until the next call to ada_encode. */
797 ada_encode (const char *decoded
)
799 static char *encoding_buffer
= NULL
;
800 static size_t encoding_buffer_size
= 0;
807 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
808 2 * strlen (decoded
) + 10);
811 for (p
= decoded
; *p
!= '\0'; p
+= 1)
815 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
820 const struct ada_opname_map
*mapping
;
822 for (mapping
= ada_opname_table
;
823 mapping
->encoded
!= NULL
824 && strncmp (mapping
->decoded
, p
,
825 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
827 if (mapping
->encoded
== NULL
)
828 error (_("invalid Ada operator name: %s"), p
);
829 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
830 k
+= strlen (mapping
->encoded
);
835 encoding_buffer
[k
] = *p
;
840 encoding_buffer
[k
] = '\0';
841 return encoding_buffer
;
844 /* Return NAME folded to lower case, or, if surrounded by single
845 quotes, unfolded, but with the quotes stripped away. Result good
849 ada_fold_name (const char *name
)
851 static char *fold_buffer
= NULL
;
852 static size_t fold_buffer_size
= 0;
854 int len
= strlen (name
);
855 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
859 strncpy (fold_buffer
, name
+ 1, len
- 2);
860 fold_buffer
[len
- 2] = '\000';
865 for (i
= 0; i
<= len
; i
+= 1)
866 fold_buffer
[i
] = tolower (name
[i
]);
872 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
875 is_lower_alphanum (const char c
)
877 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
880 /* Remove either of these suffixes:
885 These are suffixes introduced by the compiler for entities such as
886 nested subprogram for instance, in order to avoid name clashes.
887 They do not serve any purpose for the debugger. */
890 ada_remove_trailing_digits (const char *encoded
, int *len
)
892 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
895 while (i
> 0 && isdigit (encoded
[i
]))
897 if (i
>= 0 && encoded
[i
] == '.')
899 else if (i
>= 0 && encoded
[i
] == '$')
901 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
903 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
908 /* Remove the suffix introduced by the compiler for protected object
912 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
914 /* Remove trailing N. */
916 /* Protected entry subprograms are broken into two
917 separate subprograms: The first one is unprotected, and has
918 a 'N' suffix; the second is the protected version, and has
919 the 'P' suffix. The second calls the first one after handling
920 the protection. Since the P subprograms are internally generated,
921 we leave these names undecoded, giving the user a clue that this
922 entity is internal. */
925 && encoded
[*len
- 1] == 'N'
926 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
930 /* If ENCODED follows the GNAT entity encoding conventions, then return
931 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
934 The resulting string is valid until the next call of ada_decode.
935 If the string is unchanged by decoding, the original string pointer
939 ada_decode (const char *encoded
)
946 static char *decoding_buffer
= NULL
;
947 static size_t decoding_buffer_size
= 0;
949 /* The name of the Ada main procedure starts with "_ada_".
950 This prefix is not part of the decoded name, so skip this part
951 if we see this prefix. */
952 if (strncmp (encoded
, "_ada_", 5) == 0)
955 /* If the name starts with '_', then it is not a properly encoded
956 name, so do not attempt to decode it. Similarly, if the name
957 starts with '<', the name should not be decoded. */
958 if (encoded
[0] == '_' || encoded
[0] == '<')
961 len0
= strlen (encoded
);
963 ada_remove_trailing_digits (encoded
, &len0
);
964 ada_remove_po_subprogram_suffix (encoded
, &len0
);
966 /* Remove the ___X.* suffix if present. Do not forget to verify that
967 the suffix is located before the current "end" of ENCODED. We want
968 to avoid re-matching parts of ENCODED that have previously been
969 marked as discarded (by decrementing LEN0). */
970 p
= strstr (encoded
, "___");
971 if (p
!= NULL
&& p
- encoded
< len0
- 3)
979 /* Remove any trailing TKB suffix. It tells us that this symbol
980 is for the body of a task, but that information does not actually
981 appear in the decoded name. */
983 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
986 /* Remove trailing "B" suffixes. */
987 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
989 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
992 /* Make decoded big enough for possible expansion by operator name. */
994 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
995 decoded
= decoding_buffer
;
997 /* Remove trailing __{digit}+ or trailing ${digit}+. */
999 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1002 while ((i
>= 0 && isdigit (encoded
[i
]))
1003 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1005 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1007 else if (encoded
[i
] == '$')
1011 /* The first few characters that are not alphabetic are not part
1012 of any encoding we use, so we can copy them over verbatim. */
1014 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1015 decoded
[j
] = encoded
[i
];
1020 /* Is this a symbol function? */
1021 if (at_start_name
&& encoded
[i
] == 'O')
1024 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1026 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1027 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1029 && !isalnum (encoded
[i
+ op_len
]))
1031 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1034 j
+= strlen (ada_opname_table
[k
].decoded
);
1038 if (ada_opname_table
[k
].encoded
!= NULL
)
1043 /* Replace "TK__" with "__", which will eventually be translated
1044 into "." (just below). */
1046 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1049 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1050 be translated into "." (just below). These are internal names
1051 generated for anonymous blocks inside which our symbol is nested. */
1053 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1054 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1055 && isdigit (encoded
[i
+4]))
1059 while (k
< len0
&& isdigit (encoded
[k
]))
1060 k
++; /* Skip any extra digit. */
1062 /* Double-check that the "__B_{DIGITS}+" sequence we found
1063 is indeed followed by "__". */
1064 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1068 /* Remove _E{DIGITS}+[sb] */
1070 /* Just as for protected object subprograms, there are 2 categories
1071 of subprograms created by the compiler for each entry. The first
1072 one implements the actual entry code, and has a suffix following
1073 the convention above; the second one implements the barrier and
1074 uses the same convention as above, except that the 'E' is replaced
1077 Just as above, we do not decode the name of barrier functions
1078 to give the user a clue that the code he is debugging has been
1079 internally generated. */
1081 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1082 && isdigit (encoded
[i
+2]))
1086 while (k
< len0
&& isdigit (encoded
[k
]))
1090 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1093 /* Just as an extra precaution, make sure that if this
1094 suffix is followed by anything else, it is a '_'.
1095 Otherwise, we matched this sequence by accident. */
1097 || (k
< len0
&& encoded
[k
] == '_'))
1102 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1103 the GNAT front-end in protected object subprograms. */
1106 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1108 /* Backtrack a bit up until we reach either the begining of
1109 the encoded name, or "__". Make sure that we only find
1110 digits or lowercase characters. */
1111 const char *ptr
= encoded
+ i
- 1;
1113 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1116 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1120 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1122 /* This is a X[bn]* sequence not separated from the previous
1123 part of the name with a non-alpha-numeric character (in other
1124 words, immediately following an alpha-numeric character), then
1125 verify that it is placed at the end of the encoded name. If
1126 not, then the encoding is not valid and we should abort the
1127 decoding. Otherwise, just skip it, it is used in body-nested
1131 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1135 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1137 /* Replace '__' by '.'. */
1145 /* It's a character part of the decoded name, so just copy it
1147 decoded
[j
] = encoded
[i
];
1152 decoded
[j
] = '\000';
1154 /* Decoded names should never contain any uppercase character.
1155 Double-check this, and abort the decoding if we find one. */
1157 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1158 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1161 if (strcmp (decoded
, encoded
) == 0)
1167 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1168 decoded
= decoding_buffer
;
1169 if (encoded
[0] == '<')
1170 strcpy (decoded
, encoded
);
1172 sprintf (decoded
, "<%s>", encoded
);
1177 /* Table for keeping permanent unique copies of decoded names. Once
1178 allocated, names in this table are never released. While this is a
1179 storage leak, it should not be significant unless there are massive
1180 changes in the set of decoded names in successive versions of a
1181 symbol table loaded during a single session. */
1182 static struct htab
*decoded_names_store
;
1184 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1185 in the language-specific part of GSYMBOL, if it has not been
1186 previously computed. Tries to save the decoded name in the same
1187 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1188 in any case, the decoded symbol has a lifetime at least that of
1190 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1191 const, but nevertheless modified to a semantically equivalent form
1192 when a decoded name is cached in it.
1196 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1199 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1200 if (*resultp
== NULL
)
1202 const char *decoded
= ada_decode (gsymbol
->name
);
1203 if (gsymbol
->obj_section
!= NULL
)
1205 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1206 *resultp
= obsavestring (decoded
, strlen (decoded
),
1207 &objf
->objfile_obstack
);
1209 /* Sometimes, we can't find a corresponding objfile, in which
1210 case, we put the result on the heap. Since we only decode
1211 when needed, we hope this usually does not cause a
1212 significant memory leak (FIXME). */
1213 if (*resultp
== NULL
)
1215 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1218 *slot
= xstrdup (decoded
);
1227 ada_la_decode (const char *encoded
, int options
)
1229 return xstrdup (ada_decode (encoded
));
1232 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1233 suffixes that encode debugging information or leading _ada_ on
1234 SYM_NAME (see is_name_suffix commentary for the debugging
1235 information that is ignored). If WILD, then NAME need only match a
1236 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1237 either argument is NULL. */
1240 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1242 if (sym_name
== NULL
|| name
== NULL
)
1245 return wild_match (name
, strlen (name
), sym_name
);
1248 int len_name
= strlen (name
);
1249 return (strncmp (sym_name
, name
, len_name
) == 0
1250 && is_name_suffix (sym_name
+ len_name
))
1251 || (strncmp (sym_name
, "_ada_", 5) == 0
1252 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1253 && is_name_suffix (sym_name
+ len_name
+ 5));
1257 /* True (non-zero) iff, in Ada mode, the symbol SYM should be
1258 suppressed in info listings. */
1261 ada_suppress_symbol_printing (struct symbol
*sym
)
1263 if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
)
1266 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym
));
1272 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1274 static char *bound_name
[] = {
1275 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1276 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1279 /* Maximum number of array dimensions we are prepared to handle. */
1281 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1283 /* Like modify_field, but allows bitpos > wordlength. */
1286 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1288 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1292 /* The desc_* routines return primitive portions of array descriptors
1295 /* The descriptor or array type, if any, indicated by TYPE; removes
1296 level of indirection, if needed. */
1298 static struct type
*
1299 desc_base_type (struct type
*type
)
1303 type
= ada_check_typedef (type
);
1305 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1306 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1307 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1312 /* True iff TYPE indicates a "thin" array pointer type. */
1315 is_thin_pntr (struct type
*type
)
1318 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1319 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1322 /* The descriptor type for thin pointer type TYPE. */
1324 static struct type
*
1325 thin_descriptor_type (struct type
*type
)
1327 struct type
*base_type
= desc_base_type (type
);
1328 if (base_type
== NULL
)
1330 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1334 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1335 if (alt_type
== NULL
)
1342 /* A pointer to the array data for thin-pointer value VAL. */
1344 static struct value
*
1345 thin_data_pntr (struct value
*val
)
1347 struct type
*type
= value_type (val
);
1348 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1349 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1352 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1353 VALUE_ADDRESS (val
) + value_offset (val
));
1356 /* True iff TYPE indicates a "thick" array pointer type. */
1359 is_thick_pntr (struct type
*type
)
1361 type
= desc_base_type (type
);
1362 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1363 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1366 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1367 pointer to one, the type of its bounds data; otherwise, NULL. */
1369 static struct type
*
1370 desc_bounds_type (struct type
*type
)
1374 type
= desc_base_type (type
);
1378 else if (is_thin_pntr (type
))
1380 type
= thin_descriptor_type (type
);
1383 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1385 return ada_check_typedef (r
);
1387 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1389 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1391 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1396 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1397 one, a pointer to its bounds data. Otherwise NULL. */
1399 static struct value
*
1400 desc_bounds (struct value
*arr
)
1402 struct type
*type
= ada_check_typedef (value_type (arr
));
1403 if (is_thin_pntr (type
))
1405 struct type
*bounds_type
=
1406 desc_bounds_type (thin_descriptor_type (type
));
1409 if (bounds_type
== NULL
)
1410 error (_("Bad GNAT array descriptor"));
1412 /* NOTE: The following calculation is not really kosher, but
1413 since desc_type is an XVE-encoded type (and shouldn't be),
1414 the correct calculation is a real pain. FIXME (and fix GCC). */
1415 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1416 addr
= value_as_long (arr
);
1418 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1421 value_from_longest (lookup_pointer_type (bounds_type
),
1422 addr
- TYPE_LENGTH (bounds_type
));
1425 else if (is_thick_pntr (type
))
1426 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1427 _("Bad GNAT array descriptor"));
1432 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1433 position of the field containing the address of the bounds data. */
1436 fat_pntr_bounds_bitpos (struct type
*type
)
1438 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1441 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1442 size of the field containing the address of the bounds data. */
1445 fat_pntr_bounds_bitsize (struct type
*type
)
1447 type
= desc_base_type (type
);
1449 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1450 return TYPE_FIELD_BITSIZE (type
, 1);
1452 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1455 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1456 pointer to one, the type of its array data (a
1457 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1458 ada_type_of_array to get an array type with bounds data. */
1460 static struct type
*
1461 desc_data_type (struct type
*type
)
1463 type
= desc_base_type (type
);
1465 /* NOTE: The following is bogus; see comment in desc_bounds. */
1466 if (is_thin_pntr (type
))
1467 return lookup_pointer_type
1468 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1469 else if (is_thick_pntr (type
))
1470 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1475 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1478 static struct value
*
1479 desc_data (struct value
*arr
)
1481 struct type
*type
= value_type (arr
);
1482 if (is_thin_pntr (type
))
1483 return thin_data_pntr (arr
);
1484 else if (is_thick_pntr (type
))
1485 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1486 _("Bad GNAT array descriptor"));
1492 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1493 position of the field containing the address of the data. */
1496 fat_pntr_data_bitpos (struct type
*type
)
1498 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1501 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1502 size of the field containing the address of the data. */
1505 fat_pntr_data_bitsize (struct type
*type
)
1507 type
= desc_base_type (type
);
1509 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1510 return TYPE_FIELD_BITSIZE (type
, 0);
1512 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1515 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1516 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1517 bound, if WHICH is 1. The first bound is I=1. */
1519 static struct value
*
1520 desc_one_bound (struct value
*bounds
, int i
, int which
)
1522 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1523 _("Bad GNAT array descriptor bounds"));
1526 /* If BOUNDS is an array-bounds structure type, return the bit position
1527 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1528 bound, if WHICH is 1. The first bound is I=1. */
1531 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1533 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1536 /* If BOUNDS is an array-bounds structure type, return the bit field size
1537 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1538 bound, if WHICH is 1. The first bound is I=1. */
1541 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1543 type
= desc_base_type (type
);
1545 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1546 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1548 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1551 /* If TYPE is the type of an array-bounds structure, the type of its
1552 Ith bound (numbering from 1). Otherwise, NULL. */
1554 static struct type
*
1555 desc_index_type (struct type
*type
, int i
)
1557 type
= desc_base_type (type
);
1559 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1560 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1565 /* The number of index positions in the array-bounds type TYPE.
1566 Return 0 if TYPE is NULL. */
1569 desc_arity (struct type
*type
)
1571 type
= desc_base_type (type
);
1574 return TYPE_NFIELDS (type
) / 2;
1578 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1579 an array descriptor type (representing an unconstrained array
1583 ada_is_direct_array_type (struct type
*type
)
1587 type
= ada_check_typedef (type
);
1588 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1589 || ada_is_array_descriptor_type (type
));
1592 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1596 ada_is_array_type (struct type
*type
)
1599 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1600 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1601 type
= TYPE_TARGET_TYPE (type
);
1602 return ada_is_direct_array_type (type
);
1605 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1608 ada_is_simple_array_type (struct type
*type
)
1612 type
= ada_check_typedef (type
);
1613 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1614 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1615 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1618 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1621 ada_is_array_descriptor_type (struct type
*type
)
1623 struct type
*data_type
= desc_data_type (type
);
1627 type
= ada_check_typedef (type
);
1630 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1631 && TYPE_TARGET_TYPE (data_type
) != NULL
1632 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1633 || TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1634 && desc_arity (desc_bounds_type (type
)) > 0;
1637 /* Non-zero iff type is a partially mal-formed GNAT array
1638 descriptor. FIXME: This is to compensate for some problems with
1639 debugging output from GNAT. Re-examine periodically to see if it
1643 ada_is_bogus_array_descriptor (struct type
*type
)
1647 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1648 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1649 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1650 && !ada_is_array_descriptor_type (type
);
1654 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1655 (fat pointer) returns the type of the array data described---specifically,
1656 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1657 in from the descriptor; otherwise, they are left unspecified. If
1658 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1659 returns NULL. The result is simply the type of ARR if ARR is not
1662 ada_type_of_array (struct value
*arr
, int bounds
)
1664 if (ada_is_packed_array_type (value_type (arr
)))
1665 return decode_packed_array_type (value_type (arr
));
1667 if (!ada_is_array_descriptor_type (value_type (arr
)))
1668 return value_type (arr
);
1672 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr
))));
1675 struct type
*elt_type
;
1677 struct value
*descriptor
;
1678 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1680 elt_type
= ada_array_element_type (value_type (arr
), -1);
1681 arity
= ada_array_arity (value_type (arr
));
1683 if (elt_type
== NULL
|| arity
== 0)
1684 return ada_check_typedef (value_type (arr
));
1686 descriptor
= desc_bounds (arr
);
1687 if (value_as_long (descriptor
) == 0)
1691 struct type
*range_type
= alloc_type (objf
);
1692 struct type
*array_type
= alloc_type (objf
);
1693 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1694 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1697 create_range_type (range_type
, value_type (low
),
1698 longest_to_int (value_as_long (low
)),
1699 longest_to_int (value_as_long (high
)));
1700 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1703 return lookup_pointer_type (elt_type
);
1707 /* If ARR does not represent an array, returns ARR unchanged.
1708 Otherwise, returns either a standard GDB array with bounds set
1709 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1710 GDB array. Returns NULL if ARR is a null fat pointer. */
1713 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1715 if (ada_is_array_descriptor_type (value_type (arr
)))
1717 struct type
*arrType
= ada_type_of_array (arr
, 1);
1718 if (arrType
== NULL
)
1720 return value_cast (arrType
, value_copy (desc_data (arr
)));
1722 else if (ada_is_packed_array_type (value_type (arr
)))
1723 return decode_packed_array (arr
);
1728 /* If ARR does not represent an array, returns ARR unchanged.
1729 Otherwise, returns a standard GDB array describing ARR (which may
1730 be ARR itself if it already is in the proper form). */
1732 static struct value
*
1733 ada_coerce_to_simple_array (struct value
*arr
)
1735 if (ada_is_array_descriptor_type (value_type (arr
)))
1737 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1739 error (_("Bounds unavailable for null array pointer."));
1740 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1741 return value_ind (arrVal
);
1743 else if (ada_is_packed_array_type (value_type (arr
)))
1744 return decode_packed_array (arr
);
1749 /* If TYPE represents a GNAT array type, return it translated to an
1750 ordinary GDB array type (possibly with BITSIZE fields indicating
1751 packing). For other types, is the identity. */
1754 ada_coerce_to_simple_array_type (struct type
*type
)
1756 struct value
*mark
= value_mark ();
1757 struct value
*dummy
= value_from_longest (builtin_type_int32
, 0);
1758 struct type
*result
;
1759 deprecated_set_value_type (dummy
, type
);
1760 result
= ada_type_of_array (dummy
, 0);
1761 value_free_to_mark (mark
);
1765 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1768 ada_is_packed_array_type (struct type
*type
)
1772 type
= desc_base_type (type
);
1773 type
= ada_check_typedef (type
);
1775 ada_type_name (type
) != NULL
1776 && strstr (ada_type_name (type
), "___XP") != NULL
;
1779 /* Given that TYPE is a standard GDB array type with all bounds filled
1780 in, and that the element size of its ultimate scalar constituents
1781 (that is, either its elements, or, if it is an array of arrays, its
1782 elements' elements, etc.) is *ELT_BITS, return an identical type,
1783 but with the bit sizes of its elements (and those of any
1784 constituent arrays) recorded in the BITSIZE components of its
1785 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1788 static struct type
*
1789 packed_array_type (struct type
*type
, long *elt_bits
)
1791 struct type
*new_elt_type
;
1792 struct type
*new_type
;
1793 LONGEST low_bound
, high_bound
;
1795 type
= ada_check_typedef (type
);
1796 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1799 new_type
= alloc_type (TYPE_OBJFILE (type
));
1800 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1802 create_array_type (new_type
, new_elt_type
, TYPE_FIELD_TYPE (type
, 0));
1803 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1804 TYPE_NAME (new_type
) = ada_type_name (type
);
1806 if (get_discrete_bounds (TYPE_FIELD_TYPE (type
, 0),
1807 &low_bound
, &high_bound
) < 0)
1808 low_bound
= high_bound
= 0;
1809 if (high_bound
< low_bound
)
1810 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1813 *elt_bits
*= (high_bound
- low_bound
+ 1);
1814 TYPE_LENGTH (new_type
) =
1815 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1818 TYPE_FIXED_INSTANCE (new_type
) = 1;
1822 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1824 static struct type
*
1825 decode_packed_array_type (struct type
*type
)
1828 struct block
**blocks
;
1829 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1832 struct type
*shadow_type
;
1837 raw_name
= ada_type_name (desc_base_type (type
));
1842 name
= (char *) alloca (strlen (raw_name
) + 1);
1843 tail
= strstr (raw_name
, "___XP");
1844 type
= desc_base_type (type
);
1846 memcpy (name
, raw_name
, tail
- raw_name
);
1847 name
[tail
- raw_name
] = '\000';
1849 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1850 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1852 lim_warning (_("could not find bounds information on packed array"));
1855 shadow_type
= SYMBOL_TYPE (sym
);
1857 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1859 lim_warning (_("could not understand bounds information on packed array"));
1863 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1866 (_("could not understand bit size information on packed array"));
1870 return packed_array_type (shadow_type
, &bits
);
1873 /* Given that ARR is a struct value *indicating a GNAT packed array,
1874 returns a simple array that denotes that array. Its type is a
1875 standard GDB array type except that the BITSIZEs of the array
1876 target types are set to the number of bits in each element, and the
1877 type length is set appropriately. */
1879 static struct value
*
1880 decode_packed_array (struct value
*arr
)
1884 arr
= ada_coerce_ref (arr
);
1885 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1886 arr
= ada_value_ind (arr
);
1888 type
= decode_packed_array_type (value_type (arr
));
1891 error (_("can't unpack array"));
1895 if (gdbarch_bits_big_endian (current_gdbarch
)
1896 && ada_is_modular_type (value_type (arr
)))
1898 /* This is a (right-justified) modular type representing a packed
1899 array with no wrapper. In order to interpret the value through
1900 the (left-justified) packed array type we just built, we must
1901 first left-justify it. */
1902 int bit_size
, bit_pos
;
1905 mod
= ada_modulus (value_type (arr
)) - 1;
1912 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1913 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1914 bit_pos
/ HOST_CHAR_BIT
,
1915 bit_pos
% HOST_CHAR_BIT
,
1920 return coerce_unspec_val_to_type (arr
, type
);
1924 /* The value of the element of packed array ARR at the ARITY indices
1925 given in IND. ARR must be a simple array. */
1927 static struct value
*
1928 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1931 int bits
, elt_off
, bit_off
;
1932 long elt_total_bit_offset
;
1933 struct type
*elt_type
;
1937 elt_total_bit_offset
= 0;
1938 elt_type
= ada_check_typedef (value_type (arr
));
1939 for (i
= 0; i
< arity
; i
+= 1)
1941 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1942 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1944 (_("attempt to do packed indexing of something other than a packed array"));
1947 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1948 LONGEST lowerbound
, upperbound
;
1951 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1953 lim_warning (_("don't know bounds of array"));
1954 lowerbound
= upperbound
= 0;
1957 idx
= pos_atr (ind
[i
]);
1958 if (idx
< lowerbound
|| idx
> upperbound
)
1959 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1960 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1961 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1962 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1965 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1966 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1968 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1973 /* Non-zero iff TYPE includes negative integer values. */
1976 has_negatives (struct type
*type
)
1978 switch (TYPE_CODE (type
))
1983 return !TYPE_UNSIGNED (type
);
1984 case TYPE_CODE_RANGE
:
1985 return TYPE_LOW_BOUND (type
) < 0;
1990 /* Create a new value of type TYPE from the contents of OBJ starting
1991 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1992 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1993 assigning through the result will set the field fetched from.
1994 VALADDR is ignored unless OBJ is NULL, in which case,
1995 VALADDR+OFFSET must address the start of storage containing the
1996 packed value. The value returned in this case is never an lval.
1997 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2000 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2001 long offset
, int bit_offset
, int bit_size
,
2005 int src
, /* Index into the source area */
2006 targ
, /* Index into the target area */
2007 srcBitsLeft
, /* Number of source bits left to move */
2008 nsrc
, ntarg
, /* Number of source and target bytes */
2009 unusedLS
, /* Number of bits in next significant
2010 byte of source that are unused */
2011 accumSize
; /* Number of meaningful bits in accum */
2012 unsigned char *bytes
; /* First byte containing data to unpack */
2013 unsigned char *unpacked
;
2014 unsigned long accum
; /* Staging area for bits being transferred */
2016 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2017 /* Transmit bytes from least to most significant; delta is the direction
2018 the indices move. */
2019 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
2021 type
= ada_check_typedef (type
);
2025 v
= allocate_value (type
);
2026 bytes
= (unsigned char *) (valaddr
+ offset
);
2028 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2031 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
2032 bytes
= (unsigned char *) alloca (len
);
2033 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
2037 v
= allocate_value (type
);
2038 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2043 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
2044 if (VALUE_LVAL (obj
) == lval_internalvar
)
2045 VALUE_LVAL (v
) = lval_internalvar_component
;
2046 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
;
2047 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2048 set_value_bitsize (v
, bit_size
);
2049 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2051 VALUE_ADDRESS (v
) += 1;
2052 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2056 set_value_bitsize (v
, bit_size
);
2057 unpacked
= (unsigned char *) value_contents (v
);
2059 srcBitsLeft
= bit_size
;
2061 ntarg
= TYPE_LENGTH (type
);
2065 memset (unpacked
, 0, TYPE_LENGTH (type
));
2068 else if (gdbarch_bits_big_endian (current_gdbarch
))
2071 if (has_negatives (type
)
2072 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2076 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2079 switch (TYPE_CODE (type
))
2081 case TYPE_CODE_ARRAY
:
2082 case TYPE_CODE_UNION
:
2083 case TYPE_CODE_STRUCT
:
2084 /* Non-scalar values must be aligned at a byte boundary... */
2086 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2087 /* ... And are placed at the beginning (most-significant) bytes
2089 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2093 targ
= TYPE_LENGTH (type
) - 1;
2099 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2102 unusedLS
= bit_offset
;
2105 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2112 /* Mask for removing bits of the next source byte that are not
2113 part of the value. */
2114 unsigned int unusedMSMask
=
2115 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2117 /* Sign-extend bits for this byte. */
2118 unsigned int signMask
= sign
& ~unusedMSMask
;
2120 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2121 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2122 if (accumSize
>= HOST_CHAR_BIT
)
2124 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2125 accumSize
-= HOST_CHAR_BIT
;
2126 accum
>>= HOST_CHAR_BIT
;
2130 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2137 accum
|= sign
<< accumSize
;
2138 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2139 accumSize
-= HOST_CHAR_BIT
;
2140 accum
>>= HOST_CHAR_BIT
;
2148 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2149 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2152 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2153 int src_offset
, int n
)
2155 unsigned int accum
, mask
;
2156 int accum_bits
, chunk_size
;
2158 target
+= targ_offset
/ HOST_CHAR_BIT
;
2159 targ_offset
%= HOST_CHAR_BIT
;
2160 source
+= src_offset
/ HOST_CHAR_BIT
;
2161 src_offset
%= HOST_CHAR_BIT
;
2162 if (gdbarch_bits_big_endian (current_gdbarch
))
2164 accum
= (unsigned char) *source
;
2166 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2171 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2172 accum_bits
+= HOST_CHAR_BIT
;
2174 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2177 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2178 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2181 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2183 accum_bits
-= chunk_size
;
2190 accum
= (unsigned char) *source
>> src_offset
;
2192 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2196 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2197 accum_bits
+= HOST_CHAR_BIT
;
2199 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2202 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2203 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2205 accum_bits
-= chunk_size
;
2206 accum
>>= chunk_size
;
2213 /* Store the contents of FROMVAL into the location of TOVAL.
2214 Return a new value with the location of TOVAL and contents of
2215 FROMVAL. Handles assignment into packed fields that have
2216 floating-point or non-scalar types. */
2218 static struct value
*
2219 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2221 struct type
*type
= value_type (toval
);
2222 int bits
= value_bitsize (toval
);
2224 toval
= ada_coerce_ref (toval
);
2225 fromval
= ada_coerce_ref (fromval
);
2227 if (ada_is_direct_array_type (value_type (toval
)))
2228 toval
= ada_coerce_to_simple_array (toval
);
2229 if (ada_is_direct_array_type (value_type (fromval
)))
2230 fromval
= ada_coerce_to_simple_array (fromval
);
2232 if (!deprecated_value_modifiable (toval
))
2233 error (_("Left operand of assignment is not a modifiable lvalue."));
2235 if (VALUE_LVAL (toval
) == lval_memory
2237 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2238 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2240 int len
= (value_bitpos (toval
)
2241 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2243 char *buffer
= (char *) alloca (len
);
2245 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2247 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2248 fromval
= value_cast (type
, fromval
);
2250 read_memory (to_addr
, buffer
, len
);
2251 from_size
= value_bitsize (fromval
);
2253 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2254 if (gdbarch_bits_big_endian (current_gdbarch
))
2255 move_bits (buffer
, value_bitpos (toval
),
2256 value_contents (fromval
), from_size
- bits
, bits
);
2258 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2260 write_memory (to_addr
, buffer
, len
);
2261 if (deprecated_memory_changed_hook
)
2262 deprecated_memory_changed_hook (to_addr
, len
);
2264 val
= value_copy (toval
);
2265 memcpy (value_contents_raw (val
), value_contents (fromval
),
2266 TYPE_LENGTH (type
));
2267 deprecated_set_value_type (val
, type
);
2272 return value_assign (toval
, fromval
);
2276 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2277 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2278 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2279 * COMPONENT, and not the inferior's memory. The current contents
2280 * of COMPONENT are ignored. */
2282 value_assign_to_component (struct value
*container
, struct value
*component
,
2285 LONGEST offset_in_container
=
2286 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2287 - VALUE_ADDRESS (container
) - value_offset (container
));
2288 int bit_offset_in_container
=
2289 value_bitpos (component
) - value_bitpos (container
);
2292 val
= value_cast (value_type (component
), val
);
2294 if (value_bitsize (component
) == 0)
2295 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2297 bits
= value_bitsize (component
);
2299 if (gdbarch_bits_big_endian (current_gdbarch
))
2300 move_bits (value_contents_writeable (container
) + offset_in_container
,
2301 value_bitpos (container
) + bit_offset_in_container
,
2302 value_contents (val
),
2303 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2306 move_bits (value_contents_writeable (container
) + offset_in_container
,
2307 value_bitpos (container
) + bit_offset_in_container
,
2308 value_contents (val
), 0, bits
);
2311 /* The value of the element of array ARR at the ARITY indices given in IND.
2312 ARR may be either a simple array, GNAT array descriptor, or pointer
2316 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2320 struct type
*elt_type
;
2322 elt
= ada_coerce_to_simple_array (arr
);
2324 elt_type
= ada_check_typedef (value_type (elt
));
2325 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2326 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2327 return value_subscript_packed (elt
, arity
, ind
);
2329 for (k
= 0; k
< arity
; k
+= 1)
2331 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2332 error (_("too many subscripts (%d expected)"), k
);
2333 elt
= value_subscript (elt
, value_pos_atr (builtin_type_int32
, ind
[k
]));
2338 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2339 value of the element of *ARR at the ARITY indices given in
2340 IND. Does not read the entire array into memory. */
2343 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2348 for (k
= 0; k
< arity
; k
+= 1)
2353 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2354 error (_("too many subscripts (%d expected)"), k
);
2355 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2357 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2358 idx
= value_pos_atr (builtin_type_int32
, ind
[k
]);
2360 idx
= value_binop (idx
, value_from_longest (value_type (idx
), lwb
),
2363 arr
= value_ptradd (arr
, idx
);
2364 type
= TYPE_TARGET_TYPE (type
);
2367 return value_ind (arr
);
2370 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2371 actual type of ARRAY_PTR is ignored), returns a reference to
2372 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2373 bound of this array is LOW, as per Ada rules. */
2374 static struct value
*
2375 ada_value_slice_ptr (struct value
*array_ptr
, struct type
*type
,
2378 CORE_ADDR base
= value_as_address (array_ptr
)
2379 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2380 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2381 struct type
*index_type
=
2382 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2384 struct type
*slice_type
=
2385 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2386 return value_from_pointer (lookup_reference_type (slice_type
), base
);
2390 static struct value
*
2391 ada_value_slice (struct value
*array
, int low
, int high
)
2393 struct type
*type
= value_type (array
);
2394 struct type
*index_type
=
2395 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2396 struct type
*slice_type
=
2397 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2398 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2401 /* If type is a record type in the form of a standard GNAT array
2402 descriptor, returns the number of dimensions for type. If arr is a
2403 simple array, returns the number of "array of"s that prefix its
2404 type designation. Otherwise, returns 0. */
2407 ada_array_arity (struct type
*type
)
2414 type
= desc_base_type (type
);
2417 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2418 return desc_arity (desc_bounds_type (type
));
2420 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2423 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2429 /* If TYPE is a record type in the form of a standard GNAT array
2430 descriptor or a simple array type, returns the element type for
2431 TYPE after indexing by NINDICES indices, or by all indices if
2432 NINDICES is -1. Otherwise, returns NULL. */
2435 ada_array_element_type (struct type
*type
, int nindices
)
2437 type
= desc_base_type (type
);
2439 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2442 struct type
*p_array_type
;
2444 p_array_type
= desc_data_type (type
);
2446 k
= ada_array_arity (type
);
2450 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2451 if (nindices
>= 0 && k
> nindices
)
2453 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
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. */
2478 ada_index_type (struct type
*type
, int n
)
2480 struct type
*result_type
;
2482 type
= desc_base_type (type
);
2484 if (n
> ada_array_arity (type
))
2487 if (ada_is_simple_array_type (type
))
2491 for (i
= 1; i
< n
; i
+= 1)
2492 type
= TYPE_TARGET_TYPE (type
);
2493 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2494 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2495 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2496 perhaps stabsread.c would make more sense. */
2497 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2498 result_type
= builtin_type_int32
;
2503 return desc_index_type (desc_bounds_type (type
), n
);
2506 /* Given that arr is an array type, returns the lower bound of the
2507 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2508 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2509 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2510 bounds type. It works for other arrays with bounds supplied by
2511 run-time quantities other than discriminants. */
2514 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2515 struct type
** typep
)
2518 struct type
*index_type_desc
;
2520 if (ada_is_packed_array_type (arr_type
))
2521 arr_type
= decode_packed_array_type (arr_type
);
2523 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2526 *typep
= builtin_type_int32
;
2527 return (LONGEST
) - which
;
2530 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2531 type
= TYPE_TARGET_TYPE (arr_type
);
2535 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2536 if (index_type_desc
== NULL
)
2538 struct type
*index_type
;
2542 type
= TYPE_TARGET_TYPE (type
);
2546 index_type
= TYPE_INDEX_TYPE (type
);
2548 *typep
= index_type
;
2550 /* The index type is either a range type or an enumerated type.
2551 For the range type, we have some macros that allow us to
2552 extract the value of the low and high bounds. But they
2553 do now work for enumerated types. The expressions used
2554 below work for both range and enum types. */
2556 (LONGEST
) (which
== 0
2557 ? TYPE_FIELD_BITPOS (index_type
, 0)
2558 : TYPE_FIELD_BITPOS (index_type
,
2559 TYPE_NFIELDS (index_type
) - 1));
2563 struct type
*index_type
=
2564 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2565 NULL
, TYPE_OBJFILE (arr_type
));
2568 *typep
= index_type
;
2571 (LONGEST
) (which
== 0
2572 ? TYPE_LOW_BOUND (index_type
)
2573 : TYPE_HIGH_BOUND (index_type
));
2577 /* Given that arr is an array value, returns the lower bound of the
2578 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2579 WHICH is 1. This routine will also work for arrays with bounds
2580 supplied by run-time quantities other than discriminants. */
2583 ada_array_bound (struct value
*arr
, int n
, int which
)
2585 struct type
*arr_type
= value_type (arr
);
2587 if (ada_is_packed_array_type (arr_type
))
2588 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2589 else if (ada_is_simple_array_type (arr_type
))
2592 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2593 return value_from_longest (type
, v
);
2596 return desc_one_bound (desc_bounds (arr
), n
, which
);
2599 /* Given that arr is an array value, returns the length of the
2600 nth index. This routine will also work for arrays with bounds
2601 supplied by run-time quantities other than discriminants.
2602 Does not work for arrays indexed by enumeration types with representation
2603 clauses at the moment. */
2606 ada_array_length (struct value
*arr
, int n
)
2608 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2610 if (ada_is_packed_array_type (arr_type
))
2611 return ada_array_length (decode_packed_array (arr
), n
);
2613 if (ada_is_simple_array_type (arr_type
))
2617 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2618 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2619 return value_from_longest (type
, v
);
2623 value_from_longest (builtin_type_int32
,
2624 value_as_long (desc_one_bound (desc_bounds (arr
),
2626 - value_as_long (desc_one_bound (desc_bounds (arr
),
2630 /* An empty array whose type is that of ARR_TYPE (an array type),
2631 with bounds LOW to LOW-1. */
2633 static struct value
*
2634 empty_array (struct type
*arr_type
, int low
)
2636 struct type
*index_type
=
2637 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2639 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2640 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2644 /* Name resolution */
2646 /* The "decoded" name for the user-definable Ada operator corresponding
2650 ada_decoded_op_name (enum exp_opcode op
)
2654 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2656 if (ada_opname_table
[i
].op
== op
)
2657 return ada_opname_table
[i
].decoded
;
2659 error (_("Could not find operator name for opcode"));
2663 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2664 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2665 undefined namespace) and converts operators that are
2666 user-defined into appropriate function calls. If CONTEXT_TYPE is
2667 non-null, it provides a preferred result type [at the moment, only
2668 type void has any effect---causing procedures to be preferred over
2669 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2670 return type is preferred. May change (expand) *EXP. */
2673 resolve (struct expression
**expp
, int void_context_p
)
2677 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2680 /* Resolve the operator of the subexpression beginning at
2681 position *POS of *EXPP. "Resolving" consists of replacing
2682 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2683 with their resolutions, replacing built-in operators with
2684 function calls to user-defined operators, where appropriate, and,
2685 when DEPROCEDURE_P is non-zero, converting function-valued variables
2686 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2687 are as in ada_resolve, above. */
2689 static struct value
*
2690 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2691 struct type
*context_type
)
2695 struct expression
*exp
; /* Convenience: == *expp. */
2696 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2697 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2698 int nargs
; /* Number of operands. */
2705 /* Pass one: resolve operands, saving their types and updating *pos,
2710 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2711 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2716 resolve_subexp (expp
, pos
, 0, NULL
);
2718 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2723 resolve_subexp (expp
, pos
, 0, NULL
);
2728 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2731 case OP_ATR_MODULUS
:
2741 case TERNOP_IN_RANGE
:
2742 case BINOP_IN_BOUNDS
:
2748 case OP_DISCRETE_RANGE
:
2750 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2759 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2761 resolve_subexp (expp
, pos
, 1, NULL
);
2763 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2780 case BINOP_LOGICAL_AND
:
2781 case BINOP_LOGICAL_OR
:
2782 case BINOP_BITWISE_AND
:
2783 case BINOP_BITWISE_IOR
:
2784 case BINOP_BITWISE_XOR
:
2787 case BINOP_NOTEQUAL
:
2794 case BINOP_SUBSCRIPT
:
2802 case UNOP_LOGICAL_NOT
:
2818 case OP_INTERNALVAR
:
2828 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2831 case STRUCTOP_STRUCT
:
2832 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2845 error (_("Unexpected operator during name resolution"));
2848 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2849 for (i
= 0; i
< nargs
; i
+= 1)
2850 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2854 /* Pass two: perform any resolution on principal operator. */
2861 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2863 struct ada_symbol_info
*candidates
;
2867 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2868 (exp
->elts
[pc
+ 2].symbol
),
2869 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2872 if (n_candidates
> 1)
2874 /* Types tend to get re-introduced locally, so if there
2875 are any local symbols that are not types, first filter
2878 for (j
= 0; j
< n_candidates
; j
+= 1)
2879 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2884 case LOC_REGPARM_ADDR
:
2892 if (j
< n_candidates
)
2895 while (j
< n_candidates
)
2897 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2899 candidates
[j
] = candidates
[n_candidates
- 1];
2908 if (n_candidates
== 0)
2909 error (_("No definition found for %s"),
2910 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2911 else if (n_candidates
== 1)
2913 else if (deprocedure_p
2914 && !is_nonfunction (candidates
, n_candidates
))
2916 i
= ada_resolve_function
2917 (candidates
, n_candidates
, NULL
, 0,
2918 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2921 error (_("Could not find a match for %s"),
2922 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2926 printf_filtered (_("Multiple matches for %s\n"),
2927 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2928 user_select_syms (candidates
, n_candidates
, 1);
2932 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2933 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2934 if (innermost_block
== NULL
2935 || contained_in (candidates
[i
].block
, innermost_block
))
2936 innermost_block
= candidates
[i
].block
;
2940 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2943 replace_operator_with_call (expp
, pc
, 0, 0,
2944 exp
->elts
[pc
+ 2].symbol
,
2945 exp
->elts
[pc
+ 1].block
);
2952 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2953 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2955 struct ada_symbol_info
*candidates
;
2959 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2960 (exp
->elts
[pc
+ 5].symbol
),
2961 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2963 if (n_candidates
== 1)
2967 i
= ada_resolve_function
2968 (candidates
, n_candidates
,
2970 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2973 error (_("Could not find a match for %s"),
2974 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2977 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2978 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2979 if (innermost_block
== NULL
2980 || contained_in (candidates
[i
].block
, innermost_block
))
2981 innermost_block
= candidates
[i
].block
;
2992 case BINOP_BITWISE_AND
:
2993 case BINOP_BITWISE_IOR
:
2994 case BINOP_BITWISE_XOR
:
2996 case BINOP_NOTEQUAL
:
3004 case UNOP_LOGICAL_NOT
:
3006 if (possible_user_operator_p (op
, argvec
))
3008 struct ada_symbol_info
*candidates
;
3012 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3013 (struct block
*) NULL
, VAR_DOMAIN
,
3015 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3016 ada_decoded_op_name (op
), NULL
);
3020 replace_operator_with_call (expp
, pc
, nargs
, 1,
3021 candidates
[i
].sym
, candidates
[i
].block
);
3032 return evaluate_subexp_type (exp
, pos
);
3035 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3036 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3037 a non-pointer. A type of 'void' (which is never a valid expression type)
3038 by convention matches anything. */
3039 /* The term "match" here is rather loose. The match is heuristic and
3040 liberal. FIXME: TOO liberal, in fact. */
3043 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3045 ftype
= ada_check_typedef (ftype
);
3046 atype
= ada_check_typedef (atype
);
3048 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3049 ftype
= TYPE_TARGET_TYPE (ftype
);
3050 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3051 atype
= TYPE_TARGET_TYPE (atype
);
3053 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3054 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3057 switch (TYPE_CODE (ftype
))
3062 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3063 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3064 TYPE_TARGET_TYPE (atype
), 0);
3067 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3069 case TYPE_CODE_ENUM
:
3070 case TYPE_CODE_RANGE
:
3071 switch (TYPE_CODE (atype
))
3074 case TYPE_CODE_ENUM
:
3075 case TYPE_CODE_RANGE
:
3081 case TYPE_CODE_ARRAY
:
3082 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3083 || ada_is_array_descriptor_type (atype
));
3085 case TYPE_CODE_STRUCT
:
3086 if (ada_is_array_descriptor_type (ftype
))
3087 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3088 || ada_is_array_descriptor_type (atype
));
3090 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3091 && !ada_is_array_descriptor_type (atype
));
3093 case TYPE_CODE_UNION
:
3095 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3099 /* Return non-zero if the formals of FUNC "sufficiently match" the
3100 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3101 may also be an enumeral, in which case it is treated as a 0-
3102 argument function. */
3105 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3108 struct type
*func_type
= SYMBOL_TYPE (func
);
3110 if (SYMBOL_CLASS (func
) == LOC_CONST
3111 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3112 return (n_actuals
== 0);
3113 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3116 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3119 for (i
= 0; i
< n_actuals
; i
+= 1)
3121 if (actuals
[i
] == NULL
)
3125 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3126 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3128 if (!ada_type_match (ftype
, atype
, 1))
3135 /* False iff function type FUNC_TYPE definitely does not produce a value
3136 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3137 FUNC_TYPE is not a valid function type with a non-null return type
3138 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3141 return_match (struct type
*func_type
, struct type
*context_type
)
3143 struct type
*return_type
;
3145 if (func_type
== NULL
)
3148 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3149 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3151 return_type
= base_type (func_type
);
3152 if (return_type
== NULL
)
3155 context_type
= base_type (context_type
);
3157 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3158 return context_type
== NULL
|| return_type
== context_type
;
3159 else if (context_type
== NULL
)
3160 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3162 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3166 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3167 function (if any) that matches the types of the NARGS arguments in
3168 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3169 that returns that type, then eliminate matches that don't. If
3170 CONTEXT_TYPE is void and there is at least one match that does not
3171 return void, eliminate all matches that do.
3173 Asks the user if there is more than one match remaining. Returns -1
3174 if there is no such symbol or none is selected. NAME is used
3175 solely for messages. May re-arrange and modify SYMS in
3176 the process; the index returned is for the modified vector. */
3179 ada_resolve_function (struct ada_symbol_info syms
[],
3180 int nsyms
, struct value
**args
, int nargs
,
3181 const char *name
, struct type
*context_type
)
3184 int m
; /* Number of hits */
3185 struct type
*fallback
;
3186 struct type
*return_type
;
3188 return_type
= context_type
;
3189 if (context_type
== NULL
)
3190 fallback
= builtin_type_void
;
3197 for (k
= 0; k
< nsyms
; k
+= 1)
3199 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3201 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3202 && return_match (type
, return_type
))
3208 if (m
> 0 || return_type
== fallback
)
3211 return_type
= fallback
;
3218 printf_filtered (_("Multiple matches for %s\n"), name
);
3219 user_select_syms (syms
, m
, 1);
3225 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3226 in a listing of choices during disambiguation (see sort_choices, below).
3227 The idea is that overloadings of a subprogram name from the
3228 same package should sort in their source order. We settle for ordering
3229 such symbols by their trailing number (__N or $N). */
3232 encoded_ordered_before (char *N0
, char *N1
)
3236 else if (N0
== NULL
)
3241 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3243 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3245 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3246 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3250 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3253 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3255 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3256 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3258 return (strcmp (N0
, N1
) < 0);
3262 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3266 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3269 for (i
= 1; i
< nsyms
; i
+= 1)
3271 struct ada_symbol_info sym
= syms
[i
];
3274 for (j
= i
- 1; j
>= 0; j
-= 1)
3276 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3277 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3279 syms
[j
+ 1] = syms
[j
];
3285 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3286 by asking the user (if necessary), returning the number selected,
3287 and setting the first elements of SYMS items. Error if no symbols
3290 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3291 to be re-integrated one of these days. */
3294 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3297 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3299 int first_choice
= (max_results
== 1) ? 1 : 2;
3300 const char *select_mode
= multiple_symbols_select_mode ();
3302 if (max_results
< 1)
3303 error (_("Request to select 0 symbols!"));
3307 if (select_mode
== multiple_symbols_cancel
)
3309 canceled because the command is ambiguous\n\
3310 See set/show multiple-symbol."));
3312 /* If select_mode is "all", then return all possible symbols.
3313 Only do that if more than one symbol can be selected, of course.
3314 Otherwise, display the menu as usual. */
3315 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3318 printf_unfiltered (_("[0] cancel\n"));
3319 if (max_results
> 1)
3320 printf_unfiltered (_("[1] all\n"));
3322 sort_choices (syms
, nsyms
);
3324 for (i
= 0; i
< nsyms
; i
+= 1)
3326 if (syms
[i
].sym
== NULL
)
3329 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3331 struct symtab_and_line sal
=
3332 find_function_start_sal (syms
[i
].sym
, 1);
3333 if (sal
.symtab
== NULL
)
3334 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3336 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3339 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3340 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3341 sal
.symtab
->filename
, sal
.line
);
3347 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3348 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3349 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3350 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3352 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3353 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3355 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3356 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3357 else if (is_enumeral
3358 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3360 printf_unfiltered (("[%d] "), i
+ first_choice
);
3361 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3363 printf_unfiltered (_("'(%s) (enumeral)\n"),
3364 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3366 else if (symtab
!= NULL
)
3367 printf_unfiltered (is_enumeral
3368 ? _("[%d] %s in %s (enumeral)\n")
3369 : _("[%d] %s at %s:?\n"),
3371 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3374 printf_unfiltered (is_enumeral
3375 ? _("[%d] %s (enumeral)\n")
3376 : _("[%d] %s at ?\n"),
3378 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3382 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3385 for (i
= 0; i
< n_chosen
; i
+= 1)
3386 syms
[i
] = syms
[chosen
[i
]];
3391 /* Read and validate a set of numeric choices from the user in the
3392 range 0 .. N_CHOICES-1. Place the results in increasing
3393 order in CHOICES[0 .. N-1], and return N.
3395 The user types choices as a sequence of numbers on one line
3396 separated by blanks, encoding them as follows:
3398 + A choice of 0 means to cancel the selection, throwing an error.
3399 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3400 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3402 The user is not allowed to choose more than MAX_RESULTS values.
3404 ANNOTATION_SUFFIX, if present, is used to annotate the input
3405 prompts (for use with the -f switch). */
3408 get_selections (int *choices
, int n_choices
, int max_results
,
3409 int is_all_choice
, char *annotation_suffix
)
3414 int first_choice
= is_all_choice
? 2 : 1;
3416 prompt
= getenv ("PS2");
3420 args
= command_line_input (prompt
, 0, annotation_suffix
);
3423 error_no_arg (_("one or more choice numbers"));
3427 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3428 order, as given in args. Choices are validated. */
3434 while (isspace (*args
))
3436 if (*args
== '\0' && n_chosen
== 0)
3437 error_no_arg (_("one or more choice numbers"));
3438 else if (*args
== '\0')
3441 choice
= strtol (args
, &args2
, 10);
3442 if (args
== args2
|| choice
< 0
3443 || choice
> n_choices
+ first_choice
- 1)
3444 error (_("Argument must be choice number"));
3448 error (_("cancelled"));
3450 if (choice
< first_choice
)
3452 n_chosen
= n_choices
;
3453 for (j
= 0; j
< n_choices
; j
+= 1)
3457 choice
-= first_choice
;
3459 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3463 if (j
< 0 || choice
!= choices
[j
])
3466 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3467 choices
[k
+ 1] = choices
[k
];
3468 choices
[j
+ 1] = choice
;
3473 if (n_chosen
> max_results
)
3474 error (_("Select no more than %d of the above"), max_results
);
3479 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3480 on the function identified by SYM and BLOCK, and taking NARGS
3481 arguments. Update *EXPP as needed to hold more space. */
3484 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3485 int oplen
, struct symbol
*sym
,
3486 struct block
*block
)
3488 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3489 symbol, -oplen for operator being replaced). */
3490 struct expression
*newexp
= (struct expression
*)
3491 xmalloc (sizeof (struct expression
)
3492 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3493 struct expression
*exp
= *expp
;
3495 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3496 newexp
->language_defn
= exp
->language_defn
;
3497 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3498 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3499 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3501 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3502 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3504 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3505 newexp
->elts
[pc
+ 4].block
= block
;
3506 newexp
->elts
[pc
+ 5].symbol
= sym
;
3512 /* Type-class predicates */
3514 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3518 numeric_type_p (struct type
*type
)
3524 switch (TYPE_CODE (type
))
3529 case TYPE_CODE_RANGE
:
3530 return (type
== TYPE_TARGET_TYPE (type
)
3531 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3538 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3541 integer_type_p (struct type
*type
)
3547 switch (TYPE_CODE (type
))
3551 case TYPE_CODE_RANGE
:
3552 return (type
== TYPE_TARGET_TYPE (type
)
3553 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3560 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3563 scalar_type_p (struct type
*type
)
3569 switch (TYPE_CODE (type
))
3572 case TYPE_CODE_RANGE
:
3573 case TYPE_CODE_ENUM
:
3582 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3585 discrete_type_p (struct type
*type
)
3591 switch (TYPE_CODE (type
))
3594 case TYPE_CODE_RANGE
:
3595 case TYPE_CODE_ENUM
:
3603 /* Returns non-zero if OP with operands in the vector ARGS could be
3604 a user-defined function. Errs on the side of pre-defined operators
3605 (i.e., result 0). */
3608 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3610 struct type
*type0
=
3611 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3612 struct type
*type1
=
3613 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3627 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3631 case BINOP_BITWISE_AND
:
3632 case BINOP_BITWISE_IOR
:
3633 case BINOP_BITWISE_XOR
:
3634 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3637 case BINOP_NOTEQUAL
:
3642 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3645 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3648 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3652 case UNOP_LOGICAL_NOT
:
3654 return (!numeric_type_p (type0
));
3663 1. In the following, we assume that a renaming type's name may
3664 have an ___XD suffix. It would be nice if this went away at some
3666 2. We handle both the (old) purely type-based representation of
3667 renamings and the (new) variable-based encoding. At some point,
3668 it is devoutly to be hoped that the former goes away
3669 (FIXME: hilfinger-2007-07-09).
3670 3. Subprogram renamings are not implemented, although the XRS
3671 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3673 /* If SYM encodes a renaming,
3675 <renaming> renames <renamed entity>,
3677 sets *LEN to the length of the renamed entity's name,
3678 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3679 the string describing the subcomponent selected from the renamed
3680 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3681 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3682 are undefined). Otherwise, returns a value indicating the category
3683 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3684 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3685 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3686 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3687 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3688 may be NULL, in which case they are not assigned.
3690 [Currently, however, GCC does not generate subprogram renamings.] */
3692 enum ada_renaming_category
3693 ada_parse_renaming (struct symbol
*sym
,
3694 const char **renamed_entity
, int *len
,
3695 const char **renaming_expr
)
3697 enum ada_renaming_category kind
;
3702 return ADA_NOT_RENAMING
;
3703 switch (SYMBOL_CLASS (sym
))
3706 return ADA_NOT_RENAMING
;
3708 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3709 renamed_entity
, len
, renaming_expr
);
3713 case LOC_OPTIMIZED_OUT
:
3714 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3716 return ADA_NOT_RENAMING
;
3720 kind
= ADA_OBJECT_RENAMING
;
3724 kind
= ADA_EXCEPTION_RENAMING
;
3728 kind
= ADA_PACKAGE_RENAMING
;
3732 kind
= ADA_SUBPROGRAM_RENAMING
;
3736 return ADA_NOT_RENAMING
;
3740 if (renamed_entity
!= NULL
)
3741 *renamed_entity
= info
;
3742 suffix
= strstr (info
, "___XE");
3743 if (suffix
== NULL
|| suffix
== info
)
3744 return ADA_NOT_RENAMING
;
3746 *len
= strlen (info
) - strlen (suffix
);
3748 if (renaming_expr
!= NULL
)
3749 *renaming_expr
= suffix
;
3753 /* Assuming TYPE encodes a renaming according to the old encoding in
3754 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3755 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3756 ADA_NOT_RENAMING otherwise. */
3757 static enum ada_renaming_category
3758 parse_old_style_renaming (struct type
*type
,
3759 const char **renamed_entity
, int *len
,
3760 const char **renaming_expr
)
3762 enum ada_renaming_category kind
;
3767 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3768 || TYPE_NFIELDS (type
) != 1)
3769 return ADA_NOT_RENAMING
;
3771 name
= type_name_no_tag (type
);
3773 return ADA_NOT_RENAMING
;
3775 name
= strstr (name
, "___XR");
3777 return ADA_NOT_RENAMING
;
3782 kind
= ADA_OBJECT_RENAMING
;
3785 kind
= ADA_EXCEPTION_RENAMING
;
3788 kind
= ADA_PACKAGE_RENAMING
;
3791 kind
= ADA_SUBPROGRAM_RENAMING
;
3794 return ADA_NOT_RENAMING
;
3797 info
= TYPE_FIELD_NAME (type
, 0);
3799 return ADA_NOT_RENAMING
;
3800 if (renamed_entity
!= NULL
)
3801 *renamed_entity
= info
;
3802 suffix
= strstr (info
, "___XE");
3803 if (renaming_expr
!= NULL
)
3804 *renaming_expr
= suffix
+ 5;
3805 if (suffix
== NULL
|| suffix
== info
)
3806 return ADA_NOT_RENAMING
;
3808 *len
= suffix
- info
;
3814 /* Evaluation: Function Calls */
3816 /* Return an lvalue containing the value VAL. This is the identity on
3817 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3818 on the stack, using and updating *SP as the stack pointer, and
3819 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3821 static struct value
*
3822 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3824 if (! VALUE_LVAL (val
))
3826 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3828 /* The following is taken from the structure-return code in
3829 call_function_by_hand. FIXME: Therefore, some refactoring seems
3831 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3833 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3834 reserving sufficient space. */
3836 if (gdbarch_frame_align_p (current_gdbarch
))
3837 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3838 VALUE_ADDRESS (val
) = *sp
;
3842 /* Stack grows upward. Align the frame, allocate space, and
3843 then again, re-align the frame. */
3844 if (gdbarch_frame_align_p (current_gdbarch
))
3845 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3846 VALUE_ADDRESS (val
) = *sp
;
3848 if (gdbarch_frame_align_p (current_gdbarch
))
3849 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3851 VALUE_LVAL (val
) = lval_memory
;
3853 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3859 /* Return the value ACTUAL, converted to be an appropriate value for a
3860 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3861 allocating any necessary descriptors (fat pointers), or copies of
3862 values not residing in memory, updating it as needed. */
3865 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3868 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3869 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3870 struct type
*formal_target
=
3871 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3872 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3873 struct type
*actual_target
=
3874 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3875 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3877 if (ada_is_array_descriptor_type (formal_target
)
3878 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3879 return make_array_descriptor (formal_type
, actual
, sp
);
3880 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3881 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3883 struct value
*result
;
3884 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3885 && ada_is_array_descriptor_type (actual_target
))
3886 result
= desc_data (actual
);
3887 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3889 if (VALUE_LVAL (actual
) != lval_memory
)
3892 actual_type
= ada_check_typedef (value_type (actual
));
3893 val
= allocate_value (actual_type
);
3894 memcpy ((char *) value_contents_raw (val
),
3895 (char *) value_contents (actual
),
3896 TYPE_LENGTH (actual_type
));
3897 actual
= ensure_lval (val
, sp
);
3899 result
= value_addr (actual
);
3903 return value_cast_pointers (formal_type
, result
);
3905 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3906 return ada_value_ind (actual
);
3912 /* Push a descriptor of type TYPE for array value ARR on the stack at
3913 *SP, updating *SP to reflect the new descriptor. Return either
3914 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3915 to-descriptor type rather than a descriptor type), a struct value *
3916 representing a pointer to this descriptor. */
3918 static struct value
*
3919 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3921 struct type
*bounds_type
= desc_bounds_type (type
);
3922 struct type
*desc_type
= desc_base_type (type
);
3923 struct value
*descriptor
= allocate_value (desc_type
);
3924 struct value
*bounds
= allocate_value (bounds_type
);
3927 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3929 modify_general_field (value_contents_writeable (bounds
),
3930 value_as_long (ada_array_bound (arr
, i
, 0)),
3931 desc_bound_bitpos (bounds_type
, i
, 0),
3932 desc_bound_bitsize (bounds_type
, i
, 0));
3933 modify_general_field (value_contents_writeable (bounds
),
3934 value_as_long (ada_array_bound (arr
, i
, 1)),
3935 desc_bound_bitpos (bounds_type
, i
, 1),
3936 desc_bound_bitsize (bounds_type
, i
, 1));
3939 bounds
= ensure_lval (bounds
, sp
);
3941 modify_general_field (value_contents_writeable (descriptor
),
3942 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3943 fat_pntr_data_bitpos (desc_type
),
3944 fat_pntr_data_bitsize (desc_type
));
3946 modify_general_field (value_contents_writeable (descriptor
),
3947 VALUE_ADDRESS (bounds
),
3948 fat_pntr_bounds_bitpos (desc_type
),
3949 fat_pntr_bounds_bitsize (desc_type
));
3951 descriptor
= ensure_lval (descriptor
, sp
);
3953 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3954 return value_addr (descriptor
);
3959 /* Dummy definitions for an experimental caching module that is not
3960 * used in the public sources. */
3963 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3964 struct symbol
**sym
, struct block
**block
)
3970 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3971 struct block
*block
)
3977 /* Return the result of a standard (literal, C-like) lookup of NAME in
3978 given DOMAIN, visible from lexical block BLOCK. */
3980 static struct symbol
*
3981 standard_lookup (const char *name
, const struct block
*block
,
3986 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3988 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3989 cache_symbol (name
, domain
, sym
, block_found
);
3994 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3995 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3996 since they contend in overloading in the same way. */
3998 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4002 for (i
= 0; i
< n
; i
+= 1)
4003 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4004 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4005 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4011 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4012 struct types. Otherwise, they may not. */
4015 equiv_types (struct type
*type0
, struct type
*type1
)
4019 if (type0
== NULL
|| type1
== NULL
4020 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4022 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4023 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4024 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4025 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4031 /* True iff SYM0 represents the same entity as SYM1, or one that is
4032 no more defined than that of SYM1. */
4035 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4039 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4040 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4043 switch (SYMBOL_CLASS (sym0
))
4049 struct type
*type0
= SYMBOL_TYPE (sym0
);
4050 struct type
*type1
= SYMBOL_TYPE (sym1
);
4051 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4052 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4053 int len0
= strlen (name0
);
4055 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4056 && (equiv_types (type0
, type1
)
4057 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4058 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4061 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4062 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4068 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4069 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4072 add_defn_to_vec (struct obstack
*obstackp
,
4074 struct block
*block
)
4078 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4080 /* Do not try to complete stub types, as the debugger is probably
4081 already scanning all symbols matching a certain name at the
4082 time when this function is called. Trying to replace the stub
4083 type by its associated full type will cause us to restart a scan
4084 which may lead to an infinite recursion. Instead, the client
4085 collecting the matching symbols will end up collecting several
4086 matches, with at least one of them complete. It can then filter
4087 out the stub ones if needed. */
4089 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4091 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4093 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4095 prevDefns
[i
].sym
= sym
;
4096 prevDefns
[i
].block
= block
;
4102 struct ada_symbol_info info
;
4106 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4110 /* Number of ada_symbol_info structures currently collected in
4111 current vector in *OBSTACKP. */
4114 num_defns_collected (struct obstack
*obstackp
)
4116 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4119 /* Vector of ada_symbol_info structures currently collected in current
4120 vector in *OBSTACKP. If FINISH, close off the vector and return
4121 its final address. */
4123 static struct ada_symbol_info
*
4124 defns_collected (struct obstack
*obstackp
, int finish
)
4127 return obstack_finish (obstackp
);
4129 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4132 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4133 Check the global symbols if GLOBAL, the static symbols if not.
4134 Do wild-card match if WILD. */
4136 static struct partial_symbol
*
4137 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4138 int global
, domain_enum
namespace, int wild
)
4140 struct partial_symbol
**start
;
4141 int name_len
= strlen (name
);
4142 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4151 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4152 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4156 for (i
= 0; i
< length
; i
+= 1)
4158 struct partial_symbol
*psym
= start
[i
];
4160 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4161 SYMBOL_DOMAIN (psym
), namespace)
4162 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4176 int M
= (U
+ i
) >> 1;
4177 struct partial_symbol
*psym
= start
[M
];
4178 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4180 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4182 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4193 struct partial_symbol
*psym
= start
[i
];
4195 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4196 SYMBOL_DOMAIN (psym
), namespace))
4198 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4206 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4220 int M
= (U
+ i
) >> 1;
4221 struct partial_symbol
*psym
= start
[M
];
4222 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4224 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4226 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4237 struct partial_symbol
*psym
= start
[i
];
4239 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4240 SYMBOL_DOMAIN (psym
), namespace))
4244 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4247 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4249 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4259 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4269 /* Find a symbol table containing symbol SYM or NULL if none. */
4271 static struct symtab
*
4272 symtab_for_sym (struct symbol
*sym
)
4275 struct objfile
*objfile
;
4277 struct symbol
*tmp_sym
;
4278 struct dict_iterator iter
;
4281 ALL_PRIMARY_SYMTABS (objfile
, s
)
4283 switch (SYMBOL_CLASS (sym
))
4291 case LOC_CONST_BYTES
:
4292 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4293 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4295 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4296 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4302 switch (SYMBOL_CLASS (sym
))
4307 case LOC_REGPARM_ADDR
:
4311 for (j
= FIRST_LOCAL_BLOCK
;
4312 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4314 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4315 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4326 /* Return a minimal symbol matching NAME according to Ada decoding
4327 rules. Returns NULL if there is no such minimal symbol. Names
4328 prefixed with "standard__" are handled specially: "standard__" is
4329 first stripped off, and only static and global symbols are searched. */
4331 struct minimal_symbol
*
4332 ada_lookup_simple_minsym (const char *name
)
4334 struct objfile
*objfile
;
4335 struct minimal_symbol
*msymbol
;
4338 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4340 name
+= sizeof ("standard__") - 1;
4344 wild_match
= (strstr (name
, "__") == NULL
);
4346 ALL_MSYMBOLS (objfile
, msymbol
)
4348 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4349 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4356 /* For all subprograms that statically enclose the subprogram of the
4357 selected frame, add symbols matching identifier NAME in DOMAIN
4358 and their blocks to the list of data in OBSTACKP, as for
4359 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4363 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4364 const char *name
, domain_enum
namespace,
4369 /* True if TYPE is definitely an artificial type supplied to a symbol
4370 for which no debugging information was given in the symbol file. */
4373 is_nondebugging_type (struct type
*type
)
4375 char *name
= ada_type_name (type
);
4376 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4379 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4380 duplicate other symbols in the list (The only case I know of where
4381 this happens is when object files containing stabs-in-ecoff are
4382 linked with files containing ordinary ecoff debugging symbols (or no
4383 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4384 Returns the number of items in the modified list. */
4387 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4396 /* If two symbols have the same name and one of them is a stub type,
4397 the get rid of the stub. */
4399 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4400 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4402 for (j
= 0; j
< nsyms
; j
++)
4405 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4406 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4407 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4408 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4413 /* Two symbols with the same name, same class and same address
4414 should be identical. */
4416 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4417 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4418 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4420 for (j
= 0; j
< nsyms
; j
+= 1)
4423 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4424 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4425 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4426 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4427 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4428 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4435 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4436 syms
[j
- 1] = syms
[j
];
4445 /* Given a type that corresponds to a renaming entity, use the type name
4446 to extract the scope (package name or function name, fully qualified,
4447 and following the GNAT encoding convention) where this renaming has been
4448 defined. The string returned needs to be deallocated after use. */
4451 xget_renaming_scope (struct type
*renaming_type
)
4453 /* The renaming types adhere to the following convention:
4454 <scope>__<rename>___<XR extension>.
4455 So, to extract the scope, we search for the "___XR" extension,
4456 and then backtrack until we find the first "__". */
4458 const char *name
= type_name_no_tag (renaming_type
);
4459 char *suffix
= strstr (name
, "___XR");
4464 /* Now, backtrack a bit until we find the first "__". Start looking
4465 at suffix - 3, as the <rename> part is at least one character long. */
4467 for (last
= suffix
- 3; last
> name
; last
--)
4468 if (last
[0] == '_' && last
[1] == '_')
4471 /* Make a copy of scope and return it. */
4473 scope_len
= last
- name
;
4474 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4476 strncpy (scope
, name
, scope_len
);
4477 scope
[scope_len
] = '\0';
4482 /* Return nonzero if NAME corresponds to a package name. */
4485 is_package_name (const char *name
)
4487 /* Here, We take advantage of the fact that no symbols are generated
4488 for packages, while symbols are generated for each function.
4489 So the condition for NAME represent a package becomes equivalent
4490 to NAME not existing in our list of symbols. There is only one
4491 small complication with library-level functions (see below). */
4495 /* If it is a function that has not been defined at library level,
4496 then we should be able to look it up in the symbols. */
4497 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4500 /* Library-level function names start with "_ada_". See if function
4501 "_ada_" followed by NAME can be found. */
4503 /* Do a quick check that NAME does not contain "__", since library-level
4504 functions names cannot contain "__" in them. */
4505 if (strstr (name
, "__") != NULL
)
4508 fun_name
= xstrprintf ("_ada_%s", name
);
4510 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4513 /* Return nonzero if SYM corresponds to a renaming entity that is
4514 not visible from FUNCTION_NAME. */
4517 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4521 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4524 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4526 make_cleanup (xfree
, scope
);
4528 /* If the rename has been defined in a package, then it is visible. */
4529 if (is_package_name (scope
))
4532 /* Check that the rename is in the current function scope by checking
4533 that its name starts with SCOPE. */
4535 /* If the function name starts with "_ada_", it means that it is
4536 a library-level function. Strip this prefix before doing the
4537 comparison, as the encoding for the renaming does not contain
4539 if (strncmp (function_name
, "_ada_", 5) == 0)
4542 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4545 /* Remove entries from SYMS that corresponds to a renaming entity that
4546 is not visible from the function associated with CURRENT_BLOCK or
4547 that is superfluous due to the presence of more specific renaming
4548 information. Places surviving symbols in the initial entries of
4549 SYMS and returns the number of surviving symbols.
4552 First, in cases where an object renaming is implemented as a
4553 reference variable, GNAT may produce both the actual reference
4554 variable and the renaming encoding. In this case, we discard the
4557 Second, GNAT emits a type following a specified encoding for each renaming
4558 entity. Unfortunately, STABS currently does not support the definition
4559 of types that are local to a given lexical block, so all renamings types
4560 are emitted at library level. As a consequence, if an application
4561 contains two renaming entities using the same name, and a user tries to
4562 print the value of one of these entities, the result of the ada symbol
4563 lookup will also contain the wrong renaming type.
4565 This function partially covers for this limitation by attempting to
4566 remove from the SYMS list renaming symbols that should be visible
4567 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4568 method with the current information available. The implementation
4569 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4571 - When the user tries to print a rename in a function while there
4572 is another rename entity defined in a package: Normally, the
4573 rename in the function has precedence over the rename in the
4574 package, so the latter should be removed from the list. This is
4575 currently not the case.
4577 - This function will incorrectly remove valid renames if
4578 the CURRENT_BLOCK corresponds to a function which symbol name
4579 has been changed by an "Export" pragma. As a consequence,
4580 the user will be unable to print such rename entities. */
4583 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4584 int nsyms
, const struct block
*current_block
)
4586 struct symbol
*current_function
;
4587 char *current_function_name
;
4589 int is_new_style_renaming
;
4591 /* If there is both a renaming foo___XR... encoded as a variable and
4592 a simple variable foo in the same block, discard the latter.
4593 First, zero out such symbols, then compress. */
4594 is_new_style_renaming
= 0;
4595 for (i
= 0; i
< nsyms
; i
+= 1)
4597 struct symbol
*sym
= syms
[i
].sym
;
4598 struct block
*block
= syms
[i
].block
;
4602 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4604 name
= SYMBOL_LINKAGE_NAME (sym
);
4605 suffix
= strstr (name
, "___XR");
4609 int name_len
= suffix
- name
;
4611 is_new_style_renaming
= 1;
4612 for (j
= 0; j
< nsyms
; j
+= 1)
4613 if (i
!= j
&& syms
[j
].sym
!= NULL
4614 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4616 && block
== syms
[j
].block
)
4620 if (is_new_style_renaming
)
4624 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4625 if (syms
[j
].sym
!= NULL
)
4633 /* Extract the function name associated to CURRENT_BLOCK.
4634 Abort if unable to do so. */
4636 if (current_block
== NULL
)
4639 current_function
= block_linkage_function (current_block
);
4640 if (current_function
== NULL
)
4643 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4644 if (current_function_name
== NULL
)
4647 /* Check each of the symbols, and remove it from the list if it is
4648 a type corresponding to a renaming that is out of the scope of
4649 the current block. */
4654 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4655 == ADA_OBJECT_RENAMING
4656 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4659 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4660 syms
[j
- 1] = syms
[j
];
4670 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4671 whose name and domain match NAME and DOMAIN respectively.
4672 If no match was found, then extend the search to "enclosing"
4673 routines (in other words, if we're inside a nested function,
4674 search the symbols defined inside the enclosing functions).
4676 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4679 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4680 struct block
*block
, domain_enum domain
,
4683 int block_depth
= 0;
4685 while (block
!= NULL
)
4688 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4690 /* If we found a non-function match, assume that's the one. */
4691 if (is_nonfunction (defns_collected (obstackp
, 0),
4692 num_defns_collected (obstackp
)))
4695 block
= BLOCK_SUPERBLOCK (block
);
4698 /* If no luck so far, try to find NAME as a local symbol in some lexically
4699 enclosing subprogram. */
4700 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4701 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4704 /* Add to OBSTACKP all non-local symbols whose name and domain match
4705 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4706 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4709 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4710 domain_enum domain
, int global
,
4713 struct objfile
*objfile
;
4714 struct partial_symtab
*ps
;
4716 ALL_PSYMTABS (objfile
, ps
)
4720 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4722 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4723 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4725 if (s
== NULL
|| !s
->primary
)
4727 ada_add_block_symbols (obstackp
,
4728 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4729 name
, domain
, objfile
, wild_match
);
4734 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4735 scope and in global scopes, returning the number of matches. Sets
4736 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4737 indicating the symbols found and the blocks and symbol tables (if
4738 any) in which they were found. This vector are transient---good only to
4739 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4740 symbol match within the nest of blocks whose innermost member is BLOCK0,
4741 is the one match returned (no other matches in that or
4742 enclosing blocks is returned). If there are any matches in or
4743 surrounding BLOCK0, then these alone are returned. Otherwise, the
4744 search extends to global and file-scope (static) symbol tables.
4745 Names prefixed with "standard__" are handled specially: "standard__"
4746 is first stripped off, and only static and global symbols are searched. */
4749 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4750 domain_enum
namespace,
4751 struct ada_symbol_info
**results
)
4754 struct block
*block
;
4760 obstack_free (&symbol_list_obstack
, NULL
);
4761 obstack_init (&symbol_list_obstack
);
4765 /* Search specified block and its superiors. */
4767 wild_match
= (strstr (name0
, "__") == NULL
);
4769 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4770 needed, but adding const will
4771 have a cascade effect. */
4773 /* Special case: If the user specifies a symbol name inside package
4774 Standard, do a non-wild matching of the symbol name without
4775 the "standard__" prefix. This was primarily introduced in order
4776 to allow the user to specifically access the standard exceptions
4777 using, for instance, Standard.Constraint_Error when Constraint_Error
4778 is ambiguous (due to the user defining its own Constraint_Error
4779 entity inside its program). */
4780 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4784 name
= name0
+ sizeof ("standard__") - 1;
4787 /* Check the non-global symbols. If we have ANY match, then we're done. */
4789 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4791 if (num_defns_collected (&symbol_list_obstack
) > 0)
4794 /* No non-global symbols found. Check our cache to see if we have
4795 already performed this search before. If we have, then return
4799 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4802 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4806 /* Search symbols from all global blocks. */
4808 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4811 /* Now add symbols from all per-file blocks if we've gotten no hits
4812 (not strictly correct, but perhaps better than an error). */
4814 if (num_defns_collected (&symbol_list_obstack
) == 0)
4815 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4819 ndefns
= num_defns_collected (&symbol_list_obstack
);
4820 *results
= defns_collected (&symbol_list_obstack
, 1);
4822 ndefns
= remove_extra_symbols (*results
, ndefns
);
4825 cache_symbol (name0
, namespace, NULL
, NULL
);
4827 if (ndefns
== 1 && cacheIfUnique
)
4828 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4830 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4836 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4837 domain_enum
namespace, struct block
**block_found
)
4839 struct ada_symbol_info
*candidates
;
4842 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4844 if (n_candidates
== 0)
4847 if (block_found
!= NULL
)
4848 *block_found
= candidates
[0].block
;
4850 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4853 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4854 scope and in global scopes, or NULL if none. NAME is folded and
4855 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4856 choosing the first symbol if there are multiple choices.
4857 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4858 table in which the symbol was found (in both cases, these
4859 assignments occur only if the pointers are non-null). */
4861 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4862 domain_enum
namespace, int *is_a_field_of_this
)
4864 if (is_a_field_of_this
!= NULL
)
4865 *is_a_field_of_this
= 0;
4868 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4869 block0
, namespace, NULL
);
4872 static struct symbol
*
4873 ada_lookup_symbol_nonlocal (const char *name
,
4874 const char *linkage_name
,
4875 const struct block
*block
,
4876 const domain_enum domain
)
4878 if (linkage_name
== NULL
)
4879 linkage_name
= name
;
4880 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4885 /* True iff STR is a possible encoded suffix of a normal Ada name
4886 that is to be ignored for matching purposes. Suffixes of parallel
4887 names (e.g., XVE) are not included here. Currently, the possible suffixes
4888 are given by any of the regular expressions:
4890 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4891 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4892 _E[0-9]+[bs]$ [protected object entry suffixes]
4893 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4895 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4896 match is performed. This sequence is used to differentiate homonyms,
4897 is an optional part of a valid name suffix. */
4900 is_name_suffix (const char *str
)
4903 const char *matching
;
4904 const int len
= strlen (str
);
4906 /* Skip optional leading __[0-9]+. */
4908 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4911 while (isdigit (str
[0]))
4917 if (str
[0] == '.' || str
[0] == '$')
4920 while (isdigit (matching
[0]))
4922 if (matching
[0] == '\0')
4928 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4931 while (isdigit (matching
[0]))
4933 if (matching
[0] == '\0')
4938 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4939 with a N at the end. Unfortunately, the compiler uses the same
4940 convention for other internal types it creates. So treating
4941 all entity names that end with an "N" as a name suffix causes
4942 some regressions. For instance, consider the case of an enumerated
4943 type. To support the 'Image attribute, it creates an array whose
4945 Having a single character like this as a suffix carrying some
4946 information is a bit risky. Perhaps we should change the encoding
4947 to be something like "_N" instead. In the meantime, do not do
4948 the following check. */
4949 /* Protected Object Subprograms */
4950 if (len
== 1 && str
[0] == 'N')
4955 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4958 while (isdigit (matching
[0]))
4960 if ((matching
[0] == 'b' || matching
[0] == 's')
4961 && matching
[1] == '\0')
4965 /* ??? We should not modify STR directly, as we are doing below. This
4966 is fine in this case, but may become problematic later if we find
4967 that this alternative did not work, and want to try matching
4968 another one from the begining of STR. Since we modified it, we
4969 won't be able to find the begining of the string anymore! */
4973 while (str
[0] != '_' && str
[0] != '\0')
4975 if (str
[0] != 'n' && str
[0] != 'b')
4981 if (str
[0] == '\000')
4986 if (str
[1] != '_' || str
[2] == '\000')
4990 if (strcmp (str
+ 3, "JM") == 0)
4992 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4993 the LJM suffix in favor of the JM one. But we will
4994 still accept LJM as a valid suffix for a reasonable
4995 amount of time, just to allow ourselves to debug programs
4996 compiled using an older version of GNAT. */
4997 if (strcmp (str
+ 3, "LJM") == 0)
5001 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5002 || str
[4] == 'U' || str
[4] == 'P')
5004 if (str
[4] == 'R' && str
[5] != 'T')
5008 if (!isdigit (str
[2]))
5010 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5011 if (!isdigit (str
[k
]) && str
[k
] != '_')
5015 if (str
[0] == '$' && isdigit (str
[1]))
5017 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5018 if (!isdigit (str
[k
]) && str
[k
] != '_')
5025 /* Return nonzero if the given string contains only digits.
5026 The empty string also matches. */
5029 is_digits_suffix (const char *str
)
5031 while (isdigit (str
[0]))
5033 return (str
[0] == '\0');
5036 /* Return non-zero if the string starting at NAME and ending before
5037 NAME_END contains no capital letters. */
5040 is_valid_name_for_wild_match (const char *name0
)
5042 const char *decoded_name
= ada_decode (name0
);
5045 /* If the decoded name starts with an angle bracket, it means that
5046 NAME0 does not follow the GNAT encoding format. It should then
5047 not be allowed as a possible wild match. */
5048 if (decoded_name
[0] == '<')
5051 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5052 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5058 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5059 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5060 informational suffixes of NAME (i.e., for which is_name_suffix is
5064 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5071 match
= strstr (start
, patn0
);
5076 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
5077 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
5078 && is_name_suffix (match
+ patn_len
))
5079 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
5085 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5086 vector *defn_symbols, updating the list of symbols in OBSTACKP
5087 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5088 OBJFILE is the section containing BLOCK.
5089 SYMTAB is recorded with each symbol added. */
5092 ada_add_block_symbols (struct obstack
*obstackp
,
5093 struct block
*block
, const char *name
,
5094 domain_enum domain
, struct objfile
*objfile
,
5097 struct dict_iterator iter
;
5098 int name_len
= strlen (name
);
5099 /* A matching argument symbol, if any. */
5100 struct symbol
*arg_sym
;
5101 /* Set true when we find a matching non-argument symbol. */
5110 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5112 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5113 SYMBOL_DOMAIN (sym
), domain
)
5114 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5116 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5118 else if (SYMBOL_IS_ARGUMENT (sym
))
5123 add_defn_to_vec (obstackp
,
5124 fixup_symbol_section (sym
, objfile
),
5132 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5134 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5135 SYMBOL_DOMAIN (sym
), domain
))
5137 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5139 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5141 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5143 if (SYMBOL_IS_ARGUMENT (sym
))
5148 add_defn_to_vec (obstackp
,
5149 fixup_symbol_section (sym
, objfile
),
5158 if (!found_sym
&& arg_sym
!= NULL
)
5160 add_defn_to_vec (obstackp
,
5161 fixup_symbol_section (arg_sym
, objfile
),
5170 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5172 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5173 SYMBOL_DOMAIN (sym
), domain
))
5177 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5180 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5182 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5187 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5189 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5191 if (SYMBOL_IS_ARGUMENT (sym
))
5196 add_defn_to_vec (obstackp
,
5197 fixup_symbol_section (sym
, objfile
),
5205 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5206 They aren't parameters, right? */
5207 if (!found_sym
&& arg_sym
!= NULL
)
5209 add_defn_to_vec (obstackp
,
5210 fixup_symbol_section (arg_sym
, objfile
),
5217 /* Symbol Completion */
5219 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5220 name in a form that's appropriate for the completion. The result
5221 does not need to be deallocated, but is only good until the next call.
5223 TEXT_LEN is equal to the length of TEXT.
5224 Perform a wild match if WILD_MATCH is set.
5225 ENCODED should be set if TEXT represents the start of a symbol name
5226 in its encoded form. */
5229 symbol_completion_match (const char *sym_name
,
5230 const char *text
, int text_len
,
5231 int wild_match
, int encoded
)
5234 const int verbatim_match
= (text
[0] == '<');
5239 /* Strip the leading angle bracket. */
5244 /* First, test against the fully qualified name of the symbol. */
5246 if (strncmp (sym_name
, text
, text_len
) == 0)
5249 if (match
&& !encoded
)
5251 /* One needed check before declaring a positive match is to verify
5252 that iff we are doing a verbatim match, the decoded version
5253 of the symbol name starts with '<'. Otherwise, this symbol name
5254 is not a suitable completion. */
5255 const char *sym_name_copy
= sym_name
;
5256 int has_angle_bracket
;
5258 sym_name
= ada_decode (sym_name
);
5259 has_angle_bracket
= (sym_name
[0] == '<');
5260 match
= (has_angle_bracket
== verbatim_match
);
5261 sym_name
= sym_name_copy
;
5264 if (match
&& !verbatim_match
)
5266 /* When doing non-verbatim match, another check that needs to
5267 be done is to verify that the potentially matching symbol name
5268 does not include capital letters, because the ada-mode would
5269 not be able to understand these symbol names without the
5270 angle bracket notation. */
5273 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5278 /* Second: Try wild matching... */
5280 if (!match
&& wild_match
)
5282 /* Since we are doing wild matching, this means that TEXT
5283 may represent an unqualified symbol name. We therefore must
5284 also compare TEXT against the unqualified name of the symbol. */
5285 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5287 if (strncmp (sym_name
, text
, text_len
) == 0)
5291 /* Finally: If we found a mach, prepare the result to return. */
5297 sym_name
= add_angle_brackets (sym_name
);
5300 sym_name
= ada_decode (sym_name
);
5305 typedef char *char_ptr
;
5306 DEF_VEC_P (char_ptr
);
5308 /* A companion function to ada_make_symbol_completion_list().
5309 Check if SYM_NAME represents a symbol which name would be suitable
5310 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5311 it is appended at the end of the given string vector SV.
5313 ORIG_TEXT is the string original string from the user command
5314 that needs to be completed. WORD is the entire command on which
5315 completion should be performed. These two parameters are used to
5316 determine which part of the symbol name should be added to the
5318 if WILD_MATCH is set, then wild matching is performed.
5319 ENCODED should be set if TEXT represents a symbol name in its
5320 encoded formed (in which case the completion should also be
5324 symbol_completion_add (VEC(char_ptr
) **sv
,
5325 const char *sym_name
,
5326 const char *text
, int text_len
,
5327 const char *orig_text
, const char *word
,
5328 int wild_match
, int encoded
)
5330 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5331 wild_match
, encoded
);
5337 /* We found a match, so add the appropriate completion to the given
5340 if (word
== orig_text
)
5342 completion
= xmalloc (strlen (match
) + 5);
5343 strcpy (completion
, match
);
5345 else if (word
> orig_text
)
5347 /* Return some portion of sym_name. */
5348 completion
= xmalloc (strlen (match
) + 5);
5349 strcpy (completion
, match
+ (word
- orig_text
));
5353 /* Return some of ORIG_TEXT plus sym_name. */
5354 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5355 strncpy (completion
, word
, orig_text
- word
);
5356 completion
[orig_text
- word
] = '\0';
5357 strcat (completion
, match
);
5360 VEC_safe_push (char_ptr
, *sv
, completion
);
5363 /* Return a list of possible symbol names completing TEXT0. The list
5364 is NULL terminated. WORD is the entire command on which completion
5368 ada_make_symbol_completion_list (char *text0
, char *word
)
5374 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5377 struct partial_symtab
*ps
;
5378 struct minimal_symbol
*msymbol
;
5379 struct objfile
*objfile
;
5380 struct block
*b
, *surrounding_static_block
= 0;
5382 struct dict_iterator iter
;
5384 if (text0
[0] == '<')
5386 text
= xstrdup (text0
);
5387 make_cleanup (xfree
, text
);
5388 text_len
= strlen (text
);
5394 text
= xstrdup (ada_encode (text0
));
5395 make_cleanup (xfree
, text
);
5396 text_len
= strlen (text
);
5397 for (i
= 0; i
< text_len
; i
++)
5398 text
[i
] = tolower (text
[i
]);
5400 encoded
= (strstr (text0
, "__") != NULL
);
5401 /* If the name contains a ".", then the user is entering a fully
5402 qualified entity name, and the match must not be done in wild
5403 mode. Similarly, if the user wants to complete what looks like
5404 an encoded name, the match must not be done in wild mode. */
5405 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5408 /* First, look at the partial symtab symbols. */
5409 ALL_PSYMTABS (objfile
, ps
)
5411 struct partial_symbol
**psym
;
5413 /* If the psymtab's been read in we'll get it when we search
5414 through the blockvector. */
5418 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5419 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5420 + ps
->n_global_syms
); psym
++)
5423 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5424 text
, text_len
, text0
, word
,
5425 wild_match
, encoded
);
5428 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5429 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5430 + ps
->n_static_syms
); psym
++)
5433 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5434 text
, text_len
, text0
, word
,
5435 wild_match
, encoded
);
5439 /* At this point scan through the misc symbol vectors and add each
5440 symbol you find to the list. Eventually we want to ignore
5441 anything that isn't a text symbol (everything else will be
5442 handled by the psymtab code above). */
5444 ALL_MSYMBOLS (objfile
, msymbol
)
5447 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5448 text
, text_len
, text0
, word
, wild_match
, encoded
);
5451 /* Search upwards from currently selected frame (so that we can
5452 complete on local vars. */
5454 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5456 if (!BLOCK_SUPERBLOCK (b
))
5457 surrounding_static_block
= b
; /* For elmin of dups */
5459 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5461 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5462 text
, text_len
, text0
, word
,
5463 wild_match
, encoded
);
5467 /* Go through the symtabs and check the externs and statics for
5468 symbols which match. */
5470 ALL_SYMTABS (objfile
, s
)
5473 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5474 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5476 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5477 text
, text_len
, text0
, word
,
5478 wild_match
, encoded
);
5482 ALL_SYMTABS (objfile
, s
)
5485 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5486 /* Don't do this block twice. */
5487 if (b
== surrounding_static_block
)
5489 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5491 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5492 text
, text_len
, text0
, word
,
5493 wild_match
, encoded
);
5497 /* Append the closing NULL entry. */
5498 VEC_safe_push (char_ptr
, completions
, NULL
);
5500 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5501 return the copy. It's unfortunate that we have to make a copy
5502 of an array that we're about to destroy, but there is nothing much
5503 we can do about it. Fortunately, it's typically not a very large
5506 const size_t completions_size
=
5507 VEC_length (char_ptr
, completions
) * sizeof (char *);
5508 char **result
= malloc (completions_size
);
5510 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5512 VEC_free (char_ptr
, completions
);
5519 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5520 for tagged types. */
5523 ada_is_dispatch_table_ptr_type (struct type
*type
)
5527 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5530 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5534 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5537 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5538 to be invisible to users. */
5541 ada_is_ignored_field (struct type
*type
, int field_num
)
5543 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5546 /* Check the name of that field. */
5548 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5550 /* Anonymous field names should not be printed.
5551 brobecker/2007-02-20: I don't think this can actually happen
5552 but we don't want to print the value of annonymous fields anyway. */
5556 /* A field named "_parent" is internally generated by GNAT for
5557 tagged types, and should not be printed either. */
5558 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5562 /* If this is the dispatch table of a tagged type, then ignore. */
5563 if (ada_is_tagged_type (type
, 1)
5564 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5567 /* Not a special field, so it should not be ignored. */
5571 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5572 pointer or reference type whose ultimate target has a tag field. */
5575 ada_is_tagged_type (struct type
*type
, int refok
)
5577 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5580 /* True iff TYPE represents the type of X'Tag */
5583 ada_is_tag_type (struct type
*type
)
5585 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5589 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5590 return (name
!= NULL
5591 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5595 /* The type of the tag on VAL. */
5598 ada_tag_type (struct value
*val
)
5600 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5603 /* The value of the tag on VAL. */
5606 ada_value_tag (struct value
*val
)
5608 return ada_value_struct_elt (val
, "_tag", 0);
5611 /* The value of the tag on the object of type TYPE whose contents are
5612 saved at VALADDR, if it is non-null, or is at memory address
5615 static struct value
*
5616 value_tag_from_contents_and_address (struct type
*type
,
5617 const gdb_byte
*valaddr
,
5620 int tag_byte_offset
, dummy1
, dummy2
;
5621 struct type
*tag_type
;
5622 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5625 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5627 : valaddr
+ tag_byte_offset
);
5628 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5630 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5635 static struct type
*
5636 type_from_tag (struct value
*tag
)
5638 const char *type_name
= ada_tag_name (tag
);
5639 if (type_name
!= NULL
)
5640 return ada_find_any_type (ada_encode (type_name
));
5651 static int ada_tag_name_1 (void *);
5652 static int ada_tag_name_2 (struct tag_args
*);
5654 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5655 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5656 The value stored in ARGS->name is valid until the next call to
5660 ada_tag_name_1 (void *args0
)
5662 struct tag_args
*args
= (struct tag_args
*) args0
;
5663 static char name
[1024];
5667 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5669 return ada_tag_name_2 (args
);
5670 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5673 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5674 for (p
= name
; *p
!= '\0'; p
+= 1)
5681 /* Utility function for ada_tag_name_1 that tries the second
5682 representation for the dispatch table (in which there is no
5683 explicit 'tsd' field in the referent of the tag pointer, and instead
5684 the tsd pointer is stored just before the dispatch table. */
5687 ada_tag_name_2 (struct tag_args
*args
)
5689 struct type
*info_type
;
5690 static char name
[1024];
5692 struct value
*val
, *valp
;
5695 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5696 if (info_type
== NULL
)
5698 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5699 valp
= value_cast (info_type
, args
->tag
);
5702 val
= value_ind (value_ptradd (valp
,
5703 value_from_longest (builtin_type_int8
, -1)));
5706 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5709 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5710 for (p
= name
; *p
!= '\0'; p
+= 1)
5717 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5721 ada_tag_name (struct value
*tag
)
5723 struct tag_args args
;
5724 if (!ada_is_tag_type (value_type (tag
)))
5728 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5732 /* The parent type of TYPE, or NULL if none. */
5735 ada_parent_type (struct type
*type
)
5739 type
= ada_check_typedef (type
);
5741 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5744 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5745 if (ada_is_parent_field (type
, i
))
5747 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5749 /* If the _parent field is a pointer, then dereference it. */
5750 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5751 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5752 /* If there is a parallel XVS type, get the actual base type. */
5753 parent_type
= ada_get_base_type (parent_type
);
5755 return ada_check_typedef (parent_type
);
5761 /* True iff field number FIELD_NUM of structure type TYPE contains the
5762 parent-type (inherited) fields of a derived type. Assumes TYPE is
5763 a structure type with at least FIELD_NUM+1 fields. */
5766 ada_is_parent_field (struct type
*type
, int field_num
)
5768 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5769 return (name
!= NULL
5770 && (strncmp (name
, "PARENT", 6) == 0
5771 || strncmp (name
, "_parent", 7) == 0));
5774 /* True iff field number FIELD_NUM of structure type TYPE is a
5775 transparent wrapper field (which should be silently traversed when doing
5776 field selection and flattened when printing). Assumes TYPE is a
5777 structure type with at least FIELD_NUM+1 fields. Such fields are always
5781 ada_is_wrapper_field (struct type
*type
, int field_num
)
5783 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5784 return (name
!= NULL
5785 && (strncmp (name
, "PARENT", 6) == 0
5786 || strcmp (name
, "REP") == 0
5787 || strncmp (name
, "_parent", 7) == 0
5788 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5791 /* True iff field number FIELD_NUM of structure or union type TYPE
5792 is a variant wrapper. Assumes TYPE is a structure type with at least
5793 FIELD_NUM+1 fields. */
5796 ada_is_variant_part (struct type
*type
, int field_num
)
5798 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5799 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5800 || (is_dynamic_field (type
, field_num
)
5801 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5802 == TYPE_CODE_UNION
)));
5805 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5806 whose discriminants are contained in the record type OUTER_TYPE,
5807 returns the type of the controlling discriminant for the variant. */
5810 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5812 char *name
= ada_variant_discrim_name (var_type
);
5814 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5816 return builtin_type_int32
;
5821 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5822 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5823 represents a 'when others' clause; otherwise 0. */
5826 ada_is_others_clause (struct type
*type
, int field_num
)
5828 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5829 return (name
!= NULL
&& name
[0] == 'O');
5832 /* Assuming that TYPE0 is the type of the variant part of a record,
5833 returns the name of the discriminant controlling the variant.
5834 The value is valid until the next call to ada_variant_discrim_name. */
5837 ada_variant_discrim_name (struct type
*type0
)
5839 static char *result
= NULL
;
5840 static size_t result_len
= 0;
5843 const char *discrim_end
;
5844 const char *discrim_start
;
5846 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5847 type
= TYPE_TARGET_TYPE (type0
);
5851 name
= ada_type_name (type
);
5853 if (name
== NULL
|| name
[0] == '\000')
5856 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5859 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5862 if (discrim_end
== name
)
5865 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5868 if (discrim_start
== name
+ 1)
5870 if ((discrim_start
> name
+ 3
5871 && strncmp (discrim_start
- 3, "___", 3) == 0)
5872 || discrim_start
[-1] == '.')
5876 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5877 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5878 result
[discrim_end
- discrim_start
] = '\0';
5882 /* Scan STR for a subtype-encoded number, beginning at position K.
5883 Put the position of the character just past the number scanned in
5884 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5885 Return 1 if there was a valid number at the given position, and 0
5886 otherwise. A "subtype-encoded" number consists of the absolute value
5887 in decimal, followed by the letter 'm' to indicate a negative number.
5888 Assumes 0m does not occur. */
5891 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5895 if (!isdigit (str
[k
]))
5898 /* Do it the hard way so as not to make any assumption about
5899 the relationship of unsigned long (%lu scan format code) and
5902 while (isdigit (str
[k
]))
5904 RU
= RU
* 10 + (str
[k
] - '0');
5911 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5917 /* NOTE on the above: Technically, C does not say what the results of
5918 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5919 number representable as a LONGEST (although either would probably work
5920 in most implementations). When RU>0, the locution in the then branch
5921 above is always equivalent to the negative of RU. */
5928 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5929 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5930 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5933 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5935 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5948 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5957 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5958 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5960 if (val
>= L
&& val
<= U
)
5972 /* FIXME: Lots of redundancy below. Try to consolidate. */
5974 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5975 ARG_TYPE, extract and return the value of one of its (non-static)
5976 fields. FIELDNO says which field. Differs from value_primitive_field
5977 only in that it can handle packed values of arbitrary type. */
5979 static struct value
*
5980 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5981 struct type
*arg_type
)
5985 arg_type
= ada_check_typedef (arg_type
);
5986 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5988 /* Handle packed fields. */
5990 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5992 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5993 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5995 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5996 offset
+ bit_pos
/ 8,
5997 bit_pos
% 8, bit_size
, type
);
6000 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6003 /* Find field with name NAME in object of type TYPE. If found,
6004 set the following for each argument that is non-null:
6005 - *FIELD_TYPE_P to the field's type;
6006 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6007 an object of that type;
6008 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6009 - *BIT_SIZE_P to its size in bits if the field is packed, and
6011 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6012 fields up to but not including the desired field, or by the total
6013 number of fields if not found. A NULL value of NAME never
6014 matches; the function just counts visible fields in this case.
6016 Returns 1 if found, 0 otherwise. */
6019 find_struct_field (char *name
, struct type
*type
, int offset
,
6020 struct type
**field_type_p
,
6021 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6026 type
= ada_check_typedef (type
);
6028 if (field_type_p
!= NULL
)
6029 *field_type_p
= NULL
;
6030 if (byte_offset_p
!= NULL
)
6032 if (bit_offset_p
!= NULL
)
6034 if (bit_size_p
!= NULL
)
6037 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6039 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6040 int fld_offset
= offset
+ bit_pos
/ 8;
6041 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6043 if (t_field_name
== NULL
)
6046 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6048 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6049 if (field_type_p
!= NULL
)
6050 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6051 if (byte_offset_p
!= NULL
)
6052 *byte_offset_p
= fld_offset
;
6053 if (bit_offset_p
!= NULL
)
6054 *bit_offset_p
= bit_pos
% 8;
6055 if (bit_size_p
!= NULL
)
6056 *bit_size_p
= bit_size
;
6059 else if (ada_is_wrapper_field (type
, i
))
6061 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6062 field_type_p
, byte_offset_p
, bit_offset_p
,
6063 bit_size_p
, index_p
))
6066 else if (ada_is_variant_part (type
, i
))
6068 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6071 struct type
*field_type
6072 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6074 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6076 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6078 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6079 field_type_p
, byte_offset_p
,
6080 bit_offset_p
, bit_size_p
, index_p
))
6084 else if (index_p
!= NULL
)
6090 /* Number of user-visible fields in record type TYPE. */
6093 num_visible_fields (struct type
*type
)
6097 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6101 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6102 and search in it assuming it has (class) type TYPE.
6103 If found, return value, else return NULL.
6105 Searches recursively through wrapper fields (e.g., '_parent'). */
6107 static struct value
*
6108 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6112 type
= ada_check_typedef (type
);
6114 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6116 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6118 if (t_field_name
== NULL
)
6121 else if (field_name_match (t_field_name
, name
))
6122 return ada_value_primitive_field (arg
, offset
, i
, type
);
6124 else if (ada_is_wrapper_field (type
, i
))
6126 struct value
*v
= /* Do not let indent join lines here. */
6127 ada_search_struct_field (name
, arg
,
6128 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6129 TYPE_FIELD_TYPE (type
, i
));
6134 else if (ada_is_variant_part (type
, i
))
6136 /* PNH: Do we ever get here? See find_struct_field. */
6138 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6139 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6141 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6143 struct value
*v
= ada_search_struct_field
/* Force line break. */
6145 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6146 TYPE_FIELD_TYPE (field_type
, j
));
6155 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6156 int, struct type
*);
6159 /* Return field #INDEX in ARG, where the index is that returned by
6160 * find_struct_field through its INDEX_P argument. Adjust the address
6161 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6162 * If found, return value, else return NULL. */
6164 static struct value
*
6165 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6168 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6172 /* Auxiliary function for ada_index_struct_field. Like
6173 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6176 static struct value
*
6177 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6181 type
= ada_check_typedef (type
);
6183 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6185 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6187 else if (ada_is_wrapper_field (type
, i
))
6189 struct value
*v
= /* Do not let indent join lines here. */
6190 ada_index_struct_field_1 (index_p
, arg
,
6191 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6192 TYPE_FIELD_TYPE (type
, i
));
6197 else if (ada_is_variant_part (type
, i
))
6199 /* PNH: Do we ever get here? See ada_search_struct_field,
6200 find_struct_field. */
6201 error (_("Cannot assign this kind of variant record"));
6203 else if (*index_p
== 0)
6204 return ada_value_primitive_field (arg
, offset
, i
, type
);
6211 /* Given ARG, a value of type (pointer or reference to a)*
6212 structure/union, extract the component named NAME from the ultimate
6213 target structure/union and return it as a value with its
6214 appropriate type. If ARG is a pointer or reference and the field
6215 is not packed, returns a reference to the field, otherwise the
6216 value of the field (an lvalue if ARG is an lvalue).
6218 The routine searches for NAME among all members of the structure itself
6219 and (recursively) among all members of any wrapper members
6222 If NO_ERR, then simply return NULL in case of error, rather than
6226 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6228 struct type
*t
, *t1
;
6232 t1
= t
= ada_check_typedef (value_type (arg
));
6233 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6235 t1
= TYPE_TARGET_TYPE (t
);
6238 t1
= ada_check_typedef (t1
);
6239 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6241 arg
= coerce_ref (arg
);
6246 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6248 t1
= TYPE_TARGET_TYPE (t
);
6251 t1
= ada_check_typedef (t1
);
6252 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6254 arg
= value_ind (arg
);
6261 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6265 v
= ada_search_struct_field (name
, arg
, 0, t
);
6268 int bit_offset
, bit_size
, byte_offset
;
6269 struct type
*field_type
;
6272 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6273 address
= value_as_address (arg
);
6275 address
= unpack_pointer (t
, value_contents (arg
));
6277 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6278 if (find_struct_field (name
, t1
, 0,
6279 &field_type
, &byte_offset
, &bit_offset
,
6284 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6285 arg
= ada_coerce_ref (arg
);
6287 arg
= ada_value_ind (arg
);
6288 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6289 bit_offset
, bit_size
,
6293 v
= value_from_pointer (lookup_reference_type (field_type
),
6294 address
+ byte_offset
);
6298 if (v
!= NULL
|| no_err
)
6301 error (_("There is no member named %s."), name
);
6307 error (_("Attempt to extract a component of a value that is not a record."));
6310 /* Given a type TYPE, look up the type of the component of type named NAME.
6311 If DISPP is non-null, add its byte displacement from the beginning of a
6312 structure (pointed to by a value) of type TYPE to *DISPP (does not
6313 work for packed fields).
6315 Matches any field whose name has NAME as a prefix, possibly
6318 TYPE can be either a struct or union. If REFOK, TYPE may also
6319 be a (pointer or reference)+ to a struct or union, and the
6320 ultimate target type will be searched.
6322 Looks recursively into variant clauses and parent types.
6324 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6325 TYPE is not a type of the right kind. */
6327 static struct type
*
6328 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6329 int noerr
, int *dispp
)
6336 if (refok
&& type
!= NULL
)
6339 type
= ada_check_typedef (type
);
6340 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6341 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6343 type
= TYPE_TARGET_TYPE (type
);
6347 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6348 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6354 target_terminal_ours ();
6355 gdb_flush (gdb_stdout
);
6357 error (_("Type (null) is not a structure or union type"));
6360 /* XXX: type_sprint */
6361 fprintf_unfiltered (gdb_stderr
, _("Type "));
6362 type_print (type
, "", gdb_stderr
, -1);
6363 error (_(" is not a structure or union type"));
6368 type
= to_static_fixed_type (type
);
6370 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6372 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6376 if (t_field_name
== NULL
)
6379 else if (field_name_match (t_field_name
, name
))
6382 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6383 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6386 else if (ada_is_wrapper_field (type
, i
))
6389 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6394 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6399 else if (ada_is_variant_part (type
, i
))
6402 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6404 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6407 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6412 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6423 target_terminal_ours ();
6424 gdb_flush (gdb_stdout
);
6427 /* XXX: type_sprint */
6428 fprintf_unfiltered (gdb_stderr
, _("Type "));
6429 type_print (type
, "", gdb_stderr
, -1);
6430 error (_(" has no component named <null>"));
6434 /* XXX: type_sprint */
6435 fprintf_unfiltered (gdb_stderr
, _("Type "));
6436 type_print (type
, "", gdb_stderr
, -1);
6437 error (_(" has no component named %s"), name
);
6444 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6445 within a value of type OUTER_TYPE that is stored in GDB at
6446 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6447 numbering from 0) is applicable. Returns -1 if none are. */
6450 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6451 const gdb_byte
*outer_valaddr
)
6455 char *discrim_name
= ada_variant_discrim_name (var_type
);
6456 struct value
*outer
;
6457 struct value
*discrim
;
6458 LONGEST discrim_val
;
6460 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6461 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6462 if (discrim
== NULL
)
6464 discrim_val
= value_as_long (discrim
);
6467 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6469 if (ada_is_others_clause (var_type
, i
))
6471 else if (ada_in_variant (discrim_val
, var_type
, i
))
6475 return others_clause
;
6480 /* Dynamic-Sized Records */
6482 /* Strategy: The type ostensibly attached to a value with dynamic size
6483 (i.e., a size that is not statically recorded in the debugging
6484 data) does not accurately reflect the size or layout of the value.
6485 Our strategy is to convert these values to values with accurate,
6486 conventional types that are constructed on the fly. */
6488 /* There is a subtle and tricky problem here. In general, we cannot
6489 determine the size of dynamic records without its data. However,
6490 the 'struct value' data structure, which GDB uses to represent
6491 quantities in the inferior process (the target), requires the size
6492 of the type at the time of its allocation in order to reserve space
6493 for GDB's internal copy of the data. That's why the
6494 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6495 rather than struct value*s.
6497 However, GDB's internal history variables ($1, $2, etc.) are
6498 struct value*s containing internal copies of the data that are not, in
6499 general, the same as the data at their corresponding addresses in
6500 the target. Fortunately, the types we give to these values are all
6501 conventional, fixed-size types (as per the strategy described
6502 above), so that we don't usually have to perform the
6503 'to_fixed_xxx_type' conversions to look at their values.
6504 Unfortunately, there is one exception: if one of the internal
6505 history variables is an array whose elements are unconstrained
6506 records, then we will need to create distinct fixed types for each
6507 element selected. */
6509 /* The upshot of all of this is that many routines take a (type, host
6510 address, target address) triple as arguments to represent a value.
6511 The host address, if non-null, is supposed to contain an internal
6512 copy of the relevant data; otherwise, the program is to consult the
6513 target at the target address. */
6515 /* Assuming that VAL0 represents a pointer value, the result of
6516 dereferencing it. Differs from value_ind in its treatment of
6517 dynamic-sized types. */
6520 ada_value_ind (struct value
*val0
)
6522 struct value
*val
= unwrap_value (value_ind (val0
));
6523 return ada_to_fixed_value (val
);
6526 /* The value resulting from dereferencing any "reference to"
6527 qualifiers on VAL0. */
6529 static struct value
*
6530 ada_coerce_ref (struct value
*val0
)
6532 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6534 struct value
*val
= val0
;
6535 val
= coerce_ref (val
);
6536 val
= unwrap_value (val
);
6537 return ada_to_fixed_value (val
);
6543 /* Return OFF rounded upward if necessary to a multiple of
6544 ALIGNMENT (a power of 2). */
6547 align_value (unsigned int off
, unsigned int alignment
)
6549 return (off
+ alignment
- 1) & ~(alignment
- 1);
6552 /* Return the bit alignment required for field #F of template type TYPE. */
6555 field_alignment (struct type
*type
, int f
)
6557 const char *name
= TYPE_FIELD_NAME (type
, f
);
6561 /* The field name should never be null, unless the debugging information
6562 is somehow malformed. In this case, we assume the field does not
6563 require any alignment. */
6567 len
= strlen (name
);
6569 if (!isdigit (name
[len
- 1]))
6572 if (isdigit (name
[len
- 2]))
6573 align_offset
= len
- 2;
6575 align_offset
= len
- 1;
6577 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6578 return TARGET_CHAR_BIT
;
6580 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6583 /* Find a symbol named NAME. Ignores ambiguity. */
6586 ada_find_any_symbol (const char *name
)
6590 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6591 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6594 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6598 /* Find a type named NAME. Ignores ambiguity. */
6601 ada_find_any_type (const char *name
)
6603 struct symbol
*sym
= ada_find_any_symbol (name
);
6606 return SYMBOL_TYPE (sym
);
6611 /* Given NAME and an associated BLOCK, search all symbols for
6612 NAME suffixed with "___XR", which is the ``renaming'' symbol
6613 associated to NAME. Return this symbol if found, return
6617 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6621 sym
= find_old_style_renaming_symbol (name
, block
);
6626 /* Not right yet. FIXME pnh 7/20/2007. */
6627 sym
= ada_find_any_symbol (name
);
6628 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6634 static struct symbol
*
6635 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6637 const struct symbol
*function_sym
= block_linkage_function (block
);
6640 if (function_sym
!= NULL
)
6642 /* If the symbol is defined inside a function, NAME is not fully
6643 qualified. This means we need to prepend the function name
6644 as well as adding the ``___XR'' suffix to build the name of
6645 the associated renaming symbol. */
6646 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6647 /* Function names sometimes contain suffixes used
6648 for instance to qualify nested subprograms. When building
6649 the XR type name, we need to make sure that this suffix is
6650 not included. So do not include any suffix in the function
6651 name length below. */
6652 const int function_name_len
= ada_name_prefix_len (function_name
);
6653 const int rename_len
= function_name_len
+ 2 /* "__" */
6654 + strlen (name
) + 6 /* "___XR\0" */ ;
6656 /* Strip the suffix if necessary. */
6657 function_name
[function_name_len
] = '\0';
6659 /* Library-level functions are a special case, as GNAT adds
6660 a ``_ada_'' prefix to the function name to avoid namespace
6661 pollution. However, the renaming symbols themselves do not
6662 have this prefix, so we need to skip this prefix if present. */
6663 if (function_name_len
> 5 /* "_ada_" */
6664 && strstr (function_name
, "_ada_") == function_name
)
6665 function_name
= function_name
+ 5;
6667 rename
= (char *) alloca (rename_len
* sizeof (char));
6668 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6672 const int rename_len
= strlen (name
) + 6;
6673 rename
= (char *) alloca (rename_len
* sizeof (char));
6674 sprintf (rename
, "%s___XR", name
);
6677 return ada_find_any_symbol (rename
);
6680 /* Because of GNAT encoding conventions, several GDB symbols may match a
6681 given type name. If the type denoted by TYPE0 is to be preferred to
6682 that of TYPE1 for purposes of type printing, return non-zero;
6683 otherwise return 0. */
6686 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6690 else if (type0
== NULL
)
6692 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6694 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6696 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6698 else if (ada_is_packed_array_type (type0
))
6700 else if (ada_is_array_descriptor_type (type0
)
6701 && !ada_is_array_descriptor_type (type1
))
6705 const char *type0_name
= type_name_no_tag (type0
);
6706 const char *type1_name
= type_name_no_tag (type1
);
6708 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6709 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6715 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6716 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6719 ada_type_name (struct type
*type
)
6723 else if (TYPE_NAME (type
) != NULL
)
6724 return TYPE_NAME (type
);
6726 return TYPE_TAG_NAME (type
);
6729 /* Find a parallel type to TYPE whose name is formed by appending
6730 SUFFIX to the name of TYPE. */
6733 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6736 static size_t name_len
= 0;
6738 char *typename
= ada_type_name (type
);
6740 if (typename
== NULL
)
6743 len
= strlen (typename
);
6745 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6747 strcpy (name
, typename
);
6748 strcpy (name
+ len
, suffix
);
6750 return ada_find_any_type (name
);
6754 /* If TYPE is a variable-size record type, return the corresponding template
6755 type describing its fields. Otherwise, return NULL. */
6757 static struct type
*
6758 dynamic_template_type (struct type
*type
)
6760 type
= ada_check_typedef (type
);
6762 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6763 || ada_type_name (type
) == NULL
)
6767 int len
= strlen (ada_type_name (type
));
6768 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6771 return ada_find_parallel_type (type
, "___XVE");
6775 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6776 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6779 is_dynamic_field (struct type
*templ_type
, int field_num
)
6781 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6783 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6784 && strstr (name
, "___XVL") != NULL
;
6787 /* The index of the variant field of TYPE, or -1 if TYPE does not
6788 represent a variant record type. */
6791 variant_field_index (struct type
*type
)
6795 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6798 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6800 if (ada_is_variant_part (type
, f
))
6806 /* A record type with no fields. */
6808 static struct type
*
6809 empty_record (struct objfile
*objfile
)
6811 struct type
*type
= alloc_type (objfile
);
6812 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6813 TYPE_NFIELDS (type
) = 0;
6814 TYPE_FIELDS (type
) = NULL
;
6815 TYPE_NAME (type
) = "<empty>";
6816 TYPE_TAG_NAME (type
) = NULL
;
6817 TYPE_LENGTH (type
) = 0;
6821 /* An ordinary record type (with fixed-length fields) that describes
6822 the value of type TYPE at VALADDR or ADDRESS (see comments at
6823 the beginning of this section) VAL according to GNAT conventions.
6824 DVAL0 should describe the (portion of a) record that contains any
6825 necessary discriminants. It should be NULL if value_type (VAL) is
6826 an outer-level type (i.e., as opposed to a branch of a variant.) A
6827 variant field (unless unchecked) is replaced by a particular branch
6830 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6831 length are not statically known are discarded. As a consequence,
6832 VALADDR, ADDRESS and DVAL0 are ignored.
6834 NOTE: Limitations: For now, we assume that dynamic fields and
6835 variants occupy whole numbers of bytes. However, they need not be
6839 ada_template_to_fixed_record_type_1 (struct type
*type
,
6840 const gdb_byte
*valaddr
,
6841 CORE_ADDR address
, struct value
*dval0
,
6842 int keep_dynamic_fields
)
6844 struct value
*mark
= value_mark ();
6847 int nfields
, bit_len
;
6850 int fld_bit_len
, bit_incr
;
6853 /* Compute the number of fields in this record type that are going
6854 to be processed: unless keep_dynamic_fields, this includes only
6855 fields whose position and length are static will be processed. */
6856 if (keep_dynamic_fields
)
6857 nfields
= TYPE_NFIELDS (type
);
6861 while (nfields
< TYPE_NFIELDS (type
)
6862 && !ada_is_variant_part (type
, nfields
)
6863 && !is_dynamic_field (type
, nfields
))
6867 rtype
= alloc_type (TYPE_OBJFILE (type
));
6868 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6869 INIT_CPLUS_SPECIFIC (rtype
);
6870 TYPE_NFIELDS (rtype
) = nfields
;
6871 TYPE_FIELDS (rtype
) = (struct field
*)
6872 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6873 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6874 TYPE_NAME (rtype
) = ada_type_name (type
);
6875 TYPE_TAG_NAME (rtype
) = NULL
;
6876 TYPE_FIXED_INSTANCE (rtype
) = 1;
6882 for (f
= 0; f
< nfields
; f
+= 1)
6884 off
= align_value (off
, field_alignment (type
, f
))
6885 + TYPE_FIELD_BITPOS (type
, f
);
6886 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6887 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6889 if (ada_is_variant_part (type
, f
))
6892 fld_bit_len
= bit_incr
= 0;
6894 else if (is_dynamic_field (type
, f
))
6897 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6901 /* Get the fixed type of the field. Note that, in this case, we
6902 do not want to get the real type out of the tag: if the current
6903 field is the parent part of a tagged record, we will get the
6904 tag of the object. Clearly wrong: the real type of the parent
6905 is not the real type of the child. We would end up in an infinite
6907 TYPE_FIELD_TYPE (rtype
, f
) =
6910 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6911 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6912 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6913 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6914 bit_incr
= fld_bit_len
=
6915 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6919 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6920 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6921 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6922 bit_incr
= fld_bit_len
=
6923 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6925 bit_incr
= fld_bit_len
=
6926 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6928 if (off
+ fld_bit_len
> bit_len
)
6929 bit_len
= off
+ fld_bit_len
;
6931 TYPE_LENGTH (rtype
) =
6932 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6935 /* We handle the variant part, if any, at the end because of certain
6936 odd cases in which it is re-ordered so as NOT the last field of
6937 the record. This can happen in the presence of representation
6939 if (variant_field
>= 0)
6941 struct type
*branch_type
;
6943 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6946 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6951 to_fixed_variant_branch_type
6952 (TYPE_FIELD_TYPE (type
, variant_field
),
6953 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6954 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6955 if (branch_type
== NULL
)
6957 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6958 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6959 TYPE_NFIELDS (rtype
) -= 1;
6963 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6964 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6966 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6968 if (off
+ fld_bit_len
> bit_len
)
6969 bit_len
= off
+ fld_bit_len
;
6970 TYPE_LENGTH (rtype
) =
6971 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6975 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6976 should contain the alignment of that record, which should be a strictly
6977 positive value. If null or negative, then something is wrong, most
6978 probably in the debug info. In that case, we don't round up the size
6979 of the resulting type. If this record is not part of another structure,
6980 the current RTYPE length might be good enough for our purposes. */
6981 if (TYPE_LENGTH (type
) <= 0)
6983 if (TYPE_NAME (rtype
))
6984 warning (_("Invalid type size for `%s' detected: %d."),
6985 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6987 warning (_("Invalid type size for <unnamed> detected: %d."),
6988 TYPE_LENGTH (type
));
6992 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6993 TYPE_LENGTH (type
));
6996 value_free_to_mark (mark
);
6997 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6998 error (_("record type with dynamic size is larger than varsize-limit"));
7002 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7005 static struct type
*
7006 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7007 CORE_ADDR address
, struct value
*dval0
)
7009 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7013 /* An ordinary record type in which ___XVL-convention fields and
7014 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7015 static approximations, containing all possible fields. Uses
7016 no runtime values. Useless for use in values, but that's OK,
7017 since the results are used only for type determinations. Works on both
7018 structs and unions. Representation note: to save space, we memorize
7019 the result of this function in the TYPE_TARGET_TYPE of the
7022 static struct type
*
7023 template_to_static_fixed_type (struct type
*type0
)
7029 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7030 return TYPE_TARGET_TYPE (type0
);
7032 nfields
= TYPE_NFIELDS (type0
);
7035 for (f
= 0; f
< nfields
; f
+= 1)
7037 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7038 struct type
*new_type
;
7040 if (is_dynamic_field (type0
, f
))
7041 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7043 new_type
= static_unwrap_type (field_type
);
7044 if (type
== type0
&& new_type
!= field_type
)
7046 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
7047 TYPE_CODE (type
) = TYPE_CODE (type0
);
7048 INIT_CPLUS_SPECIFIC (type
);
7049 TYPE_NFIELDS (type
) = nfields
;
7050 TYPE_FIELDS (type
) = (struct field
*)
7051 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7052 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7053 sizeof (struct field
) * nfields
);
7054 TYPE_NAME (type
) = ada_type_name (type0
);
7055 TYPE_TAG_NAME (type
) = NULL
;
7056 TYPE_FIXED_INSTANCE (type
) = 1;
7057 TYPE_LENGTH (type
) = 0;
7059 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7060 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7065 /* Given an object of type TYPE whose contents are at VALADDR and
7066 whose address in memory is ADDRESS, returns a revision of TYPE,
7067 which should be a non-dynamic-sized record, in which the variant
7068 part, if any, is replaced with the appropriate branch. Looks
7069 for discriminant values in DVAL0, which can be NULL if the record
7070 contains the necessary discriminant values. */
7072 static struct type
*
7073 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7074 CORE_ADDR address
, struct value
*dval0
)
7076 struct value
*mark
= value_mark ();
7079 struct type
*branch_type
;
7080 int nfields
= TYPE_NFIELDS (type
);
7081 int variant_field
= variant_field_index (type
);
7083 if (variant_field
== -1)
7087 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7091 rtype
= alloc_type (TYPE_OBJFILE (type
));
7092 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7093 INIT_CPLUS_SPECIFIC (rtype
);
7094 TYPE_NFIELDS (rtype
) = nfields
;
7095 TYPE_FIELDS (rtype
) =
7096 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7097 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7098 sizeof (struct field
) * nfields
);
7099 TYPE_NAME (rtype
) = ada_type_name (type
);
7100 TYPE_TAG_NAME (rtype
) = NULL
;
7101 TYPE_FIXED_INSTANCE (rtype
) = 1;
7102 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7104 branch_type
= to_fixed_variant_branch_type
7105 (TYPE_FIELD_TYPE (type
, variant_field
),
7106 cond_offset_host (valaddr
,
7107 TYPE_FIELD_BITPOS (type
, variant_field
)
7109 cond_offset_target (address
,
7110 TYPE_FIELD_BITPOS (type
, variant_field
)
7111 / TARGET_CHAR_BIT
), dval
);
7112 if (branch_type
== NULL
)
7115 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7116 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7117 TYPE_NFIELDS (rtype
) -= 1;
7121 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7122 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7123 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7124 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7126 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7128 value_free_to_mark (mark
);
7132 /* An ordinary record type (with fixed-length fields) that describes
7133 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7134 beginning of this section]. Any necessary discriminants' values
7135 should be in DVAL, a record value; it may be NULL if the object
7136 at ADDR itself contains any necessary discriminant values.
7137 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7138 values from the record are needed. Except in the case that DVAL,
7139 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7140 unchecked) is replaced by a particular branch of the variant.
7142 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7143 is questionable and may be removed. It can arise during the
7144 processing of an unconstrained-array-of-record type where all the
7145 variant branches have exactly the same size. This is because in
7146 such cases, the compiler does not bother to use the XVS convention
7147 when encoding the record. I am currently dubious of this
7148 shortcut and suspect the compiler should be altered. FIXME. */
7150 static struct type
*
7151 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7152 CORE_ADDR address
, struct value
*dval
)
7154 struct type
*templ_type
;
7156 if (TYPE_FIXED_INSTANCE (type0
))
7159 templ_type
= dynamic_template_type (type0
);
7161 if (templ_type
!= NULL
)
7162 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7163 else if (variant_field_index (type0
) >= 0)
7165 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7167 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7172 TYPE_FIXED_INSTANCE (type0
) = 1;
7178 /* An ordinary record type (with fixed-length fields) that describes
7179 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7180 union type. Any necessary discriminants' values should be in DVAL,
7181 a record value. That is, this routine selects the appropriate
7182 branch of the union at ADDR according to the discriminant value
7183 indicated in the union's type name. */
7185 static struct type
*
7186 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7187 CORE_ADDR address
, struct value
*dval
)
7190 struct type
*templ_type
;
7191 struct type
*var_type
;
7193 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7194 var_type
= TYPE_TARGET_TYPE (var_type0
);
7196 var_type
= var_type0
;
7198 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7200 if (templ_type
!= NULL
)
7201 var_type
= templ_type
;
7204 ada_which_variant_applies (var_type
,
7205 value_type (dval
), value_contents (dval
));
7208 return empty_record (TYPE_OBJFILE (var_type
));
7209 else if (is_dynamic_field (var_type
, which
))
7210 return to_fixed_record_type
7211 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7212 valaddr
, address
, dval
);
7213 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7215 to_fixed_record_type
7216 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7218 return TYPE_FIELD_TYPE (var_type
, which
);
7221 /* Assuming that TYPE0 is an array type describing the type of a value
7222 at ADDR, and that DVAL describes a record containing any
7223 discriminants used in TYPE0, returns a type for the value that
7224 contains no dynamic components (that is, no components whose sizes
7225 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7226 true, gives an error message if the resulting type's size is over
7229 static struct type
*
7230 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7233 struct type
*index_type_desc
;
7234 struct type
*result
;
7236 if (ada_is_packed_array_type (type0
) /* revisit? */
7237 || TYPE_FIXED_INSTANCE (type0
))
7240 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7241 if (index_type_desc
== NULL
)
7243 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7244 /* NOTE: elt_type---the fixed version of elt_type0---should never
7245 depend on the contents of the array in properly constructed
7247 /* Create a fixed version of the array element type.
7248 We're not providing the address of an element here,
7249 and thus the actual object value cannot be inspected to do
7250 the conversion. This should not be a problem, since arrays of
7251 unconstrained objects are not allowed. In particular, all
7252 the elements of an array of a tagged type should all be of
7253 the same type specified in the debugging info. No need to
7254 consult the object tag. */
7255 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7257 if (elt_type0
== elt_type
)
7260 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7261 elt_type
, TYPE_INDEX_TYPE (type0
));
7266 struct type
*elt_type0
;
7269 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7270 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7272 /* NOTE: result---the fixed version of elt_type0---should never
7273 depend on the contents of the array in properly constructed
7275 /* Create a fixed version of the array element type.
7276 We're not providing the address of an element here,
7277 and thus the actual object value cannot be inspected to do
7278 the conversion. This should not be a problem, since arrays of
7279 unconstrained objects are not allowed. In particular, all
7280 the elements of an array of a tagged type should all be of
7281 the same type specified in the debugging info. No need to
7282 consult the object tag. */
7284 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7285 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7287 struct type
*range_type
=
7288 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7289 dval
, TYPE_OBJFILE (type0
));
7290 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7291 result
, range_type
);
7293 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7294 error (_("array type with dynamic size is larger than varsize-limit"));
7297 TYPE_FIXED_INSTANCE (result
) = 1;
7302 /* A standard type (containing no dynamically sized components)
7303 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7304 DVAL describes a record containing any discriminants used in TYPE0,
7305 and may be NULL if there are none, or if the object of type TYPE at
7306 ADDRESS or in VALADDR contains these discriminants.
7308 If CHECK_TAG is not null, in the case of tagged types, this function
7309 attempts to locate the object's tag and use it to compute the actual
7310 type. However, when ADDRESS is null, we cannot use it to determine the
7311 location of the tag, and therefore compute the tagged type's actual type.
7312 So we return the tagged type without consulting the tag. */
7314 static struct type
*
7315 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7316 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7318 type
= ada_check_typedef (type
);
7319 switch (TYPE_CODE (type
))
7323 case TYPE_CODE_STRUCT
:
7325 struct type
*static_type
= to_static_fixed_type (type
);
7326 struct type
*fixed_record_type
=
7327 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7328 /* If STATIC_TYPE is a tagged type and we know the object's address,
7329 then we can determine its tag, and compute the object's actual
7330 type from there. Note that we have to use the fixed record
7331 type (the parent part of the record may have dynamic fields
7332 and the way the location of _tag is expressed may depend on
7335 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7337 struct type
*real_type
=
7338 type_from_tag (value_tag_from_contents_and_address
7342 if (real_type
!= NULL
)
7343 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7345 return fixed_record_type
;
7347 case TYPE_CODE_ARRAY
:
7348 return to_fixed_array_type (type
, dval
, 1);
7349 case TYPE_CODE_UNION
:
7353 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7357 /* The same as ada_to_fixed_type_1, except that it preserves the type
7358 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7359 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7362 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7363 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7366 struct type
*fixed_type
=
7367 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7369 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7370 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7376 /* A standard (static-sized) type corresponding as well as possible to
7377 TYPE0, but based on no runtime data. */
7379 static struct type
*
7380 to_static_fixed_type (struct type
*type0
)
7387 if (TYPE_FIXED_INSTANCE (type0
))
7390 type0
= ada_check_typedef (type0
);
7392 switch (TYPE_CODE (type0
))
7396 case TYPE_CODE_STRUCT
:
7397 type
= dynamic_template_type (type0
);
7399 return template_to_static_fixed_type (type
);
7401 return template_to_static_fixed_type (type0
);
7402 case TYPE_CODE_UNION
:
7403 type
= ada_find_parallel_type (type0
, "___XVU");
7405 return template_to_static_fixed_type (type
);
7407 return template_to_static_fixed_type (type0
);
7411 /* A static approximation of TYPE with all type wrappers removed. */
7413 static struct type
*
7414 static_unwrap_type (struct type
*type
)
7416 if (ada_is_aligner_type (type
))
7418 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7419 if (ada_type_name (type1
) == NULL
)
7420 TYPE_NAME (type1
) = ada_type_name (type
);
7422 return static_unwrap_type (type1
);
7426 struct type
*raw_real_type
= ada_get_base_type (type
);
7427 if (raw_real_type
== type
)
7430 return to_static_fixed_type (raw_real_type
);
7434 /* In some cases, incomplete and private types require
7435 cross-references that are not resolved as records (for example,
7437 type FooP is access Foo;
7439 type Foo is array ...;
7440 ). In these cases, since there is no mechanism for producing
7441 cross-references to such types, we instead substitute for FooP a
7442 stub enumeration type that is nowhere resolved, and whose tag is
7443 the name of the actual type. Call these types "non-record stubs". */
7445 /* A type equivalent to TYPE that is not a non-record stub, if one
7446 exists, otherwise TYPE. */
7449 ada_check_typedef (struct type
*type
)
7454 CHECK_TYPEDEF (type
);
7455 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7456 || !TYPE_STUB (type
)
7457 || TYPE_TAG_NAME (type
) == NULL
)
7461 char *name
= TYPE_TAG_NAME (type
);
7462 struct type
*type1
= ada_find_any_type (name
);
7463 return (type1
== NULL
) ? type
: type1
;
7467 /* A value representing the data at VALADDR/ADDRESS as described by
7468 type TYPE0, but with a standard (static-sized) type that correctly
7469 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7470 type, then return VAL0 [this feature is simply to avoid redundant
7471 creation of struct values]. */
7473 static struct value
*
7474 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7477 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7478 if (type
== type0
&& val0
!= NULL
)
7481 return value_from_contents_and_address (type
, 0, address
);
7484 /* A value representing VAL, but with a standard (static-sized) type
7485 that correctly describes it. Does not necessarily create a new
7488 static struct value
*
7489 ada_to_fixed_value (struct value
*val
)
7491 return ada_to_fixed_value_create (value_type (val
),
7492 VALUE_ADDRESS (val
) + value_offset (val
),
7496 /* A value representing VAL, but with a standard (static-sized) type
7497 chosen to approximate the real type of VAL as well as possible, but
7498 without consulting any runtime values. For Ada dynamic-sized
7499 types, therefore, the type of the result is likely to be inaccurate. */
7502 ada_to_static_fixed_value (struct value
*val
)
7505 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7506 if (type
== value_type (val
))
7509 return coerce_unspec_val_to_type (val
, type
);
7515 /* Table mapping attribute numbers to names.
7516 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7518 static const char *attribute_names
[] = {
7536 ada_attribute_name (enum exp_opcode n
)
7538 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7539 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7541 return attribute_names
[0];
7544 /* Evaluate the 'POS attribute applied to ARG. */
7547 pos_atr (struct value
*arg
)
7549 struct value
*val
= coerce_ref (arg
);
7550 struct type
*type
= value_type (val
);
7552 if (!discrete_type_p (type
))
7553 error (_("'POS only defined on discrete types"));
7555 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7558 LONGEST v
= value_as_long (val
);
7560 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7562 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7565 error (_("enumeration value is invalid: can't find 'POS"));
7568 return value_as_long (val
);
7571 static struct value
*
7572 value_pos_atr (struct type
*type
, struct value
*arg
)
7574 return value_from_longest (type
, pos_atr (arg
));
7577 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7579 static struct value
*
7580 value_val_atr (struct type
*type
, struct value
*arg
)
7582 if (!discrete_type_p (type
))
7583 error (_("'VAL only defined on discrete types"));
7584 if (!integer_type_p (value_type (arg
)))
7585 error (_("'VAL requires integral argument"));
7587 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7589 long pos
= value_as_long (arg
);
7590 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7591 error (_("argument to 'VAL out of range"));
7592 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7595 return value_from_longest (type
, value_as_long (arg
));
7601 /* True if TYPE appears to be an Ada character type.
7602 [At the moment, this is true only for Character and Wide_Character;
7603 It is a heuristic test that could stand improvement]. */
7606 ada_is_character_type (struct type
*type
)
7610 /* If the type code says it's a character, then assume it really is,
7611 and don't check any further. */
7612 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7615 /* Otherwise, assume it's a character type iff it is a discrete type
7616 with a known character type name. */
7617 name
= ada_type_name (type
);
7618 return (name
!= NULL
7619 && (TYPE_CODE (type
) == TYPE_CODE_INT
7620 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7621 && (strcmp (name
, "character") == 0
7622 || strcmp (name
, "wide_character") == 0
7623 || strcmp (name
, "wide_wide_character") == 0
7624 || strcmp (name
, "unsigned char") == 0));
7627 /* True if TYPE appears to be an Ada string type. */
7630 ada_is_string_type (struct type
*type
)
7632 type
= ada_check_typedef (type
);
7634 && TYPE_CODE (type
) != TYPE_CODE_PTR
7635 && (ada_is_simple_array_type (type
)
7636 || ada_is_array_descriptor_type (type
))
7637 && ada_array_arity (type
) == 1)
7639 struct type
*elttype
= ada_array_element_type (type
, 1);
7641 return ada_is_character_type (elttype
);
7648 /* True if TYPE is a struct type introduced by the compiler to force the
7649 alignment of a value. Such types have a single field with a
7650 distinctive name. */
7653 ada_is_aligner_type (struct type
*type
)
7655 type
= ada_check_typedef (type
);
7657 /* If we can find a parallel XVS type, then the XVS type should
7658 be used instead of this type. And hence, this is not an aligner
7660 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7663 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7664 && TYPE_NFIELDS (type
) == 1
7665 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7668 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7669 the parallel type. */
7672 ada_get_base_type (struct type
*raw_type
)
7674 struct type
*real_type_namer
;
7675 struct type
*raw_real_type
;
7677 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7680 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7681 if (real_type_namer
== NULL
7682 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7683 || TYPE_NFIELDS (real_type_namer
) != 1)
7686 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7687 if (raw_real_type
== NULL
)
7690 return raw_real_type
;
7693 /* The type of value designated by TYPE, with all aligners removed. */
7696 ada_aligned_type (struct type
*type
)
7698 if (ada_is_aligner_type (type
))
7699 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7701 return ada_get_base_type (type
);
7705 /* The address of the aligned value in an object at address VALADDR
7706 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7709 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7711 if (ada_is_aligner_type (type
))
7712 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7714 TYPE_FIELD_BITPOS (type
,
7715 0) / TARGET_CHAR_BIT
);
7722 /* The printed representation of an enumeration literal with encoded
7723 name NAME. The value is good to the next call of ada_enum_name. */
7725 ada_enum_name (const char *name
)
7727 static char *result
;
7728 static size_t result_len
= 0;
7731 /* First, unqualify the enumeration name:
7732 1. Search for the last '.' character. If we find one, then skip
7733 all the preceeding characters, the unqualified name starts
7734 right after that dot.
7735 2. Otherwise, we may be debugging on a target where the compiler
7736 translates dots into "__". Search forward for double underscores,
7737 but stop searching when we hit an overloading suffix, which is
7738 of the form "__" followed by digits. */
7740 tmp
= strrchr (name
, '.');
7745 while ((tmp
= strstr (name
, "__")) != NULL
)
7747 if (isdigit (tmp
[2]))
7757 if (name
[1] == 'U' || name
[1] == 'W')
7759 if (sscanf (name
+ 2, "%x", &v
) != 1)
7765 GROW_VECT (result
, result_len
, 16);
7766 if (isascii (v
) && isprint (v
))
7767 sprintf (result
, "'%c'", v
);
7768 else if (name
[1] == 'U')
7769 sprintf (result
, "[\"%02x\"]", v
);
7771 sprintf (result
, "[\"%04x\"]", v
);
7777 tmp
= strstr (name
, "__");
7779 tmp
= strstr (name
, "$");
7782 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7783 strncpy (result
, name
, tmp
- name
);
7784 result
[tmp
- name
] = '\0';
7792 static struct value
*
7793 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7796 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7797 (expect_type
, exp
, pos
, noside
);
7800 /* Evaluate the subexpression of EXP starting at *POS as for
7801 evaluate_type, updating *POS to point just past the evaluated
7804 static struct value
*
7805 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7807 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7808 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7811 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7814 static struct value
*
7815 unwrap_value (struct value
*val
)
7817 struct type
*type
= ada_check_typedef (value_type (val
));
7818 if (ada_is_aligner_type (type
))
7820 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7821 struct type
*val_type
= ada_check_typedef (value_type (v
));
7822 if (ada_type_name (val_type
) == NULL
)
7823 TYPE_NAME (val_type
) = ada_type_name (type
);
7825 return unwrap_value (v
);
7829 struct type
*raw_real_type
=
7830 ada_check_typedef (ada_get_base_type (type
));
7832 if (type
== raw_real_type
)
7836 coerce_unspec_val_to_type
7837 (val
, ada_to_fixed_type (raw_real_type
, 0,
7838 VALUE_ADDRESS (val
) + value_offset (val
),
7843 static struct value
*
7844 cast_to_fixed (struct type
*type
, struct value
*arg
)
7848 if (type
== value_type (arg
))
7850 else if (ada_is_fixed_point_type (value_type (arg
)))
7851 val
= ada_float_to_fixed (type
,
7852 ada_fixed_to_float (value_type (arg
),
7853 value_as_long (arg
)));
7856 DOUBLEST argd
= value_as_double (arg
);
7857 val
= ada_float_to_fixed (type
, argd
);
7860 return value_from_longest (type
, val
);
7863 static struct value
*
7864 cast_from_fixed (struct type
*type
, struct value
*arg
)
7866 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7867 value_as_long (arg
));
7868 return value_from_double (type
, val
);
7871 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7872 return the converted value. */
7874 static struct value
*
7875 coerce_for_assign (struct type
*type
, struct value
*val
)
7877 struct type
*type2
= value_type (val
);
7881 type2
= ada_check_typedef (type2
);
7882 type
= ada_check_typedef (type
);
7884 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7885 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7887 val
= ada_value_ind (val
);
7888 type2
= value_type (val
);
7891 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7892 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7894 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7895 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7896 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7897 error (_("Incompatible types in assignment"));
7898 deprecated_set_value_type (val
, type
);
7903 static struct value
*
7904 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7907 struct type
*type1
, *type2
;
7910 arg1
= coerce_ref (arg1
);
7911 arg2
= coerce_ref (arg2
);
7912 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7913 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7915 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7916 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7917 return value_binop (arg1
, arg2
, op
);
7926 return value_binop (arg1
, arg2
, op
);
7929 v2
= value_as_long (arg2
);
7931 error (_("second operand of %s must not be zero."), op_string (op
));
7933 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7934 return value_binop (arg1
, arg2
, op
);
7936 v1
= value_as_long (arg1
);
7941 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7942 v
+= v
> 0 ? -1 : 1;
7950 /* Should not reach this point. */
7954 val
= allocate_value (type1
);
7955 store_unsigned_integer (value_contents_raw (val
),
7956 TYPE_LENGTH (value_type (val
)), v
);
7961 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7963 if (ada_is_direct_array_type (value_type (arg1
))
7964 || ada_is_direct_array_type (value_type (arg2
)))
7966 /* Automatically dereference any array reference before
7967 we attempt to perform the comparison. */
7968 arg1
= ada_coerce_ref (arg1
);
7969 arg2
= ada_coerce_ref (arg2
);
7971 arg1
= ada_coerce_to_simple_array (arg1
);
7972 arg2
= ada_coerce_to_simple_array (arg2
);
7973 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7974 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7975 error (_("Attempt to compare array with non-array"));
7976 /* FIXME: The following works only for types whose
7977 representations use all bits (no padding or undefined bits)
7978 and do not have user-defined equality. */
7980 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7981 && memcmp (value_contents (arg1
), value_contents (arg2
),
7982 TYPE_LENGTH (value_type (arg1
))) == 0;
7984 return value_equal (arg1
, arg2
);
7987 /* Total number of component associations in the aggregate starting at
7988 index PC in EXP. Assumes that index PC is the start of an
7992 num_component_specs (struct expression
*exp
, int pc
)
7995 m
= exp
->elts
[pc
+ 1].longconst
;
7998 for (i
= 0; i
< m
; i
+= 1)
8000 switch (exp
->elts
[pc
].opcode
)
8006 n
+= exp
->elts
[pc
+ 1].longconst
;
8009 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8014 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8015 component of LHS (a simple array or a record), updating *POS past
8016 the expression, assuming that LHS is contained in CONTAINER. Does
8017 not modify the inferior's memory, nor does it modify LHS (unless
8018 LHS == CONTAINER). */
8021 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8022 struct expression
*exp
, int *pos
)
8024 struct value
*mark
= value_mark ();
8026 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8028 struct value
*index_val
= value_from_longest (builtin_type_int32
, index
);
8029 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8033 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8034 elt
= ada_to_fixed_value (unwrap_value (elt
));
8037 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8038 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8040 value_assign_to_component (container
, elt
,
8041 ada_evaluate_subexp (NULL
, exp
, pos
,
8044 value_free_to_mark (mark
);
8047 /* Assuming that LHS represents an lvalue having a record or array
8048 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8049 of that aggregate's value to LHS, advancing *POS past the
8050 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8051 lvalue containing LHS (possibly LHS itself). Does not modify
8052 the inferior's memory, nor does it modify the contents of
8053 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8055 static struct value
*
8056 assign_aggregate (struct value
*container
,
8057 struct value
*lhs
, struct expression
*exp
,
8058 int *pos
, enum noside noside
)
8060 struct type
*lhs_type
;
8061 int n
= exp
->elts
[*pos
+1].longconst
;
8062 LONGEST low_index
, high_index
;
8065 int max_indices
, num_indices
;
8066 int is_array_aggregate
;
8068 struct value
*mark
= value_mark ();
8071 if (noside
!= EVAL_NORMAL
)
8074 for (i
= 0; i
< n
; i
+= 1)
8075 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8079 container
= ada_coerce_ref (container
);
8080 if (ada_is_direct_array_type (value_type (container
)))
8081 container
= ada_coerce_to_simple_array (container
);
8082 lhs
= ada_coerce_ref (lhs
);
8083 if (!deprecated_value_modifiable (lhs
))
8084 error (_("Left operand of assignment is not a modifiable lvalue."));
8086 lhs_type
= value_type (lhs
);
8087 if (ada_is_direct_array_type (lhs_type
))
8089 lhs
= ada_coerce_to_simple_array (lhs
);
8090 lhs_type
= value_type (lhs
);
8091 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8092 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8093 is_array_aggregate
= 1;
8095 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8098 high_index
= num_visible_fields (lhs_type
) - 1;
8099 is_array_aggregate
= 0;
8102 error (_("Left-hand side must be array or record."));
8104 num_specs
= num_component_specs (exp
, *pos
- 3);
8105 max_indices
= 4 * num_specs
+ 4;
8106 indices
= alloca (max_indices
* sizeof (indices
[0]));
8107 indices
[0] = indices
[1] = low_index
- 1;
8108 indices
[2] = indices
[3] = high_index
+ 1;
8111 for (i
= 0; i
< n
; i
+= 1)
8113 switch (exp
->elts
[*pos
].opcode
)
8116 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8117 &num_indices
, max_indices
,
8118 low_index
, high_index
);
8121 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8122 &num_indices
, max_indices
,
8123 low_index
, high_index
);
8127 error (_("Misplaced 'others' clause"));
8128 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8129 num_indices
, low_index
, high_index
);
8132 error (_("Internal error: bad aggregate clause"));
8139 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8140 construct at *POS, updating *POS past the construct, given that
8141 the positions are relative to lower bound LOW, where HIGH is the
8142 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8143 updating *NUM_INDICES as needed. CONTAINER is as for
8144 assign_aggregate. */
8146 aggregate_assign_positional (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
)
8151 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8153 if (ind
- 1 == high
)
8154 warning (_("Extra components in aggregate ignored."));
8157 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8159 assign_component (container
, lhs
, ind
, exp
, pos
);
8162 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8165 /* Assign into the components of LHS indexed by the OP_CHOICES
8166 construct at *POS, updating *POS past the construct, given that
8167 the allowable indices are LOW..HIGH. Record the indices assigned
8168 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8169 needed. CONTAINER is as for assign_aggregate. */
8171 aggregate_assign_from_choices (struct value
*container
,
8172 struct value
*lhs
, struct expression
*exp
,
8173 int *pos
, LONGEST
*indices
, int *num_indices
,
8174 int max_indices
, LONGEST low
, LONGEST high
)
8177 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8178 int choice_pos
, expr_pc
;
8179 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8181 choice_pos
= *pos
+= 3;
8183 for (j
= 0; j
< n_choices
; j
+= 1)
8184 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8186 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8188 for (j
= 0; j
< n_choices
; j
+= 1)
8190 LONGEST lower
, upper
;
8191 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8192 if (op
== OP_DISCRETE_RANGE
)
8195 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8197 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8202 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8213 name
= &exp
->elts
[choice_pos
+ 2].string
;
8216 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8219 error (_("Invalid record component association."));
8221 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8223 if (! find_struct_field (name
, value_type (lhs
), 0,
8224 NULL
, NULL
, NULL
, NULL
, &ind
))
8225 error (_("Unknown component name: %s."), name
);
8226 lower
= upper
= ind
;
8229 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8230 error (_("Index in component association out of bounds."));
8232 add_component_interval (lower
, upper
, indices
, num_indices
,
8234 while (lower
<= upper
)
8238 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8244 /* Assign the value of the expression in the OP_OTHERS construct in
8245 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8246 have not been previously assigned. The index intervals already assigned
8247 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8248 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8250 aggregate_assign_others (struct value
*container
,
8251 struct value
*lhs
, struct expression
*exp
,
8252 int *pos
, LONGEST
*indices
, int num_indices
,
8253 LONGEST low
, LONGEST high
)
8256 int expr_pc
= *pos
+1;
8258 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8261 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8265 assign_component (container
, lhs
, ind
, exp
, &pos
);
8268 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8271 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8272 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8273 modifying *SIZE as needed. It is an error if *SIZE exceeds
8274 MAX_SIZE. The resulting intervals do not overlap. */
8276 add_component_interval (LONGEST low
, LONGEST high
,
8277 LONGEST
* indices
, int *size
, int max_size
)
8280 for (i
= 0; i
< *size
; i
+= 2) {
8281 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8284 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8285 if (high
< indices
[kh
])
8287 if (low
< indices
[i
])
8289 indices
[i
+ 1] = indices
[kh
- 1];
8290 if (high
> indices
[i
+ 1])
8291 indices
[i
+ 1] = high
;
8292 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8293 *size
-= kh
- i
- 2;
8296 else if (high
< indices
[i
])
8300 if (*size
== max_size
)
8301 error (_("Internal error: miscounted aggregate components."));
8303 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8304 indices
[j
] = indices
[j
- 2];
8306 indices
[i
+ 1] = high
;
8309 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8312 static struct value
*
8313 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8315 if (type
== ada_check_typedef (value_type (arg2
)))
8318 if (ada_is_fixed_point_type (type
))
8319 return (cast_to_fixed (type
, arg2
));
8321 if (ada_is_fixed_point_type (value_type (arg2
)))
8322 return cast_from_fixed (type
, arg2
);
8324 return value_cast (type
, arg2
);
8327 static struct value
*
8328 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8329 int *pos
, enum noside noside
)
8332 int tem
, tem2
, tem3
;
8334 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8337 struct value
**argvec
;
8341 op
= exp
->elts
[pc
].opcode
;
8347 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8348 arg1
= unwrap_value (arg1
);
8350 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8351 then we need to perform the conversion manually, because
8352 evaluate_subexp_standard doesn't do it. This conversion is
8353 necessary in Ada because the different kinds of float/fixed
8354 types in Ada have different representations.
8356 Similarly, we need to perform the conversion from OP_LONG
8358 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8359 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8365 struct value
*result
;
8367 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8368 /* The result type will have code OP_STRING, bashed there from
8369 OP_ARRAY. Bash it back. */
8370 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8371 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8377 type
= exp
->elts
[pc
+ 1].type
;
8378 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8379 if (noside
== EVAL_SKIP
)
8381 arg1
= ada_value_cast (type
, arg1
, noside
);
8386 type
= exp
->elts
[pc
+ 1].type
;
8387 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8390 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8391 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8393 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8394 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8396 return ada_value_assign (arg1
, arg1
);
8398 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8399 except if the lhs of our assignment is a convenience variable.
8400 In the case of assigning to a convenience variable, the lhs
8401 should be exactly the result of the evaluation of the rhs. */
8402 type
= value_type (arg1
);
8403 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8405 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8406 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8408 if (ada_is_fixed_point_type (value_type (arg1
)))
8409 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8410 else if (ada_is_fixed_point_type (value_type (arg2
)))
8412 (_("Fixed-point values must be assigned to fixed-point variables"));
8414 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8415 return ada_value_assign (arg1
, arg2
);
8418 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8419 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8420 if (noside
== EVAL_SKIP
)
8422 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8423 return (value_from_longest
8425 value_as_long (arg1
) + value_as_long (arg2
)));
8426 if ((ada_is_fixed_point_type (value_type (arg1
))
8427 || ada_is_fixed_point_type (value_type (arg2
)))
8428 && value_type (arg1
) != value_type (arg2
))
8429 error (_("Operands of fixed-point addition must have the same type"));
8430 /* Do the addition, and cast the result to the type of the first
8431 argument. We cannot cast the result to a reference type, so if
8432 ARG1 is a reference type, find its underlying type. */
8433 type
= value_type (arg1
);
8434 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8435 type
= TYPE_TARGET_TYPE (type
);
8436 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8437 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8440 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8441 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8442 if (noside
== EVAL_SKIP
)
8444 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8445 return (value_from_longest
8447 value_as_long (arg1
) - value_as_long (arg2
)));
8448 if ((ada_is_fixed_point_type (value_type (arg1
))
8449 || ada_is_fixed_point_type (value_type (arg2
)))
8450 && value_type (arg1
) != value_type (arg2
))
8451 error (_("Operands of fixed-point subtraction must have the same type"));
8452 /* Do the substraction, and cast the result to the type of the first
8453 argument. We cannot cast the result to a reference type, so if
8454 ARG1 is a reference type, find its underlying type. */
8455 type
= value_type (arg1
);
8456 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8457 type
= TYPE_TARGET_TYPE (type
);
8458 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8459 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8463 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8464 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8465 if (noside
== EVAL_SKIP
)
8467 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8468 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8469 return value_zero (value_type (arg1
), not_lval
);
8472 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8473 if (ada_is_fixed_point_type (value_type (arg1
)))
8474 arg1
= cast_from_fixed (type
, arg1
);
8475 if (ada_is_fixed_point_type (value_type (arg2
)))
8476 arg2
= cast_from_fixed (type
, arg2
);
8477 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8478 return ada_value_binop (arg1
, arg2
, op
);
8483 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8484 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8485 if (noside
== EVAL_SKIP
)
8487 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8488 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8489 return value_zero (value_type (arg1
), not_lval
);
8492 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8493 return ada_value_binop (arg1
, arg2
, op
);
8497 case BINOP_NOTEQUAL
:
8498 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8499 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8500 if (noside
== EVAL_SKIP
)
8502 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8506 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8507 tem
= ada_value_equal (arg1
, arg2
);
8509 if (op
== BINOP_NOTEQUAL
)
8511 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8512 return value_from_longest (type
, (LONGEST
) tem
);
8515 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8516 if (noside
== EVAL_SKIP
)
8518 else if (ada_is_fixed_point_type (value_type (arg1
)))
8519 return value_cast (value_type (arg1
), value_neg (arg1
));
8522 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8523 return value_neg (arg1
);
8526 case BINOP_LOGICAL_AND
:
8527 case BINOP_LOGICAL_OR
:
8528 case UNOP_LOGICAL_NOT
:
8533 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8534 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8535 return value_cast (type
, val
);
8538 case BINOP_BITWISE_AND
:
8539 case BINOP_BITWISE_IOR
:
8540 case BINOP_BITWISE_XOR
:
8544 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8546 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8548 return value_cast (value_type (arg1
), val
);
8554 if (noside
== EVAL_SKIP
)
8559 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8560 /* Only encountered when an unresolved symbol occurs in a
8561 context other than a function call, in which case, it is
8563 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8564 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8565 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8567 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8568 if (ada_is_tagged_type (type
, 0))
8570 /* Tagged types are a little special in the fact that the real
8571 type is dynamic and can only be determined by inspecting the
8572 object's tag. This means that we need to get the object's
8573 value first (EVAL_NORMAL) and then extract the actual object
8576 Note that we cannot skip the final step where we extract
8577 the object type from its tag, because the EVAL_NORMAL phase
8578 results in dynamic components being resolved into fixed ones.
8579 This can cause problems when trying to print the type
8580 description of tagged types whose parent has a dynamic size:
8581 We use the type name of the "_parent" component in order
8582 to print the name of the ancestor type in the type description.
8583 If that component had a dynamic size, the resolution into
8584 a fixed type would result in the loss of that type name,
8585 thus preventing us from printing the name of the ancestor
8586 type in the type description. */
8587 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8588 return value_zero (type_from_tag (ada_value_tag (arg1
)), not_lval
);
8593 (to_static_fixed_type
8594 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8600 unwrap_value (evaluate_subexp_standard
8601 (expect_type
, exp
, pos
, noside
));
8602 return ada_to_fixed_value (arg1
);
8608 /* Allocate arg vector, including space for the function to be
8609 called in argvec[0] and a terminating NULL. */
8610 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8612 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8614 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8615 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8616 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8617 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8620 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8621 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8624 if (noside
== EVAL_SKIP
)
8628 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8629 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8630 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8631 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8632 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8633 argvec
[0] = value_addr (argvec
[0]);
8635 type
= ada_check_typedef (value_type (argvec
[0]));
8636 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8638 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8640 case TYPE_CODE_FUNC
:
8641 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8643 case TYPE_CODE_ARRAY
:
8645 case TYPE_CODE_STRUCT
:
8646 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8647 argvec
[0] = ada_value_ind (argvec
[0]);
8648 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8651 error (_("cannot subscript or call something of type `%s'"),
8652 ada_type_name (value_type (argvec
[0])));
8657 switch (TYPE_CODE (type
))
8659 case TYPE_CODE_FUNC
:
8660 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8661 return allocate_value (TYPE_TARGET_TYPE (type
));
8662 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8663 case TYPE_CODE_STRUCT
:
8667 arity
= ada_array_arity (type
);
8668 type
= ada_array_element_type (type
, nargs
);
8670 error (_("cannot subscript or call a record"));
8672 error (_("wrong number of subscripts; expecting %d"), arity
);
8673 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8674 return value_zero (ada_aligned_type (type
), lval_memory
);
8676 unwrap_value (ada_value_subscript
8677 (argvec
[0], nargs
, argvec
+ 1));
8679 case TYPE_CODE_ARRAY
:
8680 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8682 type
= ada_array_element_type (type
, nargs
);
8684 error (_("element type of array unknown"));
8686 return value_zero (ada_aligned_type (type
), lval_memory
);
8689 unwrap_value (ada_value_subscript
8690 (ada_coerce_to_simple_array (argvec
[0]),
8691 nargs
, argvec
+ 1));
8692 case TYPE_CODE_PTR
: /* Pointer to array */
8693 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8694 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8696 type
= ada_array_element_type (type
, nargs
);
8698 error (_("element type of array unknown"));
8700 return value_zero (ada_aligned_type (type
), lval_memory
);
8703 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8704 nargs
, argvec
+ 1));
8707 error (_("Attempt to index or call something other than an "
8708 "array or function"));
8713 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8714 struct value
*low_bound_val
=
8715 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8716 struct value
*high_bound_val
=
8717 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8720 low_bound_val
= coerce_ref (low_bound_val
);
8721 high_bound_val
= coerce_ref (high_bound_val
);
8722 low_bound
= pos_atr (low_bound_val
);
8723 high_bound
= pos_atr (high_bound_val
);
8725 if (noside
== EVAL_SKIP
)
8728 /* If this is a reference to an aligner type, then remove all
8730 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8731 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8732 TYPE_TARGET_TYPE (value_type (array
)) =
8733 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8735 if (ada_is_packed_array_type (value_type (array
)))
8736 error (_("cannot slice a packed array"));
8738 /* If this is a reference to an array or an array lvalue,
8739 convert to a pointer. */
8740 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8741 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8742 && VALUE_LVAL (array
) == lval_memory
))
8743 array
= value_addr (array
);
8745 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8746 && ada_is_array_descriptor_type (ada_check_typedef
8747 (value_type (array
))))
8748 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8750 array
= ada_coerce_to_simple_array_ptr (array
);
8752 /* If we have more than one level of pointer indirection,
8753 dereference the value until we get only one level. */
8754 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8755 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8757 array
= value_ind (array
);
8759 /* Make sure we really do have an array type before going further,
8760 to avoid a SEGV when trying to get the index type or the target
8761 type later down the road if the debug info generated by
8762 the compiler is incorrect or incomplete. */
8763 if (!ada_is_simple_array_type (value_type (array
)))
8764 error (_("cannot take slice of non-array"));
8766 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8768 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8769 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8773 struct type
*arr_type0
=
8774 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8776 return ada_value_slice_ptr (array
, arr_type0
,
8777 longest_to_int (low_bound
),
8778 longest_to_int (high_bound
));
8781 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8783 else if (high_bound
< low_bound
)
8784 return empty_array (value_type (array
), low_bound
);
8786 return ada_value_slice (array
, longest_to_int (low_bound
),
8787 longest_to_int (high_bound
));
8792 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8793 type
= exp
->elts
[pc
+ 1].type
;
8795 if (noside
== EVAL_SKIP
)
8798 switch (TYPE_CODE (type
))
8801 lim_warning (_("Membership test incompletely implemented; "
8802 "always returns true"));
8803 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8804 return value_from_longest (type
, (LONGEST
) 1);
8806 case TYPE_CODE_RANGE
:
8807 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
8808 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
8809 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8810 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8811 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8813 value_from_longest (type
,
8814 (value_less (arg1
, arg3
)
8815 || value_equal (arg1
, arg3
))
8816 && (value_less (arg2
, arg1
)
8817 || value_equal (arg2
, arg1
)));
8820 case BINOP_IN_BOUNDS
:
8822 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8823 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8825 if (noside
== EVAL_SKIP
)
8828 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8830 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8831 return value_zero (type
, not_lval
);
8834 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8836 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8837 error (_("invalid dimension number to 'range"));
8839 arg3
= ada_array_bound (arg2
, tem
, 1);
8840 arg2
= ada_array_bound (arg2
, tem
, 0);
8842 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8843 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8844 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8846 value_from_longest (type
,
8847 (value_less (arg1
, arg3
)
8848 || value_equal (arg1
, arg3
))
8849 && (value_less (arg2
, arg1
)
8850 || value_equal (arg2
, arg1
)));
8852 case TERNOP_IN_RANGE
:
8853 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8854 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8855 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8857 if (noside
== EVAL_SKIP
)
8860 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8861 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8862 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8864 value_from_longest (type
,
8865 (value_less (arg1
, arg3
)
8866 || value_equal (arg1
, arg3
))
8867 && (value_less (arg2
, arg1
)
8868 || value_equal (arg2
, arg1
)));
8874 struct type
*type_arg
;
8875 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8877 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8879 type_arg
= exp
->elts
[pc
+ 2].type
;
8883 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8887 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8888 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8889 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8892 if (noside
== EVAL_SKIP
)
8895 if (type_arg
== NULL
)
8897 arg1
= ada_coerce_ref (arg1
);
8899 if (ada_is_packed_array_type (value_type (arg1
)))
8900 arg1
= ada_coerce_to_simple_array (arg1
);
8902 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8903 error (_("invalid dimension number to '%s"),
8904 ada_attribute_name (op
));
8906 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8908 type
= ada_index_type (value_type (arg1
), tem
);
8911 (_("attempt to take bound of something that is not an array"));
8912 return allocate_value (type
);
8917 default: /* Should never happen. */
8918 error (_("unexpected attribute encountered"));
8920 return ada_array_bound (arg1
, tem
, 0);
8922 return ada_array_bound (arg1
, tem
, 1);
8924 return ada_array_length (arg1
, tem
);
8927 else if (discrete_type_p (type_arg
))
8929 struct type
*range_type
;
8930 char *name
= ada_type_name (type_arg
);
8932 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8934 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8935 if (range_type
== NULL
)
8936 range_type
= type_arg
;
8940 error (_("unexpected attribute encountered"));
8942 return value_from_longest
8943 (range_type
, discrete_type_low_bound (range_type
));
8945 return value_from_longest
8946 (range_type
, discrete_type_high_bound (range_type
));
8948 error (_("the 'length attribute applies only to array types"));
8951 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8952 error (_("unimplemented type attribute"));
8957 if (ada_is_packed_array_type (type_arg
))
8958 type_arg
= decode_packed_array_type (type_arg
);
8960 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8961 error (_("invalid dimension number to '%s"),
8962 ada_attribute_name (op
));
8964 type
= ada_index_type (type_arg
, tem
);
8967 (_("attempt to take bound of something that is not an array"));
8968 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8969 return allocate_value (type
);
8974 error (_("unexpected attribute encountered"));
8976 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8977 return value_from_longest (type
, low
);
8979 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8980 return value_from_longest (type
, high
);
8982 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8983 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8984 return value_from_longest (type
, high
- low
+ 1);
8990 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8991 if (noside
== EVAL_SKIP
)
8994 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8995 return value_zero (ada_tag_type (arg1
), not_lval
);
8997 return ada_value_tag (arg1
);
9001 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9002 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9003 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9004 if (noside
== EVAL_SKIP
)
9006 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9007 return value_zero (value_type (arg1
), not_lval
);
9010 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9011 return value_binop (arg1
, arg2
,
9012 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9015 case OP_ATR_MODULUS
:
9017 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
9018 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9020 if (noside
== EVAL_SKIP
)
9023 if (!ada_is_modular_type (type_arg
))
9024 error (_("'modulus must be applied to modular type"));
9026 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9027 ada_modulus (type_arg
));
9032 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9033 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9034 if (noside
== EVAL_SKIP
)
9036 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9037 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9038 return value_zero (type
, not_lval
);
9040 return value_pos_atr (type
, arg1
);
9043 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9044 if (noside
== EVAL_SKIP
)
9046 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9047 return value_zero (builtin_type_int32
, not_lval
);
9049 return value_from_longest (builtin_type_int32
,
9051 * TYPE_LENGTH (value_type (arg1
)));
9054 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9055 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9056 type
= exp
->elts
[pc
+ 2].type
;
9057 if (noside
== EVAL_SKIP
)
9059 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9060 return value_zero (type
, not_lval
);
9062 return value_val_atr (type
, arg1
);
9065 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9066 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9067 if (noside
== EVAL_SKIP
)
9069 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9070 return value_zero (value_type (arg1
), not_lval
);
9073 /* For integer exponentiation operations,
9074 only promote the first argument. */
9075 if (is_integral_type (value_type (arg2
)))
9076 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9078 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9080 return value_binop (arg1
, arg2
, op
);
9084 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9085 if (noside
== EVAL_SKIP
)
9091 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9092 if (noside
== EVAL_SKIP
)
9094 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9095 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9096 return value_neg (arg1
);
9101 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9102 if (noside
== EVAL_SKIP
)
9104 type
= ada_check_typedef (value_type (arg1
));
9105 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9107 if (ada_is_array_descriptor_type (type
))
9108 /* GDB allows dereferencing GNAT array descriptors. */
9110 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9111 if (arrType
== NULL
)
9112 error (_("Attempt to dereference null array pointer."));
9113 return value_at_lazy (arrType
, 0);
9115 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9116 || TYPE_CODE (type
) == TYPE_CODE_REF
9117 /* In C you can dereference an array to get the 1st elt. */
9118 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9120 type
= to_static_fixed_type
9122 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9124 return value_zero (type
, lval_memory
);
9126 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9128 /* GDB allows dereferencing an int. */
9129 if (expect_type
== NULL
)
9130 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9135 to_static_fixed_type (ada_aligned_type (expect_type
));
9136 return value_zero (expect_type
, lval_memory
);
9140 error (_("Attempt to take contents of a non-pointer value."));
9142 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9143 type
= ada_check_typedef (value_type (arg1
));
9145 if (TYPE_CODE (type
) == TYPE_CODE_INT
&& expect_type
!= NULL
)
9146 /* GDB allows dereferencing an int. We give it the expected
9147 type (which will be set in the case of a coercion or
9149 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9152 if (ada_is_array_descriptor_type (type
))
9153 /* GDB allows dereferencing GNAT array descriptors. */
9154 return ada_coerce_to_simple_array (arg1
);
9156 return ada_value_ind (arg1
);
9158 case STRUCTOP_STRUCT
:
9159 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9160 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9161 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9162 if (noside
== EVAL_SKIP
)
9164 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9166 struct type
*type1
= value_type (arg1
);
9167 if (ada_is_tagged_type (type1
, 1))
9169 type
= ada_lookup_struct_elt_type (type1
,
9170 &exp
->elts
[pc
+ 2].string
,
9173 /* In this case, we assume that the field COULD exist
9174 in some extension of the type. Return an object of
9175 "type" void, which will match any formal
9176 (see ada_type_match). */
9177 return value_zero (builtin_type_void
, lval_memory
);
9181 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9184 return value_zero (ada_aligned_type (type
), lval_memory
);
9188 ada_to_fixed_value (unwrap_value
9189 (ada_value_struct_elt
9190 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9192 /* The value is not supposed to be used. This is here to make it
9193 easier to accommodate expressions that contain types. */
9195 if (noside
== EVAL_SKIP
)
9197 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9198 return allocate_value (exp
->elts
[pc
+ 1].type
);
9200 error (_("Attempt to use a type name as an expression"));
9205 case OP_DISCRETE_RANGE
:
9208 if (noside
== EVAL_NORMAL
)
9212 error (_("Undefined name, ambiguous name, or renaming used in "
9213 "component association: %s."), &exp
->elts
[pc
+2].string
);
9215 error (_("Aggregates only allowed on the right of an assignment"));
9217 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9220 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9222 for (tem
= 0; tem
< nargs
; tem
+= 1)
9223 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9228 return value_from_longest (builtin_type_int8
, (LONGEST
) 1);
9234 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9235 type name that encodes the 'small and 'delta information.
9236 Otherwise, return NULL. */
9239 fixed_type_info (struct type
*type
)
9241 const char *name
= ada_type_name (type
);
9242 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9244 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9246 const char *tail
= strstr (name
, "___XF_");
9252 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9253 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9258 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9261 ada_is_fixed_point_type (struct type
*type
)
9263 return fixed_type_info (type
) != NULL
;
9266 /* Return non-zero iff TYPE represents a System.Address type. */
9269 ada_is_system_address_type (struct type
*type
)
9271 return (TYPE_NAME (type
)
9272 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9275 /* Assuming that TYPE is the representation of an Ada fixed-point
9276 type, return its delta, or -1 if the type is malformed and the
9277 delta cannot be determined. */
9280 ada_delta (struct type
*type
)
9282 const char *encoding
= fixed_type_info (type
);
9285 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9288 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9291 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9292 factor ('SMALL value) associated with the type. */
9295 scaling_factor (struct type
*type
)
9297 const char *encoding
= fixed_type_info (type
);
9298 unsigned long num0
, den0
, num1
, den1
;
9301 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9306 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9308 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9312 /* Assuming that X is the representation of a value of fixed-point
9313 type TYPE, return its floating-point equivalent. */
9316 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9318 return (DOUBLEST
) x
*scaling_factor (type
);
9321 /* The representation of a fixed-point value of type TYPE
9322 corresponding to the value X. */
9325 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9327 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9331 /* VAX floating formats */
9333 /* Non-zero iff TYPE represents one of the special VAX floating-point
9337 ada_is_vax_floating_type (struct type
*type
)
9340 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9343 && (TYPE_CODE (type
) == TYPE_CODE_INT
9344 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9345 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9348 /* The type of special VAX floating-point type this is, assuming
9349 ada_is_vax_floating_point. */
9352 ada_vax_float_type_suffix (struct type
*type
)
9354 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9357 /* A value representing the special debugging function that outputs
9358 VAX floating-point values of the type represented by TYPE. Assumes
9359 ada_is_vax_floating_type (TYPE). */
9362 ada_vax_float_print_function (struct type
*type
)
9364 switch (ada_vax_float_type_suffix (type
))
9367 return get_var_value ("DEBUG_STRING_F", 0);
9369 return get_var_value ("DEBUG_STRING_D", 0);
9371 return get_var_value ("DEBUG_STRING_G", 0);
9373 error (_("invalid VAX floating-point type"));
9380 /* Scan STR beginning at position K for a discriminant name, and
9381 return the value of that discriminant field of DVAL in *PX. If
9382 PNEW_K is not null, put the position of the character beyond the
9383 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9384 not alter *PX and *PNEW_K if unsuccessful. */
9387 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9390 static char *bound_buffer
= NULL
;
9391 static size_t bound_buffer_len
= 0;
9394 struct value
*bound_val
;
9396 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9399 pend
= strstr (str
+ k
, "__");
9403 k
+= strlen (bound
);
9407 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9408 bound
= bound_buffer
;
9409 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9410 bound
[pend
- (str
+ k
)] = '\0';
9414 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9415 if (bound_val
== NULL
)
9418 *px
= value_as_long (bound_val
);
9424 /* Value of variable named NAME in the current environment. If
9425 no such variable found, then if ERR_MSG is null, returns 0, and
9426 otherwise causes an error with message ERR_MSG. */
9428 static struct value
*
9429 get_var_value (char *name
, char *err_msg
)
9431 struct ada_symbol_info
*syms
;
9434 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9439 if (err_msg
== NULL
)
9442 error (("%s"), err_msg
);
9445 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9448 /* Value of integer variable named NAME in the current environment. If
9449 no such variable found, returns 0, and sets *FLAG to 0. If
9450 successful, sets *FLAG to 1. */
9453 get_int_var_value (char *name
, int *flag
)
9455 struct value
*var_val
= get_var_value (name
, 0);
9467 return value_as_long (var_val
);
9472 /* Return a range type whose base type is that of the range type named
9473 NAME in the current environment, and whose bounds are calculated
9474 from NAME according to the GNAT range encoding conventions.
9475 Extract discriminant values, if needed, from DVAL. If a new type
9476 must be created, allocate in OBJFILE's space. The bounds
9477 information, in general, is encoded in NAME, the base type given in
9478 the named range type. */
9480 static struct type
*
9481 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9483 struct type
*raw_type
= ada_find_any_type (name
);
9484 struct type
*base_type
;
9487 if (raw_type
== NULL
)
9488 base_type
= builtin_type_int32
;
9489 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9490 base_type
= TYPE_TARGET_TYPE (raw_type
);
9492 base_type
= raw_type
;
9494 subtype_info
= strstr (name
, "___XD");
9495 if (subtype_info
== NULL
)
9497 LONGEST L
= discrete_type_low_bound (raw_type
);
9498 LONGEST U
= discrete_type_high_bound (raw_type
);
9499 if (L
< INT_MIN
|| U
> INT_MAX
)
9502 return create_range_type (alloc_type (objfile
), raw_type
,
9503 discrete_type_low_bound (raw_type
),
9504 discrete_type_high_bound (raw_type
));
9508 static char *name_buf
= NULL
;
9509 static size_t name_len
= 0;
9510 int prefix_len
= subtype_info
- name
;
9516 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9517 strncpy (name_buf
, name
, prefix_len
);
9518 name_buf
[prefix_len
] = '\0';
9521 bounds_str
= strchr (subtype_info
, '_');
9524 if (*subtype_info
== 'L')
9526 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9527 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9529 if (bounds_str
[n
] == '_')
9531 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9538 strcpy (name_buf
+ prefix_len
, "___L");
9539 L
= get_int_var_value (name_buf
, &ok
);
9542 lim_warning (_("Unknown lower bound, using 1."));
9547 if (*subtype_info
== 'U')
9549 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9550 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9556 strcpy (name_buf
+ prefix_len
, "___U");
9557 U
= get_int_var_value (name_buf
, &ok
);
9560 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9565 if (objfile
== NULL
)
9566 objfile
= TYPE_OBJFILE (base_type
);
9567 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9568 TYPE_NAME (type
) = name
;
9573 /* True iff NAME is the name of a range type. */
9576 ada_is_range_type_name (const char *name
)
9578 return (name
!= NULL
&& strstr (name
, "___XD"));
9584 /* True iff TYPE is an Ada modular type. */
9587 ada_is_modular_type (struct type
*type
)
9589 struct type
*subranged_type
= base_type (type
);
9591 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9592 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9593 && TYPE_UNSIGNED (subranged_type
));
9596 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9599 ada_modulus (struct type
* type
)
9601 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9605 /* Ada exception catchpoint support:
9606 ---------------------------------
9608 We support 3 kinds of exception catchpoints:
9609 . catchpoints on Ada exceptions
9610 . catchpoints on unhandled Ada exceptions
9611 . catchpoints on failed assertions
9613 Exceptions raised during failed assertions, or unhandled exceptions
9614 could perfectly be caught with the general catchpoint on Ada exceptions.
9615 However, we can easily differentiate these two special cases, and having
9616 the option to distinguish these two cases from the rest can be useful
9617 to zero-in on certain situations.
9619 Exception catchpoints are a specialized form of breakpoint,
9620 since they rely on inserting breakpoints inside known routines
9621 of the GNAT runtime. The implementation therefore uses a standard
9622 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9625 Support in the runtime for exception catchpoints have been changed
9626 a few times already, and these changes affect the implementation
9627 of these catchpoints. In order to be able to support several
9628 variants of the runtime, we use a sniffer that will determine
9629 the runtime variant used by the program being debugged.
9631 At this time, we do not support the use of conditions on Ada exception
9632 catchpoints. The COND and COND_STRING fields are therefore set
9633 to NULL (most of the time, see below).
9635 Conditions where EXP_STRING, COND, and COND_STRING are used:
9637 When a user specifies the name of a specific exception in the case
9638 of catchpoints on Ada exceptions, we store the name of that exception
9639 in the EXP_STRING. We then translate this request into an actual
9640 condition stored in COND_STRING, and then parse it into an expression
9643 /* The different types of catchpoints that we introduced for catching
9646 enum exception_catchpoint_kind
9649 ex_catch_exception_unhandled
,
9653 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9655 /* A structure that describes how to support exception catchpoints
9656 for a given executable. */
9658 struct exception_support_info
9660 /* The name of the symbol to break on in order to insert
9661 a catchpoint on exceptions. */
9662 const char *catch_exception_sym
;
9664 /* The name of the symbol to break on in order to insert
9665 a catchpoint on unhandled exceptions. */
9666 const char *catch_exception_unhandled_sym
;
9668 /* The name of the symbol to break on in order to insert
9669 a catchpoint on failed assertions. */
9670 const char *catch_assert_sym
;
9672 /* Assuming that the inferior just triggered an unhandled exception
9673 catchpoint, this function is responsible for returning the address
9674 in inferior memory where the name of that exception is stored.
9675 Return zero if the address could not be computed. */
9676 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9679 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9680 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9682 /* The following exception support info structure describes how to
9683 implement exception catchpoints with the latest version of the
9684 Ada runtime (as of 2007-03-06). */
9686 static const struct exception_support_info default_exception_support_info
=
9688 "__gnat_debug_raise_exception", /* catch_exception_sym */
9689 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9690 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9691 ada_unhandled_exception_name_addr
9694 /* The following exception support info structure describes how to
9695 implement exception catchpoints with a slightly older version
9696 of the Ada runtime. */
9698 static const struct exception_support_info exception_support_info_fallback
=
9700 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9701 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9702 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9703 ada_unhandled_exception_name_addr_from_raise
9706 /* For each executable, we sniff which exception info structure to use
9707 and cache it in the following global variable. */
9709 static const struct exception_support_info
*exception_info
= NULL
;
9711 /* Inspect the Ada runtime and determine which exception info structure
9712 should be used to provide support for exception catchpoints.
9714 This function will always set exception_info, or raise an error. */
9717 ada_exception_support_info_sniffer (void)
9721 /* If the exception info is already known, then no need to recompute it. */
9722 if (exception_info
!= NULL
)
9725 /* Check the latest (default) exception support info. */
9726 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9730 exception_info
= &default_exception_support_info
;
9734 /* Try our fallback exception suport info. */
9735 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9739 exception_info
= &exception_support_info_fallback
;
9743 /* Sometimes, it is normal for us to not be able to find the routine
9744 we are looking for. This happens when the program is linked with
9745 the shared version of the GNAT runtime, and the program has not been
9746 started yet. Inform the user of these two possible causes if
9749 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9750 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9752 /* If the symbol does not exist, then check that the program is
9753 already started, to make sure that shared libraries have been
9754 loaded. If it is not started, this may mean that the symbol is
9755 in a shared library. */
9757 if (ptid_get_pid (inferior_ptid
) == 0)
9758 error (_("Unable to insert catchpoint. Try to start the program first."));
9760 /* At this point, we know that we are debugging an Ada program and
9761 that the inferior has been started, but we still are not able to
9762 find the run-time symbols. That can mean that we are in
9763 configurable run time mode, or that a-except as been optimized
9764 out by the linker... In any case, at this point it is not worth
9765 supporting this feature. */
9767 error (_("Cannot insert catchpoints in this configuration."));
9770 /* An observer of "executable_changed" events.
9771 Its role is to clear certain cached values that need to be recomputed
9772 each time a new executable is loaded by GDB. */
9775 ada_executable_changed_observer (void)
9777 /* If the executable changed, then it is possible that the Ada runtime
9778 is different. So we need to invalidate the exception support info
9780 exception_info
= NULL
;
9783 /* Return the name of the function at PC, NULL if could not find it.
9784 This function only checks the debugging information, not the symbol
9788 function_name_from_pc (CORE_ADDR pc
)
9792 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9798 /* True iff FRAME is very likely to be that of a function that is
9799 part of the runtime system. This is all very heuristic, but is
9800 intended to be used as advice as to what frames are uninteresting
9804 is_known_support_routine (struct frame_info
*frame
)
9806 struct symtab_and_line sal
;
9810 /* If this code does not have any debugging information (no symtab),
9811 This cannot be any user code. */
9813 find_frame_sal (frame
, &sal
);
9814 if (sal
.symtab
== NULL
)
9817 /* If there is a symtab, but the associated source file cannot be
9818 located, then assume this is not user code: Selecting a frame
9819 for which we cannot display the code would not be very helpful
9820 for the user. This should also take care of case such as VxWorks
9821 where the kernel has some debugging info provided for a few units. */
9823 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9826 /* Check the unit filename againt the Ada runtime file naming.
9827 We also check the name of the objfile against the name of some
9828 known system libraries that sometimes come with debugging info
9831 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9833 re_comp (known_runtime_file_name_patterns
[i
]);
9834 if (re_exec (sal
.symtab
->filename
))
9836 if (sal
.symtab
->objfile
!= NULL
9837 && re_exec (sal
.symtab
->objfile
->name
))
9841 /* Check whether the function is a GNAT-generated entity. */
9843 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9844 if (func_name
== NULL
)
9847 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9849 re_comp (known_auxiliary_function_name_patterns
[i
]);
9850 if (re_exec (func_name
))
9857 /* Find the first frame that contains debugging information and that is not
9858 part of the Ada run-time, starting from FI and moving upward. */
9861 ada_find_printable_frame (struct frame_info
*fi
)
9863 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9865 if (!is_known_support_routine (fi
))
9874 /* Assuming that the inferior just triggered an unhandled exception
9875 catchpoint, return the address in inferior memory where the name
9876 of the exception is stored.
9878 Return zero if the address could not be computed. */
9881 ada_unhandled_exception_name_addr (void)
9883 return parse_and_eval_address ("e.full_name");
9886 /* Same as ada_unhandled_exception_name_addr, except that this function
9887 should be used when the inferior uses an older version of the runtime,
9888 where the exception name needs to be extracted from a specific frame
9889 several frames up in the callstack. */
9892 ada_unhandled_exception_name_addr_from_raise (void)
9895 struct frame_info
*fi
;
9897 /* To determine the name of this exception, we need to select
9898 the frame corresponding to RAISE_SYM_NAME. This frame is
9899 at least 3 levels up, so we simply skip the first 3 frames
9900 without checking the name of their associated function. */
9901 fi
= get_current_frame ();
9902 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9904 fi
= get_prev_frame (fi
);
9908 const char *func_name
=
9909 function_name_from_pc (get_frame_address_in_block (fi
));
9910 if (func_name
!= NULL
9911 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9912 break; /* We found the frame we were looking for... */
9913 fi
= get_prev_frame (fi
);
9920 return parse_and_eval_address ("id.full_name");
9923 /* Assuming the inferior just triggered an Ada exception catchpoint
9924 (of any type), return the address in inferior memory where the name
9925 of the exception is stored, if applicable.
9927 Return zero if the address could not be computed, or if not relevant. */
9930 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9931 struct breakpoint
*b
)
9935 case ex_catch_exception
:
9936 return (parse_and_eval_address ("e.full_name"));
9939 case ex_catch_exception_unhandled
:
9940 return exception_info
->unhandled_exception_name_addr ();
9943 case ex_catch_assert
:
9944 return 0; /* Exception name is not relevant in this case. */
9948 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9952 return 0; /* Should never be reached. */
9955 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9956 any error that ada_exception_name_addr_1 might cause to be thrown.
9957 When an error is intercepted, a warning with the error message is printed,
9958 and zero is returned. */
9961 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9962 struct breakpoint
*b
)
9964 struct gdb_exception e
;
9965 CORE_ADDR result
= 0;
9967 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9969 result
= ada_exception_name_addr_1 (ex
, b
);
9974 warning (_("failed to get exception name: %s"), e
.message
);
9981 /* Implement the PRINT_IT method in the breakpoint_ops structure
9982 for all exception catchpoint kinds. */
9984 static enum print_stop_action
9985 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
9987 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
9988 char exception_name
[256];
9992 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
9993 exception_name
[sizeof (exception_name
) - 1] = '\0';
9996 ada_find_printable_frame (get_current_frame ());
9998 annotate_catchpoint (b
->number
);
10001 case ex_catch_exception
:
10003 printf_filtered (_("\nCatchpoint %d, %s at "),
10004 b
->number
, exception_name
);
10006 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10008 case ex_catch_exception_unhandled
:
10010 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10011 b
->number
, exception_name
);
10013 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10016 case ex_catch_assert
:
10017 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10022 return PRINT_SRC_AND_LOC
;
10025 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10026 for all exception catchpoint kinds. */
10029 print_one_exception (enum exception_catchpoint_kind ex
,
10030 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10034 annotate_field (4);
10035 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10038 annotate_field (5);
10039 *last_addr
= b
->loc
->address
;
10042 case ex_catch_exception
:
10043 if (b
->exp_string
!= NULL
)
10045 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10047 ui_out_field_string (uiout
, "what", msg
);
10051 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10055 case ex_catch_exception_unhandled
:
10056 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10059 case ex_catch_assert
:
10060 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10064 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10069 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10070 for all exception catchpoint kinds. */
10073 print_mention_exception (enum exception_catchpoint_kind ex
,
10074 struct breakpoint
*b
)
10078 case ex_catch_exception
:
10079 if (b
->exp_string
!= NULL
)
10080 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10081 b
->number
, b
->exp_string
);
10083 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10087 case ex_catch_exception_unhandled
:
10088 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10092 case ex_catch_assert
:
10093 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10097 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10102 /* Virtual table for "catch exception" breakpoints. */
10104 static enum print_stop_action
10105 print_it_catch_exception (struct breakpoint
*b
)
10107 return print_it_exception (ex_catch_exception
, b
);
10111 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10113 print_one_exception (ex_catch_exception
, b
, last_addr
);
10117 print_mention_catch_exception (struct breakpoint
*b
)
10119 print_mention_exception (ex_catch_exception
, b
);
10122 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10124 print_it_catch_exception
,
10125 print_one_catch_exception
,
10126 print_mention_catch_exception
10129 /* Virtual table for "catch exception unhandled" breakpoints. */
10131 static enum print_stop_action
10132 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10134 return print_it_exception (ex_catch_exception_unhandled
, b
);
10138 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10140 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10144 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10146 print_mention_exception (ex_catch_exception_unhandled
, b
);
10149 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10150 print_it_catch_exception_unhandled
,
10151 print_one_catch_exception_unhandled
,
10152 print_mention_catch_exception_unhandled
10155 /* Virtual table for "catch assert" breakpoints. */
10157 static enum print_stop_action
10158 print_it_catch_assert (struct breakpoint
*b
)
10160 return print_it_exception (ex_catch_assert
, b
);
10164 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10166 print_one_exception (ex_catch_assert
, b
, last_addr
);
10170 print_mention_catch_assert (struct breakpoint
*b
)
10172 print_mention_exception (ex_catch_assert
, b
);
10175 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10176 print_it_catch_assert
,
10177 print_one_catch_assert
,
10178 print_mention_catch_assert
10181 /* Return non-zero if B is an Ada exception catchpoint. */
10184 ada_exception_catchpoint_p (struct breakpoint
*b
)
10186 return (b
->ops
== &catch_exception_breakpoint_ops
10187 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10188 || b
->ops
== &catch_assert_breakpoint_ops
);
10191 /* Return a newly allocated copy of the first space-separated token
10192 in ARGSP, and then adjust ARGSP to point immediately after that
10195 Return NULL if ARGPS does not contain any more tokens. */
10198 ada_get_next_arg (char **argsp
)
10200 char *args
= *argsp
;
10204 /* Skip any leading white space. */
10206 while (isspace (*args
))
10209 if (args
[0] == '\0')
10210 return NULL
; /* No more arguments. */
10212 /* Find the end of the current argument. */
10215 while (*end
!= '\0' && !isspace (*end
))
10218 /* Adjust ARGSP to point to the start of the next argument. */
10222 /* Make a copy of the current argument and return it. */
10224 result
= xmalloc (end
- args
+ 1);
10225 strncpy (result
, args
, end
- args
);
10226 result
[end
- args
] = '\0';
10231 /* Split the arguments specified in a "catch exception" command.
10232 Set EX to the appropriate catchpoint type.
10233 Set EXP_STRING to the name of the specific exception if
10234 specified by the user. */
10237 catch_ada_exception_command_split (char *args
,
10238 enum exception_catchpoint_kind
*ex
,
10241 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10242 char *exception_name
;
10244 exception_name
= ada_get_next_arg (&args
);
10245 make_cleanup (xfree
, exception_name
);
10247 /* Check that we do not have any more arguments. Anything else
10250 while (isspace (*args
))
10253 if (args
[0] != '\0')
10254 error (_("Junk at end of expression"));
10256 discard_cleanups (old_chain
);
10258 if (exception_name
== NULL
)
10260 /* Catch all exceptions. */
10261 *ex
= ex_catch_exception
;
10262 *exp_string
= NULL
;
10264 else if (strcmp (exception_name
, "unhandled") == 0)
10266 /* Catch unhandled exceptions. */
10267 *ex
= ex_catch_exception_unhandled
;
10268 *exp_string
= NULL
;
10272 /* Catch a specific exception. */
10273 *ex
= ex_catch_exception
;
10274 *exp_string
= exception_name
;
10278 /* Return the name of the symbol on which we should break in order to
10279 implement a catchpoint of the EX kind. */
10281 static const char *
10282 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10284 gdb_assert (exception_info
!= NULL
);
10288 case ex_catch_exception
:
10289 return (exception_info
->catch_exception_sym
);
10291 case ex_catch_exception_unhandled
:
10292 return (exception_info
->catch_exception_unhandled_sym
);
10294 case ex_catch_assert
:
10295 return (exception_info
->catch_assert_sym
);
10298 internal_error (__FILE__
, __LINE__
,
10299 _("unexpected catchpoint kind (%d)"), ex
);
10303 /* Return the breakpoint ops "virtual table" used for catchpoints
10306 static struct breakpoint_ops
*
10307 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10311 case ex_catch_exception
:
10312 return (&catch_exception_breakpoint_ops
);
10314 case ex_catch_exception_unhandled
:
10315 return (&catch_exception_unhandled_breakpoint_ops
);
10317 case ex_catch_assert
:
10318 return (&catch_assert_breakpoint_ops
);
10321 internal_error (__FILE__
, __LINE__
,
10322 _("unexpected catchpoint kind (%d)"), ex
);
10326 /* Return the condition that will be used to match the current exception
10327 being raised with the exception that the user wants to catch. This
10328 assumes that this condition is used when the inferior just triggered
10329 an exception catchpoint.
10331 The string returned is a newly allocated string that needs to be
10332 deallocated later. */
10335 ada_exception_catchpoint_cond_string (const char *exp_string
)
10337 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10340 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10342 static struct expression
*
10343 ada_parse_catchpoint_condition (char *cond_string
,
10344 struct symtab_and_line sal
)
10346 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10349 /* Return the symtab_and_line that should be used to insert an exception
10350 catchpoint of the TYPE kind.
10352 EX_STRING should contain the name of a specific exception
10353 that the catchpoint should catch, or NULL otherwise.
10355 The idea behind all the remaining parameters is that their names match
10356 the name of certain fields in the breakpoint structure that are used to
10357 handle exception catchpoints. This function returns the value to which
10358 these fields should be set, depending on the type of catchpoint we need
10361 If COND and COND_STRING are both non-NULL, any value they might
10362 hold will be free'ed, and then replaced by newly allocated ones.
10363 These parameters are left untouched otherwise. */
10365 static struct symtab_and_line
10366 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10367 char **addr_string
, char **cond_string
,
10368 struct expression
**cond
, struct breakpoint_ops
**ops
)
10370 const char *sym_name
;
10371 struct symbol
*sym
;
10372 struct symtab_and_line sal
;
10374 /* First, find out which exception support info to use. */
10375 ada_exception_support_info_sniffer ();
10377 /* Then lookup the function on which we will break in order to catch
10378 the Ada exceptions requested by the user. */
10380 sym_name
= ada_exception_sym_name (ex
);
10381 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10383 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10384 that should be compiled with debugging information. As a result, we
10385 expect to find that symbol in the symtabs. If we don't find it, then
10386 the target most likely does not support Ada exceptions, or we cannot
10387 insert exception breakpoints yet, because the GNAT runtime hasn't been
10390 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10391 in such a way that no debugging information is produced for the symbol
10392 we are looking for. In this case, we could search the minimal symbols
10393 as a fall-back mechanism. This would still be operating in degraded
10394 mode, however, as we would still be missing the debugging information
10395 that is needed in order to extract the name of the exception being
10396 raised (this name is printed in the catchpoint message, and is also
10397 used when trying to catch a specific exception). We do not handle
10398 this case for now. */
10401 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10403 /* Make sure that the symbol we found corresponds to a function. */
10404 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10405 error (_("Symbol \"%s\" is not a function (class = %d)"),
10406 sym_name
, SYMBOL_CLASS (sym
));
10408 sal
= find_function_start_sal (sym
, 1);
10410 /* Set ADDR_STRING. */
10412 *addr_string
= xstrdup (sym_name
);
10414 /* Set the COND and COND_STRING (if not NULL). */
10416 if (cond_string
!= NULL
&& cond
!= NULL
)
10418 if (*cond_string
!= NULL
)
10420 xfree (*cond_string
);
10421 *cond_string
= NULL
;
10428 if (exp_string
!= NULL
)
10430 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10431 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10436 *ops
= ada_exception_breakpoint_ops (ex
);
10441 /* Parse the arguments (ARGS) of the "catch exception" command.
10443 Set TYPE to the appropriate exception catchpoint type.
10444 If the user asked the catchpoint to catch only a specific
10445 exception, then save the exception name in ADDR_STRING.
10447 See ada_exception_sal for a description of all the remaining
10448 function arguments of this function. */
10450 struct symtab_and_line
10451 ada_decode_exception_location (char *args
, char **addr_string
,
10452 char **exp_string
, char **cond_string
,
10453 struct expression
**cond
,
10454 struct breakpoint_ops
**ops
)
10456 enum exception_catchpoint_kind ex
;
10458 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10459 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10463 struct symtab_and_line
10464 ada_decode_assert_location (char *args
, char **addr_string
,
10465 struct breakpoint_ops
**ops
)
10467 /* Check that no argument where provided at the end of the command. */
10471 while (isspace (*args
))
10474 error (_("Junk at end of arguments."));
10477 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10482 /* Information about operators given special treatment in functions
10484 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10486 #define ADA_OPERATORS \
10487 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10488 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10489 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10490 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10491 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10492 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10493 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10494 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10495 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10496 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10497 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10498 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10499 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10500 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10501 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10502 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10503 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10504 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10505 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10508 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10510 switch (exp
->elts
[pc
- 1].opcode
)
10513 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10516 #define OP_DEFN(op, len, args, binop) \
10517 case op: *oplenp = len; *argsp = args; break;
10523 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10528 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10534 ada_op_name (enum exp_opcode opcode
)
10539 return op_name_standard (opcode
);
10541 #define OP_DEFN(op, len, args, binop) case op: return #op;
10546 return "OP_AGGREGATE";
10548 return "OP_CHOICES";
10554 /* As for operator_length, but assumes PC is pointing at the first
10555 element of the operator, and gives meaningful results only for the
10556 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10559 ada_forward_operator_length (struct expression
*exp
, int pc
,
10560 int *oplenp
, int *argsp
)
10562 switch (exp
->elts
[pc
].opcode
)
10565 *oplenp
= *argsp
= 0;
10568 #define OP_DEFN(op, len, args, binop) \
10569 case op: *oplenp = len; *argsp = args; break;
10575 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10580 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10586 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10587 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10595 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10597 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10602 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10606 /* Ada attributes ('Foo). */
10609 case OP_ATR_LENGTH
:
10613 case OP_ATR_MODULUS
:
10620 case UNOP_IN_RANGE
:
10622 /* XXX: gdb_sprint_host_address, type_sprint */
10623 fprintf_filtered (stream
, _("Type @"));
10624 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10625 fprintf_filtered (stream
, " (");
10626 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10627 fprintf_filtered (stream
, ")");
10629 case BINOP_IN_BOUNDS
:
10630 fprintf_filtered (stream
, " (%d)",
10631 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10633 case TERNOP_IN_RANGE
:
10638 case OP_DISCRETE_RANGE
:
10639 case OP_POSITIONAL
:
10646 char *name
= &exp
->elts
[elt
+ 2].string
;
10647 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10648 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10653 return dump_subexp_body_standard (exp
, stream
, elt
);
10657 for (i
= 0; i
< nargs
; i
+= 1)
10658 elt
= dump_subexp (exp
, stream
, elt
);
10663 /* The Ada extension of print_subexp (q.v.). */
10666 ada_print_subexp (struct expression
*exp
, int *pos
,
10667 struct ui_file
*stream
, enum precedence prec
)
10669 int oplen
, nargs
, i
;
10671 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10673 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10680 print_subexp_standard (exp
, pos
, stream
, prec
);
10684 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10687 case BINOP_IN_BOUNDS
:
10688 /* XXX: sprint_subexp */
10689 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10690 fputs_filtered (" in ", stream
);
10691 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10692 fputs_filtered ("'range", stream
);
10693 if (exp
->elts
[pc
+ 1].longconst
> 1)
10694 fprintf_filtered (stream
, "(%ld)",
10695 (long) exp
->elts
[pc
+ 1].longconst
);
10698 case TERNOP_IN_RANGE
:
10699 if (prec
>= PREC_EQUAL
)
10700 fputs_filtered ("(", stream
);
10701 /* XXX: sprint_subexp */
10702 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10703 fputs_filtered (" in ", stream
);
10704 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10705 fputs_filtered (" .. ", stream
);
10706 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10707 if (prec
>= PREC_EQUAL
)
10708 fputs_filtered (")", stream
);
10713 case OP_ATR_LENGTH
:
10717 case OP_ATR_MODULUS
:
10722 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10724 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10725 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10729 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10730 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10734 for (tem
= 1; tem
< nargs
; tem
+= 1)
10736 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10737 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10739 fputs_filtered (")", stream
);
10744 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10745 fputs_filtered ("'(", stream
);
10746 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10747 fputs_filtered (")", stream
);
10750 case UNOP_IN_RANGE
:
10751 /* XXX: sprint_subexp */
10752 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10753 fputs_filtered (" in ", stream
);
10754 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10757 case OP_DISCRETE_RANGE
:
10758 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10759 fputs_filtered ("..", stream
);
10760 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10764 fputs_filtered ("others => ", stream
);
10765 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10769 for (i
= 0; i
< nargs
-1; i
+= 1)
10772 fputs_filtered ("|", stream
);
10773 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10775 fputs_filtered (" => ", stream
);
10776 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10779 case OP_POSITIONAL
:
10780 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10784 fputs_filtered ("(", stream
);
10785 for (i
= 0; i
< nargs
; i
+= 1)
10788 fputs_filtered (", ", stream
);
10789 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10791 fputs_filtered (")", stream
);
10796 /* Table mapping opcodes into strings for printing operators
10797 and precedences of the operators. */
10799 static const struct op_print ada_op_print_tab
[] = {
10800 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10801 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10802 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10803 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10804 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10805 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10806 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10807 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10808 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10809 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10810 {">", BINOP_GTR
, PREC_ORDER
, 0},
10811 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10812 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10813 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10814 {"+", BINOP_ADD
, PREC_ADD
, 0},
10815 {"-", BINOP_SUB
, PREC_ADD
, 0},
10816 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10817 {"*", BINOP_MUL
, PREC_MUL
, 0},
10818 {"/", BINOP_DIV
, PREC_MUL
, 0},
10819 {"rem", BINOP_REM
, PREC_MUL
, 0},
10820 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10821 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10822 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10823 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10824 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10825 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10826 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10827 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10828 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10829 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10830 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10834 enum ada_primitive_types
{
10835 ada_primitive_type_int
,
10836 ada_primitive_type_long
,
10837 ada_primitive_type_short
,
10838 ada_primitive_type_char
,
10839 ada_primitive_type_float
,
10840 ada_primitive_type_double
,
10841 ada_primitive_type_void
,
10842 ada_primitive_type_long_long
,
10843 ada_primitive_type_long_double
,
10844 ada_primitive_type_natural
,
10845 ada_primitive_type_positive
,
10846 ada_primitive_type_system_address
,
10847 nr_ada_primitive_types
10851 ada_language_arch_info (struct gdbarch
*gdbarch
,
10852 struct language_arch_info
*lai
)
10854 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10855 lai
->primitive_type_vector
10856 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10858 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10859 init_type (TYPE_CODE_INT
,
10860 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10861 0, "integer", (struct objfile
*) NULL
);
10862 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10863 init_type (TYPE_CODE_INT
,
10864 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10865 0, "long_integer", (struct objfile
*) NULL
);
10866 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10867 init_type (TYPE_CODE_INT
,
10868 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10869 0, "short_integer", (struct objfile
*) NULL
);
10870 lai
->string_char_type
=
10871 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10872 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10873 0, "character", (struct objfile
*) NULL
);
10874 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10875 init_type (TYPE_CODE_FLT
,
10876 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10877 0, "float", (struct objfile
*) NULL
);
10878 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10879 init_type (TYPE_CODE_FLT
,
10880 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10881 0, "long_float", (struct objfile
*) NULL
);
10882 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10883 init_type (TYPE_CODE_INT
,
10884 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10885 0, "long_long_integer", (struct objfile
*) NULL
);
10886 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10887 init_type (TYPE_CODE_FLT
,
10888 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10889 0, "long_long_float", (struct objfile
*) NULL
);
10890 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10891 init_type (TYPE_CODE_INT
,
10892 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10893 0, "natural", (struct objfile
*) NULL
);
10894 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10895 init_type (TYPE_CODE_INT
,
10896 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10897 0, "positive", (struct objfile
*) NULL
);
10898 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10900 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10901 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10902 (struct objfile
*) NULL
));
10903 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10904 = "system__address";
10906 lai
->bool_type_symbol
= "boolean";
10907 lai
->bool_type_default
= builtin
->builtin_bool
;
10910 /* Language vector */
10912 /* Not really used, but needed in the ada_language_defn. */
10915 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10917 ada_emit_char (c
, stream
, quoter
, 1);
10923 warnings_issued
= 0;
10924 return ada_parse ();
10927 static const struct exp_descriptor ada_exp_descriptor
= {
10929 ada_operator_length
,
10931 ada_dump_subexp_body
,
10932 ada_evaluate_subexp
10935 const struct language_defn ada_language_defn
= {
10936 "ada", /* Language name */
10940 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10941 that's not quite what this means. */
10943 macro_expansion_no
,
10944 &ada_exp_descriptor
,
10948 ada_printchar
, /* Print a character constant */
10949 ada_printstr
, /* Function to print string constant */
10950 emit_char
, /* Function to print single char (not used) */
10951 ada_print_type
, /* Print a type using appropriate syntax */
10952 default_print_typedef
, /* Print a typedef using appropriate syntax */
10953 ada_val_print
, /* Print a value using appropriate syntax */
10954 ada_value_print
, /* Print a top-level value */
10955 NULL
, /* Language specific skip_trampoline */
10956 NULL
, /* name_of_this */
10957 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10958 basic_lookup_transparent_type
, /* lookup_transparent_type */
10959 ada_la_decode
, /* Language specific symbol demangler */
10960 NULL
, /* Language specific class_name_from_physname */
10961 ada_op_print_tab
, /* expression operators for printing */
10962 0, /* c-style arrays */
10963 1, /* String lower bound */
10964 ada_get_gdb_completer_word_break_characters
,
10965 ada_make_symbol_completion_list
,
10966 ada_language_arch_info
,
10967 ada_print_array_index
,
10968 default_pass_by_reference
,
10973 _initialize_ada_language (void)
10975 add_language (&ada_language_defn
);
10977 varsize_limit
= 65536;
10979 obstack_init (&symbol_list_obstack
);
10981 decoded_names_store
= htab_create_alloc
10982 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
10983 NULL
, xcalloc
, xfree
);
10985 observer_attach_executable_changed (ada_executable_changed_observer
);