1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007
4 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
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 void modify_general_field (char *, LONGEST
, int, int);
76 static struct type
*desc_base_type (struct type
*);
78 static struct type
*desc_bounds_type (struct type
*);
80 static struct value
*desc_bounds (struct value
*);
82 static int fat_pntr_bounds_bitpos (struct type
*);
84 static int fat_pntr_bounds_bitsize (struct type
*);
86 static struct type
*desc_data_type (struct type
*);
88 static struct value
*desc_data (struct value
*);
90 static int fat_pntr_data_bitpos (struct type
*);
92 static int fat_pntr_data_bitsize (struct type
*);
94 static struct value
*desc_one_bound (struct value
*, int, int);
96 static int desc_bound_bitpos (struct type
*, int, int);
98 static int desc_bound_bitsize (struct type
*, int, int);
100 static struct type
*desc_index_type (struct type
*, int);
102 static int desc_arity (struct type
*);
104 static int ada_type_match (struct type
*, struct type
*, int);
106 static int ada_args_match (struct symbol
*, struct value
**, int);
108 static struct value
*ensure_lval (struct value
*, CORE_ADDR
*);
110 static struct value
*convert_actual (struct value
*, struct type
*,
113 static struct value
*make_array_descriptor (struct type
*, struct value
*,
116 static void ada_add_block_symbols (struct obstack
*,
117 struct block
*, const char *,
118 domain_enum
, struct objfile
*,
119 struct symtab
*, int);
121 static int is_nonfunction (struct ada_symbol_info
*, int);
123 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
124 struct block
*, struct symtab
*);
126 static int num_defns_collected (struct obstack
*);
128 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
130 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
131 *, const char *, int,
134 static struct symtab
*symtab_for_sym (struct symbol
*);
136 static struct value
*resolve_subexp (struct expression
**, int *, int,
139 static void replace_operator_with_call (struct expression
**, int, int, int,
140 struct symbol
*, struct block
*);
142 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
144 static char *ada_op_name (enum exp_opcode
);
146 static const char *ada_decoded_op_name (enum exp_opcode
);
148 static int numeric_type_p (struct type
*);
150 static int integer_type_p (struct type
*);
152 static int scalar_type_p (struct type
*);
154 static int discrete_type_p (struct type
*);
156 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
159 static struct value
*evaluate_subexp (struct type
*, struct expression
*,
162 static struct value
*evaluate_subexp_type (struct expression
*, int *);
164 static int is_dynamic_field (struct type
*, int);
166 static struct type
*to_fixed_variant_branch_type (struct type
*,
168 CORE_ADDR
, struct value
*);
170 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
172 static struct type
*to_fixed_range_type (char *, struct value
*,
175 static struct type
*to_static_fixed_type (struct type
*);
177 static struct value
*unwrap_value (struct value
*);
179 static struct type
*packed_array_type (struct type
*, long *);
181 static struct type
*decode_packed_array_type (struct type
*);
183 static struct value
*decode_packed_array (struct value
*);
185 static struct value
*value_subscript_packed (struct value
*, int,
188 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int);
190 static struct value
*coerce_unspec_val_to_type (struct value
*,
193 static struct value
*get_var_value (char *, char *);
195 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
197 static int equiv_types (struct type
*, struct type
*);
199 static int is_name_suffix (const char *);
201 static int wild_match (const char *, int, const char *);
203 static struct value
*ada_coerce_ref (struct value
*);
205 static LONGEST
pos_atr (struct value
*);
207 static struct value
*value_pos_atr (struct value
*);
209 static struct value
*value_val_atr (struct type
*, struct value
*);
211 static struct symbol
*standard_lookup (const char *, const struct block
*,
214 static struct value
*ada_search_struct_field (char *, struct value
*, int,
217 static struct value
*ada_value_primitive_field (struct value
*, int, int,
220 static int find_struct_field (char *, struct type
*, int,
221 struct type
**, int *, int *, int *, int *);
223 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
226 static struct value
*ada_to_fixed_value (struct value
*);
228 static int ada_resolve_function (struct ada_symbol_info
*, int,
229 struct value
**, int, const char *,
232 static struct value
*ada_coerce_to_simple_array (struct value
*);
234 static int ada_is_direct_array_type (struct type
*);
236 static void ada_language_arch_info (struct gdbarch
*,
237 struct language_arch_info
*);
239 static void check_size (const struct type
*);
241 static struct value
*ada_index_struct_field (int, struct value
*, int,
244 static struct value
*assign_aggregate (struct value
*, struct value
*,
245 struct expression
*, int *, enum noside
);
247 static void aggregate_assign_from_choices (struct value
*, struct value
*,
249 int *, LONGEST
*, int *,
250 int, LONGEST
, LONGEST
);
252 static void aggregate_assign_positional (struct value
*, struct value
*,
254 int *, LONGEST
*, int *, int,
258 static void aggregate_assign_others (struct value
*, struct value
*,
260 int *, LONGEST
*, int, LONGEST
, LONGEST
);
263 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
266 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
269 static void ada_forward_operator_length (struct expression
*, int, int *,
274 /* Maximum-sized dynamic type. */
275 static unsigned int varsize_limit
;
277 /* FIXME: brobecker/2003-09-17: No longer a const because it is
278 returned by a function that does not return a const char *. */
279 static char *ada_completer_word_break_characters
=
281 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
283 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
286 /* The name of the symbol to use to get the name of the main subprogram. */
287 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
288 = "__gnat_ada_main_program_name";
290 /* Limit on the number of warnings to raise per expression evaluation. */
291 static int warning_limit
= 2;
293 /* Number of warning messages issued; reset to 0 by cleanups after
294 expression evaluation. */
295 static int warnings_issued
= 0;
297 static const char *known_runtime_file_name_patterns
[] = {
298 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
301 static const char *known_auxiliary_function_name_patterns
[] = {
302 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
305 /* Space for allocating results of ada_lookup_symbol_list. */
306 static struct obstack symbol_list_obstack
;
312 ada_get_gdb_completer_word_break_characters (void)
314 return ada_completer_word_break_characters
;
317 /* Print an array element index using the Ada syntax. */
320 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
321 int format
, enum val_prettyprint pretty
)
323 LA_VALUE_PRINT (index_value
, stream
, format
, pretty
);
324 fprintf_filtered (stream
, " => ");
327 /* Read the string located at ADDR from the inferior and store the
331 extract_string (CORE_ADDR addr
, char *buf
)
335 /* Loop, reading one byte at a time, until we reach the '\000'
336 end-of-string marker. */
339 target_read_memory (addr
+ char_index
* sizeof (char),
340 buf
+ char_index
* sizeof (char), sizeof (char));
343 while (buf
[char_index
- 1] != '\000');
346 /* Assuming VECT points to an array of *SIZE objects of size
347 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
348 updating *SIZE as necessary and returning the (new) array. */
351 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
353 if (*size
< min_size
)
356 if (*size
< min_size
)
358 vect
= xrealloc (vect
, *size
* element_size
);
363 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
364 suffix of FIELD_NAME beginning "___". */
367 field_name_match (const char *field_name
, const char *target
)
369 int len
= strlen (target
);
371 (strncmp (field_name
, target
, len
) == 0
372 && (field_name
[len
] == '\0'
373 || (strncmp (field_name
+ len
, "___", 3) == 0
374 && strcmp (field_name
+ strlen (field_name
) - 6,
379 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
380 FIELD_NAME, and return its index. This function also handles fields
381 whose name have ___ suffixes because the compiler sometimes alters
382 their name by adding such a suffix to represent fields with certain
383 constraints. If the field could not be found, return a negative
384 number if MAYBE_MISSING is set. Otherwise raise an error. */
387 ada_get_field_index (const struct type
*type
, const char *field_name
,
391 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (type
); fieldno
++)
392 if (field_name_match (TYPE_FIELD_NAME (type
, fieldno
), field_name
))
396 error (_("Unable to find field %s in struct %s. Aborting"),
397 field_name
, TYPE_NAME (type
));
402 /* The length of the prefix of NAME prior to any "___" suffix. */
405 ada_name_prefix_len (const char *name
)
411 const char *p
= strstr (name
, "___");
413 return strlen (name
);
419 /* Return non-zero if SUFFIX is a suffix of STR.
420 Return zero if STR is null. */
423 is_suffix (const char *str
, const char *suffix
)
429 len2
= strlen (suffix
);
430 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
433 /* Create a value of type TYPE whose contents come from VALADDR, if it
434 is non-null, and whose memory address (in the inferior) is
438 value_from_contents_and_address (struct type
*type
,
439 const gdb_byte
*valaddr
,
442 struct value
*v
= allocate_value (type
);
444 set_value_lazy (v
, 1);
446 memcpy (value_contents_raw (v
), valaddr
, TYPE_LENGTH (type
));
447 VALUE_ADDRESS (v
) = address
;
449 VALUE_LVAL (v
) = lval_memory
;
453 /* The contents of value VAL, treated as a value of type TYPE. The
454 result is an lval in memory if VAL is. */
456 static struct value
*
457 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
459 type
= ada_check_typedef (type
);
460 if (value_type (val
) == type
)
464 struct value
*result
;
466 /* Make sure that the object size is not unreasonable before
467 trying to allocate some memory for it. */
470 result
= allocate_value (type
);
471 VALUE_LVAL (result
) = VALUE_LVAL (val
);
472 set_value_bitsize (result
, value_bitsize (val
));
473 set_value_bitpos (result
, value_bitpos (val
));
474 VALUE_ADDRESS (result
) = VALUE_ADDRESS (val
) + value_offset (val
);
476 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
477 set_value_lazy (result
, 1);
479 memcpy (value_contents_raw (result
), value_contents (val
),
485 static const gdb_byte
*
486 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
491 return valaddr
+ offset
;
495 cond_offset_target (CORE_ADDR address
, long offset
)
500 return address
+ offset
;
503 /* Issue a warning (as for the definition of warning in utils.c, but
504 with exactly one argument rather than ...), unless the limit on the
505 number of warnings has passed during the evaluation of the current
508 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
509 provided by "complaint". */
510 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
513 lim_warning (const char *format
, ...)
516 va_start (args
, format
);
518 warnings_issued
+= 1;
519 if (warnings_issued
<= warning_limit
)
520 vwarning (format
, args
);
525 /* Issue an error if the size of an object of type T is unreasonable,
526 i.e. if it would be a bad idea to allocate a value of this type in
530 check_size (const struct type
*type
)
532 if (TYPE_LENGTH (type
) > varsize_limit
)
533 error (_("object size is larger than varsize-limit"));
537 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
538 gdbtypes.h, but some of the necessary definitions in that file
539 seem to have gone missing. */
541 /* Maximum value of a SIZE-byte signed integer type. */
543 max_of_size (int size
)
545 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
546 return top_bit
| (top_bit
- 1);
549 /* Minimum value of a SIZE-byte signed integer type. */
551 min_of_size (int size
)
553 return -max_of_size (size
) - 1;
556 /* Maximum value of a SIZE-byte unsigned integer type. */
558 umax_of_size (int size
)
560 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
561 return top_bit
| (top_bit
- 1);
564 /* Maximum value of integral type T, as a signed quantity. */
566 max_of_type (struct type
*t
)
568 if (TYPE_UNSIGNED (t
))
569 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
571 return max_of_size (TYPE_LENGTH (t
));
574 /* Minimum value of integral type T, as a signed quantity. */
576 min_of_type (struct type
*t
)
578 if (TYPE_UNSIGNED (t
))
581 return min_of_size (TYPE_LENGTH (t
));
584 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
585 static struct value
*
586 discrete_type_high_bound (struct type
*type
)
588 switch (TYPE_CODE (type
))
590 case TYPE_CODE_RANGE
:
591 return value_from_longest (TYPE_TARGET_TYPE (type
),
592 TYPE_HIGH_BOUND (type
));
595 value_from_longest (type
,
596 TYPE_FIELD_BITPOS (type
,
597 TYPE_NFIELDS (type
) - 1));
599 return value_from_longest (type
, max_of_type (type
));
601 error (_("Unexpected type in discrete_type_high_bound."));
605 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
606 static struct value
*
607 discrete_type_low_bound (struct type
*type
)
609 switch (TYPE_CODE (type
))
611 case TYPE_CODE_RANGE
:
612 return value_from_longest (TYPE_TARGET_TYPE (type
),
613 TYPE_LOW_BOUND (type
));
615 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, 0));
617 return value_from_longest (type
, min_of_type (type
));
619 error (_("Unexpected type in discrete_type_low_bound."));
623 /* The identity on non-range types. For range types, the underlying
624 non-range scalar type. */
627 base_type (struct type
*type
)
629 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
631 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
633 type
= TYPE_TARGET_TYPE (type
);
639 /* Language Selection */
641 /* If the main program is in Ada, return language_ada, otherwise return LANG
642 (the main program is in Ada iif the adainit symbol is found).
644 MAIN_PST is not used. */
647 ada_update_initial_language (enum language lang
,
648 struct partial_symtab
*main_pst
)
650 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
651 (struct objfile
*) NULL
) != NULL
)
657 /* If the main procedure is written in Ada, then return its name.
658 The result is good until the next call. Return NULL if the main
659 procedure doesn't appear to be in Ada. */
664 struct minimal_symbol
*msym
;
665 CORE_ADDR main_program_name_addr
;
666 static char main_program_name
[1024];
668 /* For Ada, the name of the main procedure is stored in a specific
669 string constant, generated by the binder. Look for that symbol,
670 extract its address, and then read that string. If we didn't find
671 that string, then most probably the main procedure is not written
673 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
677 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
678 if (main_program_name_addr
== 0)
679 error (_("Invalid address for Ada main program name."));
681 extract_string (main_program_name_addr
, main_program_name
);
682 return main_program_name
;
685 /* The main procedure doesn't seem to be in Ada. */
691 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
694 const struct ada_opname_map ada_opname_table
[] = {
695 {"Oadd", "\"+\"", BINOP_ADD
},
696 {"Osubtract", "\"-\"", BINOP_SUB
},
697 {"Omultiply", "\"*\"", BINOP_MUL
},
698 {"Odivide", "\"/\"", BINOP_DIV
},
699 {"Omod", "\"mod\"", BINOP_MOD
},
700 {"Orem", "\"rem\"", BINOP_REM
},
701 {"Oexpon", "\"**\"", BINOP_EXP
},
702 {"Olt", "\"<\"", BINOP_LESS
},
703 {"Ole", "\"<=\"", BINOP_LEQ
},
704 {"Ogt", "\">\"", BINOP_GTR
},
705 {"Oge", "\">=\"", BINOP_GEQ
},
706 {"Oeq", "\"=\"", BINOP_EQUAL
},
707 {"One", "\"/=\"", BINOP_NOTEQUAL
},
708 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
709 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
710 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
711 {"Oconcat", "\"&\"", BINOP_CONCAT
},
712 {"Oabs", "\"abs\"", UNOP_ABS
},
713 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
714 {"Oadd", "\"+\"", UNOP_PLUS
},
715 {"Osubtract", "\"-\"", UNOP_NEG
},
719 /* Return non-zero if STR should be suppressed in info listings. */
722 is_suppressed_name (const char *str
)
724 if (strncmp (str
, "_ada_", 5) == 0)
726 if (str
[0] == '_' || str
[0] == '\000')
731 const char *suffix
= strstr (str
, "___");
732 if (suffix
!= NULL
&& suffix
[3] != 'X')
735 suffix
= str
+ strlen (str
);
736 for (p
= suffix
- 1; p
!= str
; p
-= 1)
740 if (p
[0] == 'X' && p
[-1] != '_')
744 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
745 if (strncmp (ada_opname_table
[i
].encoded
, p
,
746 strlen (ada_opname_table
[i
].encoded
)) == 0)
755 /* The "encoded" form of DECODED, according to GNAT conventions.
756 The result is valid until the next call to ada_encode. */
759 ada_encode (const char *decoded
)
761 static char *encoding_buffer
= NULL
;
762 static size_t encoding_buffer_size
= 0;
769 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
770 2 * strlen (decoded
) + 10);
773 for (p
= decoded
; *p
!= '\0'; p
+= 1)
775 if (!ADA_RETAIN_DOTS
&& *p
== '.')
777 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
782 const struct ada_opname_map
*mapping
;
784 for (mapping
= ada_opname_table
;
785 mapping
->encoded
!= NULL
786 && strncmp (mapping
->decoded
, p
,
787 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
789 if (mapping
->encoded
== NULL
)
790 error (_("invalid Ada operator name: %s"), p
);
791 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
792 k
+= strlen (mapping
->encoded
);
797 encoding_buffer
[k
] = *p
;
802 encoding_buffer
[k
] = '\0';
803 return encoding_buffer
;
806 /* Return NAME folded to lower case, or, if surrounded by single
807 quotes, unfolded, but with the quotes stripped away. Result good
811 ada_fold_name (const char *name
)
813 static char *fold_buffer
= NULL
;
814 static size_t fold_buffer_size
= 0;
816 int len
= strlen (name
);
817 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
821 strncpy (fold_buffer
, name
+ 1, len
- 2);
822 fold_buffer
[len
- 2] = '\000';
827 for (i
= 0; i
<= len
; i
+= 1)
828 fold_buffer
[i
] = tolower (name
[i
]);
834 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
837 is_lower_alphanum (const char c
)
839 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
843 . Discard trailing .{DIGIT}+, ${DIGIT}+ or ___{DIGIT}+
844 These are suffixes introduced by GNAT5 to nested subprogram
845 names, and do not serve any purpose for the debugger.
846 . Discard final __{DIGIT}+ or $({DIGIT}+(__{DIGIT}+)*)
847 . Discard final N if it follows a lowercase alphanumeric character
848 (protected object subprogram suffix)
849 . Convert other instances of embedded "__" to `.'.
850 . Discard leading _ada_.
851 . Convert operator names to the appropriate quoted symbols.
852 . Remove everything after first ___ if it is followed by
854 . Replace TK__ with __, and a trailing B or TKB with nothing.
855 . Replace _[EB]{DIGIT}+[sb] with nothing (protected object entries)
856 . Put symbols that should be suppressed in <...> brackets.
857 . Remove trailing X[bn]* suffix (indicating names in package bodies).
859 The resulting string is valid until the next call of ada_decode.
860 If the string is unchanged by demangling, the original string pointer
864 ada_decode (const char *encoded
)
871 static char *decoding_buffer
= NULL
;
872 static size_t decoding_buffer_size
= 0;
874 if (strncmp (encoded
, "_ada_", 5) == 0)
877 if (encoded
[0] == '_' || encoded
[0] == '<')
880 /* Remove trailing .{DIGIT}+ or ___{DIGIT}+ or __{DIGIT}+. */
881 len0
= strlen (encoded
);
882 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
885 while (i
> 0 && isdigit (encoded
[i
]))
887 if (i
>= 0 && encoded
[i
] == '.')
889 else if (i
>= 0 && encoded
[i
] == '$')
891 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
893 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
897 /* Remove trailing N. */
899 /* Protected entry subprograms are broken into two
900 separate subprograms: The first one is unprotected, and has
901 a 'N' suffix; the second is the protected version, and has
902 the 'P' suffix. The second calls the first one after handling
903 the protection. Since the P subprograms are internally generated,
904 we leave these names undecoded, giving the user a clue that this
905 entity is internal. */
908 && encoded
[len0
- 1] == 'N'
909 && (isdigit (encoded
[len0
- 2]) || islower (encoded
[len0
- 2])))
912 /* Remove the ___X.* suffix if present. Do not forget to verify that
913 the suffix is located before the current "end" of ENCODED. We want
914 to avoid re-matching parts of ENCODED that have previously been
915 marked as discarded (by decrementing LEN0). */
916 p
= strstr (encoded
, "___");
917 if (p
!= NULL
&& p
- encoded
< len0
- 3)
925 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
928 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
931 /* Make decoded big enough for possible expansion by operator name. */
932 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
933 decoded
= decoding_buffer
;
935 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
938 while ((i
>= 0 && isdigit (encoded
[i
]))
939 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
941 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
943 else if (encoded
[i
] == '$')
947 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
948 decoded
[j
] = encoded
[i
];
953 if (at_start_name
&& encoded
[i
] == 'O')
956 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
958 int op_len
= strlen (ada_opname_table
[k
].encoded
);
959 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
961 && !isalnum (encoded
[i
+ op_len
]))
963 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
966 j
+= strlen (ada_opname_table
[k
].decoded
);
970 if (ada_opname_table
[k
].encoded
!= NULL
)
975 /* Replace "TK__" with "__", which will eventually be translated
976 into "." (just below). */
978 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
981 /* Remove _E{DIGITS}+[sb] */
983 /* Just as for protected object subprograms, there are 2 categories
984 of subprograms created by the compiler for each entry. The first
985 one implements the actual entry code, and has a suffix following
986 the convention above; the second one implements the barrier and
987 uses the same convention as above, except that the 'E' is replaced
990 Just as above, we do not decode the name of barrier functions
991 to give the user a clue that the code he is debugging has been
992 internally generated. */
994 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
995 && isdigit (encoded
[i
+2]))
999 while (k
< len0
&& isdigit (encoded
[k
]))
1003 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1006 /* Just as an extra precaution, make sure that if this
1007 suffix is followed by anything else, it is a '_'.
1008 Otherwise, we matched this sequence by accident. */
1010 || (k
< len0
&& encoded
[k
] == '_'))
1015 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1016 the GNAT front-end in protected object subprograms. */
1019 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1021 /* Backtrack a bit up until we reach either the begining of
1022 the encoded name, or "__". Make sure that we only find
1023 digits or lowercase characters. */
1024 const char *ptr
= encoded
+ i
- 1;
1026 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1029 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1033 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1037 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1041 else if (!ADA_RETAIN_DOTS
1042 && i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1051 decoded
[j
] = encoded
[i
];
1056 decoded
[j
] = '\000';
1058 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1059 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1062 if (strcmp (decoded
, encoded
) == 0)
1068 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1069 decoded
= decoding_buffer
;
1070 if (encoded
[0] == '<')
1071 strcpy (decoded
, encoded
);
1073 sprintf (decoded
, "<%s>", encoded
);
1078 /* Table for keeping permanent unique copies of decoded names. Once
1079 allocated, names in this table are never released. While this is a
1080 storage leak, it should not be significant unless there are massive
1081 changes in the set of decoded names in successive versions of a
1082 symbol table loaded during a single session. */
1083 static struct htab
*decoded_names_store
;
1085 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1086 in the language-specific part of GSYMBOL, if it has not been
1087 previously computed. Tries to save the decoded name in the same
1088 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1089 in any case, the decoded symbol has a lifetime at least that of
1091 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1092 const, but nevertheless modified to a semantically equivalent form
1093 when a decoded name is cached in it.
1097 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1100 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1101 if (*resultp
== NULL
)
1103 const char *decoded
= ada_decode (gsymbol
->name
);
1104 if (gsymbol
->bfd_section
!= NULL
)
1106 bfd
*obfd
= gsymbol
->bfd_section
->owner
;
1109 struct objfile
*objf
;
1112 if (obfd
== objf
->obfd
)
1114 *resultp
= obsavestring (decoded
, strlen (decoded
),
1115 &objf
->objfile_obstack
);
1121 /* Sometimes, we can't find a corresponding objfile, in which
1122 case, we put the result on the heap. Since we only decode
1123 when needed, we hope this usually does not cause a
1124 significant memory leak (FIXME). */
1125 if (*resultp
== NULL
)
1127 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1130 *slot
= xstrdup (decoded
);
1139 ada_la_decode (const char *encoded
, int options
)
1141 return xstrdup (ada_decode (encoded
));
1144 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1145 suffixes that encode debugging information or leading _ada_ on
1146 SYM_NAME (see is_name_suffix commentary for the debugging
1147 information that is ignored). If WILD, then NAME need only match a
1148 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1149 either argument is NULL. */
1152 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1154 if (sym_name
== NULL
|| name
== NULL
)
1157 return wild_match (name
, strlen (name
), sym_name
);
1160 int len_name
= strlen (name
);
1161 return (strncmp (sym_name
, name
, len_name
) == 0
1162 && is_name_suffix (sym_name
+ len_name
))
1163 || (strncmp (sym_name
, "_ada_", 5) == 0
1164 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1165 && is_name_suffix (sym_name
+ len_name
+ 5));
1169 /* True (non-zero) iff, in Ada mode, the symbol SYM should be
1170 suppressed in info listings. */
1173 ada_suppress_symbol_printing (struct symbol
*sym
)
1175 if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
)
1178 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym
));
1184 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1186 static char *bound_name
[] = {
1187 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1188 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1191 /* Maximum number of array dimensions we are prepared to handle. */
1193 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1195 /* Like modify_field, but allows bitpos > wordlength. */
1198 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1200 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1204 /* The desc_* routines return primitive portions of array descriptors
1207 /* The descriptor or array type, if any, indicated by TYPE; removes
1208 level of indirection, if needed. */
1210 static struct type
*
1211 desc_base_type (struct type
*type
)
1215 type
= ada_check_typedef (type
);
1217 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1218 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1219 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1224 /* True iff TYPE indicates a "thin" array pointer type. */
1227 is_thin_pntr (struct type
*type
)
1230 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1231 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1234 /* The descriptor type for thin pointer type TYPE. */
1236 static struct type
*
1237 thin_descriptor_type (struct type
*type
)
1239 struct type
*base_type
= desc_base_type (type
);
1240 if (base_type
== NULL
)
1242 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1246 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1247 if (alt_type
== NULL
)
1254 /* A pointer to the array data for thin-pointer value VAL. */
1256 static struct value
*
1257 thin_data_pntr (struct value
*val
)
1259 struct type
*type
= value_type (val
);
1260 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1261 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1264 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1265 VALUE_ADDRESS (val
) + value_offset (val
));
1268 /* True iff TYPE indicates a "thick" array pointer type. */
1271 is_thick_pntr (struct type
*type
)
1273 type
= desc_base_type (type
);
1274 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1275 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1278 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1279 pointer to one, the type of its bounds data; otherwise, NULL. */
1281 static struct type
*
1282 desc_bounds_type (struct type
*type
)
1286 type
= desc_base_type (type
);
1290 else if (is_thin_pntr (type
))
1292 type
= thin_descriptor_type (type
);
1295 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1297 return ada_check_typedef (r
);
1299 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1301 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1303 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1308 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1309 one, a pointer to its bounds data. Otherwise NULL. */
1311 static struct value
*
1312 desc_bounds (struct value
*arr
)
1314 struct type
*type
= ada_check_typedef (value_type (arr
));
1315 if (is_thin_pntr (type
))
1317 struct type
*bounds_type
=
1318 desc_bounds_type (thin_descriptor_type (type
));
1321 if (bounds_type
== NULL
)
1322 error (_("Bad GNAT array descriptor"));
1324 /* NOTE: The following calculation is not really kosher, but
1325 since desc_type is an XVE-encoded type (and shouldn't be),
1326 the correct calculation is a real pain. FIXME (and fix GCC). */
1327 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1328 addr
= value_as_long (arr
);
1330 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1333 value_from_longest (lookup_pointer_type (bounds_type
),
1334 addr
- TYPE_LENGTH (bounds_type
));
1337 else if (is_thick_pntr (type
))
1338 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1339 _("Bad GNAT array descriptor"));
1344 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1345 position of the field containing the address of the bounds data. */
1348 fat_pntr_bounds_bitpos (struct type
*type
)
1350 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1353 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1354 size of the field containing the address of the bounds data. */
1357 fat_pntr_bounds_bitsize (struct type
*type
)
1359 type
= desc_base_type (type
);
1361 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1362 return TYPE_FIELD_BITSIZE (type
, 1);
1364 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1367 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1368 pointer to one, the type of its array data (a
1369 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1370 ada_type_of_array to get an array type with bounds data. */
1372 static struct type
*
1373 desc_data_type (struct type
*type
)
1375 type
= desc_base_type (type
);
1377 /* NOTE: The following is bogus; see comment in desc_bounds. */
1378 if (is_thin_pntr (type
))
1379 return lookup_pointer_type
1380 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1381 else if (is_thick_pntr (type
))
1382 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1387 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1390 static struct value
*
1391 desc_data (struct value
*arr
)
1393 struct type
*type
= value_type (arr
);
1394 if (is_thin_pntr (type
))
1395 return thin_data_pntr (arr
);
1396 else if (is_thick_pntr (type
))
1397 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1398 _("Bad GNAT array descriptor"));
1404 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1405 position of the field containing the address of the data. */
1408 fat_pntr_data_bitpos (struct type
*type
)
1410 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1413 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1414 size of the field containing the address of the data. */
1417 fat_pntr_data_bitsize (struct type
*type
)
1419 type
= desc_base_type (type
);
1421 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1422 return TYPE_FIELD_BITSIZE (type
, 0);
1424 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1427 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1428 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1429 bound, if WHICH is 1. The first bound is I=1. */
1431 static struct value
*
1432 desc_one_bound (struct value
*bounds
, int i
, int which
)
1434 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1435 _("Bad GNAT array descriptor bounds"));
1438 /* If BOUNDS is an array-bounds structure type, return the bit position
1439 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1440 bound, if WHICH is 1. The first bound is I=1. */
1443 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1445 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1448 /* If BOUNDS is an array-bounds structure type, return the bit field size
1449 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1450 bound, if WHICH is 1. The first bound is I=1. */
1453 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1455 type
= desc_base_type (type
);
1457 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1458 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1460 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1463 /* If TYPE is the type of an array-bounds structure, the type of its
1464 Ith bound (numbering from 1). Otherwise, NULL. */
1466 static struct type
*
1467 desc_index_type (struct type
*type
, int i
)
1469 type
= desc_base_type (type
);
1471 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1472 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1477 /* The number of index positions in the array-bounds type TYPE.
1478 Return 0 if TYPE is NULL. */
1481 desc_arity (struct type
*type
)
1483 type
= desc_base_type (type
);
1486 return TYPE_NFIELDS (type
) / 2;
1490 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1491 an array descriptor type (representing an unconstrained array
1495 ada_is_direct_array_type (struct type
*type
)
1499 type
= ada_check_typedef (type
);
1500 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1501 || ada_is_array_descriptor_type (type
));
1504 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1508 ada_is_array_type (struct type
*type
)
1511 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1512 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1513 type
= TYPE_TARGET_TYPE (type
);
1514 return ada_is_direct_array_type (type
);
1517 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1520 ada_is_simple_array_type (struct type
*type
)
1524 type
= ada_check_typedef (type
);
1525 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1526 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1527 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1530 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1533 ada_is_array_descriptor_type (struct type
*type
)
1535 struct type
*data_type
= desc_data_type (type
);
1539 type
= ada_check_typedef (type
);
1542 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1543 && TYPE_TARGET_TYPE (data_type
) != NULL
1544 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1545 || TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1546 && desc_arity (desc_bounds_type (type
)) > 0;
1549 /* Non-zero iff type is a partially mal-formed GNAT array
1550 descriptor. FIXME: This is to compensate for some problems with
1551 debugging output from GNAT. Re-examine periodically to see if it
1555 ada_is_bogus_array_descriptor (struct type
*type
)
1559 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1560 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1561 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1562 && !ada_is_array_descriptor_type (type
);
1566 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1567 (fat pointer) returns the type of the array data described---specifically,
1568 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1569 in from the descriptor; otherwise, they are left unspecified. If
1570 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1571 returns NULL. The result is simply the type of ARR if ARR is not
1574 ada_type_of_array (struct value
*arr
, int bounds
)
1576 if (ada_is_packed_array_type (value_type (arr
)))
1577 return decode_packed_array_type (value_type (arr
));
1579 if (!ada_is_array_descriptor_type (value_type (arr
)))
1580 return value_type (arr
);
1584 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr
))));
1587 struct type
*elt_type
;
1589 struct value
*descriptor
;
1590 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1592 elt_type
= ada_array_element_type (value_type (arr
), -1);
1593 arity
= ada_array_arity (value_type (arr
));
1595 if (elt_type
== NULL
|| arity
== 0)
1596 return ada_check_typedef (value_type (arr
));
1598 descriptor
= desc_bounds (arr
);
1599 if (value_as_long (descriptor
) == 0)
1603 struct type
*range_type
= alloc_type (objf
);
1604 struct type
*array_type
= alloc_type (objf
);
1605 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1606 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1609 create_range_type (range_type
, value_type (low
),
1610 longest_to_int (value_as_long (low
)),
1611 longest_to_int (value_as_long (high
)));
1612 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1615 return lookup_pointer_type (elt_type
);
1619 /* If ARR does not represent an array, returns ARR unchanged.
1620 Otherwise, returns either a standard GDB array with bounds set
1621 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1622 GDB array. Returns NULL if ARR is a null fat pointer. */
1625 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1627 if (ada_is_array_descriptor_type (value_type (arr
)))
1629 struct type
*arrType
= ada_type_of_array (arr
, 1);
1630 if (arrType
== NULL
)
1632 return value_cast (arrType
, value_copy (desc_data (arr
)));
1634 else if (ada_is_packed_array_type (value_type (arr
)))
1635 return decode_packed_array (arr
);
1640 /* If ARR does not represent an array, returns ARR unchanged.
1641 Otherwise, returns a standard GDB array describing ARR (which may
1642 be ARR itself if it already is in the proper form). */
1644 static struct value
*
1645 ada_coerce_to_simple_array (struct value
*arr
)
1647 if (ada_is_array_descriptor_type (value_type (arr
)))
1649 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1651 error (_("Bounds unavailable for null array pointer."));
1652 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1653 return value_ind (arrVal
);
1655 else if (ada_is_packed_array_type (value_type (arr
)))
1656 return decode_packed_array (arr
);
1661 /* If TYPE represents a GNAT array type, return it translated to an
1662 ordinary GDB array type (possibly with BITSIZE fields indicating
1663 packing). For other types, is the identity. */
1666 ada_coerce_to_simple_array_type (struct type
*type
)
1668 struct value
*mark
= value_mark ();
1669 struct value
*dummy
= value_from_longest (builtin_type_long
, 0);
1670 struct type
*result
;
1671 deprecated_set_value_type (dummy
, type
);
1672 result
= ada_type_of_array (dummy
, 0);
1673 value_free_to_mark (mark
);
1677 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1680 ada_is_packed_array_type (struct type
*type
)
1684 type
= desc_base_type (type
);
1685 type
= ada_check_typedef (type
);
1687 ada_type_name (type
) != NULL
1688 && strstr (ada_type_name (type
), "___XP") != NULL
;
1691 /* Given that TYPE is a standard GDB array type with all bounds filled
1692 in, and that the element size of its ultimate scalar constituents
1693 (that is, either its elements, or, if it is an array of arrays, its
1694 elements' elements, etc.) is *ELT_BITS, return an identical type,
1695 but with the bit sizes of its elements (and those of any
1696 constituent arrays) recorded in the BITSIZE components of its
1697 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1700 static struct type
*
1701 packed_array_type (struct type
*type
, long *elt_bits
)
1703 struct type
*new_elt_type
;
1704 struct type
*new_type
;
1705 LONGEST low_bound
, high_bound
;
1707 type
= ada_check_typedef (type
);
1708 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1711 new_type
= alloc_type (TYPE_OBJFILE (type
));
1712 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1714 create_array_type (new_type
, new_elt_type
, TYPE_FIELD_TYPE (type
, 0));
1715 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1716 TYPE_NAME (new_type
) = ada_type_name (type
);
1718 if (get_discrete_bounds (TYPE_FIELD_TYPE (type
, 0),
1719 &low_bound
, &high_bound
) < 0)
1720 low_bound
= high_bound
= 0;
1721 if (high_bound
< low_bound
)
1722 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1725 *elt_bits
*= (high_bound
- low_bound
+ 1);
1726 TYPE_LENGTH (new_type
) =
1727 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1730 TYPE_FLAGS (new_type
) |= TYPE_FLAG_FIXED_INSTANCE
;
1734 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1736 static struct type
*
1737 decode_packed_array_type (struct type
*type
)
1740 struct block
**blocks
;
1741 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
1742 char *name
= (char *) alloca (strlen (raw_name
) + 1);
1743 char *tail
= strstr (raw_name
, "___XP");
1744 struct type
*shadow_type
;
1748 type
= desc_base_type (type
);
1750 memcpy (name
, raw_name
, tail
- raw_name
);
1751 name
[tail
- raw_name
] = '\000';
1753 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1754 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1756 lim_warning (_("could not find bounds information on packed array"));
1759 shadow_type
= SYMBOL_TYPE (sym
);
1761 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1763 lim_warning (_("could not understand bounds information on packed array"));
1767 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1770 (_("could not understand bit size information on packed array"));
1774 return packed_array_type (shadow_type
, &bits
);
1777 /* Given that ARR is a struct value *indicating a GNAT packed array,
1778 returns a simple array that denotes that array. Its type is a
1779 standard GDB array type except that the BITSIZEs of the array
1780 target types are set to the number of bits in each element, and the
1781 type length is set appropriately. */
1783 static struct value
*
1784 decode_packed_array (struct value
*arr
)
1788 arr
= ada_coerce_ref (arr
);
1789 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1790 arr
= ada_value_ind (arr
);
1792 type
= decode_packed_array_type (value_type (arr
));
1795 error (_("can't unpack array"));
1799 if (BITS_BIG_ENDIAN
&& ada_is_modular_type (value_type (arr
)))
1801 /* This is a (right-justified) modular type representing a packed
1802 array with no wrapper. In order to interpret the value through
1803 the (left-justified) packed array type we just built, we must
1804 first left-justify it. */
1805 int bit_size
, bit_pos
;
1808 mod
= ada_modulus (value_type (arr
)) - 1;
1815 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1816 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1817 bit_pos
/ HOST_CHAR_BIT
,
1818 bit_pos
% HOST_CHAR_BIT
,
1823 return coerce_unspec_val_to_type (arr
, type
);
1827 /* The value of the element of packed array ARR at the ARITY indices
1828 given in IND. ARR must be a simple array. */
1830 static struct value
*
1831 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1834 int bits
, elt_off
, bit_off
;
1835 long elt_total_bit_offset
;
1836 struct type
*elt_type
;
1840 elt_total_bit_offset
= 0;
1841 elt_type
= ada_check_typedef (value_type (arr
));
1842 for (i
= 0; i
< arity
; i
+= 1)
1844 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1845 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1847 (_("attempt to do packed indexing of something other than a packed array"));
1850 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1851 LONGEST lowerbound
, upperbound
;
1854 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1856 lim_warning (_("don't know bounds of array"));
1857 lowerbound
= upperbound
= 0;
1860 idx
= value_as_long (value_pos_atr (ind
[i
]));
1861 if (idx
< lowerbound
|| idx
> upperbound
)
1862 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1863 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1864 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1865 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1868 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1869 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1871 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1876 /* Non-zero iff TYPE includes negative integer values. */
1879 has_negatives (struct type
*type
)
1881 switch (TYPE_CODE (type
))
1886 return !TYPE_UNSIGNED (type
);
1887 case TYPE_CODE_RANGE
:
1888 return TYPE_LOW_BOUND (type
) < 0;
1893 /* Create a new value of type TYPE from the contents of OBJ starting
1894 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1895 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1896 assigning through the result will set the field fetched from.
1897 VALADDR is ignored unless OBJ is NULL, in which case,
1898 VALADDR+OFFSET must address the start of storage containing the
1899 packed value. The value returned in this case is never an lval.
1900 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1903 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1904 long offset
, int bit_offset
, int bit_size
,
1908 int src
, /* Index into the source area */
1909 targ
, /* Index into the target area */
1910 srcBitsLeft
, /* Number of source bits left to move */
1911 nsrc
, ntarg
, /* Number of source and target bytes */
1912 unusedLS
, /* Number of bits in next significant
1913 byte of source that are unused */
1914 accumSize
; /* Number of meaningful bits in accum */
1915 unsigned char *bytes
; /* First byte containing data to unpack */
1916 unsigned char *unpacked
;
1917 unsigned long accum
; /* Staging area for bits being transferred */
1919 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1920 /* Transmit bytes from least to most significant; delta is the direction
1921 the indices move. */
1922 int delta
= BITS_BIG_ENDIAN
? -1 : 1;
1924 type
= ada_check_typedef (type
);
1928 v
= allocate_value (type
);
1929 bytes
= (unsigned char *) (valaddr
+ offset
);
1931 else if (value_lazy (obj
))
1934 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
1935 bytes
= (unsigned char *) alloca (len
);
1936 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
1940 v
= allocate_value (type
);
1941 bytes
= (unsigned char *) value_contents (obj
) + offset
;
1946 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
1947 if (VALUE_LVAL (obj
) == lval_internalvar
)
1948 VALUE_LVAL (v
) = lval_internalvar_component
;
1949 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
;
1950 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
1951 set_value_bitsize (v
, bit_size
);
1952 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
1954 VALUE_ADDRESS (v
) += 1;
1955 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
1959 set_value_bitsize (v
, bit_size
);
1960 unpacked
= (unsigned char *) value_contents (v
);
1962 srcBitsLeft
= bit_size
;
1964 ntarg
= TYPE_LENGTH (type
);
1968 memset (unpacked
, 0, TYPE_LENGTH (type
));
1971 else if (BITS_BIG_ENDIAN
)
1974 if (has_negatives (type
)
1975 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
1979 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
1982 switch (TYPE_CODE (type
))
1984 case TYPE_CODE_ARRAY
:
1985 case TYPE_CODE_UNION
:
1986 case TYPE_CODE_STRUCT
:
1987 /* Non-scalar values must be aligned at a byte boundary... */
1989 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
1990 /* ... And are placed at the beginning (most-significant) bytes
1992 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
1996 targ
= TYPE_LENGTH (type
) - 1;
2002 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2005 unusedLS
= bit_offset
;
2008 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2015 /* Mask for removing bits of the next source byte that are not
2016 part of the value. */
2017 unsigned int unusedMSMask
=
2018 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2020 /* Sign-extend bits for this byte. */
2021 unsigned int signMask
= sign
& ~unusedMSMask
;
2023 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2024 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2025 if (accumSize
>= HOST_CHAR_BIT
)
2027 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2028 accumSize
-= HOST_CHAR_BIT
;
2029 accum
>>= HOST_CHAR_BIT
;
2033 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2040 accum
|= sign
<< accumSize
;
2041 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2042 accumSize
-= HOST_CHAR_BIT
;
2043 accum
>>= HOST_CHAR_BIT
;
2051 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2052 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2055 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2056 int src_offset
, int n
)
2058 unsigned int accum
, mask
;
2059 int accum_bits
, chunk_size
;
2061 target
+= targ_offset
/ HOST_CHAR_BIT
;
2062 targ_offset
%= HOST_CHAR_BIT
;
2063 source
+= src_offset
/ HOST_CHAR_BIT
;
2064 src_offset
%= HOST_CHAR_BIT
;
2065 if (BITS_BIG_ENDIAN
)
2067 accum
= (unsigned char) *source
;
2069 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2074 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2075 accum_bits
+= HOST_CHAR_BIT
;
2077 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2080 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2081 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2084 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2086 accum_bits
-= chunk_size
;
2093 accum
= (unsigned char) *source
>> src_offset
;
2095 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2099 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2100 accum_bits
+= HOST_CHAR_BIT
;
2102 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2105 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2106 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2108 accum_bits
-= chunk_size
;
2109 accum
>>= chunk_size
;
2116 /* Store the contents of FROMVAL into the location of TOVAL.
2117 Return a new value with the location of TOVAL and contents of
2118 FROMVAL. Handles assignment into packed fields that have
2119 floating-point or non-scalar types. */
2121 static struct value
*
2122 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2124 struct type
*type
= value_type (toval
);
2125 int bits
= value_bitsize (toval
);
2127 toval
= ada_coerce_ref (toval
);
2128 fromval
= ada_coerce_ref (fromval
);
2130 if (ada_is_direct_array_type (value_type (toval
)))
2131 toval
= ada_coerce_to_simple_array (toval
);
2132 if (ada_is_direct_array_type (value_type (fromval
)))
2133 fromval
= ada_coerce_to_simple_array (fromval
);
2135 if (!deprecated_value_modifiable (toval
))
2136 error (_("Left operand of assignment is not a modifiable lvalue."));
2138 if (VALUE_LVAL (toval
) == lval_memory
2140 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2141 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2143 int len
= (value_bitpos (toval
)
2144 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2145 char *buffer
= (char *) alloca (len
);
2147 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2149 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2150 fromval
= value_cast (type
, fromval
);
2152 read_memory (to_addr
, buffer
, len
);
2153 if (BITS_BIG_ENDIAN
)
2154 move_bits (buffer
, value_bitpos (toval
),
2155 value_contents (fromval
),
2156 TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
-
2159 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2161 write_memory (to_addr
, buffer
, len
);
2162 if (deprecated_memory_changed_hook
)
2163 deprecated_memory_changed_hook (to_addr
, len
);
2165 val
= value_copy (toval
);
2166 memcpy (value_contents_raw (val
), value_contents (fromval
),
2167 TYPE_LENGTH (type
));
2168 deprecated_set_value_type (val
, type
);
2173 return value_assign (toval
, fromval
);
2177 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2178 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2179 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2180 * COMPONENT, and not the inferior's memory. The current contents
2181 * of COMPONENT are ignored. */
2183 value_assign_to_component (struct value
*container
, struct value
*component
,
2186 LONGEST offset_in_container
=
2187 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2188 - VALUE_ADDRESS (container
) - value_offset (container
));
2189 int bit_offset_in_container
=
2190 value_bitpos (component
) - value_bitpos (container
);
2193 val
= value_cast (value_type (component
), val
);
2195 if (value_bitsize (component
) == 0)
2196 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2198 bits
= value_bitsize (component
);
2200 if (BITS_BIG_ENDIAN
)
2201 move_bits (value_contents_writeable (container
) + offset_in_container
,
2202 value_bitpos (container
) + bit_offset_in_container
,
2203 value_contents (val
),
2204 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2207 move_bits (value_contents_writeable (container
) + offset_in_container
,
2208 value_bitpos (container
) + bit_offset_in_container
,
2209 value_contents (val
), 0, bits
);
2212 /* The value of the element of array ARR at the ARITY indices given in IND.
2213 ARR may be either a simple array, GNAT array descriptor, or pointer
2217 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2221 struct type
*elt_type
;
2223 elt
= ada_coerce_to_simple_array (arr
);
2225 elt_type
= ada_check_typedef (value_type (elt
));
2226 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2227 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2228 return value_subscript_packed (elt
, arity
, ind
);
2230 for (k
= 0; k
< arity
; k
+= 1)
2232 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2233 error (_("too many subscripts (%d expected)"), k
);
2234 elt
= value_subscript (elt
, value_pos_atr (ind
[k
]));
2239 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2240 value of the element of *ARR at the ARITY indices given in
2241 IND. Does not read the entire array into memory. */
2244 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2249 for (k
= 0; k
< arity
; k
+= 1)
2254 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2255 error (_("too many subscripts (%d expected)"), k
);
2256 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2258 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2259 idx
= value_pos_atr (ind
[k
]);
2261 idx
= value_sub (idx
, value_from_longest (builtin_type_int
, lwb
));
2262 arr
= value_add (arr
, idx
);
2263 type
= TYPE_TARGET_TYPE (type
);
2266 return value_ind (arr
);
2269 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2270 actual type of ARRAY_PTR is ignored), returns a reference to
2271 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2272 bound of this array is LOW, as per Ada rules. */
2273 static struct value
*
2274 ada_value_slice_ptr (struct value
*array_ptr
, struct type
*type
,
2277 CORE_ADDR base
= value_as_address (array_ptr
)
2278 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2279 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2280 struct type
*index_type
=
2281 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2283 struct type
*slice_type
=
2284 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2285 return value_from_pointer (lookup_reference_type (slice_type
), base
);
2289 static struct value
*
2290 ada_value_slice (struct value
*array
, int low
, int high
)
2292 struct type
*type
= value_type (array
);
2293 struct type
*index_type
=
2294 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2295 struct type
*slice_type
=
2296 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2297 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2300 /* If type is a record type in the form of a standard GNAT array
2301 descriptor, returns the number of dimensions for type. If arr is a
2302 simple array, returns the number of "array of"s that prefix its
2303 type designation. Otherwise, returns 0. */
2306 ada_array_arity (struct type
*type
)
2313 type
= desc_base_type (type
);
2316 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2317 return desc_arity (desc_bounds_type (type
));
2319 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2322 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2328 /* If TYPE is a record type in the form of a standard GNAT array
2329 descriptor or a simple array type, returns the element type for
2330 TYPE after indexing by NINDICES indices, or by all indices if
2331 NINDICES is -1. Otherwise, returns NULL. */
2334 ada_array_element_type (struct type
*type
, int nindices
)
2336 type
= desc_base_type (type
);
2338 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2341 struct type
*p_array_type
;
2343 p_array_type
= desc_data_type (type
);
2345 k
= ada_array_arity (type
);
2349 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2350 if (nindices
>= 0 && k
> nindices
)
2352 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2353 while (k
> 0 && p_array_type
!= NULL
)
2355 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2358 return p_array_type
;
2360 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2362 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2364 type
= TYPE_TARGET_TYPE (type
);
2373 /* The type of nth index in arrays of given type (n numbering from 1).
2374 Does not examine memory. */
2377 ada_index_type (struct type
*type
, int n
)
2379 struct type
*result_type
;
2381 type
= desc_base_type (type
);
2383 if (n
> ada_array_arity (type
))
2386 if (ada_is_simple_array_type (type
))
2390 for (i
= 1; i
< n
; i
+= 1)
2391 type
= TYPE_TARGET_TYPE (type
);
2392 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2393 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2394 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2395 perhaps stabsread.c would make more sense. */
2396 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2397 result_type
= builtin_type_int
;
2402 return desc_index_type (desc_bounds_type (type
), n
);
2405 /* Given that arr is an array type, returns the lower bound of the
2406 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2407 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2408 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2409 bounds type. It works for other arrays with bounds supplied by
2410 run-time quantities other than discriminants. */
2413 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2414 struct type
** typep
)
2417 struct type
*index_type_desc
;
2419 if (ada_is_packed_array_type (arr_type
))
2420 arr_type
= decode_packed_array_type (arr_type
);
2422 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2425 *typep
= builtin_type_int
;
2426 return (LONGEST
) - which
;
2429 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2430 type
= TYPE_TARGET_TYPE (arr_type
);
2434 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2435 if (index_type_desc
== NULL
)
2437 struct type
*range_type
;
2438 struct type
*index_type
;
2442 type
= TYPE_TARGET_TYPE (type
);
2446 range_type
= TYPE_INDEX_TYPE (type
);
2447 index_type
= TYPE_TARGET_TYPE (range_type
);
2448 if (TYPE_CODE (index_type
) == TYPE_CODE_UNDEF
)
2449 index_type
= builtin_type_long
;
2451 *typep
= index_type
;
2453 (LONGEST
) (which
== 0
2454 ? TYPE_LOW_BOUND (range_type
)
2455 : TYPE_HIGH_BOUND (range_type
));
2459 struct type
*index_type
=
2460 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2461 NULL
, TYPE_OBJFILE (arr_type
));
2463 *typep
= TYPE_TARGET_TYPE (index_type
);
2465 (LONGEST
) (which
== 0
2466 ? TYPE_LOW_BOUND (index_type
)
2467 : TYPE_HIGH_BOUND (index_type
));
2471 /* Given that arr is an array value, returns the lower bound of the
2472 nth index (numbering from 1) if which is 0, and the upper bound if
2473 which is 1. This routine will also work for arrays with bounds
2474 supplied by run-time quantities other than discriminants. */
2477 ada_array_bound (struct value
*arr
, int n
, int which
)
2479 struct type
*arr_type
= value_type (arr
);
2481 if (ada_is_packed_array_type (arr_type
))
2482 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2483 else if (ada_is_simple_array_type (arr_type
))
2486 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2487 return value_from_longest (type
, v
);
2490 return desc_one_bound (desc_bounds (arr
), n
, which
);
2493 /* Given that arr is an array value, returns the length of the
2494 nth index. This routine will also work for arrays with bounds
2495 supplied by run-time quantities other than discriminants.
2496 Does not work for arrays indexed by enumeration types with representation
2497 clauses at the moment. */
2500 ada_array_length (struct value
*arr
, int n
)
2502 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2504 if (ada_is_packed_array_type (arr_type
))
2505 return ada_array_length (decode_packed_array (arr
), n
);
2507 if (ada_is_simple_array_type (arr_type
))
2511 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2512 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2513 return value_from_longest (type
, v
);
2517 value_from_longest (builtin_type_int
,
2518 value_as_long (desc_one_bound (desc_bounds (arr
),
2520 - value_as_long (desc_one_bound (desc_bounds (arr
),
2524 /* An empty array whose type is that of ARR_TYPE (an array type),
2525 with bounds LOW to LOW-1. */
2527 static struct value
*
2528 empty_array (struct type
*arr_type
, int low
)
2530 struct type
*index_type
=
2531 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2533 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2534 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2538 /* Name resolution */
2540 /* The "decoded" name for the user-definable Ada operator corresponding
2544 ada_decoded_op_name (enum exp_opcode op
)
2548 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2550 if (ada_opname_table
[i
].op
== op
)
2551 return ada_opname_table
[i
].decoded
;
2553 error (_("Could not find operator name for opcode"));
2557 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2558 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2559 undefined namespace) and converts operators that are
2560 user-defined into appropriate function calls. If CONTEXT_TYPE is
2561 non-null, it provides a preferred result type [at the moment, only
2562 type void has any effect---causing procedures to be preferred over
2563 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2564 return type is preferred. May change (expand) *EXP. */
2567 resolve (struct expression
**expp
, int void_context_p
)
2571 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2574 /* Resolve the operator of the subexpression beginning at
2575 position *POS of *EXPP. "Resolving" consists of replacing
2576 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2577 with their resolutions, replacing built-in operators with
2578 function calls to user-defined operators, where appropriate, and,
2579 when DEPROCEDURE_P is non-zero, converting function-valued variables
2580 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2581 are as in ada_resolve, above. */
2583 static struct value
*
2584 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2585 struct type
*context_type
)
2589 struct expression
*exp
; /* Convenience: == *expp. */
2590 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2591 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2592 int nargs
; /* Number of operands. */
2599 /* Pass one: resolve operands, saving their types and updating *pos,
2604 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2605 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2610 resolve_subexp (expp
, pos
, 0, NULL
);
2612 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2617 resolve_subexp (expp
, pos
, 0, NULL
);
2622 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2625 case OP_ATR_MODULUS
:
2635 case TERNOP_IN_RANGE
:
2636 case BINOP_IN_BOUNDS
:
2642 case OP_DISCRETE_RANGE
:
2644 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2653 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2655 resolve_subexp (expp
, pos
, 1, NULL
);
2657 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2674 case BINOP_LOGICAL_AND
:
2675 case BINOP_LOGICAL_OR
:
2676 case BINOP_BITWISE_AND
:
2677 case BINOP_BITWISE_IOR
:
2678 case BINOP_BITWISE_XOR
:
2681 case BINOP_NOTEQUAL
:
2688 case BINOP_SUBSCRIPT
:
2696 case UNOP_LOGICAL_NOT
:
2712 case OP_INTERNALVAR
:
2722 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2725 case STRUCTOP_STRUCT
:
2726 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2739 error (_("Unexpected operator during name resolution"));
2742 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2743 for (i
= 0; i
< nargs
; i
+= 1)
2744 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2748 /* Pass two: perform any resolution on principal operator. */
2755 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2757 struct ada_symbol_info
*candidates
;
2761 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2762 (exp
->elts
[pc
+ 2].symbol
),
2763 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2766 if (n_candidates
> 1)
2768 /* Types tend to get re-introduced locally, so if there
2769 are any local symbols that are not types, first filter
2772 for (j
= 0; j
< n_candidates
; j
+= 1)
2773 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2779 case LOC_REGPARM_ADDR
:
2783 case LOC_BASEREG_ARG
:
2785 case LOC_COMPUTED_ARG
:
2791 if (j
< n_candidates
)
2794 while (j
< n_candidates
)
2796 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2798 candidates
[j
] = candidates
[n_candidates
- 1];
2807 if (n_candidates
== 0)
2808 error (_("No definition found for %s"),
2809 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2810 else if (n_candidates
== 1)
2812 else if (deprocedure_p
2813 && !is_nonfunction (candidates
, n_candidates
))
2815 i
= ada_resolve_function
2816 (candidates
, n_candidates
, NULL
, 0,
2817 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2820 error (_("Could not find a match for %s"),
2821 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2825 printf_filtered (_("Multiple matches for %s\n"),
2826 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2827 user_select_syms (candidates
, n_candidates
, 1);
2831 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2832 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2833 if (innermost_block
== NULL
2834 || contained_in (candidates
[i
].block
, innermost_block
))
2835 innermost_block
= candidates
[i
].block
;
2839 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2842 replace_operator_with_call (expp
, pc
, 0, 0,
2843 exp
->elts
[pc
+ 2].symbol
,
2844 exp
->elts
[pc
+ 1].block
);
2851 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2852 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2854 struct ada_symbol_info
*candidates
;
2858 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2859 (exp
->elts
[pc
+ 5].symbol
),
2860 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2862 if (n_candidates
== 1)
2866 i
= ada_resolve_function
2867 (candidates
, n_candidates
,
2869 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2872 error (_("Could not find a match for %s"),
2873 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2876 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2877 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2878 if (innermost_block
== NULL
2879 || contained_in (candidates
[i
].block
, innermost_block
))
2880 innermost_block
= candidates
[i
].block
;
2891 case BINOP_BITWISE_AND
:
2892 case BINOP_BITWISE_IOR
:
2893 case BINOP_BITWISE_XOR
:
2895 case BINOP_NOTEQUAL
:
2903 case UNOP_LOGICAL_NOT
:
2905 if (possible_user_operator_p (op
, argvec
))
2907 struct ada_symbol_info
*candidates
;
2911 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2912 (struct block
*) NULL
, VAR_DOMAIN
,
2914 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2915 ada_decoded_op_name (op
), NULL
);
2919 replace_operator_with_call (expp
, pc
, nargs
, 1,
2920 candidates
[i
].sym
, candidates
[i
].block
);
2930 return evaluate_subexp_type (exp
, pos
);
2933 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2934 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2935 a non-pointer. A type of 'void' (which is never a valid expression type)
2936 by convention matches anything. */
2937 /* The term "match" here is rather loose. The match is heuristic and
2938 liberal. FIXME: TOO liberal, in fact. */
2941 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
2943 ftype
= ada_check_typedef (ftype
);
2944 atype
= ada_check_typedef (atype
);
2946 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
2947 ftype
= TYPE_TARGET_TYPE (ftype
);
2948 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
2949 atype
= TYPE_TARGET_TYPE (atype
);
2951 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
2952 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
2955 switch (TYPE_CODE (ftype
))
2960 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
2961 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
2962 TYPE_TARGET_TYPE (atype
), 0);
2965 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
2967 case TYPE_CODE_ENUM
:
2968 case TYPE_CODE_RANGE
:
2969 switch (TYPE_CODE (atype
))
2972 case TYPE_CODE_ENUM
:
2973 case TYPE_CODE_RANGE
:
2979 case TYPE_CODE_ARRAY
:
2980 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
2981 || ada_is_array_descriptor_type (atype
));
2983 case TYPE_CODE_STRUCT
:
2984 if (ada_is_array_descriptor_type (ftype
))
2985 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
2986 || ada_is_array_descriptor_type (atype
));
2988 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
2989 && !ada_is_array_descriptor_type (atype
));
2991 case TYPE_CODE_UNION
:
2993 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
2997 /* Return non-zero if the formals of FUNC "sufficiently match" the
2998 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
2999 may also be an enumeral, in which case it is treated as a 0-
3000 argument function. */
3003 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3006 struct type
*func_type
= SYMBOL_TYPE (func
);
3008 if (SYMBOL_CLASS (func
) == LOC_CONST
3009 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3010 return (n_actuals
== 0);
3011 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3014 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3017 for (i
= 0; i
< n_actuals
; i
+= 1)
3019 if (actuals
[i
] == NULL
)
3023 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3024 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3026 if (!ada_type_match (ftype
, atype
, 1))
3033 /* False iff function type FUNC_TYPE definitely does not produce a value
3034 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3035 FUNC_TYPE is not a valid function type with a non-null return type
3036 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3039 return_match (struct type
*func_type
, struct type
*context_type
)
3041 struct type
*return_type
;
3043 if (func_type
== NULL
)
3046 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3047 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3049 return_type
= base_type (func_type
);
3050 if (return_type
== NULL
)
3053 context_type
= base_type (context_type
);
3055 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3056 return context_type
== NULL
|| return_type
== context_type
;
3057 else if (context_type
== NULL
)
3058 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3060 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3064 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3065 function (if any) that matches the types of the NARGS arguments in
3066 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3067 that returns that type, then eliminate matches that don't. If
3068 CONTEXT_TYPE is void and there is at least one match that does not
3069 return void, eliminate all matches that do.
3071 Asks the user if there is more than one match remaining. Returns -1
3072 if there is no such symbol or none is selected. NAME is used
3073 solely for messages. May re-arrange and modify SYMS in
3074 the process; the index returned is for the modified vector. */
3077 ada_resolve_function (struct ada_symbol_info syms
[],
3078 int nsyms
, struct value
**args
, int nargs
,
3079 const char *name
, struct type
*context_type
)
3082 int m
; /* Number of hits */
3083 struct type
*fallback
;
3084 struct type
*return_type
;
3086 return_type
= context_type
;
3087 if (context_type
== NULL
)
3088 fallback
= builtin_type_void
;
3095 for (k
= 0; k
< nsyms
; k
+= 1)
3097 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3099 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3100 && return_match (type
, return_type
))
3106 if (m
> 0 || return_type
== fallback
)
3109 return_type
= fallback
;
3116 printf_filtered (_("Multiple matches for %s\n"), name
);
3117 user_select_syms (syms
, m
, 1);
3123 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3124 in a listing of choices during disambiguation (see sort_choices, below).
3125 The idea is that overloadings of a subprogram name from the
3126 same package should sort in their source order. We settle for ordering
3127 such symbols by their trailing number (__N or $N). */
3130 encoded_ordered_before (char *N0
, char *N1
)
3134 else if (N0
== NULL
)
3139 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3141 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3143 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3144 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3148 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3151 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3153 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3154 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3156 return (strcmp (N0
, N1
) < 0);
3160 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3164 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3167 for (i
= 1; i
< nsyms
; i
+= 1)
3169 struct ada_symbol_info sym
= syms
[i
];
3172 for (j
= i
- 1; j
>= 0; j
-= 1)
3174 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3175 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3177 syms
[j
+ 1] = syms
[j
];
3183 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3184 by asking the user (if necessary), returning the number selected,
3185 and setting the first elements of SYMS items. Error if no symbols
3188 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3189 to be re-integrated one of these days. */
3192 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3195 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3197 int first_choice
= (max_results
== 1) ? 1 : 2;
3199 if (max_results
< 1)
3200 error (_("Request to select 0 symbols!"));
3204 printf_unfiltered (_("[0] cancel\n"));
3205 if (max_results
> 1)
3206 printf_unfiltered (_("[1] all\n"));
3208 sort_choices (syms
, nsyms
);
3210 for (i
= 0; i
< nsyms
; i
+= 1)
3212 if (syms
[i
].sym
== NULL
)
3215 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3217 struct symtab_and_line sal
=
3218 find_function_start_sal (syms
[i
].sym
, 1);
3219 if (sal
.symtab
== NULL
)
3220 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3222 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3225 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3226 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3227 sal
.symtab
->filename
, sal
.line
);
3233 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3234 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3235 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3236 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3238 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3239 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3241 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3242 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3243 else if (is_enumeral
3244 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3246 printf_unfiltered (("[%d] "), i
+ first_choice
);
3247 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3249 printf_unfiltered (_("'(%s) (enumeral)\n"),
3250 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3252 else if (symtab
!= NULL
)
3253 printf_unfiltered (is_enumeral
3254 ? _("[%d] %s in %s (enumeral)\n")
3255 : _("[%d] %s at %s:?\n"),
3257 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3260 printf_unfiltered (is_enumeral
3261 ? _("[%d] %s (enumeral)\n")
3262 : _("[%d] %s at ?\n"),
3264 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3268 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3271 for (i
= 0; i
< n_chosen
; i
+= 1)
3272 syms
[i
] = syms
[chosen
[i
]];
3277 /* Read and validate a set of numeric choices from the user in the
3278 range 0 .. N_CHOICES-1. Place the results in increasing
3279 order in CHOICES[0 .. N-1], and return N.
3281 The user types choices as a sequence of numbers on one line
3282 separated by blanks, encoding them as follows:
3284 + A choice of 0 means to cancel the selection, throwing an error.
3285 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3286 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3288 The user is not allowed to choose more than MAX_RESULTS values.
3290 ANNOTATION_SUFFIX, if present, is used to annotate the input
3291 prompts (for use with the -f switch). */
3294 get_selections (int *choices
, int n_choices
, int max_results
,
3295 int is_all_choice
, char *annotation_suffix
)
3300 int first_choice
= is_all_choice
? 2 : 1;
3302 prompt
= getenv ("PS2");
3306 printf_unfiltered (("%s "), prompt
);
3307 gdb_flush (gdb_stdout
);
3309 args
= command_line_input ((char *) NULL
, 0, annotation_suffix
);
3312 error_no_arg (_("one or more choice numbers"));
3316 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3317 order, as given in args. Choices are validated. */
3323 while (isspace (*args
))
3325 if (*args
== '\0' && n_chosen
== 0)
3326 error_no_arg (_("one or more choice numbers"));
3327 else if (*args
== '\0')
3330 choice
= strtol (args
, &args2
, 10);
3331 if (args
== args2
|| choice
< 0
3332 || choice
> n_choices
+ first_choice
- 1)
3333 error (_("Argument must be choice number"));
3337 error (_("cancelled"));
3339 if (choice
< first_choice
)
3341 n_chosen
= n_choices
;
3342 for (j
= 0; j
< n_choices
; j
+= 1)
3346 choice
-= first_choice
;
3348 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3352 if (j
< 0 || choice
!= choices
[j
])
3355 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3356 choices
[k
+ 1] = choices
[k
];
3357 choices
[j
+ 1] = choice
;
3362 if (n_chosen
> max_results
)
3363 error (_("Select no more than %d of the above"), max_results
);
3368 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3369 on the function identified by SYM and BLOCK, and taking NARGS
3370 arguments. Update *EXPP as needed to hold more space. */
3373 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3374 int oplen
, struct symbol
*sym
,
3375 struct block
*block
)
3377 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3378 symbol, -oplen for operator being replaced). */
3379 struct expression
*newexp
= (struct expression
*)
3380 xmalloc (sizeof (struct expression
)
3381 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3382 struct expression
*exp
= *expp
;
3384 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3385 newexp
->language_defn
= exp
->language_defn
;
3386 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3387 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3388 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3390 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3391 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3393 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3394 newexp
->elts
[pc
+ 4].block
= block
;
3395 newexp
->elts
[pc
+ 5].symbol
= sym
;
3401 /* Type-class predicates */
3403 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3407 numeric_type_p (struct type
*type
)
3413 switch (TYPE_CODE (type
))
3418 case TYPE_CODE_RANGE
:
3419 return (type
== TYPE_TARGET_TYPE (type
)
3420 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3427 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3430 integer_type_p (struct type
*type
)
3436 switch (TYPE_CODE (type
))
3440 case TYPE_CODE_RANGE
:
3441 return (type
== TYPE_TARGET_TYPE (type
)
3442 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3449 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3452 scalar_type_p (struct type
*type
)
3458 switch (TYPE_CODE (type
))
3461 case TYPE_CODE_RANGE
:
3462 case TYPE_CODE_ENUM
:
3471 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3474 discrete_type_p (struct type
*type
)
3480 switch (TYPE_CODE (type
))
3483 case TYPE_CODE_RANGE
:
3484 case TYPE_CODE_ENUM
:
3492 /* Returns non-zero if OP with operands in the vector ARGS could be
3493 a user-defined function. Errs on the side of pre-defined operators
3494 (i.e., result 0). */
3497 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3499 struct type
*type0
=
3500 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3501 struct type
*type1
=
3502 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3516 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3520 case BINOP_BITWISE_AND
:
3521 case BINOP_BITWISE_IOR
:
3522 case BINOP_BITWISE_XOR
:
3523 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3526 case BINOP_NOTEQUAL
:
3531 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3534 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3537 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3541 case UNOP_LOGICAL_NOT
:
3543 return (!numeric_type_p (type0
));
3550 /* NOTE: In the following, we assume that a renaming type's name may
3551 have an ___XD suffix. It would be nice if this went away at some
3554 /* If TYPE encodes a renaming, returns the renaming suffix, which
3555 is XR for an object renaming, XRP for a procedure renaming, XRE for
3556 an exception renaming, and XRS for a subprogram renaming. Returns
3557 NULL if NAME encodes none of these. */
3560 ada_renaming_type (struct type
*type
)
3562 if (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_ENUM
)
3564 const char *name
= type_name_no_tag (type
);
3565 const char *suffix
= (name
== NULL
) ? NULL
: strstr (name
, "___XR");
3567 || (suffix
[5] != '\000' && strchr ("PES_", suffix
[5]) == NULL
))
3576 /* Return non-zero iff SYM encodes an object renaming. */
3579 ada_is_object_renaming (struct symbol
*sym
)
3581 const char *renaming_type
= ada_renaming_type (SYMBOL_TYPE (sym
));
3582 return renaming_type
!= NULL
3583 && (renaming_type
[2] == '\0' || renaming_type
[2] == '_');
3586 /* Assuming that SYM encodes a non-object renaming, returns the original
3587 name of the renamed entity. The name is good until the end of
3591 ada_simple_renamed_entity (struct symbol
*sym
)
3594 const char *raw_name
;
3598 type
= SYMBOL_TYPE (sym
);
3599 if (type
== NULL
|| TYPE_NFIELDS (type
) < 1)
3600 error (_("Improperly encoded renaming."));
3602 raw_name
= TYPE_FIELD_NAME (type
, 0);
3603 len
= (raw_name
== NULL
? 0 : strlen (raw_name
)) - 5;
3605 error (_("Improperly encoded renaming."));
3607 result
= xmalloc (len
+ 1);
3608 strncpy (result
, raw_name
, len
);
3609 result
[len
] = '\000';
3615 /* Evaluation: Function Calls */
3617 /* Return an lvalue containing the value VAL. This is the identity on
3618 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3619 on the stack, using and updating *SP as the stack pointer, and
3620 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3622 static struct value
*
3623 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3625 if (! VALUE_LVAL (val
))
3627 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3629 /* The following is taken from the structure-return code in
3630 call_function_by_hand. FIXME: Therefore, some refactoring seems
3632 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3634 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3635 reserving sufficient space. */
3637 if (gdbarch_frame_align_p (current_gdbarch
))
3638 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3639 VALUE_ADDRESS (val
) = *sp
;
3643 /* Stack grows upward. Align the frame, allocate space, and
3644 then again, re-align the frame. */
3645 if (gdbarch_frame_align_p (current_gdbarch
))
3646 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3647 VALUE_ADDRESS (val
) = *sp
;
3649 if (gdbarch_frame_align_p (current_gdbarch
))
3650 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3653 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3659 /* Return the value ACTUAL, converted to be an appropriate value for a
3660 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3661 allocating any necessary descriptors (fat pointers), or copies of
3662 values not residing in memory, updating it as needed. */
3664 static struct value
*
3665 convert_actual (struct value
*actual
, struct type
*formal_type0
,
3668 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3669 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3670 struct type
*formal_target
=
3671 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3672 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3673 struct type
*actual_target
=
3674 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3675 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3677 if (ada_is_array_descriptor_type (formal_target
)
3678 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3679 return make_array_descriptor (formal_type
, actual
, sp
);
3680 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
)
3682 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3683 && ada_is_array_descriptor_type (actual_target
))
3684 return desc_data (actual
);
3685 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3687 if (VALUE_LVAL (actual
) != lval_memory
)
3690 actual_type
= ada_check_typedef (value_type (actual
));
3691 val
= allocate_value (actual_type
);
3692 memcpy ((char *) value_contents_raw (val
),
3693 (char *) value_contents (actual
),
3694 TYPE_LENGTH (actual_type
));
3695 actual
= ensure_lval (val
, sp
);
3697 return value_addr (actual
);
3700 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3701 return ada_value_ind (actual
);
3707 /* Push a descriptor of type TYPE for array value ARR on the stack at
3708 *SP, updating *SP to reflect the new descriptor. Return either
3709 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3710 to-descriptor type rather than a descriptor type), a struct value *
3711 representing a pointer to this descriptor. */
3713 static struct value
*
3714 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3716 struct type
*bounds_type
= desc_bounds_type (type
);
3717 struct type
*desc_type
= desc_base_type (type
);
3718 struct value
*descriptor
= allocate_value (desc_type
);
3719 struct value
*bounds
= allocate_value (bounds_type
);
3722 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3724 modify_general_field (value_contents_writeable (bounds
),
3725 value_as_long (ada_array_bound (arr
, i
, 0)),
3726 desc_bound_bitpos (bounds_type
, i
, 0),
3727 desc_bound_bitsize (bounds_type
, i
, 0));
3728 modify_general_field (value_contents_writeable (bounds
),
3729 value_as_long (ada_array_bound (arr
, i
, 1)),
3730 desc_bound_bitpos (bounds_type
, i
, 1),
3731 desc_bound_bitsize (bounds_type
, i
, 1));
3734 bounds
= ensure_lval (bounds
, sp
);
3736 modify_general_field (value_contents_writeable (descriptor
),
3737 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3738 fat_pntr_data_bitpos (desc_type
),
3739 fat_pntr_data_bitsize (desc_type
));
3741 modify_general_field (value_contents_writeable (descriptor
),
3742 VALUE_ADDRESS (bounds
),
3743 fat_pntr_bounds_bitpos (desc_type
),
3744 fat_pntr_bounds_bitsize (desc_type
));
3746 descriptor
= ensure_lval (descriptor
, sp
);
3748 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3749 return value_addr (descriptor
);
3755 /* Assuming a dummy frame has been established on the target, perform any
3756 conversions needed for calling function FUNC on the NARGS actual
3757 parameters in ARGS, other than standard C conversions. Does
3758 nothing if FUNC does not have Ada-style prototype data, or if NARGS
3759 does not match the number of arguments expected. Use *SP as a
3760 stack pointer for additional data that must be pushed, updating its
3764 ada_convert_actuals (struct value
*func
, int nargs
, struct value
*args
[],
3769 if (TYPE_NFIELDS (value_type (func
)) == 0
3770 || nargs
!= TYPE_NFIELDS (value_type (func
)))
3773 for (i
= 0; i
< nargs
; i
+= 1)
3775 convert_actual (args
[i
], TYPE_FIELD_TYPE (value_type (func
), i
), sp
);
3778 /* Dummy definitions for an experimental caching module that is not
3779 * used in the public sources. */
3782 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3783 struct symbol
**sym
, struct block
**block
,
3784 struct symtab
**symtab
)
3790 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3791 struct block
*block
, struct symtab
*symtab
)
3797 /* Return the result of a standard (literal, C-like) lookup of NAME in
3798 given DOMAIN, visible from lexical block BLOCK. */
3800 static struct symbol
*
3801 standard_lookup (const char *name
, const struct block
*block
,
3805 struct symtab
*symtab
;
3807 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
, NULL
))
3810 lookup_symbol_in_language (name
, block
, domain
, language_c
, 0, &symtab
);
3811 cache_symbol (name
, domain
, sym
, block_found
, symtab
);
3816 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3817 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3818 since they contend in overloading in the same way. */
3820 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3824 for (i
= 0; i
< n
; i
+= 1)
3825 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3826 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3827 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3833 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3834 struct types. Otherwise, they may not. */
3837 equiv_types (struct type
*type0
, struct type
*type1
)
3841 if (type0
== NULL
|| type1
== NULL
3842 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3844 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3845 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3846 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3847 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3853 /* True iff SYM0 represents the same entity as SYM1, or one that is
3854 no more defined than that of SYM1. */
3857 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
3861 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
3862 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
3865 switch (SYMBOL_CLASS (sym0
))
3871 struct type
*type0
= SYMBOL_TYPE (sym0
);
3872 struct type
*type1
= SYMBOL_TYPE (sym1
);
3873 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
3874 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
3875 int len0
= strlen (name0
);
3877 TYPE_CODE (type0
) == TYPE_CODE (type1
)
3878 && (equiv_types (type0
, type1
)
3879 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
3880 && strncmp (name1
+ len0
, "___XV", 5) == 0));
3883 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
3884 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
3890 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
3891 records in OBSTACKP. Do nothing if SYM is a duplicate. */
3894 add_defn_to_vec (struct obstack
*obstackp
,
3896 struct block
*block
, struct symtab
*symtab
)
3900 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
3902 /* Do not try to complete stub types, as the debugger is probably
3903 already scanning all symbols matching a certain name at the
3904 time when this function is called. Trying to replace the stub
3905 type by its associated full type will cause us to restart a scan
3906 which may lead to an infinite recursion. Instead, the client
3907 collecting the matching symbols will end up collecting several
3908 matches, with at least one of them complete. It can then filter
3909 out the stub ones if needed. */
3911 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
3913 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
3915 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
3917 prevDefns
[i
].sym
= sym
;
3918 prevDefns
[i
].block
= block
;
3919 prevDefns
[i
].symtab
= symtab
;
3925 struct ada_symbol_info info
;
3929 info
.symtab
= symtab
;
3930 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
3934 /* Number of ada_symbol_info structures currently collected in
3935 current vector in *OBSTACKP. */
3938 num_defns_collected (struct obstack
*obstackp
)
3940 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
3943 /* Vector of ada_symbol_info structures currently collected in current
3944 vector in *OBSTACKP. If FINISH, close off the vector and return
3945 its final address. */
3947 static struct ada_symbol_info
*
3948 defns_collected (struct obstack
*obstackp
, int finish
)
3951 return obstack_finish (obstackp
);
3953 return (struct ada_symbol_info
*) obstack_base (obstackp
);
3956 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
3957 Check the global symbols if GLOBAL, the static symbols if not.
3958 Do wild-card match if WILD. */
3960 static struct partial_symbol
*
3961 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
3962 int global
, domain_enum
namespace, int wild
)
3964 struct partial_symbol
**start
;
3965 int name_len
= strlen (name
);
3966 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
3975 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
3976 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
3980 for (i
= 0; i
< length
; i
+= 1)
3982 struct partial_symbol
*psym
= start
[i
];
3984 if (SYMBOL_DOMAIN (psym
) == namespace
3985 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
3999 int M
= (U
+ i
) >> 1;
4000 struct partial_symbol
*psym
= start
[M
];
4001 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4003 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4005 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4016 struct partial_symbol
*psym
= start
[i
];
4018 if (SYMBOL_DOMAIN (psym
) == namespace)
4020 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4028 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4042 int M
= (U
+ i
) >> 1;
4043 struct partial_symbol
*psym
= start
[M
];
4044 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4046 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4048 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4059 struct partial_symbol
*psym
= start
[i
];
4061 if (SYMBOL_DOMAIN (psym
) == namespace)
4065 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4068 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4070 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4080 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4090 /* Find a symbol table containing symbol SYM or NULL if none. */
4092 static struct symtab
*
4093 symtab_for_sym (struct symbol
*sym
)
4096 struct objfile
*objfile
;
4098 struct symbol
*tmp_sym
;
4099 struct dict_iterator iter
;
4102 ALL_PRIMARY_SYMTABS (objfile
, s
)
4104 switch (SYMBOL_CLASS (sym
))
4112 case LOC_CONST_BYTES
:
4113 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4114 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4116 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4117 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4123 switch (SYMBOL_CLASS (sym
))
4129 case LOC_REGPARM_ADDR
:
4134 case LOC_BASEREG_ARG
:
4136 case LOC_COMPUTED_ARG
:
4137 for (j
= FIRST_LOCAL_BLOCK
;
4138 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4140 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4141 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4152 /* Return a minimal symbol matching NAME according to Ada decoding
4153 rules. Returns NULL if there is no such minimal symbol. Names
4154 prefixed with "standard__" are handled specially: "standard__" is
4155 first stripped off, and only static and global symbols are searched. */
4157 struct minimal_symbol
*
4158 ada_lookup_simple_minsym (const char *name
)
4160 struct objfile
*objfile
;
4161 struct minimal_symbol
*msymbol
;
4164 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4166 name
+= sizeof ("standard__") - 1;
4170 wild_match
= (strstr (name
, "__") == NULL
);
4172 ALL_MSYMBOLS (objfile
, msymbol
)
4174 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4175 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4182 /* For all subprograms that statically enclose the subprogram of the
4183 selected frame, add symbols matching identifier NAME in DOMAIN
4184 and their blocks to the list of data in OBSTACKP, as for
4185 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4189 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4190 const char *name
, domain_enum
namespace,
4195 /* True if TYPE is definitely an artificial type supplied to a symbol
4196 for which no debugging information was given in the symbol file. */
4199 is_nondebugging_type (struct type
*type
)
4201 char *name
= ada_type_name (type
);
4202 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4205 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4206 duplicate other symbols in the list (The only case I know of where
4207 this happens is when object files containing stabs-in-ecoff are
4208 linked with files containing ordinary ecoff debugging symbols (or no
4209 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4210 Returns the number of items in the modified list. */
4213 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4220 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4221 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4222 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4224 for (j
= 0; j
< nsyms
; j
+= 1)
4227 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4228 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4229 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4230 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4231 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4232 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4235 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4236 syms
[k
- 1] = syms
[k
];
4249 /* Given a type that corresponds to a renaming entity, use the type name
4250 to extract the scope (package name or function name, fully qualified,
4251 and following the GNAT encoding convention) where this renaming has been
4252 defined. The string returned needs to be deallocated after use. */
4255 xget_renaming_scope (struct type
*renaming_type
)
4257 /* The renaming types adhere to the following convention:
4258 <scope>__<rename>___<XR extension>.
4259 So, to extract the scope, we search for the "___XR" extension,
4260 and then backtrack until we find the first "__". */
4262 const char *name
= type_name_no_tag (renaming_type
);
4263 char *suffix
= strstr (name
, "___XR");
4268 /* Now, backtrack a bit until we find the first "__". Start looking
4269 at suffix - 3, as the <rename> part is at least one character long. */
4271 for (last
= suffix
- 3; last
> name
; last
--)
4272 if (last
[0] == '_' && last
[1] == '_')
4275 /* Make a copy of scope and return it. */
4277 scope_len
= last
- name
;
4278 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4280 strncpy (scope
, name
, scope_len
);
4281 scope
[scope_len
] = '\0';
4286 /* Return nonzero if NAME corresponds to a package name. */
4289 is_package_name (const char *name
)
4291 /* Here, We take advantage of the fact that no symbols are generated
4292 for packages, while symbols are generated for each function.
4293 So the condition for NAME represent a package becomes equivalent
4294 to NAME not existing in our list of symbols. There is only one
4295 small complication with library-level functions (see below). */
4299 /* If it is a function that has not been defined at library level,
4300 then we should be able to look it up in the symbols. */
4301 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4304 /* Library-level function names start with "_ada_". See if function
4305 "_ada_" followed by NAME can be found. */
4307 /* Do a quick check that NAME does not contain "__", since library-level
4308 functions names cannot contain "__" in them. */
4309 if (strstr (name
, "__") != NULL
)
4312 fun_name
= xstrprintf ("_ada_%s", name
);
4314 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4317 /* Return nonzero if SYM corresponds to a renaming entity that is
4318 visible from FUNCTION_NAME. */
4321 renaming_is_visible (const struct symbol
*sym
, char *function_name
)
4323 char *scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4325 make_cleanup (xfree
, scope
);
4327 /* If the rename has been defined in a package, then it is visible. */
4328 if (is_package_name (scope
))
4331 /* Check that the rename is in the current function scope by checking
4332 that its name starts with SCOPE. */
4334 /* If the function name starts with "_ada_", it means that it is
4335 a library-level function. Strip this prefix before doing the
4336 comparison, as the encoding for the renaming does not contain
4338 if (strncmp (function_name
, "_ada_", 5) == 0)
4341 return (strncmp (function_name
, scope
, strlen (scope
)) == 0);
4344 /* Iterates over the SYMS list and remove any entry that corresponds to
4345 a renaming entity that is not visible from the function associated
4349 GNAT emits a type following a specified encoding for each renaming
4350 entity. Unfortunately, STABS currently does not support the definition
4351 of types that are local to a given lexical block, so all renamings types
4352 are emitted at library level. As a consequence, if an application
4353 contains two renaming entities using the same name, and a user tries to
4354 print the value of one of these entities, the result of the ada symbol
4355 lookup will also contain the wrong renaming type.
4357 This function partially covers for this limitation by attempting to
4358 remove from the SYMS list renaming symbols that should be visible
4359 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4360 method with the current information available. The implementation
4361 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4363 - When the user tries to print a rename in a function while there
4364 is another rename entity defined in a package: Normally, the
4365 rename in the function has precedence over the rename in the
4366 package, so the latter should be removed from the list. This is
4367 currently not the case.
4369 - This function will incorrectly remove valid renames if
4370 the CURRENT_BLOCK corresponds to a function which symbol name
4371 has been changed by an "Export" pragma. As a consequence,
4372 the user will be unable to print such rename entities. */
4375 remove_out_of_scope_renamings (struct ada_symbol_info
*syms
,
4376 int nsyms
, const struct block
*current_block
)
4378 struct symbol
*current_function
;
4379 char *current_function_name
;
4382 /* Extract the function name associated to CURRENT_BLOCK.
4383 Abort if unable to do so. */
4385 if (current_block
== NULL
)
4388 current_function
= block_function (current_block
);
4389 if (current_function
== NULL
)
4392 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4393 if (current_function_name
== NULL
)
4396 /* Check each of the symbols, and remove it from the list if it is
4397 a type corresponding to a renaming that is out of the scope of
4398 the current block. */
4403 if (ada_is_object_renaming (syms
[i
].sym
)
4404 && !renaming_is_visible (syms
[i
].sym
, current_function_name
))
4407 for (j
= i
+ 1; j
< nsyms
; j
++)
4408 syms
[j
- 1] = syms
[j
];
4418 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4419 scope and in global scopes, returning the number of matches. Sets
4420 *RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
4421 indicating the symbols found and the blocks and symbol tables (if
4422 any) in which they were found. This vector are transient---good only to
4423 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4424 symbol match within the nest of blocks whose innermost member is BLOCK0,
4425 is the one match returned (no other matches in that or
4426 enclosing blocks is returned). If there are any matches in or
4427 surrounding BLOCK0, then these alone are returned. Otherwise, the
4428 search extends to global and file-scope (static) symbol tables.
4429 Names prefixed with "standard__" are handled specially: "standard__"
4430 is first stripped off, and only static and global symbols are searched. */
4433 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4434 domain_enum
namespace,
4435 struct ada_symbol_info
**results
)
4439 struct partial_symtab
*ps
;
4440 struct blockvector
*bv
;
4441 struct objfile
*objfile
;
4442 struct block
*block
;
4444 struct minimal_symbol
*msymbol
;
4450 obstack_free (&symbol_list_obstack
, NULL
);
4451 obstack_init (&symbol_list_obstack
);
4455 /* Search specified block and its superiors. */
4457 wild_match
= (strstr (name0
, "__") == NULL
);
4459 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4460 needed, but adding const will
4461 have a cascade effect. */
4462 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4466 name
= name0
+ sizeof ("standard__") - 1;
4470 while (block
!= NULL
)
4473 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4474 namespace, NULL
, NULL
, wild_match
);
4476 /* If we found a non-function match, assume that's the one. */
4477 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4478 num_defns_collected (&symbol_list_obstack
)))
4481 block
= BLOCK_SUPERBLOCK (block
);
4484 /* If no luck so far, try to find NAME as a local symbol in some lexically
4485 enclosing subprogram. */
4486 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4487 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4488 name
, namespace, wild_match
);
4490 /* If we found ANY matches among non-global symbols, we're done. */
4492 if (num_defns_collected (&symbol_list_obstack
) > 0)
4496 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
, &s
))
4499 add_defn_to_vec (&symbol_list_obstack
, sym
, block
, s
);
4503 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4504 tables, and psymtab's. */
4506 ALL_PRIMARY_SYMTABS (objfile
, s
)
4509 bv
= BLOCKVECTOR (s
);
4510 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4511 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4512 objfile
, s
, wild_match
);
4515 if (namespace == VAR_DOMAIN
)
4517 ALL_MSYMBOLS (objfile
, msymbol
)
4519 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4521 switch (MSYMBOL_TYPE (msymbol
))
4523 case mst_solib_trampoline
:
4526 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4529 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4531 bv
= BLOCKVECTOR (s
);
4532 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4533 ada_add_block_symbols (&symbol_list_obstack
, block
,
4534 SYMBOL_LINKAGE_NAME (msymbol
),
4535 namespace, objfile
, s
, wild_match
);
4537 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4539 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4540 ada_add_block_symbols (&symbol_list_obstack
, block
,
4541 SYMBOL_LINKAGE_NAME (msymbol
),
4542 namespace, objfile
, s
,
4551 ALL_PSYMTABS (objfile
, ps
)
4555 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4557 s
= PSYMTAB_TO_SYMTAB (ps
);
4560 bv
= BLOCKVECTOR (s
);
4561 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4562 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4563 namespace, objfile
, s
, wild_match
);
4567 /* Now add symbols from all per-file blocks if we've gotten no hits
4568 (Not strictly correct, but perhaps better than an error).
4569 Do the symtabs first, then check the psymtabs. */
4571 if (num_defns_collected (&symbol_list_obstack
) == 0)
4574 ALL_PRIMARY_SYMTABS (objfile
, s
)
4577 bv
= BLOCKVECTOR (s
);
4578 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4579 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4580 objfile
, s
, wild_match
);
4583 ALL_PSYMTABS (objfile
, ps
)
4587 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4589 s
= PSYMTAB_TO_SYMTAB (ps
);
4590 bv
= BLOCKVECTOR (s
);
4593 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4594 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4595 namespace, objfile
, s
, wild_match
);
4601 ndefns
= num_defns_collected (&symbol_list_obstack
);
4602 *results
= defns_collected (&symbol_list_obstack
, 1);
4604 ndefns
= remove_extra_symbols (*results
, ndefns
);
4607 cache_symbol (name0
, namespace, NULL
, NULL
, NULL
);
4609 if (ndefns
== 1 && cacheIfUnique
)
4610 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
,
4611 (*results
)[0].symtab
);
4613 ndefns
= remove_out_of_scope_renamings (*results
, ndefns
, block0
);
4618 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4619 scope and in global scopes, or NULL if none. NAME is folded and
4620 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4621 choosing the first symbol if there are multiple choices.
4622 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4623 table in which the symbol was found (in both cases, these
4624 assignments occur only if the pointers are non-null). */
4627 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4628 domain_enum
namespace, int *is_a_field_of_this
,
4629 struct symtab
**symtab
)
4631 struct ada_symbol_info
*candidates
;
4634 n_candidates
= ada_lookup_symbol_list (ada_encode (ada_fold_name (name
)),
4635 block0
, namespace, &candidates
);
4637 if (n_candidates
== 0)
4640 if (is_a_field_of_this
!= NULL
)
4641 *is_a_field_of_this
= 0;
4645 *symtab
= candidates
[0].symtab
;
4646 if (*symtab
== NULL
&& candidates
[0].block
!= NULL
)
4648 struct objfile
*objfile
;
4651 struct blockvector
*bv
;
4653 /* Search the list of symtabs for one which contains the
4654 address of the start of this block. */
4655 ALL_PRIMARY_SYMTABS (objfile
, s
)
4657 bv
= BLOCKVECTOR (s
);
4658 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4659 if (BLOCK_START (b
) <= BLOCK_START (candidates
[0].block
)
4660 && BLOCK_END (b
) > BLOCK_START (candidates
[0].block
))
4663 return fixup_symbol_section (candidates
[0].sym
, objfile
);
4666 /* FIXME: brobecker/2004-11-12: I think that we should never
4667 reach this point. I don't see a reason why we would not
4668 find a symtab for a given block, so I suggest raising an
4669 internal_error exception here. Otherwise, we end up
4670 returning a symbol but no symtab, which certain parts of
4671 the code that rely (indirectly) on this function do not
4672 expect, eventually causing a SEGV. */
4673 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4676 return candidates
[0].sym
;
4679 static struct symbol
*
4680 ada_lookup_symbol_nonlocal (const char *name
,
4681 const char *linkage_name
,
4682 const struct block
*block
,
4683 const domain_enum domain
, struct symtab
**symtab
)
4685 if (linkage_name
== NULL
)
4686 linkage_name
= name
;
4687 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4692 /* True iff STR is a possible encoded suffix of a normal Ada name
4693 that is to be ignored for matching purposes. Suffixes of parallel
4694 names (e.g., XVE) are not included here. Currently, the possible suffixes
4695 are given by either of the regular expression:
4697 (__[0-9]+)?[.$][0-9]+ [nested subprogram suffix, on platforms such
4699 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4700 _E[0-9]+[bs]$ [protected object entry suffixes]
4701 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4705 is_name_suffix (const char *str
)
4708 const char *matching
;
4709 const int len
= strlen (str
);
4711 /* (__[0-9]+)?\.[0-9]+ */
4713 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4716 while (isdigit (matching
[0]))
4718 if (matching
[0] == '\0')
4722 if (matching
[0] == '.' || matching
[0] == '$')
4725 while (isdigit (matching
[0]))
4727 if (matching
[0] == '\0')
4732 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4735 while (isdigit (matching
[0]))
4737 if (matching
[0] == '\0')
4742 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4743 with a N at the end. Unfortunately, the compiler uses the same
4744 convention for other internal types it creates. So treating
4745 all entity names that end with an "N" as a name suffix causes
4746 some regressions. For instance, consider the case of an enumerated
4747 type. To support the 'Image attribute, it creates an array whose
4749 Having a single character like this as a suffix carrying some
4750 information is a bit risky. Perhaps we should change the encoding
4751 to be something like "_N" instead. In the meantime, do not do
4752 the following check. */
4753 /* Protected Object Subprograms */
4754 if (len
== 1 && str
[0] == 'N')
4759 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4762 while (isdigit (matching
[0]))
4764 if ((matching
[0] == 'b' || matching
[0] == 's')
4765 && matching
[1] == '\0')
4769 /* ??? We should not modify STR directly, as we are doing below. This
4770 is fine in this case, but may become problematic later if we find
4771 that this alternative did not work, and want to try matching
4772 another one from the begining of STR. Since we modified it, we
4773 won't be able to find the begining of the string anymore! */
4777 while (str
[0] != '_' && str
[0] != '\0')
4779 if (str
[0] != 'n' && str
[0] != 'b')
4784 if (str
[0] == '\000')
4788 if (str
[1] != '_' || str
[2] == '\000')
4792 if (strcmp (str
+ 3, "JM") == 0)
4794 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4795 the LJM suffix in favor of the JM one. But we will
4796 still accept LJM as a valid suffix for a reasonable
4797 amount of time, just to allow ourselves to debug programs
4798 compiled using an older version of GNAT. */
4799 if (strcmp (str
+ 3, "LJM") == 0)
4803 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4804 || str
[4] == 'U' || str
[4] == 'P')
4806 if (str
[4] == 'R' && str
[5] != 'T')
4810 if (!isdigit (str
[2]))
4812 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4813 if (!isdigit (str
[k
]) && str
[k
] != '_')
4817 if (str
[0] == '$' && isdigit (str
[1]))
4819 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4820 if (!isdigit (str
[k
]) && str
[k
] != '_')
4827 /* Return nonzero if the given string starts with a dot ('.')
4828 followed by zero or more digits.
4830 Note: brobecker/2003-11-10: A forward declaration has not been
4831 added at the begining of this file yet, because this function
4832 is only used to work around a problem found during wild matching
4833 when trying to match minimal symbol names against symbol names
4834 obtained from dwarf-2 data. This function is therefore currently
4835 only used in wild_match() and is likely to be deleted when the
4836 problem in dwarf-2 is fixed. */
4839 is_dot_digits_suffix (const char *str
)
4845 while (isdigit (str
[0]))
4847 return (str
[0] == '\0');
4850 /* Return non-zero if NAME0 is a valid match when doing wild matching.
4851 Certain symbols appear at first to match, except that they turn out
4852 not to follow the Ada encoding and hence should not be used as a wild
4853 match of a given pattern. */
4856 is_valid_name_for_wild_match (const char *name0
)
4858 const char *decoded_name
= ada_decode (name0
);
4861 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4862 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4868 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4869 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4870 informational suffixes of NAME (i.e., for which is_name_suffix is
4874 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4880 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
4881 stored in the symbol table for nested function names is sometimes
4882 different from the name of the associated entity stored in
4883 the dwarf-2 data: This is the case for nested subprograms, where
4884 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
4885 while the symbol name from the dwarf-2 data does not.
4887 Although the DWARF-2 standard documents that entity names stored
4888 in the dwarf-2 data should be identical to the name as seen in
4889 the source code, GNAT takes a different approach as we already use
4890 a special encoding mechanism to convey the information so that
4891 a C debugger can still use the information generated to debug
4892 Ada programs. A corollary is that the symbol names in the dwarf-2
4893 data should match the names found in the symbol table. I therefore
4894 consider this issue as a compiler defect.
4896 Until the compiler is properly fixed, we work-around the problem
4897 by ignoring such suffixes during the match. We do so by making
4898 a copy of PATN0 and NAME0, and then by stripping such a suffix
4899 if present. We then perform the match on the resulting strings. */
4902 name_len
= strlen (name0
);
4904 name
= (char *) alloca ((name_len
+ 1) * sizeof (char));
4905 strcpy (name
, name0
);
4906 dot
= strrchr (name
, '.');
4907 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
4910 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
4911 strncpy (patn
, patn0
, patn_len
);
4912 patn
[patn_len
] = '\0';
4913 dot
= strrchr (patn
, '.');
4914 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
4917 patn_len
= dot
- patn
;
4921 /* Now perform the wild match. */
4923 name_len
= strlen (name
);
4924 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
4925 && strncmp (patn
, name
+ 5, patn_len
) == 0
4926 && is_name_suffix (name
+ patn_len
+ 5))
4929 while (name_len
>= patn_len
)
4931 if (strncmp (patn
, name
, patn_len
) == 0
4932 && is_name_suffix (name
+ patn_len
))
4933 return (is_valid_name_for_wild_match (name0
));
4940 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
4945 if (!islower (name
[2]))
4952 if (!islower (name
[1]))
4963 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4964 vector *defn_symbols, updating the list of symbols in OBSTACKP
4965 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4966 OBJFILE is the section containing BLOCK.
4967 SYMTAB is recorded with each symbol added. */
4970 ada_add_block_symbols (struct obstack
*obstackp
,
4971 struct block
*block
, const char *name
,
4972 domain_enum domain
, struct objfile
*objfile
,
4973 struct symtab
*symtab
, int wild
)
4975 struct dict_iterator iter
;
4976 int name_len
= strlen (name
);
4977 /* A matching argument symbol, if any. */
4978 struct symbol
*arg_sym
;
4979 /* Set true when we find a matching non-argument symbol. */
4988 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4990 if (SYMBOL_DOMAIN (sym
) == domain
4991 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
4993 switch (SYMBOL_CLASS (sym
))
4999 case LOC_REGPARM_ADDR
:
5000 case LOC_BASEREG_ARG
:
5001 case LOC_COMPUTED_ARG
:
5004 case LOC_UNRESOLVED
:
5008 add_defn_to_vec (obstackp
,
5009 fixup_symbol_section (sym
, objfile
),
5018 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5020 if (SYMBOL_DOMAIN (sym
) == domain
)
5022 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5024 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5026 switch (SYMBOL_CLASS (sym
))
5032 case LOC_REGPARM_ADDR
:
5033 case LOC_BASEREG_ARG
:
5034 case LOC_COMPUTED_ARG
:
5037 case LOC_UNRESOLVED
:
5041 add_defn_to_vec (obstackp
,
5042 fixup_symbol_section (sym
, objfile
),
5051 if (!found_sym
&& arg_sym
!= NULL
)
5053 add_defn_to_vec (obstackp
,
5054 fixup_symbol_section (arg_sym
, objfile
),
5063 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5065 if (SYMBOL_DOMAIN (sym
) == domain
)
5069 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5072 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5074 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5079 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5081 switch (SYMBOL_CLASS (sym
))
5087 case LOC_REGPARM_ADDR
:
5088 case LOC_BASEREG_ARG
:
5089 case LOC_COMPUTED_ARG
:
5092 case LOC_UNRESOLVED
:
5096 add_defn_to_vec (obstackp
,
5097 fixup_symbol_section (sym
, objfile
),
5105 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5106 They aren't parameters, right? */
5107 if (!found_sym
&& arg_sym
!= NULL
)
5109 add_defn_to_vec (obstackp
,
5110 fixup_symbol_section (arg_sym
, objfile
),
5118 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5119 to be invisible to users. */
5122 ada_is_ignored_field (struct type
*type
, int field_num
)
5124 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5128 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5129 return (name
== NULL
5130 || (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0));
5134 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5135 pointer or reference type whose ultimate target has a tag field. */
5138 ada_is_tagged_type (struct type
*type
, int refok
)
5140 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5143 /* True iff TYPE represents the type of X'Tag */
5146 ada_is_tag_type (struct type
*type
)
5148 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5152 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5153 return (name
!= NULL
5154 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5158 /* The type of the tag on VAL. */
5161 ada_tag_type (struct value
*val
)
5163 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5166 /* The value of the tag on VAL. */
5169 ada_value_tag (struct value
*val
)
5171 return ada_value_struct_elt (val
, "_tag", 0);
5174 /* The value of the tag on the object of type TYPE whose contents are
5175 saved at VALADDR, if it is non-null, or is at memory address
5178 static struct value
*
5179 value_tag_from_contents_and_address (struct type
*type
,
5180 const gdb_byte
*valaddr
,
5183 int tag_byte_offset
, dummy1
, dummy2
;
5184 struct type
*tag_type
;
5185 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5188 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5190 : valaddr
+ tag_byte_offset
);
5191 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5193 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5198 static struct type
*
5199 type_from_tag (struct value
*tag
)
5201 const char *type_name
= ada_tag_name (tag
);
5202 if (type_name
!= NULL
)
5203 return ada_find_any_type (ada_encode (type_name
));
5214 static int ada_tag_name_1 (void *);
5215 static int ada_tag_name_2 (struct tag_args
*);
5217 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5218 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5219 The value stored in ARGS->name is valid until the next call to
5223 ada_tag_name_1 (void *args0
)
5225 struct tag_args
*args
= (struct tag_args
*) args0
;
5226 static char name
[1024];
5230 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5232 return ada_tag_name_2 (args
);
5233 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5236 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5237 for (p
= name
; *p
!= '\0'; p
+= 1)
5244 /* Utility function for ada_tag_name_1 that tries the second
5245 representation for the dispatch table (in which there is no
5246 explicit 'tsd' field in the referent of the tag pointer, and instead
5247 the tsd pointer is stored just before the dispatch table. */
5250 ada_tag_name_2 (struct tag_args
*args
)
5252 struct type
*info_type
;
5253 static char name
[1024];
5255 struct value
*val
, *valp
;
5258 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5259 if (info_type
== NULL
)
5261 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5262 valp
= value_cast (info_type
, args
->tag
);
5265 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5268 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5271 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5272 for (p
= name
; *p
!= '\0'; p
+= 1)
5279 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5283 ada_tag_name (struct value
*tag
)
5285 struct tag_args args
;
5286 if (!ada_is_tag_type (value_type (tag
)))
5290 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5294 /* The parent type of TYPE, or NULL if none. */
5297 ada_parent_type (struct type
*type
)
5301 type
= ada_check_typedef (type
);
5303 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5306 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5307 if (ada_is_parent_field (type
, i
))
5308 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5313 /* True iff field number FIELD_NUM of structure type TYPE contains the
5314 parent-type (inherited) fields of a derived type. Assumes TYPE is
5315 a structure type with at least FIELD_NUM+1 fields. */
5318 ada_is_parent_field (struct type
*type
, int field_num
)
5320 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5321 return (name
!= NULL
5322 && (strncmp (name
, "PARENT", 6) == 0
5323 || strncmp (name
, "_parent", 7) == 0));
5326 /* True iff field number FIELD_NUM of structure type TYPE is a
5327 transparent wrapper field (which should be silently traversed when doing
5328 field selection and flattened when printing). Assumes TYPE is a
5329 structure type with at least FIELD_NUM+1 fields. Such fields are always
5333 ada_is_wrapper_field (struct type
*type
, int field_num
)
5335 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5336 return (name
!= NULL
5337 && (strncmp (name
, "PARENT", 6) == 0
5338 || strcmp (name
, "REP") == 0
5339 || strncmp (name
, "_parent", 7) == 0
5340 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5343 /* True iff field number FIELD_NUM of structure or union type TYPE
5344 is a variant wrapper. Assumes TYPE is a structure type with at least
5345 FIELD_NUM+1 fields. */
5348 ada_is_variant_part (struct type
*type
, int field_num
)
5350 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5351 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5352 || (is_dynamic_field (type
, field_num
)
5353 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5354 == TYPE_CODE_UNION
)));
5357 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5358 whose discriminants are contained in the record type OUTER_TYPE,
5359 returns the type of the controlling discriminant for the variant. */
5362 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5364 char *name
= ada_variant_discrim_name (var_type
);
5366 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5368 return builtin_type_int
;
5373 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5374 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5375 represents a 'when others' clause; otherwise 0. */
5378 ada_is_others_clause (struct type
*type
, int field_num
)
5380 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5381 return (name
!= NULL
&& name
[0] == 'O');
5384 /* Assuming that TYPE0 is the type of the variant part of a record,
5385 returns the name of the discriminant controlling the variant.
5386 The value is valid until the next call to ada_variant_discrim_name. */
5389 ada_variant_discrim_name (struct type
*type0
)
5391 static char *result
= NULL
;
5392 static size_t result_len
= 0;
5395 const char *discrim_end
;
5396 const char *discrim_start
;
5398 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5399 type
= TYPE_TARGET_TYPE (type0
);
5403 name
= ada_type_name (type
);
5405 if (name
== NULL
|| name
[0] == '\000')
5408 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5411 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5414 if (discrim_end
== name
)
5417 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5420 if (discrim_start
== name
+ 1)
5422 if ((discrim_start
> name
+ 3
5423 && strncmp (discrim_start
- 3, "___", 3) == 0)
5424 || discrim_start
[-1] == '.')
5428 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5429 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5430 result
[discrim_end
- discrim_start
] = '\0';
5434 /* Scan STR for a subtype-encoded number, beginning at position K.
5435 Put the position of the character just past the number scanned in
5436 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5437 Return 1 if there was a valid number at the given position, and 0
5438 otherwise. A "subtype-encoded" number consists of the absolute value
5439 in decimal, followed by the letter 'm' to indicate a negative number.
5440 Assumes 0m does not occur. */
5443 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5447 if (!isdigit (str
[k
]))
5450 /* Do it the hard way so as not to make any assumption about
5451 the relationship of unsigned long (%lu scan format code) and
5454 while (isdigit (str
[k
]))
5456 RU
= RU
* 10 + (str
[k
] - '0');
5463 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5469 /* NOTE on the above: Technically, C does not say what the results of
5470 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5471 number representable as a LONGEST (although either would probably work
5472 in most implementations). When RU>0, the locution in the then branch
5473 above is always equivalent to the negative of RU. */
5480 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5481 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5482 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5485 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5487 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5500 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5509 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5510 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5512 if (val
>= L
&& val
<= U
)
5524 /* FIXME: Lots of redundancy below. Try to consolidate. */
5526 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5527 ARG_TYPE, extract and return the value of one of its (non-static)
5528 fields. FIELDNO says which field. Differs from value_primitive_field
5529 only in that it can handle packed values of arbitrary type. */
5531 static struct value
*
5532 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5533 struct type
*arg_type
)
5537 arg_type
= ada_check_typedef (arg_type
);
5538 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5540 /* Handle packed fields. */
5542 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5544 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5545 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5547 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5548 offset
+ bit_pos
/ 8,
5549 bit_pos
% 8, bit_size
, type
);
5552 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5555 /* Find field with name NAME in object of type TYPE. If found,
5556 set the following for each argument that is non-null:
5557 - *FIELD_TYPE_P to the field's type;
5558 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5559 an object of that type;
5560 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5561 - *BIT_SIZE_P to its size in bits if the field is packed, and
5563 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5564 fields up to but not including the desired field, or by the total
5565 number of fields if not found. A NULL value of NAME never
5566 matches; the function just counts visible fields in this case.
5568 Returns 1 if found, 0 otherwise. */
5571 find_struct_field (char *name
, struct type
*type
, int offset
,
5572 struct type
**field_type_p
,
5573 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5578 type
= ada_check_typedef (type
);
5580 if (field_type_p
!= NULL
)
5581 *field_type_p
= NULL
;
5582 if (byte_offset_p
!= NULL
)
5584 if (bit_offset_p
!= NULL
)
5586 if (bit_size_p
!= NULL
)
5589 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5591 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5592 int fld_offset
= offset
+ bit_pos
/ 8;
5593 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5595 if (t_field_name
== NULL
)
5598 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5600 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5601 if (field_type_p
!= NULL
)
5602 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5603 if (byte_offset_p
!= NULL
)
5604 *byte_offset_p
= fld_offset
;
5605 if (bit_offset_p
!= NULL
)
5606 *bit_offset_p
= bit_pos
% 8;
5607 if (bit_size_p
!= NULL
)
5608 *bit_size_p
= bit_size
;
5611 else if (ada_is_wrapper_field (type
, i
))
5613 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5614 field_type_p
, byte_offset_p
, bit_offset_p
,
5615 bit_size_p
, index_p
))
5618 else if (ada_is_variant_part (type
, i
))
5620 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5623 struct type
*field_type
5624 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5626 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5628 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5630 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5631 field_type_p
, byte_offset_p
,
5632 bit_offset_p
, bit_size_p
, index_p
))
5636 else if (index_p
!= NULL
)
5642 /* Number of user-visible fields in record type TYPE. */
5645 num_visible_fields (struct type
*type
)
5649 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5653 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5654 and search in it assuming it has (class) type TYPE.
5655 If found, return value, else return NULL.
5657 Searches recursively through wrapper fields (e.g., '_parent'). */
5659 static struct value
*
5660 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5664 type
= ada_check_typedef (type
);
5666 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5668 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5670 if (t_field_name
== NULL
)
5673 else if (field_name_match (t_field_name
, name
))
5674 return ada_value_primitive_field (arg
, offset
, i
, type
);
5676 else if (ada_is_wrapper_field (type
, i
))
5678 struct value
*v
= /* Do not let indent join lines here. */
5679 ada_search_struct_field (name
, arg
,
5680 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5681 TYPE_FIELD_TYPE (type
, i
));
5686 else if (ada_is_variant_part (type
, i
))
5688 /* PNH: Do we ever get here? See find_struct_field. */
5690 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5691 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
5693 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5695 struct value
*v
= ada_search_struct_field
/* Force line break. */
5697 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5698 TYPE_FIELD_TYPE (field_type
, j
));
5707 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
5708 int, struct type
*);
5711 /* Return field #INDEX in ARG, where the index is that returned by
5712 * find_struct_field through its INDEX_P argument. Adjust the address
5713 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
5714 * If found, return value, else return NULL. */
5716 static struct value
*
5717 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
5720 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
5724 /* Auxiliary function for ada_index_struct_field. Like
5725 * ada_index_struct_field, but takes index from *INDEX_P and modifies
5728 static struct value
*
5729 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
5733 type
= ada_check_typedef (type
);
5735 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5737 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
5739 else if (ada_is_wrapper_field (type
, i
))
5741 struct value
*v
= /* Do not let indent join lines here. */
5742 ada_index_struct_field_1 (index_p
, arg
,
5743 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5744 TYPE_FIELD_TYPE (type
, i
));
5749 else if (ada_is_variant_part (type
, i
))
5751 /* PNH: Do we ever get here? See ada_search_struct_field,
5752 find_struct_field. */
5753 error (_("Cannot assign this kind of variant record"));
5755 else if (*index_p
== 0)
5756 return ada_value_primitive_field (arg
, offset
, i
, type
);
5763 /* Given ARG, a value of type (pointer or reference to a)*
5764 structure/union, extract the component named NAME from the ultimate
5765 target structure/union and return it as a value with its
5766 appropriate type. If ARG is a pointer or reference and the field
5767 is not packed, returns a reference to the field, otherwise the
5768 value of the field (an lvalue if ARG is an lvalue).
5770 The routine searches for NAME among all members of the structure itself
5771 and (recursively) among all members of any wrapper members
5774 If NO_ERR, then simply return NULL in case of error, rather than
5778 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
5780 struct type
*t
, *t1
;
5784 t1
= t
= ada_check_typedef (value_type (arg
));
5785 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
5787 t1
= TYPE_TARGET_TYPE (t
);
5790 t1
= ada_check_typedef (t1
);
5791 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
5793 arg
= coerce_ref (arg
);
5798 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
5800 t1
= TYPE_TARGET_TYPE (t
);
5803 t1
= ada_check_typedef (t1
);
5804 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
5806 arg
= value_ind (arg
);
5813 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
5817 v
= ada_search_struct_field (name
, arg
, 0, t
);
5820 int bit_offset
, bit_size
, byte_offset
;
5821 struct type
*field_type
;
5824 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
5825 address
= value_as_address (arg
);
5827 address
= unpack_pointer (t
, value_contents (arg
));
5829 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
);
5830 if (find_struct_field (name
, t1
, 0,
5831 &field_type
, &byte_offset
, &bit_offset
,
5836 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
5837 arg
= ada_coerce_ref (arg
);
5839 arg
= ada_value_ind (arg
);
5840 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
5841 bit_offset
, bit_size
,
5845 v
= value_from_pointer (lookup_reference_type (field_type
),
5846 address
+ byte_offset
);
5850 if (v
!= NULL
|| no_err
)
5853 error (_("There is no member named %s."), name
);
5859 error (_("Attempt to extract a component of a value that is not a record."));
5862 /* Given a type TYPE, look up the type of the component of type named NAME.
5863 If DISPP is non-null, add its byte displacement from the beginning of a
5864 structure (pointed to by a value) of type TYPE to *DISPP (does not
5865 work for packed fields).
5867 Matches any field whose name has NAME as a prefix, possibly
5870 TYPE can be either a struct or union. If REFOK, TYPE may also
5871 be a (pointer or reference)+ to a struct or union, and the
5872 ultimate target type will be searched.
5874 Looks recursively into variant clauses and parent types.
5876 If NOERR is nonzero, return NULL if NAME is not suitably defined or
5877 TYPE is not a type of the right kind. */
5879 static struct type
*
5880 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
5881 int noerr
, int *dispp
)
5888 if (refok
&& type
!= NULL
)
5891 type
= ada_check_typedef (type
);
5892 if (TYPE_CODE (type
) != TYPE_CODE_PTR
5893 && TYPE_CODE (type
) != TYPE_CODE_REF
)
5895 type
= TYPE_TARGET_TYPE (type
);
5899 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
5900 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
5906 target_terminal_ours ();
5907 gdb_flush (gdb_stdout
);
5909 error (_("Type (null) is not a structure or union type"));
5912 /* XXX: type_sprint */
5913 fprintf_unfiltered (gdb_stderr
, _("Type "));
5914 type_print (type
, "", gdb_stderr
, -1);
5915 error (_(" is not a structure or union type"));
5920 type
= to_static_fixed_type (type
);
5922 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5924 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5928 if (t_field_name
== NULL
)
5931 else if (field_name_match (t_field_name
, name
))
5934 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
5935 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5938 else if (ada_is_wrapper_field (type
, i
))
5941 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
5946 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
5951 else if (ada_is_variant_part (type
, i
))
5954 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5956 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
5959 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
5964 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
5975 target_terminal_ours ();
5976 gdb_flush (gdb_stdout
);
5979 /* XXX: type_sprint */
5980 fprintf_unfiltered (gdb_stderr
, _("Type "));
5981 type_print (type
, "", gdb_stderr
, -1);
5982 error (_(" has no component named <null>"));
5986 /* XXX: type_sprint */
5987 fprintf_unfiltered (gdb_stderr
, _("Type "));
5988 type_print (type
, "", gdb_stderr
, -1);
5989 error (_(" has no component named %s"), name
);
5996 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
5997 within a value of type OUTER_TYPE that is stored in GDB at
5998 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
5999 numbering from 0) is applicable. Returns -1 if none are. */
6002 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6003 const gdb_byte
*outer_valaddr
)
6008 struct type
*discrim_type
;
6009 char *discrim_name
= ada_variant_discrim_name (var_type
);
6010 LONGEST discrim_val
;
6014 ada_lookup_struct_elt_type (outer_type
, discrim_name
, 1, 1, &disp
);
6015 if (discrim_type
== NULL
)
6017 discrim_val
= unpack_long (discrim_type
, outer_valaddr
+ disp
);
6020 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6022 if (ada_is_others_clause (var_type
, i
))
6024 else if (ada_in_variant (discrim_val
, var_type
, i
))
6028 return others_clause
;
6033 /* Dynamic-Sized Records */
6035 /* Strategy: The type ostensibly attached to a value with dynamic size
6036 (i.e., a size that is not statically recorded in the debugging
6037 data) does not accurately reflect the size or layout of the value.
6038 Our strategy is to convert these values to values with accurate,
6039 conventional types that are constructed on the fly. */
6041 /* There is a subtle and tricky problem here. In general, we cannot
6042 determine the size of dynamic records without its data. However,
6043 the 'struct value' data structure, which GDB uses to represent
6044 quantities in the inferior process (the target), requires the size
6045 of the type at the time of its allocation in order to reserve space
6046 for GDB's internal copy of the data. That's why the
6047 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6048 rather than struct value*s.
6050 However, GDB's internal history variables ($1, $2, etc.) are
6051 struct value*s containing internal copies of the data that are not, in
6052 general, the same as the data at their corresponding addresses in
6053 the target. Fortunately, the types we give to these values are all
6054 conventional, fixed-size types (as per the strategy described
6055 above), so that we don't usually have to perform the
6056 'to_fixed_xxx_type' conversions to look at their values.
6057 Unfortunately, there is one exception: if one of the internal
6058 history variables is an array whose elements are unconstrained
6059 records, then we will need to create distinct fixed types for each
6060 element selected. */
6062 /* The upshot of all of this is that many routines take a (type, host
6063 address, target address) triple as arguments to represent a value.
6064 The host address, if non-null, is supposed to contain an internal
6065 copy of the relevant data; otherwise, the program is to consult the
6066 target at the target address. */
6068 /* Assuming that VAL0 represents a pointer value, the result of
6069 dereferencing it. Differs from value_ind in its treatment of
6070 dynamic-sized types. */
6073 ada_value_ind (struct value
*val0
)
6075 struct value
*val
= unwrap_value (value_ind (val0
));
6076 return ada_to_fixed_value (val
);
6079 /* The value resulting from dereferencing any "reference to"
6080 qualifiers on VAL0. */
6082 static struct value
*
6083 ada_coerce_ref (struct value
*val0
)
6085 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6087 struct value
*val
= val0
;
6088 val
= coerce_ref (val
);
6089 val
= unwrap_value (val
);
6090 return ada_to_fixed_value (val
);
6096 /* Return OFF rounded upward if necessary to a multiple of
6097 ALIGNMENT (a power of 2). */
6100 align_value (unsigned int off
, unsigned int alignment
)
6102 return (off
+ alignment
- 1) & ~(alignment
- 1);
6105 /* Return the bit alignment required for field #F of template type TYPE. */
6108 field_alignment (struct type
*type
, int f
)
6110 const char *name
= TYPE_FIELD_NAME (type
, f
);
6114 /* The field name should never be null, unless the debugging information
6115 is somehow malformed. In this case, we assume the field does not
6116 require any alignment. */
6120 len
= strlen (name
);
6122 if (!isdigit (name
[len
- 1]))
6125 if (isdigit (name
[len
- 2]))
6126 align_offset
= len
- 2;
6128 align_offset
= len
- 1;
6130 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6131 return TARGET_CHAR_BIT
;
6133 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6136 /* Find a symbol named NAME. Ignores ambiguity. */
6139 ada_find_any_symbol (const char *name
)
6143 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6144 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6147 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6151 /* Find a type named NAME. Ignores ambiguity. */
6154 ada_find_any_type (const char *name
)
6156 struct symbol
*sym
= ada_find_any_symbol (name
);
6159 return SYMBOL_TYPE (sym
);
6164 /* Given a symbol NAME and its associated BLOCK, search all symbols
6165 for its ___XR counterpart, which is the ``renaming'' symbol
6166 associated to NAME. Return this symbol if found, return
6170 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6172 const struct symbol
*function_sym
= block_function (block
);
6175 if (function_sym
!= NULL
)
6177 /* If the symbol is defined inside a function, NAME is not fully
6178 qualified. This means we need to prepend the function name
6179 as well as adding the ``___XR'' suffix to build the name of
6180 the associated renaming symbol. */
6181 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6182 /* Function names sometimes contain suffixes used
6183 for instance to qualify nested subprograms. When building
6184 the XR type name, we need to make sure that this suffix is
6185 not included. So do not include any suffix in the function
6186 name length below. */
6187 const int function_name_len
= ada_name_prefix_len (function_name
);
6188 const int rename_len
= function_name_len
+ 2 /* "__" */
6189 + strlen (name
) + 6 /* "___XR\0" */ ;
6191 /* Strip the suffix if necessary. */
6192 function_name
[function_name_len
] = '\0';
6194 /* Library-level functions are a special case, as GNAT adds
6195 a ``_ada_'' prefix to the function name to avoid namespace
6196 pollution. However, the renaming symbol themselves do not
6197 have this prefix, so we need to skip this prefix if present. */
6198 if (function_name_len
> 5 /* "_ada_" */
6199 && strstr (function_name
, "_ada_") == function_name
)
6200 function_name
= function_name
+ 5;
6202 rename
= (char *) alloca (rename_len
* sizeof (char));
6203 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6207 const int rename_len
= strlen (name
) + 6;
6208 rename
= (char *) alloca (rename_len
* sizeof (char));
6209 sprintf (rename
, "%s___XR", name
);
6212 return ada_find_any_symbol (rename
);
6215 /* Because of GNAT encoding conventions, several GDB symbols may match a
6216 given type name. If the type denoted by TYPE0 is to be preferred to
6217 that of TYPE1 for purposes of type printing, return non-zero;
6218 otherwise return 0. */
6221 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6225 else if (type0
== NULL
)
6227 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6229 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6231 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6233 else if (ada_is_packed_array_type (type0
))
6235 else if (ada_is_array_descriptor_type (type0
)
6236 && !ada_is_array_descriptor_type (type1
))
6238 else if (ada_renaming_type (type0
) != NULL
6239 && ada_renaming_type (type1
) == NULL
)
6244 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6245 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6248 ada_type_name (struct type
*type
)
6252 else if (TYPE_NAME (type
) != NULL
)
6253 return TYPE_NAME (type
);
6255 return TYPE_TAG_NAME (type
);
6258 /* Find a parallel type to TYPE whose name is formed by appending
6259 SUFFIX to the name of TYPE. */
6262 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6265 static size_t name_len
= 0;
6267 char *typename
= ada_type_name (type
);
6269 if (typename
== NULL
)
6272 len
= strlen (typename
);
6274 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6276 strcpy (name
, typename
);
6277 strcpy (name
+ len
, suffix
);
6279 return ada_find_any_type (name
);
6283 /* If TYPE is a variable-size record type, return the corresponding template
6284 type describing its fields. Otherwise, return NULL. */
6286 static struct type
*
6287 dynamic_template_type (struct type
*type
)
6289 type
= ada_check_typedef (type
);
6291 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6292 || ada_type_name (type
) == NULL
)
6296 int len
= strlen (ada_type_name (type
));
6297 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6300 return ada_find_parallel_type (type
, "___XVE");
6304 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6305 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6308 is_dynamic_field (struct type
*templ_type
, int field_num
)
6310 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6312 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6313 && strstr (name
, "___XVL") != NULL
;
6316 /* The index of the variant field of TYPE, or -1 if TYPE does not
6317 represent a variant record type. */
6320 variant_field_index (struct type
*type
)
6324 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6327 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6329 if (ada_is_variant_part (type
, f
))
6335 /* A record type with no fields. */
6337 static struct type
*
6338 empty_record (struct objfile
*objfile
)
6340 struct type
*type
= alloc_type (objfile
);
6341 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6342 TYPE_NFIELDS (type
) = 0;
6343 TYPE_FIELDS (type
) = NULL
;
6344 TYPE_NAME (type
) = "<empty>";
6345 TYPE_TAG_NAME (type
) = NULL
;
6346 TYPE_FLAGS (type
) = 0;
6347 TYPE_LENGTH (type
) = 0;
6351 /* An ordinary record type (with fixed-length fields) that describes
6352 the value of type TYPE at VALADDR or ADDRESS (see comments at
6353 the beginning of this section) VAL according to GNAT conventions.
6354 DVAL0 should describe the (portion of a) record that contains any
6355 necessary discriminants. It should be NULL if value_type (VAL) is
6356 an outer-level type (i.e., as opposed to a branch of a variant.) A
6357 variant field (unless unchecked) is replaced by a particular branch
6360 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6361 length are not statically known are discarded. As a consequence,
6362 VALADDR, ADDRESS and DVAL0 are ignored.
6364 NOTE: Limitations: For now, we assume that dynamic fields and
6365 variants occupy whole numbers of bytes. However, they need not be
6369 ada_template_to_fixed_record_type_1 (struct type
*type
,
6370 const gdb_byte
*valaddr
,
6371 CORE_ADDR address
, struct value
*dval0
,
6372 int keep_dynamic_fields
)
6374 struct value
*mark
= value_mark ();
6377 int nfields
, bit_len
;
6380 int fld_bit_len
, bit_incr
;
6383 /* Compute the number of fields in this record type that are going
6384 to be processed: unless keep_dynamic_fields, this includes only
6385 fields whose position and length are static will be processed. */
6386 if (keep_dynamic_fields
)
6387 nfields
= TYPE_NFIELDS (type
);
6391 while (nfields
< TYPE_NFIELDS (type
)
6392 && !ada_is_variant_part (type
, nfields
)
6393 && !is_dynamic_field (type
, nfields
))
6397 rtype
= alloc_type (TYPE_OBJFILE (type
));
6398 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6399 INIT_CPLUS_SPECIFIC (rtype
);
6400 TYPE_NFIELDS (rtype
) = nfields
;
6401 TYPE_FIELDS (rtype
) = (struct field
*)
6402 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6403 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6404 TYPE_NAME (rtype
) = ada_type_name (type
);
6405 TYPE_TAG_NAME (rtype
) = NULL
;
6406 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6412 for (f
= 0; f
< nfields
; f
+= 1)
6414 off
= align_value (off
, field_alignment (type
, f
))
6415 + TYPE_FIELD_BITPOS (type
, f
);
6416 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6417 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6419 if (ada_is_variant_part (type
, f
))
6422 fld_bit_len
= bit_incr
= 0;
6424 else if (is_dynamic_field (type
, f
))
6427 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6431 TYPE_FIELD_TYPE (rtype
, f
) =
6434 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6435 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6436 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6437 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6438 bit_incr
= fld_bit_len
=
6439 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6443 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6444 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6445 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6446 bit_incr
= fld_bit_len
=
6447 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6449 bit_incr
= fld_bit_len
=
6450 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6452 if (off
+ fld_bit_len
> bit_len
)
6453 bit_len
= off
+ fld_bit_len
;
6455 TYPE_LENGTH (rtype
) =
6456 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6459 /* We handle the variant part, if any, at the end because of certain
6460 odd cases in which it is re-ordered so as NOT the last field of
6461 the record. This can happen in the presence of representation
6463 if (variant_field
>= 0)
6465 struct type
*branch_type
;
6467 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6470 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6475 to_fixed_variant_branch_type
6476 (TYPE_FIELD_TYPE (type
, variant_field
),
6477 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6478 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6479 if (branch_type
== NULL
)
6481 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6482 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6483 TYPE_NFIELDS (rtype
) -= 1;
6487 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6488 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6490 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6492 if (off
+ fld_bit_len
> bit_len
)
6493 bit_len
= off
+ fld_bit_len
;
6494 TYPE_LENGTH (rtype
) =
6495 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6499 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6500 should contain the alignment of that record, which should be a strictly
6501 positive value. If null or negative, then something is wrong, most
6502 probably in the debug info. In that case, we don't round up the size
6503 of the resulting type. If this record is not part of another structure,
6504 the current RTYPE length might be good enough for our purposes. */
6505 if (TYPE_LENGTH (type
) <= 0)
6507 if (TYPE_NAME (rtype
))
6508 warning (_("Invalid type size for `%s' detected: %d."),
6509 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6511 warning (_("Invalid type size for <unnamed> detected: %d."),
6512 TYPE_LENGTH (type
));
6516 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6517 TYPE_LENGTH (type
));
6520 value_free_to_mark (mark
);
6521 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6522 error (_("record type with dynamic size is larger than varsize-limit"));
6526 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6529 static struct type
*
6530 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6531 CORE_ADDR address
, struct value
*dval0
)
6533 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6537 /* An ordinary record type in which ___XVL-convention fields and
6538 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6539 static approximations, containing all possible fields. Uses
6540 no runtime values. Useless for use in values, but that's OK,
6541 since the results are used only for type determinations. Works on both
6542 structs and unions. Representation note: to save space, we memorize
6543 the result of this function in the TYPE_TARGET_TYPE of the
6546 static struct type
*
6547 template_to_static_fixed_type (struct type
*type0
)
6553 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6554 return TYPE_TARGET_TYPE (type0
);
6556 nfields
= TYPE_NFIELDS (type0
);
6559 for (f
= 0; f
< nfields
; f
+= 1)
6561 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6562 struct type
*new_type
;
6564 if (is_dynamic_field (type0
, f
))
6565 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6567 new_type
= to_static_fixed_type (field_type
);
6568 if (type
== type0
&& new_type
!= field_type
)
6570 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6571 TYPE_CODE (type
) = TYPE_CODE (type0
);
6572 INIT_CPLUS_SPECIFIC (type
);
6573 TYPE_NFIELDS (type
) = nfields
;
6574 TYPE_FIELDS (type
) = (struct field
*)
6575 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6576 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6577 sizeof (struct field
) * nfields
);
6578 TYPE_NAME (type
) = ada_type_name (type0
);
6579 TYPE_TAG_NAME (type
) = NULL
;
6580 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
6581 TYPE_LENGTH (type
) = 0;
6583 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6584 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6589 /* Given an object of type TYPE whose contents are at VALADDR and
6590 whose address in memory is ADDRESS, returns a revision of TYPE --
6591 a non-dynamic-sized record with a variant part -- in which
6592 the variant part is replaced with the appropriate branch. Looks
6593 for discriminant values in DVAL0, which can be NULL if the record
6594 contains the necessary discriminant values. */
6596 static struct type
*
6597 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6598 CORE_ADDR address
, struct value
*dval0
)
6600 struct value
*mark
= value_mark ();
6603 struct type
*branch_type
;
6604 int nfields
= TYPE_NFIELDS (type
);
6605 int variant_field
= variant_field_index (type
);
6607 if (variant_field
== -1)
6611 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6615 rtype
= alloc_type (TYPE_OBJFILE (type
));
6616 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6617 INIT_CPLUS_SPECIFIC (rtype
);
6618 TYPE_NFIELDS (rtype
) = nfields
;
6619 TYPE_FIELDS (rtype
) =
6620 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6621 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6622 sizeof (struct field
) * nfields
);
6623 TYPE_NAME (rtype
) = ada_type_name (type
);
6624 TYPE_TAG_NAME (rtype
) = NULL
;
6625 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6626 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
6628 branch_type
= to_fixed_variant_branch_type
6629 (TYPE_FIELD_TYPE (type
, variant_field
),
6630 cond_offset_host (valaddr
,
6631 TYPE_FIELD_BITPOS (type
, variant_field
)
6633 cond_offset_target (address
,
6634 TYPE_FIELD_BITPOS (type
, variant_field
)
6635 / TARGET_CHAR_BIT
), dval
);
6636 if (branch_type
== NULL
)
6639 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
6640 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6641 TYPE_NFIELDS (rtype
) -= 1;
6645 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6646 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6647 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
6648 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
6650 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
6652 value_free_to_mark (mark
);
6656 /* An ordinary record type (with fixed-length fields) that describes
6657 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
6658 beginning of this section]. Any necessary discriminants' values
6659 should be in DVAL, a record value; it may be NULL if the object
6660 at ADDR itself contains any necessary discriminant values.
6661 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
6662 values from the record are needed. Except in the case that DVAL,
6663 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
6664 unchecked) is replaced by a particular branch of the variant.
6666 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
6667 is questionable and may be removed. It can arise during the
6668 processing of an unconstrained-array-of-record type where all the
6669 variant branches have exactly the same size. This is because in
6670 such cases, the compiler does not bother to use the XVS convention
6671 when encoding the record. I am currently dubious of this
6672 shortcut and suspect the compiler should be altered. FIXME. */
6674 static struct type
*
6675 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
6676 CORE_ADDR address
, struct value
*dval
)
6678 struct type
*templ_type
;
6680 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
6683 templ_type
= dynamic_template_type (type0
);
6685 if (templ_type
!= NULL
)
6686 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
6687 else if (variant_field_index (type0
) >= 0)
6689 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
6691 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
6696 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
6702 /* An ordinary record type (with fixed-length fields) that describes
6703 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
6704 union type. Any necessary discriminants' values should be in DVAL,
6705 a record value. That is, this routine selects the appropriate
6706 branch of the union at ADDR according to the discriminant value
6707 indicated in the union's type name. */
6709 static struct type
*
6710 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
6711 CORE_ADDR address
, struct value
*dval
)
6714 struct type
*templ_type
;
6715 struct type
*var_type
;
6717 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
6718 var_type
= TYPE_TARGET_TYPE (var_type0
);
6720 var_type
= var_type0
;
6722 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
6724 if (templ_type
!= NULL
)
6725 var_type
= templ_type
;
6728 ada_which_variant_applies (var_type
,
6729 value_type (dval
), value_contents (dval
));
6732 return empty_record (TYPE_OBJFILE (var_type
));
6733 else if (is_dynamic_field (var_type
, which
))
6734 return to_fixed_record_type
6735 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
6736 valaddr
, address
, dval
);
6737 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
6739 to_fixed_record_type
6740 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
6742 return TYPE_FIELD_TYPE (var_type
, which
);
6745 /* Assuming that TYPE0 is an array type describing the type of a value
6746 at ADDR, and that DVAL describes a record containing any
6747 discriminants used in TYPE0, returns a type for the value that
6748 contains no dynamic components (that is, no components whose sizes
6749 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
6750 true, gives an error message if the resulting type's size is over
6753 static struct type
*
6754 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
6757 struct type
*index_type_desc
;
6758 struct type
*result
;
6760 if (ada_is_packed_array_type (type0
) /* revisit? */
6761 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
6764 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
6765 if (index_type_desc
== NULL
)
6767 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
6768 /* NOTE: elt_type---the fixed version of elt_type0---should never
6769 depend on the contents of the array in properly constructed
6771 /* Create a fixed version of the array element type.
6772 We're not providing the address of an element here,
6773 and thus the actual object value cannot be inspected to do
6774 the conversion. This should not be a problem, since arrays of
6775 unconstrained objects are not allowed. In particular, all
6776 the elements of an array of a tagged type should all be of
6777 the same type specified in the debugging info. No need to
6778 consult the object tag. */
6779 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
);
6781 if (elt_type0
== elt_type
)
6784 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
6785 elt_type
, TYPE_INDEX_TYPE (type0
));
6790 struct type
*elt_type0
;
6793 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
6794 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
6796 /* NOTE: result---the fixed version of elt_type0---should never
6797 depend on the contents of the array in properly constructed
6799 /* Create a fixed version of the array element type.
6800 We're not providing the address of an element here,
6801 and thus the actual object value cannot be inspected to do
6802 the conversion. This should not be a problem, since arrays of
6803 unconstrained objects are not allowed. In particular, all
6804 the elements of an array of a tagged type should all be of
6805 the same type specified in the debugging info. No need to
6806 consult the object tag. */
6807 result
= ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
);
6808 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
6810 struct type
*range_type
=
6811 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
6812 dval
, TYPE_OBJFILE (type0
));
6813 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
6814 result
, range_type
);
6816 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
6817 error (_("array type with dynamic size is larger than varsize-limit"));
6820 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
6825 /* A standard type (containing no dynamically sized components)
6826 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
6827 DVAL describes a record containing any discriminants used in TYPE0,
6828 and may be NULL if there are none, or if the object of type TYPE at
6829 ADDRESS or in VALADDR contains these discriminants.
6831 In the case of tagged types, this function attempts to locate the object's
6832 tag and use it to compute the actual type. However, when ADDRESS is null,
6833 we cannot use it to determine the location of the tag, and therefore
6834 compute the tagged type's actual type. So we return the tagged type
6835 without consulting the tag. */
6838 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
6839 CORE_ADDR address
, struct value
*dval
)
6841 type
= ada_check_typedef (type
);
6842 switch (TYPE_CODE (type
))
6846 case TYPE_CODE_STRUCT
:
6848 struct type
*static_type
= to_static_fixed_type (type
);
6850 /* If STATIC_TYPE is a tagged type and we know the object's address,
6851 then we can determine its tag, and compute the object's actual
6854 if (address
!= 0 && ada_is_tagged_type (static_type
, 0))
6856 struct type
*real_type
=
6857 type_from_tag (value_tag_from_contents_and_address (static_type
,
6860 if (real_type
!= NULL
)
6863 return to_fixed_record_type (type
, valaddr
, address
, NULL
);
6865 case TYPE_CODE_ARRAY
:
6866 return to_fixed_array_type (type
, dval
, 1);
6867 case TYPE_CODE_UNION
:
6871 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
6875 /* A standard (static-sized) type corresponding as well as possible to
6876 TYPE0, but based on no runtime data. */
6878 static struct type
*
6879 to_static_fixed_type (struct type
*type0
)
6886 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
6889 type0
= ada_check_typedef (type0
);
6891 switch (TYPE_CODE (type0
))
6895 case TYPE_CODE_STRUCT
:
6896 type
= dynamic_template_type (type0
);
6898 return template_to_static_fixed_type (type
);
6900 return template_to_static_fixed_type (type0
);
6901 case TYPE_CODE_UNION
:
6902 type
= ada_find_parallel_type (type0
, "___XVU");
6904 return template_to_static_fixed_type (type
);
6906 return template_to_static_fixed_type (type0
);
6910 /* A static approximation of TYPE with all type wrappers removed. */
6912 static struct type
*
6913 static_unwrap_type (struct type
*type
)
6915 if (ada_is_aligner_type (type
))
6917 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
6918 if (ada_type_name (type1
) == NULL
)
6919 TYPE_NAME (type1
) = ada_type_name (type
);
6921 return static_unwrap_type (type1
);
6925 struct type
*raw_real_type
= ada_get_base_type (type
);
6926 if (raw_real_type
== type
)
6929 return to_static_fixed_type (raw_real_type
);
6933 /* In some cases, incomplete and private types require
6934 cross-references that are not resolved as records (for example,
6936 type FooP is access Foo;
6938 type Foo is array ...;
6939 ). In these cases, since there is no mechanism for producing
6940 cross-references to such types, we instead substitute for FooP a
6941 stub enumeration type that is nowhere resolved, and whose tag is
6942 the name of the actual type. Call these types "non-record stubs". */
6944 /* A type equivalent to TYPE that is not a non-record stub, if one
6945 exists, otherwise TYPE. */
6948 ada_check_typedef (struct type
*type
)
6950 CHECK_TYPEDEF (type
);
6951 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
6952 || !TYPE_STUB (type
)
6953 || TYPE_TAG_NAME (type
) == NULL
)
6957 char *name
= TYPE_TAG_NAME (type
);
6958 struct type
*type1
= ada_find_any_type (name
);
6959 return (type1
== NULL
) ? type
: type1
;
6963 /* A value representing the data at VALADDR/ADDRESS as described by
6964 type TYPE0, but with a standard (static-sized) type that correctly
6965 describes it. If VAL0 is not NULL and TYPE0 already is a standard
6966 type, then return VAL0 [this feature is simply to avoid redundant
6967 creation of struct values]. */
6969 static struct value
*
6970 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
6973 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
);
6974 if (type
== type0
&& val0
!= NULL
)
6977 return value_from_contents_and_address (type
, 0, address
);
6980 /* A value representing VAL, but with a standard (static-sized) type
6981 that correctly describes it. Does not necessarily create a new
6984 static struct value
*
6985 ada_to_fixed_value (struct value
*val
)
6987 return ada_to_fixed_value_create (value_type (val
),
6988 VALUE_ADDRESS (val
) + value_offset (val
),
6992 /* A value representing VAL, but with a standard (static-sized) type
6993 chosen to approximate the real type of VAL as well as possible, but
6994 without consulting any runtime values. For Ada dynamic-sized
6995 types, therefore, the type of the result is likely to be inaccurate. */
6998 ada_to_static_fixed_value (struct value
*val
)
7001 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7002 if (type
== value_type (val
))
7005 return coerce_unspec_val_to_type (val
, type
);
7011 /* Table mapping attribute numbers to names.
7012 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7014 static const char *attribute_names
[] = {
7032 ada_attribute_name (enum exp_opcode n
)
7034 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7035 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7037 return attribute_names
[0];
7040 /* Evaluate the 'POS attribute applied to ARG. */
7043 pos_atr (struct value
*arg
)
7045 struct type
*type
= value_type (arg
);
7047 if (!discrete_type_p (type
))
7048 error (_("'POS only defined on discrete types"));
7050 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7053 LONGEST v
= value_as_long (arg
);
7055 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7057 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7060 error (_("enumeration value is invalid: can't find 'POS"));
7063 return value_as_long (arg
);
7066 static struct value
*
7067 value_pos_atr (struct value
*arg
)
7069 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7072 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7074 static struct value
*
7075 value_val_atr (struct type
*type
, struct value
*arg
)
7077 if (!discrete_type_p (type
))
7078 error (_("'VAL only defined on discrete types"));
7079 if (!integer_type_p (value_type (arg
)))
7080 error (_("'VAL requires integral argument"));
7082 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7084 long pos
= value_as_long (arg
);
7085 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7086 error (_("argument to 'VAL out of range"));
7087 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7090 return value_from_longest (type
, value_as_long (arg
));
7096 /* True if TYPE appears to be an Ada character type.
7097 [At the moment, this is true only for Character and Wide_Character;
7098 It is a heuristic test that could stand improvement]. */
7101 ada_is_character_type (struct type
*type
)
7103 const char *name
= ada_type_name (type
);
7106 && (TYPE_CODE (type
) == TYPE_CODE_CHAR
7107 || TYPE_CODE (type
) == TYPE_CODE_INT
7108 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7109 && (strcmp (name
, "character") == 0
7110 || strcmp (name
, "wide_character") == 0
7111 || strcmp (name
, "unsigned char") == 0);
7114 /* True if TYPE appears to be an Ada string type. */
7117 ada_is_string_type (struct type
*type
)
7119 type
= ada_check_typedef (type
);
7121 && TYPE_CODE (type
) != TYPE_CODE_PTR
7122 && (ada_is_simple_array_type (type
)
7123 || ada_is_array_descriptor_type (type
))
7124 && ada_array_arity (type
) == 1)
7126 struct type
*elttype
= ada_array_element_type (type
, 1);
7128 return ada_is_character_type (elttype
);
7135 /* True if TYPE is a struct type introduced by the compiler to force the
7136 alignment of a value. Such types have a single field with a
7137 distinctive name. */
7140 ada_is_aligner_type (struct type
*type
)
7142 type
= ada_check_typedef (type
);
7144 /* If we can find a parallel XVS type, then the XVS type should
7145 be used instead of this type. And hence, this is not an aligner
7147 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7150 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7151 && TYPE_NFIELDS (type
) == 1
7152 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7155 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7156 the parallel type. */
7159 ada_get_base_type (struct type
*raw_type
)
7161 struct type
*real_type_namer
;
7162 struct type
*raw_real_type
;
7164 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7167 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7168 if (real_type_namer
== NULL
7169 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7170 || TYPE_NFIELDS (real_type_namer
) != 1)
7173 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7174 if (raw_real_type
== NULL
)
7177 return raw_real_type
;
7180 /* The type of value designated by TYPE, with all aligners removed. */
7183 ada_aligned_type (struct type
*type
)
7185 if (ada_is_aligner_type (type
))
7186 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7188 return ada_get_base_type (type
);
7192 /* The address of the aligned value in an object at address VALADDR
7193 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7196 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7198 if (ada_is_aligner_type (type
))
7199 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7201 TYPE_FIELD_BITPOS (type
,
7202 0) / TARGET_CHAR_BIT
);
7209 /* The printed representation of an enumeration literal with encoded
7210 name NAME. The value is good to the next call of ada_enum_name. */
7212 ada_enum_name (const char *name
)
7214 static char *result
;
7215 static size_t result_len
= 0;
7218 /* First, unqualify the enumeration name:
7219 1. Search for the last '.' character. If we find one, then skip
7220 all the preceeding characters, the unqualified name starts
7221 right after that dot.
7222 2. Otherwise, we may be debugging on a target where the compiler
7223 translates dots into "__". Search forward for double underscores,
7224 but stop searching when we hit an overloading suffix, which is
7225 of the form "__" followed by digits. */
7227 tmp
= strrchr (name
, '.');
7232 while ((tmp
= strstr (name
, "__")) != NULL
)
7234 if (isdigit (tmp
[2]))
7244 if (name
[1] == 'U' || name
[1] == 'W')
7246 if (sscanf (name
+ 2, "%x", &v
) != 1)
7252 GROW_VECT (result
, result_len
, 16);
7253 if (isascii (v
) && isprint (v
))
7254 sprintf (result
, "'%c'", v
);
7255 else if (name
[1] == 'U')
7256 sprintf (result
, "[\"%02x\"]", v
);
7258 sprintf (result
, "[\"%04x\"]", v
);
7264 tmp
= strstr (name
, "__");
7266 tmp
= strstr (name
, "$");
7269 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7270 strncpy (result
, name
, tmp
- name
);
7271 result
[tmp
- name
] = '\0';
7279 static struct value
*
7280 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7283 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7284 (expect_type
, exp
, pos
, noside
);
7287 /* Evaluate the subexpression of EXP starting at *POS as for
7288 evaluate_type, updating *POS to point just past the evaluated
7291 static struct value
*
7292 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7294 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7295 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7298 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7301 static struct value
*
7302 unwrap_value (struct value
*val
)
7304 struct type
*type
= ada_check_typedef (value_type (val
));
7305 if (ada_is_aligner_type (type
))
7307 struct value
*v
= value_struct_elt (&val
, NULL
, "F",
7308 NULL
, "internal structure");
7309 struct type
*val_type
= ada_check_typedef (value_type (v
));
7310 if (ada_type_name (val_type
) == NULL
)
7311 TYPE_NAME (val_type
) = ada_type_name (type
);
7313 return unwrap_value (v
);
7317 struct type
*raw_real_type
=
7318 ada_check_typedef (ada_get_base_type (type
));
7320 if (type
== raw_real_type
)
7324 coerce_unspec_val_to_type
7325 (val
, ada_to_fixed_type (raw_real_type
, 0,
7326 VALUE_ADDRESS (val
) + value_offset (val
),
7331 static struct value
*
7332 cast_to_fixed (struct type
*type
, struct value
*arg
)
7336 if (type
== value_type (arg
))
7338 else if (ada_is_fixed_point_type (value_type (arg
)))
7339 val
= ada_float_to_fixed (type
,
7340 ada_fixed_to_float (value_type (arg
),
7341 value_as_long (arg
)));
7345 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7346 val
= ada_float_to_fixed (type
, argd
);
7349 return value_from_longest (type
, val
);
7352 static struct value
*
7353 cast_from_fixed_to_double (struct value
*arg
)
7355 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7356 value_as_long (arg
));
7357 return value_from_double (builtin_type_double
, val
);
7360 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7361 return the converted value. */
7363 static struct value
*
7364 coerce_for_assign (struct type
*type
, struct value
*val
)
7366 struct type
*type2
= value_type (val
);
7370 type2
= ada_check_typedef (type2
);
7371 type
= ada_check_typedef (type
);
7373 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7374 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7376 val
= ada_value_ind (val
);
7377 type2
= value_type (val
);
7380 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7381 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7383 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7384 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7385 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7386 error (_("Incompatible types in assignment"));
7387 deprecated_set_value_type (val
, type
);
7392 static struct value
*
7393 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7396 struct type
*type1
, *type2
;
7399 arg1
= coerce_ref (arg1
);
7400 arg2
= coerce_ref (arg2
);
7401 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7402 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7404 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7405 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7406 return value_binop (arg1
, arg2
, op
);
7415 return value_binop (arg1
, arg2
, op
);
7418 v2
= value_as_long (arg2
);
7420 error (_("second operand of %s must not be zero."), op_string (op
));
7422 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7423 return value_binop (arg1
, arg2
, op
);
7425 v1
= value_as_long (arg1
);
7430 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7431 v
+= v
> 0 ? -1 : 1;
7439 /* Should not reach this point. */
7443 val
= allocate_value (type1
);
7444 store_unsigned_integer (value_contents_raw (val
),
7445 TYPE_LENGTH (value_type (val
)), v
);
7450 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7452 if (ada_is_direct_array_type (value_type (arg1
))
7453 || ada_is_direct_array_type (value_type (arg2
)))
7455 arg1
= ada_coerce_to_simple_array (arg1
);
7456 arg2
= ada_coerce_to_simple_array (arg2
);
7457 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7458 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7459 error (_("Attempt to compare array with non-array"));
7460 /* FIXME: The following works only for types whose
7461 representations use all bits (no padding or undefined bits)
7462 and do not have user-defined equality. */
7464 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7465 && memcmp (value_contents (arg1
), value_contents (arg2
),
7466 TYPE_LENGTH (value_type (arg1
))) == 0;
7468 return value_equal (arg1
, arg2
);
7471 /* Total number of component associations in the aggregate starting at
7472 index PC in EXP. Assumes that index PC is the start of an
7476 num_component_specs (struct expression
*exp
, int pc
)
7479 m
= exp
->elts
[pc
+ 1].longconst
;
7482 for (i
= 0; i
< m
; i
+= 1)
7484 switch (exp
->elts
[pc
].opcode
)
7490 n
+= exp
->elts
[pc
+ 1].longconst
;
7493 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7498 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7499 component of LHS (a simple array or a record), updating *POS past
7500 the expression, assuming that LHS is contained in CONTAINER. Does
7501 not modify the inferior's memory, nor does it modify LHS (unless
7502 LHS == CONTAINER). */
7505 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7506 struct expression
*exp
, int *pos
)
7508 struct value
*mark
= value_mark ();
7510 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
7512 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
7513 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
7517 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
7518 elt
= ada_to_fixed_value (unwrap_value (elt
));
7521 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7522 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
7524 value_assign_to_component (container
, elt
,
7525 ada_evaluate_subexp (NULL
, exp
, pos
,
7528 value_free_to_mark (mark
);
7531 /* Assuming that LHS represents an lvalue having a record or array
7532 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7533 of that aggregate's value to LHS, advancing *POS past the
7534 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7535 lvalue containing LHS (possibly LHS itself). Does not modify
7536 the inferior's memory, nor does it modify the contents of
7537 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7539 static struct value
*
7540 assign_aggregate (struct value
*container
,
7541 struct value
*lhs
, struct expression
*exp
,
7542 int *pos
, enum noside noside
)
7544 struct type
*lhs_type
;
7545 int n
= exp
->elts
[*pos
+1].longconst
;
7546 LONGEST low_index
, high_index
;
7549 int max_indices
, num_indices
;
7550 int is_array_aggregate
;
7552 struct value
*mark
= value_mark ();
7555 if (noside
!= EVAL_NORMAL
)
7558 for (i
= 0; i
< n
; i
+= 1)
7559 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
7563 container
= ada_coerce_ref (container
);
7564 if (ada_is_direct_array_type (value_type (container
)))
7565 container
= ada_coerce_to_simple_array (container
);
7566 lhs
= ada_coerce_ref (lhs
);
7567 if (!deprecated_value_modifiable (lhs
))
7568 error (_("Left operand of assignment is not a modifiable lvalue."));
7570 lhs_type
= value_type (lhs
);
7571 if (ada_is_direct_array_type (lhs_type
))
7573 lhs
= ada_coerce_to_simple_array (lhs
);
7574 lhs_type
= value_type (lhs
);
7575 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
7576 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
7577 is_array_aggregate
= 1;
7579 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
7582 high_index
= num_visible_fields (lhs_type
) - 1;
7583 is_array_aggregate
= 0;
7586 error (_("Left-hand side must be array or record."));
7588 num_specs
= num_component_specs (exp
, *pos
- 3);
7589 max_indices
= 4 * num_specs
+ 4;
7590 indices
= alloca (max_indices
* sizeof (indices
[0]));
7591 indices
[0] = indices
[1] = low_index
- 1;
7592 indices
[2] = indices
[3] = high_index
+ 1;
7595 for (i
= 0; i
< n
; i
+= 1)
7597 switch (exp
->elts
[*pos
].opcode
)
7600 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
7601 &num_indices
, max_indices
,
7602 low_index
, high_index
);
7605 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
7606 &num_indices
, max_indices
,
7607 low_index
, high_index
);
7611 error (_("Misplaced 'others' clause"));
7612 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
7613 num_indices
, low_index
, high_index
);
7616 error (_("Internal error: bad aggregate clause"));
7623 /* Assign into the component of LHS indexed by the OP_POSITIONAL
7624 construct at *POS, updating *POS past the construct, given that
7625 the positions are relative to lower bound LOW, where HIGH is the
7626 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
7627 updating *NUM_INDICES as needed. CONTAINER is as for
7628 assign_aggregate. */
7630 aggregate_assign_positional (struct value
*container
,
7631 struct value
*lhs
, struct expression
*exp
,
7632 int *pos
, LONGEST
*indices
, int *num_indices
,
7633 int max_indices
, LONGEST low
, LONGEST high
)
7635 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
7637 if (ind
- 1 == high
)
7638 warning (_("Extra components in aggregate ignored."));
7641 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
7643 assign_component (container
, lhs
, ind
, exp
, pos
);
7646 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7649 /* Assign into the components of LHS indexed by the OP_CHOICES
7650 construct at *POS, updating *POS past the construct, given that
7651 the allowable indices are LOW..HIGH. Record the indices assigned
7652 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
7653 needed. CONTAINER is as for assign_aggregate. */
7655 aggregate_assign_from_choices (struct value
*container
,
7656 struct value
*lhs
, struct expression
*exp
,
7657 int *pos
, LONGEST
*indices
, int *num_indices
,
7658 int max_indices
, LONGEST low
, LONGEST high
)
7661 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
7662 int choice_pos
, expr_pc
;
7663 int is_array
= ada_is_direct_array_type (value_type (lhs
));
7665 choice_pos
= *pos
+= 3;
7667 for (j
= 0; j
< n_choices
; j
+= 1)
7668 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7670 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7672 for (j
= 0; j
< n_choices
; j
+= 1)
7674 LONGEST lower
, upper
;
7675 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
7676 if (op
== OP_DISCRETE_RANGE
)
7679 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
7681 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
7686 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
7697 name
= &exp
->elts
[choice_pos
+ 2].string
;
7700 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
7703 error (_("Invalid record component association."));
7705 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
7707 if (! find_struct_field (name
, value_type (lhs
), 0,
7708 NULL
, NULL
, NULL
, NULL
, &ind
))
7709 error (_("Unknown component name: %s."), name
);
7710 lower
= upper
= ind
;
7713 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
7714 error (_("Index in component association out of bounds."));
7716 add_component_interval (lower
, upper
, indices
, num_indices
,
7718 while (lower
<= upper
)
7722 assign_component (container
, lhs
, lower
, exp
, &pos1
);
7728 /* Assign the value of the expression in the OP_OTHERS construct in
7729 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
7730 have not been previously assigned. The index intervals already assigned
7731 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
7732 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
7734 aggregate_assign_others (struct value
*container
,
7735 struct value
*lhs
, struct expression
*exp
,
7736 int *pos
, LONGEST
*indices
, int num_indices
,
7737 LONGEST low
, LONGEST high
)
7740 int expr_pc
= *pos
+1;
7742 for (i
= 0; i
< num_indices
- 2; i
+= 2)
7745 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
7749 assign_component (container
, lhs
, ind
, exp
, &pos
);
7752 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7755 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
7756 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
7757 modifying *SIZE as needed. It is an error if *SIZE exceeds
7758 MAX_SIZE. The resulting intervals do not overlap. */
7760 add_component_interval (LONGEST low
, LONGEST high
,
7761 LONGEST
* indices
, int *size
, int max_size
)
7764 for (i
= 0; i
< *size
; i
+= 2) {
7765 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
7768 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
7769 if (high
< indices
[kh
])
7771 if (low
< indices
[i
])
7773 indices
[i
+ 1] = indices
[kh
- 1];
7774 if (high
> indices
[i
+ 1])
7775 indices
[i
+ 1] = high
;
7776 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
7777 *size
-= kh
- i
- 2;
7780 else if (high
< indices
[i
])
7784 if (*size
== max_size
)
7785 error (_("Internal error: miscounted aggregate components."));
7787 for (j
= *size
-1; j
>= i
+2; j
-= 1)
7788 indices
[j
] = indices
[j
- 2];
7790 indices
[i
+ 1] = high
;
7793 static struct value
*
7794 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
7795 int *pos
, enum noside noside
)
7798 int tem
, tem2
, tem3
;
7800 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
7803 struct value
**argvec
;
7807 op
= exp
->elts
[pc
].opcode
;
7814 unwrap_value (evaluate_subexp_standard
7815 (expect_type
, exp
, pos
, noside
));
7819 struct value
*result
;
7821 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
7822 /* The result type will have code OP_STRING, bashed there from
7823 OP_ARRAY. Bash it back. */
7824 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
7825 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
7831 type
= exp
->elts
[pc
+ 1].type
;
7832 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
7833 if (noside
== EVAL_SKIP
)
7835 if (type
!= ada_check_typedef (value_type (arg1
)))
7837 if (ada_is_fixed_point_type (type
))
7838 arg1
= cast_to_fixed (type
, arg1
);
7839 else if (ada_is_fixed_point_type (value_type (arg1
)))
7840 arg1
= value_cast (type
, cast_from_fixed_to_double (arg1
));
7841 else if (VALUE_LVAL (arg1
) == lval_memory
)
7843 /* This is in case of the really obscure (and undocumented,
7844 but apparently expected) case of (Foo) Bar.all, where Bar
7845 is an integer constant and Foo is a dynamic-sized type.
7846 If we don't do this, ARG1 will simply be relabeled with
7848 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
7849 return value_zero (to_static_fixed_type (type
), not_lval
);
7851 ada_to_fixed_value_create
7852 (type
, VALUE_ADDRESS (arg1
) + value_offset (arg1
), 0);
7855 arg1
= value_cast (type
, arg1
);
7861 type
= exp
->elts
[pc
+ 1].type
;
7862 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
7865 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7866 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7868 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
7869 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
7871 return ada_value_assign (arg1
, arg1
);
7873 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
7874 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
7876 if (ada_is_fixed_point_type (value_type (arg1
)))
7877 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
7878 else if (ada_is_fixed_point_type (value_type (arg2
)))
7880 (_("Fixed-point values must be assigned to fixed-point variables"));
7882 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
7883 return ada_value_assign (arg1
, arg2
);
7886 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
7887 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
7888 if (noside
== EVAL_SKIP
)
7890 if ((ada_is_fixed_point_type (value_type (arg1
))
7891 || ada_is_fixed_point_type (value_type (arg2
)))
7892 && value_type (arg1
) != value_type (arg2
))
7893 error (_("Operands of fixed-point addition must have the same type"));
7894 return value_cast (value_type (arg1
), value_add (arg1
, arg2
));
7897 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
7898 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
7899 if (noside
== EVAL_SKIP
)
7901 if ((ada_is_fixed_point_type (value_type (arg1
))
7902 || ada_is_fixed_point_type (value_type (arg2
)))
7903 && value_type (arg1
) != value_type (arg2
))
7904 error (_("Operands of fixed-point subtraction must have the same type"));
7905 return value_cast (value_type (arg1
), value_sub (arg1
, arg2
));
7909 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7910 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7911 if (noside
== EVAL_SKIP
)
7913 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
7914 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
7915 return value_zero (value_type (arg1
), not_lval
);
7918 if (ada_is_fixed_point_type (value_type (arg1
)))
7919 arg1
= cast_from_fixed_to_double (arg1
);
7920 if (ada_is_fixed_point_type (value_type (arg2
)))
7921 arg2
= cast_from_fixed_to_double (arg2
);
7922 return ada_value_binop (arg1
, arg2
, op
);
7927 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7928 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7929 if (noside
== EVAL_SKIP
)
7931 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
7932 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
7933 return value_zero (value_type (arg1
), not_lval
);
7935 return ada_value_binop (arg1
, arg2
, op
);
7938 case BINOP_NOTEQUAL
:
7939 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7940 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
7941 if (noside
== EVAL_SKIP
)
7943 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
7946 tem
= ada_value_equal (arg1
, arg2
);
7947 if (op
== BINOP_NOTEQUAL
)
7949 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
7952 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
7953 if (noside
== EVAL_SKIP
)
7955 else if (ada_is_fixed_point_type (value_type (arg1
)))
7956 return value_cast (value_type (arg1
), value_neg (arg1
));
7958 return value_neg (arg1
);
7962 if (noside
== EVAL_SKIP
)
7967 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
7968 /* Only encountered when an unresolved symbol occurs in a
7969 context other than a function call, in which case, it is
7971 error (_("Unexpected unresolved symbol, %s, during evaluation"),
7972 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
7973 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
7977 (to_static_fixed_type
7978 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
7984 unwrap_value (evaluate_subexp_standard
7985 (expect_type
, exp
, pos
, noside
));
7986 return ada_to_fixed_value (arg1
);
7992 /* Allocate arg vector, including space for the function to be
7993 called in argvec[0] and a terminating NULL. */
7994 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
7996 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
7998 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
7999 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8000 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8001 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8004 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8005 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8008 if (noside
== EVAL_SKIP
)
8012 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8013 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8014 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8015 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8016 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8017 argvec
[0] = value_addr (argvec
[0]);
8019 type
= ada_check_typedef (value_type (argvec
[0]));
8020 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8022 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8024 case TYPE_CODE_FUNC
:
8025 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8027 case TYPE_CODE_ARRAY
:
8029 case TYPE_CODE_STRUCT
:
8030 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8031 argvec
[0] = ada_value_ind (argvec
[0]);
8032 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8035 error (_("cannot subscript or call something of type `%s'"),
8036 ada_type_name (value_type (argvec
[0])));
8041 switch (TYPE_CODE (type
))
8043 case TYPE_CODE_FUNC
:
8044 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8045 return allocate_value (TYPE_TARGET_TYPE (type
));
8046 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8047 case TYPE_CODE_STRUCT
:
8051 arity
= ada_array_arity (type
);
8052 type
= ada_array_element_type (type
, nargs
);
8054 error (_("cannot subscript or call a record"));
8056 error (_("wrong number of subscripts; expecting %d"), arity
);
8057 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8058 return allocate_value (ada_aligned_type (type
));
8060 unwrap_value (ada_value_subscript
8061 (argvec
[0], nargs
, argvec
+ 1));
8063 case TYPE_CODE_ARRAY
:
8064 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8066 type
= ada_array_element_type (type
, nargs
);
8068 error (_("element type of array unknown"));
8070 return allocate_value (ada_aligned_type (type
));
8073 unwrap_value (ada_value_subscript
8074 (ada_coerce_to_simple_array (argvec
[0]),
8075 nargs
, argvec
+ 1));
8076 case TYPE_CODE_PTR
: /* Pointer to array */
8077 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8078 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8080 type
= ada_array_element_type (type
, nargs
);
8082 error (_("element type of array unknown"));
8084 return allocate_value (ada_aligned_type (type
));
8087 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8088 nargs
, argvec
+ 1));
8091 error (_("Attempt to index or call something other than an "
8092 "array or function"));
8097 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8098 struct value
*low_bound_val
=
8099 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8100 struct value
*high_bound_val
=
8101 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8104 low_bound_val
= coerce_ref (low_bound_val
);
8105 high_bound_val
= coerce_ref (high_bound_val
);
8106 low_bound
= pos_atr (low_bound_val
);
8107 high_bound
= pos_atr (high_bound_val
);
8109 if (noside
== EVAL_SKIP
)
8112 /* If this is a reference to an aligner type, then remove all
8114 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8115 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8116 TYPE_TARGET_TYPE (value_type (array
)) =
8117 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8119 if (ada_is_packed_array_type (value_type (array
)))
8120 error (_("cannot slice a packed array"));
8122 /* If this is a reference to an array or an array lvalue,
8123 convert to a pointer. */
8124 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8125 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8126 && VALUE_LVAL (array
) == lval_memory
))
8127 array
= value_addr (array
);
8129 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8130 && ada_is_array_descriptor_type (ada_check_typedef
8131 (value_type (array
))))
8132 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8134 array
= ada_coerce_to_simple_array_ptr (array
);
8136 /* If we have more than one level of pointer indirection,
8137 dereference the value until we get only one level. */
8138 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8139 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8141 array
= value_ind (array
);
8143 /* Make sure we really do have an array type before going further,
8144 to avoid a SEGV when trying to get the index type or the target
8145 type later down the road if the debug info generated by
8146 the compiler is incorrect or incomplete. */
8147 if (!ada_is_simple_array_type (value_type (array
)))
8148 error (_("cannot take slice of non-array"));
8150 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8152 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8153 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8157 struct type
*arr_type0
=
8158 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8160 return ada_value_slice_ptr (array
, arr_type0
,
8161 longest_to_int (low_bound
),
8162 longest_to_int (high_bound
));
8165 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8167 else if (high_bound
< low_bound
)
8168 return empty_array (value_type (array
), low_bound
);
8170 return ada_value_slice (array
, longest_to_int (low_bound
),
8171 longest_to_int (high_bound
));
8176 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8177 type
= exp
->elts
[pc
+ 1].type
;
8179 if (noside
== EVAL_SKIP
)
8182 switch (TYPE_CODE (type
))
8185 lim_warning (_("Membership test incompletely implemented; "
8186 "always returns true"));
8187 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
8189 case TYPE_CODE_RANGE
:
8190 arg2
= value_from_longest (builtin_type_int
, TYPE_LOW_BOUND (type
));
8191 arg3
= value_from_longest (builtin_type_int
,
8192 TYPE_HIGH_BOUND (type
));
8194 value_from_longest (builtin_type_int
,
8195 (value_less (arg1
, arg3
)
8196 || value_equal (arg1
, arg3
))
8197 && (value_less (arg2
, arg1
)
8198 || value_equal (arg2
, arg1
)));
8201 case BINOP_IN_BOUNDS
:
8203 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8204 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8206 if (noside
== EVAL_SKIP
)
8209 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8210 return value_zero (builtin_type_int
, not_lval
);
8212 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8214 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8215 error (_("invalid dimension number to 'range"));
8217 arg3
= ada_array_bound (arg2
, tem
, 1);
8218 arg2
= ada_array_bound (arg2
, tem
, 0);
8221 value_from_longest (builtin_type_int
,
8222 (value_less (arg1
, arg3
)
8223 || value_equal (arg1
, arg3
))
8224 && (value_less (arg2
, arg1
)
8225 || value_equal (arg2
, arg1
)));
8227 case TERNOP_IN_RANGE
:
8228 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8229 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8230 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8232 if (noside
== EVAL_SKIP
)
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
)));
8246 struct type
*type_arg
;
8247 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8249 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8251 type_arg
= exp
->elts
[pc
+ 2].type
;
8255 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8259 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8260 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8261 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8264 if (noside
== EVAL_SKIP
)
8267 if (type_arg
== NULL
)
8269 arg1
= ada_coerce_ref (arg1
);
8271 if (ada_is_packed_array_type (value_type (arg1
)))
8272 arg1
= ada_coerce_to_simple_array (arg1
);
8274 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8275 error (_("invalid dimension number to '%s"),
8276 ada_attribute_name (op
));
8278 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8280 type
= ada_index_type (value_type (arg1
), tem
);
8283 (_("attempt to take bound of something that is not an array"));
8284 return allocate_value (type
);
8289 default: /* Should never happen. */
8290 error (_("unexpected attribute encountered"));
8292 return ada_array_bound (arg1
, tem
, 0);
8294 return ada_array_bound (arg1
, tem
, 1);
8296 return ada_array_length (arg1
, tem
);
8299 else if (discrete_type_p (type_arg
))
8301 struct type
*range_type
;
8302 char *name
= ada_type_name (type_arg
);
8304 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8306 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8307 if (range_type
== NULL
)
8308 range_type
= type_arg
;
8312 error (_("unexpected attribute encountered"));
8314 return discrete_type_low_bound (range_type
);
8316 return discrete_type_high_bound (range_type
);
8318 error (_("the 'length attribute applies only to array types"));
8321 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8322 error (_("unimplemented type attribute"));
8327 if (ada_is_packed_array_type (type_arg
))
8328 type_arg
= decode_packed_array_type (type_arg
);
8330 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8331 error (_("invalid dimension number to '%s"),
8332 ada_attribute_name (op
));
8334 type
= ada_index_type (type_arg
, tem
);
8337 (_("attempt to take bound of something that is not an array"));
8338 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8339 return allocate_value (type
);
8344 error (_("unexpected attribute encountered"));
8346 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8347 return value_from_longest (type
, low
);
8349 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8350 return value_from_longest (type
, high
);
8352 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8353 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8354 return value_from_longest (type
, high
- low
+ 1);
8360 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8361 if (noside
== EVAL_SKIP
)
8364 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8365 return value_zero (ada_tag_type (arg1
), not_lval
);
8367 return ada_value_tag (arg1
);
8371 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8372 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8373 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8374 if (noside
== EVAL_SKIP
)
8376 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8377 return value_zero (value_type (arg1
), not_lval
);
8379 return value_binop (arg1
, arg2
,
8380 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
8382 case OP_ATR_MODULUS
:
8384 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
8385 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8387 if (noside
== EVAL_SKIP
)
8390 if (!ada_is_modular_type (type_arg
))
8391 error (_("'modulus must be applied to modular type"));
8393 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
8394 ada_modulus (type_arg
));
8399 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8400 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8401 if (noside
== EVAL_SKIP
)
8403 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8404 return value_zero (builtin_type_int
, not_lval
);
8406 return value_pos_atr (arg1
);
8409 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8410 if (noside
== EVAL_SKIP
)
8412 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8413 return value_zero (builtin_type_int
, not_lval
);
8415 return value_from_longest (builtin_type_int
,
8417 * TYPE_LENGTH (value_type (arg1
)));
8420 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8421 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8422 type
= exp
->elts
[pc
+ 2].type
;
8423 if (noside
== EVAL_SKIP
)
8425 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8426 return value_zero (type
, not_lval
);
8428 return value_val_atr (type
, arg1
);
8431 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8432 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8433 if (noside
== EVAL_SKIP
)
8435 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8436 return value_zero (value_type (arg1
), not_lval
);
8438 return value_binop (arg1
, arg2
, op
);
8441 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8442 if (noside
== EVAL_SKIP
)
8448 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8449 if (noside
== EVAL_SKIP
)
8451 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
8452 return value_neg (arg1
);
8457 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
8458 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
8459 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
8460 if (noside
== EVAL_SKIP
)
8462 type
= ada_check_typedef (value_type (arg1
));
8463 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8465 if (ada_is_array_descriptor_type (type
))
8466 /* GDB allows dereferencing GNAT array descriptors. */
8468 struct type
*arrType
= ada_type_of_array (arg1
, 0);
8469 if (arrType
== NULL
)
8470 error (_("Attempt to dereference null array pointer."));
8471 return value_at_lazy (arrType
, 0);
8473 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
8474 || TYPE_CODE (type
) == TYPE_CODE_REF
8475 /* In C you can dereference an array to get the 1st elt. */
8476 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8478 type
= to_static_fixed_type
8480 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
8482 return value_zero (type
, lval_memory
);
8484 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
8485 /* GDB allows dereferencing an int. */
8486 return value_zero (builtin_type_int
, lval_memory
);
8488 error (_("Attempt to take contents of a non-pointer value."));
8490 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
8491 type
= ada_check_typedef (value_type (arg1
));
8493 if (ada_is_array_descriptor_type (type
))
8494 /* GDB allows dereferencing GNAT array descriptors. */
8495 return ada_coerce_to_simple_array (arg1
);
8497 return ada_value_ind (arg1
);
8499 case STRUCTOP_STRUCT
:
8500 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8501 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
8502 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8503 if (noside
== EVAL_SKIP
)
8505 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8507 struct type
*type1
= value_type (arg1
);
8508 if (ada_is_tagged_type (type1
, 1))
8510 type
= ada_lookup_struct_elt_type (type1
,
8511 &exp
->elts
[pc
+ 2].string
,
8514 /* In this case, we assume that the field COULD exist
8515 in some extension of the type. Return an object of
8516 "type" void, which will match any formal
8517 (see ada_type_match). */
8518 return value_zero (builtin_type_void
, lval_memory
);
8522 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
8525 return value_zero (ada_aligned_type (type
), lval_memory
);
8529 ada_to_fixed_value (unwrap_value
8530 (ada_value_struct_elt
8531 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
8533 /* The value is not supposed to be used. This is here to make it
8534 easier to accommodate expressions that contain types. */
8536 if (noside
== EVAL_SKIP
)
8538 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8539 return allocate_value (exp
->elts
[pc
+ 1].type
);
8541 error (_("Attempt to use a type name as an expression"));
8546 case OP_DISCRETE_RANGE
:
8549 if (noside
== EVAL_NORMAL
)
8553 error (_("Undefined name, ambiguous name, or renaming used in "
8554 "component association: %s."), &exp
->elts
[pc
+2].string
);
8556 error (_("Aggregates only allowed on the right of an assignment"));
8558 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
8561 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
8563 for (tem
= 0; tem
< nargs
; tem
+= 1)
8564 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8569 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
8575 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
8576 type name that encodes the 'small and 'delta information.
8577 Otherwise, return NULL. */
8580 fixed_type_info (struct type
*type
)
8582 const char *name
= ada_type_name (type
);
8583 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
8585 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
8587 const char *tail
= strstr (name
, "___XF_");
8593 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
8594 return fixed_type_info (TYPE_TARGET_TYPE (type
));
8599 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
8602 ada_is_fixed_point_type (struct type
*type
)
8604 return fixed_type_info (type
) != NULL
;
8607 /* Return non-zero iff TYPE represents a System.Address type. */
8610 ada_is_system_address_type (struct type
*type
)
8612 return (TYPE_NAME (type
)
8613 && strcmp (TYPE_NAME (type
), "system__address") == 0);
8616 /* Assuming that TYPE is the representation of an Ada fixed-point
8617 type, return its delta, or -1 if the type is malformed and the
8618 delta cannot be determined. */
8621 ada_delta (struct type
*type
)
8623 const char *encoding
= fixed_type_info (type
);
8626 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
8629 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
8632 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
8633 factor ('SMALL value) associated with the type. */
8636 scaling_factor (struct type
*type
)
8638 const char *encoding
= fixed_type_info (type
);
8639 unsigned long num0
, den0
, num1
, den1
;
8642 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
8647 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
8649 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
8653 /* Assuming that X is the representation of a value of fixed-point
8654 type TYPE, return its floating-point equivalent. */
8657 ada_fixed_to_float (struct type
*type
, LONGEST x
)
8659 return (DOUBLEST
) x
*scaling_factor (type
);
8662 /* The representation of a fixed-point value of type TYPE
8663 corresponding to the value X. */
8666 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
8668 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
8672 /* VAX floating formats */
8674 /* Non-zero iff TYPE represents one of the special VAX floating-point
8678 ada_is_vax_floating_type (struct type
*type
)
8681 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
8684 && (TYPE_CODE (type
) == TYPE_CODE_INT
8685 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8686 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
8689 /* The type of special VAX floating-point type this is, assuming
8690 ada_is_vax_floating_point. */
8693 ada_vax_float_type_suffix (struct type
*type
)
8695 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
8698 /* A value representing the special debugging function that outputs
8699 VAX floating-point values of the type represented by TYPE. Assumes
8700 ada_is_vax_floating_type (TYPE). */
8703 ada_vax_float_print_function (struct type
*type
)
8705 switch (ada_vax_float_type_suffix (type
))
8708 return get_var_value ("DEBUG_STRING_F", 0);
8710 return get_var_value ("DEBUG_STRING_D", 0);
8712 return get_var_value ("DEBUG_STRING_G", 0);
8714 error (_("invalid VAX floating-point type"));
8721 /* Scan STR beginning at position K for a discriminant name, and
8722 return the value of that discriminant field of DVAL in *PX. If
8723 PNEW_K is not null, put the position of the character beyond the
8724 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
8725 not alter *PX and *PNEW_K if unsuccessful. */
8728 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
8731 static char *bound_buffer
= NULL
;
8732 static size_t bound_buffer_len
= 0;
8735 struct value
*bound_val
;
8737 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
8740 pend
= strstr (str
+ k
, "__");
8744 k
+= strlen (bound
);
8748 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
8749 bound
= bound_buffer
;
8750 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
8751 bound
[pend
- (str
+ k
)] = '\0';
8755 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
8756 if (bound_val
== NULL
)
8759 *px
= value_as_long (bound_val
);
8765 /* Value of variable named NAME in the current environment. If
8766 no such variable found, then if ERR_MSG is null, returns 0, and
8767 otherwise causes an error with message ERR_MSG. */
8769 static struct value
*
8770 get_var_value (char *name
, char *err_msg
)
8772 struct ada_symbol_info
*syms
;
8775 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
8780 if (err_msg
== NULL
)
8783 error (("%s"), err_msg
);
8786 return value_of_variable (syms
[0].sym
, syms
[0].block
);
8789 /* Value of integer variable named NAME in the current environment. If
8790 no such variable found, returns 0, and sets *FLAG to 0. If
8791 successful, sets *FLAG to 1. */
8794 get_int_var_value (char *name
, int *flag
)
8796 struct value
*var_val
= get_var_value (name
, 0);
8808 return value_as_long (var_val
);
8813 /* Return a range type whose base type is that of the range type named
8814 NAME in the current environment, and whose bounds are calculated
8815 from NAME according to the GNAT range encoding conventions.
8816 Extract discriminant values, if needed, from DVAL. If a new type
8817 must be created, allocate in OBJFILE's space. The bounds
8818 information, in general, is encoded in NAME, the base type given in
8819 the named range type. */
8821 static struct type
*
8822 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
8824 struct type
*raw_type
= ada_find_any_type (name
);
8825 struct type
*base_type
;
8828 if (raw_type
== NULL
)
8829 base_type
= builtin_type_int
;
8830 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
8831 base_type
= TYPE_TARGET_TYPE (raw_type
);
8833 base_type
= raw_type
;
8835 subtype_info
= strstr (name
, "___XD");
8836 if (subtype_info
== NULL
)
8840 static char *name_buf
= NULL
;
8841 static size_t name_len
= 0;
8842 int prefix_len
= subtype_info
- name
;
8848 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
8849 strncpy (name_buf
, name
, prefix_len
);
8850 name_buf
[prefix_len
] = '\0';
8853 bounds_str
= strchr (subtype_info
, '_');
8856 if (*subtype_info
== 'L')
8858 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
8859 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
8861 if (bounds_str
[n
] == '_')
8863 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
8870 strcpy (name_buf
+ prefix_len
, "___L");
8871 L
= get_int_var_value (name_buf
, &ok
);
8874 lim_warning (_("Unknown lower bound, using 1."));
8879 if (*subtype_info
== 'U')
8881 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
8882 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
8888 strcpy (name_buf
+ prefix_len
, "___U");
8889 U
= get_int_var_value (name_buf
, &ok
);
8892 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
8897 if (objfile
== NULL
)
8898 objfile
= TYPE_OBJFILE (base_type
);
8899 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
8900 TYPE_NAME (type
) = name
;
8905 /* True iff NAME is the name of a range type. */
8908 ada_is_range_type_name (const char *name
)
8910 return (name
!= NULL
&& strstr (name
, "___XD"));
8916 /* True iff TYPE is an Ada modular type. */
8919 ada_is_modular_type (struct type
*type
)
8921 struct type
*subranged_type
= base_type (type
);
8923 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
8924 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
8925 && TYPE_UNSIGNED (subranged_type
));
8928 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
8931 ada_modulus (struct type
* type
)
8933 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
8937 /* Ada exception catchpoint support:
8938 ---------------------------------
8940 We support 3 kinds of exception catchpoints:
8941 . catchpoints on Ada exceptions
8942 . catchpoints on unhandled Ada exceptions
8943 . catchpoints on failed assertions
8945 Exceptions raised during failed assertions, or unhandled exceptions
8946 could perfectly be caught with the general catchpoint on Ada exceptions.
8947 However, we can easily differentiate these two special cases, and having
8948 the option to distinguish these two cases from the rest can be useful
8949 to zero-in on certain situations.
8951 Exception catchpoints are a specialized form of breakpoint,
8952 since they rely on inserting breakpoints inside known routines
8953 of the GNAT runtime. The implementation therefore uses a standard
8954 breakpoint structure of the BP_BREAKPOINT type, but with its own set
8957 Support in the runtime for exception catchpoints have been changed
8958 a few times already, and these changes affect the implementation
8959 of these catchpoints. In order to be able to support several
8960 variants of the runtime, we use a sniffer that will determine
8961 the runtime variant used by the program being debugged.
8963 At this time, we do not support the use of conditions on Ada exception
8964 catchpoints. The COND and COND_STRING fields are therefore set
8965 to NULL (most of the time, see below).
8967 Conditions where EXP_STRING, COND, and COND_STRING are used:
8969 When a user specifies the name of a specific exception in the case
8970 of catchpoints on Ada exceptions, we store the name of that exception
8971 in the EXP_STRING. We then translate this request into an actual
8972 condition stored in COND_STRING, and then parse it into an expression
8975 /* The different types of catchpoints that we introduced for catching
8978 enum exception_catchpoint_kind
8981 ex_catch_exception_unhandled
,
8985 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
8987 /* A structure that describes how to support exception catchpoints
8988 for a given executable. */
8990 struct exception_support_info
8992 /* The name of the symbol to break on in order to insert
8993 a catchpoint on exceptions. */
8994 const char *catch_exception_sym
;
8996 /* The name of the symbol to break on in order to insert
8997 a catchpoint on unhandled exceptions. */
8998 const char *catch_exception_unhandled_sym
;
9000 /* The name of the symbol to break on in order to insert
9001 a catchpoint on failed assertions. */
9002 const char *catch_assert_sym
;
9004 /* Assuming that the inferior just triggered an unhandled exception
9005 catchpoint, this function is responsible for returning the address
9006 in inferior memory where the name of that exception is stored.
9007 Return zero if the address could not be computed. */
9008 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9011 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9012 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9014 /* The following exception support info structure describes how to
9015 implement exception catchpoints with the latest version of the
9016 Ada runtime (as of 2007-03-06). */
9018 static const struct exception_support_info default_exception_support_info
=
9020 "__gnat_debug_raise_exception", /* catch_exception_sym */
9021 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9022 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9023 ada_unhandled_exception_name_addr
9026 /* The following exception support info structure describes how to
9027 implement exception catchpoints with a slightly older version
9028 of the Ada runtime. */
9030 static const struct exception_support_info exception_support_info_fallback
=
9032 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9033 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9034 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9035 ada_unhandled_exception_name_addr_from_raise
9038 /* For each executable, we sniff which exception info structure to use
9039 and cache it in the following global variable. */
9041 static const struct exception_support_info
*exception_info
= NULL
;
9043 /* Inspect the Ada runtime and determine which exception info structure
9044 should be used to provide support for exception catchpoints.
9046 This function will always set exception_info, or raise an error. */
9049 ada_exception_support_info_sniffer (void)
9053 /* If the exception info is already known, then no need to recompute it. */
9054 if (exception_info
!= NULL
)
9057 /* Check the latest (default) exception support info. */
9058 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9062 exception_info
= &default_exception_support_info
;
9066 /* Try our fallback exception suport info. */
9067 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9071 exception_info
= &exception_support_info_fallback
;
9075 /* Sometimes, it is normal for us to not be able to find the routine
9076 we are looking for. This happens when the program is linked with
9077 the shared version of the GNAT runtime, and the program has not been
9078 started yet. Inform the user of these two possible causes if
9081 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9082 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9084 /* If the symbol does not exist, then check that the program is
9085 already started, to make sure that shared libraries have been
9086 loaded. If it is not started, this may mean that the symbol is
9087 in a shared library. */
9089 if (ptid_get_pid (inferior_ptid
) == 0)
9090 error (_("Unable to insert catchpoint. Try to start the program first."));
9092 /* At this point, we know that we are debugging an Ada program and
9093 that the inferior has been started, but we still are not able to
9094 find the run-time symbols. That can mean that we are in
9095 configurable run time mode, or that a-except as been optimized
9096 out by the linker... In any case, at this point it is not worth
9097 supporting this feature. */
9099 error (_("Cannot insert catchpoints in this configuration."));
9102 /* An observer of "executable_changed" events.
9103 Its role is to clear certain cached values that need to be recomputed
9104 each time a new executable is loaded by GDB. */
9107 ada_executable_changed_observer (void *unused
)
9109 /* If the executable changed, then it is possible that the Ada runtime
9110 is different. So we need to invalidate the exception support info
9112 exception_info
= NULL
;
9115 /* Return the name of the function at PC, NULL if could not find it.
9116 This function only checks the debugging information, not the symbol
9120 function_name_from_pc (CORE_ADDR pc
)
9124 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9130 /* True iff FRAME is very likely to be that of a function that is
9131 part of the runtime system. This is all very heuristic, but is
9132 intended to be used as advice as to what frames are uninteresting
9136 is_known_support_routine (struct frame_info
*frame
)
9138 struct symtab_and_line sal
;
9142 /* If this code does not have any debugging information (no symtab),
9143 This cannot be any user code. */
9145 find_frame_sal (frame
, &sal
);
9146 if (sal
.symtab
== NULL
)
9149 /* If there is a symtab, but the associated source file cannot be
9150 located, then assume this is not user code: Selecting a frame
9151 for which we cannot display the code would not be very helpful
9152 for the user. This should also take care of case such as VxWorks
9153 where the kernel has some debugging info provided for a few units. */
9155 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9158 /* Check the unit filename againt the Ada runtime file naming.
9159 We also check the name of the objfile against the name of some
9160 known system libraries that sometimes come with debugging info
9163 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9165 re_comp (known_runtime_file_name_patterns
[i
]);
9166 if (re_exec (sal
.symtab
->filename
))
9168 if (sal
.symtab
->objfile
!= NULL
9169 && re_exec (sal
.symtab
->objfile
->name
))
9173 /* Check whether the function is a GNAT-generated entity. */
9175 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9176 if (func_name
== NULL
)
9179 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9181 re_comp (known_auxiliary_function_name_patterns
[i
]);
9182 if (re_exec (func_name
))
9189 /* Find the first frame that contains debugging information and that is not
9190 part of the Ada run-time, starting from FI and moving upward. */
9193 ada_find_printable_frame (struct frame_info
*fi
)
9195 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9197 if (!is_known_support_routine (fi
))
9206 /* Assuming that the inferior just triggered an unhandled exception
9207 catchpoint, return the address in inferior memory where the name
9208 of the exception is stored.
9210 Return zero if the address could not be computed. */
9213 ada_unhandled_exception_name_addr (void)
9215 return parse_and_eval_address ("e.full_name");
9218 /* Same as ada_unhandled_exception_name_addr, except that this function
9219 should be used when the inferior uses an older version of the runtime,
9220 where the exception name needs to be extracted from a specific frame
9221 several frames up in the callstack. */
9224 ada_unhandled_exception_name_addr_from_raise (void)
9227 struct frame_info
*fi
;
9229 /* To determine the name of this exception, we need to select
9230 the frame corresponding to RAISE_SYM_NAME. This frame is
9231 at least 3 levels up, so we simply skip the first 3 frames
9232 without checking the name of their associated function. */
9233 fi
= get_current_frame ();
9234 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9236 fi
= get_prev_frame (fi
);
9240 const char *func_name
=
9241 function_name_from_pc (get_frame_address_in_block (fi
));
9242 if (func_name
!= NULL
9243 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9244 break; /* We found the frame we were looking for... */
9245 fi
= get_prev_frame (fi
);
9252 return parse_and_eval_address ("id.full_name");
9255 /* Assuming the inferior just triggered an Ada exception catchpoint
9256 (of any type), return the address in inferior memory where the name
9257 of the exception is stored, if applicable.
9259 Return zero if the address could not be computed, or if not relevant. */
9262 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9263 struct breakpoint
*b
)
9267 case ex_catch_exception
:
9268 return (parse_and_eval_address ("e.full_name"));
9271 case ex_catch_exception_unhandled
:
9272 return exception_info
->unhandled_exception_name_addr ();
9275 case ex_catch_assert
:
9276 return 0; /* Exception name is not relevant in this case. */
9280 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9284 return 0; /* Should never be reached. */
9287 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9288 any error that ada_exception_name_addr_1 might cause to be thrown.
9289 When an error is intercepted, a warning with the error message is printed,
9290 and zero is returned. */
9293 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9294 struct breakpoint
*b
)
9296 struct gdb_exception e
;
9297 CORE_ADDR result
= 0;
9299 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9301 result
= ada_exception_name_addr_1 (ex
, b
);
9306 warning (_("failed to get exception name: %s"), e
.message
);
9313 /* Implement the PRINT_IT method in the breakpoint_ops structure
9314 for all exception catchpoint kinds. */
9316 static enum print_stop_action
9317 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
9319 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
9320 char exception_name
[256];
9324 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
9325 exception_name
[sizeof (exception_name
) - 1] = '\0';
9328 ada_find_printable_frame (get_current_frame ());
9330 annotate_catchpoint (b
->number
);
9333 case ex_catch_exception
:
9335 printf_filtered (_("\nCatchpoint %d, %s at "),
9336 b
->number
, exception_name
);
9338 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
9340 case ex_catch_exception_unhandled
:
9342 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
9343 b
->number
, exception_name
);
9345 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
9348 case ex_catch_assert
:
9349 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
9354 return PRINT_SRC_AND_LOC
;
9357 /* Implement the PRINT_ONE method in the breakpoint_ops structure
9358 for all exception catchpoint kinds. */
9361 print_one_exception (enum exception_catchpoint_kind ex
,
9362 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9367 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
9371 *last_addr
= b
->loc
->address
;
9374 case ex_catch_exception
:
9375 if (b
->exp_string
!= NULL
)
9377 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
9379 ui_out_field_string (uiout
, "what", msg
);
9383 ui_out_field_string (uiout
, "what", "all Ada exceptions");
9387 case ex_catch_exception_unhandled
:
9388 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
9391 case ex_catch_assert
:
9392 ui_out_field_string (uiout
, "what", "failed Ada assertions");
9396 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9401 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
9402 for all exception catchpoint kinds. */
9405 print_mention_exception (enum exception_catchpoint_kind ex
,
9406 struct breakpoint
*b
)
9410 case ex_catch_exception
:
9411 if (b
->exp_string
!= NULL
)
9412 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
9413 b
->number
, b
->exp_string
);
9415 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
9419 case ex_catch_exception_unhandled
:
9420 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
9424 case ex_catch_assert
:
9425 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
9429 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9434 /* Virtual table for "catch exception" breakpoints. */
9436 static enum print_stop_action
9437 print_it_catch_exception (struct breakpoint
*b
)
9439 return print_it_exception (ex_catch_exception
, b
);
9443 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9445 print_one_exception (ex_catch_exception
, b
, last_addr
);
9449 print_mention_catch_exception (struct breakpoint
*b
)
9451 print_mention_exception (ex_catch_exception
, b
);
9454 static struct breakpoint_ops catch_exception_breakpoint_ops
=
9456 print_it_catch_exception
,
9457 print_one_catch_exception
,
9458 print_mention_catch_exception
9461 /* Virtual table for "catch exception unhandled" breakpoints. */
9463 static enum print_stop_action
9464 print_it_catch_exception_unhandled (struct breakpoint
*b
)
9466 return print_it_exception (ex_catch_exception_unhandled
, b
);
9470 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9472 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
9476 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
9478 print_mention_exception (ex_catch_exception_unhandled
, b
);
9481 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
9482 print_it_catch_exception_unhandled
,
9483 print_one_catch_exception_unhandled
,
9484 print_mention_catch_exception_unhandled
9487 /* Virtual table for "catch assert" breakpoints. */
9489 static enum print_stop_action
9490 print_it_catch_assert (struct breakpoint
*b
)
9492 return print_it_exception (ex_catch_assert
, b
);
9496 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9498 print_one_exception (ex_catch_assert
, b
, last_addr
);
9502 print_mention_catch_assert (struct breakpoint
*b
)
9504 print_mention_exception (ex_catch_assert
, b
);
9507 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
9508 print_it_catch_assert
,
9509 print_one_catch_assert
,
9510 print_mention_catch_assert
9513 /* Return non-zero if B is an Ada exception catchpoint. */
9516 ada_exception_catchpoint_p (struct breakpoint
*b
)
9518 return (b
->ops
== &catch_exception_breakpoint_ops
9519 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
9520 || b
->ops
== &catch_assert_breakpoint_ops
);
9523 /* Return a newly allocated copy of the first space-separated token
9524 in ARGSP, and then adjust ARGSP to point immediately after that
9527 Return NULL if ARGPS does not contain any more tokens. */
9530 ada_get_next_arg (char **argsp
)
9532 char *args
= *argsp
;
9536 /* Skip any leading white space. */
9538 while (isspace (*args
))
9541 if (args
[0] == '\0')
9542 return NULL
; /* No more arguments. */
9544 /* Find the end of the current argument. */
9547 while (*end
!= '\0' && !isspace (*end
))
9550 /* Adjust ARGSP to point to the start of the next argument. */
9554 /* Make a copy of the current argument and return it. */
9556 result
= xmalloc (end
- args
+ 1);
9557 strncpy (result
, args
, end
- args
);
9558 result
[end
- args
] = '\0';
9563 /* Split the arguments specified in a "catch exception" command.
9564 Set EX to the appropriate catchpoint type.
9565 Set EXP_STRING to the name of the specific exception if
9566 specified by the user. */
9569 catch_ada_exception_command_split (char *args
,
9570 enum exception_catchpoint_kind
*ex
,
9573 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
9574 char *exception_name
;
9576 exception_name
= ada_get_next_arg (&args
);
9577 make_cleanup (xfree
, exception_name
);
9579 /* Check that we do not have any more arguments. Anything else
9582 while (isspace (*args
))
9585 if (args
[0] != '\0')
9586 error (_("Junk at end of expression"));
9588 discard_cleanups (old_chain
);
9590 if (exception_name
== NULL
)
9592 /* Catch all exceptions. */
9593 *ex
= ex_catch_exception
;
9596 else if (strcmp (exception_name
, "unhandled") == 0)
9598 /* Catch unhandled exceptions. */
9599 *ex
= ex_catch_exception_unhandled
;
9604 /* Catch a specific exception. */
9605 *ex
= ex_catch_exception
;
9606 *exp_string
= exception_name
;
9610 /* Return the name of the symbol on which we should break in order to
9611 implement a catchpoint of the EX kind. */
9614 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
9616 gdb_assert (exception_info
!= NULL
);
9620 case ex_catch_exception
:
9621 return (exception_info
->catch_exception_sym
);
9623 case ex_catch_exception_unhandled
:
9624 return (exception_info
->catch_exception_unhandled_sym
);
9626 case ex_catch_assert
:
9627 return (exception_info
->catch_assert_sym
);
9630 internal_error (__FILE__
, __LINE__
,
9631 _("unexpected catchpoint kind (%d)"), ex
);
9635 /* Return the breakpoint ops "virtual table" used for catchpoints
9638 static struct breakpoint_ops
*
9639 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
9643 case ex_catch_exception
:
9644 return (&catch_exception_breakpoint_ops
);
9646 case ex_catch_exception_unhandled
:
9647 return (&catch_exception_unhandled_breakpoint_ops
);
9649 case ex_catch_assert
:
9650 return (&catch_assert_breakpoint_ops
);
9653 internal_error (__FILE__
, __LINE__
,
9654 _("unexpected catchpoint kind (%d)"), ex
);
9658 /* Return the condition that will be used to match the current exception
9659 being raised with the exception that the user wants to catch. This
9660 assumes that this condition is used when the inferior just triggered
9661 an exception catchpoint.
9663 The string returned is a newly allocated string that needs to be
9664 deallocated later. */
9667 ada_exception_catchpoint_cond_string (const char *exp_string
)
9669 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
9672 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
9674 static struct expression
*
9675 ada_parse_catchpoint_condition (char *cond_string
,
9676 struct symtab_and_line sal
)
9678 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
9681 /* Return the symtab_and_line that should be used to insert an exception
9682 catchpoint of the TYPE kind.
9684 EX_STRING should contain the name of a specific exception
9685 that the catchpoint should catch, or NULL otherwise.
9687 The idea behind all the remaining parameters is that their names match
9688 the name of certain fields in the breakpoint structure that are used to
9689 handle exception catchpoints. This function returns the value to which
9690 these fields should be set, depending on the type of catchpoint we need
9693 If COND and COND_STRING are both non-NULL, any value they might
9694 hold will be free'ed, and then replaced by newly allocated ones.
9695 These parameters are left untouched otherwise. */
9697 static struct symtab_and_line
9698 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
9699 char **addr_string
, char **cond_string
,
9700 struct expression
**cond
, struct breakpoint_ops
**ops
)
9702 const char *sym_name
;
9704 struct symtab_and_line sal
;
9706 /* First, find out which exception support info to use. */
9707 ada_exception_support_info_sniffer ();
9709 /* Then lookup the function on which we will break in order to catch
9710 the Ada exceptions requested by the user. */
9712 sym_name
= ada_exception_sym_name (ex
);
9713 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
9715 /* The symbol we're looking up is provided by a unit in the GNAT runtime
9716 that should be compiled with debugging information. As a result, we
9717 expect to find that symbol in the symtabs. If we don't find it, then
9718 the target most likely does not support Ada exceptions, or we cannot
9719 insert exception breakpoints yet, because the GNAT runtime hasn't been
9722 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
9723 in such a way that no debugging information is produced for the symbol
9724 we are looking for. In this case, we could search the minimal symbols
9725 as a fall-back mechanism. This would still be operating in degraded
9726 mode, however, as we would still be missing the debugging information
9727 that is needed in order to extract the name of the exception being
9728 raised (this name is printed in the catchpoint message, and is also
9729 used when trying to catch a specific exception). We do not handle
9730 this case for now. */
9733 error (_("Unable to break on '%s' in this configuration."), sym_name
);
9735 /* Make sure that the symbol we found corresponds to a function. */
9736 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
9737 error (_("Symbol \"%s\" is not a function (class = %d)"),
9738 sym_name
, SYMBOL_CLASS (sym
));
9740 sal
= find_function_start_sal (sym
, 1);
9742 /* Set ADDR_STRING. */
9744 *addr_string
= xstrdup (sym_name
);
9746 /* Set the COND and COND_STRING (if not NULL). */
9748 if (cond_string
!= NULL
&& cond
!= NULL
)
9750 if (*cond_string
!= NULL
)
9752 xfree (*cond_string
);
9753 *cond_string
= NULL
;
9760 if (exp_string
!= NULL
)
9762 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
9763 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
9768 *ops
= ada_exception_breakpoint_ops (ex
);
9773 /* Parse the arguments (ARGS) of the "catch exception" command.
9775 Set TYPE to the appropriate exception catchpoint type.
9776 If the user asked the catchpoint to catch only a specific
9777 exception, then save the exception name in ADDR_STRING.
9779 See ada_exception_sal for a description of all the remaining
9780 function arguments of this function. */
9782 struct symtab_and_line
9783 ada_decode_exception_location (char *args
, char **addr_string
,
9784 char **exp_string
, char **cond_string
,
9785 struct expression
**cond
,
9786 struct breakpoint_ops
**ops
)
9788 enum exception_catchpoint_kind ex
;
9790 catch_ada_exception_command_split (args
, &ex
, exp_string
);
9791 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
9795 struct symtab_and_line
9796 ada_decode_assert_location (char *args
, char **addr_string
,
9797 struct breakpoint_ops
**ops
)
9799 /* Check that no argument where provided at the end of the command. */
9803 while (isspace (*args
))
9806 error (_("Junk at end of arguments."));
9809 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
9814 /* Information about operators given special treatment in functions
9816 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
9818 #define ADA_OPERATORS \
9819 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
9820 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
9821 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
9822 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
9823 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
9824 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
9825 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
9826 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
9827 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
9828 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
9829 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
9830 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
9831 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
9832 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
9833 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
9834 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
9835 OP_DEFN (OP_OTHERS, 1, 1, 0) \
9836 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
9837 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
9840 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
9842 switch (exp
->elts
[pc
- 1].opcode
)
9845 operator_length_standard (exp
, pc
, oplenp
, argsp
);
9848 #define OP_DEFN(op, len, args, binop) \
9849 case op: *oplenp = len; *argsp = args; break;
9855 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
9860 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
9866 ada_op_name (enum exp_opcode opcode
)
9871 return op_name_standard (opcode
);
9873 #define OP_DEFN(op, len, args, binop) case op: return #op;
9878 return "OP_AGGREGATE";
9880 return "OP_CHOICES";
9886 /* As for operator_length, but assumes PC is pointing at the first
9887 element of the operator, and gives meaningful results only for the
9888 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
9891 ada_forward_operator_length (struct expression
*exp
, int pc
,
9892 int *oplenp
, int *argsp
)
9894 switch (exp
->elts
[pc
].opcode
)
9897 *oplenp
= *argsp
= 0;
9900 #define OP_DEFN(op, len, args, binop) \
9901 case op: *oplenp = len; *argsp = args; break;
9907 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9912 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
9918 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9919 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
9927 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
9929 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
9934 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
9938 /* Ada attributes ('Foo). */
9945 case OP_ATR_MODULUS
:
9954 /* XXX: gdb_sprint_host_address, type_sprint */
9955 fprintf_filtered (stream
, _("Type @"));
9956 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
9957 fprintf_filtered (stream
, " (");
9958 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
9959 fprintf_filtered (stream
, ")");
9961 case BINOP_IN_BOUNDS
:
9962 fprintf_filtered (stream
, " (%d)",
9963 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
9965 case TERNOP_IN_RANGE
:
9970 case OP_DISCRETE_RANGE
:
9978 char *name
= &exp
->elts
[elt
+ 2].string
;
9979 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
9980 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
9985 return dump_subexp_body_standard (exp
, stream
, elt
);
9989 for (i
= 0; i
< nargs
; i
+= 1)
9990 elt
= dump_subexp (exp
, stream
, elt
);
9995 /* The Ada extension of print_subexp (q.v.). */
9998 ada_print_subexp (struct expression
*exp
, int *pos
,
9999 struct ui_file
*stream
, enum precedence prec
)
10001 int oplen
, nargs
, i
;
10003 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10005 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10012 print_subexp_standard (exp
, pos
, stream
, prec
);
10016 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10019 case BINOP_IN_BOUNDS
:
10020 /* XXX: sprint_subexp */
10021 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10022 fputs_filtered (" in ", stream
);
10023 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10024 fputs_filtered ("'range", stream
);
10025 if (exp
->elts
[pc
+ 1].longconst
> 1)
10026 fprintf_filtered (stream
, "(%ld)",
10027 (long) exp
->elts
[pc
+ 1].longconst
);
10030 case TERNOP_IN_RANGE
:
10031 if (prec
>= PREC_EQUAL
)
10032 fputs_filtered ("(", stream
);
10033 /* XXX: sprint_subexp */
10034 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10035 fputs_filtered (" in ", stream
);
10036 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10037 fputs_filtered (" .. ", stream
);
10038 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10039 if (prec
>= PREC_EQUAL
)
10040 fputs_filtered (")", stream
);
10045 case OP_ATR_LENGTH
:
10049 case OP_ATR_MODULUS
:
10054 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10056 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10057 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10061 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10062 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10066 for (tem
= 1; tem
< nargs
; tem
+= 1)
10068 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10069 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10071 fputs_filtered (")", stream
);
10076 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10077 fputs_filtered ("'(", stream
);
10078 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10079 fputs_filtered (")", stream
);
10082 case UNOP_IN_RANGE
:
10083 /* XXX: sprint_subexp */
10084 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10085 fputs_filtered (" in ", stream
);
10086 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10089 case OP_DISCRETE_RANGE
:
10090 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10091 fputs_filtered ("..", stream
);
10092 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10096 fputs_filtered ("others => ", stream
);
10097 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10101 for (i
= 0; i
< nargs
-1; i
+= 1)
10104 fputs_filtered ("|", stream
);
10105 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10107 fputs_filtered (" => ", stream
);
10108 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10111 case OP_POSITIONAL
:
10112 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10116 fputs_filtered ("(", stream
);
10117 for (i
= 0; i
< nargs
; i
+= 1)
10120 fputs_filtered (", ", stream
);
10121 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10123 fputs_filtered (")", stream
);
10128 /* Table mapping opcodes into strings for printing operators
10129 and precedences of the operators. */
10131 static const struct op_print ada_op_print_tab
[] = {
10132 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10133 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10134 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10135 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10136 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10137 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10138 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10139 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10140 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10141 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10142 {">", BINOP_GTR
, PREC_ORDER
, 0},
10143 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10144 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10145 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10146 {"+", BINOP_ADD
, PREC_ADD
, 0},
10147 {"-", BINOP_SUB
, PREC_ADD
, 0},
10148 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10149 {"*", BINOP_MUL
, PREC_MUL
, 0},
10150 {"/", BINOP_DIV
, PREC_MUL
, 0},
10151 {"rem", BINOP_REM
, PREC_MUL
, 0},
10152 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10153 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10154 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10155 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10156 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10157 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10158 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10159 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10160 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10161 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10162 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10166 enum ada_primitive_types
{
10167 ada_primitive_type_int
,
10168 ada_primitive_type_long
,
10169 ada_primitive_type_short
,
10170 ada_primitive_type_char
,
10171 ada_primitive_type_float
,
10172 ada_primitive_type_double
,
10173 ada_primitive_type_void
,
10174 ada_primitive_type_long_long
,
10175 ada_primitive_type_long_double
,
10176 ada_primitive_type_natural
,
10177 ada_primitive_type_positive
,
10178 ada_primitive_type_system_address
,
10179 nr_ada_primitive_types
10183 ada_language_arch_info (struct gdbarch
*gdbarch
,
10184 struct language_arch_info
*lai
)
10186 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10187 lai
->primitive_type_vector
10188 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10190 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10191 init_type (TYPE_CODE_INT
,
10192 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10193 0, "integer", (struct objfile
*) NULL
);
10194 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10195 init_type (TYPE_CODE_INT
,
10196 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10197 0, "long_integer", (struct objfile
*) NULL
);
10198 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10199 init_type (TYPE_CODE_INT
,
10200 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10201 0, "short_integer", (struct objfile
*) NULL
);
10202 lai
->string_char_type
=
10203 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10204 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10205 0, "character", (struct objfile
*) NULL
);
10206 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10207 init_type (TYPE_CODE_FLT
,
10208 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10209 0, "float", (struct objfile
*) NULL
);
10210 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10211 init_type (TYPE_CODE_FLT
,
10212 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10213 0, "long_float", (struct objfile
*) NULL
);
10214 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10215 init_type (TYPE_CODE_INT
,
10216 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10217 0, "long_long_integer", (struct objfile
*) NULL
);
10218 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10219 init_type (TYPE_CODE_FLT
,
10220 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10221 0, "long_long_float", (struct objfile
*) NULL
);
10222 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10223 init_type (TYPE_CODE_INT
,
10224 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10225 0, "natural", (struct objfile
*) NULL
);
10226 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10227 init_type (TYPE_CODE_INT
,
10228 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10229 0, "positive", (struct objfile
*) NULL
);
10230 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10232 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10233 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10234 (struct objfile
*) NULL
));
10235 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10236 = "system__address";
10239 /* Language vector */
10241 /* Not really used, but needed in the ada_language_defn. */
10244 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10246 ada_emit_char (c
, stream
, quoter
, 1);
10252 warnings_issued
= 0;
10253 return ada_parse ();
10256 static const struct exp_descriptor ada_exp_descriptor
= {
10258 ada_operator_length
,
10260 ada_dump_subexp_body
,
10261 ada_evaluate_subexp
10264 const struct language_defn ada_language_defn
= {
10265 "ada", /* Language name */
10269 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10270 that's not quite what this means. */
10272 &ada_exp_descriptor
,
10276 ada_printchar
, /* Print a character constant */
10277 ada_printstr
, /* Function to print string constant */
10278 emit_char
, /* Function to print single char (not used) */
10279 ada_print_type
, /* Print a type using appropriate syntax */
10280 ada_val_print
, /* Print a value using appropriate syntax */
10281 ada_value_print
, /* Print a top-level value */
10282 NULL
, /* Language specific skip_trampoline */
10283 NULL
, /* value_of_this */
10284 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10285 basic_lookup_transparent_type
, /* lookup_transparent_type */
10286 ada_la_decode
, /* Language specific symbol demangler */
10287 NULL
, /* Language specific class_name_from_physname */
10288 ada_op_print_tab
, /* expression operators for printing */
10289 0, /* c-style arrays */
10290 1, /* String lower bound */
10291 ada_get_gdb_completer_word_break_characters
,
10292 ada_language_arch_info
,
10293 ada_print_array_index
,
10294 default_pass_by_reference
,
10299 _initialize_ada_language (void)
10301 add_language (&ada_language_defn
);
10303 varsize_limit
= 65536;
10305 obstack_init (&symbol_list_obstack
);
10307 decoded_names_store
= htab_create_alloc
10308 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
10309 NULL
, xcalloc
, xfree
);