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 2 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, write to the Free Software
20 Foundation, Inc., 51 Franklin Street, Fifth Floor,
21 Boston, MA 02110-1301, USA. */
26 #include "gdb_string.h"
30 #include "gdb_regex.h"
35 #include "expression.h"
36 #include "parser-defs.h"
42 #include "breakpoint.h"
45 #include "gdb_obstack.h"
47 #include "completer.h"
54 #include "dictionary.h"
55 #include "exceptions.h"
59 #ifndef ADA_RETAIN_DOTS
60 #define ADA_RETAIN_DOTS 0
63 /* Define whether or not the C operator '/' truncates towards zero for
64 differently signed operands (truncation direction is undefined in C).
65 Copied from valarith.c. */
67 #ifndef TRUNCATION_TOWARDS_ZERO
68 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
72 static void extract_string (CORE_ADDR addr
, char *buf
);
74 static struct type
*ada_create_fundamental_type (struct objfile
*, int);
76 static void modify_general_field (char *, LONGEST
, int, int);
78 static struct type
*desc_base_type (struct type
*);
80 static struct type
*desc_bounds_type (struct type
*);
82 static struct value
*desc_bounds (struct value
*);
84 static int fat_pntr_bounds_bitpos (struct type
*);
86 static int fat_pntr_bounds_bitsize (struct type
*);
88 static struct type
*desc_data_type (struct type
*);
90 static struct value
*desc_data (struct value
*);
92 static int fat_pntr_data_bitpos (struct type
*);
94 static int fat_pntr_data_bitsize (struct type
*);
96 static struct value
*desc_one_bound (struct value
*, int, int);
98 static int desc_bound_bitpos (struct type
*, int, int);
100 static int desc_bound_bitsize (struct type
*, int, int);
102 static struct type
*desc_index_type (struct type
*, int);
104 static int desc_arity (struct type
*);
106 static int ada_type_match (struct type
*, struct type
*, int);
108 static int ada_args_match (struct symbol
*, struct value
**, int);
110 static struct value
*ensure_lval (struct value
*, CORE_ADDR
*);
112 static struct value
*convert_actual (struct value
*, struct type
*,
115 static struct value
*make_array_descriptor (struct type
*, struct value
*,
118 static void ada_add_block_symbols (struct obstack
*,
119 struct block
*, const char *,
120 domain_enum
, struct objfile
*,
121 struct symtab
*, int);
123 static int is_nonfunction (struct ada_symbol_info
*, int);
125 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
126 struct block
*, struct symtab
*);
128 static int num_defns_collected (struct obstack
*);
130 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
132 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
133 *, const char *, int,
136 static struct symtab
*symtab_for_sym (struct symbol
*);
138 static struct value
*resolve_subexp (struct expression
**, int *, int,
141 static void replace_operator_with_call (struct expression
**, int, int, int,
142 struct symbol
*, struct block
*);
144 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
146 static char *ada_op_name (enum exp_opcode
);
148 static const char *ada_decoded_op_name (enum exp_opcode
);
150 static int numeric_type_p (struct type
*);
152 static int integer_type_p (struct type
*);
154 static int scalar_type_p (struct type
*);
156 static int discrete_type_p (struct type
*);
158 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
161 static struct value
*evaluate_subexp (struct type
*, struct expression
*,
164 static struct value
*evaluate_subexp_type (struct expression
*, int *);
166 static int is_dynamic_field (struct type
*, int);
168 static struct type
*to_fixed_variant_branch_type (struct type
*,
170 CORE_ADDR
, struct value
*);
172 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
174 static struct type
*to_fixed_range_type (char *, struct value
*,
177 static struct type
*to_static_fixed_type (struct type
*);
179 static struct value
*unwrap_value (struct value
*);
181 static struct type
*packed_array_type (struct type
*, long *);
183 static struct type
*decode_packed_array_type (struct type
*);
185 static struct value
*decode_packed_array (struct value
*);
187 static struct value
*value_subscript_packed (struct value
*, int,
190 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int);
192 static struct value
*coerce_unspec_val_to_type (struct value
*,
195 static struct value
*get_var_value (char *, char *);
197 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
199 static int equiv_types (struct type
*, struct type
*);
201 static int is_name_suffix (const char *);
203 static int wild_match (const char *, int, const char *);
205 static struct value
*ada_coerce_ref (struct value
*);
207 static LONGEST
pos_atr (struct value
*);
209 static struct value
*value_pos_atr (struct value
*);
211 static struct value
*value_val_atr (struct type
*, struct value
*);
213 static struct symbol
*standard_lookup (const char *, const struct block
*,
216 static struct value
*ada_search_struct_field (char *, struct value
*, int,
219 static struct value
*ada_value_primitive_field (struct value
*, int, int,
222 static int find_struct_field (char *, struct type
*, int,
223 struct type
**, int *, int *, int *, int *);
225 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
228 static struct value
*ada_to_fixed_value (struct value
*);
230 static int ada_resolve_function (struct ada_symbol_info
*, int,
231 struct value
**, int, const char *,
234 static struct value
*ada_coerce_to_simple_array (struct value
*);
236 static int ada_is_direct_array_type (struct type
*);
238 static void ada_language_arch_info (struct gdbarch
*,
239 struct language_arch_info
*);
241 static void check_size (const struct type
*);
243 static struct value
*ada_index_struct_field (int, struct value
*, int,
246 static struct value
*assign_aggregate (struct value
*, struct value
*,
247 struct expression
*, int *, enum noside
);
249 static void aggregate_assign_from_choices (struct value
*, struct value
*,
251 int *, LONGEST
*, int *,
252 int, LONGEST
, LONGEST
);
254 static void aggregate_assign_positional (struct value
*, struct value
*,
256 int *, LONGEST
*, int *, int,
260 static void aggregate_assign_others (struct value
*, struct value
*,
262 int *, LONGEST
*, int, LONGEST
, LONGEST
);
265 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
268 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
271 static void ada_forward_operator_length (struct expression
*, int, int *,
276 /* Maximum-sized dynamic type. */
277 static unsigned int varsize_limit
;
279 /* FIXME: brobecker/2003-09-17: No longer a const because it is
280 returned by a function that does not return a const char *. */
281 static char *ada_completer_word_break_characters
=
283 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
285 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
288 /* The name of the symbol to use to get the name of the main subprogram. */
289 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
290 = "__gnat_ada_main_program_name";
292 /* The name of the runtime function called when an exception is raised. */
293 static const char raise_sym_name
[] = "__gnat_raise_nodefer_with_msg";
295 /* The name of the runtime function called when an unhandled exception
297 static const char raise_unhandled_sym_name
[] = "__gnat_unhandled_exception";
299 /* The name of the runtime function called when an assert failure is
301 static const char raise_assert_sym_name
[] =
302 "system__assertions__raise_assert_failure";
304 /* A string that reflects the longest exception expression rewrite,
305 aside from the exception name. */
306 static const char longest_exception_template
[] =
307 "'__gnat_raise_nodefer_with_msg' if long_integer(e) = long_integer(&)";
309 /* Limit on the number of warnings to raise per expression evaluation. */
310 static int warning_limit
= 2;
312 /* Number of warning messages issued; reset to 0 by cleanups after
313 expression evaluation. */
314 static int warnings_issued
= 0;
316 static const char *known_runtime_file_name_patterns
[] = {
317 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
320 static const char *known_auxiliary_function_name_patterns
[] = {
321 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
324 /* Space for allocating results of ada_lookup_symbol_list. */
325 static struct obstack symbol_list_obstack
;
331 ada_get_gdb_completer_word_break_characters (void)
333 return ada_completer_word_break_characters
;
336 /* Print an array element index using the Ada syntax. */
339 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
340 int format
, enum val_prettyprint pretty
)
342 LA_VALUE_PRINT (index_value
, stream
, format
, pretty
);
343 fprintf_filtered (stream
, " => ");
346 /* Read the string located at ADDR from the inferior and store the
350 extract_string (CORE_ADDR addr
, char *buf
)
354 /* Loop, reading one byte at a time, until we reach the '\000'
355 end-of-string marker. */
358 target_read_memory (addr
+ char_index
* sizeof (char),
359 buf
+ char_index
* sizeof (char), sizeof (char));
362 while (buf
[char_index
- 1] != '\000');
365 /* Assuming VECT points to an array of *SIZE objects of size
366 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
367 updating *SIZE as necessary and returning the (new) array. */
370 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
372 if (*size
< min_size
)
375 if (*size
< min_size
)
377 vect
= xrealloc (vect
, *size
* element_size
);
382 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
383 suffix of FIELD_NAME beginning "___". */
386 field_name_match (const char *field_name
, const char *target
)
388 int len
= strlen (target
);
390 (strncmp (field_name
, target
, len
) == 0
391 && (field_name
[len
] == '\0'
392 || (strncmp (field_name
+ len
, "___", 3) == 0
393 && strcmp (field_name
+ strlen (field_name
) - 6,
398 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
399 FIELD_NAME, and return its index. This function also handles fields
400 whose name have ___ suffixes because the compiler sometimes alters
401 their name by adding such a suffix to represent fields with certain
402 constraints. If the field could not be found, return a negative
403 number if MAYBE_MISSING is set. Otherwise raise an error. */
406 ada_get_field_index (const struct type
*type
, const char *field_name
,
410 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (type
); fieldno
++)
411 if (field_name_match (TYPE_FIELD_NAME (type
, fieldno
), field_name
))
415 error (_("Unable to find field %s in struct %s. Aborting"),
416 field_name
, TYPE_NAME (type
));
421 /* The length of the prefix of NAME prior to any "___" suffix. */
424 ada_name_prefix_len (const char *name
)
430 const char *p
= strstr (name
, "___");
432 return strlen (name
);
438 /* Return non-zero if SUFFIX is a suffix of STR.
439 Return zero if STR is null. */
442 is_suffix (const char *str
, const char *suffix
)
448 len2
= strlen (suffix
);
449 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
452 /* Create a value of type TYPE whose contents come from VALADDR, if it
453 is non-null, and whose memory address (in the inferior) is
457 value_from_contents_and_address (struct type
*type
,
458 const gdb_byte
*valaddr
,
461 struct value
*v
= allocate_value (type
);
463 set_value_lazy (v
, 1);
465 memcpy (value_contents_raw (v
), valaddr
, TYPE_LENGTH (type
));
466 VALUE_ADDRESS (v
) = address
;
468 VALUE_LVAL (v
) = lval_memory
;
472 /* The contents of value VAL, treated as a value of type TYPE. The
473 result is an lval in memory if VAL is. */
475 static struct value
*
476 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
478 type
= ada_check_typedef (type
);
479 if (value_type (val
) == type
)
483 struct value
*result
;
485 /* Make sure that the object size is not unreasonable before
486 trying to allocate some memory for it. */
489 result
= allocate_value (type
);
490 VALUE_LVAL (result
) = VALUE_LVAL (val
);
491 set_value_bitsize (result
, value_bitsize (val
));
492 set_value_bitpos (result
, value_bitpos (val
));
493 VALUE_ADDRESS (result
) = VALUE_ADDRESS (val
) + value_offset (val
);
495 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
496 set_value_lazy (result
, 1);
498 memcpy (value_contents_raw (result
), value_contents (val
),
504 static const gdb_byte
*
505 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
510 return valaddr
+ offset
;
514 cond_offset_target (CORE_ADDR address
, long offset
)
519 return address
+ offset
;
522 /* Issue a warning (as for the definition of warning in utils.c, but
523 with exactly one argument rather than ...), unless the limit on the
524 number of warnings has passed during the evaluation of the current
527 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
528 provided by "complaint". */
529 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
532 lim_warning (const char *format
, ...)
535 va_start (args
, format
);
537 warnings_issued
+= 1;
538 if (warnings_issued
<= warning_limit
)
539 vwarning (format
, args
);
544 /* Issue an error if the size of an object of type T is unreasonable,
545 i.e. if it would be a bad idea to allocate a value of this type in
549 check_size (const struct type
*type
)
551 if (TYPE_LENGTH (type
) > varsize_limit
)
552 error (_("object size is larger than varsize-limit"));
556 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
557 gdbtypes.h, but some of the necessary definitions in that file
558 seem to have gone missing. */
560 /* Maximum value of a SIZE-byte signed integer type. */
562 max_of_size (int size
)
564 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
565 return top_bit
| (top_bit
- 1);
568 /* Minimum value of a SIZE-byte signed integer type. */
570 min_of_size (int size
)
572 return -max_of_size (size
) - 1;
575 /* Maximum value of a SIZE-byte unsigned integer type. */
577 umax_of_size (int size
)
579 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
580 return top_bit
| (top_bit
- 1);
583 /* Maximum value of integral type T, as a signed quantity. */
585 max_of_type (struct type
*t
)
587 if (TYPE_UNSIGNED (t
))
588 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
590 return max_of_size (TYPE_LENGTH (t
));
593 /* Minimum value of integral type T, as a signed quantity. */
595 min_of_type (struct type
*t
)
597 if (TYPE_UNSIGNED (t
))
600 return min_of_size (TYPE_LENGTH (t
));
603 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
604 static struct value
*
605 discrete_type_high_bound (struct type
*type
)
607 switch (TYPE_CODE (type
))
609 case TYPE_CODE_RANGE
:
610 return value_from_longest (TYPE_TARGET_TYPE (type
),
611 TYPE_HIGH_BOUND (type
));
614 value_from_longest (type
,
615 TYPE_FIELD_BITPOS (type
,
616 TYPE_NFIELDS (type
) - 1));
618 return value_from_longest (type
, max_of_type (type
));
620 error (_("Unexpected type in discrete_type_high_bound."));
624 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
625 static struct value
*
626 discrete_type_low_bound (struct type
*type
)
628 switch (TYPE_CODE (type
))
630 case TYPE_CODE_RANGE
:
631 return value_from_longest (TYPE_TARGET_TYPE (type
),
632 TYPE_LOW_BOUND (type
));
634 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, 0));
636 return value_from_longest (type
, min_of_type (type
));
638 error (_("Unexpected type in discrete_type_low_bound."));
642 /* The identity on non-range types. For range types, the underlying
643 non-range scalar type. */
646 base_type (struct type
*type
)
648 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
650 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
652 type
= TYPE_TARGET_TYPE (type
);
658 /* Language Selection */
660 /* If the main program is in Ada, return language_ada, otherwise return LANG
661 (the main program is in Ada iif the adainit symbol is found).
663 MAIN_PST is not used. */
666 ada_update_initial_language (enum language lang
,
667 struct partial_symtab
*main_pst
)
669 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
670 (struct objfile
*) NULL
) != NULL
)
676 /* If the main procedure is written in Ada, then return its name.
677 The result is good until the next call. Return NULL if the main
678 procedure doesn't appear to be in Ada. */
683 struct minimal_symbol
*msym
;
684 CORE_ADDR main_program_name_addr
;
685 static char main_program_name
[1024];
687 /* For Ada, the name of the main procedure is stored in a specific
688 string constant, generated by the binder. Look for that symbol,
689 extract its address, and then read that string. If we didn't find
690 that string, then most probably the main procedure is not written
692 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
696 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
697 if (main_program_name_addr
== 0)
698 error (_("Invalid address for Ada main program name."));
700 extract_string (main_program_name_addr
, main_program_name
);
701 return main_program_name
;
704 /* The main procedure doesn't seem to be in Ada. */
710 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
713 const struct ada_opname_map ada_opname_table
[] = {
714 {"Oadd", "\"+\"", BINOP_ADD
},
715 {"Osubtract", "\"-\"", BINOP_SUB
},
716 {"Omultiply", "\"*\"", BINOP_MUL
},
717 {"Odivide", "\"/\"", BINOP_DIV
},
718 {"Omod", "\"mod\"", BINOP_MOD
},
719 {"Orem", "\"rem\"", BINOP_REM
},
720 {"Oexpon", "\"**\"", BINOP_EXP
},
721 {"Olt", "\"<\"", BINOP_LESS
},
722 {"Ole", "\"<=\"", BINOP_LEQ
},
723 {"Ogt", "\">\"", BINOP_GTR
},
724 {"Oge", "\">=\"", BINOP_GEQ
},
725 {"Oeq", "\"=\"", BINOP_EQUAL
},
726 {"One", "\"/=\"", BINOP_NOTEQUAL
},
727 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
728 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
729 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
730 {"Oconcat", "\"&\"", BINOP_CONCAT
},
731 {"Oabs", "\"abs\"", UNOP_ABS
},
732 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
733 {"Oadd", "\"+\"", UNOP_PLUS
},
734 {"Osubtract", "\"-\"", UNOP_NEG
},
738 /* Return non-zero if STR should be suppressed in info listings. */
741 is_suppressed_name (const char *str
)
743 if (strncmp (str
, "_ada_", 5) == 0)
745 if (str
[0] == '_' || str
[0] == '\000')
750 const char *suffix
= strstr (str
, "___");
751 if (suffix
!= NULL
&& suffix
[3] != 'X')
754 suffix
= str
+ strlen (str
);
755 for (p
= suffix
- 1; p
!= str
; p
-= 1)
759 if (p
[0] == 'X' && p
[-1] != '_')
763 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
764 if (strncmp (ada_opname_table
[i
].encoded
, p
,
765 strlen (ada_opname_table
[i
].encoded
)) == 0)
774 /* The "encoded" form of DECODED, according to GNAT conventions.
775 The result is valid until the next call to ada_encode. */
778 ada_encode (const char *decoded
)
780 static char *encoding_buffer
= NULL
;
781 static size_t encoding_buffer_size
= 0;
788 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
789 2 * strlen (decoded
) + 10);
792 for (p
= decoded
; *p
!= '\0'; p
+= 1)
794 if (!ADA_RETAIN_DOTS
&& *p
== '.')
796 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
801 const struct ada_opname_map
*mapping
;
803 for (mapping
= ada_opname_table
;
804 mapping
->encoded
!= NULL
805 && strncmp (mapping
->decoded
, p
,
806 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
808 if (mapping
->encoded
== NULL
)
809 error (_("invalid Ada operator name: %s"), p
);
810 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
811 k
+= strlen (mapping
->encoded
);
816 encoding_buffer
[k
] = *p
;
821 encoding_buffer
[k
] = '\0';
822 return encoding_buffer
;
825 /* Return NAME folded to lower case, or, if surrounded by single
826 quotes, unfolded, but with the quotes stripped away. Result good
830 ada_fold_name (const char *name
)
832 static char *fold_buffer
= NULL
;
833 static size_t fold_buffer_size
= 0;
835 int len
= strlen (name
);
836 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
840 strncpy (fold_buffer
, name
+ 1, len
- 2);
841 fold_buffer
[len
- 2] = '\000';
846 for (i
= 0; i
<= len
; i
+= 1)
847 fold_buffer
[i
] = tolower (name
[i
]);
853 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
856 is_lower_alphanum (const char c
)
858 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
862 . Discard trailing .{DIGIT}+, ${DIGIT}+ or ___{DIGIT}+
863 These are suffixes introduced by GNAT5 to nested subprogram
864 names, and do not serve any purpose for the debugger.
865 . Discard final __{DIGIT}+ or $({DIGIT}+(__{DIGIT}+)*)
866 . Discard final N if it follows a lowercase alphanumeric character
867 (protected object subprogram suffix)
868 . Convert other instances of embedded "__" to `.'.
869 . Discard leading _ada_.
870 . Convert operator names to the appropriate quoted symbols.
871 . Remove everything after first ___ if it is followed by
873 . Replace TK__ with __, and a trailing B or TKB with nothing.
874 . Replace _[EB]{DIGIT}+[sb] with nothing (protected object entries)
875 . Put symbols that should be suppressed in <...> brackets.
876 . Remove trailing X[bn]* suffix (indicating names in package bodies).
878 The resulting string is valid until the next call of ada_decode.
879 If the string is unchanged by demangling, the original string pointer
883 ada_decode (const char *encoded
)
890 static char *decoding_buffer
= NULL
;
891 static size_t decoding_buffer_size
= 0;
893 if (strncmp (encoded
, "_ada_", 5) == 0)
896 if (encoded
[0] == '_' || encoded
[0] == '<')
899 /* Remove trailing .{DIGIT}+ or ___{DIGIT}+ or __{DIGIT}+. */
900 len0
= strlen (encoded
);
901 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
904 while (i
> 0 && isdigit (encoded
[i
]))
906 if (i
>= 0 && encoded
[i
] == '.')
908 else if (i
>= 0 && encoded
[i
] == '$')
910 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
912 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
916 /* Remove trailing N. */
918 /* Protected entry subprograms are broken into two
919 separate subprograms: The first one is unprotected, and has
920 a 'N' suffix; the second is the protected version, and has
921 the 'P' suffix. The second calls the first one after handling
922 the protection. Since the P subprograms are internally generated,
923 we leave these names undecoded, giving the user a clue that this
924 entity is internal. */
927 && encoded
[len0
- 1] == 'N'
928 && (isdigit (encoded
[len0
- 2]) || islower (encoded
[len0
- 2])))
931 /* Remove the ___X.* suffix if present. Do not forget to verify that
932 the suffix is located before the current "end" of ENCODED. We want
933 to avoid re-matching parts of ENCODED that have previously been
934 marked as discarded (by decrementing LEN0). */
935 p
= strstr (encoded
, "___");
936 if (p
!= NULL
&& p
- encoded
< len0
- 3)
944 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
947 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
950 /* Make decoded big enough for possible expansion by operator name. */
951 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
952 decoded
= decoding_buffer
;
954 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
957 while ((i
>= 0 && isdigit (encoded
[i
]))
958 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
960 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
962 else if (encoded
[i
] == '$')
966 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
967 decoded
[j
] = encoded
[i
];
972 if (at_start_name
&& encoded
[i
] == 'O')
975 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
977 int op_len
= strlen (ada_opname_table
[k
].encoded
);
978 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
980 && !isalnum (encoded
[i
+ op_len
]))
982 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
985 j
+= strlen (ada_opname_table
[k
].decoded
);
989 if (ada_opname_table
[k
].encoded
!= NULL
)
994 /* Replace "TK__" with "__", which will eventually be translated
995 into "." (just below). */
997 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1000 /* Remove _E{DIGITS}+[sb] */
1002 /* Just as for protected object subprograms, there are 2 categories
1003 of subprograms created by the compiler for each entry. The first
1004 one implements the actual entry code, and has a suffix following
1005 the convention above; the second one implements the barrier and
1006 uses the same convention as above, except that the 'E' is replaced
1009 Just as above, we do not decode the name of barrier functions
1010 to give the user a clue that the code he is debugging has been
1011 internally generated. */
1013 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1014 && isdigit (encoded
[i
+2]))
1018 while (k
< len0
&& isdigit (encoded
[k
]))
1022 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1025 /* Just as an extra precaution, make sure that if this
1026 suffix is followed by anything else, it is a '_'.
1027 Otherwise, we matched this sequence by accident. */
1029 || (k
< len0
&& encoded
[k
] == '_'))
1034 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1035 the GNAT front-end in protected object subprograms. */
1038 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1040 /* Backtrack a bit up until we reach either the begining of
1041 the encoded name, or "__". Make sure that we only find
1042 digits or lowercase characters. */
1043 const char *ptr
= encoded
+ i
- 1;
1045 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1048 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1052 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1056 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1060 else if (!ADA_RETAIN_DOTS
1061 && i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1070 decoded
[j
] = encoded
[i
];
1075 decoded
[j
] = '\000';
1077 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1078 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1081 if (strcmp (decoded
, encoded
) == 0)
1087 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1088 decoded
= decoding_buffer
;
1089 if (encoded
[0] == '<')
1090 strcpy (decoded
, encoded
);
1092 sprintf (decoded
, "<%s>", encoded
);
1097 /* Table for keeping permanent unique copies of decoded names. Once
1098 allocated, names in this table are never released. While this is a
1099 storage leak, it should not be significant unless there are massive
1100 changes in the set of decoded names in successive versions of a
1101 symbol table loaded during a single session. */
1102 static struct htab
*decoded_names_store
;
1104 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1105 in the language-specific part of GSYMBOL, if it has not been
1106 previously computed. Tries to save the decoded name in the same
1107 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1108 in any case, the decoded symbol has a lifetime at least that of
1110 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1111 const, but nevertheless modified to a semantically equivalent form
1112 when a decoded name is cached in it.
1116 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1119 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1120 if (*resultp
== NULL
)
1122 const char *decoded
= ada_decode (gsymbol
->name
);
1123 if (gsymbol
->bfd_section
!= NULL
)
1125 bfd
*obfd
= gsymbol
->bfd_section
->owner
;
1128 struct objfile
*objf
;
1131 if (obfd
== objf
->obfd
)
1133 *resultp
= obsavestring (decoded
, strlen (decoded
),
1134 &objf
->objfile_obstack
);
1140 /* Sometimes, we can't find a corresponding objfile, in which
1141 case, we put the result on the heap. Since we only decode
1142 when needed, we hope this usually does not cause a
1143 significant memory leak (FIXME). */
1144 if (*resultp
== NULL
)
1146 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1149 *slot
= xstrdup (decoded
);
1158 ada_la_decode (const char *encoded
, int options
)
1160 return xstrdup (ada_decode (encoded
));
1163 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1164 suffixes that encode debugging information or leading _ada_ on
1165 SYM_NAME (see is_name_suffix commentary for the debugging
1166 information that is ignored). If WILD, then NAME need only match a
1167 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1168 either argument is NULL. */
1171 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1173 if (sym_name
== NULL
|| name
== NULL
)
1176 return wild_match (name
, strlen (name
), sym_name
);
1179 int len_name
= strlen (name
);
1180 return (strncmp (sym_name
, name
, len_name
) == 0
1181 && is_name_suffix (sym_name
+ len_name
))
1182 || (strncmp (sym_name
, "_ada_", 5) == 0
1183 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1184 && is_name_suffix (sym_name
+ len_name
+ 5));
1188 /* True (non-zero) iff, in Ada mode, the symbol SYM should be
1189 suppressed in info listings. */
1192 ada_suppress_symbol_printing (struct symbol
*sym
)
1194 if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
)
1197 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym
));
1203 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1205 static char *bound_name
[] = {
1206 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1207 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1210 /* Maximum number of array dimensions we are prepared to handle. */
1212 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1214 /* Like modify_field, but allows bitpos > wordlength. */
1217 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1219 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1223 /* The desc_* routines return primitive portions of array descriptors
1226 /* The descriptor or array type, if any, indicated by TYPE; removes
1227 level of indirection, if needed. */
1229 static struct type
*
1230 desc_base_type (struct type
*type
)
1234 type
= ada_check_typedef (type
);
1236 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1237 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1238 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1243 /* True iff TYPE indicates a "thin" array pointer type. */
1246 is_thin_pntr (struct type
*type
)
1249 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1250 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1253 /* The descriptor type for thin pointer type TYPE. */
1255 static struct type
*
1256 thin_descriptor_type (struct type
*type
)
1258 struct type
*base_type
= desc_base_type (type
);
1259 if (base_type
== NULL
)
1261 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1265 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1266 if (alt_type
== NULL
)
1273 /* A pointer to the array data for thin-pointer value VAL. */
1275 static struct value
*
1276 thin_data_pntr (struct value
*val
)
1278 struct type
*type
= value_type (val
);
1279 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1280 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1283 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1284 VALUE_ADDRESS (val
) + value_offset (val
));
1287 /* True iff TYPE indicates a "thick" array pointer type. */
1290 is_thick_pntr (struct type
*type
)
1292 type
= desc_base_type (type
);
1293 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1294 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1297 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1298 pointer to one, the type of its bounds data; otherwise, NULL. */
1300 static struct type
*
1301 desc_bounds_type (struct type
*type
)
1305 type
= desc_base_type (type
);
1309 else if (is_thin_pntr (type
))
1311 type
= thin_descriptor_type (type
);
1314 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1316 return ada_check_typedef (r
);
1318 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1320 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1322 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1327 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1328 one, a pointer to its bounds data. Otherwise NULL. */
1330 static struct value
*
1331 desc_bounds (struct value
*arr
)
1333 struct type
*type
= ada_check_typedef (value_type (arr
));
1334 if (is_thin_pntr (type
))
1336 struct type
*bounds_type
=
1337 desc_bounds_type (thin_descriptor_type (type
));
1340 if (desc_bounds_type
== NULL
)
1341 error (_("Bad GNAT array descriptor"));
1343 /* NOTE: The following calculation is not really kosher, but
1344 since desc_type is an XVE-encoded type (and shouldn't be),
1345 the correct calculation is a real pain. FIXME (and fix GCC). */
1346 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1347 addr
= value_as_long (arr
);
1349 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1352 value_from_longest (lookup_pointer_type (bounds_type
),
1353 addr
- TYPE_LENGTH (bounds_type
));
1356 else if (is_thick_pntr (type
))
1357 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1358 _("Bad GNAT array descriptor"));
1363 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1364 position of the field containing the address of the bounds data. */
1367 fat_pntr_bounds_bitpos (struct type
*type
)
1369 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1372 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1373 size of the field containing the address of the bounds data. */
1376 fat_pntr_bounds_bitsize (struct type
*type
)
1378 type
= desc_base_type (type
);
1380 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1381 return TYPE_FIELD_BITSIZE (type
, 1);
1383 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1386 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1387 pointer to one, the type of its array data (a
1388 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1389 ada_type_of_array to get an array type with bounds data. */
1391 static struct type
*
1392 desc_data_type (struct type
*type
)
1394 type
= desc_base_type (type
);
1396 /* NOTE: The following is bogus; see comment in desc_bounds. */
1397 if (is_thin_pntr (type
))
1398 return lookup_pointer_type
1399 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1400 else if (is_thick_pntr (type
))
1401 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1406 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1409 static struct value
*
1410 desc_data (struct value
*arr
)
1412 struct type
*type
= value_type (arr
);
1413 if (is_thin_pntr (type
))
1414 return thin_data_pntr (arr
);
1415 else if (is_thick_pntr (type
))
1416 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1417 _("Bad GNAT array descriptor"));
1423 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1424 position of the field containing the address of the data. */
1427 fat_pntr_data_bitpos (struct type
*type
)
1429 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1432 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1433 size of the field containing the address of the data. */
1436 fat_pntr_data_bitsize (struct type
*type
)
1438 type
= desc_base_type (type
);
1440 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1441 return TYPE_FIELD_BITSIZE (type
, 0);
1443 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1446 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1447 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1448 bound, if WHICH is 1. The first bound is I=1. */
1450 static struct value
*
1451 desc_one_bound (struct value
*bounds
, int i
, int which
)
1453 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1454 _("Bad GNAT array descriptor bounds"));
1457 /* If BOUNDS is an array-bounds structure type, return the bit position
1458 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1459 bound, if WHICH is 1. The first bound is I=1. */
1462 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1464 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1467 /* If BOUNDS is an array-bounds structure type, return the bit field size
1468 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1469 bound, if WHICH is 1. The first bound is I=1. */
1472 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1474 type
= desc_base_type (type
);
1476 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1477 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1479 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1482 /* If TYPE is the type of an array-bounds structure, the type of its
1483 Ith bound (numbering from 1). Otherwise, NULL. */
1485 static struct type
*
1486 desc_index_type (struct type
*type
, int i
)
1488 type
= desc_base_type (type
);
1490 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1491 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1496 /* The number of index positions in the array-bounds type TYPE.
1497 Return 0 if TYPE is NULL. */
1500 desc_arity (struct type
*type
)
1502 type
= desc_base_type (type
);
1505 return TYPE_NFIELDS (type
) / 2;
1509 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1510 an array descriptor type (representing an unconstrained array
1514 ada_is_direct_array_type (struct type
*type
)
1518 type
= ada_check_typedef (type
);
1519 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1520 || ada_is_array_descriptor_type (type
));
1523 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1527 ada_is_array_type (struct type
*type
)
1530 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1531 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1532 type
= TYPE_TARGET_TYPE (type
);
1533 return ada_is_direct_array_type (type
);
1536 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1539 ada_is_simple_array_type (struct type
*type
)
1543 type
= ada_check_typedef (type
);
1544 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1545 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1546 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1549 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1552 ada_is_array_descriptor_type (struct type
*type
)
1554 struct type
*data_type
= desc_data_type (type
);
1558 type
= ada_check_typedef (type
);
1561 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1562 && TYPE_TARGET_TYPE (data_type
) != NULL
1563 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1564 || TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1565 && desc_arity (desc_bounds_type (type
)) > 0;
1568 /* Non-zero iff type is a partially mal-formed GNAT array
1569 descriptor. FIXME: This is to compensate for some problems with
1570 debugging output from GNAT. Re-examine periodically to see if it
1574 ada_is_bogus_array_descriptor (struct type
*type
)
1578 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1579 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1580 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1581 && !ada_is_array_descriptor_type (type
);
1585 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1586 (fat pointer) returns the type of the array data described---specifically,
1587 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1588 in from the descriptor; otherwise, they are left unspecified. If
1589 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1590 returns NULL. The result is simply the type of ARR if ARR is not
1593 ada_type_of_array (struct value
*arr
, int bounds
)
1595 if (ada_is_packed_array_type (value_type (arr
)))
1596 return decode_packed_array_type (value_type (arr
));
1598 if (!ada_is_array_descriptor_type (value_type (arr
)))
1599 return value_type (arr
);
1603 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr
))));
1606 struct type
*elt_type
;
1608 struct value
*descriptor
;
1609 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1611 elt_type
= ada_array_element_type (value_type (arr
), -1);
1612 arity
= ada_array_arity (value_type (arr
));
1614 if (elt_type
== NULL
|| arity
== 0)
1615 return ada_check_typedef (value_type (arr
));
1617 descriptor
= desc_bounds (arr
);
1618 if (value_as_long (descriptor
) == 0)
1622 struct type
*range_type
= alloc_type (objf
);
1623 struct type
*array_type
= alloc_type (objf
);
1624 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1625 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1628 create_range_type (range_type
, value_type (low
),
1629 longest_to_int (value_as_long (low
)),
1630 longest_to_int (value_as_long (high
)));
1631 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1634 return lookup_pointer_type (elt_type
);
1638 /* If ARR does not represent an array, returns ARR unchanged.
1639 Otherwise, returns either a standard GDB array with bounds set
1640 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1641 GDB array. Returns NULL if ARR is a null fat pointer. */
1644 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1646 if (ada_is_array_descriptor_type (value_type (arr
)))
1648 struct type
*arrType
= ada_type_of_array (arr
, 1);
1649 if (arrType
== NULL
)
1651 return value_cast (arrType
, value_copy (desc_data (arr
)));
1653 else if (ada_is_packed_array_type (value_type (arr
)))
1654 return decode_packed_array (arr
);
1659 /* If ARR does not represent an array, returns ARR unchanged.
1660 Otherwise, returns a standard GDB array describing ARR (which may
1661 be ARR itself if it already is in the proper form). */
1663 static struct value
*
1664 ada_coerce_to_simple_array (struct value
*arr
)
1666 if (ada_is_array_descriptor_type (value_type (arr
)))
1668 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1670 error (_("Bounds unavailable for null array pointer."));
1671 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1672 return value_ind (arrVal
);
1674 else if (ada_is_packed_array_type (value_type (arr
)))
1675 return decode_packed_array (arr
);
1680 /* If TYPE represents a GNAT array type, return it translated to an
1681 ordinary GDB array type (possibly with BITSIZE fields indicating
1682 packing). For other types, is the identity. */
1685 ada_coerce_to_simple_array_type (struct type
*type
)
1687 struct value
*mark
= value_mark ();
1688 struct value
*dummy
= value_from_longest (builtin_type_long
, 0);
1689 struct type
*result
;
1690 deprecated_set_value_type (dummy
, type
);
1691 result
= ada_type_of_array (dummy
, 0);
1692 value_free_to_mark (mark
);
1696 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1699 ada_is_packed_array_type (struct type
*type
)
1703 type
= desc_base_type (type
);
1704 type
= ada_check_typedef (type
);
1706 ada_type_name (type
) != NULL
1707 && strstr (ada_type_name (type
), "___XP") != NULL
;
1710 /* Given that TYPE is a standard GDB array type with all bounds filled
1711 in, and that the element size of its ultimate scalar constituents
1712 (that is, either its elements, or, if it is an array of arrays, its
1713 elements' elements, etc.) is *ELT_BITS, return an identical type,
1714 but with the bit sizes of its elements (and those of any
1715 constituent arrays) recorded in the BITSIZE components of its
1716 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1719 static struct type
*
1720 packed_array_type (struct type
*type
, long *elt_bits
)
1722 struct type
*new_elt_type
;
1723 struct type
*new_type
;
1724 LONGEST low_bound
, high_bound
;
1726 type
= ada_check_typedef (type
);
1727 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1730 new_type
= alloc_type (TYPE_OBJFILE (type
));
1731 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1733 create_array_type (new_type
, new_elt_type
, TYPE_FIELD_TYPE (type
, 0));
1734 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1735 TYPE_NAME (new_type
) = ada_type_name (type
);
1737 if (get_discrete_bounds (TYPE_FIELD_TYPE (type
, 0),
1738 &low_bound
, &high_bound
) < 0)
1739 low_bound
= high_bound
= 0;
1740 if (high_bound
< low_bound
)
1741 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1744 *elt_bits
*= (high_bound
- low_bound
+ 1);
1745 TYPE_LENGTH (new_type
) =
1746 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1749 TYPE_FLAGS (new_type
) |= TYPE_FLAG_FIXED_INSTANCE
;
1753 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1755 static struct type
*
1756 decode_packed_array_type (struct type
*type
)
1759 struct block
**blocks
;
1760 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
1761 char *name
= (char *) alloca (strlen (raw_name
) + 1);
1762 char *tail
= strstr (raw_name
, "___XP");
1763 struct type
*shadow_type
;
1767 type
= desc_base_type (type
);
1769 memcpy (name
, raw_name
, tail
- raw_name
);
1770 name
[tail
- raw_name
] = '\000';
1772 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1773 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1775 lim_warning (_("could not find bounds information on packed array"));
1778 shadow_type
= SYMBOL_TYPE (sym
);
1780 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1782 lim_warning (_("could not understand bounds information on packed array"));
1786 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1789 (_("could not understand bit size information on packed array"));
1793 return packed_array_type (shadow_type
, &bits
);
1796 /* Given that ARR is a struct value *indicating a GNAT packed array,
1797 returns a simple array that denotes that array. Its type is a
1798 standard GDB array type except that the BITSIZEs of the array
1799 target types are set to the number of bits in each element, and the
1800 type length is set appropriately. */
1802 static struct value
*
1803 decode_packed_array (struct value
*arr
)
1807 arr
= ada_coerce_ref (arr
);
1808 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1809 arr
= ada_value_ind (arr
);
1811 type
= decode_packed_array_type (value_type (arr
));
1814 error (_("can't unpack array"));
1818 if (BITS_BIG_ENDIAN
&& ada_is_modular_type (value_type (arr
)))
1820 /* This is a (right-justified) modular type representing a packed
1821 array with no wrapper. In order to interpret the value through
1822 the (left-justified) packed array type we just built, we must
1823 first left-justify it. */
1824 int bit_size
, bit_pos
;
1827 mod
= ada_modulus (value_type (arr
)) - 1;
1834 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1835 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1836 bit_pos
/ HOST_CHAR_BIT
,
1837 bit_pos
% HOST_CHAR_BIT
,
1842 return coerce_unspec_val_to_type (arr
, type
);
1846 /* The value of the element of packed array ARR at the ARITY indices
1847 given in IND. ARR must be a simple array. */
1849 static struct value
*
1850 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1853 int bits
, elt_off
, bit_off
;
1854 long elt_total_bit_offset
;
1855 struct type
*elt_type
;
1859 elt_total_bit_offset
= 0;
1860 elt_type
= ada_check_typedef (value_type (arr
));
1861 for (i
= 0; i
< arity
; i
+= 1)
1863 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1864 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1866 (_("attempt to do packed indexing of something other than a packed array"));
1869 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1870 LONGEST lowerbound
, upperbound
;
1873 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1875 lim_warning (_("don't know bounds of array"));
1876 lowerbound
= upperbound
= 0;
1879 idx
= value_as_long (value_pos_atr (ind
[i
]));
1880 if (idx
< lowerbound
|| idx
> upperbound
)
1881 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1882 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1883 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1884 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1887 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1888 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1890 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1895 /* Non-zero iff TYPE includes negative integer values. */
1898 has_negatives (struct type
*type
)
1900 switch (TYPE_CODE (type
))
1905 return !TYPE_UNSIGNED (type
);
1906 case TYPE_CODE_RANGE
:
1907 return TYPE_LOW_BOUND (type
) < 0;
1912 /* Create a new value of type TYPE from the contents of OBJ starting
1913 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1914 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1915 assigning through the result will set the field fetched from.
1916 VALADDR is ignored unless OBJ is NULL, in which case,
1917 VALADDR+OFFSET must address the start of storage containing the
1918 packed value. The value returned in this case is never an lval.
1919 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1922 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1923 long offset
, int bit_offset
, int bit_size
,
1927 int src
, /* Index into the source area */
1928 targ
, /* Index into the target area */
1929 srcBitsLeft
, /* Number of source bits left to move */
1930 nsrc
, ntarg
, /* Number of source and target bytes */
1931 unusedLS
, /* Number of bits in next significant
1932 byte of source that are unused */
1933 accumSize
; /* Number of meaningful bits in accum */
1934 unsigned char *bytes
; /* First byte containing data to unpack */
1935 unsigned char *unpacked
;
1936 unsigned long accum
; /* Staging area for bits being transferred */
1938 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1939 /* Transmit bytes from least to most significant; delta is the direction
1940 the indices move. */
1941 int delta
= BITS_BIG_ENDIAN
? -1 : 1;
1943 type
= ada_check_typedef (type
);
1947 v
= allocate_value (type
);
1948 bytes
= (unsigned char *) (valaddr
+ offset
);
1950 else if (value_lazy (obj
))
1953 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
1954 bytes
= (unsigned char *) alloca (len
);
1955 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
1959 v
= allocate_value (type
);
1960 bytes
= (unsigned char *) value_contents (obj
) + offset
;
1965 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
1966 if (VALUE_LVAL (obj
) == lval_internalvar
)
1967 VALUE_LVAL (v
) = lval_internalvar_component
;
1968 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
;
1969 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
1970 set_value_bitsize (v
, bit_size
);
1971 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
1973 VALUE_ADDRESS (v
) += 1;
1974 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
1978 set_value_bitsize (v
, bit_size
);
1979 unpacked
= (unsigned char *) value_contents (v
);
1981 srcBitsLeft
= bit_size
;
1983 ntarg
= TYPE_LENGTH (type
);
1987 memset (unpacked
, 0, TYPE_LENGTH (type
));
1990 else if (BITS_BIG_ENDIAN
)
1993 if (has_negatives (type
)
1994 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
1998 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2001 switch (TYPE_CODE (type
))
2003 case TYPE_CODE_ARRAY
:
2004 case TYPE_CODE_UNION
:
2005 case TYPE_CODE_STRUCT
:
2006 /* Non-scalar values must be aligned at a byte boundary... */
2008 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2009 /* ... And are placed at the beginning (most-significant) bytes
2011 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2015 targ
= TYPE_LENGTH (type
) - 1;
2021 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2024 unusedLS
= bit_offset
;
2027 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2034 /* Mask for removing bits of the next source byte that are not
2035 part of the value. */
2036 unsigned int unusedMSMask
=
2037 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2039 /* Sign-extend bits for this byte. */
2040 unsigned int signMask
= sign
& ~unusedMSMask
;
2042 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2043 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2044 if (accumSize
>= HOST_CHAR_BIT
)
2046 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2047 accumSize
-= HOST_CHAR_BIT
;
2048 accum
>>= HOST_CHAR_BIT
;
2052 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2059 accum
|= sign
<< accumSize
;
2060 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2061 accumSize
-= HOST_CHAR_BIT
;
2062 accum
>>= HOST_CHAR_BIT
;
2070 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2071 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2074 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2075 int src_offset
, int n
)
2077 unsigned int accum
, mask
;
2078 int accum_bits
, chunk_size
;
2080 target
+= targ_offset
/ HOST_CHAR_BIT
;
2081 targ_offset
%= HOST_CHAR_BIT
;
2082 source
+= src_offset
/ HOST_CHAR_BIT
;
2083 src_offset
%= HOST_CHAR_BIT
;
2084 if (BITS_BIG_ENDIAN
)
2086 accum
= (unsigned char) *source
;
2088 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2093 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2094 accum_bits
+= HOST_CHAR_BIT
;
2096 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2099 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2100 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2103 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2105 accum_bits
-= chunk_size
;
2112 accum
= (unsigned char) *source
>> src_offset
;
2114 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2118 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2119 accum_bits
+= HOST_CHAR_BIT
;
2121 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2124 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2125 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2127 accum_bits
-= chunk_size
;
2128 accum
>>= chunk_size
;
2135 /* Store the contents of FROMVAL into the location of TOVAL.
2136 Return a new value with the location of TOVAL and contents of
2137 FROMVAL. Handles assignment into packed fields that have
2138 floating-point or non-scalar types. */
2140 static struct value
*
2141 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2143 struct type
*type
= value_type (toval
);
2144 int bits
= value_bitsize (toval
);
2146 toval
= ada_coerce_ref (toval
);
2147 fromval
= ada_coerce_ref (fromval
);
2149 if (ada_is_direct_array_type (value_type (toval
)))
2150 toval
= ada_coerce_to_simple_array (toval
);
2151 if (ada_is_direct_array_type (value_type (fromval
)))
2152 fromval
= ada_coerce_to_simple_array (fromval
);
2154 if (!deprecated_value_modifiable (toval
))
2155 error (_("Left operand of assignment is not a modifiable lvalue."));
2157 if (VALUE_LVAL (toval
) == lval_memory
2159 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2160 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2162 int len
= (value_bitpos (toval
)
2163 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2164 char *buffer
= (char *) alloca (len
);
2166 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2168 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2169 fromval
= value_cast (type
, fromval
);
2171 read_memory (to_addr
, buffer
, len
);
2172 if (BITS_BIG_ENDIAN
)
2173 move_bits (buffer
, value_bitpos (toval
),
2174 value_contents (fromval
),
2175 TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
-
2178 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2180 write_memory (to_addr
, buffer
, len
);
2181 if (deprecated_memory_changed_hook
)
2182 deprecated_memory_changed_hook (to_addr
, len
);
2184 val
= value_copy (toval
);
2185 memcpy (value_contents_raw (val
), value_contents (fromval
),
2186 TYPE_LENGTH (type
));
2187 deprecated_set_value_type (val
, type
);
2192 return value_assign (toval
, fromval
);
2196 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2197 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2198 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2199 * COMPONENT, and not the inferior's memory. The current contents
2200 * of COMPONENT are ignored. */
2202 value_assign_to_component (struct value
*container
, struct value
*component
,
2205 LONGEST offset_in_container
=
2206 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2207 - VALUE_ADDRESS (container
) - value_offset (container
));
2208 int bit_offset_in_container
=
2209 value_bitpos (component
) - value_bitpos (container
);
2212 val
= value_cast (value_type (component
), val
);
2214 if (value_bitsize (component
) == 0)
2215 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2217 bits
= value_bitsize (component
);
2219 if (BITS_BIG_ENDIAN
)
2220 move_bits (value_contents_writeable (container
) + offset_in_container
,
2221 value_bitpos (container
) + bit_offset_in_container
,
2222 value_contents (val
),
2223 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2226 move_bits (value_contents_writeable (container
) + offset_in_container
,
2227 value_bitpos (container
) + bit_offset_in_container
,
2228 value_contents (val
), 0, bits
);
2231 /* The value of the element of array ARR at the ARITY indices given in IND.
2232 ARR may be either a simple array, GNAT array descriptor, or pointer
2236 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2240 struct type
*elt_type
;
2242 elt
= ada_coerce_to_simple_array (arr
);
2244 elt_type
= ada_check_typedef (value_type (elt
));
2245 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2246 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2247 return value_subscript_packed (elt
, arity
, ind
);
2249 for (k
= 0; k
< arity
; k
+= 1)
2251 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2252 error (_("too many subscripts (%d expected)"), k
);
2253 elt
= value_subscript (elt
, value_pos_atr (ind
[k
]));
2258 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2259 value of the element of *ARR at the ARITY indices given in
2260 IND. Does not read the entire array into memory. */
2263 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2268 for (k
= 0; k
< arity
; k
+= 1)
2273 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2274 error (_("too many subscripts (%d expected)"), k
);
2275 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2277 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2278 idx
= value_pos_atr (ind
[k
]);
2280 idx
= value_sub (idx
, value_from_longest (builtin_type_int
, lwb
));
2281 arr
= value_add (arr
, idx
);
2282 type
= TYPE_TARGET_TYPE (type
);
2285 return value_ind (arr
);
2288 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2289 actual type of ARRAY_PTR is ignored), returns a reference to
2290 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2291 bound of this array is LOW, as per Ada rules. */
2292 static struct value
*
2293 ada_value_slice_ptr (struct value
*array_ptr
, struct type
*type
,
2296 CORE_ADDR base
= value_as_address (array_ptr
)
2297 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2298 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2299 struct type
*index_type
=
2300 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2302 struct type
*slice_type
=
2303 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2304 return value_from_pointer (lookup_reference_type (slice_type
), base
);
2308 static struct value
*
2309 ada_value_slice (struct value
*array
, int low
, int high
)
2311 struct type
*type
= value_type (array
);
2312 struct type
*index_type
=
2313 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2314 struct type
*slice_type
=
2315 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2316 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2319 /* If type is a record type in the form of a standard GNAT array
2320 descriptor, returns the number of dimensions for type. If arr is a
2321 simple array, returns the number of "array of"s that prefix its
2322 type designation. Otherwise, returns 0. */
2325 ada_array_arity (struct type
*type
)
2332 type
= desc_base_type (type
);
2335 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2336 return desc_arity (desc_bounds_type (type
));
2338 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2341 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2347 /* If TYPE is a record type in the form of a standard GNAT array
2348 descriptor or a simple array type, returns the element type for
2349 TYPE after indexing by NINDICES indices, or by all indices if
2350 NINDICES is -1. Otherwise, returns NULL. */
2353 ada_array_element_type (struct type
*type
, int nindices
)
2355 type
= desc_base_type (type
);
2357 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2360 struct type
*p_array_type
;
2362 p_array_type
= desc_data_type (type
);
2364 k
= ada_array_arity (type
);
2368 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2369 if (nindices
>= 0 && k
> nindices
)
2371 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2372 while (k
> 0 && p_array_type
!= NULL
)
2374 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2377 return p_array_type
;
2379 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2381 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2383 type
= TYPE_TARGET_TYPE (type
);
2392 /* The type of nth index in arrays of given type (n numbering from 1).
2393 Does not examine memory. */
2396 ada_index_type (struct type
*type
, int n
)
2398 struct type
*result_type
;
2400 type
= desc_base_type (type
);
2402 if (n
> ada_array_arity (type
))
2405 if (ada_is_simple_array_type (type
))
2409 for (i
= 1; i
< n
; i
+= 1)
2410 type
= TYPE_TARGET_TYPE (type
);
2411 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2412 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2413 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2414 perhaps stabsread.c would make more sense. */
2415 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2416 result_type
= builtin_type_int
;
2421 return desc_index_type (desc_bounds_type (type
), n
);
2424 /* Given that arr is an array type, returns the lower bound of the
2425 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2426 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2427 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2428 bounds type. It works for other arrays with bounds supplied by
2429 run-time quantities other than discriminants. */
2432 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2433 struct type
** typep
)
2436 struct type
*index_type_desc
;
2438 if (ada_is_packed_array_type (arr_type
))
2439 arr_type
= decode_packed_array_type (arr_type
);
2441 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2444 *typep
= builtin_type_int
;
2445 return (LONGEST
) - which
;
2448 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2449 type
= TYPE_TARGET_TYPE (arr_type
);
2453 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2454 if (index_type_desc
== NULL
)
2456 struct type
*range_type
;
2457 struct type
*index_type
;
2461 type
= TYPE_TARGET_TYPE (type
);
2465 range_type
= TYPE_INDEX_TYPE (type
);
2466 index_type
= TYPE_TARGET_TYPE (range_type
);
2467 if (TYPE_CODE (index_type
) == TYPE_CODE_UNDEF
)
2468 index_type
= builtin_type_long
;
2470 *typep
= index_type
;
2472 (LONGEST
) (which
== 0
2473 ? TYPE_LOW_BOUND (range_type
)
2474 : TYPE_HIGH_BOUND (range_type
));
2478 struct type
*index_type
=
2479 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2480 NULL
, TYPE_OBJFILE (arr_type
));
2482 *typep
= TYPE_TARGET_TYPE (index_type
);
2484 (LONGEST
) (which
== 0
2485 ? TYPE_LOW_BOUND (index_type
)
2486 : TYPE_HIGH_BOUND (index_type
));
2490 /* Given that arr is an array value, returns the lower bound of the
2491 nth index (numbering from 1) if which is 0, and the upper bound if
2492 which is 1. This routine will also work for arrays with bounds
2493 supplied by run-time quantities other than discriminants. */
2496 ada_array_bound (struct value
*arr
, int n
, int which
)
2498 struct type
*arr_type
= value_type (arr
);
2500 if (ada_is_packed_array_type (arr_type
))
2501 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2502 else if (ada_is_simple_array_type (arr_type
))
2505 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2506 return value_from_longest (type
, v
);
2509 return desc_one_bound (desc_bounds (arr
), n
, which
);
2512 /* Given that arr is an array value, returns the length of the
2513 nth index. This routine will also work for arrays with bounds
2514 supplied by run-time quantities other than discriminants.
2515 Does not work for arrays indexed by enumeration types with representation
2516 clauses at the moment. */
2519 ada_array_length (struct value
*arr
, int n
)
2521 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2523 if (ada_is_packed_array_type (arr_type
))
2524 return ada_array_length (decode_packed_array (arr
), n
);
2526 if (ada_is_simple_array_type (arr_type
))
2530 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2531 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2532 return value_from_longest (type
, v
);
2536 value_from_longest (builtin_type_int
,
2537 value_as_long (desc_one_bound (desc_bounds (arr
),
2539 - value_as_long (desc_one_bound (desc_bounds (arr
),
2543 /* An empty array whose type is that of ARR_TYPE (an array type),
2544 with bounds LOW to LOW-1. */
2546 static struct value
*
2547 empty_array (struct type
*arr_type
, int low
)
2549 struct type
*index_type
=
2550 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2552 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2553 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2557 /* Name resolution */
2559 /* The "decoded" name for the user-definable Ada operator corresponding
2563 ada_decoded_op_name (enum exp_opcode op
)
2567 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2569 if (ada_opname_table
[i
].op
== op
)
2570 return ada_opname_table
[i
].decoded
;
2572 error (_("Could not find operator name for opcode"));
2576 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2577 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2578 undefined namespace) and converts operators that are
2579 user-defined into appropriate function calls. If CONTEXT_TYPE is
2580 non-null, it provides a preferred result type [at the moment, only
2581 type void has any effect---causing procedures to be preferred over
2582 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2583 return type is preferred. May change (expand) *EXP. */
2586 resolve (struct expression
**expp
, int void_context_p
)
2590 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2593 /* Resolve the operator of the subexpression beginning at
2594 position *POS of *EXPP. "Resolving" consists of replacing
2595 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2596 with their resolutions, replacing built-in operators with
2597 function calls to user-defined operators, where appropriate, and,
2598 when DEPROCEDURE_P is non-zero, converting function-valued variables
2599 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2600 are as in ada_resolve, above. */
2602 static struct value
*
2603 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2604 struct type
*context_type
)
2608 struct expression
*exp
; /* Convenience: == *expp. */
2609 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2610 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2611 int nargs
; /* Number of operands. */
2618 /* Pass one: resolve operands, saving their types and updating *pos,
2623 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2624 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2629 resolve_subexp (expp
, pos
, 0, NULL
);
2631 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2636 resolve_subexp (expp
, pos
, 0, NULL
);
2641 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2644 case OP_ATR_MODULUS
:
2654 case TERNOP_IN_RANGE
:
2655 case BINOP_IN_BOUNDS
:
2661 case OP_DISCRETE_RANGE
:
2663 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2672 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2674 resolve_subexp (expp
, pos
, 1, NULL
);
2676 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2693 case BINOP_LOGICAL_AND
:
2694 case BINOP_LOGICAL_OR
:
2695 case BINOP_BITWISE_AND
:
2696 case BINOP_BITWISE_IOR
:
2697 case BINOP_BITWISE_XOR
:
2700 case BINOP_NOTEQUAL
:
2707 case BINOP_SUBSCRIPT
:
2712 case UNOP_LOGICAL_NOT
:
2729 case OP_INTERNALVAR
:
2738 case STRUCTOP_STRUCT
:
2739 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2752 error (_("Unexpected operator during name resolution"));
2755 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2756 for (i
= 0; i
< nargs
; i
+= 1)
2757 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2761 /* Pass two: perform any resolution on principal operator. */
2768 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2770 struct ada_symbol_info
*candidates
;
2774 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2775 (exp
->elts
[pc
+ 2].symbol
),
2776 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2779 if (n_candidates
> 1)
2781 /* Types tend to get re-introduced locally, so if there
2782 are any local symbols that are not types, first filter
2785 for (j
= 0; j
< n_candidates
; j
+= 1)
2786 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2792 case LOC_REGPARM_ADDR
:
2796 case LOC_BASEREG_ARG
:
2798 case LOC_COMPUTED_ARG
:
2804 if (j
< n_candidates
)
2807 while (j
< n_candidates
)
2809 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2811 candidates
[j
] = candidates
[n_candidates
- 1];
2820 if (n_candidates
== 0)
2821 error (_("No definition found for %s"),
2822 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2823 else if (n_candidates
== 1)
2825 else if (deprocedure_p
2826 && !is_nonfunction (candidates
, n_candidates
))
2828 i
= ada_resolve_function
2829 (candidates
, n_candidates
, NULL
, 0,
2830 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2833 error (_("Could not find a match for %s"),
2834 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2838 printf_filtered (_("Multiple matches for %s\n"),
2839 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2840 user_select_syms (candidates
, n_candidates
, 1);
2844 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2845 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2846 if (innermost_block
== NULL
2847 || contained_in (candidates
[i
].block
, innermost_block
))
2848 innermost_block
= candidates
[i
].block
;
2852 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2855 replace_operator_with_call (expp
, pc
, 0, 0,
2856 exp
->elts
[pc
+ 2].symbol
,
2857 exp
->elts
[pc
+ 1].block
);
2864 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2865 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2867 struct ada_symbol_info
*candidates
;
2871 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2872 (exp
->elts
[pc
+ 5].symbol
),
2873 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2875 if (n_candidates
== 1)
2879 i
= ada_resolve_function
2880 (candidates
, n_candidates
,
2882 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2885 error (_("Could not find a match for %s"),
2886 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2889 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2890 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2891 if (innermost_block
== NULL
2892 || contained_in (candidates
[i
].block
, innermost_block
))
2893 innermost_block
= candidates
[i
].block
;
2904 case BINOP_BITWISE_AND
:
2905 case BINOP_BITWISE_IOR
:
2906 case BINOP_BITWISE_XOR
:
2908 case BINOP_NOTEQUAL
:
2916 case UNOP_LOGICAL_NOT
:
2918 if (possible_user_operator_p (op
, argvec
))
2920 struct ada_symbol_info
*candidates
;
2924 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2925 (struct block
*) NULL
, VAR_DOMAIN
,
2927 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2928 ada_decoded_op_name (op
), NULL
);
2932 replace_operator_with_call (expp
, pc
, nargs
, 1,
2933 candidates
[i
].sym
, candidates
[i
].block
);
2943 return evaluate_subexp_type (exp
, pos
);
2946 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2947 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2948 a non-pointer. A type of 'void' (which is never a valid expression type)
2949 by convention matches anything. */
2950 /* The term "match" here is rather loose. The match is heuristic and
2951 liberal. FIXME: TOO liberal, in fact. */
2954 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
2956 ftype
= ada_check_typedef (ftype
);
2957 atype
= ada_check_typedef (atype
);
2959 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
2960 ftype
= TYPE_TARGET_TYPE (ftype
);
2961 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
2962 atype
= TYPE_TARGET_TYPE (atype
);
2964 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
2965 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
2968 switch (TYPE_CODE (ftype
))
2973 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
2974 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
2975 TYPE_TARGET_TYPE (atype
), 0);
2978 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
2980 case TYPE_CODE_ENUM
:
2981 case TYPE_CODE_RANGE
:
2982 switch (TYPE_CODE (atype
))
2985 case TYPE_CODE_ENUM
:
2986 case TYPE_CODE_RANGE
:
2992 case TYPE_CODE_ARRAY
:
2993 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
2994 || ada_is_array_descriptor_type (atype
));
2996 case TYPE_CODE_STRUCT
:
2997 if (ada_is_array_descriptor_type (ftype
))
2998 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
2999 || ada_is_array_descriptor_type (atype
));
3001 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3002 && !ada_is_array_descriptor_type (atype
));
3004 case TYPE_CODE_UNION
:
3006 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3010 /* Return non-zero if the formals of FUNC "sufficiently match" the
3011 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3012 may also be an enumeral, in which case it is treated as a 0-
3013 argument function. */
3016 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3019 struct type
*func_type
= SYMBOL_TYPE (func
);
3021 if (SYMBOL_CLASS (func
) == LOC_CONST
3022 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3023 return (n_actuals
== 0);
3024 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3027 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3030 for (i
= 0; i
< n_actuals
; i
+= 1)
3032 if (actuals
[i
] == NULL
)
3036 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3037 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3039 if (!ada_type_match (ftype
, atype
, 1))
3046 /* False iff function type FUNC_TYPE definitely does not produce a value
3047 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3048 FUNC_TYPE is not a valid function type with a non-null return type
3049 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3052 return_match (struct type
*func_type
, struct type
*context_type
)
3054 struct type
*return_type
;
3056 if (func_type
== NULL
)
3059 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3060 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3062 return_type
= base_type (func_type
);
3063 if (return_type
== NULL
)
3066 context_type
= base_type (context_type
);
3068 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3069 return context_type
== NULL
|| return_type
== context_type
;
3070 else if (context_type
== NULL
)
3071 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3073 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3077 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3078 function (if any) that matches the types of the NARGS arguments in
3079 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3080 that returns that type, then eliminate matches that don't. If
3081 CONTEXT_TYPE is void and there is at least one match that does not
3082 return void, eliminate all matches that do.
3084 Asks the user if there is more than one match remaining. Returns -1
3085 if there is no such symbol or none is selected. NAME is used
3086 solely for messages. May re-arrange and modify SYMS in
3087 the process; the index returned is for the modified vector. */
3090 ada_resolve_function (struct ada_symbol_info syms
[],
3091 int nsyms
, struct value
**args
, int nargs
,
3092 const char *name
, struct type
*context_type
)
3095 int m
; /* Number of hits */
3096 struct type
*fallback
;
3097 struct type
*return_type
;
3099 return_type
= context_type
;
3100 if (context_type
== NULL
)
3101 fallback
= builtin_type_void
;
3108 for (k
= 0; k
< nsyms
; k
+= 1)
3110 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3112 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3113 && return_match (type
, return_type
))
3119 if (m
> 0 || return_type
== fallback
)
3122 return_type
= fallback
;
3129 printf_filtered (_("Multiple matches for %s\n"), name
);
3130 user_select_syms (syms
, m
, 1);
3136 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3137 in a listing of choices during disambiguation (see sort_choices, below).
3138 The idea is that overloadings of a subprogram name from the
3139 same package should sort in their source order. We settle for ordering
3140 such symbols by their trailing number (__N or $N). */
3143 encoded_ordered_before (char *N0
, char *N1
)
3147 else if (N0
== NULL
)
3152 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3154 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3156 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3157 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3161 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3164 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3166 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3167 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3169 return (strcmp (N0
, N1
) < 0);
3173 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3177 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3180 for (i
= 1; i
< nsyms
; i
+= 1)
3182 struct ada_symbol_info sym
= syms
[i
];
3185 for (j
= i
- 1; j
>= 0; j
-= 1)
3187 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3188 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3190 syms
[j
+ 1] = syms
[j
];
3196 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3197 by asking the user (if necessary), returning the number selected,
3198 and setting the first elements of SYMS items. Error if no symbols
3201 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3202 to be re-integrated one of these days. */
3205 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3208 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3210 int first_choice
= (max_results
== 1) ? 1 : 2;
3212 if (max_results
< 1)
3213 error (_("Request to select 0 symbols!"));
3217 printf_unfiltered (_("[0] cancel\n"));
3218 if (max_results
> 1)
3219 printf_unfiltered (_("[1] all\n"));
3221 sort_choices (syms
, nsyms
);
3223 for (i
= 0; i
< nsyms
; i
+= 1)
3225 if (syms
[i
].sym
== NULL
)
3228 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3230 struct symtab_and_line sal
=
3231 find_function_start_sal (syms
[i
].sym
, 1);
3232 if (sal
.symtab
== NULL
)
3233 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3235 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3238 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3239 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3240 sal
.symtab
->filename
, sal
.line
);
3246 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3247 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3248 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3249 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3251 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3252 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3254 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3255 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3256 else if (is_enumeral
3257 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3259 printf_unfiltered (("[%d] "), i
+ first_choice
);
3260 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3262 printf_unfiltered (_("'(%s) (enumeral)\n"),
3263 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3265 else if (symtab
!= NULL
)
3266 printf_unfiltered (is_enumeral
3267 ? _("[%d] %s in %s (enumeral)\n")
3268 : _("[%d] %s at %s:?\n"),
3270 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3273 printf_unfiltered (is_enumeral
3274 ? _("[%d] %s (enumeral)\n")
3275 : _("[%d] %s at ?\n"),
3277 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3281 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3284 for (i
= 0; i
< n_chosen
; i
+= 1)
3285 syms
[i
] = syms
[chosen
[i
]];
3290 /* Read and validate a set of numeric choices from the user in the
3291 range 0 .. N_CHOICES-1. Place the results in increasing
3292 order in CHOICES[0 .. N-1], and return N.
3294 The user types choices as a sequence of numbers on one line
3295 separated by blanks, encoding them as follows:
3297 + A choice of 0 means to cancel the selection, throwing an error.
3298 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3299 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3301 The user is not allowed to choose more than MAX_RESULTS values.
3303 ANNOTATION_SUFFIX, if present, is used to annotate the input
3304 prompts (for use with the -f switch). */
3307 get_selections (int *choices
, int n_choices
, int max_results
,
3308 int is_all_choice
, char *annotation_suffix
)
3313 int first_choice
= is_all_choice
? 2 : 1;
3315 prompt
= getenv ("PS2");
3319 printf_unfiltered (("%s "), prompt
);
3320 gdb_flush (gdb_stdout
);
3322 args
= command_line_input ((char *) NULL
, 0, annotation_suffix
);
3325 error_no_arg (_("one or more choice numbers"));
3329 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3330 order, as given in args. Choices are validated. */
3336 while (isspace (*args
))
3338 if (*args
== '\0' && n_chosen
== 0)
3339 error_no_arg (_("one or more choice numbers"));
3340 else if (*args
== '\0')
3343 choice
= strtol (args
, &args2
, 10);
3344 if (args
== args2
|| choice
< 0
3345 || choice
> n_choices
+ first_choice
- 1)
3346 error (_("Argument must be choice number"));
3350 error (_("cancelled"));
3352 if (choice
< first_choice
)
3354 n_chosen
= n_choices
;
3355 for (j
= 0; j
< n_choices
; j
+= 1)
3359 choice
-= first_choice
;
3361 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3365 if (j
< 0 || choice
!= choices
[j
])
3368 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3369 choices
[k
+ 1] = choices
[k
];
3370 choices
[j
+ 1] = choice
;
3375 if (n_chosen
> max_results
)
3376 error (_("Select no more than %d of the above"), max_results
);
3381 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3382 on the function identified by SYM and BLOCK, and taking NARGS
3383 arguments. Update *EXPP as needed to hold more space. */
3386 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3387 int oplen
, struct symbol
*sym
,
3388 struct block
*block
)
3390 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3391 symbol, -oplen for operator being replaced). */
3392 struct expression
*newexp
= (struct expression
*)
3393 xmalloc (sizeof (struct expression
)
3394 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3395 struct expression
*exp
= *expp
;
3397 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3398 newexp
->language_defn
= exp
->language_defn
;
3399 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3400 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3401 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3403 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3404 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3406 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3407 newexp
->elts
[pc
+ 4].block
= block
;
3408 newexp
->elts
[pc
+ 5].symbol
= sym
;
3414 /* Type-class predicates */
3416 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3420 numeric_type_p (struct type
*type
)
3426 switch (TYPE_CODE (type
))
3431 case TYPE_CODE_RANGE
:
3432 return (type
== TYPE_TARGET_TYPE (type
)
3433 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3440 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3443 integer_type_p (struct type
*type
)
3449 switch (TYPE_CODE (type
))
3453 case TYPE_CODE_RANGE
:
3454 return (type
== TYPE_TARGET_TYPE (type
)
3455 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3462 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3465 scalar_type_p (struct type
*type
)
3471 switch (TYPE_CODE (type
))
3474 case TYPE_CODE_RANGE
:
3475 case TYPE_CODE_ENUM
:
3484 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3487 discrete_type_p (struct type
*type
)
3493 switch (TYPE_CODE (type
))
3496 case TYPE_CODE_RANGE
:
3497 case TYPE_CODE_ENUM
:
3505 /* Returns non-zero if OP with operands in the vector ARGS could be
3506 a user-defined function. Errs on the side of pre-defined operators
3507 (i.e., result 0). */
3510 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3512 struct type
*type0
=
3513 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3514 struct type
*type1
=
3515 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3529 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3533 case BINOP_BITWISE_AND
:
3534 case BINOP_BITWISE_IOR
:
3535 case BINOP_BITWISE_XOR
:
3536 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3539 case BINOP_NOTEQUAL
:
3544 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3548 ((TYPE_CODE (type0
) != TYPE_CODE_ARRAY
3549 && (TYPE_CODE (type0
) != TYPE_CODE_PTR
3550 || TYPE_CODE (TYPE_TARGET_TYPE (type0
)) != TYPE_CODE_ARRAY
))
3551 || (TYPE_CODE (type1
) != TYPE_CODE_ARRAY
3552 && (TYPE_CODE (type1
) != TYPE_CODE_PTR
3553 || (TYPE_CODE (TYPE_TARGET_TYPE (type1
))
3554 != TYPE_CODE_ARRAY
))));
3557 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3561 case UNOP_LOGICAL_NOT
:
3563 return (!numeric_type_p (type0
));
3570 /* NOTE: In the following, we assume that a renaming type's name may
3571 have an ___XD suffix. It would be nice if this went away at some
3574 /* If TYPE encodes a renaming, returns the renaming suffix, which
3575 is XR for an object renaming, XRP for a procedure renaming, XRE for
3576 an exception renaming, and XRS for a subprogram renaming. Returns
3577 NULL if NAME encodes none of these. */
3580 ada_renaming_type (struct type
*type
)
3582 if (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_ENUM
)
3584 const char *name
= type_name_no_tag (type
);
3585 const char *suffix
= (name
== NULL
) ? NULL
: strstr (name
, "___XR");
3587 || (suffix
[5] != '\000' && strchr ("PES_", suffix
[5]) == NULL
))
3596 /* Return non-zero iff SYM encodes an object renaming. */
3599 ada_is_object_renaming (struct symbol
*sym
)
3601 const char *renaming_type
= ada_renaming_type (SYMBOL_TYPE (sym
));
3602 return renaming_type
!= NULL
3603 && (renaming_type
[2] == '\0' || renaming_type
[2] == '_');
3606 /* Assuming that SYM encodes a non-object renaming, returns the original
3607 name of the renamed entity. The name is good until the end of
3611 ada_simple_renamed_entity (struct symbol
*sym
)
3614 const char *raw_name
;
3618 type
= SYMBOL_TYPE (sym
);
3619 if (type
== NULL
|| TYPE_NFIELDS (type
) < 1)
3620 error (_("Improperly encoded renaming."));
3622 raw_name
= TYPE_FIELD_NAME (type
, 0);
3623 len
= (raw_name
== NULL
? 0 : strlen (raw_name
)) - 5;
3625 error (_("Improperly encoded renaming."));
3627 result
= xmalloc (len
+ 1);
3628 strncpy (result
, raw_name
, len
);
3629 result
[len
] = '\000';
3635 /* Evaluation: Function Calls */
3637 /* Return an lvalue containing the value VAL. This is the identity on
3638 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3639 on the stack, using and updating *SP as the stack pointer, and
3640 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3642 static struct value
*
3643 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3645 if (! VALUE_LVAL (val
))
3647 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3649 /* The following is taken from the structure-return code in
3650 call_function_by_hand. FIXME: Therefore, some refactoring seems
3652 if (INNER_THAN (1, 2))
3654 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3655 reserving sufficient space. */
3657 if (gdbarch_frame_align_p (current_gdbarch
))
3658 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3659 VALUE_ADDRESS (val
) = *sp
;
3663 /* Stack grows upward. Align the frame, allocate space, and
3664 then again, re-align the frame. */
3665 if (gdbarch_frame_align_p (current_gdbarch
))
3666 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3667 VALUE_ADDRESS (val
) = *sp
;
3669 if (gdbarch_frame_align_p (current_gdbarch
))
3670 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3673 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3679 /* Return the value ACTUAL, converted to be an appropriate value for a
3680 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3681 allocating any necessary descriptors (fat pointers), or copies of
3682 values not residing in memory, updating it as needed. */
3684 static struct value
*
3685 convert_actual (struct value
*actual
, struct type
*formal_type0
,
3688 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3689 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3690 struct type
*formal_target
=
3691 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3692 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3693 struct type
*actual_target
=
3694 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3695 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3697 if (ada_is_array_descriptor_type (formal_target
)
3698 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3699 return make_array_descriptor (formal_type
, actual
, sp
);
3700 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
)
3702 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3703 && ada_is_array_descriptor_type (actual_target
))
3704 return desc_data (actual
);
3705 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3707 if (VALUE_LVAL (actual
) != lval_memory
)
3710 actual_type
= ada_check_typedef (value_type (actual
));
3711 val
= allocate_value (actual_type
);
3712 memcpy ((char *) value_contents_raw (val
),
3713 (char *) value_contents (actual
),
3714 TYPE_LENGTH (actual_type
));
3715 actual
= ensure_lval (val
, sp
);
3717 return value_addr (actual
);
3720 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3721 return ada_value_ind (actual
);
3727 /* Push a descriptor of type TYPE for array value ARR on the stack at
3728 *SP, updating *SP to reflect the new descriptor. Return either
3729 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3730 to-descriptor type rather than a descriptor type), a struct value *
3731 representing a pointer to this descriptor. */
3733 static struct value
*
3734 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3736 struct type
*bounds_type
= desc_bounds_type (type
);
3737 struct type
*desc_type
= desc_base_type (type
);
3738 struct value
*descriptor
= allocate_value (desc_type
);
3739 struct value
*bounds
= allocate_value (bounds_type
);
3742 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3744 modify_general_field (value_contents_writeable (bounds
),
3745 value_as_long (ada_array_bound (arr
, i
, 0)),
3746 desc_bound_bitpos (bounds_type
, i
, 0),
3747 desc_bound_bitsize (bounds_type
, i
, 0));
3748 modify_general_field (value_contents_writeable (bounds
),
3749 value_as_long (ada_array_bound (arr
, i
, 1)),
3750 desc_bound_bitpos (bounds_type
, i
, 1),
3751 desc_bound_bitsize (bounds_type
, i
, 1));
3754 bounds
= ensure_lval (bounds
, sp
);
3756 modify_general_field (value_contents_writeable (descriptor
),
3757 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3758 fat_pntr_data_bitpos (desc_type
),
3759 fat_pntr_data_bitsize (desc_type
));
3761 modify_general_field (value_contents_writeable (descriptor
),
3762 VALUE_ADDRESS (bounds
),
3763 fat_pntr_bounds_bitpos (desc_type
),
3764 fat_pntr_bounds_bitsize (desc_type
));
3766 descriptor
= ensure_lval (descriptor
, sp
);
3768 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3769 return value_addr (descriptor
);
3775 /* Assuming a dummy frame has been established on the target, perform any
3776 conversions needed for calling function FUNC on the NARGS actual
3777 parameters in ARGS, other than standard C conversions. Does
3778 nothing if FUNC does not have Ada-style prototype data, or if NARGS
3779 does not match the number of arguments expected. Use *SP as a
3780 stack pointer for additional data that must be pushed, updating its
3784 ada_convert_actuals (struct value
*func
, int nargs
, struct value
*args
[],
3789 if (TYPE_NFIELDS (value_type (func
)) == 0
3790 || nargs
!= TYPE_NFIELDS (value_type (func
)))
3793 for (i
= 0; i
< nargs
; i
+= 1)
3795 convert_actual (args
[i
], TYPE_FIELD_TYPE (value_type (func
), i
), sp
);
3798 /* Dummy definitions for an experimental caching module that is not
3799 * used in the public sources. */
3802 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3803 struct symbol
**sym
, struct block
**block
,
3804 struct symtab
**symtab
)
3810 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3811 struct block
*block
, struct symtab
*symtab
)
3817 /* Return the result of a standard (literal, C-like) lookup of NAME in
3818 given DOMAIN, visible from lexical block BLOCK. */
3820 static struct symbol
*
3821 standard_lookup (const char *name
, const struct block
*block
,
3825 struct symtab
*symtab
;
3827 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
, NULL
))
3830 lookup_symbol_in_language (name
, block
, domain
, language_c
, 0, &symtab
);
3831 cache_symbol (name
, domain
, sym
, block_found
, symtab
);
3836 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3837 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3838 since they contend in overloading in the same way. */
3840 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3844 for (i
= 0; i
< n
; i
+= 1)
3845 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3846 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3847 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3853 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3854 struct types. Otherwise, they may not. */
3857 equiv_types (struct type
*type0
, struct type
*type1
)
3861 if (type0
== NULL
|| type1
== NULL
3862 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3864 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3865 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3866 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3867 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3873 /* True iff SYM0 represents the same entity as SYM1, or one that is
3874 no more defined than that of SYM1. */
3877 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
3881 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
3882 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
3885 switch (SYMBOL_CLASS (sym0
))
3891 struct type
*type0
= SYMBOL_TYPE (sym0
);
3892 struct type
*type1
= SYMBOL_TYPE (sym1
);
3893 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
3894 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
3895 int len0
= strlen (name0
);
3897 TYPE_CODE (type0
) == TYPE_CODE (type1
)
3898 && (equiv_types (type0
, type1
)
3899 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
3900 && strncmp (name1
+ len0
, "___XV", 5) == 0));
3903 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
3904 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
3910 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
3911 records in OBSTACKP. Do nothing if SYM is a duplicate. */
3914 add_defn_to_vec (struct obstack
*obstackp
,
3916 struct block
*block
, struct symtab
*symtab
)
3920 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
3922 /* Do not try to complete stub types, as the debugger is probably
3923 already scanning all symbols matching a certain name at the
3924 time when this function is called. Trying to replace the stub
3925 type by its associated full type will cause us to restart a scan
3926 which may lead to an infinite recursion. Instead, the client
3927 collecting the matching symbols will end up collecting several
3928 matches, with at least one of them complete. It can then filter
3929 out the stub ones if needed. */
3931 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
3933 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
3935 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
3937 prevDefns
[i
].sym
= sym
;
3938 prevDefns
[i
].block
= block
;
3939 prevDefns
[i
].symtab
= symtab
;
3945 struct ada_symbol_info info
;
3949 info
.symtab
= symtab
;
3950 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
3954 /* Number of ada_symbol_info structures currently collected in
3955 current vector in *OBSTACKP. */
3958 num_defns_collected (struct obstack
*obstackp
)
3960 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
3963 /* Vector of ada_symbol_info structures currently collected in current
3964 vector in *OBSTACKP. If FINISH, close off the vector and return
3965 its final address. */
3967 static struct ada_symbol_info
*
3968 defns_collected (struct obstack
*obstackp
, int finish
)
3971 return obstack_finish (obstackp
);
3973 return (struct ada_symbol_info
*) obstack_base (obstackp
);
3976 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
3977 Check the global symbols if GLOBAL, the static symbols if not.
3978 Do wild-card match if WILD. */
3980 static struct partial_symbol
*
3981 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
3982 int global
, domain_enum
namespace, int wild
)
3984 struct partial_symbol
**start
;
3985 int name_len
= strlen (name
);
3986 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
3995 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
3996 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4000 for (i
= 0; i
< length
; i
+= 1)
4002 struct partial_symbol
*psym
= start
[i
];
4004 if (SYMBOL_DOMAIN (psym
) == namespace
4005 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4019 int M
= (U
+ i
) >> 1;
4020 struct partial_symbol
*psym
= start
[M
];
4021 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4023 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4025 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4036 struct partial_symbol
*psym
= start
[i
];
4038 if (SYMBOL_DOMAIN (psym
) == namespace)
4040 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4048 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4062 int M
= (U
+ i
) >> 1;
4063 struct partial_symbol
*psym
= start
[M
];
4064 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4066 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4068 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4079 struct partial_symbol
*psym
= start
[i
];
4081 if (SYMBOL_DOMAIN (psym
) == namespace)
4085 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4088 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4090 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4100 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4110 /* Find a symbol table containing symbol SYM or NULL if none. */
4112 static struct symtab
*
4113 symtab_for_sym (struct symbol
*sym
)
4116 struct objfile
*objfile
;
4118 struct symbol
*tmp_sym
;
4119 struct dict_iterator iter
;
4122 ALL_SYMTABS (objfile
, s
)
4124 switch (SYMBOL_CLASS (sym
))
4132 case LOC_CONST_BYTES
:
4133 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4134 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4136 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4137 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4143 switch (SYMBOL_CLASS (sym
))
4149 case LOC_REGPARM_ADDR
:
4154 case LOC_BASEREG_ARG
:
4156 case LOC_COMPUTED_ARG
:
4157 for (j
= FIRST_LOCAL_BLOCK
;
4158 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4160 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4161 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4172 /* Return a minimal symbol matching NAME according to Ada decoding
4173 rules. Returns NULL if there is no such minimal symbol. Names
4174 prefixed with "standard__" are handled specially: "standard__" is
4175 first stripped off, and only static and global symbols are searched. */
4177 struct minimal_symbol
*
4178 ada_lookup_simple_minsym (const char *name
)
4180 struct objfile
*objfile
;
4181 struct minimal_symbol
*msymbol
;
4184 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4186 name
+= sizeof ("standard__") - 1;
4190 wild_match
= (strstr (name
, "__") == NULL
);
4192 ALL_MSYMBOLS (objfile
, msymbol
)
4194 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4195 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4202 /* For all subprograms that statically enclose the subprogram of the
4203 selected frame, add symbols matching identifier NAME in DOMAIN
4204 and their blocks to the list of data in OBSTACKP, as for
4205 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4209 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4210 const char *name
, domain_enum
namespace,
4215 /* FIXME: The next two routines belong in symtab.c */
4218 restore_language (void *lang
)
4220 set_language ((enum language
) lang
);
4223 /* As for lookup_symbol, but performed as if the current language
4227 lookup_symbol_in_language (const char *name
, const struct block
*block
,
4228 domain_enum domain
, enum language lang
,
4229 int *is_a_field_of_this
, struct symtab
**symtab
)
4231 struct cleanup
*old_chain
4232 = make_cleanup (restore_language
, (void *) current_language
->la_language
);
4233 struct symbol
*result
;
4234 set_language (lang
);
4235 result
= lookup_symbol (name
, block
, domain
, is_a_field_of_this
, symtab
);
4236 do_cleanups (old_chain
);
4240 /* True if TYPE is definitely an artificial type supplied to a symbol
4241 for which no debugging information was given in the symbol file. */
4244 is_nondebugging_type (struct type
*type
)
4246 char *name
= ada_type_name (type
);
4247 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4250 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4251 duplicate other symbols in the list (The only case I know of where
4252 this happens is when object files containing stabs-in-ecoff are
4253 linked with files containing ordinary ecoff debugging symbols (or no
4254 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4255 Returns the number of items in the modified list. */
4258 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4265 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4266 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4267 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4269 for (j
= 0; j
< nsyms
; j
+= 1)
4272 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4273 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4274 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4275 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4276 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4277 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4280 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4281 syms
[k
- 1] = syms
[k
];
4294 /* Given a type that corresponds to a renaming entity, use the type name
4295 to extract the scope (package name or function name, fully qualified,
4296 and following the GNAT encoding convention) where this renaming has been
4297 defined. The string returned needs to be deallocated after use. */
4300 xget_renaming_scope (struct type
*renaming_type
)
4302 /* The renaming types adhere to the following convention:
4303 <scope>__<rename>___<XR extension>.
4304 So, to extract the scope, we search for the "___XR" extension,
4305 and then backtrack until we find the first "__". */
4307 const char *name
= type_name_no_tag (renaming_type
);
4308 char *suffix
= strstr (name
, "___XR");
4313 /* Now, backtrack a bit until we find the first "__". Start looking
4314 at suffix - 3, as the <rename> part is at least one character long. */
4316 for (last
= suffix
- 3; last
> name
; last
--)
4317 if (last
[0] == '_' && last
[1] == '_')
4320 /* Make a copy of scope and return it. */
4322 scope_len
= last
- name
;
4323 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4325 strncpy (scope
, name
, scope_len
);
4326 scope
[scope_len
] = '\0';
4331 /* Return nonzero if NAME corresponds to a package name. */
4334 is_package_name (const char *name
)
4336 /* Here, We take advantage of the fact that no symbols are generated
4337 for packages, while symbols are generated for each function.
4338 So the condition for NAME represent a package becomes equivalent
4339 to NAME not existing in our list of symbols. There is only one
4340 small complication with library-level functions (see below). */
4344 /* If it is a function that has not been defined at library level,
4345 then we should be able to look it up in the symbols. */
4346 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4349 /* Library-level function names start with "_ada_". See if function
4350 "_ada_" followed by NAME can be found. */
4352 /* Do a quick check that NAME does not contain "__", since library-level
4353 functions names cannot contain "__" in them. */
4354 if (strstr (name
, "__") != NULL
)
4357 fun_name
= xstrprintf ("_ada_%s", name
);
4359 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4362 /* Return nonzero if SYM corresponds to a renaming entity that is
4363 visible from FUNCTION_NAME. */
4366 renaming_is_visible (const struct symbol
*sym
, char *function_name
)
4368 char *scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4370 make_cleanup (xfree
, scope
);
4372 /* If the rename has been defined in a package, then it is visible. */
4373 if (is_package_name (scope
))
4376 /* Check that the rename is in the current function scope by checking
4377 that its name starts with SCOPE. */
4379 /* If the function name starts with "_ada_", it means that it is
4380 a library-level function. Strip this prefix before doing the
4381 comparison, as the encoding for the renaming does not contain
4383 if (strncmp (function_name
, "_ada_", 5) == 0)
4386 return (strncmp (function_name
, scope
, strlen (scope
)) == 0);
4389 /* Iterates over the SYMS list and remove any entry that corresponds to
4390 a renaming entity that is not visible from the function associated
4394 GNAT emits a type following a specified encoding for each renaming
4395 entity. Unfortunately, STABS currently does not support the definition
4396 of types that are local to a given lexical block, so all renamings types
4397 are emitted at library level. As a consequence, if an application
4398 contains two renaming entities using the same name, and a user tries to
4399 print the value of one of these entities, the result of the ada symbol
4400 lookup will also contain the wrong renaming type.
4402 This function partially covers for this limitation by attempting to
4403 remove from the SYMS list renaming symbols that should be visible
4404 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4405 method with the current information available. The implementation
4406 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4408 - When the user tries to print a rename in a function while there
4409 is another rename entity defined in a package: Normally, the
4410 rename in the function has precedence over the rename in the
4411 package, so the latter should be removed from the list. This is
4412 currently not the case.
4414 - This function will incorrectly remove valid renames if
4415 the CURRENT_BLOCK corresponds to a function which symbol name
4416 has been changed by an "Export" pragma. As a consequence,
4417 the user will be unable to print such rename entities. */
4420 remove_out_of_scope_renamings (struct ada_symbol_info
*syms
,
4421 int nsyms
, struct block
*current_block
)
4423 struct symbol
*current_function
;
4424 char *current_function_name
;
4427 /* Extract the function name associated to CURRENT_BLOCK.
4428 Abort if unable to do so. */
4430 if (current_block
== NULL
)
4433 current_function
= block_function (current_block
);
4434 if (current_function
== NULL
)
4437 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4438 if (current_function_name
== NULL
)
4441 /* Check each of the symbols, and remove it from the list if it is
4442 a type corresponding to a renaming that is out of the scope of
4443 the current block. */
4448 if (ada_is_object_renaming (syms
[i
].sym
)
4449 && !renaming_is_visible (syms
[i
].sym
, current_function_name
))
4452 for (j
= i
+ 1; j
< nsyms
; j
++)
4453 syms
[j
- 1] = syms
[j
];
4463 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4464 scope and in global scopes, returning the number of matches. Sets
4465 *RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
4466 indicating the symbols found and the blocks and symbol tables (if
4467 any) in which they were found. This vector are transient---good only to
4468 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4469 symbol match within the nest of blocks whose innermost member is BLOCK0,
4470 is the one match returned (no other matches in that or
4471 enclosing blocks is returned). If there are any matches in or
4472 surrounding BLOCK0, then these alone are returned. Otherwise, the
4473 search extends to global and file-scope (static) symbol tables.
4474 Names prefixed with "standard__" are handled specially: "standard__"
4475 is first stripped off, and only static and global symbols are searched. */
4478 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4479 domain_enum
namespace,
4480 struct ada_symbol_info
**results
)
4484 struct partial_symtab
*ps
;
4485 struct blockvector
*bv
;
4486 struct objfile
*objfile
;
4487 struct block
*block
;
4489 struct minimal_symbol
*msymbol
;
4495 obstack_free (&symbol_list_obstack
, NULL
);
4496 obstack_init (&symbol_list_obstack
);
4500 /* Search specified block and its superiors. */
4502 wild_match
= (strstr (name0
, "__") == NULL
);
4504 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4505 needed, but adding const will
4506 have a cascade effect. */
4507 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4511 name
= name0
+ sizeof ("standard__") - 1;
4515 while (block
!= NULL
)
4518 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4519 namespace, NULL
, NULL
, wild_match
);
4521 /* If we found a non-function match, assume that's the one. */
4522 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4523 num_defns_collected (&symbol_list_obstack
)))
4526 block
= BLOCK_SUPERBLOCK (block
);
4529 /* If no luck so far, try to find NAME as a local symbol in some lexically
4530 enclosing subprogram. */
4531 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4532 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4533 name
, namespace, wild_match
);
4535 /* If we found ANY matches among non-global symbols, we're done. */
4537 if (num_defns_collected (&symbol_list_obstack
) > 0)
4541 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
, &s
))
4544 add_defn_to_vec (&symbol_list_obstack
, sym
, block
, s
);
4548 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4549 tables, and psymtab's. */
4551 ALL_SYMTABS (objfile
, s
)
4556 bv
= BLOCKVECTOR (s
);
4557 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4558 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4559 objfile
, s
, wild_match
);
4562 if (namespace == VAR_DOMAIN
)
4564 ALL_MSYMBOLS (objfile
, msymbol
)
4566 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4568 switch (MSYMBOL_TYPE (msymbol
))
4570 case mst_solib_trampoline
:
4573 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4576 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4578 bv
= BLOCKVECTOR (s
);
4579 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4580 ada_add_block_symbols (&symbol_list_obstack
, block
,
4581 SYMBOL_LINKAGE_NAME (msymbol
),
4582 namespace, objfile
, s
, wild_match
);
4584 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4586 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4587 ada_add_block_symbols (&symbol_list_obstack
, block
,
4588 SYMBOL_LINKAGE_NAME (msymbol
),
4589 namespace, objfile
, s
,
4598 ALL_PSYMTABS (objfile
, ps
)
4602 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4604 s
= PSYMTAB_TO_SYMTAB (ps
);
4607 bv
= BLOCKVECTOR (s
);
4608 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4609 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4610 namespace, objfile
, s
, wild_match
);
4614 /* Now add symbols from all per-file blocks if we've gotten no hits
4615 (Not strictly correct, but perhaps better than an error).
4616 Do the symtabs first, then check the psymtabs. */
4618 if (num_defns_collected (&symbol_list_obstack
) == 0)
4621 ALL_SYMTABS (objfile
, s
)
4626 bv
= BLOCKVECTOR (s
);
4627 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4628 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4629 objfile
, s
, wild_match
);
4632 ALL_PSYMTABS (objfile
, ps
)
4636 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4638 s
= PSYMTAB_TO_SYMTAB (ps
);
4639 bv
= BLOCKVECTOR (s
);
4642 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4643 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4644 namespace, objfile
, s
, wild_match
);
4650 ndefns
= num_defns_collected (&symbol_list_obstack
);
4651 *results
= defns_collected (&symbol_list_obstack
, 1);
4653 ndefns
= remove_extra_symbols (*results
, ndefns
);
4656 cache_symbol (name0
, namespace, NULL
, NULL
, NULL
);
4658 if (ndefns
== 1 && cacheIfUnique
)
4659 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
,
4660 (*results
)[0].symtab
);
4662 ndefns
= remove_out_of_scope_renamings (*results
, ndefns
,
4663 (struct block
*) block0
);
4668 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4669 scope and in global scopes, or NULL if none. NAME is folded and
4670 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4671 choosing the first symbol if there are multiple choices.
4672 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4673 table in which the symbol was found (in both cases, these
4674 assignments occur only if the pointers are non-null). */
4677 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4678 domain_enum
namespace, int *is_a_field_of_this
,
4679 struct symtab
**symtab
)
4681 struct ada_symbol_info
*candidates
;
4684 n_candidates
= ada_lookup_symbol_list (ada_encode (ada_fold_name (name
)),
4685 block0
, namespace, &candidates
);
4687 if (n_candidates
== 0)
4690 if (is_a_field_of_this
!= NULL
)
4691 *is_a_field_of_this
= 0;
4695 *symtab
= candidates
[0].symtab
;
4696 if (*symtab
== NULL
&& candidates
[0].block
!= NULL
)
4698 struct objfile
*objfile
;
4701 struct blockvector
*bv
;
4703 /* Search the list of symtabs for one which contains the
4704 address of the start of this block. */
4705 ALL_SYMTABS (objfile
, s
)
4707 bv
= BLOCKVECTOR (s
);
4708 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4709 if (BLOCK_START (b
) <= BLOCK_START (candidates
[0].block
)
4710 && BLOCK_END (b
) > BLOCK_START (candidates
[0].block
))
4713 return fixup_symbol_section (candidates
[0].sym
, objfile
);
4716 /* FIXME: brobecker/2004-11-12: I think that we should never
4717 reach this point. I don't see a reason why we would not
4718 find a symtab for a given block, so I suggest raising an
4719 internal_error exception here. Otherwise, we end up
4720 returning a symbol but no symtab, which certain parts of
4721 the code that rely (indirectly) on this function do not
4722 expect, eventually causing a SEGV. */
4723 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4726 return candidates
[0].sym
;
4729 static struct symbol
*
4730 ada_lookup_symbol_nonlocal (const char *name
,
4731 const char *linkage_name
,
4732 const struct block
*block
,
4733 const domain_enum domain
, struct symtab
**symtab
)
4735 if (linkage_name
== NULL
)
4736 linkage_name
= name
;
4737 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4742 /* True iff STR is a possible encoded suffix of a normal Ada name
4743 that is to be ignored for matching purposes. Suffixes of parallel
4744 names (e.g., XVE) are not included here. Currently, the possible suffixes
4745 are given by either of the regular expression:
4747 (__[0-9]+)?[.$][0-9]+ [nested subprogram suffix, on platforms such
4749 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4750 _E[0-9]+[bs]$ [protected object entry suffixes]
4751 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4755 is_name_suffix (const char *str
)
4758 const char *matching
;
4759 const int len
= strlen (str
);
4761 /* (__[0-9]+)?\.[0-9]+ */
4763 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4766 while (isdigit (matching
[0]))
4768 if (matching
[0] == '\0')
4772 if (matching
[0] == '.' || matching
[0] == '$')
4775 while (isdigit (matching
[0]))
4777 if (matching
[0] == '\0')
4782 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4785 while (isdigit (matching
[0]))
4787 if (matching
[0] == '\0')
4792 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4793 with a N at the end. Unfortunately, the compiler uses the same
4794 convention for other internal types it creates. So treating
4795 all entity names that end with an "N" as a name suffix causes
4796 some regressions. For instance, consider the case of an enumerated
4797 type. To support the 'Image attribute, it creates an array whose
4799 Having a single character like this as a suffix carrying some
4800 information is a bit risky. Perhaps we should change the encoding
4801 to be something like "_N" instead. In the meantime, do not do
4802 the following check. */
4803 /* Protected Object Subprograms */
4804 if (len
== 1 && str
[0] == 'N')
4809 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4812 while (isdigit (matching
[0]))
4814 if ((matching
[0] == 'b' || matching
[0] == 's')
4815 && matching
[1] == '\0')
4819 /* ??? We should not modify STR directly, as we are doing below. This
4820 is fine in this case, but may become problematic later if we find
4821 that this alternative did not work, and want to try matching
4822 another one from the begining of STR. Since we modified it, we
4823 won't be able to find the begining of the string anymore! */
4827 while (str
[0] != '_' && str
[0] != '\0')
4829 if (str
[0] != 'n' && str
[0] != 'b')
4834 if (str
[0] == '\000')
4838 if (str
[1] != '_' || str
[2] == '\000')
4842 if (strcmp (str
+ 3, "JM") == 0)
4844 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4845 the LJM suffix in favor of the JM one. But we will
4846 still accept LJM as a valid suffix for a reasonable
4847 amount of time, just to allow ourselves to debug programs
4848 compiled using an older version of GNAT. */
4849 if (strcmp (str
+ 3, "LJM") == 0)
4853 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4854 || str
[4] == 'U' || str
[4] == 'P')
4856 if (str
[4] == 'R' && str
[5] != 'T')
4860 if (!isdigit (str
[2]))
4862 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4863 if (!isdigit (str
[k
]) && str
[k
] != '_')
4867 if (str
[0] == '$' && isdigit (str
[1]))
4869 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4870 if (!isdigit (str
[k
]) && str
[k
] != '_')
4877 /* Return nonzero if the given string starts with a dot ('.')
4878 followed by zero or more digits.
4880 Note: brobecker/2003-11-10: A forward declaration has not been
4881 added at the begining of this file yet, because this function
4882 is only used to work around a problem found during wild matching
4883 when trying to match minimal symbol names against symbol names
4884 obtained from dwarf-2 data. This function is therefore currently
4885 only used in wild_match() and is likely to be deleted when the
4886 problem in dwarf-2 is fixed. */
4889 is_dot_digits_suffix (const char *str
)
4895 while (isdigit (str
[0]))
4897 return (str
[0] == '\0');
4900 /* Return non-zero if NAME0 is a valid match when doing wild matching.
4901 Certain symbols appear at first to match, except that they turn out
4902 not to follow the Ada encoding and hence should not be used as a wild
4903 match of a given pattern. */
4906 is_valid_name_for_wild_match (const char *name0
)
4908 const char *decoded_name
= ada_decode (name0
);
4911 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4912 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4918 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4919 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4920 informational suffixes of NAME (i.e., for which is_name_suffix is
4924 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4930 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
4931 stored in the symbol table for nested function names is sometimes
4932 different from the name of the associated entity stored in
4933 the dwarf-2 data: This is the case for nested subprograms, where
4934 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
4935 while the symbol name from the dwarf-2 data does not.
4937 Although the DWARF-2 standard documents that entity names stored
4938 in the dwarf-2 data should be identical to the name as seen in
4939 the source code, GNAT takes a different approach as we already use
4940 a special encoding mechanism to convey the information so that
4941 a C debugger can still use the information generated to debug
4942 Ada programs. A corollary is that the symbol names in the dwarf-2
4943 data should match the names found in the symbol table. I therefore
4944 consider this issue as a compiler defect.
4946 Until the compiler is properly fixed, we work-around the problem
4947 by ignoring such suffixes during the match. We do so by making
4948 a copy of PATN0 and NAME0, and then by stripping such a suffix
4949 if present. We then perform the match on the resulting strings. */
4952 name_len
= strlen (name0
);
4954 name
= (char *) alloca ((name_len
+ 1) * sizeof (char));
4955 strcpy (name
, name0
);
4956 dot
= strrchr (name
, '.');
4957 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
4960 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
4961 strncpy (patn
, patn0
, patn_len
);
4962 patn
[patn_len
] = '\0';
4963 dot
= strrchr (patn
, '.');
4964 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
4967 patn_len
= dot
- patn
;
4971 /* Now perform the wild match. */
4973 name_len
= strlen (name
);
4974 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
4975 && strncmp (patn
, name
+ 5, patn_len
) == 0
4976 && is_name_suffix (name
+ patn_len
+ 5))
4979 while (name_len
>= patn_len
)
4981 if (strncmp (patn
, name
, patn_len
) == 0
4982 && is_name_suffix (name
+ patn_len
))
4983 return (is_valid_name_for_wild_match (name0
));
4990 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
4995 if (!islower (name
[2]))
5002 if (!islower (name
[1]))
5013 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5014 vector *defn_symbols, updating the list of symbols in OBSTACKP
5015 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5016 OBJFILE is the section containing BLOCK.
5017 SYMTAB is recorded with each symbol added. */
5020 ada_add_block_symbols (struct obstack
*obstackp
,
5021 struct block
*block
, const char *name
,
5022 domain_enum domain
, struct objfile
*objfile
,
5023 struct symtab
*symtab
, int wild
)
5025 struct dict_iterator iter
;
5026 int name_len
= strlen (name
);
5027 /* A matching argument symbol, if any. */
5028 struct symbol
*arg_sym
;
5029 /* Set true when we find a matching non-argument symbol. */
5038 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5040 if (SYMBOL_DOMAIN (sym
) == domain
5041 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5043 switch (SYMBOL_CLASS (sym
))
5049 case LOC_REGPARM_ADDR
:
5050 case LOC_BASEREG_ARG
:
5051 case LOC_COMPUTED_ARG
:
5054 case LOC_UNRESOLVED
:
5058 add_defn_to_vec (obstackp
,
5059 fixup_symbol_section (sym
, objfile
),
5068 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5070 if (SYMBOL_DOMAIN (sym
) == domain
)
5072 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5074 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5076 switch (SYMBOL_CLASS (sym
))
5082 case LOC_REGPARM_ADDR
:
5083 case LOC_BASEREG_ARG
:
5084 case LOC_COMPUTED_ARG
:
5087 case LOC_UNRESOLVED
:
5091 add_defn_to_vec (obstackp
,
5092 fixup_symbol_section (sym
, objfile
),
5101 if (!found_sym
&& arg_sym
!= NULL
)
5103 add_defn_to_vec (obstackp
,
5104 fixup_symbol_section (arg_sym
, objfile
),
5113 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5115 if (SYMBOL_DOMAIN (sym
) == domain
)
5119 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5122 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5124 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5129 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5131 switch (SYMBOL_CLASS (sym
))
5137 case LOC_REGPARM_ADDR
:
5138 case LOC_BASEREG_ARG
:
5139 case LOC_COMPUTED_ARG
:
5142 case LOC_UNRESOLVED
:
5146 add_defn_to_vec (obstackp
,
5147 fixup_symbol_section (sym
, objfile
),
5155 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5156 They aren't parameters, right? */
5157 if (!found_sym
&& arg_sym
!= NULL
)
5159 add_defn_to_vec (obstackp
,
5160 fixup_symbol_section (arg_sym
, objfile
),
5168 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5169 to be invisible to users. */
5172 ada_is_ignored_field (struct type
*type
, int field_num
)
5174 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5178 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5179 return (name
== NULL
5180 || (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0));
5184 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5185 pointer or reference type whose ultimate target has a tag field. */
5188 ada_is_tagged_type (struct type
*type
, int refok
)
5190 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5193 /* True iff TYPE represents the type of X'Tag */
5196 ada_is_tag_type (struct type
*type
)
5198 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5202 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5203 return (name
!= NULL
5204 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5208 /* The type of the tag on VAL. */
5211 ada_tag_type (struct value
*val
)
5213 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5216 /* The value of the tag on VAL. */
5219 ada_value_tag (struct value
*val
)
5221 return ada_value_struct_elt (val
, "_tag", 0);
5224 /* The value of the tag on the object of type TYPE whose contents are
5225 saved at VALADDR, if it is non-null, or is at memory address
5228 static struct value
*
5229 value_tag_from_contents_and_address (struct type
*type
,
5230 const gdb_byte
*valaddr
,
5233 int tag_byte_offset
, dummy1
, dummy2
;
5234 struct type
*tag_type
;
5235 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5238 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5240 : valaddr
+ tag_byte_offset
);
5241 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5243 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5248 static struct type
*
5249 type_from_tag (struct value
*tag
)
5251 const char *type_name
= ada_tag_name (tag
);
5252 if (type_name
!= NULL
)
5253 return ada_find_any_type (ada_encode (type_name
));
5264 static int ada_tag_name_1 (void *);
5265 static int ada_tag_name_2 (struct tag_args
*);
5267 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5268 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5269 The value stored in ARGS->name is valid until the next call to
5273 ada_tag_name_1 (void *args0
)
5275 struct tag_args
*args
= (struct tag_args
*) args0
;
5276 static char name
[1024];
5280 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5282 return ada_tag_name_2 (args
);
5283 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5286 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5287 for (p
= name
; *p
!= '\0'; p
+= 1)
5294 /* Utility function for ada_tag_name_1 that tries the second
5295 representation for the dispatch table (in which there is no
5296 explicit 'tsd' field in the referent of the tag pointer, and instead
5297 the tsd pointer is stored just before the dispatch table. */
5300 ada_tag_name_2 (struct tag_args
*args
)
5302 struct type
*info_type
;
5303 static char name
[1024];
5305 struct value
*val
, *valp
;
5308 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5309 if (info_type
== NULL
)
5311 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5312 valp
= value_cast (info_type
, args
->tag
);
5315 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5318 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5321 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5322 for (p
= name
; *p
!= '\0'; p
+= 1)
5329 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5333 ada_tag_name (struct value
*tag
)
5335 struct tag_args args
;
5336 if (!ada_is_tag_type (value_type (tag
)))
5340 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5344 /* The parent type of TYPE, or NULL if none. */
5347 ada_parent_type (struct type
*type
)
5351 type
= ada_check_typedef (type
);
5353 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5356 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5357 if (ada_is_parent_field (type
, i
))
5358 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5363 /* True iff field number FIELD_NUM of structure type TYPE contains the
5364 parent-type (inherited) fields of a derived type. Assumes TYPE is
5365 a structure type with at least FIELD_NUM+1 fields. */
5368 ada_is_parent_field (struct type
*type
, int field_num
)
5370 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5371 return (name
!= NULL
5372 && (strncmp (name
, "PARENT", 6) == 0
5373 || strncmp (name
, "_parent", 7) == 0));
5376 /* True iff field number FIELD_NUM of structure type TYPE is a
5377 transparent wrapper field (which should be silently traversed when doing
5378 field selection and flattened when printing). Assumes TYPE is a
5379 structure type with at least FIELD_NUM+1 fields. Such fields are always
5383 ada_is_wrapper_field (struct type
*type
, int field_num
)
5385 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5386 return (name
!= NULL
5387 && (strncmp (name
, "PARENT", 6) == 0
5388 || strcmp (name
, "REP") == 0
5389 || strncmp (name
, "_parent", 7) == 0
5390 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5393 /* True iff field number FIELD_NUM of structure or union type TYPE
5394 is a variant wrapper. Assumes TYPE is a structure type with at least
5395 FIELD_NUM+1 fields. */
5398 ada_is_variant_part (struct type
*type
, int field_num
)
5400 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5401 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5402 || (is_dynamic_field (type
, field_num
)
5403 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5404 == TYPE_CODE_UNION
)));
5407 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5408 whose discriminants are contained in the record type OUTER_TYPE,
5409 returns the type of the controlling discriminant for the variant. */
5412 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5414 char *name
= ada_variant_discrim_name (var_type
);
5416 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5418 return builtin_type_int
;
5423 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5424 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5425 represents a 'when others' clause; otherwise 0. */
5428 ada_is_others_clause (struct type
*type
, int field_num
)
5430 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5431 return (name
!= NULL
&& name
[0] == 'O');
5434 /* Assuming that TYPE0 is the type of the variant part of a record,
5435 returns the name of the discriminant controlling the variant.
5436 The value is valid until the next call to ada_variant_discrim_name. */
5439 ada_variant_discrim_name (struct type
*type0
)
5441 static char *result
= NULL
;
5442 static size_t result_len
= 0;
5445 const char *discrim_end
;
5446 const char *discrim_start
;
5448 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5449 type
= TYPE_TARGET_TYPE (type0
);
5453 name
= ada_type_name (type
);
5455 if (name
== NULL
|| name
[0] == '\000')
5458 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5461 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5464 if (discrim_end
== name
)
5467 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5470 if (discrim_start
== name
+ 1)
5472 if ((discrim_start
> name
+ 3
5473 && strncmp (discrim_start
- 3, "___", 3) == 0)
5474 || discrim_start
[-1] == '.')
5478 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5479 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5480 result
[discrim_end
- discrim_start
] = '\0';
5484 /* Scan STR for a subtype-encoded number, beginning at position K.
5485 Put the position of the character just past the number scanned in
5486 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5487 Return 1 if there was a valid number at the given position, and 0
5488 otherwise. A "subtype-encoded" number consists of the absolute value
5489 in decimal, followed by the letter 'm' to indicate a negative number.
5490 Assumes 0m does not occur. */
5493 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5497 if (!isdigit (str
[k
]))
5500 /* Do it the hard way so as not to make any assumption about
5501 the relationship of unsigned long (%lu scan format code) and
5504 while (isdigit (str
[k
]))
5506 RU
= RU
* 10 + (str
[k
] - '0');
5513 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5519 /* NOTE on the above: Technically, C does not say what the results of
5520 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5521 number representable as a LONGEST (although either would probably work
5522 in most implementations). When RU>0, the locution in the then branch
5523 above is always equivalent to the negative of RU. */
5530 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5531 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5532 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5535 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5537 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5550 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5559 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5560 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5562 if (val
>= L
&& val
<= U
)
5574 /* FIXME: Lots of redundancy below. Try to consolidate. */
5576 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5577 ARG_TYPE, extract and return the value of one of its (non-static)
5578 fields. FIELDNO says which field. Differs from value_primitive_field
5579 only in that it can handle packed values of arbitrary type. */
5581 static struct value
*
5582 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5583 struct type
*arg_type
)
5587 arg_type
= ada_check_typedef (arg_type
);
5588 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5590 /* Handle packed fields. */
5592 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5594 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5595 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5597 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5598 offset
+ bit_pos
/ 8,
5599 bit_pos
% 8, bit_size
, type
);
5602 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5605 /* Find field with name NAME in object of type TYPE. If found,
5606 set the following for each argument that is non-null:
5607 - *FIELD_TYPE_P to the field's type;
5608 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5609 an object of that type;
5610 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5611 - *BIT_SIZE_P to its size in bits if the field is packed, and
5613 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5614 fields up to but not including the desired field, or by the total
5615 number of fields if not found. A NULL value of NAME never
5616 matches; the function just counts visible fields in this case.
5618 Returns 1 if found, 0 otherwise. */
5621 find_struct_field (char *name
, struct type
*type
, int offset
,
5622 struct type
**field_type_p
,
5623 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5628 type
= ada_check_typedef (type
);
5630 if (field_type_p
!= NULL
)
5631 *field_type_p
= NULL
;
5632 if (byte_offset_p
!= NULL
)
5634 if (bit_offset_p
!= NULL
)
5636 if (bit_size_p
!= NULL
)
5639 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5641 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5642 int fld_offset
= offset
+ bit_pos
/ 8;
5643 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5645 if (t_field_name
== NULL
)
5648 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5650 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5651 if (field_type_p
!= NULL
)
5652 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5653 if (byte_offset_p
!= NULL
)
5654 *byte_offset_p
= fld_offset
;
5655 if (bit_offset_p
!= NULL
)
5656 *bit_offset_p
= bit_pos
% 8;
5657 if (bit_size_p
!= NULL
)
5658 *bit_size_p
= bit_size
;
5661 else if (ada_is_wrapper_field (type
, i
))
5663 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5664 field_type_p
, byte_offset_p
, bit_offset_p
,
5665 bit_size_p
, index_p
))
5668 else if (ada_is_variant_part (type
, i
))
5670 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5673 struct type
*field_type
5674 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5676 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5678 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5680 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5681 field_type_p
, byte_offset_p
,
5682 bit_offset_p
, bit_size_p
, index_p
))
5686 else if (index_p
!= NULL
)
5692 /* Number of user-visible fields in record type TYPE. */
5695 num_visible_fields (struct type
*type
)
5699 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5703 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5704 and search in it assuming it has (class) type TYPE.
5705 If found, return value, else return NULL.
5707 Searches recursively through wrapper fields (e.g., '_parent'). */
5709 static struct value
*
5710 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5714 type
= ada_check_typedef (type
);
5716 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5718 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5720 if (t_field_name
== NULL
)
5723 else if (field_name_match (t_field_name
, name
))
5724 return ada_value_primitive_field (arg
, offset
, i
, type
);
5726 else if (ada_is_wrapper_field (type
, i
))
5728 struct value
*v
= /* Do not let indent join lines here. */
5729 ada_search_struct_field (name
, arg
,
5730 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5731 TYPE_FIELD_TYPE (type
, i
));
5736 else if (ada_is_variant_part (type
, i
))
5738 /* PNH: Do we ever get here? See find_struct_field. */
5740 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5741 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
5743 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5745 struct value
*v
= ada_search_struct_field
/* Force line break. */
5747 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5748 TYPE_FIELD_TYPE (field_type
, j
));
5757 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
5758 int, struct type
*);
5761 /* Return field #INDEX in ARG, where the index is that returned by
5762 * find_struct_field through its INDEX_P argument. Adjust the address
5763 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
5764 * If found, return value, else return NULL. */
5766 static struct value
*
5767 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
5770 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
5774 /* Auxiliary function for ada_index_struct_field. Like
5775 * ada_index_struct_field, but takes index from *INDEX_P and modifies
5778 static struct value
*
5779 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
5783 type
= ada_check_typedef (type
);
5785 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5787 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
5789 else if (ada_is_wrapper_field (type
, i
))
5791 struct value
*v
= /* Do not let indent join lines here. */
5792 ada_index_struct_field_1 (index_p
, arg
,
5793 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5794 TYPE_FIELD_TYPE (type
, i
));
5799 else if (ada_is_variant_part (type
, i
))
5801 /* PNH: Do we ever get here? See ada_search_struct_field,
5802 find_struct_field. */
5803 error (_("Cannot assign this kind of variant record"));
5805 else if (*index_p
== 0)
5806 return ada_value_primitive_field (arg
, offset
, i
, type
);
5813 /* Given ARG, a value of type (pointer or reference to a)*
5814 structure/union, extract the component named NAME from the ultimate
5815 target structure/union and return it as a value with its
5816 appropriate type. If ARG is a pointer or reference and the field
5817 is not packed, returns a reference to the field, otherwise the
5818 value of the field (an lvalue if ARG is an lvalue).
5820 The routine searches for NAME among all members of the structure itself
5821 and (recursively) among all members of any wrapper members
5824 If NO_ERR, then simply return NULL in case of error, rather than
5828 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
5830 struct type
*t
, *t1
;
5834 t1
= t
= ada_check_typedef (value_type (arg
));
5835 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
5837 t1
= TYPE_TARGET_TYPE (t
);
5840 t1
= ada_check_typedef (t1
);
5841 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
5843 arg
= coerce_ref (arg
);
5848 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
5850 t1
= TYPE_TARGET_TYPE (t
);
5853 t1
= ada_check_typedef (t1
);
5854 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
5856 arg
= value_ind (arg
);
5863 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
5867 v
= ada_search_struct_field (name
, arg
, 0, t
);
5870 int bit_offset
, bit_size
, byte_offset
;
5871 struct type
*field_type
;
5874 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
5875 address
= value_as_address (arg
);
5877 address
= unpack_pointer (t
, value_contents (arg
));
5879 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
);
5880 if (find_struct_field (name
, t1
, 0,
5881 &field_type
, &byte_offset
, &bit_offset
,
5886 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
5887 arg
= ada_coerce_ref (arg
);
5889 arg
= ada_value_ind (arg
);
5890 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
5891 bit_offset
, bit_size
,
5895 v
= value_from_pointer (lookup_reference_type (field_type
),
5896 address
+ byte_offset
);
5900 if (v
!= NULL
|| no_err
)
5903 error (_("There is no member named %s."), name
);
5909 error (_("Attempt to extract a component of a value that is not a record."));
5912 /* Given a type TYPE, look up the type of the component of type named NAME.
5913 If DISPP is non-null, add its byte displacement from the beginning of a
5914 structure (pointed to by a value) of type TYPE to *DISPP (does not
5915 work for packed fields).
5917 Matches any field whose name has NAME as a prefix, possibly
5920 TYPE can be either a struct or union. If REFOK, TYPE may also
5921 be a (pointer or reference)+ to a struct or union, and the
5922 ultimate target type will be searched.
5924 Looks recursively into variant clauses and parent types.
5926 If NOERR is nonzero, return NULL if NAME is not suitably defined or
5927 TYPE is not a type of the right kind. */
5929 static struct type
*
5930 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
5931 int noerr
, int *dispp
)
5938 if (refok
&& type
!= NULL
)
5941 type
= ada_check_typedef (type
);
5942 if (TYPE_CODE (type
) != TYPE_CODE_PTR
5943 && TYPE_CODE (type
) != TYPE_CODE_REF
)
5945 type
= TYPE_TARGET_TYPE (type
);
5949 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
5950 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
5956 target_terminal_ours ();
5957 gdb_flush (gdb_stdout
);
5959 error (_("Type (null) is not a structure or union type"));
5962 /* XXX: type_sprint */
5963 fprintf_unfiltered (gdb_stderr
, _("Type "));
5964 type_print (type
, "", gdb_stderr
, -1);
5965 error (_(" is not a structure or union type"));
5970 type
= to_static_fixed_type (type
);
5972 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5974 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5978 if (t_field_name
== NULL
)
5981 else if (field_name_match (t_field_name
, name
))
5984 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
5985 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5988 else if (ada_is_wrapper_field (type
, i
))
5991 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
5996 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6001 else if (ada_is_variant_part (type
, i
))
6004 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6006 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6009 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6014 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6025 target_terminal_ours ();
6026 gdb_flush (gdb_stdout
);
6029 /* XXX: type_sprint */
6030 fprintf_unfiltered (gdb_stderr
, _("Type "));
6031 type_print (type
, "", gdb_stderr
, -1);
6032 error (_(" has no component named <null>"));
6036 /* XXX: type_sprint */
6037 fprintf_unfiltered (gdb_stderr
, _("Type "));
6038 type_print (type
, "", gdb_stderr
, -1);
6039 error (_(" has no component named %s"), name
);
6046 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6047 within a value of type OUTER_TYPE that is stored in GDB at
6048 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6049 numbering from 0) is applicable. Returns -1 if none are. */
6052 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6053 const gdb_byte
*outer_valaddr
)
6058 struct type
*discrim_type
;
6059 char *discrim_name
= ada_variant_discrim_name (var_type
);
6060 LONGEST discrim_val
;
6064 ada_lookup_struct_elt_type (outer_type
, discrim_name
, 1, 1, &disp
);
6065 if (discrim_type
== NULL
)
6067 discrim_val
= unpack_long (discrim_type
, outer_valaddr
+ disp
);
6070 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6072 if (ada_is_others_clause (var_type
, i
))
6074 else if (ada_in_variant (discrim_val
, var_type
, i
))
6078 return others_clause
;
6083 /* Dynamic-Sized Records */
6085 /* Strategy: The type ostensibly attached to a value with dynamic size
6086 (i.e., a size that is not statically recorded in the debugging
6087 data) does not accurately reflect the size or layout of the value.
6088 Our strategy is to convert these values to values with accurate,
6089 conventional types that are constructed on the fly. */
6091 /* There is a subtle and tricky problem here. In general, we cannot
6092 determine the size of dynamic records without its data. However,
6093 the 'struct value' data structure, which GDB uses to represent
6094 quantities in the inferior process (the target), requires the size
6095 of the type at the time of its allocation in order to reserve space
6096 for GDB's internal copy of the data. That's why the
6097 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6098 rather than struct value*s.
6100 However, GDB's internal history variables ($1, $2, etc.) are
6101 struct value*s containing internal copies of the data that are not, in
6102 general, the same as the data at their corresponding addresses in
6103 the target. Fortunately, the types we give to these values are all
6104 conventional, fixed-size types (as per the strategy described
6105 above), so that we don't usually have to perform the
6106 'to_fixed_xxx_type' conversions to look at their values.
6107 Unfortunately, there is one exception: if one of the internal
6108 history variables is an array whose elements are unconstrained
6109 records, then we will need to create distinct fixed types for each
6110 element selected. */
6112 /* The upshot of all of this is that many routines take a (type, host
6113 address, target address) triple as arguments to represent a value.
6114 The host address, if non-null, is supposed to contain an internal
6115 copy of the relevant data; otherwise, the program is to consult the
6116 target at the target address. */
6118 /* Assuming that VAL0 represents a pointer value, the result of
6119 dereferencing it. Differs from value_ind in its treatment of
6120 dynamic-sized types. */
6123 ada_value_ind (struct value
*val0
)
6125 struct value
*val
= unwrap_value (value_ind (val0
));
6126 return ada_to_fixed_value (val
);
6129 /* The value resulting from dereferencing any "reference to"
6130 qualifiers on VAL0. */
6132 static struct value
*
6133 ada_coerce_ref (struct value
*val0
)
6135 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6137 struct value
*val
= val0
;
6138 val
= coerce_ref (val
);
6139 val
= unwrap_value (val
);
6140 return ada_to_fixed_value (val
);
6146 /* Return OFF rounded upward if necessary to a multiple of
6147 ALIGNMENT (a power of 2). */
6150 align_value (unsigned int off
, unsigned int alignment
)
6152 return (off
+ alignment
- 1) & ~(alignment
- 1);
6155 /* Return the bit alignment required for field #F of template type TYPE. */
6158 field_alignment (struct type
*type
, int f
)
6160 const char *name
= TYPE_FIELD_NAME (type
, f
);
6161 int len
= (name
== NULL
) ? 0 : strlen (name
);
6164 if (!isdigit (name
[len
- 1]))
6167 if (isdigit (name
[len
- 2]))
6168 align_offset
= len
- 2;
6170 align_offset
= len
- 1;
6172 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6173 return TARGET_CHAR_BIT
;
6175 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6178 /* Find a symbol named NAME. Ignores ambiguity. */
6181 ada_find_any_symbol (const char *name
)
6185 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6186 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6189 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6193 /* Find a type named NAME. Ignores ambiguity. */
6196 ada_find_any_type (const char *name
)
6198 struct symbol
*sym
= ada_find_any_symbol (name
);
6201 return SYMBOL_TYPE (sym
);
6206 /* Given a symbol NAME and its associated BLOCK, search all symbols
6207 for its ___XR counterpart, which is the ``renaming'' symbol
6208 associated to NAME. Return this symbol if found, return
6212 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6214 const struct symbol
*function_sym
= block_function (block
);
6217 if (function_sym
!= NULL
)
6219 /* If the symbol is defined inside a function, NAME is not fully
6220 qualified. This means we need to prepend the function name
6221 as well as adding the ``___XR'' suffix to build the name of
6222 the associated renaming symbol. */
6223 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6224 /* Function names sometimes contain suffixes used
6225 for instance to qualify nested subprograms. When building
6226 the XR type name, we need to make sure that this suffix is
6227 not included. So do not include any suffix in the function
6228 name length below. */
6229 const int function_name_len
= ada_name_prefix_len (function_name
);
6230 const int rename_len
= function_name_len
+ 2 /* "__" */
6231 + strlen (name
) + 6 /* "___XR\0" */ ;
6233 /* Strip the suffix if necessary. */
6234 function_name
[function_name_len
] = '\0';
6236 /* Library-level functions are a special case, as GNAT adds
6237 a ``_ada_'' prefix to the function name to avoid namespace
6238 pollution. However, the renaming symbol themselves do not
6239 have this prefix, so we need to skip this prefix if present. */
6240 if (function_name_len
> 5 /* "_ada_" */
6241 && strstr (function_name
, "_ada_") == function_name
)
6242 function_name
= function_name
+ 5;
6244 rename
= (char *) alloca (rename_len
* sizeof (char));
6245 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6249 const int rename_len
= strlen (name
) + 6;
6250 rename
= (char *) alloca (rename_len
* sizeof (char));
6251 sprintf (rename
, "%s___XR", name
);
6254 return ada_find_any_symbol (rename
);
6257 /* Because of GNAT encoding conventions, several GDB symbols may match a
6258 given type name. If the type denoted by TYPE0 is to be preferred to
6259 that of TYPE1 for purposes of type printing, return non-zero;
6260 otherwise return 0. */
6263 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6267 else if (type0
== NULL
)
6269 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6271 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6273 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6275 else if (ada_is_packed_array_type (type0
))
6277 else if (ada_is_array_descriptor_type (type0
)
6278 && !ada_is_array_descriptor_type (type1
))
6280 else if (ada_renaming_type (type0
) != NULL
6281 && ada_renaming_type (type1
) == NULL
)
6286 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6287 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6290 ada_type_name (struct type
*type
)
6294 else if (TYPE_NAME (type
) != NULL
)
6295 return TYPE_NAME (type
);
6297 return TYPE_TAG_NAME (type
);
6300 /* Find a parallel type to TYPE whose name is formed by appending
6301 SUFFIX to the name of TYPE. */
6304 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6307 static size_t name_len
= 0;
6309 char *typename
= ada_type_name (type
);
6311 if (typename
== NULL
)
6314 len
= strlen (typename
);
6316 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6318 strcpy (name
, typename
);
6319 strcpy (name
+ len
, suffix
);
6321 return ada_find_any_type (name
);
6325 /* If TYPE is a variable-size record type, return the corresponding template
6326 type describing its fields. Otherwise, return NULL. */
6328 static struct type
*
6329 dynamic_template_type (struct type
*type
)
6331 type
= ada_check_typedef (type
);
6333 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6334 || ada_type_name (type
) == NULL
)
6338 int len
= strlen (ada_type_name (type
));
6339 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6342 return ada_find_parallel_type (type
, "___XVE");
6346 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6347 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6350 is_dynamic_field (struct type
*templ_type
, int field_num
)
6352 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6354 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6355 && strstr (name
, "___XVL") != NULL
;
6358 /* The index of the variant field of TYPE, or -1 if TYPE does not
6359 represent a variant record type. */
6362 variant_field_index (struct type
*type
)
6366 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6369 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6371 if (ada_is_variant_part (type
, f
))
6377 /* A record type with no fields. */
6379 static struct type
*
6380 empty_record (struct objfile
*objfile
)
6382 struct type
*type
= alloc_type (objfile
);
6383 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6384 TYPE_NFIELDS (type
) = 0;
6385 TYPE_FIELDS (type
) = NULL
;
6386 TYPE_NAME (type
) = "<empty>";
6387 TYPE_TAG_NAME (type
) = NULL
;
6388 TYPE_FLAGS (type
) = 0;
6389 TYPE_LENGTH (type
) = 0;
6393 /* An ordinary record type (with fixed-length fields) that describes
6394 the value of type TYPE at VALADDR or ADDRESS (see comments at
6395 the beginning of this section) VAL according to GNAT conventions.
6396 DVAL0 should describe the (portion of a) record that contains any
6397 necessary discriminants. It should be NULL if value_type (VAL) is
6398 an outer-level type (i.e., as opposed to a branch of a variant.) A
6399 variant field (unless unchecked) is replaced by a particular branch
6402 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6403 length are not statically known are discarded. As a consequence,
6404 VALADDR, ADDRESS and DVAL0 are ignored.
6406 NOTE: Limitations: For now, we assume that dynamic fields and
6407 variants occupy whole numbers of bytes. However, they need not be
6411 ada_template_to_fixed_record_type_1 (struct type
*type
,
6412 const gdb_byte
*valaddr
,
6413 CORE_ADDR address
, struct value
*dval0
,
6414 int keep_dynamic_fields
)
6416 struct value
*mark
= value_mark ();
6419 int nfields
, bit_len
;
6422 int fld_bit_len
, bit_incr
;
6425 /* Compute the number of fields in this record type that are going
6426 to be processed: unless keep_dynamic_fields, this includes only
6427 fields whose position and length are static will be processed. */
6428 if (keep_dynamic_fields
)
6429 nfields
= TYPE_NFIELDS (type
);
6433 while (nfields
< TYPE_NFIELDS (type
)
6434 && !ada_is_variant_part (type
, nfields
)
6435 && !is_dynamic_field (type
, nfields
))
6439 rtype
= alloc_type (TYPE_OBJFILE (type
));
6440 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6441 INIT_CPLUS_SPECIFIC (rtype
);
6442 TYPE_NFIELDS (rtype
) = nfields
;
6443 TYPE_FIELDS (rtype
) = (struct field
*)
6444 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6445 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6446 TYPE_NAME (rtype
) = ada_type_name (type
);
6447 TYPE_TAG_NAME (rtype
) = NULL
;
6448 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6454 for (f
= 0; f
< nfields
; f
+= 1)
6456 off
= align_value (off
, field_alignment (type
, f
))
6457 + TYPE_FIELD_BITPOS (type
, f
);
6458 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6459 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6461 if (ada_is_variant_part (type
, f
))
6464 fld_bit_len
= bit_incr
= 0;
6466 else if (is_dynamic_field (type
, f
))
6469 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6473 TYPE_FIELD_TYPE (rtype
, f
) =
6476 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6477 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6478 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6479 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6480 bit_incr
= fld_bit_len
=
6481 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6485 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6486 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6487 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6488 bit_incr
= fld_bit_len
=
6489 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6491 bit_incr
= fld_bit_len
=
6492 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6494 if (off
+ fld_bit_len
> bit_len
)
6495 bit_len
= off
+ fld_bit_len
;
6497 TYPE_LENGTH (rtype
) =
6498 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6501 /* We handle the variant part, if any, at the end because of certain
6502 odd cases in which it is re-ordered so as NOT the last field of
6503 the record. This can happen in the presence of representation
6505 if (variant_field
>= 0)
6507 struct type
*branch_type
;
6509 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6512 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6517 to_fixed_variant_branch_type
6518 (TYPE_FIELD_TYPE (type
, variant_field
),
6519 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6520 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6521 if (branch_type
== NULL
)
6523 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6524 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6525 TYPE_NFIELDS (rtype
) -= 1;
6529 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6530 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6532 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6534 if (off
+ fld_bit_len
> bit_len
)
6535 bit_len
= off
+ fld_bit_len
;
6536 TYPE_LENGTH (rtype
) =
6537 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6541 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6542 should contain the alignment of that record, which should be a strictly
6543 positive value. If null or negative, then something is wrong, most
6544 probably in the debug info. In that case, we don't round up the size
6545 of the resulting type. If this record is not part of another structure,
6546 the current RTYPE length might be good enough for our purposes. */
6547 if (TYPE_LENGTH (type
) <= 0)
6549 if (TYPE_NAME (rtype
))
6550 warning (_("Invalid type size for `%s' detected: %d."),
6551 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6553 warning (_("Invalid type size for <unnamed> detected: %d."),
6554 TYPE_LENGTH (type
));
6558 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6559 TYPE_LENGTH (type
));
6562 value_free_to_mark (mark
);
6563 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6564 error (_("record type with dynamic size is larger than varsize-limit"));
6568 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6571 static struct type
*
6572 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6573 CORE_ADDR address
, struct value
*dval0
)
6575 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6579 /* An ordinary record type in which ___XVL-convention fields and
6580 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6581 static approximations, containing all possible fields. Uses
6582 no runtime values. Useless for use in values, but that's OK,
6583 since the results are used only for type determinations. Works on both
6584 structs and unions. Representation note: to save space, we memorize
6585 the result of this function in the TYPE_TARGET_TYPE of the
6588 static struct type
*
6589 template_to_static_fixed_type (struct type
*type0
)
6595 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6596 return TYPE_TARGET_TYPE (type0
);
6598 nfields
= TYPE_NFIELDS (type0
);
6601 for (f
= 0; f
< nfields
; f
+= 1)
6603 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6604 struct type
*new_type
;
6606 if (is_dynamic_field (type0
, f
))
6607 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6609 new_type
= to_static_fixed_type (field_type
);
6610 if (type
== type0
&& new_type
!= field_type
)
6612 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6613 TYPE_CODE (type
) = TYPE_CODE (type0
);
6614 INIT_CPLUS_SPECIFIC (type
);
6615 TYPE_NFIELDS (type
) = nfields
;
6616 TYPE_FIELDS (type
) = (struct field
*)
6617 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6618 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6619 sizeof (struct field
) * nfields
);
6620 TYPE_NAME (type
) = ada_type_name (type0
);
6621 TYPE_TAG_NAME (type
) = NULL
;
6622 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
6623 TYPE_LENGTH (type
) = 0;
6625 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6626 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6631 /* Given an object of type TYPE whose contents are at VALADDR and
6632 whose address in memory is ADDRESS, returns a revision of TYPE --
6633 a non-dynamic-sized record with a variant part -- in which
6634 the variant part is replaced with the appropriate branch. Looks
6635 for discriminant values in DVAL0, which can be NULL if the record
6636 contains the necessary discriminant values. */
6638 static struct type
*
6639 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6640 CORE_ADDR address
, struct value
*dval0
)
6642 struct value
*mark
= value_mark ();
6645 struct type
*branch_type
;
6646 int nfields
= TYPE_NFIELDS (type
);
6647 int variant_field
= variant_field_index (type
);
6649 if (variant_field
== -1)
6653 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6657 rtype
= alloc_type (TYPE_OBJFILE (type
));
6658 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6659 INIT_CPLUS_SPECIFIC (rtype
);
6660 TYPE_NFIELDS (rtype
) = nfields
;
6661 TYPE_FIELDS (rtype
) =
6662 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6663 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6664 sizeof (struct field
) * nfields
);
6665 TYPE_NAME (rtype
) = ada_type_name (type
);
6666 TYPE_TAG_NAME (rtype
) = NULL
;
6667 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6668 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
6670 branch_type
= to_fixed_variant_branch_type
6671 (TYPE_FIELD_TYPE (type
, variant_field
),
6672 cond_offset_host (valaddr
,
6673 TYPE_FIELD_BITPOS (type
, variant_field
)
6675 cond_offset_target (address
,
6676 TYPE_FIELD_BITPOS (type
, variant_field
)
6677 / TARGET_CHAR_BIT
), dval
);
6678 if (branch_type
== NULL
)
6681 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
6682 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6683 TYPE_NFIELDS (rtype
) -= 1;
6687 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6688 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6689 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
6690 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
6692 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
6694 value_free_to_mark (mark
);
6698 /* An ordinary record type (with fixed-length fields) that describes
6699 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
6700 beginning of this section]. Any necessary discriminants' values
6701 should be in DVAL, a record value; it may be NULL if the object
6702 at ADDR itself contains any necessary discriminant values.
6703 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
6704 values from the record are needed. Except in the case that DVAL,
6705 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
6706 unchecked) is replaced by a particular branch of the variant.
6708 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
6709 is questionable and may be removed. It can arise during the
6710 processing of an unconstrained-array-of-record type where all the
6711 variant branches have exactly the same size. This is because in
6712 such cases, the compiler does not bother to use the XVS convention
6713 when encoding the record. I am currently dubious of this
6714 shortcut and suspect the compiler should be altered. FIXME. */
6716 static struct type
*
6717 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
6718 CORE_ADDR address
, struct value
*dval
)
6720 struct type
*templ_type
;
6722 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
6725 templ_type
= dynamic_template_type (type0
);
6727 if (templ_type
!= NULL
)
6728 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
6729 else if (variant_field_index (type0
) >= 0)
6731 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
6733 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
6738 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
6744 /* An ordinary record type (with fixed-length fields) that describes
6745 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
6746 union type. Any necessary discriminants' values should be in DVAL,
6747 a record value. That is, this routine selects the appropriate
6748 branch of the union at ADDR according to the discriminant value
6749 indicated in the union's type name. */
6751 static struct type
*
6752 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
6753 CORE_ADDR address
, struct value
*dval
)
6756 struct type
*templ_type
;
6757 struct type
*var_type
;
6759 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
6760 var_type
= TYPE_TARGET_TYPE (var_type0
);
6762 var_type
= var_type0
;
6764 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
6766 if (templ_type
!= NULL
)
6767 var_type
= templ_type
;
6770 ada_which_variant_applies (var_type
,
6771 value_type (dval
), value_contents (dval
));
6774 return empty_record (TYPE_OBJFILE (var_type
));
6775 else if (is_dynamic_field (var_type
, which
))
6776 return to_fixed_record_type
6777 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
6778 valaddr
, address
, dval
);
6779 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
6781 to_fixed_record_type
6782 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
6784 return TYPE_FIELD_TYPE (var_type
, which
);
6787 /* Assuming that TYPE0 is an array type describing the type of a value
6788 at ADDR, and that DVAL describes a record containing any
6789 discriminants used in TYPE0, returns a type for the value that
6790 contains no dynamic components (that is, no components whose sizes
6791 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
6792 true, gives an error message if the resulting type's size is over
6795 static struct type
*
6796 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
6799 struct type
*index_type_desc
;
6800 struct type
*result
;
6802 if (ada_is_packed_array_type (type0
) /* revisit? */
6803 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
6806 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
6807 if (index_type_desc
== NULL
)
6809 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
6810 /* NOTE: elt_type---the fixed version of elt_type0---should never
6811 depend on the contents of the array in properly constructed
6813 /* Create a fixed version of the array element type.
6814 We're not providing the address of an element here,
6815 and thus the actual object value cannot be inspected to do
6816 the conversion. This should not be a problem, since arrays of
6817 unconstrained objects are not allowed. In particular, all
6818 the elements of an array of a tagged type should all be of
6819 the same type specified in the debugging info. No need to
6820 consult the object tag. */
6821 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
);
6823 if (elt_type0
== elt_type
)
6826 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
6827 elt_type
, TYPE_INDEX_TYPE (type0
));
6832 struct type
*elt_type0
;
6835 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
6836 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
6838 /* NOTE: result---the fixed version of elt_type0---should never
6839 depend on the contents of the array in properly constructed
6841 /* Create a fixed version of the array element type.
6842 We're not providing the address of an element here,
6843 and thus the actual object value cannot be inspected to do
6844 the conversion. This should not be a problem, since arrays of
6845 unconstrained objects are not allowed. In particular, all
6846 the elements of an array of a tagged type should all be of
6847 the same type specified in the debugging info. No need to
6848 consult the object tag. */
6849 result
= ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
);
6850 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
6852 struct type
*range_type
=
6853 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
6854 dval
, TYPE_OBJFILE (type0
));
6855 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
6856 result
, range_type
);
6858 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
6859 error (_("array type with dynamic size is larger than varsize-limit"));
6862 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
6867 /* A standard type (containing no dynamically sized components)
6868 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
6869 DVAL describes a record containing any discriminants used in TYPE0,
6870 and may be NULL if there are none, or if the object of type TYPE at
6871 ADDRESS or in VALADDR contains these discriminants.
6873 In the case of tagged types, this function attempts to locate the object's
6874 tag and use it to compute the actual type. However, when ADDRESS is null,
6875 we cannot use it to determine the location of the tag, and therefore
6876 compute the tagged type's actual type. So we return the tagged type
6877 without consulting the tag. */
6880 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
6881 CORE_ADDR address
, struct value
*dval
)
6883 type
= ada_check_typedef (type
);
6884 switch (TYPE_CODE (type
))
6888 case TYPE_CODE_STRUCT
:
6890 struct type
*static_type
= to_static_fixed_type (type
);
6892 /* If STATIC_TYPE is a tagged type and we know the object's address,
6893 then we can determine its tag, and compute the object's actual
6896 if (address
!= 0 && ada_is_tagged_type (static_type
, 0))
6898 struct type
*real_type
=
6899 type_from_tag (value_tag_from_contents_and_address (static_type
,
6902 if (real_type
!= NULL
)
6905 return to_fixed_record_type (type
, valaddr
, address
, NULL
);
6907 case TYPE_CODE_ARRAY
:
6908 return to_fixed_array_type (type
, dval
, 1);
6909 case TYPE_CODE_UNION
:
6913 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
6917 /* A standard (static-sized) type corresponding as well as possible to
6918 TYPE0, but based on no runtime data. */
6920 static struct type
*
6921 to_static_fixed_type (struct type
*type0
)
6928 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
6931 type0
= ada_check_typedef (type0
);
6933 switch (TYPE_CODE (type0
))
6937 case TYPE_CODE_STRUCT
:
6938 type
= dynamic_template_type (type0
);
6940 return template_to_static_fixed_type (type
);
6942 return template_to_static_fixed_type (type0
);
6943 case TYPE_CODE_UNION
:
6944 type
= ada_find_parallel_type (type0
, "___XVU");
6946 return template_to_static_fixed_type (type
);
6948 return template_to_static_fixed_type (type0
);
6952 /* A static approximation of TYPE with all type wrappers removed. */
6954 static struct type
*
6955 static_unwrap_type (struct type
*type
)
6957 if (ada_is_aligner_type (type
))
6959 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
6960 if (ada_type_name (type1
) == NULL
)
6961 TYPE_NAME (type1
) = ada_type_name (type
);
6963 return static_unwrap_type (type1
);
6967 struct type
*raw_real_type
= ada_get_base_type (type
);
6968 if (raw_real_type
== type
)
6971 return to_static_fixed_type (raw_real_type
);
6975 /* In some cases, incomplete and private types require
6976 cross-references that are not resolved as records (for example,
6978 type FooP is access Foo;
6980 type Foo is array ...;
6981 ). In these cases, since there is no mechanism for producing
6982 cross-references to such types, we instead substitute for FooP a
6983 stub enumeration type that is nowhere resolved, and whose tag is
6984 the name of the actual type. Call these types "non-record stubs". */
6986 /* A type equivalent to TYPE that is not a non-record stub, if one
6987 exists, otherwise TYPE. */
6990 ada_check_typedef (struct type
*type
)
6992 CHECK_TYPEDEF (type
);
6993 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
6994 || !TYPE_STUB (type
)
6995 || TYPE_TAG_NAME (type
) == NULL
)
6999 char *name
= TYPE_TAG_NAME (type
);
7000 struct type
*type1
= ada_find_any_type (name
);
7001 return (type1
== NULL
) ? type
: type1
;
7005 /* A value representing the data at VALADDR/ADDRESS as described by
7006 type TYPE0, but with a standard (static-sized) type that correctly
7007 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7008 type, then return VAL0 [this feature is simply to avoid redundant
7009 creation of struct values]. */
7011 static struct value
*
7012 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7015 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
);
7016 if (type
== type0
&& val0
!= NULL
)
7019 return value_from_contents_and_address (type
, 0, address
);
7022 /* A value representing VAL, but with a standard (static-sized) type
7023 that correctly describes it. Does not necessarily create a new
7026 static struct value
*
7027 ada_to_fixed_value (struct value
*val
)
7029 return ada_to_fixed_value_create (value_type (val
),
7030 VALUE_ADDRESS (val
) + value_offset (val
),
7034 /* A value representing VAL, but with a standard (static-sized) type
7035 chosen to approximate the real type of VAL as well as possible, but
7036 without consulting any runtime values. For Ada dynamic-sized
7037 types, therefore, the type of the result is likely to be inaccurate. */
7040 ada_to_static_fixed_value (struct value
*val
)
7043 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7044 if (type
== value_type (val
))
7047 return coerce_unspec_val_to_type (val
, type
);
7053 /* Table mapping attribute numbers to names.
7054 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7056 static const char *attribute_names
[] = {
7074 ada_attribute_name (enum exp_opcode n
)
7076 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7077 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7079 return attribute_names
[0];
7082 /* Evaluate the 'POS attribute applied to ARG. */
7085 pos_atr (struct value
*arg
)
7087 struct type
*type
= value_type (arg
);
7089 if (!discrete_type_p (type
))
7090 error (_("'POS only defined on discrete types"));
7092 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7095 LONGEST v
= value_as_long (arg
);
7097 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7099 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7102 error (_("enumeration value is invalid: can't find 'POS"));
7105 return value_as_long (arg
);
7108 static struct value
*
7109 value_pos_atr (struct value
*arg
)
7111 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7114 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7116 static struct value
*
7117 value_val_atr (struct type
*type
, struct value
*arg
)
7119 if (!discrete_type_p (type
))
7120 error (_("'VAL only defined on discrete types"));
7121 if (!integer_type_p (value_type (arg
)))
7122 error (_("'VAL requires integral argument"));
7124 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7126 long pos
= value_as_long (arg
);
7127 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7128 error (_("argument to 'VAL out of range"));
7129 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7132 return value_from_longest (type
, value_as_long (arg
));
7138 /* True if TYPE appears to be an Ada character type.
7139 [At the moment, this is true only for Character and Wide_Character;
7140 It is a heuristic test that could stand improvement]. */
7143 ada_is_character_type (struct type
*type
)
7145 const char *name
= ada_type_name (type
);
7148 && (TYPE_CODE (type
) == TYPE_CODE_CHAR
7149 || TYPE_CODE (type
) == TYPE_CODE_INT
7150 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7151 && (strcmp (name
, "character") == 0
7152 || strcmp (name
, "wide_character") == 0
7153 || strcmp (name
, "unsigned char") == 0);
7156 /* True if TYPE appears to be an Ada string type. */
7159 ada_is_string_type (struct type
*type
)
7161 type
= ada_check_typedef (type
);
7163 && TYPE_CODE (type
) != TYPE_CODE_PTR
7164 && (ada_is_simple_array_type (type
)
7165 || ada_is_array_descriptor_type (type
))
7166 && ada_array_arity (type
) == 1)
7168 struct type
*elttype
= ada_array_element_type (type
, 1);
7170 return ada_is_character_type (elttype
);
7177 /* True if TYPE is a struct type introduced by the compiler to force the
7178 alignment of a value. Such types have a single field with a
7179 distinctive name. */
7182 ada_is_aligner_type (struct type
*type
)
7184 type
= ada_check_typedef (type
);
7186 /* If we can find a parallel XVS type, then the XVS type should
7187 be used instead of this type. And hence, this is not an aligner
7189 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7192 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7193 && TYPE_NFIELDS (type
) == 1
7194 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7197 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7198 the parallel type. */
7201 ada_get_base_type (struct type
*raw_type
)
7203 struct type
*real_type_namer
;
7204 struct type
*raw_real_type
;
7206 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7209 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7210 if (real_type_namer
== NULL
7211 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7212 || TYPE_NFIELDS (real_type_namer
) != 1)
7215 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7216 if (raw_real_type
== NULL
)
7219 return raw_real_type
;
7222 /* The type of value designated by TYPE, with all aligners removed. */
7225 ada_aligned_type (struct type
*type
)
7227 if (ada_is_aligner_type (type
))
7228 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7230 return ada_get_base_type (type
);
7234 /* The address of the aligned value in an object at address VALADDR
7235 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7238 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7240 if (ada_is_aligner_type (type
))
7241 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7243 TYPE_FIELD_BITPOS (type
,
7244 0) / TARGET_CHAR_BIT
);
7251 /* The printed representation of an enumeration literal with encoded
7252 name NAME. The value is good to the next call of ada_enum_name. */
7254 ada_enum_name (const char *name
)
7256 static char *result
;
7257 static size_t result_len
= 0;
7260 /* First, unqualify the enumeration name:
7261 1. Search for the last '.' character. If we find one, then skip
7262 all the preceeding characters, the unqualified name starts
7263 right after that dot.
7264 2. Otherwise, we may be debugging on a target where the compiler
7265 translates dots into "__". Search forward for double underscores,
7266 but stop searching when we hit an overloading suffix, which is
7267 of the form "__" followed by digits. */
7269 tmp
= strrchr (name
, '.');
7274 while ((tmp
= strstr (name
, "__")) != NULL
)
7276 if (isdigit (tmp
[2]))
7286 if (name
[1] == 'U' || name
[1] == 'W')
7288 if (sscanf (name
+ 2, "%x", &v
) != 1)
7294 GROW_VECT (result
, result_len
, 16);
7295 if (isascii (v
) && isprint (v
))
7296 sprintf (result
, "'%c'", v
);
7297 else if (name
[1] == 'U')
7298 sprintf (result
, "[\"%02x\"]", v
);
7300 sprintf (result
, "[\"%04x\"]", v
);
7306 tmp
= strstr (name
, "__");
7308 tmp
= strstr (name
, "$");
7311 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7312 strncpy (result
, name
, tmp
- name
);
7313 result
[tmp
- name
] = '\0';
7321 static struct value
*
7322 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7325 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7326 (expect_type
, exp
, pos
, noside
);
7329 /* Evaluate the subexpression of EXP starting at *POS as for
7330 evaluate_type, updating *POS to point just past the evaluated
7333 static struct value
*
7334 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7336 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7337 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7340 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7343 static struct value
*
7344 unwrap_value (struct value
*val
)
7346 struct type
*type
= ada_check_typedef (value_type (val
));
7347 if (ada_is_aligner_type (type
))
7349 struct value
*v
= value_struct_elt (&val
, NULL
, "F",
7350 NULL
, "internal structure");
7351 struct type
*val_type
= ada_check_typedef (value_type (v
));
7352 if (ada_type_name (val_type
) == NULL
)
7353 TYPE_NAME (val_type
) = ada_type_name (type
);
7355 return unwrap_value (v
);
7359 struct type
*raw_real_type
=
7360 ada_check_typedef (ada_get_base_type (type
));
7362 if (type
== raw_real_type
)
7366 coerce_unspec_val_to_type
7367 (val
, ada_to_fixed_type (raw_real_type
, 0,
7368 VALUE_ADDRESS (val
) + value_offset (val
),
7373 static struct value
*
7374 cast_to_fixed (struct type
*type
, struct value
*arg
)
7378 if (type
== value_type (arg
))
7380 else if (ada_is_fixed_point_type (value_type (arg
)))
7381 val
= ada_float_to_fixed (type
,
7382 ada_fixed_to_float (value_type (arg
),
7383 value_as_long (arg
)));
7387 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7388 val
= ada_float_to_fixed (type
, argd
);
7391 return value_from_longest (type
, val
);
7394 static struct value
*
7395 cast_from_fixed_to_double (struct value
*arg
)
7397 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7398 value_as_long (arg
));
7399 return value_from_double (builtin_type_double
, val
);
7402 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7403 return the converted value. */
7405 static struct value
*
7406 coerce_for_assign (struct type
*type
, struct value
*val
)
7408 struct type
*type2
= value_type (val
);
7412 type2
= ada_check_typedef (type2
);
7413 type
= ada_check_typedef (type
);
7415 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7416 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7418 val
= ada_value_ind (val
);
7419 type2
= value_type (val
);
7422 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7423 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7425 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7426 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7427 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7428 error (_("Incompatible types in assignment"));
7429 deprecated_set_value_type (val
, type
);
7434 static struct value
*
7435 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7438 struct type
*type1
, *type2
;
7441 arg1
= coerce_ref (arg1
);
7442 arg2
= coerce_ref (arg2
);
7443 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7444 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7446 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7447 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7448 return value_binop (arg1
, arg2
, op
);
7457 return value_binop (arg1
, arg2
, op
);
7460 v2
= value_as_long (arg2
);
7462 error (_("second operand of %s must not be zero."), op_string (op
));
7464 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7465 return value_binop (arg1
, arg2
, op
);
7467 v1
= value_as_long (arg1
);
7472 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7473 v
+= v
> 0 ? -1 : 1;
7481 /* Should not reach this point. */
7485 val
= allocate_value (type1
);
7486 store_unsigned_integer (value_contents_raw (val
),
7487 TYPE_LENGTH (value_type (val
)), v
);
7492 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7494 if (ada_is_direct_array_type (value_type (arg1
))
7495 || ada_is_direct_array_type (value_type (arg2
)))
7497 arg1
= ada_coerce_to_simple_array (arg1
);
7498 arg2
= ada_coerce_to_simple_array (arg2
);
7499 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7500 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7501 error (_("Attempt to compare array with non-array"));
7502 /* FIXME: The following works only for types whose
7503 representations use all bits (no padding or undefined bits)
7504 and do not have user-defined equality. */
7506 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7507 && memcmp (value_contents (arg1
), value_contents (arg2
),
7508 TYPE_LENGTH (value_type (arg1
))) == 0;
7510 return value_equal (arg1
, arg2
);
7513 /* Total number of component associations in the aggregate starting at
7514 index PC in EXP. Assumes that index PC is the start of an
7518 num_component_specs (struct expression
*exp
, int pc
)
7521 m
= exp
->elts
[pc
+ 1].longconst
;
7524 for (i
= 0; i
< m
; i
+= 1)
7526 switch (exp
->elts
[pc
].opcode
)
7532 n
+= exp
->elts
[pc
+ 1].longconst
;
7535 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7540 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7541 component of LHS (a simple array or a record), updating *POS past
7542 the expression, assuming that LHS is contained in CONTAINER. Does
7543 not modify the inferior's memory, nor does it modify LHS (unless
7544 LHS == CONTAINER). */
7547 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7548 struct expression
*exp
, int *pos
)
7550 struct value
*mark
= value_mark ();
7552 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
7554 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
7555 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
7559 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
7560 elt
= ada_to_fixed_value (unwrap_value (elt
));
7563 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7564 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
7566 value_assign_to_component (container
, elt
,
7567 ada_evaluate_subexp (NULL
, exp
, pos
,
7570 value_free_to_mark (mark
);
7573 /* Assuming that LHS represents an lvalue having a record or array
7574 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7575 of that aggregate's value to LHS, advancing *POS past the
7576 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7577 lvalue containing LHS (possibly LHS itself). Does not modify
7578 the inferior's memory, nor does it modify the contents of
7579 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7581 static struct value
*
7582 assign_aggregate (struct value
*container
,
7583 struct value
*lhs
, struct expression
*exp
,
7584 int *pos
, enum noside noside
)
7586 struct type
*lhs_type
;
7587 int n
= exp
->elts
[*pos
+1].longconst
;
7588 LONGEST low_index
, high_index
;
7591 int max_indices
, num_indices
;
7592 int is_array_aggregate
;
7594 struct value
*mark
= value_mark ();
7597 if (noside
!= EVAL_NORMAL
)
7600 for (i
= 0; i
< n
; i
+= 1)
7601 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
7605 container
= ada_coerce_ref (container
);
7606 if (ada_is_direct_array_type (value_type (container
)))
7607 container
= ada_coerce_to_simple_array (container
);
7608 lhs
= ada_coerce_ref (lhs
);
7609 if (!deprecated_value_modifiable (lhs
))
7610 error (_("Left operand of assignment is not a modifiable lvalue."));
7612 lhs_type
= value_type (lhs
);
7613 if (ada_is_direct_array_type (lhs_type
))
7615 lhs
= ada_coerce_to_simple_array (lhs
);
7616 lhs_type
= value_type (lhs
);
7617 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
7618 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
7619 is_array_aggregate
= 1;
7621 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
7624 high_index
= num_visible_fields (lhs_type
) - 1;
7625 is_array_aggregate
= 0;
7628 error (_("Left-hand side must be array or record."));
7630 num_specs
= num_component_specs (exp
, *pos
- 3);
7631 max_indices
= 4 * num_specs
+ 4;
7632 indices
= alloca (max_indices
* sizeof (indices
[0]));
7633 indices
[0] = indices
[1] = low_index
- 1;
7634 indices
[2] = indices
[3] = high_index
+ 1;
7637 for (i
= 0; i
< n
; i
+= 1)
7639 switch (exp
->elts
[*pos
].opcode
)
7642 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
7643 &num_indices
, max_indices
,
7644 low_index
, high_index
);
7647 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
7648 &num_indices
, max_indices
,
7649 low_index
, high_index
);
7653 error (_("Misplaced 'others' clause"));
7654 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
7655 num_indices
, low_index
, high_index
);
7658 error (_("Internal error: bad aggregate clause"));
7665 /* Assign into the component of LHS indexed by the OP_POSITIONAL
7666 construct at *POS, updating *POS past the construct, given that
7667 the positions are relative to lower bound LOW, where HIGH is the
7668 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
7669 updating *NUM_INDICES as needed. CONTAINER is as for
7670 assign_aggregate. */
7672 aggregate_assign_positional (struct value
*container
,
7673 struct value
*lhs
, struct expression
*exp
,
7674 int *pos
, LONGEST
*indices
, int *num_indices
,
7675 int max_indices
, LONGEST low
, LONGEST high
)
7677 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
7679 if (ind
- 1 == high
)
7680 warning (_("Extra components in aggregate ignored."));
7683 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
7685 assign_component (container
, lhs
, ind
, exp
, pos
);
7688 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7691 /* Assign into the components of LHS indexed by the OP_CHOICES
7692 construct at *POS, updating *POS past the construct, given that
7693 the allowable indices are LOW..HIGH. Record the indices assigned
7694 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
7695 needed. CONTAINER is as for assign_aggregate. */
7697 aggregate_assign_from_choices (struct value
*container
,
7698 struct value
*lhs
, struct expression
*exp
,
7699 int *pos
, LONGEST
*indices
, int *num_indices
,
7700 int max_indices
, LONGEST low
, LONGEST high
)
7703 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
7704 int choice_pos
, expr_pc
;
7705 int is_array
= ada_is_direct_array_type (value_type (lhs
));
7707 choice_pos
= *pos
+= 3;
7709 for (j
= 0; j
< n_choices
; j
+= 1)
7710 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7712 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7714 for (j
= 0; j
< n_choices
; j
+= 1)
7716 LONGEST lower
, upper
;
7717 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
7718 if (op
== OP_DISCRETE_RANGE
)
7721 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
7723 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
7728 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
7739 name
= &exp
->elts
[choice_pos
+ 2].string
;
7742 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
7745 error (_("Invalid record component association."));
7747 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
7749 if (! find_struct_field (name
, value_type (lhs
), 0,
7750 NULL
, NULL
, NULL
, NULL
, &ind
))
7751 error (_("Unknown component name: %s."), name
);
7752 lower
= upper
= ind
;
7755 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
7756 error (_("Index in component association out of bounds."));
7758 add_component_interval (lower
, upper
, indices
, num_indices
,
7760 while (lower
<= upper
)
7764 assign_component (container
, lhs
, lower
, exp
, &pos1
);
7770 /* Assign the value of the expression in the OP_OTHERS construct in
7771 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
7772 have not been previously assigned. The index intervals already assigned
7773 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
7774 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
7776 aggregate_assign_others (struct value
*container
,
7777 struct value
*lhs
, struct expression
*exp
,
7778 int *pos
, LONGEST
*indices
, int num_indices
,
7779 LONGEST low
, LONGEST high
)
7782 int expr_pc
= *pos
+1;
7784 for (i
= 0; i
< num_indices
- 2; i
+= 2)
7787 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
7791 assign_component (container
, lhs
, ind
, exp
, &pos
);
7794 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7797 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
7798 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
7799 modifying *SIZE as needed. It is an error if *SIZE exceeds
7800 MAX_SIZE. The resulting intervals do not overlap. */
7802 add_component_interval (LONGEST low
, LONGEST high
,
7803 LONGEST
* indices
, int *size
, int max_size
)
7806 for (i
= 0; i
< *size
; i
+= 2) {
7807 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
7810 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
7811 if (high
< indices
[kh
])
7813 if (low
< indices
[i
])
7815 indices
[i
+ 1] = indices
[kh
- 1];
7816 if (high
> indices
[i
+ 1])
7817 indices
[i
+ 1] = high
;
7818 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
7819 *size
-= kh
- i
- 2;
7822 else if (high
< indices
[i
])
7826 if (*size
== max_size
)
7827 error (_("Internal error: miscounted aggregate components."));
7829 for (j
= *size
-1; j
>= i
+2; j
-= 1)
7830 indices
[j
] = indices
[j
- 2];
7832 indices
[i
+ 1] = high
;
7835 static struct value
*
7836 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
7837 int *pos
, enum noside noside
)
7840 int tem
, tem2
, tem3
;
7842 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
7845 struct value
**argvec
;
7849 op
= exp
->elts
[pc
].opcode
;
7856 unwrap_value (evaluate_subexp_standard
7857 (expect_type
, exp
, pos
, noside
));
7861 struct value
*result
;
7863 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
7864 /* The result type will have code OP_STRING, bashed there from
7865 OP_ARRAY. Bash it back. */
7866 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
7867 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
7873 type
= exp
->elts
[pc
+ 1].type
;
7874 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
7875 if (noside
== EVAL_SKIP
)
7877 if (type
!= ada_check_typedef (value_type (arg1
)))
7879 if (ada_is_fixed_point_type (type
))
7880 arg1
= cast_to_fixed (type
, arg1
);
7881 else if (ada_is_fixed_point_type (value_type (arg1
)))
7882 arg1
= value_cast (type
, cast_from_fixed_to_double (arg1
));
7883 else if (VALUE_LVAL (arg1
) == lval_memory
)
7885 /* This is in case of the really obscure (and undocumented,
7886 but apparently expected) case of (Foo) Bar.all, where Bar
7887 is an integer constant and Foo is a dynamic-sized type.
7888 If we don't do this, ARG1 will simply be relabeled with
7890 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
7891 return value_zero (to_static_fixed_type (type
), not_lval
);
7893 ada_to_fixed_value_create
7894 (type
, VALUE_ADDRESS (arg1
) + value_offset (arg1
), 0);
7897 arg1
= value_cast (type
, arg1
);
7903 type
= exp
->elts
[pc
+ 1].type
;
7904 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
7907 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7908 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7910 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
7911 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
7913 return ada_value_assign (arg1
, arg1
);
7915 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
7916 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
7918 if (ada_is_fixed_point_type (value_type (arg1
)))
7919 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
7920 else if (ada_is_fixed_point_type (value_type (arg2
)))
7922 (_("Fixed-point values must be assigned to fixed-point variables"));
7924 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
7925 return ada_value_assign (arg1
, arg2
);
7928 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
7929 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
7930 if (noside
== EVAL_SKIP
)
7932 if ((ada_is_fixed_point_type (value_type (arg1
))
7933 || ada_is_fixed_point_type (value_type (arg2
)))
7934 && value_type (arg1
) != value_type (arg2
))
7935 error (_("Operands of fixed-point addition must have the same type"));
7936 return value_cast (value_type (arg1
), value_add (arg1
, arg2
));
7939 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
7940 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
7941 if (noside
== EVAL_SKIP
)
7943 if ((ada_is_fixed_point_type (value_type (arg1
))
7944 || ada_is_fixed_point_type (value_type (arg2
)))
7945 && value_type (arg1
) != value_type (arg2
))
7946 error (_("Operands of fixed-point subtraction must have the same type"));
7947 return value_cast (value_type (arg1
), value_sub (arg1
, arg2
));
7951 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7952 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7953 if (noside
== EVAL_SKIP
)
7955 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
7956 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
7957 return value_zero (value_type (arg1
), not_lval
);
7960 if (ada_is_fixed_point_type (value_type (arg1
)))
7961 arg1
= cast_from_fixed_to_double (arg1
);
7962 if (ada_is_fixed_point_type (value_type (arg2
)))
7963 arg2
= cast_from_fixed_to_double (arg2
);
7964 return ada_value_binop (arg1
, arg2
, op
);
7969 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7970 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7971 if (noside
== EVAL_SKIP
)
7973 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
7974 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
7975 return value_zero (value_type (arg1
), not_lval
);
7977 return ada_value_binop (arg1
, arg2
, op
);
7980 case BINOP_NOTEQUAL
:
7981 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7982 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
7983 if (noside
== EVAL_SKIP
)
7985 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
7988 tem
= ada_value_equal (arg1
, arg2
);
7989 if (op
== BINOP_NOTEQUAL
)
7991 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
7994 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7995 if (noside
== EVAL_SKIP
)
7997 else if (ada_is_fixed_point_type (value_type (arg1
)))
7998 return value_cast (value_type (arg1
), value_neg (arg1
));
8000 return value_neg (arg1
);
8004 if (noside
== EVAL_SKIP
)
8009 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8010 /* Only encountered when an unresolved symbol occurs in a
8011 context other than a function call, in which case, it is
8013 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8014 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8015 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8019 (to_static_fixed_type
8020 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8026 unwrap_value (evaluate_subexp_standard
8027 (expect_type
, exp
, pos
, noside
));
8028 return ada_to_fixed_value (arg1
);
8034 /* Allocate arg vector, including space for the function to be
8035 called in argvec[0] and a terminating NULL. */
8036 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8038 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8040 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8041 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8042 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8043 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8046 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8047 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8050 if (noside
== EVAL_SKIP
)
8054 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8055 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8056 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8057 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8058 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8059 argvec
[0] = value_addr (argvec
[0]);
8061 type
= ada_check_typedef (value_type (argvec
[0]));
8062 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8064 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8066 case TYPE_CODE_FUNC
:
8067 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8069 case TYPE_CODE_ARRAY
:
8071 case TYPE_CODE_STRUCT
:
8072 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8073 argvec
[0] = ada_value_ind (argvec
[0]);
8074 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8077 error (_("cannot subscript or call something of type `%s'"),
8078 ada_type_name (value_type (argvec
[0])));
8083 switch (TYPE_CODE (type
))
8085 case TYPE_CODE_FUNC
:
8086 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8087 return allocate_value (TYPE_TARGET_TYPE (type
));
8088 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8089 case TYPE_CODE_STRUCT
:
8093 arity
= ada_array_arity (type
);
8094 type
= ada_array_element_type (type
, nargs
);
8096 error (_("cannot subscript or call a record"));
8098 error (_("wrong number of subscripts; expecting %d"), arity
);
8099 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8100 return allocate_value (ada_aligned_type (type
));
8102 unwrap_value (ada_value_subscript
8103 (argvec
[0], nargs
, argvec
+ 1));
8105 case TYPE_CODE_ARRAY
:
8106 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8108 type
= ada_array_element_type (type
, nargs
);
8110 error (_("element type of array unknown"));
8112 return allocate_value (ada_aligned_type (type
));
8115 unwrap_value (ada_value_subscript
8116 (ada_coerce_to_simple_array (argvec
[0]),
8117 nargs
, argvec
+ 1));
8118 case TYPE_CODE_PTR
: /* Pointer to array */
8119 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8120 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8122 type
= ada_array_element_type (type
, nargs
);
8124 error (_("element type of array unknown"));
8126 return allocate_value (ada_aligned_type (type
));
8129 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8130 nargs
, argvec
+ 1));
8133 error (_("Attempt to index or call something other than an "
8134 "array or function"));
8139 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8140 struct value
*low_bound_val
=
8141 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8142 struct value
*high_bound_val
=
8143 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8146 low_bound_val
= coerce_ref (low_bound_val
);
8147 high_bound_val
= coerce_ref (high_bound_val
);
8148 low_bound
= pos_atr (low_bound_val
);
8149 high_bound
= pos_atr (high_bound_val
);
8151 if (noside
== EVAL_SKIP
)
8154 /* If this is a reference to an aligner type, then remove all
8156 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8157 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8158 TYPE_TARGET_TYPE (value_type (array
)) =
8159 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8161 if (ada_is_packed_array_type (value_type (array
)))
8162 error (_("cannot slice a packed array"));
8164 /* If this is a reference to an array or an array lvalue,
8165 convert to a pointer. */
8166 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8167 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8168 && VALUE_LVAL (array
) == lval_memory
))
8169 array
= value_addr (array
);
8171 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8172 && ada_is_array_descriptor_type (ada_check_typedef
8173 (value_type (array
))))
8174 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8176 array
= ada_coerce_to_simple_array_ptr (array
);
8178 /* If we have more than one level of pointer indirection,
8179 dereference the value until we get only one level. */
8180 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8181 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8183 array
= value_ind (array
);
8185 /* Make sure we really do have an array type before going further,
8186 to avoid a SEGV when trying to get the index type or the target
8187 type later down the road if the debug info generated by
8188 the compiler is incorrect or incomplete. */
8189 if (!ada_is_simple_array_type (value_type (array
)))
8190 error (_("cannot take slice of non-array"));
8192 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8194 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8195 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8199 struct type
*arr_type0
=
8200 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8202 return ada_value_slice_ptr (array
, arr_type0
,
8203 longest_to_int (low_bound
),
8204 longest_to_int (high_bound
));
8207 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8209 else if (high_bound
< low_bound
)
8210 return empty_array (value_type (array
), low_bound
);
8212 return ada_value_slice (array
, longest_to_int (low_bound
),
8213 longest_to_int (high_bound
));
8218 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8219 type
= exp
->elts
[pc
+ 1].type
;
8221 if (noside
== EVAL_SKIP
)
8224 switch (TYPE_CODE (type
))
8227 lim_warning (_("Membership test incompletely implemented; "
8228 "always returns true"));
8229 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
8231 case TYPE_CODE_RANGE
:
8232 arg2
= value_from_longest (builtin_type_int
, TYPE_LOW_BOUND (type
));
8233 arg3
= value_from_longest (builtin_type_int
,
8234 TYPE_HIGH_BOUND (type
));
8236 value_from_longest (builtin_type_int
,
8237 (value_less (arg1
, arg3
)
8238 || value_equal (arg1
, arg3
))
8239 && (value_less (arg2
, arg1
)
8240 || value_equal (arg2
, arg1
)));
8243 case BINOP_IN_BOUNDS
:
8245 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8246 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8248 if (noside
== EVAL_SKIP
)
8251 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8252 return value_zero (builtin_type_int
, not_lval
);
8254 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8256 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8257 error (_("invalid dimension number to 'range"));
8259 arg3
= ada_array_bound (arg2
, tem
, 1);
8260 arg2
= ada_array_bound (arg2
, tem
, 0);
8263 value_from_longest (builtin_type_int
,
8264 (value_less (arg1
, arg3
)
8265 || value_equal (arg1
, arg3
))
8266 && (value_less (arg2
, arg1
)
8267 || value_equal (arg2
, arg1
)));
8269 case TERNOP_IN_RANGE
:
8270 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8271 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8272 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8274 if (noside
== EVAL_SKIP
)
8278 value_from_longest (builtin_type_int
,
8279 (value_less (arg1
, arg3
)
8280 || value_equal (arg1
, arg3
))
8281 && (value_less (arg2
, arg1
)
8282 || value_equal (arg2
, arg1
)));
8288 struct type
*type_arg
;
8289 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8291 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8293 type_arg
= exp
->elts
[pc
+ 2].type
;
8297 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8301 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8302 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8303 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8306 if (noside
== EVAL_SKIP
)
8309 if (type_arg
== NULL
)
8311 arg1
= ada_coerce_ref (arg1
);
8313 if (ada_is_packed_array_type (value_type (arg1
)))
8314 arg1
= ada_coerce_to_simple_array (arg1
);
8316 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8317 error (_("invalid dimension number to '%s"),
8318 ada_attribute_name (op
));
8320 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8322 type
= ada_index_type (value_type (arg1
), tem
);
8325 (_("attempt to take bound of something that is not an array"));
8326 return allocate_value (type
);
8331 default: /* Should never happen. */
8332 error (_("unexpected attribute encountered"));
8334 return ada_array_bound (arg1
, tem
, 0);
8336 return ada_array_bound (arg1
, tem
, 1);
8338 return ada_array_length (arg1
, tem
);
8341 else if (discrete_type_p (type_arg
))
8343 struct type
*range_type
;
8344 char *name
= ada_type_name (type_arg
);
8346 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8348 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8349 if (range_type
== NULL
)
8350 range_type
= type_arg
;
8354 error (_("unexpected attribute encountered"));
8356 return discrete_type_low_bound (range_type
);
8358 return discrete_type_high_bound (range_type
);
8360 error (_("the 'length attribute applies only to array types"));
8363 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8364 error (_("unimplemented type attribute"));
8369 if (ada_is_packed_array_type (type_arg
))
8370 type_arg
= decode_packed_array_type (type_arg
);
8372 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8373 error (_("invalid dimension number to '%s"),
8374 ada_attribute_name (op
));
8376 type
= ada_index_type (type_arg
, tem
);
8379 (_("attempt to take bound of something that is not an array"));
8380 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8381 return allocate_value (type
);
8386 error (_("unexpected attribute encountered"));
8388 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8389 return value_from_longest (type
, low
);
8391 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8392 return value_from_longest (type
, high
);
8394 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8395 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8396 return value_from_longest (type
, high
- low
+ 1);
8402 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8403 if (noside
== EVAL_SKIP
)
8406 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8407 return value_zero (ada_tag_type (arg1
), not_lval
);
8409 return ada_value_tag (arg1
);
8413 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8414 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8415 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8416 if (noside
== EVAL_SKIP
)
8418 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8419 return value_zero (value_type (arg1
), not_lval
);
8421 return value_binop (arg1
, arg2
,
8422 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
8424 case OP_ATR_MODULUS
:
8426 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
8427 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8429 if (noside
== EVAL_SKIP
)
8432 if (!ada_is_modular_type (type_arg
))
8433 error (_("'modulus must be applied to modular type"));
8435 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
8436 ada_modulus (type_arg
));
8441 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8442 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8443 if (noside
== EVAL_SKIP
)
8445 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8446 return value_zero (builtin_type_int
, not_lval
);
8448 return value_pos_atr (arg1
);
8451 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8452 if (noside
== EVAL_SKIP
)
8454 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8455 return value_zero (builtin_type_int
, not_lval
);
8457 return value_from_longest (builtin_type_int
,
8459 * TYPE_LENGTH (value_type (arg1
)));
8462 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8463 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8464 type
= exp
->elts
[pc
+ 2].type
;
8465 if (noside
== EVAL_SKIP
)
8467 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8468 return value_zero (type
, not_lval
);
8470 return value_val_atr (type
, arg1
);
8473 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8474 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8475 if (noside
== EVAL_SKIP
)
8477 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8478 return value_zero (value_type (arg1
), not_lval
);
8480 return value_binop (arg1
, arg2
, op
);
8483 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8484 if (noside
== EVAL_SKIP
)
8490 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8491 if (noside
== EVAL_SKIP
)
8493 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
8494 return value_neg (arg1
);
8499 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
8500 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
8501 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
8502 if (noside
== EVAL_SKIP
)
8504 type
= ada_check_typedef (value_type (arg1
));
8505 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8507 if (ada_is_array_descriptor_type (type
))
8508 /* GDB allows dereferencing GNAT array descriptors. */
8510 struct type
*arrType
= ada_type_of_array (arg1
, 0);
8511 if (arrType
== NULL
)
8512 error (_("Attempt to dereference null array pointer."));
8513 return value_at_lazy (arrType
, 0);
8515 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
8516 || TYPE_CODE (type
) == TYPE_CODE_REF
8517 /* In C you can dereference an array to get the 1st elt. */
8518 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8520 type
= to_static_fixed_type
8522 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
8524 return value_zero (type
, lval_memory
);
8526 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
8527 /* GDB allows dereferencing an int. */
8528 return value_zero (builtin_type_int
, lval_memory
);
8530 error (_("Attempt to take contents of a non-pointer value."));
8532 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
8533 type
= ada_check_typedef (value_type (arg1
));
8535 if (ada_is_array_descriptor_type (type
))
8536 /* GDB allows dereferencing GNAT array descriptors. */
8537 return ada_coerce_to_simple_array (arg1
);
8539 return ada_value_ind (arg1
);
8541 case STRUCTOP_STRUCT
:
8542 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8543 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
8544 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8545 if (noside
== EVAL_SKIP
)
8547 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8549 struct type
*type1
= value_type (arg1
);
8550 if (ada_is_tagged_type (type1
, 1))
8552 type
= ada_lookup_struct_elt_type (type1
,
8553 &exp
->elts
[pc
+ 2].string
,
8556 /* In this case, we assume that the field COULD exist
8557 in some extension of the type. Return an object of
8558 "type" void, which will match any formal
8559 (see ada_type_match). */
8560 return value_zero (builtin_type_void
, lval_memory
);
8564 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
8567 return value_zero (ada_aligned_type (type
), lval_memory
);
8571 ada_to_fixed_value (unwrap_value
8572 (ada_value_struct_elt
8573 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
8575 /* The value is not supposed to be used. This is here to make it
8576 easier to accommodate expressions that contain types. */
8578 if (noside
== EVAL_SKIP
)
8580 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8581 return allocate_value (exp
->elts
[pc
+ 1].type
);
8583 error (_("Attempt to use a type name as an expression"));
8588 case OP_DISCRETE_RANGE
:
8591 if (noside
== EVAL_NORMAL
)
8595 error (_("Undefined name, ambiguous name, or renaming used in "
8596 "component association: %s."), &exp
->elts
[pc
+2].string
);
8598 error (_("Aggregates only allowed on the right of an assignment"));
8600 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
8603 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
8605 for (tem
= 0; tem
< nargs
; tem
+= 1)
8606 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8611 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
8617 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
8618 type name that encodes the 'small and 'delta information.
8619 Otherwise, return NULL. */
8622 fixed_type_info (struct type
*type
)
8624 const char *name
= ada_type_name (type
);
8625 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
8627 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
8629 const char *tail
= strstr (name
, "___XF_");
8635 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
8636 return fixed_type_info (TYPE_TARGET_TYPE (type
));
8641 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
8644 ada_is_fixed_point_type (struct type
*type
)
8646 return fixed_type_info (type
) != NULL
;
8649 /* Return non-zero iff TYPE represents a System.Address type. */
8652 ada_is_system_address_type (struct type
*type
)
8654 return (TYPE_NAME (type
)
8655 && strcmp (TYPE_NAME (type
), "system__address") == 0);
8658 /* Assuming that TYPE is the representation of an Ada fixed-point
8659 type, return its delta, or -1 if the type is malformed and the
8660 delta cannot be determined. */
8663 ada_delta (struct type
*type
)
8665 const char *encoding
= fixed_type_info (type
);
8668 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
8671 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
8674 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
8675 factor ('SMALL value) associated with the type. */
8678 scaling_factor (struct type
*type
)
8680 const char *encoding
= fixed_type_info (type
);
8681 unsigned long num0
, den0
, num1
, den1
;
8684 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
8689 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
8691 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
8695 /* Assuming that X is the representation of a value of fixed-point
8696 type TYPE, return its floating-point equivalent. */
8699 ada_fixed_to_float (struct type
*type
, LONGEST x
)
8701 return (DOUBLEST
) x
*scaling_factor (type
);
8704 /* The representation of a fixed-point value of type TYPE
8705 corresponding to the value X. */
8708 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
8710 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
8714 /* VAX floating formats */
8716 /* Non-zero iff TYPE represents one of the special VAX floating-point
8720 ada_is_vax_floating_type (struct type
*type
)
8723 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
8726 && (TYPE_CODE (type
) == TYPE_CODE_INT
8727 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8728 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
8731 /* The type of special VAX floating-point type this is, assuming
8732 ada_is_vax_floating_point. */
8735 ada_vax_float_type_suffix (struct type
*type
)
8737 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
8740 /* A value representing the special debugging function that outputs
8741 VAX floating-point values of the type represented by TYPE. Assumes
8742 ada_is_vax_floating_type (TYPE). */
8745 ada_vax_float_print_function (struct type
*type
)
8747 switch (ada_vax_float_type_suffix (type
))
8750 return get_var_value ("DEBUG_STRING_F", 0);
8752 return get_var_value ("DEBUG_STRING_D", 0);
8754 return get_var_value ("DEBUG_STRING_G", 0);
8756 error (_("invalid VAX floating-point type"));
8763 /* Scan STR beginning at position K for a discriminant name, and
8764 return the value of that discriminant field of DVAL in *PX. If
8765 PNEW_K is not null, put the position of the character beyond the
8766 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
8767 not alter *PX and *PNEW_K if unsuccessful. */
8770 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
8773 static char *bound_buffer
= NULL
;
8774 static size_t bound_buffer_len
= 0;
8777 struct value
*bound_val
;
8779 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
8782 pend
= strstr (str
+ k
, "__");
8786 k
+= strlen (bound
);
8790 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
8791 bound
= bound_buffer
;
8792 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
8793 bound
[pend
- (str
+ k
)] = '\0';
8797 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
8798 if (bound_val
== NULL
)
8801 *px
= value_as_long (bound_val
);
8807 /* Value of variable named NAME in the current environment. If
8808 no such variable found, then if ERR_MSG is null, returns 0, and
8809 otherwise causes an error with message ERR_MSG. */
8811 static struct value
*
8812 get_var_value (char *name
, char *err_msg
)
8814 struct ada_symbol_info
*syms
;
8817 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
8822 if (err_msg
== NULL
)
8825 error (("%s"), err_msg
);
8828 return value_of_variable (syms
[0].sym
, syms
[0].block
);
8831 /* Value of integer variable named NAME in the current environment. If
8832 no such variable found, returns 0, and sets *FLAG to 0. If
8833 successful, sets *FLAG to 1. */
8836 get_int_var_value (char *name
, int *flag
)
8838 struct value
*var_val
= get_var_value (name
, 0);
8850 return value_as_long (var_val
);
8855 /* Return a range type whose base type is that of the range type named
8856 NAME in the current environment, and whose bounds are calculated
8857 from NAME according to the GNAT range encoding conventions.
8858 Extract discriminant values, if needed, from DVAL. If a new type
8859 must be created, allocate in OBJFILE's space. The bounds
8860 information, in general, is encoded in NAME, the base type given in
8861 the named range type. */
8863 static struct type
*
8864 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
8866 struct type
*raw_type
= ada_find_any_type (name
);
8867 struct type
*base_type
;
8870 if (raw_type
== NULL
)
8871 base_type
= builtin_type_int
;
8872 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
8873 base_type
= TYPE_TARGET_TYPE (raw_type
);
8875 base_type
= raw_type
;
8877 subtype_info
= strstr (name
, "___XD");
8878 if (subtype_info
== NULL
)
8882 static char *name_buf
= NULL
;
8883 static size_t name_len
= 0;
8884 int prefix_len
= subtype_info
- name
;
8890 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
8891 strncpy (name_buf
, name
, prefix_len
);
8892 name_buf
[prefix_len
] = '\0';
8895 bounds_str
= strchr (subtype_info
, '_');
8898 if (*subtype_info
== 'L')
8900 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
8901 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
8903 if (bounds_str
[n
] == '_')
8905 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
8912 strcpy (name_buf
+ prefix_len
, "___L");
8913 L
= get_int_var_value (name_buf
, &ok
);
8916 lim_warning (_("Unknown lower bound, using 1."));
8921 if (*subtype_info
== 'U')
8923 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
8924 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
8930 strcpy (name_buf
+ prefix_len
, "___U");
8931 U
= get_int_var_value (name_buf
, &ok
);
8934 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
8939 if (objfile
== NULL
)
8940 objfile
= TYPE_OBJFILE (base_type
);
8941 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
8942 TYPE_NAME (type
) = name
;
8947 /* True iff NAME is the name of a range type. */
8950 ada_is_range_type_name (const char *name
)
8952 return (name
!= NULL
&& strstr (name
, "___XD"));
8958 /* True iff TYPE is an Ada modular type. */
8961 ada_is_modular_type (struct type
*type
)
8963 struct type
*subranged_type
= base_type (type
);
8965 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
8966 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
8967 && TYPE_UNSIGNED (subranged_type
));
8970 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
8973 ada_modulus (struct type
* type
)
8975 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
8979 /* Ada exception catchpoint support:
8980 ---------------------------------
8982 We support 3 kinds of exception catchpoints:
8983 . catchpoints on Ada exceptions
8984 . catchpoints on unhandled Ada exceptions
8985 . catchpoints on failed assertions
8987 Exceptions raised during failed assertions, or unhandled exceptions
8988 could perfectly be caught with the general catchpoint on Ada exceptions.
8989 However, we can easily differentiate these two special cases, and having
8990 the option to distinguish these two cases from the rest can be useful
8991 to zero-in on certain situations.
8993 Exception catchpoints are a specialized form of breakpoint,
8994 since they rely on inserting breakpoints inside known routines
8995 of the GNAT runtime. The implementation therefore uses a standard
8996 breakpoint structure of the BP_BREAKPOINT type, but with its own set
8999 At this time, we do not support the use of conditions on Ada exception
9000 catchpoints. The COND and COND_STRING fields are therefore set
9001 to NULL (most of the time, see below).
9003 Conditions where EXP_STRING, COND, and COND_STRING are used:
9005 When a user specifies the name of a specific exception in the case
9006 of catchpoints on Ada exceptions, we store the name of that exception
9007 in the EXP_STRING. We then translate this request into an actual
9008 condition stored in COND_STRING, and then parse it into an expression
9011 /* The different types of catchpoints that we introduced for catching
9014 enum exception_catchpoint_kind
9017 ex_catch_exception_unhandled
,
9021 /* Return the name of the function at PC, NULL if could not find it.
9022 This function only checks the debugging information, not the symbol
9026 function_name_from_pc (CORE_ADDR pc
)
9030 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9036 /* True iff FRAME is very likely to be that of a function that is
9037 part of the runtime system. This is all very heuristic, but is
9038 intended to be used as advice as to what frames are uninteresting
9042 is_known_support_routine (struct frame_info
*frame
)
9044 struct frame_info
*next_frame
= get_next_frame (frame
);
9045 /* If frame is not innermost, that normally means that frame->pc
9046 points to *after* the call instruction, and we want to get the line
9047 containing the call, never the next line. But if the next frame is
9048 a signal_handler_caller or a dummy frame, then the next frame was
9049 not entered as the result of a call, and we want to get the line
9050 containing frame->pc. */
9051 const int pc_is_after_call
=
9053 && get_frame_type (next_frame
) != SIGTRAMP_FRAME
9054 && get_frame_type (next_frame
) != DUMMY_FRAME
;
9055 struct symtab_and_line sal
9056 = find_pc_line (get_frame_pc (frame
), pc_is_after_call
);
9062 1. The symtab is null (indicating no debugging symbols)
9063 2. The symtab's filename does not exist.
9064 3. The object file's name is one of the standard libraries.
9065 4. The symtab's file name has the form of an Ada library source file.
9066 5. The function at frame's PC has a GNAT-compiler-generated name. */
9068 if (sal
.symtab
== NULL
)
9071 /* On some systems (e.g. VxWorks), the kernel contains debugging
9072 symbols; in this case, the filename referenced by these symbols
9075 if (stat (sal
.symtab
->filename
, &st
))
9078 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9080 re_comp (known_runtime_file_name_patterns
[i
]);
9081 if (re_exec (sal
.symtab
->filename
))
9084 if (sal
.symtab
->objfile
!= NULL
)
9086 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9088 re_comp (known_runtime_file_name_patterns
[i
]);
9089 if (re_exec (sal
.symtab
->objfile
->name
))
9094 /* If the frame PC points after the call instruction, then we need to
9095 decrement it in order to search for the function associated to this
9096 PC. Otherwise, if the associated call was the last instruction of
9097 the function, we might either find the wrong function or even fail
9098 during the function name lookup. */
9099 if (pc_is_after_call
)
9100 func_name
= function_name_from_pc (get_frame_pc (frame
) - 1);
9102 func_name
= function_name_from_pc (get_frame_pc (frame
));
9104 if (func_name
== NULL
)
9107 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9109 re_comp (known_auxiliary_function_name_patterns
[i
]);
9110 if (re_exec (func_name
))
9117 /* Find the first frame that contains debugging information and that is not
9118 part of the Ada run-time, starting from FI and moving upward. */
9121 ada_find_printable_frame (struct frame_info
*fi
)
9123 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9125 if (!is_known_support_routine (fi
))
9134 /* Assuming that the inferior just triggered an unhandled exception
9135 catchpoint, return the address in inferior memory where the name
9136 of the exception is stored.
9138 Return zero if the address could not be computed. */
9141 ada_unhandled_exception_name_addr (void)
9144 struct frame_info
*fi
;
9146 /* To determine the name of this exception, we need to select
9147 the frame corresponding to RAISE_SYM_NAME. This frame is
9148 at least 3 levels up, so we simply skip the first 3 frames
9149 without checking the name of their associated function. */
9150 fi
= get_current_frame ();
9151 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9153 fi
= get_prev_frame (fi
);
9157 const char *func_name
=
9158 function_name_from_pc (get_frame_address_in_block (fi
));
9159 if (func_name
!= NULL
9160 && strcmp (func_name
, raise_sym_name
) == 0)
9161 break; /* We found the frame we were looking for... */
9162 fi
= get_prev_frame (fi
);
9169 return parse_and_eval_address ("id.full_name");
9172 /* Assuming the inferior just triggered an Ada exception catchpoint
9173 (of any type), return the address in inferior memory where the name
9174 of the exception is stored, if applicable.
9176 Return zero if the address could not be computed, or if not relevant. */
9179 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9180 struct breakpoint
*b
)
9184 case ex_catch_exception
:
9185 return (parse_and_eval_address ("e.full_name"));
9188 case ex_catch_exception_unhandled
:
9189 return ada_unhandled_exception_name_addr ();
9192 case ex_catch_assert
:
9193 return 0; /* Exception name is not relevant in this case. */
9197 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9201 return 0; /* Should never be reached. */
9204 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9205 any error that ada_exception_name_addr_1 might cause to be thrown.
9206 When an error is intercepted, a warning with the error message is printed,
9207 and zero is returned. */
9210 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9211 struct breakpoint
*b
)
9213 struct gdb_exception e
;
9214 CORE_ADDR result
= 0;
9216 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9218 result
= ada_exception_name_addr_1 (ex
, b
);
9223 warning (_("failed to get exception name: %s"), e
.message
);
9230 /* Implement the PRINT_IT method in the breakpoint_ops structure
9231 for all exception catchpoint kinds. */
9233 static enum print_stop_action
9234 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
9236 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
9237 char exception_name
[256];
9241 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
9242 exception_name
[sizeof (exception_name
) - 1] = '\0';
9245 ada_find_printable_frame (get_current_frame ());
9247 annotate_catchpoint (b
->number
);
9250 case ex_catch_exception
:
9252 printf_filtered (_("\nCatchpoint %d, %s at "),
9253 b
->number
, exception_name
);
9255 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
9257 case ex_catch_exception_unhandled
:
9259 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
9260 b
->number
, exception_name
);
9262 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
9265 case ex_catch_assert
:
9266 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
9271 return PRINT_SRC_AND_LOC
;
9274 /* Implement the PRINT_ONE method in the breakpoint_ops structure
9275 for all exception catchpoint kinds. */
9278 print_one_exception (enum exception_catchpoint_kind ex
,
9279 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9284 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
9288 *last_addr
= b
->loc
->address
;
9291 case ex_catch_exception
:
9292 if (b
->exp_string
!= NULL
)
9294 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
9296 ui_out_field_string (uiout
, "what", msg
);
9300 ui_out_field_string (uiout
, "what", "all Ada exceptions");
9304 case ex_catch_exception_unhandled
:
9305 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
9308 case ex_catch_assert
:
9309 ui_out_field_string (uiout
, "what", "failed Ada assertions");
9313 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9318 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
9319 for all exception catchpoint kinds. */
9322 print_mention_exception (enum exception_catchpoint_kind ex
,
9323 struct breakpoint
*b
)
9327 case ex_catch_exception
:
9328 if (b
->exp_string
!= NULL
)
9329 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
9330 b
->number
, b
->exp_string
);
9332 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
9336 case ex_catch_exception_unhandled
:
9337 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
9341 case ex_catch_assert
:
9342 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
9346 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9351 /* Virtual table for "catch exception" breakpoints. */
9353 static enum print_stop_action
9354 print_it_catch_exception (struct breakpoint
*b
)
9356 return print_it_exception (ex_catch_exception
, b
);
9360 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9362 print_one_exception (ex_catch_exception
, b
, last_addr
);
9366 print_mention_catch_exception (struct breakpoint
*b
)
9368 print_mention_exception (ex_catch_exception
, b
);
9371 static struct breakpoint_ops catch_exception_breakpoint_ops
=
9373 print_it_catch_exception
,
9374 print_one_catch_exception
,
9375 print_mention_catch_exception
9378 /* Virtual table for "catch exception unhandled" breakpoints. */
9380 static enum print_stop_action
9381 print_it_catch_exception_unhandled (struct breakpoint
*b
)
9383 return print_it_exception (ex_catch_exception_unhandled
, b
);
9387 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9389 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
9393 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
9395 print_mention_exception (ex_catch_exception_unhandled
, b
);
9398 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
9399 print_it_catch_exception_unhandled
,
9400 print_one_catch_exception_unhandled
,
9401 print_mention_catch_exception_unhandled
9404 /* Virtual table for "catch assert" breakpoints. */
9406 static enum print_stop_action
9407 print_it_catch_assert (struct breakpoint
*b
)
9409 return print_it_exception (ex_catch_assert
, b
);
9413 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9415 print_one_exception (ex_catch_assert
, b
, last_addr
);
9419 print_mention_catch_assert (struct breakpoint
*b
)
9421 print_mention_exception (ex_catch_assert
, b
);
9424 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
9425 print_it_catch_assert
,
9426 print_one_catch_assert
,
9427 print_mention_catch_assert
9430 /* Return non-zero if B is an Ada exception catchpoint. */
9433 ada_exception_catchpoint_p (struct breakpoint
*b
)
9435 return (b
->ops
== &catch_exception_breakpoint_ops
9436 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
9437 || b
->ops
== &catch_assert_breakpoint_ops
);
9440 /* Cause the appropriate error if no appropriate runtime symbol is
9441 found to set a breakpoint, using ERR_DESC to describe the
9445 error_breakpoint_runtime_sym_not_found (const char *err_desc
)
9447 /* If we are not debugging an Ada program, we cannot put exception
9450 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9451 error (_("Unable to break on %s. Is this an Ada main program?"),
9454 /* If the symbol does not exist, then check that the program is
9455 already started, to make sure that shared libraries have been
9456 loaded. If it is not started, this may mean that the symbol is
9457 in a shared library. */
9459 if (ptid_get_pid (inferior_ptid
) == 0)
9460 error (_("Unable to break on %s. Try to start the program first."),
9463 /* At this point, we know that we are debugging an Ada program and
9464 that the inferior has been started, but we still are not able to
9465 find the run-time symbols. That can mean that we are in
9466 configurable run time mode, or that a-except as been optimized
9467 out by the linker... In any case, at this point it is not worth
9468 supporting this feature. */
9470 error (_("Cannot break on %s in this configuration."), err_desc
);
9473 /* Return a newly allocated copy of the first space-separated token
9474 in ARGSP, and then adjust ARGSP to point immediately after that
9477 Return NULL if ARGPS does not contain any more tokens. */
9480 ada_get_next_arg (char **argsp
)
9482 char *args
= *argsp
;
9486 /* Skip any leading white space. */
9488 while (isspace (*args
))
9491 if (args
[0] == '\0')
9492 return NULL
; /* No more arguments. */
9494 /* Find the end of the current argument. */
9497 while (*end
!= '\0' && !isspace (*end
))
9500 /* Adjust ARGSP to point to the start of the next argument. */
9504 /* Make a copy of the current argument and return it. */
9506 result
= xmalloc (end
- args
+ 1);
9507 strncpy (result
, args
, end
- args
);
9508 result
[end
- args
] = '\0';
9513 /* Split the arguments specified in a "catch exception" command.
9514 Set EX to the appropriate catchpoint type.
9515 Set EXP_STRING to the name of the specific exception if
9516 specified by the user. */
9519 catch_ada_exception_command_split (char *args
,
9520 enum exception_catchpoint_kind
*ex
,
9523 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
9524 char *exception_name
;
9526 exception_name
= ada_get_next_arg (&args
);
9527 make_cleanup (xfree
, exception_name
);
9529 /* Check that we do not have any more arguments. Anything else
9532 while (isspace (*args
))
9535 if (args
[0] != '\0')
9536 error (_("Junk at end of expression"));
9538 discard_cleanups (old_chain
);
9540 if (exception_name
== NULL
)
9542 /* Catch all exceptions. */
9543 *ex
= ex_catch_exception
;
9546 else if (strcmp (exception_name
, "unhandled") == 0)
9548 /* Catch unhandled exceptions. */
9549 *ex
= ex_catch_exception_unhandled
;
9554 /* Catch a specific exception. */
9555 *ex
= ex_catch_exception
;
9556 *exp_string
= exception_name
;
9560 /* Return the name of the symbol on which we should break in order to
9561 implement a catchpoint of the EX kind. */
9564 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
9568 case ex_catch_exception
:
9569 return (raise_sym_name
);
9571 case ex_catch_exception_unhandled
:
9572 return (raise_unhandled_sym_name
);
9574 case ex_catch_assert
:
9575 return (raise_assert_sym_name
);
9578 internal_error (__FILE__
, __LINE__
,
9579 _("unexpected catchpoint kind (%d)"), ex
);
9583 /* Return the breakpoint ops "virtual table" used for catchpoints
9586 static struct breakpoint_ops
*
9587 ada_exception_breakption_ops (enum exception_catchpoint_kind ex
)
9591 case ex_catch_exception
:
9592 return (&catch_exception_breakpoint_ops
);
9594 case ex_catch_exception_unhandled
:
9595 return (&catch_exception_unhandled_breakpoint_ops
);
9597 case ex_catch_assert
:
9598 return (&catch_assert_breakpoint_ops
);
9601 internal_error (__FILE__
, __LINE__
,
9602 _("unexpected catchpoint kind (%d)"), ex
);
9606 /* Return the condition that will be used to match the current exception
9607 being raised with the exception that the user wants to catch. This
9608 assumes that this condition is used when the inferior just triggered
9609 an exception catchpoint.
9611 The string returned is a newly allocated string that needs to be
9612 deallocated later. */
9615 ada_exception_catchpoint_cond_string (const char *exp_string
)
9617 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
9620 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
9622 static struct expression
*
9623 ada_parse_catchpoint_condition (char *cond_string
,
9624 struct symtab_and_line sal
)
9626 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
9629 /* Return the symtab_and_line that should be used to insert an exception
9630 catchpoint of the TYPE kind.
9632 EX_STRING should contain the name of a specific exception
9633 that the catchpoint should catch, or NULL otherwise.
9635 The idea behind all the remaining parameters is that their names match
9636 the name of certain fields in the breakpoint structure that are used to
9637 handle exception catchpoints. This function returns the value to which
9638 these fields should be set, depending on the type of catchpoint we need
9641 If COND and COND_STRING are both non-NULL, any value they might
9642 hold will be free'ed, and then replaced by newly allocated ones.
9643 These parameters are left untouched otherwise. */
9645 static struct symtab_and_line
9646 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
9647 char **addr_string
, char **cond_string
,
9648 struct expression
**cond
, struct breakpoint_ops
**ops
)
9650 const char *sym_name
;
9652 struct symtab_and_line sal
;
9654 /* First lookup the function on which we will break in order to catch
9655 the Ada exceptions requested by the user. */
9657 sym_name
= ada_exception_sym_name (ex
);
9658 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
9660 /* The symbol we're looking up is provided by a unit in the GNAT runtime
9661 that should be compiled with debugging information. As a result, we
9662 expect to find that symbol in the symtabs. If we don't find it, then
9663 the target most likely does not support Ada exceptions, or we cannot
9664 insert exception breakpoints yet, because the GNAT runtime hasn't been
9667 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
9668 in such a way that no debugging information is produced for the symbol
9669 we are looking for. In this case, we could search the minimal symbols
9670 as a fall-back mechanism. This would still be operating in degraded
9671 mode, however, as we would still be missing the debugging information
9672 that is needed in order to extract the name of the exception being
9673 raised (this name is printed in the catchpoint message, and is also
9674 used when trying to catch a specific exception). We do not handle
9675 this case for now. */
9678 error_breakpoint_runtime_sym_not_found (sym_name
);
9680 /* Make sure that the symbol we found corresponds to a function. */
9681 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
9682 error (_("Symbol \"%s\" is not a function (class = %d)"),
9683 sym_name
, SYMBOL_CLASS (sym
));
9685 sal
= find_function_start_sal (sym
, 1);
9687 /* Set ADDR_STRING. */
9689 *addr_string
= xstrdup (sym_name
);
9691 /* Set the COND and COND_STRING (if not NULL). */
9693 if (cond_string
!= NULL
&& cond
!= NULL
)
9695 if (*cond_string
!= NULL
)
9697 xfree (*cond_string
);
9698 *cond_string
= NULL
;
9705 if (exp_string
!= NULL
)
9707 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
9708 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
9713 *ops
= ada_exception_breakption_ops (ex
);
9718 /* Parse the arguments (ARGS) of the "catch exception" command.
9720 Set TYPE to the appropriate exception catchpoint type.
9721 If the user asked the catchpoint to catch only a specific
9722 exception, then save the exception name in ADDR_STRING.
9724 See ada_exception_sal for a description of all the remaining
9725 function arguments of this function. */
9727 struct symtab_and_line
9728 ada_decode_exception_location (char *args
, char **addr_string
,
9729 char **exp_string
, char **cond_string
,
9730 struct expression
**cond
,
9731 struct breakpoint_ops
**ops
)
9733 enum exception_catchpoint_kind ex
;
9735 catch_ada_exception_command_split (args
, &ex
, exp_string
);
9736 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
9740 struct symtab_and_line
9741 ada_decode_assert_location (char *args
, char **addr_string
,
9742 struct breakpoint_ops
**ops
)
9744 /* Check that no argument where provided at the end of the command. */
9748 while (isspace (*args
))
9751 error (_("Junk at end of arguments."));
9754 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
9759 /* Information about operators given special treatment in functions
9761 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
9763 #define ADA_OPERATORS \
9764 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
9765 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
9766 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
9767 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
9768 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
9769 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
9770 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
9771 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
9772 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
9773 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
9774 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
9775 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
9776 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
9777 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
9778 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
9779 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
9780 OP_DEFN (OP_OTHERS, 1, 1, 0) \
9781 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
9782 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
9785 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
9787 switch (exp
->elts
[pc
- 1].opcode
)
9790 operator_length_standard (exp
, pc
, oplenp
, argsp
);
9793 #define OP_DEFN(op, len, args, binop) \
9794 case op: *oplenp = len; *argsp = args; break;
9800 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
9805 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
9811 ada_op_name (enum exp_opcode opcode
)
9816 return op_name_standard (opcode
);
9818 #define OP_DEFN(op, len, args, binop) case op: return #op;
9823 return "OP_AGGREGATE";
9825 return "OP_CHOICES";
9831 /* As for operator_length, but assumes PC is pointing at the first
9832 element of the operator, and gives meaningful results only for the
9833 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
9836 ada_forward_operator_length (struct expression
*exp
, int pc
,
9837 int *oplenp
, int *argsp
)
9839 switch (exp
->elts
[pc
].opcode
)
9842 *oplenp
= *argsp
= 0;
9845 #define OP_DEFN(op, len, args, binop) \
9846 case op: *oplenp = len; *argsp = args; break;
9852 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9857 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
9863 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9864 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
9872 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
9874 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
9879 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
9883 /* Ada attributes ('Foo). */
9890 case OP_ATR_MODULUS
:
9899 /* XXX: gdb_sprint_host_address, type_sprint */
9900 fprintf_filtered (stream
, _("Type @"));
9901 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
9902 fprintf_filtered (stream
, " (");
9903 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
9904 fprintf_filtered (stream
, ")");
9906 case BINOP_IN_BOUNDS
:
9907 fprintf_filtered (stream
, " (%d)",
9908 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
9910 case TERNOP_IN_RANGE
:
9915 case OP_DISCRETE_RANGE
:
9923 char *name
= &exp
->elts
[elt
+ 2].string
;
9924 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
9925 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
9930 return dump_subexp_body_standard (exp
, stream
, elt
);
9934 for (i
= 0; i
< nargs
; i
+= 1)
9935 elt
= dump_subexp (exp
, stream
, elt
);
9940 /* The Ada extension of print_subexp (q.v.). */
9943 ada_print_subexp (struct expression
*exp
, int *pos
,
9944 struct ui_file
*stream
, enum precedence prec
)
9946 int oplen
, nargs
, i
;
9948 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
9950 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9957 print_subexp_standard (exp
, pos
, stream
, prec
);
9961 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
9964 case BINOP_IN_BOUNDS
:
9965 /* XXX: sprint_subexp */
9966 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
9967 fputs_filtered (" in ", stream
);
9968 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
9969 fputs_filtered ("'range", stream
);
9970 if (exp
->elts
[pc
+ 1].longconst
> 1)
9971 fprintf_filtered (stream
, "(%ld)",
9972 (long) exp
->elts
[pc
+ 1].longconst
);
9975 case TERNOP_IN_RANGE
:
9976 if (prec
>= PREC_EQUAL
)
9977 fputs_filtered ("(", stream
);
9978 /* XXX: sprint_subexp */
9979 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
9980 fputs_filtered (" in ", stream
);
9981 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
9982 fputs_filtered (" .. ", stream
);
9983 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
9984 if (prec
>= PREC_EQUAL
)
9985 fputs_filtered (")", stream
);
9994 case OP_ATR_MODULUS
:
9999 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10001 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10002 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10006 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10007 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10011 for (tem
= 1; tem
< nargs
; tem
+= 1)
10013 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10014 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10016 fputs_filtered (")", stream
);
10021 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10022 fputs_filtered ("'(", stream
);
10023 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10024 fputs_filtered (")", stream
);
10027 case UNOP_IN_RANGE
:
10028 /* XXX: sprint_subexp */
10029 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10030 fputs_filtered (" in ", stream
);
10031 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10034 case OP_DISCRETE_RANGE
:
10035 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10036 fputs_filtered ("..", stream
);
10037 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10041 fputs_filtered ("others => ", stream
);
10042 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10046 for (i
= 0; i
< nargs
-1; i
+= 1)
10049 fputs_filtered ("|", stream
);
10050 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10052 fputs_filtered (" => ", stream
);
10053 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10056 case OP_POSITIONAL
:
10057 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10061 fputs_filtered ("(", stream
);
10062 for (i
= 0; i
< nargs
; i
+= 1)
10065 fputs_filtered (", ", stream
);
10066 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10068 fputs_filtered (")", stream
);
10073 /* Table mapping opcodes into strings for printing operators
10074 and precedences of the operators. */
10076 static const struct op_print ada_op_print_tab
[] = {
10077 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10078 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10079 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10080 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10081 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10082 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10083 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10084 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10085 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10086 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10087 {">", BINOP_GTR
, PREC_ORDER
, 0},
10088 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10089 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10090 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10091 {"+", BINOP_ADD
, PREC_ADD
, 0},
10092 {"-", BINOP_SUB
, PREC_ADD
, 0},
10093 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10094 {"*", BINOP_MUL
, PREC_MUL
, 0},
10095 {"/", BINOP_DIV
, PREC_MUL
, 0},
10096 {"rem", BINOP_REM
, PREC_MUL
, 0},
10097 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10098 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10099 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10100 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10101 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10102 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10103 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10104 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10105 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10106 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10107 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10111 /* Fundamental Ada Types */
10113 /* Create a fundamental Ada type using default reasonable for the current
10116 Some object/debugging file formats (DWARF version 1, COFF, etc) do not
10117 define fundamental types such as "int" or "double". Others (stabs or
10118 DWARF version 2, etc) do define fundamental types. For the formats which
10119 don't provide fundamental types, gdb can create such types using this
10122 FIXME: Some compilers distinguish explicitly signed integral types
10123 (signed short, signed int, signed long) from "regular" integral types
10124 (short, int, long) in the debugging information. There is some dis-
10125 agreement as to how useful this feature is. In particular, gcc does
10126 not support this. Also, only some debugging formats allow the
10127 distinction to be passed on to a debugger. For now, we always just
10128 use "short", "int", or "long" as the type name, for both the implicit
10129 and explicitly signed types. This also makes life easier for the
10130 gdb test suite since we don't have to account for the differences
10131 in output depending upon what the compiler and debugging format
10132 support. We will probably have to re-examine the issue when gdb
10133 starts taking it's fundamental type information directly from the
10134 debugging information supplied by the compiler. fnf@cygnus.com */
10136 static struct type
*
10137 ada_create_fundamental_type (struct objfile
*objfile
, int typeid)
10139 struct type
*type
= NULL
;
10144 /* FIXME: For now, if we are asked to produce a type not in this
10145 language, create the equivalent of a C integer type with the
10146 name "<?type?>". When all the dust settles from the type
10147 reconstruction work, this should probably become an error. */
10148 type
= init_type (TYPE_CODE_INT
,
10149 TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10150 0, "<?type?>", objfile
);
10151 warning (_("internal error: no Ada fundamental type %d"), typeid);
10154 type
= init_type (TYPE_CODE_VOID
,
10155 TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10156 0, "void", objfile
);
10159 type
= init_type (TYPE_CODE_INT
,
10160 TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10161 0, "character", objfile
);
10163 case FT_SIGNED_CHAR
:
10164 type
= init_type (TYPE_CODE_INT
,
10165 TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10166 0, "signed char", objfile
);
10168 case FT_UNSIGNED_CHAR
:
10169 type
= init_type (TYPE_CODE_INT
,
10170 TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10171 TYPE_FLAG_UNSIGNED
, "unsigned char", objfile
);
10174 type
= init_type (TYPE_CODE_INT
,
10175 TARGET_SHORT_BIT
/ TARGET_CHAR_BIT
,
10176 0, "short_integer", objfile
);
10178 case FT_SIGNED_SHORT
:
10179 type
= init_type (TYPE_CODE_INT
,
10180 TARGET_SHORT_BIT
/ TARGET_CHAR_BIT
,
10181 0, "short_integer", objfile
);
10183 case FT_UNSIGNED_SHORT
:
10184 type
= init_type (TYPE_CODE_INT
,
10185 TARGET_SHORT_BIT
/ TARGET_CHAR_BIT
,
10186 TYPE_FLAG_UNSIGNED
, "unsigned short", objfile
);
10189 type
= init_type (TYPE_CODE_INT
,
10190 TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10191 0, "integer", objfile
);
10193 case FT_SIGNED_INTEGER
:
10194 type
= init_type (TYPE_CODE_INT
, TARGET_INT_BIT
/
10196 0, "integer", objfile
); /* FIXME -fnf */
10198 case FT_UNSIGNED_INTEGER
:
10199 type
= init_type (TYPE_CODE_INT
,
10200 TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10201 TYPE_FLAG_UNSIGNED
, "unsigned int", objfile
);
10204 type
= init_type (TYPE_CODE_INT
,
10205 TARGET_LONG_BIT
/ TARGET_CHAR_BIT
,
10206 0, "long_integer", objfile
);
10208 case FT_SIGNED_LONG
:
10209 type
= init_type (TYPE_CODE_INT
,
10210 TARGET_LONG_BIT
/ TARGET_CHAR_BIT
,
10211 0, "long_integer", objfile
);
10213 case FT_UNSIGNED_LONG
:
10214 type
= init_type (TYPE_CODE_INT
,
10215 TARGET_LONG_BIT
/ TARGET_CHAR_BIT
,
10216 TYPE_FLAG_UNSIGNED
, "unsigned long", objfile
);
10219 type
= init_type (TYPE_CODE_INT
,
10220 TARGET_LONG_LONG_BIT
/ TARGET_CHAR_BIT
,
10221 0, "long_long_integer", objfile
);
10223 case FT_SIGNED_LONG_LONG
:
10224 type
= init_type (TYPE_CODE_INT
,
10225 TARGET_LONG_LONG_BIT
/ TARGET_CHAR_BIT
,
10226 0, "long_long_integer", objfile
);
10228 case FT_UNSIGNED_LONG_LONG
:
10229 type
= init_type (TYPE_CODE_INT
,
10230 TARGET_LONG_LONG_BIT
/ TARGET_CHAR_BIT
,
10231 TYPE_FLAG_UNSIGNED
, "unsigned long long", objfile
);
10234 type
= init_type (TYPE_CODE_FLT
,
10235 TARGET_FLOAT_BIT
/ TARGET_CHAR_BIT
,
10236 0, "float", objfile
);
10238 case FT_DBL_PREC_FLOAT
:
10239 type
= init_type (TYPE_CODE_FLT
,
10240 TARGET_DOUBLE_BIT
/ TARGET_CHAR_BIT
,
10241 0, "long_float", objfile
);
10243 case FT_EXT_PREC_FLOAT
:
10244 type
= init_type (TYPE_CODE_FLT
,
10245 TARGET_LONG_DOUBLE_BIT
/ TARGET_CHAR_BIT
,
10246 0, "long_long_float", objfile
);
10252 enum ada_primitive_types
{
10253 ada_primitive_type_int
,
10254 ada_primitive_type_long
,
10255 ada_primitive_type_short
,
10256 ada_primitive_type_char
,
10257 ada_primitive_type_float
,
10258 ada_primitive_type_double
,
10259 ada_primitive_type_void
,
10260 ada_primitive_type_long_long
,
10261 ada_primitive_type_long_double
,
10262 ada_primitive_type_natural
,
10263 ada_primitive_type_positive
,
10264 ada_primitive_type_system_address
,
10265 nr_ada_primitive_types
10269 ada_language_arch_info (struct gdbarch
*current_gdbarch
,
10270 struct language_arch_info
*lai
)
10272 const struct builtin_type
*builtin
= builtin_type (current_gdbarch
);
10273 lai
->primitive_type_vector
10274 = GDBARCH_OBSTACK_CALLOC (current_gdbarch
, nr_ada_primitive_types
+ 1,
10276 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10277 init_type (TYPE_CODE_INT
, TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10278 0, "integer", (struct objfile
*) NULL
);
10279 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10280 init_type (TYPE_CODE_INT
, TARGET_LONG_BIT
/ TARGET_CHAR_BIT
,
10281 0, "long_integer", (struct objfile
*) NULL
);
10282 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10283 init_type (TYPE_CODE_INT
, TARGET_SHORT_BIT
/ TARGET_CHAR_BIT
,
10284 0, "short_integer", (struct objfile
*) NULL
);
10285 lai
->string_char_type
=
10286 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10287 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10288 0, "character", (struct objfile
*) NULL
);
10289 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10290 init_type (TYPE_CODE_FLT
, TARGET_FLOAT_BIT
/ TARGET_CHAR_BIT
,
10291 0, "float", (struct objfile
*) NULL
);
10292 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10293 init_type (TYPE_CODE_FLT
, TARGET_DOUBLE_BIT
/ TARGET_CHAR_BIT
,
10294 0, "long_float", (struct objfile
*) NULL
);
10295 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10296 init_type (TYPE_CODE_INT
, TARGET_LONG_LONG_BIT
/ TARGET_CHAR_BIT
,
10297 0, "long_long_integer", (struct objfile
*) NULL
);
10298 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10299 init_type (TYPE_CODE_FLT
, TARGET_LONG_DOUBLE_BIT
/ TARGET_CHAR_BIT
,
10300 0, "long_long_float", (struct objfile
*) NULL
);
10301 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10302 init_type (TYPE_CODE_INT
, TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10303 0, "natural", (struct objfile
*) NULL
);
10304 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10305 init_type (TYPE_CODE_INT
, TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10306 0, "positive", (struct objfile
*) NULL
);
10307 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10309 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10310 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10311 (struct objfile
*) NULL
));
10312 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10313 = "system__address";
10316 /* Language vector */
10318 /* Not really used, but needed in the ada_language_defn. */
10321 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10323 ada_emit_char (c
, stream
, quoter
, 1);
10329 warnings_issued
= 0;
10330 return ada_parse ();
10333 static const struct exp_descriptor ada_exp_descriptor
= {
10335 ada_operator_length
,
10337 ada_dump_subexp_body
,
10338 ada_evaluate_subexp
10341 const struct language_defn ada_language_defn
= {
10342 "ada", /* Language name */
10347 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10348 that's not quite what this means. */
10350 &ada_exp_descriptor
,
10354 ada_printchar
, /* Print a character constant */
10355 ada_printstr
, /* Function to print string constant */
10356 emit_char
, /* Function to print single char (not used) */
10357 ada_create_fundamental_type
, /* Create fundamental type in this language */
10358 ada_print_type
, /* Print a type using appropriate syntax */
10359 ada_val_print
, /* Print a value using appropriate syntax */
10360 ada_value_print
, /* Print a top-level value */
10361 NULL
, /* Language specific skip_trampoline */
10362 NULL
, /* value_of_this */
10363 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10364 basic_lookup_transparent_type
, /* lookup_transparent_type */
10365 ada_la_decode
, /* Language specific symbol demangler */
10366 NULL
, /* Language specific class_name_from_physname */
10367 ada_op_print_tab
, /* expression operators for printing */
10368 0, /* c-style arrays */
10369 1, /* String lower bound */
10371 ada_get_gdb_completer_word_break_characters
,
10372 ada_language_arch_info
,
10373 ada_print_array_index
,
10378 _initialize_ada_language (void)
10380 add_language (&ada_language_defn
);
10382 varsize_limit
= 65536;
10384 obstack_init (&symbol_list_obstack
);
10386 decoded_names_store
= htab_create_alloc
10387 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
10388 NULL
, xcalloc
, xfree
);