1 /* Ada language support routines for GDB, the GNU debugger. Copyright
2 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004.
3 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
23 #include "gdb_string.h"
27 #include "gdb_regex.h"
32 #include "expression.h"
33 #include "parser-defs.h"
39 #include "breakpoint.h"
42 #include "gdb_obstack.h"
44 #include "completer.h"
51 #include "dictionary.h"
53 #ifndef ADA_RETAIN_DOTS
54 #define ADA_RETAIN_DOTS 0
57 /* Define whether or not the C operator '/' truncates towards zero for
58 differently signed operands (truncation direction is undefined in C).
59 Copied from valarith.c. */
61 #ifndef TRUNCATION_TOWARDS_ZERO
62 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
65 /* A structure that contains a vector of strings.
66 The main purpose of this type is to group the vector and its
67 associated parameters in one structure. This makes it easier
68 to handle and pass around. */
72 char **array
; /* The vector itself. */
73 int index
; /* Index of the next available element in the array. */
74 size_t size
; /* The number of entries allocated in the array. */
77 static struct string_vector
xnew_string_vector (int initial_size
);
78 static void string_vector_append (struct string_vector
*sv
, char *str
);
80 static const char *ada_unqualified_name (const char *decoded_name
);
81 static char *add_angle_brackets (const char *str
);
82 static void extract_string (CORE_ADDR addr
, char *buf
);
83 static char *function_name_from_pc (CORE_ADDR pc
);
85 static struct type
*ada_create_fundamental_type (struct objfile
*, int);
87 static void modify_general_field (char *, LONGEST
, int, int);
89 static struct type
*desc_base_type (struct type
*);
91 static struct type
*desc_bounds_type (struct type
*);
93 static struct value
*desc_bounds (struct value
*);
95 static int fat_pntr_bounds_bitpos (struct type
*);
97 static int fat_pntr_bounds_bitsize (struct type
*);
99 static struct type
*desc_data_type (struct type
*);
101 static struct value
*desc_data (struct value
*);
103 static int fat_pntr_data_bitpos (struct type
*);
105 static int fat_pntr_data_bitsize (struct type
*);
107 static struct value
*desc_one_bound (struct value
*, int, int);
109 static int desc_bound_bitpos (struct type
*, int, int);
111 static int desc_bound_bitsize (struct type
*, int, int);
113 static struct type
*desc_index_type (struct type
*, int);
115 static int desc_arity (struct type
*);
117 static int ada_type_match (struct type
*, struct type
*, int);
119 static int ada_args_match (struct symbol
*, struct value
**, int);
121 static struct value
*ensure_lval (struct value
*, CORE_ADDR
*);
123 static struct value
*convert_actual (struct value
*, struct type
*,
126 static struct value
*make_array_descriptor (struct type
*, struct value
*,
129 static void ada_add_block_symbols (struct obstack
*,
130 struct block
*, const char *,
131 domain_enum
, struct objfile
*,
132 struct symtab
*, int);
134 static int is_nonfunction (struct ada_symbol_info
*, int);
136 static void add_defn_to_vec (struct obstack
*, struct symbol
*, struct block
*,
139 static int num_defns_collected (struct obstack
*);
141 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
143 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
144 *, const char *, int,
147 static struct symtab
*symtab_for_sym (struct symbol
*);
149 static struct value
*resolve_subexp (struct expression
**, int *, int,
152 static void replace_operator_with_call (struct expression
**, int, int, int,
153 struct symbol
*, struct block
*);
155 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
157 static char *ada_op_name (enum exp_opcode
);
159 static const char *ada_decoded_op_name (enum exp_opcode
);
161 static int numeric_type_p (struct type
*);
163 static int integer_type_p (struct type
*);
165 static int scalar_type_p (struct type
*);
167 static int discrete_type_p (struct type
*);
169 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
172 static char *extended_canonical_line_spec (struct symtab_and_line
,
175 static struct value
*evaluate_subexp (struct type
*, struct expression
*,
178 static struct value
*evaluate_subexp_type (struct expression
*, int *);
180 static struct type
*ada_create_fundamental_type (struct objfile
*, int);
182 static int is_dynamic_field (struct type
*, int);
184 static struct type
*to_fixed_variant_branch_type (struct type
*, char *,
185 CORE_ADDR
, struct value
*);
187 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
189 static struct type
*to_fixed_range_type (char *, struct value
*,
192 static struct type
*to_static_fixed_type (struct type
*);
194 static struct value
*unwrap_value (struct value
*);
196 static struct type
*packed_array_type (struct type
*, long *);
198 static struct type
*decode_packed_array_type (struct type
*);
200 static struct value
*decode_packed_array (struct value
*);
202 static struct value
*value_subscript_packed (struct value
*, int,
205 static struct value
*coerce_unspec_val_to_type (struct value
*,
208 static struct value
*get_var_value (char *, char *);
210 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
212 static int equiv_types (struct type
*, struct type
*);
214 static int is_name_suffix (const char *);
216 static int wild_match (const char *, int, const char *);
218 static struct symtabs_and_lines
219 find_sal_from_funcs_and_line (const char *, int,
220 struct ada_symbol_info
*, int);
222 static int find_line_in_linetable (struct linetable
*, int,
223 struct ada_symbol_info
*,
226 static int find_next_line_in_linetable (struct linetable
*, int, int, int);
228 static void read_all_symtabs (const char *);
230 static int is_plausible_func_for_line (struct symbol
*, int);
232 static struct value
*ada_coerce_ref (struct value
*);
234 static LONGEST
pos_atr (struct value
*);
236 static struct value
*value_pos_atr (struct value
*);
238 static struct value
*value_val_atr (struct type
*, struct value
*);
240 static struct symbol
*standard_lookup (const char *, const struct block
*,
243 extern void symtab_symbol_info (char *regexp
, domain_enum kind
,
246 static struct value
*ada_search_struct_field (char *, struct value
*, int,
249 static struct value
*ada_value_primitive_field (struct value
*, int, int,
252 static int find_struct_field (char *, struct type
*, int,
253 struct type
**, int *, int *, int *);
255 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
258 static struct value
*ada_to_fixed_value (struct value
*);
260 static void adjust_pc_past_prologue (CORE_ADDR
*);
262 static int ada_resolve_function (struct ada_symbol_info
*, int,
263 struct value
**, int, const char *,
266 static struct value
*ada_coerce_to_simple_array (struct value
*);
268 static int ada_is_direct_array_type (struct type
*);
270 static void error_breakpoint_runtime_sym_not_found (const char *err_desc
);
272 static int is_runtime_sym_defined (const char *name
, int allow_tramp
);
276 /* Maximum-sized dynamic type. */
277 static unsigned int varsize_limit
;
279 /* FIXME: brobecker/2003-09-17: No longer a const because it is
280 returned by a function that does not return a const char *. */
281 static char *ada_completer_word_break_characters
=
283 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
285 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
288 /* The name of the symbol to use to get the name of the main subprogram. */
289 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
290 = "__gnat_ada_main_program_name";
292 /* The name of the runtime function called when an exception is raised. */
293 static const char raise_sym_name
[] = "__gnat_raise_nodefer_with_msg";
295 /* The name of the runtime function called when an unhandled exception
297 static const char raise_unhandled_sym_name
[] = "__gnat_unhandled_exception";
299 /* The name of the runtime function called when an assert failure is
301 static const char raise_assert_sym_name
[] =
302 "system__assertions__raise_assert_failure";
304 /* When GDB stops on an unhandled exception, GDB will go up the stack until
305 if finds a frame corresponding to this function, in order to extract the
306 name of the exception that has been raised from one of the parameters. */
307 static const char process_raise_exception_name
[] =
308 "ada__exceptions__process_raise_exception";
310 /* A string that reflects the longest exception expression rewrite,
311 aside from the exception name. */
312 static const char longest_exception_template
[] =
313 "'__gnat_raise_nodefer_with_msg' if long_integer(e) = long_integer(&)";
315 /* Limit on the number of warnings to raise per expression evaluation. */
316 static int warning_limit
= 2;
318 /* Number of warning messages issued; reset to 0 by cleanups after
319 expression evaluation. */
320 static int warnings_issued
= 0;
322 static const char *known_runtime_file_name_patterns
[] = {
323 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
326 static const char *known_auxiliary_function_name_patterns
[] = {
327 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
330 /* Space for allocating results of ada_lookup_symbol_list. */
331 static struct obstack symbol_list_obstack
;
335 /* Create a new empty string_vector struct with an initial size of
338 static struct string_vector
339 xnew_string_vector (int initial_size
)
341 struct string_vector result
;
343 result
.array
= (char **) xmalloc ((initial_size
+ 1) * sizeof (char *));
345 result
.size
= initial_size
;
350 /* Add STR at the end of the given string vector SV. If SV is already
351 full, its size is automatically increased (doubled). */
354 string_vector_append (struct string_vector
*sv
, char *str
)
356 if (sv
->index
>= sv
->size
)
357 GROW_VECT (sv
->array
, sv
->size
, sv
->size
* 2);
359 sv
->array
[sv
->index
] = str
;
363 /* Given DECODED_NAME a string holding a symbol name in its
364 decoded form (ie using the Ada dotted notation), returns
365 its unqualified name. */
368 ada_unqualified_name (const char *decoded_name
)
370 const char *result
= strrchr (decoded_name
, '.');
373 result
++; /* Skip the dot... */
375 result
= decoded_name
;
380 /* Return a string starting with '<', followed by STR, and '>'.
381 The result is good until the next call. */
384 add_angle_brackets (const char *str
)
386 static char *result
= NULL
;
389 result
= (char *) xmalloc ((strlen (str
) + 3) * sizeof (char));
391 sprintf (result
, "<%s>", str
);
396 ada_get_gdb_completer_word_break_characters (void)
398 return ada_completer_word_break_characters
;
401 /* Read the string located at ADDR from the inferior and store the
405 extract_string (CORE_ADDR addr
, char *buf
)
409 /* Loop, reading one byte at a time, until we reach the '\000'
410 end-of-string marker. */
413 target_read_memory (addr
+ char_index
* sizeof (char),
414 buf
+ char_index
* sizeof (char), sizeof (char));
417 while (buf
[char_index
- 1] != '\000');
420 /* Return the name of the function owning the instruction located at PC.
421 Return NULL if no such function could be found. */
424 function_name_from_pc (CORE_ADDR pc
)
428 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
434 /* Assuming *OLD_VECT points to an array of *SIZE objects of size
435 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
436 updating *OLD_VECT and *SIZE as necessary. */
439 grow_vect (void **old_vect
, size_t * size
, size_t min_size
, int element_size
)
441 if (*size
< min_size
)
444 if (*size
< min_size
)
446 *old_vect
= xrealloc (*old_vect
, *size
* element_size
);
450 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
451 suffix of FIELD_NAME beginning "___". */
454 field_name_match (const char *field_name
, const char *target
)
456 int len
= strlen (target
);
458 (strncmp (field_name
, target
, len
) == 0
459 && (field_name
[len
] == '\0'
460 || (strncmp (field_name
+ len
, "___", 3) == 0
461 && strcmp (field_name
+ strlen (field_name
) - 6, "___XVN") != 0)));
465 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
466 FIELD_NAME, and return its index. This function also handles fields
467 whose name have ___ suffixes because the compiler sometimes alters
468 their name by adding such a suffix to represent fields with certain
469 constraints. If the field could not be found, return a negative
470 number if MAYBE_MISSING is set. Otherwise raise an error. */
473 ada_get_field_index (const struct type
*type
, const char *field_name
,
477 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (type
); fieldno
++)
478 if (field_name_match (TYPE_FIELD_NAME (type
, fieldno
), field_name
))
482 error ("Unable to find field %s in struct %s. Aborting",
483 field_name
, TYPE_NAME (type
));
488 /* The length of the prefix of NAME prior to any "___" suffix. */
491 ada_name_prefix_len (const char *name
)
497 const char *p
= strstr (name
, "___");
499 return strlen (name
);
505 /* Return non-zero if SUFFIX is a suffix of STR.
506 Return zero if STR is null. */
509 is_suffix (const char *str
, const char *suffix
)
515 len2
= strlen (suffix
);
516 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
519 /* Create a value of type TYPE whose contents come from VALADDR, if it
520 is non-null, and whose memory address (in the inferior) is
524 value_from_contents_and_address (struct type
*type
, char *valaddr
,
527 struct value
*v
= allocate_value (type
);
531 memcpy (VALUE_CONTENTS_RAW (v
), valaddr
, TYPE_LENGTH (type
));
532 VALUE_ADDRESS (v
) = address
;
534 VALUE_LVAL (v
) = lval_memory
;
538 /* The contents of value VAL, treated as a value of type TYPE. The
539 result is an lval in memory if VAL is. */
541 static struct value
*
542 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
544 CHECK_TYPEDEF (type
);
545 if (VALUE_TYPE (val
) == type
)
549 struct value
*result
;
551 /* Make sure that the object size is not unreasonable before
552 trying to allocate some memory for it. */
553 if (TYPE_LENGTH (type
) > varsize_limit
)
554 error ("object size is larger than varsize-limit");
556 result
= allocate_value (type
);
557 VALUE_LVAL (result
) = VALUE_LVAL (val
);
558 VALUE_BITSIZE (result
) = VALUE_BITSIZE (val
);
559 VALUE_BITPOS (result
) = VALUE_BITPOS (val
);
560 VALUE_ADDRESS (result
) = VALUE_ADDRESS (val
) + VALUE_OFFSET (val
);
561 if (VALUE_LAZY (val
) ||
562 TYPE_LENGTH (type
) > TYPE_LENGTH (VALUE_TYPE (val
)))
563 VALUE_LAZY (result
) = 1;
565 memcpy (VALUE_CONTENTS_RAW (result
), VALUE_CONTENTS (val
),
572 cond_offset_host (char *valaddr
, long offset
)
577 return valaddr
+ offset
;
581 cond_offset_target (CORE_ADDR address
, long offset
)
586 return address
+ offset
;
589 /* Issue a warning (as for the definition of warning in utils.c, but
590 with exactly one argument rather than ...), unless the limit on the
591 number of warnings has passed during the evaluation of the current
594 lim_warning (const char *format
, long arg
)
596 warnings_issued
+= 1;
597 if (warnings_issued
<= warning_limit
)
598 warning (format
, arg
);
602 ada_translate_error_message (const char *string
)
604 if (strcmp (string
, "Invalid cast.") == 0)
605 return "Invalid type conversion.";
611 MAX_OF_SIZE (int size
)
613 LONGEST top_bit
= (LONGEST
) 1 << (size
*8-2);
614 return top_bit
| (top_bit
-1);
618 MIN_OF_SIZE (int size
)
620 return - MAX_OF_SIZE (size
) - 1;
624 UMAX_OF_SIZE (int size
)
626 ULONGEST top_bit
= (ULONGEST
) 1 << (size
*8-1);
627 return top_bit
| (top_bit
-1);
631 UMIN_OF_SIZE (int size
)
636 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
637 static struct value
*
638 discrete_type_high_bound (struct type
*type
)
640 switch (TYPE_CODE (type
))
642 case TYPE_CODE_RANGE
:
643 return value_from_longest (TYPE_TARGET_TYPE (type
),
644 TYPE_HIGH_BOUND (type
));
647 value_from_longest (type
,
648 TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
)-1));
650 return value_from_longest (type
, MAX_OF_TYPE (type
));
652 error ("Unexpected type in discrete_type_high_bound.");
656 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
657 static struct value
*
658 discrete_type_low_bound (struct type
*type
)
660 switch (TYPE_CODE (type
))
662 case TYPE_CODE_RANGE
:
663 return value_from_longest (TYPE_TARGET_TYPE (type
),
664 TYPE_LOW_BOUND (type
));
666 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, 0));
668 return value_from_longest (type
, MIN_OF_TYPE (type
));
670 error ("Unexpected type in discrete_type_low_bound.");
674 /* The identity on non-range types. For range types, the underlying
675 non-range scalar type. */
678 base_type (struct type
*type
)
680 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
682 if (type
== TYPE_TARGET_TYPE (type
)
683 || TYPE_TARGET_TYPE (type
) == NULL
)
685 type
= TYPE_TARGET_TYPE (type
);
691 /* Language Selection */
693 /* If the main program is in Ada, return language_ada, otherwise return LANG
694 (the main program is in Ada iif the adainit symbol is found).
696 MAIN_PST is not used. */
699 ada_update_initial_language (enum language lang
,
700 struct partial_symtab
*main_pst
)
702 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
703 (struct objfile
*) NULL
) != NULL
)
711 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
714 const struct ada_opname_map ada_opname_table
[] = {
715 {"Oadd", "\"+\"", BINOP_ADD
},
716 {"Osubtract", "\"-\"", BINOP_SUB
},
717 {"Omultiply", "\"*\"", BINOP_MUL
},
718 {"Odivide", "\"/\"", BINOP_DIV
},
719 {"Omod", "\"mod\"", BINOP_MOD
},
720 {"Orem", "\"rem\"", BINOP_REM
},
721 {"Oexpon", "\"**\"", BINOP_EXP
},
722 {"Olt", "\"<\"", BINOP_LESS
},
723 {"Ole", "\"<=\"", BINOP_LEQ
},
724 {"Ogt", "\">\"", BINOP_GTR
},
725 {"Oge", "\">=\"", BINOP_GEQ
},
726 {"Oeq", "\"=\"", BINOP_EQUAL
},
727 {"One", "\"/=\"", BINOP_NOTEQUAL
},
728 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
729 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
730 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
731 {"Oconcat", "\"&\"", BINOP_CONCAT
},
732 {"Oabs", "\"abs\"", UNOP_ABS
},
733 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
734 {"Oadd", "\"+\"", UNOP_PLUS
},
735 {"Osubtract", "\"-\"", UNOP_NEG
},
739 /* Return non-zero if STR should be suppressed in info listings. */
742 is_suppressed_name (const char *str
)
744 if (strncmp (str
, "_ada_", 5) == 0)
746 if (str
[0] == '_' || str
[0] == '\000')
751 const char *suffix
= strstr (str
, "___");
752 if (suffix
!= NULL
&& suffix
[3] != 'X')
755 suffix
= str
+ strlen (str
);
756 for (p
= suffix
- 1; p
!= str
; p
-= 1)
760 if (p
[0] == 'X' && p
[-1] != '_')
764 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
765 if (strncmp (ada_opname_table
[i
].encoded
, p
,
766 strlen (ada_opname_table
[i
].encoded
)) == 0)
775 /* The "encoded" form of DECODED, according to GNAT conventions.
776 The result is valid until the next call to ada_encode. */
779 ada_encode (const char *decoded
)
781 static char *encoding_buffer
= NULL
;
782 static size_t encoding_buffer_size
= 0;
789 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
790 2 * strlen (decoded
) + 10);
793 for (p
= decoded
; *p
!= '\0'; p
+= 1)
795 if (!ADA_RETAIN_DOTS
&& *p
== '.')
797 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
802 const struct ada_opname_map
*mapping
;
804 for (mapping
= ada_opname_table
;
805 mapping
->encoded
!= NULL
&&
806 strncmp (mapping
->decoded
, p
,
807 strlen (mapping
->decoded
)) != 0;
810 if (mapping
->encoded
== NULL
)
811 error ("invalid Ada operator name: %s", p
);
812 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
813 k
+= strlen (mapping
->encoded
);
818 encoding_buffer
[k
] = *p
;
823 encoding_buffer
[k
] = '\0';
824 return encoding_buffer
;
827 /* Return NAME folded to lower case, or, if surrounded by single
828 quotes, unfolded, but with the quotes stripped away. Result good
832 ada_fold_name (const char *name
)
834 static char *fold_buffer
= NULL
;
835 static size_t fold_buffer_size
= 0;
837 int len
= strlen (name
);
838 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
842 strncpy (fold_buffer
, name
+ 1, len
- 2);
843 fold_buffer
[len
- 2] = '\000';
848 for (i
= 0; i
<= len
; i
+= 1)
849 fold_buffer
[i
] = tolower (name
[i
]);
856 0. Discard trailing .{DIGIT}+ or trailing ___{DIGIT}+
857 These are suffixes introduced by GNAT5 to nested subprogram
858 names, and do not serve any purpose for the debugger.
859 1. Discard final __{DIGIT}+ or $({DIGIT}+(__{DIGIT}+)*)
860 2. Convert other instances of embedded "__" to `.'.
861 3. Discard leading _ada_.
862 4. Convert operator names to the appropriate quoted symbols.
863 5. Remove everything after first ___ if it is followed by
865 6. Replace TK__ with __, and a trailing B or TKB with nothing.
866 7. Put symbols that should be suppressed in <...> brackets.
867 8. Remove trailing X[bn]* suffix (indicating names in package bodies).
869 The resulting string is valid until the next call of ada_decode.
870 If the string is unchanged by demangling, the original string pointer
874 ada_decode (const char *encoded
)
881 static char *decoding_buffer
= NULL
;
882 static size_t decoding_buffer_size
= 0;
884 if (strncmp (encoded
, "_ada_", 5) == 0)
887 if (encoded
[0] == '_' || encoded
[0] == '<')
890 /* Remove trailing .{DIGIT}+ or ___{DIGIT}+. */
891 len0
= strlen (encoded
);
892 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
895 while (i
> 0 && isdigit (encoded
[i
]))
897 if (i
>= 0 && encoded
[i
] == '.')
899 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
903 /* Remove the ___X.* suffix if present. Do not forget to verify that
904 the suffix is located before the current "end" of ENCODED. We want
905 to avoid re-matching parts of ENCODED that have previously been
906 marked as discarded (by decrementing LEN0). */
907 p
= strstr (encoded
, "___");
908 if (p
!= NULL
&& p
- encoded
< len0
- 3)
916 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
919 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
922 /* Make decoded big enough for possible expansion by operator name. */
923 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
924 decoded
= decoding_buffer
;
926 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
929 while ((i
>= 0 && isdigit (encoded
[i
]))
930 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
932 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
934 else if (encoded
[i
] == '$')
938 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
939 decoded
[j
] = encoded
[i
];
944 if (at_start_name
&& encoded
[i
] == 'O')
947 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
949 int op_len
= strlen (ada_opname_table
[k
].encoded
);
950 if (strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
952 && !isalnum (encoded
[i
+ op_len
]))
954 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
957 j
+= strlen (ada_opname_table
[k
].decoded
);
961 if (ada_opname_table
[k
].encoded
!= NULL
)
966 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
968 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
972 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
976 else if (!ADA_RETAIN_DOTS
977 && i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
986 decoded
[j
] = encoded
[i
];
993 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
994 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
997 if (strcmp (decoded
, encoded
) == 0)
1003 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1004 decoded
= decoding_buffer
;
1005 if (encoded
[0] == '<')
1006 strcpy (decoded
, encoded
);
1008 sprintf (decoded
, "<%s>", encoded
);
1013 /* Table for keeping permanent unique copies of decoded names. Once
1014 allocated, names in this table are never released. While this is a
1015 storage leak, it should not be significant unless there are massive
1016 changes in the set of decoded names in successive versions of a
1017 symbol table loaded during a single session. */
1018 static struct htab
*decoded_names_store
;
1020 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1021 in the language-specific part of GSYMBOL, if it has not been
1022 previously computed. Tries to save the decoded name in the same
1023 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1024 in any case, the decoded symbol has a lifetime at least that of
1026 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1027 const, but nevertheless modified to a semantically equivalent form
1028 when a decoded name is cached in it.
1031 char *ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1034 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1035 if (*resultp
== NULL
)
1037 const char *decoded
= ada_decode (gsymbol
->name
);
1038 if (gsymbol
->bfd_section
!= NULL
)
1040 bfd
*obfd
= gsymbol
->bfd_section
->owner
;
1043 struct objfile
*objf
;
1046 if (obfd
== objf
->obfd
)
1048 *resultp
= obsavestring (decoded
, strlen (decoded
),
1049 &objf
->objfile_obstack
);
1055 /* Sometimes, we can't find a corresponding objfile, in which
1056 case, we put the result on the heap. Since we only decode
1057 when needed, we hope this usually does not cause a
1058 significant memory leak (FIXME). */
1059 if (*resultp
== NULL
)
1062 (char **) htab_find_slot (decoded_names_store
,
1065 *slot
= xstrdup (decoded
);
1073 char *ada_la_decode (const char *encoded
, int options
)
1075 return xstrdup (ada_decode (encoded
));
1078 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1079 suffixes that encode debugging information or leading _ada_ on
1080 SYM_NAME (see is_name_suffix commentary for the debugging
1081 information that is ignored). If WILD, then NAME need only match a
1082 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1083 either argument is NULL. */
1086 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1088 if (sym_name
== NULL
|| name
== NULL
)
1091 return wild_match (name
, strlen (name
), sym_name
);
1094 int len_name
= strlen (name
);
1095 return (strncmp (sym_name
, name
, len_name
) == 0
1096 && is_name_suffix (sym_name
+ len_name
))
1097 || (strncmp (sym_name
, "_ada_", 5) == 0
1098 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1099 && is_name_suffix (sym_name
+ len_name
+ 5));
1103 /* True (non-zero) iff, in Ada mode, the symbol SYM should be
1104 suppressed in info listings. */
1107 ada_suppress_symbol_printing (struct symbol
*sym
)
1109 if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
)
1112 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym
));
1118 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1120 static char *bound_name
[] = {
1121 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1122 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1125 /* Maximum number of array dimensions we are prepared to handle. */
1127 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1129 /* Like modify_field, but allows bitpos > wordlength. */
1132 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1134 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1138 /* The desc_* routines return primitive portions of array descriptors
1141 /* The descriptor or array type, if any, indicated by TYPE; removes
1142 level of indirection, if needed. */
1144 static struct type
*
1145 desc_base_type (struct type
*type
)
1149 CHECK_TYPEDEF (type
);
1151 (TYPE_CODE (type
) == TYPE_CODE_PTR
1152 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1153 return check_typedef (TYPE_TARGET_TYPE (type
));
1158 /* True iff TYPE indicates a "thin" array pointer type. */
1161 is_thin_pntr (struct type
*type
)
1164 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1165 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1168 /* The descriptor type for thin pointer type TYPE. */
1170 static struct type
*
1171 thin_descriptor_type (struct type
*type
)
1173 struct type
*base_type
= desc_base_type (type
);
1174 if (base_type
== NULL
)
1176 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1180 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1181 if (alt_type
== NULL
)
1188 /* A pointer to the array data for thin-pointer value VAL. */
1190 static struct value
*
1191 thin_data_pntr (struct value
*val
)
1193 struct type
*type
= VALUE_TYPE (val
);
1194 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1195 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1198 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1199 VALUE_ADDRESS (val
) + VALUE_OFFSET (val
));
1202 /* True iff TYPE indicates a "thick" array pointer type. */
1205 is_thick_pntr (struct type
*type
)
1207 type
= desc_base_type (type
);
1208 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1209 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1212 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1213 pointer to one, the type of its bounds data; otherwise, NULL. */
1215 static struct type
*
1216 desc_bounds_type (struct type
*type
)
1220 type
= desc_base_type (type
);
1224 else if (is_thin_pntr (type
))
1226 type
= thin_descriptor_type (type
);
1229 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1231 return check_typedef (r
);
1233 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1235 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1237 return check_typedef (TYPE_TARGET_TYPE (check_typedef (r
)));
1242 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1243 one, a pointer to its bounds data. Otherwise NULL. */
1245 static struct value
*
1246 desc_bounds (struct value
*arr
)
1248 struct type
*type
= check_typedef (VALUE_TYPE (arr
));
1249 if (is_thin_pntr (type
))
1251 struct type
*bounds_type
=
1252 desc_bounds_type (thin_descriptor_type (type
));
1255 if (desc_bounds_type
== NULL
)
1256 error ("Bad GNAT array descriptor");
1258 /* NOTE: The following calculation is not really kosher, but
1259 since desc_type is an XVE-encoded type (and shouldn't be),
1260 the correct calculation is a real pain. FIXME (and fix GCC). */
1261 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1262 addr
= value_as_long (arr
);
1264 addr
= VALUE_ADDRESS (arr
) + VALUE_OFFSET (arr
);
1267 value_from_longest (lookup_pointer_type (bounds_type
),
1268 addr
- TYPE_LENGTH (bounds_type
));
1271 else if (is_thick_pntr (type
))
1272 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1273 "Bad GNAT array descriptor");
1278 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1279 position of the field containing the address of the bounds data. */
1282 fat_pntr_bounds_bitpos (struct type
*type
)
1284 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1287 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1288 size of the field containing the address of the bounds data. */
1291 fat_pntr_bounds_bitsize (struct type
*type
)
1293 type
= desc_base_type (type
);
1295 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1296 return TYPE_FIELD_BITSIZE (type
, 1);
1298 return 8 * TYPE_LENGTH (check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1301 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1302 pointer to one, the type of its array data (a
1303 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1304 ada_type_of_array to get an array type with bounds data. */
1306 static struct type
*
1307 desc_data_type (struct type
*type
)
1309 type
= desc_base_type (type
);
1311 /* NOTE: The following is bogus; see comment in desc_bounds. */
1312 if (is_thin_pntr (type
))
1313 return lookup_pointer_type
1314 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1315 else if (is_thick_pntr (type
))
1316 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1321 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1324 static struct value
*
1325 desc_data (struct value
*arr
)
1327 struct type
*type
= VALUE_TYPE (arr
);
1328 if (is_thin_pntr (type
))
1329 return thin_data_pntr (arr
);
1330 else if (is_thick_pntr (type
))
1331 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1332 "Bad GNAT array descriptor");
1338 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1339 position of the field containing the address of the data. */
1342 fat_pntr_data_bitpos (struct type
*type
)
1344 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1347 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1348 size of the field containing the address of the data. */
1351 fat_pntr_data_bitsize (struct type
*type
)
1353 type
= desc_base_type (type
);
1355 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1356 return TYPE_FIELD_BITSIZE (type
, 0);
1358 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1361 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1362 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1363 bound, if WHICH is 1. The first bound is I=1. */
1365 static struct value
*
1366 desc_one_bound (struct value
*bounds
, int i
, int which
)
1368 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1369 "Bad GNAT array descriptor bounds");
1372 /* If BOUNDS is an array-bounds structure type, return the bit position
1373 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1374 bound, if WHICH is 1. The first bound is I=1. */
1377 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1379 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1382 /* If BOUNDS is an array-bounds structure type, return the bit field size
1383 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1384 bound, if WHICH is 1. The first bound is I=1. */
1387 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1389 type
= desc_base_type (type
);
1391 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1392 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1394 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1397 /* If TYPE is the type of an array-bounds structure, the type of its
1398 Ith bound (numbering from 1). Otherwise, NULL. */
1400 static struct type
*
1401 desc_index_type (struct type
*type
, int i
)
1403 type
= desc_base_type (type
);
1405 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1406 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1411 /* The number of index positions in the array-bounds type TYPE.
1412 Return 0 if TYPE is NULL. */
1415 desc_arity (struct type
*type
)
1417 type
= desc_base_type (type
);
1420 return TYPE_NFIELDS (type
) / 2;
1424 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1425 an array descriptor type (representing an unconstrained array
1429 ada_is_direct_array_type (struct type
*type
)
1433 CHECK_TYPEDEF (type
);
1434 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1435 || ada_is_array_descriptor_type (type
));
1438 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1441 ada_is_simple_array_type (struct type
*type
)
1445 CHECK_TYPEDEF (type
);
1446 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1447 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1448 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1451 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1454 ada_is_array_descriptor_type (struct type
*type
)
1456 struct type
*data_type
= desc_data_type (type
);
1460 CHECK_TYPEDEF (type
);
1463 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1464 && TYPE_TARGET_TYPE (data_type
) != NULL
1465 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1467 TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1468 && desc_arity (desc_bounds_type (type
)) > 0;
1471 /* Non-zero iff type is a partially mal-formed GNAT array
1472 descriptor. FIXME: This is to compensate for some problems with
1473 debugging output from GNAT. Re-examine periodically to see if it
1477 ada_is_bogus_array_descriptor (struct type
*type
)
1481 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1482 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1483 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1484 && !ada_is_array_descriptor_type (type
);
1488 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1489 (fat pointer) returns the type of the array data described---specifically,
1490 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1491 in from the descriptor; otherwise, they are left unspecified. If
1492 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1493 returns NULL. The result is simply the type of ARR if ARR is not
1496 ada_type_of_array (struct value
*arr
, int bounds
)
1498 if (ada_is_packed_array_type (VALUE_TYPE (arr
)))
1499 return decode_packed_array_type (VALUE_TYPE (arr
));
1501 if (!ada_is_array_descriptor_type (VALUE_TYPE (arr
)))
1502 return VALUE_TYPE (arr
);
1506 check_typedef (TYPE_TARGET_TYPE (desc_data_type (VALUE_TYPE (arr
))));
1509 struct type
*elt_type
;
1511 struct value
*descriptor
;
1512 struct objfile
*objf
= TYPE_OBJFILE (VALUE_TYPE (arr
));
1514 elt_type
= ada_array_element_type (VALUE_TYPE (arr
), -1);
1515 arity
= ada_array_arity (VALUE_TYPE (arr
));
1517 if (elt_type
== NULL
|| arity
== 0)
1518 return check_typedef (VALUE_TYPE (arr
));
1520 descriptor
= desc_bounds (arr
);
1521 if (value_as_long (descriptor
) == 0)
1525 struct type
*range_type
= alloc_type (objf
);
1526 struct type
*array_type
= alloc_type (objf
);
1527 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1528 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1531 create_range_type (range_type
, VALUE_TYPE (low
),
1532 (int) value_as_long (low
),
1533 (int) value_as_long (high
));
1534 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1537 return lookup_pointer_type (elt_type
);
1541 /* If ARR does not represent an array, returns ARR unchanged.
1542 Otherwise, returns either a standard GDB array with bounds set
1543 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1544 GDB array. Returns NULL if ARR is a null fat pointer. */
1547 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1549 if (ada_is_array_descriptor_type (VALUE_TYPE (arr
)))
1551 struct type
*arrType
= ada_type_of_array (arr
, 1);
1552 if (arrType
== NULL
)
1554 return value_cast (arrType
, value_copy (desc_data (arr
)));
1556 else if (ada_is_packed_array_type (VALUE_TYPE (arr
)))
1557 return decode_packed_array (arr
);
1562 /* If ARR does not represent an array, returns ARR unchanged.
1563 Otherwise, returns a standard GDB array describing ARR (which may
1564 be ARR itself if it already is in the proper form). */
1566 static struct value
*
1567 ada_coerce_to_simple_array (struct value
*arr
)
1569 if (ada_is_array_descriptor_type (VALUE_TYPE (arr
)))
1571 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1573 error ("Bounds unavailable for null array pointer.");
1574 return value_ind (arrVal
);
1576 else if (ada_is_packed_array_type (VALUE_TYPE (arr
)))
1577 return decode_packed_array (arr
);
1582 /* If TYPE represents a GNAT array type, return it translated to an
1583 ordinary GDB array type (possibly with BITSIZE fields indicating
1584 packing). For other types, is the identity. */
1587 ada_coerce_to_simple_array_type (struct type
*type
)
1589 struct value
*mark
= value_mark ();
1590 struct value
*dummy
= value_from_longest (builtin_type_long
, 0);
1591 struct type
*result
;
1592 VALUE_TYPE (dummy
) = type
;
1593 result
= ada_type_of_array (dummy
, 0);
1594 value_free_to_mark (mark
);
1598 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1601 ada_is_packed_array_type (struct type
*type
)
1605 type
= desc_base_type (type
);
1606 CHECK_TYPEDEF (type
);
1608 ada_type_name (type
) != NULL
1609 && strstr (ada_type_name (type
), "___XP") != NULL
;
1612 /* Given that TYPE is a standard GDB array type with all bounds filled
1613 in, and that the element size of its ultimate scalar constituents
1614 (that is, either its elements, or, if it is an array of arrays, its
1615 elements' elements, etc.) is *ELT_BITS, return an identical type,
1616 but with the bit sizes of its elements (and those of any
1617 constituent arrays) recorded in the BITSIZE components of its
1618 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1621 static struct type
*
1622 packed_array_type (struct type
*type
, long *elt_bits
)
1624 struct type
*new_elt_type
;
1625 struct type
*new_type
;
1626 LONGEST low_bound
, high_bound
;
1628 CHECK_TYPEDEF (type
);
1629 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1632 new_type
= alloc_type (TYPE_OBJFILE (type
));
1633 new_elt_type
= packed_array_type (check_typedef (TYPE_TARGET_TYPE (type
)),
1635 create_array_type (new_type
, new_elt_type
, TYPE_FIELD_TYPE (type
, 0));
1636 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1637 TYPE_NAME (new_type
) = ada_type_name (type
);
1639 if (get_discrete_bounds (TYPE_FIELD_TYPE (type
, 0),
1640 &low_bound
, &high_bound
) < 0)
1641 low_bound
= high_bound
= 0;
1642 if (high_bound
< low_bound
)
1643 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1646 *elt_bits
*= (high_bound
- low_bound
+ 1);
1647 TYPE_LENGTH (new_type
) =
1648 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1651 TYPE_FLAGS (new_type
) |= TYPE_FLAG_FIXED_INSTANCE
;
1655 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1657 static struct type
*
1658 decode_packed_array_type (struct type
*type
)
1661 struct block
**blocks
;
1662 const char *raw_name
= ada_type_name (check_typedef (type
));
1663 char *name
= (char *) alloca (strlen (raw_name
) + 1);
1664 char *tail
= strstr (raw_name
, "___XP");
1665 struct type
*shadow_type
;
1669 type
= desc_base_type (type
);
1671 memcpy (name
, raw_name
, tail
- raw_name
);
1672 name
[tail
- raw_name
] = '\000';
1674 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1675 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1677 lim_warning ("could not find bounds information on packed array", 0);
1680 shadow_type
= SYMBOL_TYPE (sym
);
1682 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1684 lim_warning ("could not understand bounds information on packed array",
1689 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1692 ("could not understand bit size information on packed array", 0);
1696 return packed_array_type (shadow_type
, &bits
);
1699 /* Given that ARR is a struct value *indicating a GNAT packed array,
1700 returns a simple array that denotes that array. Its type is a
1701 standard GDB array type except that the BITSIZEs of the array
1702 target types are set to the number of bits in each element, and the
1703 type length is set appropriately. */
1705 static struct value
*
1706 decode_packed_array (struct value
*arr
)
1710 arr
= ada_coerce_ref (arr
);
1711 if (TYPE_CODE (VALUE_TYPE (arr
)) == TYPE_CODE_PTR
)
1712 arr
= ada_value_ind (arr
);
1714 type
= decode_packed_array_type (VALUE_TYPE (arr
));
1717 error ("can't unpack array");
1720 return coerce_unspec_val_to_type (arr
, type
);
1724 /* The value of the element of packed array ARR at the ARITY indices
1725 given in IND. ARR must be a simple array. */
1727 static struct value
*
1728 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1731 int bits
, elt_off
, bit_off
;
1732 long elt_total_bit_offset
;
1733 struct type
*elt_type
;
1737 elt_total_bit_offset
= 0;
1738 elt_type
= check_typedef (VALUE_TYPE (arr
));
1739 for (i
= 0; i
< arity
; i
+= 1)
1741 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1742 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1744 ("attempt to do packed indexing of something other than a packed array");
1747 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1748 LONGEST lowerbound
, upperbound
;
1751 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1753 lim_warning ("don't know bounds of array", 0);
1754 lowerbound
= upperbound
= 0;
1757 idx
= value_as_long (value_pos_atr (ind
[i
]));
1758 if (idx
< lowerbound
|| idx
> upperbound
)
1759 lim_warning ("packed array index %ld out of bounds", (long) idx
);
1760 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1761 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1762 elt_type
= check_typedef (TYPE_TARGET_TYPE (elt_type
));
1765 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1766 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1768 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1770 if (VALUE_LVAL (arr
) == lval_internalvar
)
1771 VALUE_LVAL (v
) = lval_internalvar_component
;
1773 VALUE_LVAL (v
) = VALUE_LVAL (arr
);
1777 /* Non-zero iff TYPE includes negative integer values. */
1780 has_negatives (struct type
*type
)
1782 switch (TYPE_CODE (type
))
1787 return !TYPE_UNSIGNED (type
);
1788 case TYPE_CODE_RANGE
:
1789 return TYPE_LOW_BOUND (type
) < 0;
1794 /* Create a new value of type TYPE from the contents of OBJ starting
1795 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1796 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1797 assigning through the result will set the field fetched from.
1798 VALADDR is ignored unless OBJ is NULL, in which case,
1799 VALADDR+OFFSET must address the start of storage containing the
1800 packed value. The value returned in this case is never an lval.
1801 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1804 ada_value_primitive_packed_val (struct value
*obj
, char *valaddr
, long offset
,
1805 int bit_offset
, int bit_size
,
1809 int src
, /* Index into the source area */
1810 targ
, /* Index into the target area */
1811 srcBitsLeft
, /* Number of source bits left to move */
1812 nsrc
, ntarg
, /* Number of source and target bytes */
1813 unusedLS
, /* Number of bits in next significant
1814 byte of source that are unused */
1815 accumSize
; /* Number of meaningful bits in accum */
1816 unsigned char *bytes
; /* First byte containing data to unpack */
1817 unsigned char *unpacked
;
1818 unsigned long accum
; /* Staging area for bits being transferred */
1820 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1821 /* Transmit bytes from least to most significant; delta is the direction
1822 the indices move. */
1823 int delta
= BITS_BIG_ENDIAN
? -1 : 1;
1825 CHECK_TYPEDEF (type
);
1829 v
= allocate_value (type
);
1830 bytes
= (unsigned char *) (valaddr
+ offset
);
1832 else if (VALUE_LAZY (obj
))
1835 VALUE_ADDRESS (obj
) + VALUE_OFFSET (obj
) + offset
, NULL
);
1836 bytes
= (unsigned char *) alloca (len
);
1837 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
1841 v
= allocate_value (type
);
1842 bytes
= (unsigned char *) VALUE_CONTENTS (obj
) + offset
;
1847 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
1848 if (VALUE_LVAL (obj
) == lval_internalvar
)
1849 VALUE_LVAL (v
) = lval_internalvar_component
;
1850 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + VALUE_OFFSET (obj
) + offset
;
1851 VALUE_BITPOS (v
) = bit_offset
+ VALUE_BITPOS (obj
);
1852 VALUE_BITSIZE (v
) = bit_size
;
1853 if (VALUE_BITPOS (v
) >= HOST_CHAR_BIT
)
1855 VALUE_ADDRESS (v
) += 1;
1856 VALUE_BITPOS (v
) -= HOST_CHAR_BIT
;
1860 VALUE_BITSIZE (v
) = bit_size
;
1861 unpacked
= (unsigned char *) VALUE_CONTENTS (v
);
1863 srcBitsLeft
= bit_size
;
1865 ntarg
= TYPE_LENGTH (type
);
1869 memset (unpacked
, 0, TYPE_LENGTH (type
));
1872 else if (BITS_BIG_ENDIAN
)
1875 if (has_negatives (type
) &&
1876 ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
1880 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
1883 switch (TYPE_CODE (type
))
1885 case TYPE_CODE_ARRAY
:
1886 case TYPE_CODE_UNION
:
1887 case TYPE_CODE_STRUCT
:
1888 /* Non-scalar values must be aligned at a byte boundary... */
1890 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
1891 /* ... And are placed at the beginning (most-significant) bytes
1897 targ
= TYPE_LENGTH (type
) - 1;
1903 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
1906 unusedLS
= bit_offset
;
1909 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
1916 /* Mask for removing bits of the next source byte that are not
1917 part of the value. */
1918 unsigned int unusedMSMask
=
1919 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
1921 /* Sign-extend bits for this byte. */
1922 unsigned int signMask
= sign
& ~unusedMSMask
;
1924 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
1925 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
1926 if (accumSize
>= HOST_CHAR_BIT
)
1928 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
1929 accumSize
-= HOST_CHAR_BIT
;
1930 accum
>>= HOST_CHAR_BIT
;
1934 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
1941 accum
|= sign
<< accumSize
;
1942 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
1943 accumSize
-= HOST_CHAR_BIT
;
1944 accum
>>= HOST_CHAR_BIT
;
1952 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
1953 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
1956 move_bits (char *target
, int targ_offset
, char *source
, int src_offset
, int n
)
1958 unsigned int accum
, mask
;
1959 int accum_bits
, chunk_size
;
1961 target
+= targ_offset
/ HOST_CHAR_BIT
;
1962 targ_offset
%= HOST_CHAR_BIT
;
1963 source
+= src_offset
/ HOST_CHAR_BIT
;
1964 src_offset
%= HOST_CHAR_BIT
;
1965 if (BITS_BIG_ENDIAN
)
1967 accum
= (unsigned char) *source
;
1969 accum_bits
= HOST_CHAR_BIT
- src_offset
;
1974 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
1975 accum_bits
+= HOST_CHAR_BIT
;
1977 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
1980 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
1981 mask
= ((1 << chunk_size
) - 1) << unused_right
;
1984 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
1986 accum_bits
-= chunk_size
;
1993 accum
= (unsigned char) *source
>> src_offset
;
1995 accum_bits
= HOST_CHAR_BIT
- src_offset
;
1999 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2000 accum_bits
+= HOST_CHAR_BIT
;
2002 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2005 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2006 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2008 accum_bits
-= chunk_size
;
2009 accum
>>= chunk_size
;
2017 /* Store the contents of FROMVAL into the location of TOVAL.
2018 Return a new value with the location of TOVAL and contents of
2019 FROMVAL. Handles assignment into packed fields that have
2020 floating-point or non-scalar types. */
2022 static struct value
*
2023 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2025 struct type
*type
= VALUE_TYPE (toval
);
2026 int bits
= VALUE_BITSIZE (toval
);
2028 if (!toval
->modifiable
)
2029 error ("Left operand of assignment is not a modifiable lvalue.");
2033 if (VALUE_LVAL (toval
) == lval_memory
2035 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2036 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2039 (VALUE_BITPOS (toval
) + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2040 char *buffer
= (char *) alloca (len
);
2043 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2044 fromval
= value_cast (type
, fromval
);
2046 read_memory (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
), buffer
, len
);
2047 if (BITS_BIG_ENDIAN
)
2048 move_bits (buffer
, VALUE_BITPOS (toval
),
2049 VALUE_CONTENTS (fromval
),
2050 TYPE_LENGTH (VALUE_TYPE (fromval
)) * TARGET_CHAR_BIT
-
2053 move_bits (buffer
, VALUE_BITPOS (toval
), VALUE_CONTENTS (fromval
),
2055 write_memory (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
), buffer
,
2058 val
= value_copy (toval
);
2059 memcpy (VALUE_CONTENTS_RAW (val
), VALUE_CONTENTS (fromval
),
2060 TYPE_LENGTH (type
));
2061 VALUE_TYPE (val
) = type
;
2066 return value_assign (toval
, fromval
);
2070 /* The value of the element of array ARR at the ARITY indices given in IND.
2071 ARR may be either a simple array, GNAT array descriptor, or pointer
2075 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2079 struct type
*elt_type
;
2081 elt
= ada_coerce_to_simple_array (arr
);
2083 elt_type
= check_typedef (VALUE_TYPE (elt
));
2084 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2085 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2086 return value_subscript_packed (elt
, arity
, ind
);
2088 for (k
= 0; k
< arity
; k
+= 1)
2090 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2091 error ("too many subscripts (%d expected)", k
);
2092 elt
= value_subscript (elt
, value_pos_atr (ind
[k
]));
2097 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2098 value of the element of *ARR at the ARITY indices given in
2099 IND. Does not read the entire array into memory. */
2102 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2107 for (k
= 0; k
< arity
; k
+= 1)
2112 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2113 error ("too many subscripts (%d expected)", k
);
2114 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2116 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2117 idx
= value_pos_atr (ind
[k
]);
2119 idx
= value_sub (idx
, value_from_longest (builtin_type_int
, lwb
));
2120 arr
= value_add (arr
, idx
);
2121 type
= TYPE_TARGET_TYPE (type
);
2124 return value_ind (arr
);
2127 /* If type is a record type in the form of a standard GNAT array
2128 descriptor, returns the number of dimensions for type. If arr is a
2129 simple array, returns the number of "array of"s that prefix its
2130 type designation. Otherwise, returns 0. */
2133 ada_array_arity (struct type
*type
)
2140 type
= desc_base_type (type
);
2143 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2144 return desc_arity (desc_bounds_type (type
));
2146 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2149 type
= check_typedef (TYPE_TARGET_TYPE (type
));
2155 /* If TYPE is a record type in the form of a standard GNAT array
2156 descriptor or a simple array type, returns the element type for
2157 TYPE after indexing by NINDICES indices, or by all indices if
2158 NINDICES is -1. Otherwise, returns NULL. */
2161 ada_array_element_type (struct type
*type
, int nindices
)
2163 type
= desc_base_type (type
);
2165 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2168 struct type
*p_array_type
;
2170 p_array_type
= desc_data_type (type
);
2172 k
= ada_array_arity (type
);
2176 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2177 if (nindices
>= 0 && k
> nindices
)
2179 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2180 while (k
> 0 && p_array_type
!= NULL
)
2182 p_array_type
= check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2185 return p_array_type
;
2187 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2189 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2191 type
= TYPE_TARGET_TYPE (type
);
2200 /* The type of nth index in arrays of given type (n numbering from 1).
2201 Does not examine memory. */
2204 ada_index_type (struct type
*type
, int n
)
2206 struct type
*result_type
;
2208 type
= desc_base_type (type
);
2210 if (n
> ada_array_arity (type
))
2213 if (ada_is_simple_array_type (type
))
2217 for (i
= 1; i
< n
; i
+= 1)
2218 type
= TYPE_TARGET_TYPE (type
);
2219 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2220 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2221 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2222 perhaps stabsread.c would make more sense. */
2223 if (result_type
== NULL
2224 || TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2225 result_type
= builtin_type_int
;
2230 return desc_index_type (desc_bounds_type (type
), n
);
2233 /* Given that arr is an array type, returns the lower bound of the
2234 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2235 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2236 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2237 bounds type. It works for other arrays with bounds supplied by
2238 run-time quantities other than discriminants. */
2241 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2242 struct type
** typep
)
2245 struct type
*index_type_desc
;
2247 if (ada_is_packed_array_type (arr_type
))
2248 arr_type
= decode_packed_array_type (arr_type
);
2250 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2253 *typep
= builtin_type_int
;
2254 return (LONGEST
) - which
;
2257 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2258 type
= TYPE_TARGET_TYPE (arr_type
);
2262 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2263 if (index_type_desc
== NULL
)
2265 struct type
*range_type
;
2266 struct type
*index_type
;
2270 type
= TYPE_TARGET_TYPE (type
);
2274 range_type
= TYPE_INDEX_TYPE (type
);
2275 index_type
= TYPE_TARGET_TYPE (range_type
);
2276 if (TYPE_CODE (index_type
) == TYPE_CODE_UNDEF
)
2277 index_type
= builtin_type_long
;
2279 *typep
= index_type
;
2281 (LONGEST
) (which
== 0
2282 ? TYPE_LOW_BOUND (range_type
)
2283 : TYPE_HIGH_BOUND (range_type
));
2287 struct type
*index_type
=
2288 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2289 NULL
, TYPE_OBJFILE (arr_type
));
2291 *typep
= TYPE_TARGET_TYPE (index_type
);
2293 (LONGEST
) (which
== 0
2294 ? TYPE_LOW_BOUND (index_type
)
2295 : TYPE_HIGH_BOUND (index_type
));
2299 /* Given that arr is an array value, returns the lower bound of the
2300 nth index (numbering from 1) if which is 0, and the upper bound if
2301 which is 1. This routine will also work for arrays with bounds
2302 supplied by run-time quantities other than discriminants. */
2305 ada_array_bound (struct value
*arr
, int n
, int which
)
2307 struct type
*arr_type
= VALUE_TYPE (arr
);
2309 if (ada_is_packed_array_type (arr_type
))
2310 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2311 else if (ada_is_simple_array_type (arr_type
))
2314 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2315 return value_from_longest (type
, v
);
2318 return desc_one_bound (desc_bounds (arr
), n
, which
);
2321 /* Given that arr is an array value, returns the length of the
2322 nth index. This routine will also work for arrays with bounds
2323 supplied by run-time quantities other than discriminants.
2324 Does not work for arrays indexed by enumeration types with representation
2325 clauses at the moment. */
2328 ada_array_length (struct value
*arr
, int n
)
2330 struct type
*arr_type
= check_typedef (VALUE_TYPE (arr
));
2332 if (ada_is_packed_array_type (arr_type
))
2333 return ada_array_length (decode_packed_array (arr
), n
);
2335 if (ada_is_simple_array_type (arr_type
))
2339 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2340 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2341 return value_from_longest (type
, v
);
2345 value_from_longest (builtin_type_ada_int
,
2346 value_as_long (desc_one_bound (desc_bounds (arr
),
2348 - value_as_long (desc_one_bound (desc_bounds (arr
),
2352 /* An empty array whose type is that of ARR_TYPE (an array type),
2353 with bounds LOW to LOW-1. */
2355 static struct value
*
2356 empty_array (struct type
*arr_type
, int low
)
2358 return allocate_value (create_range_type (NULL
, TYPE_INDEX_TYPE (arr_type
),
2363 /* Name resolution */
2365 /* The "decoded" name for the user-definable Ada operator corresponding
2369 ada_decoded_op_name (enum exp_opcode op
)
2373 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2375 if (ada_opname_table
[i
].op
== op
)
2376 return ada_opname_table
[i
].decoded
;
2378 error ("Could not find operator name for opcode");
2382 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2383 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2384 undefined namespace) and converts operators that are
2385 user-defined into appropriate function calls. If CONTEXT_TYPE is
2386 non-null, it provides a preferred result type [at the moment, only
2387 type void has any effect---causing procedures to be preferred over
2388 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2389 return type is preferred. May change (expand) *EXP. */
2392 resolve (struct expression
**expp
, int void_context_p
)
2396 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2399 /* Resolve the operator of the subexpression beginning at
2400 position *POS of *EXPP. "Resolving" consists of replacing
2401 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2402 with their resolutions, replacing built-in operators with
2403 function calls to user-defined operators, where appropriate, and,
2404 when DEPROCEDURE_P is non-zero, converting function-valued variables
2405 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2406 are as in ada_resolve, above. */
2408 static struct value
*
2409 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2410 struct type
*context_type
)
2414 struct expression
*exp
; /* Convenience: == *expp. */
2415 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2416 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2417 int nargs
; /* Number of operands. */
2423 /* Pass one: resolve operands, saving their types and updating *pos. */
2427 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2428 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2433 resolve_subexp (expp
, pos
, 0, NULL
);
2435 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2440 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2445 resolve_subexp (expp
, pos
, 0, NULL
);
2448 case OP_ATR_MODULUS
:
2478 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2480 resolve_subexp (expp
, pos
, 1, NULL
);
2482 resolve_subexp (expp
, pos
, 1, VALUE_TYPE (arg1
));
2500 case BINOP_LOGICAL_AND
:
2501 case BINOP_LOGICAL_OR
:
2502 case BINOP_BITWISE_AND
:
2503 case BINOP_BITWISE_IOR
:
2504 case BINOP_BITWISE_XOR
:
2507 case BINOP_NOTEQUAL
:
2514 case BINOP_SUBSCRIPT
:
2522 case UNOP_LOGICAL_NOT
:
2539 case OP_INTERNALVAR
:
2548 case STRUCTOP_STRUCT
:
2549 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2555 + BYTES_TO_EXP_ELEM (longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1);
2559 case TERNOP_IN_RANGE
:
2564 case BINOP_IN_BOUNDS
:
2570 error ("Unexpected operator during name resolution");
2574 (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2575 for (i
= 0; i
< nargs
; i
+= 1)
2576 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2580 /* Pass two: perform any resolution on principal operator. */
2587 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2589 struct ada_symbol_info
*candidates
;
2593 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2]
2595 exp
->elts
[pc
+ 1].block
,
2596 VAR_DOMAIN
, &candidates
);
2598 if (n_candidates
> 1)
2600 /* Types tend to get re-introduced locally, so if there
2601 are any local symbols that are not types, first filter
2604 for (j
= 0; j
< n_candidates
; j
+= 1)
2605 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2611 case LOC_REGPARM_ADDR
:
2615 case LOC_BASEREG_ARG
:
2617 case LOC_COMPUTED_ARG
:
2623 if (j
< n_candidates
)
2626 while (j
< n_candidates
)
2628 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2630 candidates
[j
] = candidates
[n_candidates
- 1];
2639 if (n_candidates
== 0)
2640 error ("No definition found for %s",
2641 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2642 else if (n_candidates
== 1)
2644 else if (deprocedure_p
2645 && !is_nonfunction (candidates
, n_candidates
))
2647 i
= ada_resolve_function (candidates
, n_candidates
, NULL
, 0,
2648 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2]
2652 error ("Could not find a match for %s",
2653 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2657 printf_filtered ("Multiple matches for %s\n",
2658 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2659 user_select_syms (candidates
, n_candidates
, 1);
2663 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2664 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2665 if (innermost_block
== NULL
||
2666 contained_in (candidates
[i
].block
, innermost_block
))
2667 innermost_block
= candidates
[i
].block
;
2671 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2674 replace_operator_with_call (expp
, pc
, 0, 0,
2675 exp
->elts
[pc
+ 2].symbol
,
2676 exp
->elts
[pc
+ 1].block
);
2683 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2684 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2686 struct ada_symbol_info
*candidates
;
2690 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5]
2692 exp
->elts
[pc
+ 4].block
,
2693 VAR_DOMAIN
, &candidates
);
2694 if (n_candidates
== 1)
2698 i
= ada_resolve_function (candidates
, n_candidates
,
2700 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+5]
2704 error ("Could not find a match for %s",
2705 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2708 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2709 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2710 if (innermost_block
== NULL
||
2711 contained_in (candidates
[i
].block
, innermost_block
))
2712 innermost_block
= candidates
[i
].block
;
2723 case BINOP_BITWISE_AND
:
2724 case BINOP_BITWISE_IOR
:
2725 case BINOP_BITWISE_XOR
:
2727 case BINOP_NOTEQUAL
:
2735 case UNOP_LOGICAL_NOT
:
2737 if (possible_user_operator_p (op
, argvec
))
2739 struct ada_symbol_info
*candidates
;
2743 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2744 (struct block
*) NULL
, VAR_DOMAIN
,
2746 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2747 ada_decoded_op_name (op
), NULL
);
2751 replace_operator_with_call (expp
, pc
, nargs
, 1,
2752 candidates
[i
].sym
, candidates
[i
].block
);
2762 return evaluate_subexp_type (exp
, pos
);
2765 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2766 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2767 a non-pointer. A type of 'void' (which is never a valid expression type)
2768 by convention matches anything. */
2769 /* The term "match" here is rather loose. The match is heuristic and
2770 liberal. FIXME: TOO liberal, in fact. */
2773 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
2775 CHECK_TYPEDEF (ftype
);
2776 CHECK_TYPEDEF (atype
);
2778 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
2779 ftype
= TYPE_TARGET_TYPE (ftype
);
2780 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
2781 atype
= TYPE_TARGET_TYPE (atype
);
2783 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
2784 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
2787 switch (TYPE_CODE (ftype
))
2792 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
2793 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
2794 TYPE_TARGET_TYPE (atype
), 0);
2796 return (may_deref
&&
2797 ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
2799 case TYPE_CODE_ENUM
:
2800 case TYPE_CODE_RANGE
:
2801 switch (TYPE_CODE (atype
))
2804 case TYPE_CODE_ENUM
:
2805 case TYPE_CODE_RANGE
:
2811 case TYPE_CODE_ARRAY
:
2812 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
2813 || ada_is_array_descriptor_type (atype
));
2815 case TYPE_CODE_STRUCT
:
2816 if (ada_is_array_descriptor_type (ftype
))
2817 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
2818 || ada_is_array_descriptor_type (atype
));
2820 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
2821 && !ada_is_array_descriptor_type (atype
));
2823 case TYPE_CODE_UNION
:
2825 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
2829 /* Return non-zero if the formals of FUNC "sufficiently match" the
2830 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
2831 may also be an enumeral, in which case it is treated as a 0-
2832 argument function. */
2835 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
2838 struct type
*func_type
= SYMBOL_TYPE (func
);
2840 if (SYMBOL_CLASS (func
) == LOC_CONST
&&
2841 TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
2842 return (n_actuals
== 0);
2843 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
2846 if (TYPE_NFIELDS (func_type
) != n_actuals
)
2849 for (i
= 0; i
< n_actuals
; i
+= 1)
2851 if (actuals
[i
] == NULL
)
2855 struct type
*ftype
= check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
2856 struct type
*atype
= check_typedef (VALUE_TYPE (actuals
[i
]));
2858 if (!ada_type_match (ftype
, atype
, 1))
2865 /* False iff function type FUNC_TYPE definitely does not produce a value
2866 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
2867 FUNC_TYPE is not a valid function type with a non-null return type
2868 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
2871 return_match (struct type
*func_type
, struct type
*context_type
)
2873 struct type
*return_type
;
2875 if (func_type
== NULL
)
2878 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
2879 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
2881 return_type
= base_type (func_type
);
2882 if (return_type
== NULL
)
2885 context_type
= base_type (context_type
);
2887 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
2888 return context_type
== NULL
|| return_type
== context_type
;
2889 else if (context_type
== NULL
)
2890 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
2892 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
2896 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
2897 function (if any) that matches the types of the NARGS arguments in
2898 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
2899 that returns that type, then eliminate matches that don't. If
2900 CONTEXT_TYPE is void and there is at least one match that does not
2901 return void, eliminate all matches that do.
2903 Asks the user if there is more than one match remaining. Returns -1
2904 if there is no such symbol or none is selected. NAME is used
2905 solely for messages. May re-arrange and modify SYMS in
2906 the process; the index returned is for the modified vector. */
2909 ada_resolve_function (struct ada_symbol_info syms
[],
2910 int nsyms
, struct value
**args
, int nargs
,
2911 const char *name
, struct type
*context_type
)
2914 int m
; /* Number of hits */
2915 struct type
*fallback
;
2916 struct type
*return_type
;
2918 return_type
= context_type
;
2919 if (context_type
== NULL
)
2920 fallback
= builtin_type_void
;
2927 for (k
= 0; k
< nsyms
; k
+= 1)
2929 struct type
*type
= check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
2931 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
2932 && return_match (type
, return_type
))
2938 if (m
> 0 || return_type
== fallback
)
2941 return_type
= fallback
;
2948 printf_filtered ("Multiple matches for %s\n", name
);
2949 user_select_syms (syms
, m
, 1);
2955 /* Returns true (non-zero) iff decoded name N0 should appear before N1
2956 in a listing of choices during disambiguation (see sort_choices, below).
2957 The idea is that overloadings of a subprogram name from the
2958 same package should sort in their source order. We settle for ordering
2959 such symbols by their trailing number (__N or $N). */
2962 encoded_ordered_before (char *N0
, char *N1
)
2966 else if (N0
== NULL
)
2971 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
2973 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
2975 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
2976 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
2980 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
2983 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
2985 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
2986 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
2988 return (strcmp (N0
, N1
) < 0);
2992 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
2996 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
2999 for (i
= 1; i
< nsyms
; i
+= 1)
3001 struct ada_symbol_info sym
= syms
[i
];
3004 for (j
= i
- 1; j
>= 0; j
-= 1)
3006 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3007 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3009 syms
[j
+ 1] = syms
[j
];
3015 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3016 by asking the user (if necessary), returning the number selected,
3017 and setting the first elements of SYMS items. Error if no symbols
3020 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3021 to be re-integrated one of these days. */
3024 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3027 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3029 int first_choice
= (max_results
== 1) ? 1 : 2;
3031 if (max_results
< 1)
3032 error ("Request to select 0 symbols!");
3036 printf_unfiltered ("[0] cancel\n");
3037 if (max_results
> 1)
3038 printf_unfiltered ("[1] all\n");
3040 sort_choices (syms
, nsyms
);
3042 for (i
= 0; i
< nsyms
; i
+= 1)
3044 if (syms
[i
].sym
== NULL
)
3047 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3049 struct symtab_and_line sal
= find_function_start_sal (syms
[i
].sym
, 1);
3050 printf_unfiltered ("[%d] %s at %s:%d\n",
3052 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3054 ? "<no source file available>"
3055 : sal
.symtab
->filename
, sal
.line
);
3061 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3062 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3063 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3064 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3066 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3067 printf_unfiltered ("[%d] %s at %s:%d\n",
3069 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3070 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3071 else if (is_enumeral
&& TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3073 printf_unfiltered ("[%d] ", i
+ first_choice
);
3074 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3076 printf_unfiltered ("'(%s) (enumeral)\n",
3077 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3079 else if (symtab
!= NULL
)
3080 printf_unfiltered (is_enumeral
3081 ? "[%d] %s in %s (enumeral)\n"
3082 : "[%d] %s at %s:?\n",
3084 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3087 printf_unfiltered (is_enumeral
3088 ? "[%d] %s (enumeral)\n"
3091 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3095 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3098 for (i
= 0; i
< n_chosen
; i
+= 1)
3099 syms
[i
] = syms
[chosen
[i
]];
3104 /* Read and validate a set of numeric choices from the user in the
3105 range 0 .. N_CHOICES-1. Place the results in increasing
3106 order in CHOICES[0 .. N-1], and return N.
3108 The user types choices as a sequence of numbers on one line
3109 separated by blanks, encoding them as follows:
3111 + A choice of 0 means to cancel the selection, throwing an error.
3112 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3113 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3115 The user is not allowed to choose more than MAX_RESULTS values.
3117 ANNOTATION_SUFFIX, if present, is used to annotate the input
3118 prompts (for use with the -f switch). */
3121 get_selections (int *choices
, int n_choices
, int max_results
,
3122 int is_all_choice
, char *annotation_suffix
)
3127 int first_choice
= is_all_choice
? 2 : 1;
3129 prompt
= getenv ("PS2");
3133 printf_unfiltered ("%s ", prompt
);
3134 gdb_flush (gdb_stdout
);
3136 args
= command_line_input ((char *) NULL
, 0, annotation_suffix
);
3139 error_no_arg ("one or more choice numbers");
3143 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3144 order, as given in args. Choices are validated. */
3150 while (isspace (*args
))
3152 if (*args
== '\0' && n_chosen
== 0)
3153 error_no_arg ("one or more choice numbers");
3154 else if (*args
== '\0')
3157 choice
= strtol (args
, &args2
, 10);
3158 if (args
== args2
|| choice
< 0
3159 || choice
> n_choices
+ first_choice
- 1)
3160 error ("Argument must be choice number");
3164 error ("cancelled");
3166 if (choice
< first_choice
)
3168 n_chosen
= n_choices
;
3169 for (j
= 0; j
< n_choices
; j
+= 1)
3173 choice
-= first_choice
;
3175 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3179 if (j
< 0 || choice
!= choices
[j
])
3182 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3183 choices
[k
+ 1] = choices
[k
];
3184 choices
[j
+ 1] = choice
;
3189 if (n_chosen
> max_results
)
3190 error ("Select no more than %d of the above", max_results
);
3195 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3196 on the function identified by SYM and BLOCK, and taking NARGS
3197 arguments. Update *EXPP as needed to hold more space. */
3200 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3201 int oplen
, struct symbol
*sym
,
3202 struct block
*block
)
3204 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3205 symbol, -oplen for operator being replaced). */
3206 struct expression
*newexp
= (struct expression
*)
3207 xmalloc (sizeof (struct expression
)
3208 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3209 struct expression
*exp
= *expp
;
3211 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3212 newexp
->language_defn
= exp
->language_defn
;
3213 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3214 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3215 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3217 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3218 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3220 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3221 newexp
->elts
[pc
+ 4].block
= block
;
3222 newexp
->elts
[pc
+ 5].symbol
= sym
;
3228 /* Type-class predicates */
3230 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3234 numeric_type_p (struct type
*type
)
3240 switch (TYPE_CODE (type
))
3245 case TYPE_CODE_RANGE
:
3246 return (type
== TYPE_TARGET_TYPE (type
)
3247 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3254 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3257 integer_type_p (struct type
*type
)
3263 switch (TYPE_CODE (type
))
3267 case TYPE_CODE_RANGE
:
3268 return (type
== TYPE_TARGET_TYPE (type
)
3269 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3276 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3279 scalar_type_p (struct type
*type
)
3285 switch (TYPE_CODE (type
))
3288 case TYPE_CODE_RANGE
:
3289 case TYPE_CODE_ENUM
:
3298 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3301 discrete_type_p (struct type
*type
)
3307 switch (TYPE_CODE (type
))
3310 case TYPE_CODE_RANGE
:
3311 case TYPE_CODE_ENUM
:
3319 /* Returns non-zero if OP with operands in the vector ARGS could be
3320 a user-defined function. Errs on the side of pre-defined operators
3321 (i.e., result 0). */
3324 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3326 struct type
*type0
=
3327 (args
[0] == NULL
) ? NULL
: check_typedef (VALUE_TYPE (args
[0]));
3328 struct type
*type1
=
3329 (args
[1] == NULL
) ? NULL
: check_typedef (VALUE_TYPE (args
[1]));
3343 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3347 case BINOP_BITWISE_AND
:
3348 case BINOP_BITWISE_IOR
:
3349 case BINOP_BITWISE_XOR
:
3350 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3353 case BINOP_NOTEQUAL
:
3358 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3361 return ((TYPE_CODE (type0
) != TYPE_CODE_ARRAY
&&
3362 (TYPE_CODE (type0
) != TYPE_CODE_PTR
||
3363 TYPE_CODE (TYPE_TARGET_TYPE (type0
))
3364 != TYPE_CODE_ARRAY
))
3365 || (TYPE_CODE (type1
) != TYPE_CODE_ARRAY
&&
3366 (TYPE_CODE (type1
) != TYPE_CODE_PTR
||
3367 TYPE_CODE (TYPE_TARGET_TYPE (type1
)) != TYPE_CODE_ARRAY
)));
3370 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3374 case UNOP_LOGICAL_NOT
:
3376 return (!numeric_type_p (type0
));
3383 /* NOTE: In the following, we assume that a renaming type's name may
3384 have an ___XD suffix. It would be nice if this went away at some
3387 /* If TYPE encodes a renaming, returns the renaming suffix, which
3388 is XR for an object renaming, XRP for a procedure renaming, XRE for
3389 an exception renaming, and XRS for a subprogram renaming. Returns
3390 NULL if NAME encodes none of these. */
3393 ada_renaming_type (struct type
*type
)
3395 if (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_ENUM
)
3397 const char *name
= type_name_no_tag (type
);
3398 const char *suffix
= (name
== NULL
) ? NULL
: strstr (name
, "___XR");
3400 || (suffix
[5] != '\000' && strchr ("PES_", suffix
[5]) == NULL
))
3409 /* Return non-zero iff SYM encodes an object renaming. */
3412 ada_is_object_renaming (struct symbol
*sym
)
3414 const char *renaming_type
= ada_renaming_type (SYMBOL_TYPE (sym
));
3415 return renaming_type
!= NULL
3416 && (renaming_type
[2] == '\0' || renaming_type
[2] == '_');
3419 /* Assuming that SYM encodes a non-object renaming, returns the original
3420 name of the renamed entity. The name is good until the end of
3424 ada_simple_renamed_entity (struct symbol
*sym
)
3427 const char *raw_name
;
3431 type
= SYMBOL_TYPE (sym
);
3432 if (type
== NULL
|| TYPE_NFIELDS (type
) < 1)
3433 error ("Improperly encoded renaming.");
3435 raw_name
= TYPE_FIELD_NAME (type
, 0);
3436 len
= (raw_name
== NULL
? 0 : strlen (raw_name
)) - 5;
3438 error ("Improperly encoded renaming.");
3440 result
= xmalloc (len
+ 1);
3441 strncpy (result
, raw_name
, len
);
3442 result
[len
] = '\000';
3447 /* Evaluation: Function Calls */
3449 /* Return an lvalue containing the value VAL. This is the identity on
3450 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3451 on the stack, using and updating *SP as the stack pointer, and
3452 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3454 static struct value
*
3455 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3457 CORE_ADDR old_sp
= *sp
;
3459 if (VALUE_LVAL (val
))
3462 if (DEPRECATED_STACK_ALIGN_P ())
3463 *sp
= push_bytes (*sp
, VALUE_CONTENTS_RAW (val
),
3464 DEPRECATED_STACK_ALIGN
3465 (TYPE_LENGTH (check_typedef (VALUE_TYPE (val
)))));
3467 *sp
= push_bytes (*sp
, VALUE_CONTENTS_RAW (val
),
3468 TYPE_LENGTH (check_typedef (VALUE_TYPE (val
))));
3470 VALUE_LVAL (val
) = lval_memory
;
3471 if (INNER_THAN (1, 2))
3472 VALUE_ADDRESS (val
) = *sp
;
3474 VALUE_ADDRESS (val
) = old_sp
;
3479 /* Return the value ACTUAL, converted to be an appropriate value for a
3480 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3481 allocating any necessary descriptors (fat pointers), or copies of
3482 values not residing in memory, updating it as needed. */
3484 static struct value
*
3485 convert_actual (struct value
*actual
, struct type
*formal_type0
,
3488 struct type
*actual_type
= check_typedef (VALUE_TYPE (actual
));
3489 struct type
*formal_type
= check_typedef (formal_type0
);
3490 struct type
*formal_target
=
3491 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3492 ? check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3493 struct type
*actual_target
=
3494 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3495 ? check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3497 if (ada_is_array_descriptor_type (formal_target
)
3498 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3499 return make_array_descriptor (formal_type
, actual
, sp
);
3500 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
)
3502 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3503 && ada_is_array_descriptor_type (actual_target
))
3504 return desc_data (actual
);
3505 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3507 if (VALUE_LVAL (actual
) != lval_memory
)
3510 actual_type
= check_typedef (VALUE_TYPE (actual
));
3511 val
= allocate_value (actual_type
);
3512 memcpy ((char *) VALUE_CONTENTS_RAW (val
),
3513 (char *) VALUE_CONTENTS (actual
),
3514 TYPE_LENGTH (actual_type
));
3515 actual
= ensure_lval (val
, sp
);
3517 return value_addr (actual
);
3520 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3521 return ada_value_ind (actual
);
3527 /* Push a descriptor of type TYPE for array value ARR on the stack at
3528 *SP, updating *SP to reflect the new descriptor. Return either
3529 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3530 to-descriptor type rather than a descriptor type), a struct value *
3531 representing a pointer to this descriptor. */
3533 static struct value
*
3534 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3536 struct type
*bounds_type
= desc_bounds_type (type
);
3537 struct type
*desc_type
= desc_base_type (type
);
3538 struct value
*descriptor
= allocate_value (desc_type
);
3539 struct value
*bounds
= allocate_value (bounds_type
);
3542 for (i
= ada_array_arity (check_typedef (VALUE_TYPE (arr
))); i
> 0; i
-= 1)
3544 modify_general_field (VALUE_CONTENTS (bounds
),
3545 value_as_long (ada_array_bound (arr
, i
, 0)),
3546 desc_bound_bitpos (bounds_type
, i
, 0),
3547 desc_bound_bitsize (bounds_type
, i
, 0));
3548 modify_general_field (VALUE_CONTENTS (bounds
),
3549 value_as_long (ada_array_bound (arr
, i
, 1)),
3550 desc_bound_bitpos (bounds_type
, i
, 1),
3551 desc_bound_bitsize (bounds_type
, i
, 1));
3554 bounds
= ensure_lval (bounds
, sp
);
3556 modify_general_field (VALUE_CONTENTS (descriptor
),
3557 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3558 fat_pntr_data_bitpos (desc_type
),
3559 fat_pntr_data_bitsize (desc_type
));
3561 modify_general_field (VALUE_CONTENTS (descriptor
),
3562 VALUE_ADDRESS (bounds
),
3563 fat_pntr_bounds_bitpos (desc_type
),
3564 fat_pntr_bounds_bitsize (desc_type
));
3566 descriptor
= ensure_lval (descriptor
, sp
);
3568 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3569 return value_addr (descriptor
);
3575 /* Assuming a dummy frame has been established on the target, perform any
3576 conversions needed for calling function FUNC on the NARGS actual
3577 parameters in ARGS, other than standard C conversions. Does
3578 nothing if FUNC does not have Ada-style prototype data, or if NARGS
3579 does not match the number of arguments expected. Use *SP as a
3580 stack pointer for additional data that must be pushed, updating its
3584 ada_convert_actuals (struct value
*func
, int nargs
, struct value
*args
[],
3589 if (TYPE_NFIELDS (VALUE_TYPE (func
)) == 0
3590 || nargs
!= TYPE_NFIELDS (VALUE_TYPE (func
)))
3593 for (i
= 0; i
< nargs
; i
+= 1)
3595 convert_actual (args
[i
], TYPE_FIELD_TYPE (VALUE_TYPE (func
), i
), sp
);
3598 /* Experimental Symbol Cache Module */
3600 /* This section implements a simple, fixed-sized hash table for those
3601 Ada-mode symbols that get looked up in the course of executing the user's
3602 commands. The size is fixed on the grounds that there are not
3603 likely to be all that many symbols looked up during any given
3604 session, regardless of the size of the symbol table. If we decide
3605 to go to a resizable table, let's just use the stuff from libiberty
3608 #define HASH_SIZE 1009
3610 struct cache_entry
{
3612 domain_enum
namespace;
3614 struct symtab
*symtab
;
3615 struct block
*block
;
3616 struct cache_entry
*next
;
3619 static struct obstack cache_space
;
3621 static struct cache_entry
*cache
[HASH_SIZE
];
3623 /* Clear all entries from the symbol cache. */
3626 clear_ada_sym_cache (void)
3628 obstack_free (&cache_space
, NULL
);
3629 obstack_init (&cache_space
);
3630 memset (cache
, '\000', sizeof (cache
));
3633 static struct cache_entry
**
3634 find_entry (const char *name
, domain_enum
namespace)
3636 int h
= msymbol_hash (name
) % HASH_SIZE
;
3637 struct cache_entry
**e
;
3638 for (e
= &cache
[h
]; *e
!= NULL
; e
= &(*e
)->next
)
3640 if (namespace == (*e
)->namespace && strcmp (name
, (*e
)->name
) == 0)
3646 /* Return (in SYM) the last cached definition for global or static symbol NAME
3647 in namespace DOMAIN. Returns 1 if entry found, 0 otherwise.
3648 If SYMTAB is non-NULL, store the symbol
3649 table in which the symbol was found there, or NULL if not found.
3650 *BLOCK is set to the block in which NAME is found. */
3653 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3654 struct symbol
**sym
, struct block
**block
,
3655 struct symtab
**symtab
)
3657 struct cache_entry
**e
= find_entry (name
, namespace);
3663 *block
= (*e
)->block
;
3665 *symtab
= (*e
)->symtab
;
3669 /* Set the cached definition of NAME in DOMAIN to SYM in block
3670 BLOCK and symbol table SYMTAB. */
3673 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3674 struct block
*block
, struct symtab
*symtab
)
3676 int h
= msymbol_hash (name
) % HASH_SIZE
;
3678 struct cache_entry
*e
=
3679 (struct cache_entry
*) obstack_alloc(&cache_space
, sizeof (*e
));
3682 e
->name
= copy
= obstack_alloc (&cache_space
, strlen (name
) + 1);
3683 strcpy (copy
, name
);
3685 e
->namespace = namespace;
3692 /* Return the result of a standard (literal, C-like) lookup of NAME in
3693 given DOMAIN, visible from lexical block BLOCK. */
3695 static struct symbol
*
3696 standard_lookup (const char *name
, const struct block
*block
,
3700 struct symtab
*symtab
;
3702 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
, NULL
))
3704 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0, &symtab
);
3705 cache_symbol (name
, domain
, sym
, block_found
, symtab
);
3710 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3711 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3712 since they contend in overloading in the same way. */
3714 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3718 for (i
= 0; i
< n
; i
+= 1)
3719 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3720 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3721 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3727 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3728 struct types. Otherwise, they may not. */
3731 equiv_types (struct type
*type0
, struct type
*type1
)
3735 if (type0
== NULL
|| type1
== NULL
3736 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3738 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3739 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3740 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3741 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3747 /* True iff SYM0 represents the same entity as SYM1, or one that is
3748 no more defined than that of SYM1. */
3751 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
3755 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
3756 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
3759 switch (SYMBOL_CLASS (sym0
))
3765 struct type
*type0
= SYMBOL_TYPE (sym0
);
3766 struct type
*type1
= SYMBOL_TYPE (sym1
);
3767 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
3768 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
3769 int len0
= strlen (name0
);
3771 TYPE_CODE (type0
) == TYPE_CODE (type1
)
3772 && (equiv_types (type0
, type1
)
3773 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
3774 && strncmp (name1
+ len0
, "___XV", 5) == 0));
3777 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
3778 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
3784 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
3785 records in OBSTACKP. Do nothing if SYM is a duplicate. */
3788 add_defn_to_vec (struct obstack
*obstackp
,
3790 struct block
*block
,
3791 struct symtab
*symtab
)
3795 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
3797 if (SYMBOL_TYPE (sym
) != NULL
)
3798 CHECK_TYPEDEF (SYMBOL_TYPE (sym
));
3799 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
3801 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
3803 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
3805 prevDefns
[i
].sym
= sym
;
3806 prevDefns
[i
].block
= block
;
3807 prevDefns
[i
].symtab
= symtab
;
3813 struct ada_symbol_info info
;
3817 info
.symtab
= symtab
;
3818 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
3822 /* Number of ada_symbol_info structures currently collected in
3823 current vector in *OBSTACKP. */
3826 num_defns_collected (struct obstack
*obstackp
)
3828 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
3831 /* Vector of ada_symbol_info structures currently collected in current
3832 vector in *OBSTACKP. If FINISH, close off the vector and return
3833 its final address. */
3835 static struct ada_symbol_info
*
3836 defns_collected (struct obstack
*obstackp
, int finish
)
3839 return obstack_finish (obstackp
);
3841 return (struct ada_symbol_info
*) obstack_base (obstackp
);
3844 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
3845 name in a form that's appropriate for the completion. The result
3846 does not need to be deallocated, but is only good until the next call.
3848 TEXT_LEN is equal to the length of TEXT.
3849 Perform a wild match if WILD_MATCH is set.
3850 ENCODED should be set if TEXT represents the start of a symbol name
3851 in its encoded form. */
3854 symbol_completion_match (const char *sym_name
,
3855 const char *text
, int text_len
,
3856 int wild_match
, int encoded
)
3859 const int verbatim_match
= (text
[0] == '<');
3864 /* Strip the leading angle bracket. */
3869 /* First, test against the fully qualified name of the symbol. */
3871 if (strncmp (sym_name
, text
, text_len
) == 0)
3874 if (match
&& !encoded
)
3876 /* One needed check before declaring a positive match is to verify
3877 that iff we are doing a verbatim match, the decoded version
3878 of the symbol name starts with '<'. Otherwise, this symbol name
3879 is not a suitable completion. */
3880 const char *sym_name_copy
= sym_name
;
3881 int has_angle_bracket
;
3883 sym_name
= ada_decode (sym_name
);
3884 has_angle_bracket
= (sym_name
[0] == '<');
3885 match
= (has_angle_bracket
== verbatim_match
);
3886 sym_name
= sym_name_copy
;
3889 if (match
&& !verbatim_match
)
3891 /* When doing non-verbatim match, another check that needs to
3892 be done is to verify that the potentially matching symbol name
3893 does not include capital letters, because the ada-mode would
3894 not be able to understand these symbol names without the
3895 angle bracket notation. */
3898 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
3903 /* Second: Try wild matching... */
3905 if (!match
&& wild_match
)
3907 /* Since we are doing wild matching, this means that TEXT
3908 may represent an unqualified symbol name. We therefore must
3909 also compare TEXT against the unqualified name of the symbol. */
3910 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
3912 if (strncmp (sym_name
, text
, text_len
) == 0)
3916 /* Finally: If we found a mach, prepare the result to return. */
3922 sym_name
= add_angle_brackets (sym_name
);
3925 sym_name
= ada_decode (sym_name
);
3930 /* A companion function to ada_make_symbol_completion_list().
3931 Check if SYM_NAME represents a symbol which name would be suitable
3932 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
3933 it is appended at the end of the given string vector SV.
3935 ORIG_TEXT is the string original string from the user command
3936 that needs to be completed. WORD is the entire command on which
3937 completion should be performed. These two parameters are used to
3938 determine which part of the symbol name should be added to the
3940 if WILD_MATCH is set, then wild matching is performed.
3941 ENCODED should be set if TEXT represents a symbol name in its
3942 encoded formed (in which case the completion should also be
3946 symbol_completion_add (struct string_vector
*sv
,
3947 const char *sym_name
,
3948 const char *text
, int text_len
,
3949 const char *orig_text
, const char *word
,
3950 int wild_match
, int encoded
)
3952 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
3953 wild_match
, encoded
);
3959 /* We found a match, so add the appropriate completion to the given
3962 if (word
== orig_text
)
3964 completion
= xmalloc (strlen (match
) + 5);
3965 strcpy (completion
, match
);
3967 else if (word
> orig_text
)
3969 /* Return some portion of sym_name. */
3970 completion
= xmalloc (strlen (match
) + 5);
3971 strcpy (completion
, match
+ (word
- orig_text
));
3975 /* Return some of ORIG_TEXT plus sym_name. */
3976 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
3977 strncpy (completion
, word
, orig_text
- word
);
3978 completion
[orig_text
- word
] = '\0';
3979 strcat (completion
, match
);
3982 string_vector_append (sv
, completion
);
3985 /* Return a list of possible symbol names completing TEXT0. The list
3986 is NULL terminated. WORD is the entire command on which completion
3990 ada_make_symbol_completion_list (const char *text0
, const char *word
)
3992 /* Note: This function is almost a copy of make_symbol_completion_list(),
3993 except it has been adapted for Ada. It is somewhat of a shame to
3994 duplicate so much code, but we don't really have the infrastructure
3995 yet to develop a language-aware version of he symbol completer... */
4000 struct string_vector result
= xnew_string_vector (128);
4003 struct partial_symtab
*ps
;
4004 struct minimal_symbol
*msymbol
;
4005 struct objfile
*objfile
;
4006 struct block
*b
, *surrounding_static_block
= 0;
4008 struct dict_iterator iter
;
4010 if (text0
[0] == '<')
4012 text
= xstrdup (text0
);
4013 make_cleanup (xfree
, text
);
4014 text_len
= strlen (text
);
4020 text
= xstrdup (ada_encode (text0
));
4021 make_cleanup (xfree
, text
);
4022 text_len
= strlen (text
);
4023 for (i
= 0; i
< text_len
; i
++)
4024 text
[i
] = tolower (text
[i
]);
4026 /* FIXME: brobecker/2003-09-17: When we get rid of ADA_RETAIN_DOTS,
4027 we can restrict the wild_match check to searching "__" only. */
4028 wild_match
= (strstr (text0
, "__") == NULL
4029 && strchr (text0
, '.') == NULL
);
4030 encoded
= (strstr (text0
, "__") != NULL
);
4033 /* First, look at the partial symtab symbols. */
4034 ALL_PSYMTABS (objfile
, ps
)
4036 struct partial_symbol
**psym
;
4038 /* If the psymtab's been read in we'll get it when we search
4039 through the blockvector. */
4043 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
4044 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
4045 + ps
->n_global_syms
);
4049 symbol_completion_add (&result
, SYMBOL_LINKAGE_NAME (*psym
),
4050 text
, text_len
, text0
, word
,
4051 wild_match
, encoded
);
4054 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
4055 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
4056 + ps
->n_static_syms
);
4060 symbol_completion_add (&result
, SYMBOL_LINKAGE_NAME (*psym
),
4061 text
, text_len
, text0
, word
,
4062 wild_match
, encoded
);
4066 /* At this point scan through the misc symbol vectors and add each
4067 symbol you find to the list. Eventually we want to ignore
4068 anything that isn't a text symbol (everything else will be
4069 handled by the psymtab code above). */
4071 ALL_MSYMBOLS (objfile
, msymbol
)
4074 symbol_completion_add (&result
, SYMBOL_LINKAGE_NAME (msymbol
),
4075 text
, text_len
, text0
, word
,
4076 wild_match
, encoded
);
4079 /* Search upwards from currently selected frame (so that we can
4080 complete on local vars. */
4082 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
4084 if (!BLOCK_SUPERBLOCK (b
))
4085 surrounding_static_block
= b
; /* For elmin of dups */
4087 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4089 symbol_completion_add (&result
, SYMBOL_LINKAGE_NAME (sym
),
4090 text
, text_len
, text0
, word
,
4091 wild_match
, encoded
);
4095 /* Go through the symtabs and check the externs and statics for
4096 symbols which match. */
4098 ALL_SYMTABS (objfile
, s
)
4101 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4102 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4104 symbol_completion_add (&result
, SYMBOL_LINKAGE_NAME (sym
),
4105 text
, text_len
, text0
, word
,
4106 wild_match
, encoded
);
4110 ALL_SYMTABS (objfile
, s
)
4113 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4114 /* Don't do this block twice. */
4115 if (b
== surrounding_static_block
)
4117 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
4119 symbol_completion_add (&result
, SYMBOL_LINKAGE_NAME (sym
),
4120 text
, text_len
, text0
, word
,
4121 wild_match
, encoded
);
4125 /* Append the closing NULL entry. */
4126 string_vector_append (&result
, NULL
);
4128 return (result
.array
);
4131 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4132 Check the global symbols if GLOBAL, the static symbols if not.
4133 Do wild-card match if WILD. */
4135 static struct partial_symbol
*
4136 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4137 int global
, domain_enum
namespace, int wild
)
4139 struct partial_symbol
**start
;
4140 int name_len
= strlen (name
);
4141 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4150 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4151 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4155 for (i
= 0; i
< length
; i
+= 1)
4157 struct partial_symbol
*psym
= start
[i
];
4159 if (SYMBOL_DOMAIN (psym
) == namespace &&
4160 wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4174 int M
= (U
+ i
) >> 1;
4175 struct partial_symbol
*psym
= start
[M
];
4176 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4178 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4180 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4191 struct partial_symbol
*psym
= start
[i
];
4193 if (SYMBOL_DOMAIN (psym
) == namespace)
4195 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4203 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4217 int M
= (U
+ i
) >> 1;
4218 struct partial_symbol
*psym
= start
[M
];
4219 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4221 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4223 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4234 struct partial_symbol
*psym
= start
[i
];
4236 if (SYMBOL_DOMAIN (psym
) == namespace)
4240 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4243 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4245 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4255 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4265 /* Find a symbol table containing symbol SYM or NULL if none. */
4267 static struct symtab
*
4268 symtab_for_sym (struct symbol
*sym
)
4271 struct objfile
*objfile
;
4273 struct symbol
*tmp_sym
;
4274 struct dict_iterator iter
;
4277 ALL_SYMTABS (objfile
, s
)
4279 switch (SYMBOL_CLASS (sym
))
4287 case LOC_CONST_BYTES
:
4288 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4289 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4291 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4292 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4298 switch (SYMBOL_CLASS (sym
))
4304 case LOC_REGPARM_ADDR
:
4309 case LOC_BASEREG_ARG
:
4311 case LOC_COMPUTED_ARG
:
4312 for (j
= FIRST_LOCAL_BLOCK
;
4313 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4315 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4316 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4327 /* Return a minimal symbol matching NAME according to Ada decoding
4328 rules. Returns NULL if there is no such minimal symbol. Names
4329 prefixed with "standard__" are handled specially: "standard__" is
4330 first stripped off, and only static and global symbols are searched. */
4332 struct minimal_symbol
*
4333 ada_lookup_simple_minsym (const char *name
)
4335 struct objfile
*objfile
;
4336 struct minimal_symbol
*msymbol
;
4339 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4341 name
+= sizeof ("standard__") - 1;
4345 wild_match
= (strstr (name
, "__") == NULL
);
4347 ALL_MSYMBOLS (objfile
, msymbol
)
4349 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4350 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4357 /* Return up minimal symbol for NAME, folded and encoded according to
4358 Ada conventions, or NULL if none. The last two arguments are ignored. */
4360 static struct minimal_symbol
*
4361 ada_lookup_minimal_symbol (const char *name
, const char *sfile
,
4362 struct objfile
*objf
)
4364 return ada_lookup_simple_minsym (ada_encode (name
));
4367 /* For all subprograms that statically enclose the subprogram of the
4368 selected frame, add symbols matching identifier NAME in DOMAIN
4369 and their blocks to the list of data in OBSTACKP, as for
4370 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4374 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4375 const char *name
, domain_enum
namespace,
4378 #ifdef HAVE_ADD_SYMBOLS_FROM_ENCLOSING_PROCS
4379 /* Use a heuristic to find the frames of enclosing subprograms: treat the
4380 pointer-sized value at location 0 from the local-variable base of a
4381 frame as a static link, and then search up the call stack for a
4382 frame with that same local-variable base. */
4383 static struct symbol static_link_sym
;
4384 static struct symbol
*static_link
;
4385 struct value
*target_link_val
;
4387 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
4388 struct frame_info
*frame
;
4390 if (! target_has_stack
)
4393 if (static_link
== NULL
)
4395 /* Initialize the local variable symbol that stands for the
4396 static link (when there is one). */
4397 static_link
= &static_link_sym
;
4398 SYMBOL_LINKAGE_NAME (static_link
) = "";
4399 SYMBOL_LANGUAGE (static_link
) = language_unknown
;
4400 SYMBOL_CLASS (static_link
) = LOC_LOCAL
;
4401 SYMBOL_DOMAIN (static_link
) = VAR_DOMAIN
;
4402 SYMBOL_TYPE (static_link
) = lookup_pointer_type (builtin_type_void
);
4403 SYMBOL_VALUE (static_link
) =
4404 -(long) TYPE_LENGTH (SYMBOL_TYPE (static_link
));
4407 frame
= get_selected_frame ();
4409 || inside_main_func (get_frame_address_in_block (frame
)))
4412 target_link_val
= read_var_value (static_link
, frame
);
4413 while (target_link_val
!= NULL
4414 && num_defns_collected (obstackp
) == 0
4415 && frame_relative_level (frame
) <= MAX_ENCLOSING_FRAME_LEVELS
)
4417 CORE_ADDR target_link
= value_as_address (target_link_val
);
4419 frame
= get_prev_frame (frame
);
4423 if (get_frame_locals_address (frame
) == target_link
)
4425 struct block
*block
;
4429 block
= get_frame_block (frame
, 0);
4430 while (block
!= NULL
&& block_function (block
) != NULL
4431 && num_defns_collected (obstackp
) == 0)
4435 ada_add_block_symbols (obstackp
, block
, name
, namespace,
4436 NULL
, NULL
, wild_match
);
4438 block
= BLOCK_SUPERBLOCK (block
);
4443 do_cleanups (old_chain
);
4447 /* True if TYPE is definitely an artificial type supplied to a symbol
4448 for which no debugging information was given in the symbol file. */
4451 is_nondebugging_type (struct type
*type
)
4453 char *name
= ada_type_name (type
);
4454 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4457 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4458 duplicate other symbols in the list (The only case I know of where
4459 this happens is when object files containing stabs-in-ecoff are
4460 linked with files containing ordinary ecoff debugging symbols (or no
4461 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4462 Returns the number of items in the modified list. */
4465 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4472 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4473 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4474 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4476 for (j
= 0; j
< nsyms
; j
+= 1)
4479 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4480 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4481 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4482 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4483 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4484 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4487 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4488 syms
[k
- 1] = syms
[k
];
4501 /* Given a type that corresponds to a renaming entity, use the type name
4502 to extract the scope (package name or function name, fully qualified,
4503 and following the GNAT encoding convention) where this renaming has been
4504 defined. The string returned needs to be deallocated after use. */
4507 xget_renaming_scope (struct type
*renaming_type
)
4509 /* The renaming types adhere to the following convention:
4510 <scope>__<rename>___<XR extension>.
4511 So, to extract the scope, we search for the "___XR" extension,
4512 and then backtrack until we find the first "__". */
4514 const char *name
= type_name_no_tag (renaming_type
);
4515 char *suffix
= strstr (name
, "___XR");
4520 /* Now, backtrack a bit until we find the first "__". Start looking
4521 at suffix - 3, as the <rename> part is at least one character long. */
4523 for (last
= suffix
- 3; last
> name
; last
--)
4524 if (last
[0] == '_' && last
[1] == '_')
4527 /* Make a copy of scope and return it. */
4529 scope_len
= last
- name
;
4530 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4532 strncpy (scope
, name
, scope_len
);
4533 scope
[scope_len
] = '\0';
4538 /* Return nonzero if NAME corresponds to a package name. */
4541 is_package_name (const char *name
)
4543 /* Here, We take advantage of the fact that no symbols are generated
4544 for packages, while symbols are generated for each function.
4545 So the condition for NAME represent a package becomes equivalent
4546 to NAME not existing in our list of symbols. There is only one
4547 small complication with library-level functions (see below). */
4551 /* If it is a function that has not been defined at library level,
4552 then we should be able to look it up in the symbols. */
4553 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4556 /* Library-level function names start with "_ada_". See if function
4557 "_ada_" followed by NAME can be found. */
4559 /* Do a quick check that NAME does not contain "__", since library-level
4560 functions names can not contain "__" in them. */
4561 if (strstr (name
, "__") != NULL
)
4564 fun_name
= (char *) alloca (strlen (name
) + 5 + 1);
4565 xasprintf (&fun_name
, "_ada_%s", name
);
4567 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4570 /* Return nonzero if SYM corresponds to a renaming entity that is
4571 visible from FUNCTION_NAME. */
4574 renaming_is_visible (const struct symbol
*sym
, char *function_name
)
4576 char *scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4578 make_cleanup (xfree
, scope
);
4580 /* If the rename has been defined in a package, then it is visible. */
4581 if (is_package_name (scope
))
4584 /* Check that the rename is in the current function scope by checking
4585 that its name starts with SCOPE. */
4587 /* If the function name starts with "_ada_", it means that it is
4588 a library-level function. Strip this prefix before doing the
4589 comparison, as the encoding for the renaming does not contain
4591 if (strncmp (function_name
, "_ada_", 5) == 0)
4594 return (strncmp (function_name
, scope
, strlen (scope
)) == 0);
4597 /* Iterates over the SYMS list and remove any entry that corresponds to
4598 a renaming entity that is not visible from the function associated
4602 GNAT emits a type following a specified encoding for each renaming
4603 entity. Unfortunately, STABS currently does not support the definition
4604 of types that are local to a given lexical block, so all renamings types
4605 are emitted at library level. As a consequence, if an application
4606 contains two renaming entities using the same name, and a user tries to
4607 print the value of one of these entities, the result of the ada symbol
4608 lookup will also contain the wrong renaming type.
4610 This function partially covers for this limitation by attempting to
4611 remove from the SYMS list renaming symbols that should be visible
4612 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4613 method with the current information available. The implementation
4614 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4616 - When the user tries to print a rename in a function while there
4617 is another rename entity defined in a package: Normally, the
4618 rename in the function has precedence over the rename in the
4619 package, so the latter should be removed from the list. This is
4620 currently not the case.
4622 - This function will incorrectly remove valid renames if
4623 the CURRENT_BLOCK corresponds to a function which symbol name
4624 has been changed by an "Export" pragma. As a consequence,
4625 the user will be unable to print such rename entities. */
4628 remove_out_of_scope_renamings (struct ada_symbol_info
*syms
,
4630 struct block
*current_block
)
4632 struct symbol
*current_function
;
4633 char *current_function_name
;
4636 /* Extract the function name associated to CURRENT_BLOCK.
4637 Abort if unable to do so. */
4639 if (current_block
== NULL
)
4642 current_function
= block_function (current_block
);
4643 if (current_function
== NULL
)
4646 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4647 if (current_function_name
== NULL
)
4650 /* Check each of the symbols, and remove it from the list if it is
4651 a type corresponding to a renaming that is out of the scope of
4652 the current block. */
4657 if (ada_is_object_renaming (syms
[i
].sym
)
4658 && !renaming_is_visible (syms
[i
].sym
, current_function_name
))
4661 for (j
= i
+ 1; j
< nsyms
; j
++)
4662 syms
[j
- 1] = syms
[j
];
4672 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4673 scope and in global scopes, returning the number of matches. Sets
4674 *RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
4675 indicating the symbols found and the blocks and symbol tables (if
4676 any) in which they were found. This vector are transient---good only to
4677 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4678 symbol match within the nest of blocks whose innermost member is BLOCK0,
4679 is the one match returned (no other matches in that or
4680 enclosing blocks is returned). If there are any matches in or
4681 surrounding BLOCK0, then these alone are returned. Otherwise, the
4682 search extends to global and file-scope (static) symbol tables.
4683 Names prefixed with "standard__" are handled specially: "standard__"
4684 is first stripped off, and only static and global symbols are searched. */
4687 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4688 domain_enum
namespace,
4689 struct ada_symbol_info
**results
)
4693 struct partial_symtab
*ps
;
4694 struct blockvector
*bv
;
4695 struct objfile
*objfile
;
4696 struct block
*block
;
4698 struct minimal_symbol
*msymbol
;
4704 obstack_free (&symbol_list_obstack
, NULL
);
4705 obstack_init (&symbol_list_obstack
);
4709 /* Search specified block and its superiors. */
4711 wild_match
= (strstr (name0
, "__") == NULL
);
4713 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4714 needed, but adding const will
4715 have a cascade effect. */
4716 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4720 name
= name0
+ sizeof ("standard__") - 1;
4724 while (block
!= NULL
)
4727 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4728 namespace, NULL
, NULL
, wild_match
);
4730 /* If we found a non-function match, assume that's the one. */
4731 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4732 num_defns_collected (&symbol_list_obstack
)))
4735 block
= BLOCK_SUPERBLOCK (block
);
4738 /* If no luck so far, try to find NAME as a local symbol in some lexically
4739 enclosing subprogram. */
4740 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4741 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4742 name
, namespace, wild_match
);
4744 /* If we found ANY matches among non-global symbols, we're done. */
4746 if (num_defns_collected (&symbol_list_obstack
) > 0)
4750 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
, &s
))
4753 add_defn_to_vec (&symbol_list_obstack
, sym
, block
, s
);
4757 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4758 tables, and psymtab's. */
4760 ALL_SYMTABS (objfile
, s
)
4765 bv
= BLOCKVECTOR (s
);
4766 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4767 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4768 objfile
, s
, wild_match
);
4771 if (namespace == VAR_DOMAIN
)
4773 ALL_MSYMBOLS (objfile
, msymbol
)
4775 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4777 switch (MSYMBOL_TYPE (msymbol
))
4779 case mst_solib_trampoline
:
4782 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4785 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4787 bv
= BLOCKVECTOR (s
);
4788 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4789 ada_add_block_symbols (&symbol_list_obstack
, block
,
4790 SYMBOL_LINKAGE_NAME (msymbol
),
4791 namespace, objfile
, s
, wild_match
);
4793 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4795 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4796 ada_add_block_symbols (&symbol_list_obstack
, block
,
4797 SYMBOL_LINKAGE_NAME (msymbol
),
4798 namespace, objfile
, s
,
4807 ALL_PSYMTABS (objfile
, ps
)
4811 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4813 s
= PSYMTAB_TO_SYMTAB (ps
);
4816 bv
= BLOCKVECTOR (s
);
4817 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4818 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4819 namespace, objfile
, s
, wild_match
);
4823 /* Now add symbols from all per-file blocks if we've gotten no hits
4824 (Not strictly correct, but perhaps better than an error).
4825 Do the symtabs first, then check the psymtabs. */
4827 if (num_defns_collected (&symbol_list_obstack
) == 0)
4830 ALL_SYMTABS (objfile
, s
)
4835 bv
= BLOCKVECTOR (s
);
4836 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4837 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4838 objfile
, s
, wild_match
);
4841 ALL_PSYMTABS (objfile
, ps
)
4845 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4847 s
= PSYMTAB_TO_SYMTAB (ps
);
4848 bv
= BLOCKVECTOR (s
);
4851 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4852 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4853 namespace, objfile
, s
, wild_match
);
4859 ndefns
= num_defns_collected (&symbol_list_obstack
);
4860 *results
= defns_collected (&symbol_list_obstack
, 1);
4862 ndefns
= remove_extra_symbols (*results
, ndefns
);
4865 cache_symbol (name0
, namespace, NULL
, NULL
, NULL
);
4867 if (ndefns
== 1 && cacheIfUnique
)
4868 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
,
4869 (*results
)[0].symtab
);
4871 ndefns
= remove_out_of_scope_renamings (*results
, ndefns
,
4872 (struct block
*) block0
);
4877 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4878 scope and in global scopes, or NULL if none. NAME is folded and
4879 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4880 but is disambiguated by user query if needed. *IS_A_FIELD_OF_THIS is
4881 set to 0 and *SYMTAB is set to the symbol table in which the symbol
4882 was found (in both cases, these assignments occur only if the
4883 pointers are non-null). */
4887 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4888 domain_enum
namespace, int *is_a_field_of_this
,
4889 struct symtab
**symtab
)
4891 struct ada_symbol_info
*candidates
;
4894 n_candidates
= ada_lookup_symbol_list (ada_encode (ada_fold_name (name
)),
4895 block0
, namespace, &candidates
);
4897 if (n_candidates
== 0)
4899 else if (n_candidates
!= 1)
4900 user_select_syms (candidates
, n_candidates
, 1);
4902 if (is_a_field_of_this
!= NULL
)
4903 *is_a_field_of_this
= 0;
4907 *symtab
= candidates
[0].symtab
;
4908 if (*symtab
== NULL
&& candidates
[0].block
!= NULL
)
4910 struct objfile
*objfile
;
4913 struct blockvector
*bv
;
4915 /* Search the list of symtabs for one which contains the
4916 address of the start of this block. */
4917 ALL_SYMTABS (objfile
, s
)
4919 bv
= BLOCKVECTOR (s
);
4920 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4921 if (BLOCK_START (b
) <= BLOCK_START (candidates
[0].block
)
4922 && BLOCK_END (b
) > BLOCK_START (candidates
[0].block
))
4925 return fixup_symbol_section (candidates
[0].sym
, objfile
);
4927 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4931 return candidates
[0].sym
;
4934 static struct symbol
*
4935 ada_lookup_symbol_nonlocal (const char *name
,
4936 const char *linkage_name
,
4937 const struct block
*block
,
4938 const domain_enum domain
,
4939 struct symtab
**symtab
)
4941 if (linkage_name
== NULL
)
4942 linkage_name
= name
;
4943 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4948 /* True iff STR is a possible encoded suffix of a normal Ada name
4949 that is to be ignored for matching purposes. Suffixes of parallel
4950 names (e.g., XVE) are not included here. Currently, the possible suffixes
4951 are given by either of the regular expression:
4953 (__[0-9]+)?\.[0-9]+ [nested subprogram suffix, on platforms such as Linux]
4954 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4955 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(LJM|X([FDBUP].*|R[^T]?)))?$
4959 is_name_suffix (const char *str
)
4962 const char *matching
;
4963 const int len
= strlen (str
);
4965 /* (__[0-9]+)?\.[0-9]+ */
4967 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4970 while (isdigit (matching
[0]))
4972 if (matching
[0] == '\0')
4976 if (matching
[0] == '.')
4979 while (isdigit (matching
[0]))
4981 if (matching
[0] == '\0')
4986 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4989 while (isdigit (matching
[0]))
4991 if (matching
[0] == '\0')
4995 /* ??? We should not modify STR directly, as we are doing below. This
4996 is fine in this case, but may become problematic later if we find
4997 that this alternative did not work, and want to try matching
4998 another one from the begining of STR. Since we modified it, we
4999 won't be able to find the begining of the string anymore! */
5003 while (str
[0] != '_' && str
[0] != '\0')
5005 if (str
[0] != 'n' && str
[0] != 'b')
5010 if (str
[0] == '\000')
5014 if (str
[1] != '_' || str
[2] == '\000')
5018 if (strcmp (str
+ 3, "LJM") == 0)
5022 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B' ||
5023 str
[4] == 'U' || str
[4] == 'P')
5025 if (str
[4] == 'R' && str
[5] != 'T')
5029 if (!isdigit (str
[2]))
5031 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5032 if (!isdigit (str
[k
]) && str
[k
] != '_')
5036 if (str
[0] == '$' && isdigit (str
[1]))
5038 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5039 if (!isdigit (str
[k
]) && str
[k
] != '_')
5046 /* Return nonzero if the given string starts with a dot ('.')
5047 followed by zero or more digits.
5049 Note: brobecker/2003-11-10: A forward declaration has not been
5050 added at the begining of this file yet, because this function
5051 is only used to work around a problem found during wild matching
5052 when trying to match minimal symbol names against symbol names
5053 obtained from dwarf-2 data. This function is therefore currently
5054 only used in wild_match() and is likely to be deleted when the
5055 problem in dwarf-2 is fixed. */
5058 is_dot_digits_suffix (const char *str
)
5064 while (isdigit (str
[0]))
5066 return (str
[0] == '\0');
5069 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5070 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5071 informational suffixes of NAME (i.e., for which is_name_suffix is
5075 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5081 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
5082 stored in the symbol table for nested function names is sometimes
5083 different from the name of the associated entity stored in
5084 the dwarf-2 data: This is the case for nested subprograms, where
5085 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
5086 while the symbol name from the dwarf-2 data does not.
5088 Although the DWARF-2 standard documents that entity names stored
5089 in the dwarf-2 data should be identical to the name as seen in
5090 the source code, GNAT takes a different approach as we already use
5091 a special encoding mechanism to convey the information so that
5092 a C debugger can still use the information generated to debug
5093 Ada programs. A corollary is that the symbol names in the dwarf-2
5094 data should match the names found in the symbol table. I therefore
5095 consider this issue as a compiler defect.
5097 Until the compiler is properly fixed, we work-around the problem
5098 by ignoring such suffixes during the match. We do so by making
5099 a copy of PATN0 and NAME0, and then by stripping such a suffix
5100 if present. We then perform the match on the resulting strings. */
5103 name_len
= strlen (name0
);
5105 name
= (char *) alloca ((name_len
+ 1) * sizeof (char));
5106 strcpy (name
, name0
);
5107 dot
= strrchr (name
, '.');
5108 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5111 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
5112 strncpy (patn
, patn0
, patn_len
);
5113 patn
[patn_len
] = '\0';
5114 dot
= strrchr (patn
, '.');
5115 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5118 patn_len
= dot
- patn
;
5122 /* Now perform the wild match. */
5124 name_len
= strlen (name
);
5125 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
5126 && strncmp (patn
, name
+ 5, patn_len
) == 0
5127 && is_name_suffix (name
+ patn_len
+ 5))
5130 while (name_len
>= patn_len
)
5132 if (strncmp (patn
, name
, patn_len
) == 0
5133 && is_name_suffix (name
+ patn_len
))
5141 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
5146 if (!islower (name
[2]))
5153 if (!islower (name
[1]))
5164 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5165 vector *defn_symbols, updating the list of symbols in OBSTACKP
5166 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5167 OBJFILE is the section containing BLOCK.
5168 SYMTAB is recorded with each symbol added. */
5171 ada_add_block_symbols (struct obstack
*obstackp
,
5172 struct block
*block
, const char *name
,
5173 domain_enum domain
, struct objfile
*objfile
,
5174 struct symtab
*symtab
, int wild
)
5176 struct dict_iterator iter
;
5177 int name_len
= strlen (name
);
5178 /* A matching argument symbol, if any. */
5179 struct symbol
*arg_sym
;
5180 /* Set true when we find a matching non-argument symbol. */
5189 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5191 if (SYMBOL_DOMAIN (sym
) == domain
&&
5192 wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5194 switch (SYMBOL_CLASS (sym
))
5200 case LOC_REGPARM_ADDR
:
5201 case LOC_BASEREG_ARG
:
5202 case LOC_COMPUTED_ARG
:
5205 case LOC_UNRESOLVED
:
5209 add_defn_to_vec (obstackp
,
5210 fixup_symbol_section (sym
, objfile
),
5219 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5221 if (SYMBOL_DOMAIN (sym
) == domain
)
5223 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5225 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5227 switch (SYMBOL_CLASS (sym
))
5233 case LOC_REGPARM_ADDR
:
5234 case LOC_BASEREG_ARG
:
5235 case LOC_COMPUTED_ARG
:
5238 case LOC_UNRESOLVED
:
5242 add_defn_to_vec (obstackp
,
5243 fixup_symbol_section (sym
, objfile
),
5252 if (!found_sym
&& arg_sym
!= NULL
)
5254 add_defn_to_vec (obstackp
,
5255 fixup_symbol_section (arg_sym
, objfile
),
5264 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5266 if (SYMBOL_DOMAIN (sym
) == domain
)
5270 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5273 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5275 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5280 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5282 switch (SYMBOL_CLASS (sym
))
5288 case LOC_REGPARM_ADDR
:
5289 case LOC_BASEREG_ARG
:
5290 case LOC_COMPUTED_ARG
:
5293 case LOC_UNRESOLVED
:
5297 add_defn_to_vec (obstackp
,
5298 fixup_symbol_section (sym
, objfile
),
5307 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5308 They aren't parameters, right? */
5309 if (!found_sym
&& arg_sym
!= NULL
)
5311 add_defn_to_vec (obstackp
,
5312 fixup_symbol_section (arg_sym
, objfile
),
5318 /* Breakpoint-related */
5320 /* Import message from symtab.c. */
5321 extern char no_symtab_msg
[];
5323 /* Assuming that LINE is pointing at the beginning of an argument to
5324 'break', return a pointer to the delimiter for the initial segment
5325 of that name. This is the first ':', ' ', or end of LINE. */
5328 ada_start_decode_line_1 (char *line
)
5330 /* NOTE: strpbrk would be more elegant, but I am reluctant to be
5331 the first to use such a library function in GDB code. */
5333 for (p
= line
; *p
!= '\000' && *p
!= ' ' && *p
!= ':'; p
+= 1)
5338 /* *SPEC points to a function and line number spec (as in a break
5339 command), following any initial file name specification.
5341 Return all symbol table/line specfications (sals) consistent with the
5342 information in *SPEC and FILE_TABLE in the following sense:
5343 + FILE_TABLE is null, or the sal refers to a line in the file
5344 named by FILE_TABLE.
5345 + If *SPEC points to an argument with a trailing ':LINENUM',
5346 then the sal refers to that line (or one following it as closely as
5348 + If *SPEC does not start with '*', the sal is in a function with
5351 Returns with 0 elements if no matching non-minimal symbols found.
5353 If *SPEC begins with a function name of the form <NAME>, then NAME
5354 is taken as a literal name; otherwise the function name is subject
5355 to the usual encoding.
5357 *SPEC is updated to point after the function/line number specification.
5359 FUNFIRSTLINE is non-zero if we desire the first line of real code
5362 If CANONICAL is non-NULL, and if any of the sals require a
5363 'canonical line spec', then *CANONICAL is set to point to an array
5364 of strings, corresponding to and equal in length to the returned
5365 list of sals, such that (*CANONICAL)[i] is non-null and contains a
5366 canonical line spec for the ith returned sal, if needed. If no
5367 canonical line specs are required and CANONICAL is non-null,
5368 *CANONICAL is set to NULL.
5370 A 'canonical line spec' is simply a name (in the format of the
5371 breakpoint command) that uniquely identifies a breakpoint position,
5372 with no further contextual information or user selection. It is
5373 needed whenever the file name, function name, and line number
5374 information supplied is insufficient for this unique
5375 identification. Currently overloaded functions, the name '*',
5376 or static functions without a filename yield a canonical line spec.
5377 The array and the line spec strings are allocated on the heap; it
5378 is the caller's responsibility to free them. */
5380 struct symtabs_and_lines
5381 ada_finish_decode_line_1 (char **spec
, struct symtab
*file_table
,
5382 int funfirstline
, char ***canonical
)
5384 struct ada_symbol_info
*symbols
;
5385 const struct block
*block
;
5386 int n_matches
, i
, line_num
;
5387 struct symtabs_and_lines selected
;
5388 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
5394 char *unquoted_name
;
5396 if (file_table
== NULL
)
5397 block
= block_static_block (get_selected_block (0));
5399 block
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (file_table
), STATIC_BLOCK
);
5401 if (canonical
!= NULL
)
5402 *canonical
= (char **) NULL
;
5404 is_quoted
= (**spec
&& strchr (get_gdb_completer_quote_characters (),
5413 *spec
= skip_quoted (*spec
);
5414 while (**spec
!= '\000' &&
5415 !strchr (ada_completer_word_break_characters
, **spec
))
5421 if (file_table
!= NULL
&& (*spec
)[0] == ':' && isdigit ((*spec
)[1]))
5423 line_num
= strtol (*spec
+ 1, spec
, 10);
5424 while (**spec
== ' ' || **spec
== '\t')
5431 error ("Wild-card function with no line number or file name.");
5433 return ada_sals_for_line (file_table
->filename
, line_num
,
5434 funfirstline
, canonical
, 0);
5437 if (name
[0] == '\'')
5445 unquoted_name
= (char *) alloca (len
- 1);
5446 memcpy (unquoted_name
, name
+ 1, len
- 2);
5447 unquoted_name
[len
- 2] = '\000';
5452 unquoted_name
= (char *) alloca (len
+ 1);
5453 memcpy (unquoted_name
, name
, len
);
5454 unquoted_name
[len
] = '\000';
5455 lower_name
= (char *) alloca (len
+ 1);
5456 for (i
= 0; i
< len
; i
+= 1)
5457 lower_name
[i
] = tolower (name
[i
]);
5458 lower_name
[len
] = '\000';
5462 if (lower_name
!= NULL
)
5463 n_matches
= ada_lookup_symbol_list (ada_encode (lower_name
), block
,
5464 VAR_DOMAIN
, &symbols
);
5466 n_matches
= ada_lookup_symbol_list (unquoted_name
, block
,
5467 VAR_DOMAIN
, &symbols
);
5468 if (n_matches
== 0 && line_num
>= 0)
5469 error ("No line number information found for %s.", unquoted_name
);
5470 else if (n_matches
== 0)
5472 #ifdef HPPA_COMPILER_BUG
5473 /* FIXME: See comment in symtab.c::decode_line_1 */
5475 volatile struct symtab_and_line val
;
5476 #define volatile /*nothing */
5478 struct symtab_and_line val
;
5480 struct minimal_symbol
*msymbol
;
5485 if (lower_name
!= NULL
)
5486 msymbol
= ada_lookup_simple_minsym (ada_encode (lower_name
));
5487 if (msymbol
== NULL
)
5488 msymbol
= ada_lookup_simple_minsym (unquoted_name
);
5489 if (msymbol
!= NULL
)
5491 val
.pc
= SYMBOL_VALUE_ADDRESS (msymbol
);
5492 val
.section
= SYMBOL_BFD_SECTION (msymbol
);
5495 val
.pc
+= FUNCTION_START_OFFSET
;
5496 SKIP_PROLOGUE (val
.pc
);
5498 selected
.sals
= (struct symtab_and_line
*)
5499 xmalloc (sizeof (struct symtab_and_line
));
5500 selected
.sals
[0] = val
;
5505 if (!have_full_symbols () &&
5506 !have_partial_symbols () && !have_minimal_symbols ())
5507 error ("No symbol table is loaded. Use the \"file\" command.");
5509 error ("Function \"%s\" not defined.", unquoted_name
);
5510 return selected
; /* for lint */
5515 struct symtabs_and_lines best_sal
=
5516 find_sal_from_funcs_and_line (file_table
->filename
, line_num
,
5517 symbols
, n_matches
);
5519 adjust_pc_past_prologue (&best_sal
.sals
[0].pc
);
5525 user_select_syms (symbols
, n_matches
, n_matches
);
5528 selected
.sals
= (struct symtab_and_line
*)
5529 xmalloc (sizeof (struct symtab_and_line
) * selected
.nelts
);
5530 memset (selected
.sals
, 0, selected
.nelts
* sizeof (selected
.sals
[i
]));
5531 make_cleanup (xfree
, selected
.sals
);
5534 while (i
< selected
.nelts
)
5536 if (SYMBOL_CLASS (symbols
[i
].sym
) == LOC_BLOCK
)
5538 = find_function_start_sal (symbols
[i
].sym
, funfirstline
);
5539 else if (SYMBOL_LINE (symbols
[i
].sym
) != 0)
5541 selected
.sals
[i
].symtab
=
5543 ? symbols
[i
].symtab
: symtab_for_sym (symbols
[i
].sym
);
5544 selected
.sals
[i
].line
= SYMBOL_LINE (symbols
[i
].sym
);
5546 else if (line_num
>= 0)
5548 /* Ignore this choice */
5549 symbols
[i
] = symbols
[selected
.nelts
- 1];
5550 selected
.nelts
-= 1;
5554 error ("Line number not known for symbol \"%s\"", unquoted_name
);
5558 if (canonical
!= NULL
&& (line_num
>= 0 || n_matches
> 1))
5560 *canonical
= (char **) xmalloc (sizeof (char *) * selected
.nelts
);
5561 for (i
= 0; i
< selected
.nelts
; i
+= 1)
5563 extended_canonical_line_spec (selected
.sals
[i
],
5564 SYMBOL_PRINT_NAME (symbols
[i
].sym
));
5567 discard_cleanups (old_chain
);
5571 /* The (single) sal corresponding to line LINE_NUM in a symbol table
5572 with file name FILENAME that occurs in one of the functions listed
5573 in the symbol fields of SYMBOLS[0 .. NSYMS-1]. */
5575 static struct symtabs_and_lines
5576 find_sal_from_funcs_and_line (const char *filename
, int line_num
,
5577 struct ada_symbol_info
*symbols
, int nsyms
)
5579 struct symtabs_and_lines sals
;
5580 int best_index
, best
;
5581 struct linetable
*best_linetable
;
5582 struct objfile
*objfile
;
5584 struct symtab
*best_symtab
;
5586 read_all_symtabs (filename
);
5589 best_linetable
= NULL
;
5592 ALL_SYMTABS (objfile
, s
)
5594 struct linetable
*l
;
5599 if (strcmp (filename
, s
->filename
) != 0)
5602 ind
= find_line_in_linetable (l
, line_num
, symbols
, nsyms
, &exact
);
5612 if (best
== 0 || l
->item
[ind
].line
< best
)
5614 best
= l
->item
[ind
].line
;
5623 error ("Line number not found in designated function.");
5628 sals
.sals
= (struct symtab_and_line
*) xmalloc (sizeof (sals
.sals
[0]));
5630 init_sal (&sals
.sals
[0]);
5632 sals
.sals
[0].line
= best_linetable
->item
[best_index
].line
;
5633 sals
.sals
[0].pc
= best_linetable
->item
[best_index
].pc
;
5634 sals
.sals
[0].symtab
= best_symtab
;
5639 /* Return the index in LINETABLE of the best match for LINE_NUM whose
5640 pc falls within one of the functions denoted by the symbol fields
5641 of SYMBOLS[0..NSYMS-1]. Set *EXACTP to 1 if the match is exact,
5645 find_line_in_linetable (struct linetable
*linetable
, int line_num
,
5646 struct ada_symbol_info
*symbols
, int nsyms
, int *exactp
)
5648 int i
, len
, best_index
, best
;
5650 if (line_num
<= 0 || linetable
== NULL
)
5653 len
= linetable
->nitems
;
5654 for (i
= 0, best_index
= -1, best
= 0; i
< len
; i
+= 1)
5657 struct linetable_entry
*item
= &(linetable
->item
[i
]);
5659 for (k
= 0; k
< nsyms
; k
+= 1)
5661 if (symbols
[k
].sym
!= NULL
5662 && SYMBOL_CLASS (symbols
[k
].sym
) == LOC_BLOCK
5663 && item
->pc
>= BLOCK_START (SYMBOL_BLOCK_VALUE (symbols
[k
].sym
))
5664 && item
->pc
< BLOCK_END (SYMBOL_BLOCK_VALUE (symbols
[k
].sym
)))
5671 if (item
->line
== line_num
)
5677 if (item
->line
> line_num
&& (best
== 0 || item
->line
< best
))
5688 /* Find the smallest k >= LINE_NUM such that k is a line number in
5689 LINETABLE, and k falls strictly within a named function that begins at
5690 or before LINE_NUM. Return -1 if there is no such k. */
5693 nearest_line_number_in_linetable (struct linetable
*linetable
, int line_num
)
5697 if (line_num
<= 0 || linetable
== NULL
|| linetable
->nitems
== 0)
5699 len
= linetable
->nitems
;
5705 struct linetable_entry
*item
= &(linetable
->item
[i
]);
5707 if (item
->line
>= line_num
&& item
->line
< best
)
5710 CORE_ADDR start
, end
;
5713 find_pc_partial_function (item
->pc
, &func_name
, &start
, &end
);
5715 if (func_name
!= NULL
&& item
->pc
< end
)
5717 if (item
->line
== line_num
)
5721 struct symbol
*sym
=
5722 standard_lookup (func_name
, NULL
, VAR_DOMAIN
);
5723 if (is_plausible_func_for_line (sym
, line_num
))
5729 while (i
< len
&& linetable
->item
[i
].pc
< end
);
5739 return (best
== INT_MAX
) ? -1 : best
;
5743 /* Return the next higher index, k, into LINETABLE such that k > IND,
5744 entry k in LINETABLE has a line number equal to LINE_NUM, k
5745 corresponds to a PC that is in a function different from that
5746 corresponding to IND, and falls strictly within a named function
5747 that begins at a line at or preceding STARTING_LINE.
5748 Return -1 if there is no such k.
5749 IND == -1 corresponds to no function. */
5752 find_next_line_in_linetable (struct linetable
*linetable
, int line_num
,
5753 int starting_line
, int ind
)
5757 if (line_num
<= 0 || linetable
== NULL
|| ind
>= linetable
->nitems
)
5759 len
= linetable
->nitems
;
5763 CORE_ADDR start
, end
;
5765 if (find_pc_partial_function (linetable
->item
[ind
].pc
,
5766 (char **) NULL
, &start
, &end
))
5768 while (ind
< len
&& linetable
->item
[ind
].pc
< end
)
5780 struct linetable_entry
*item
= &(linetable
->item
[i
]);
5782 if (item
->line
>= line_num
)
5785 CORE_ADDR start
, end
;
5788 find_pc_partial_function (item
->pc
, &func_name
, &start
, &end
);
5790 if (func_name
!= NULL
&& item
->pc
< end
)
5792 if (item
->line
== line_num
)
5794 struct symbol
*sym
=
5795 standard_lookup (func_name
, NULL
, VAR_DOMAIN
);
5796 if (is_plausible_func_for_line (sym
, starting_line
))
5800 while ((i
+ 1) < len
&& linetable
->item
[i
+ 1].pc
< end
)
5812 /* True iff function symbol SYM starts somewhere at or before line #
5816 is_plausible_func_for_line (struct symbol
*sym
, int line_num
)
5818 struct symtab_and_line start_sal
;
5823 start_sal
= find_function_start_sal (sym
, 0);
5825 return (start_sal
.line
!= 0 && line_num
>= start_sal
.line
);
5828 /* Read in all symbol tables corresponding to partial symbol tables
5829 with file name FILENAME. */
5832 read_all_symtabs (const char *filename
)
5834 struct partial_symtab
*ps
;
5835 struct objfile
*objfile
;
5837 ALL_PSYMTABS (objfile
, ps
)
5841 if (strcmp (filename
, ps
->filename
) == 0)
5842 PSYMTAB_TO_SYMTAB (ps
);
5846 /* All sals corresponding to line LINE_NUM in a symbol table from file
5847 FILENAME, as filtered by the user. Filter out any lines that
5848 reside in functions with "suppressed" names (not corresponding to
5849 explicit Ada functions), if there is at least one in a function
5850 with a non-suppressed name. If CANONICAL is not null, set
5851 it to a corresponding array of canonical line specs.
5852 If ONE_LOCATION_ONLY is set and several matches are found for
5853 the given location, then automatically select the first match found
5854 instead of asking the user which instance should be returned. */
5856 struct symtabs_and_lines
5857 ada_sals_for_line (const char *filename
, int line_num
,
5858 int funfirstline
, char ***canonical
,
5859 int one_location_only
)
5861 struct symtabs_and_lines result
;
5862 struct objfile
*objfile
;
5864 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
5867 read_all_symtabs (filename
);
5870 (struct symtab_and_line
*) xmalloc (4 * sizeof (result
.sals
[0]));
5873 make_cleanup (free_current_contents
, &result
.sals
);
5875 ALL_SYMTABS (objfile
, s
)
5877 int ind
, target_line_num
;
5881 if (strcmp (s
->filename
, filename
) != 0)
5885 nearest_line_number_in_linetable (LINETABLE (s
), line_num
);
5886 if (target_line_num
== -1)
5893 find_next_line_in_linetable (LINETABLE (s
),
5894 target_line_num
, line_num
, ind
);
5899 GROW_VECT (result
.sals
, len
, result
.nelts
+ 1);
5900 init_sal (&result
.sals
[result
.nelts
]);
5901 result
.sals
[result
.nelts
].line
= line_num
;
5902 result
.sals
[result
.nelts
].pc
= LINETABLE (s
)->item
[ind
].pc
;
5903 result
.sals
[result
.nelts
].symtab
= s
;
5906 adjust_pc_past_prologue (&result
.sals
[result
.nelts
].pc
);
5912 if (canonical
!= NULL
|| result
.nelts
> 1)
5915 char **func_names
= (char **) alloca (result
.nelts
* sizeof (char *));
5916 int first_choice
= (result
.nelts
> 1) ? 2 : 1;
5917 int *choices
= (int *) alloca (result
.nelts
* sizeof (int));
5919 for (k
= 0; k
< result
.nelts
; k
+= 1)
5921 find_pc_partial_function (result
.sals
[k
].pc
, &func_names
[k
],
5922 (CORE_ADDR
*) NULL
, (CORE_ADDR
*) NULL
);
5923 if (func_names
[k
] == NULL
)
5924 error ("Could not find function for one or more breakpoints.");
5927 /* Remove suppressed names, unless all are suppressed. */
5928 for (j
= 0; j
< result
.nelts
; j
+= 1)
5929 if (!is_suppressed_name (func_names
[j
]))
5931 /* At least one name is unsuppressed, so remove all
5932 suppressed names. */
5933 for (k
= n
= 0; k
< result
.nelts
; k
+= 1)
5934 if (!is_suppressed_name (func_names
[k
]))
5936 func_names
[n
] = func_names
[k
];
5937 result
.sals
[n
] = result
.sals
[k
];
5944 if (result
.nelts
> 1)
5946 if (one_location_only
)
5948 /* Automatically select the first of all possible choices. */
5954 printf_unfiltered ("[0] cancel\n");
5955 if (result
.nelts
> 1)
5956 printf_unfiltered ("[1] all\n");
5957 for (k
= 0; k
< result
.nelts
; k
+= 1)
5958 printf_unfiltered ("[%d] %s\n", k
+ first_choice
,
5959 ada_decode (func_names
[k
]));
5961 n
= get_selections (choices
, result
.nelts
, result
.nelts
,
5962 result
.nelts
> 1, "instance-choice");
5965 for (k
= 0; k
< n
; k
+= 1)
5967 result
.sals
[k
] = result
.sals
[choices
[k
]];
5968 func_names
[k
] = func_names
[choices
[k
]];
5973 if (canonical
!= NULL
&& result
.nelts
== 0)
5975 else if (canonical
!= NULL
)
5977 *canonical
= (char **) xmalloc (result
.nelts
* sizeof (char **));
5978 make_cleanup (xfree
, *canonical
);
5979 for (k
= 0; k
< result
.nelts
; k
+= 1)
5982 extended_canonical_line_spec (result
.sals
[k
], func_names
[k
]);
5983 if ((*canonical
)[k
] == NULL
)
5984 error ("Could not locate one or more breakpoints.");
5985 make_cleanup (xfree
, (*canonical
)[k
]);
5990 if (result
.nelts
== 0)
5992 do_cleanups (old_chain
);
5996 discard_cleanups (old_chain
);
6001 /* A canonical line specification of the form FILE:NAME:LINENUM for
6002 symbol table and line data SAL. NULL if insufficient
6003 information. The caller is responsible for releasing any space
6007 extended_canonical_line_spec (struct symtab_and_line sal
, const char *name
)
6011 if (sal
.symtab
== NULL
|| sal
.symtab
->filename
== NULL
|| sal
.line
<= 0)
6014 r
= (char *) xmalloc (strlen (name
) + strlen (sal
.symtab
->filename
)
6015 + sizeof (sal
.line
) * 3 + 3);
6016 sprintf (r
, "%s:'%s':%d", sal
.symtab
->filename
, name
, sal
.line
);
6020 /* If the main procedure is written in Ada, then return its name.
6021 The result is good until the next call. Return NULL if the main
6022 procedure doesn't appear to be in Ada. */
6025 ada_main_name (void)
6027 struct minimal_symbol
*msym
;
6028 CORE_ADDR main_program_name_addr
;
6029 static char main_program_name
[1024];
6030 /* For Ada, the name of the main procedure is stored in a specific
6031 string constant, generated by the binder. Look for that symbol,
6032 extract its address, and then read that string. If we didn't find
6033 that string, then most probably the main procedure is not written
6035 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
6039 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
6040 if (main_program_name_addr
== 0)
6041 error ("Invalid address for Ada main program name.");
6043 extract_string (main_program_name_addr
, main_program_name
);
6044 return main_program_name
;
6047 /* The main procedure doesn't seem to be in Ada. */
6051 /* Return type of Ada breakpoint associated with bp_stat:
6052 0 if not an Ada-specific breakpoint, 1 for break on specific exception,
6053 2 for break on unhandled exception, 3 for assert. */
6056 ada_exception_breakpoint_type (bpstat bs
)
6059 return ((! bs
|| ! bs
->breakpoint_at
) ? 0
6060 : bs
->breakpoint_at
->break_on_exception
);
6066 /* True iff FRAME is very likely to be that of a function that is
6067 part of the runtime system. This is all very heuristic, but is
6068 intended to be used as advice as to what frames are uninteresting
6072 is_known_support_routine (struct frame_info
*frame
)
6074 struct frame_info
*next_frame
= get_next_frame (frame
);
6075 /* If frame is not innermost, that normally means that frame->pc
6076 points to *after* the call instruction, and we want to get the line
6077 containing the call, never the next line. But if the next frame is
6078 a signal_handler_caller or a dummy frame, then the next frame was
6079 not entered as the result of a call, and we want to get the line
6080 containing frame->pc. */
6081 const int pc_is_after_call
=
6083 && get_frame_type (next_frame
) != SIGTRAMP_FRAME
6084 && get_frame_type (next_frame
) != DUMMY_FRAME
;
6085 struct symtab_and_line sal
6086 = find_pc_line (get_frame_pc (frame
), pc_is_after_call
);
6092 1. The symtab is null (indicating no debugging symbols)
6093 2. The symtab's filename does not exist.
6094 3. The object file's name is one of the standard libraries.
6095 4. The symtab's file name has the form of an Ada library source file.
6096 5. The function at frame's PC has a GNAT-compiler-generated name. */
6098 if (sal
.symtab
== NULL
)
6101 /* On some systems (e.g. VxWorks), the kernel contains debugging
6102 symbols; in this case, the filename referenced by these symbols
6105 if (stat (sal
.symtab
->filename
, &st
))
6108 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
6110 re_comp (known_runtime_file_name_patterns
[i
]);
6111 if (re_exec (sal
.symtab
->filename
))
6114 if (sal
.symtab
->objfile
!= NULL
)
6116 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
6118 re_comp (known_runtime_file_name_patterns
[i
]);
6119 if (re_exec (sal
.symtab
->objfile
->name
))
6124 /* If the frame PC points after the call instruction, then we need to
6125 decrement it in order to search for the function associated to this
6126 PC. Otherwise, if the associated call was the last instruction of
6127 the function, we might either find the wrong function or even fail
6128 during the function name lookup. */
6129 if (pc_is_after_call
)
6130 func_name
= function_name_from_pc (get_frame_pc (frame
) - 1);
6132 func_name
= function_name_from_pc (get_frame_pc (frame
));
6134 if (func_name
== NULL
)
6137 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
6139 re_comp (known_auxiliary_function_name_patterns
[i
]);
6140 if (re_exec (func_name
))
6147 /* Find the first frame that contains debugging information and that is not
6148 part of the Ada run-time, starting from FI and moving upward. */
6151 ada_find_printable_frame (struct frame_info
*fi
)
6153 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
6155 if (!is_known_support_routine (fi
))
6164 /* Name found for exception associated with last bpstat sent to
6165 ada_adjust_exception_stop. Set to the null string if that bpstat
6166 did not correspond to an Ada exception or no name could be found. */
6168 static char last_exception_name
[256];
6170 /* If BS indicates a stop in an Ada exception, try to go up to a frame
6171 that will be meaningful to the user, and save the name of the last
6172 exception (truncated, if necessary) in last_exception_name. */
6175 ada_adjust_exception_stop (bpstat bs
)
6178 struct frame_info
*fi
;
6180 char *selected_frame_func
;
6183 last_exception_name
[0] = '\0';
6184 fi
= get_selected_frame ();
6185 selected_frame_func
= function_name_from_pc (get_frame_pc (fi
));
6187 switch (ada_exception_breakpoint_type (bs
))
6194 /* Unhandled exceptions. Select the frame corresponding to
6195 ada.exceptions.process_raise_exception. This frame is at
6196 least 2 levels up, so we simply skip the first 2 frames
6197 without checking the name of their associated function. */
6198 for (frame_level
= 0; frame_level
< 2; frame_level
+= 1)
6200 fi
= get_prev_frame (fi
);
6203 const char *func_name
= function_name_from_pc (get_frame_pc (fi
));
6204 if (func_name
!= NULL
6205 && strcmp (func_name
, process_raise_exception_name
) == 0)
6206 break; /* We found the frame we were looking for... */
6207 fi
= get_prev_frame (fi
);
6215 addr
= parse_and_eval_address ("e.full_name");
6218 read_memory (addr
, last_exception_name
,
6219 sizeof (last_exception_name
) - 1);
6220 last_exception_name
[sizeof (last_exception_name
) - 1] = '\0';
6221 ada_find_printable_frame (get_selected_frame ());
6224 /* Output Ada exception name (if any) associated with last call to
6225 ada_adjust_exception_stop. */
6228 ada_print_exception_stop (bpstat bs
)
6230 if (last_exception_name
[0] != '\000')
6232 ui_out_text (uiout
, last_exception_name
);
6233 ui_out_text (uiout
, " at ");
6237 /* Parses the CONDITION string associated with a breakpoint exception
6238 to get the name of the exception on which the breakpoint has been
6239 set. The returned string needs to be deallocated after use. */
6242 exception_name_from_cond (const char *condition
)
6244 char *start
, *end
, *exception_name
;
6245 int exception_name_len
;
6247 start
= strrchr (condition
, '&') + 1;
6248 end
= strchr (start
, ')') - 1;
6249 exception_name_len
= end
- start
+ 1;
6252 (char *) xmalloc ((exception_name_len
+ 1) * sizeof (char));
6253 sprintf (exception_name
, "%.*s", exception_name_len
, start
);
6255 return exception_name
;
6258 /* Print Ada-specific exception information about B, other than task
6259 clause. Return non-zero iff B was an Ada exception breakpoint. */
6262 ada_print_exception_breakpoint_nontask (struct breakpoint
*b
)
6265 if (b
->break_on_exception
== 1)
6267 if (b
->cond_string
) /* the breakpoint is on a specific exception. */
6269 char *exception_name
= exception_name_from_cond (b
->cond_string
);
6271 make_cleanup (xfree
, exception_name
);
6273 ui_out_text (uiout
, "on ");
6274 if (ui_out_is_mi_like_p (uiout
))
6275 ui_out_field_string (uiout
, "exception", exception_name
);
6278 ui_out_text (uiout
, "exception ");
6279 ui_out_text (uiout
, exception_name
);
6280 ui_out_text (uiout
, " ");
6284 ui_out_text (uiout
, "on all exceptions");
6286 else if (b
->break_on_exception
== 2)
6287 ui_out_text (uiout
, "on unhandled exception");
6288 else if (b
->break_on_exception
== 3)
6289 ui_out_text (uiout
, "on assert failure");
6298 /* Print task identifier for breakpoint B, if it is an Ada-specific
6299 breakpoint with non-zero tasking information. */
6302 ada_print_exception_breakpoint_task (struct breakpoint
*b
)
6307 ui_out_text (uiout
, " task ");
6308 ui_out_field_int (uiout
, "task", b
->task
);
6314 ada_is_exception_sym (struct symbol
*sym
)
6316 char *type_name
= type_name_no_tag (SYMBOL_TYPE (sym
));
6318 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
6319 && SYMBOL_CLASS (sym
) != LOC_BLOCK
6320 && SYMBOL_CLASS (sym
) != LOC_CONST
6321 && type_name
!= NULL
&& strcmp (type_name
, "exception") == 0);
6325 ada_maybe_exception_partial_symbol (struct partial_symbol
*sym
)
6327 return (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
6328 && SYMBOL_CLASS (sym
) != LOC_BLOCK
6329 && SYMBOL_CLASS (sym
) != LOC_CONST
);
6332 /* Cause the appropriate error if no appropriate runtime symbol is
6333 found to set a breakpoint, using ERR_DESC to describe the
6337 error_breakpoint_runtime_sym_not_found (const char *err_desc
)
6339 /* If we are not debugging an Ada program, we can not put exception
6342 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
6343 error ("Unable to break on %s. Is this an Ada main program?", err_desc
);
6345 /* If the symbol does not exist, then check that the program is
6346 already started, to make sure that shared libraries have been
6347 loaded. If it is not started, this may mean that the symbol is
6348 in a shared library. */
6350 if (ptid_get_pid (inferior_ptid
) == 0)
6351 error ("Unable to break on %s. Try to start the program first.", err_desc
);
6353 /* At this point, we know that we are debugging an Ada program and
6354 that the inferior has been started, but we still are not able to
6355 find the run-time symbols. That can mean that we are in
6356 configurable run time mode, or that a-except as been optimized
6357 out by the linker... In any case, at this point it is not worth
6358 supporting this feature. */
6360 error ("Cannot break on %s in this configuration.", err_desc
);
6363 /* Test if NAME is currently defined, and that either ALLOW_TRAMP or
6364 the symbol is not a shared-library trampoline. Return the result of
6368 is_runtime_sym_defined (const char *name
, int allow_tramp
)
6370 struct minimal_symbol
*msym
;
6372 msym
= lookup_minimal_symbol (name
, NULL
, NULL
);
6373 return (msym
!= NULL
&& msym
->type
!= mst_unknown
6374 && (allow_tramp
|| msym
->type
!= mst_solib_trampoline
));
6377 /* If ARG points to an Ada exception or assert breakpoint, rewrite
6378 into equivalent form. Return resulting argument string. Set
6379 *BREAK_ON_EXCEPTIONP to 1 for ordinary break on exception, 2 for
6380 break on unhandled, 3 for assert, 0 otherwise. */
6383 ada_breakpoint_rewrite (char *arg
, int *break_on_exceptionp
)
6387 *break_on_exceptionp
= 0;
6388 if (current_language
->la_language
== language_ada
6389 && strncmp (arg
, "exception", 9) == 0
6390 && (arg
[9] == ' ' || arg
[9] == '\t' || arg
[9] == '\0'))
6392 char *tok
, *end_tok
;
6394 int has_exception_propagation
=
6395 is_runtime_sym_defined (raise_sym_name
, 1);
6397 *break_on_exceptionp
= 1;
6400 while (*tok
== ' ' || *tok
== '\t')
6405 while (*end_tok
!= ' ' && *end_tok
!= '\t' && *end_tok
!= '\000')
6408 toklen
= end_tok
- tok
;
6410 arg
= (char *) xmalloc (sizeof (longest_exception_template
) + toklen
);
6411 make_cleanup (xfree
, arg
);
6414 if (has_exception_propagation
)
6415 sprintf (arg
, "'%s'", raise_sym_name
);
6417 error_breakpoint_runtime_sym_not_found ("exception");
6419 else if (strncmp (tok
, "unhandled", toklen
) == 0)
6421 if (is_runtime_sym_defined (raise_unhandled_sym_name
, 1))
6422 sprintf (arg
, "'%s'", raise_unhandled_sym_name
);
6424 error_breakpoint_runtime_sym_not_found ("exception");
6426 *break_on_exceptionp
= 2;
6430 if (is_runtime_sym_defined (raise_sym_name
, 0))
6431 sprintf (arg
, "'%s' if long_integer(e) = long_integer(&%.*s)",
6432 raise_sym_name
, toklen
, tok
);
6434 error_breakpoint_runtime_sym_not_found ("specific exception");
6437 else if (current_language
->la_language
== language_ada
6438 && strncmp (arg
, "assert", 6) == 0
6439 && (arg
[6] == ' ' || arg
[6] == '\t' || arg
[6] == '\0'))
6441 char *tok
= arg
+ 6;
6443 if (!is_runtime_sym_defined (raise_assert_sym_name
, 1))
6444 error_breakpoint_runtime_sym_not_found ("failed assertion");
6446 *break_on_exceptionp
= 3;
6449 (char *) xmalloc (sizeof (raise_assert_sym_name
) + strlen (tok
) + 2);
6450 make_cleanup (xfree
, arg
);
6451 sprintf (arg
, "'%s'%s", raise_assert_sym_name
, tok
);
6459 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
6460 to be invisible to users. */
6463 ada_is_ignored_field (struct type
*type
, int field_num
)
6465 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
6469 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6470 return (name
== NULL
6471 || (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0));
6475 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
6476 pointer or reference type whose ultimate target has a tag field. */
6479 ada_is_tagged_type (struct type
*type
, int refok
)
6481 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6484 /* True iff TYPE represents the type of X'Tag */
6487 ada_is_tag_type (struct type
*type
)
6489 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6492 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6493 return (name
!= NULL
6494 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6498 /* The type of the tag on VAL. */
6501 ada_tag_type (struct value
*val
)
6503 return ada_lookup_struct_elt_type (VALUE_TYPE (val
), "_tag", 1, 0, NULL
);
6506 /* The value of the tag on VAL. */
6509 ada_value_tag (struct value
*val
)
6511 return ada_value_struct_elt (val
, "_tag", "record");
6514 /* The value of the tag on the object of type TYPE whose contents are
6515 saved at VALADDR, if it is non-null, or is at memory address
6518 static struct value
*
6519 value_tag_from_contents_and_address (struct type
*type
, char *valaddr
,
6522 int tag_byte_offset
, dummy1
, dummy2
;
6523 struct type
*tag_type
;
6524 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6527 char *valaddr1
= (valaddr
== NULL
) ? NULL
: valaddr
+ tag_byte_offset
;
6528 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6530 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6535 static struct type
*
6536 type_from_tag (struct value
*tag
)
6538 const char *type_name
= ada_tag_name (tag
);
6539 if (type_name
!= NULL
)
6540 return ada_find_any_type (ada_encode (type_name
));
6549 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
6550 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
6551 The value stored in ARGS->name is valid until the next call to
6555 ada_tag_name_1 (void *args0
)
6557 struct tag_args
*args
= (struct tag_args
*) args0
;
6558 static char name
[1024];
6562 val
= ada_value_struct_elt (args
->tag
, "tsd", NULL
);
6565 val
= ada_value_struct_elt (val
, "expanded_name", NULL
);
6568 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6569 for (p
= name
; *p
!= '\0'; p
+= 1)
6576 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6580 ada_tag_name (struct value
*tag
)
6582 struct tag_args args
;
6583 if (! ada_is_tag_type (VALUE_TYPE (tag
)))
6587 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
6591 /* The parent type of TYPE, or NULL if none. */
6594 ada_parent_type (struct type
*type
)
6598 CHECK_TYPEDEF (type
);
6600 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6603 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6604 if (ada_is_parent_field (type
, i
))
6605 return check_typedef (TYPE_FIELD_TYPE (type
, i
));
6610 /* True iff field number FIELD_NUM of structure type TYPE contains the
6611 parent-type (inherited) fields of a derived type. Assumes TYPE is
6612 a structure type with at least FIELD_NUM+1 fields. */
6615 ada_is_parent_field (struct type
*type
, int field_num
)
6617 const char *name
= TYPE_FIELD_NAME (check_typedef (type
), field_num
);
6618 return (name
!= NULL
6619 && (strncmp (name
, "PARENT", 6) == 0
6620 || strncmp (name
, "_parent", 7) == 0));
6623 /* True iff field number FIELD_NUM of structure type TYPE is a
6624 transparent wrapper field (which should be silently traversed when doing
6625 field selection and flattened when printing). Assumes TYPE is a
6626 structure type with at least FIELD_NUM+1 fields. Such fields are always
6630 ada_is_wrapper_field (struct type
*type
, int field_num
)
6632 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6633 return (name
!= NULL
6634 && (strncmp (name
, "PARENT", 6) == 0
6635 || strcmp (name
, "REP") == 0
6636 || strncmp (name
, "_parent", 7) == 0
6637 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6640 /* True iff field number FIELD_NUM of structure or union type TYPE
6641 is a variant wrapper. Assumes TYPE is a structure type with at least
6642 FIELD_NUM+1 fields. */
6645 ada_is_variant_part (struct type
*type
, int field_num
)
6647 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6648 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6649 || (is_dynamic_field (type
, field_num
)
6650 && TYPE_CODE (TYPE_TARGET_TYPE (field_type
)) ==
6654 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6655 whose discriminants are contained in the record type OUTER_TYPE,
6656 returns the type of the controlling discriminant for the variant. */
6659 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6661 char *name
= ada_variant_discrim_name (var_type
);
6663 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6665 return builtin_type_int
;
6670 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6671 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6672 represents a 'when others' clause; otherwise 0. */
6675 ada_is_others_clause (struct type
*type
, int field_num
)
6677 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6678 return (name
!= NULL
&& name
[0] == 'O');
6681 /* Assuming that TYPE0 is the type of the variant part of a record,
6682 returns the name of the discriminant controlling the variant.
6683 The value is valid until the next call to ada_variant_discrim_name. */
6686 ada_variant_discrim_name (struct type
*type0
)
6688 static char *result
= NULL
;
6689 static size_t result_len
= 0;
6692 const char *discrim_end
;
6693 const char *discrim_start
;
6695 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6696 type
= TYPE_TARGET_TYPE (type0
);
6700 name
= ada_type_name (type
);
6702 if (name
== NULL
|| name
[0] == '\000')
6705 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6708 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6711 if (discrim_end
== name
)
6714 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6717 if (discrim_start
== name
+ 1)
6719 if ((discrim_start
> name
+ 3
6720 && strncmp (discrim_start
- 3, "___", 3) == 0)
6721 || discrim_start
[-1] == '.')
6725 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6726 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6727 result
[discrim_end
- discrim_start
] = '\0';
6731 /* Scan STR for a subtype-encoded number, beginning at position K.
6732 Put the position of the character just past the number scanned in
6733 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6734 Return 1 if there was a valid number at the given position, and 0
6735 otherwise. A "subtype-encoded" number consists of the absolute value
6736 in decimal, followed by the letter 'm' to indicate a negative number.
6737 Assumes 0m does not occur. */
6740 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6744 if (!isdigit (str
[k
]))
6747 /* Do it the hard way so as not to make any assumption about
6748 the relationship of unsigned long (%lu scan format code) and
6751 while (isdigit (str
[k
]))
6753 RU
= RU
* 10 + (str
[k
] - '0');
6760 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6766 /* NOTE on the above: Technically, C does not say what the results of
6767 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6768 number representable as a LONGEST (although either would probably work
6769 in most implementations). When RU>0, the locution in the then branch
6770 above is always equivalent to the negative of RU. */
6777 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6778 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6779 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6782 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6784 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6797 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6806 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6807 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6809 if (val
>= L
&& val
<= U
)
6821 /* FIXME: Lots of redundancy below. Try to consolidate. */
6823 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6824 ARG_TYPE, extract and return the value of one of its (non-static)
6825 fields. FIELDNO says which field. Differs from value_primitive_field
6826 only in that it can handle packed values of arbitrary type. */
6828 static struct value
*
6829 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6830 struct type
*arg_type
)
6834 CHECK_TYPEDEF (arg_type
);
6835 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6837 /* Handle packed fields. */
6839 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6841 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6842 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6844 return ada_value_primitive_packed_val (arg1
, VALUE_CONTENTS (arg1
),
6845 offset
+ bit_pos
/ 8,
6846 bit_pos
% 8, bit_size
, type
);
6849 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6852 /* Find field with name NAME in object of type TYPE. If found, return 1
6853 after setting *FIELD_TYPE_P to the field's type, *BYTE_OFFSET_P to
6854 OFFSET + the byte offset of the field within an object of that type,
6855 *BIT_OFFSET_P to the bit offset modulo byte size of the field, and
6856 *BIT_SIZE_P to its size in bits if the field is packed, and 0 otherwise.
6857 Looks inside wrappers for the field. Returns 0 if field not
6860 find_struct_field (char *name
, struct type
*type
, int offset
,
6861 struct type
**field_type_p
,
6862 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
)
6866 CHECK_TYPEDEF (type
);
6867 *field_type_p
= NULL
;
6868 *byte_offset_p
= *bit_offset_p
= *bit_size_p
= 0;
6870 for (i
= TYPE_NFIELDS (type
) - 1; i
>= 0; i
-= 1)
6872 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6873 int fld_offset
= offset
+ bit_pos
/ 8;
6874 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6876 if (t_field_name
== NULL
)
6879 else if (field_name_match (t_field_name
, name
))
6881 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6882 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6883 *byte_offset_p
= fld_offset
;
6884 *bit_offset_p
= bit_pos
% 8;
6885 *bit_size_p
= bit_size
;
6888 else if (ada_is_wrapper_field (type
, i
))
6890 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6891 field_type_p
, byte_offset_p
, bit_offset_p
,
6895 else if (ada_is_variant_part (type
, i
))
6898 struct type
*field_type
= check_typedef (TYPE_FIELD_TYPE (type
, i
));
6900 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6902 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6904 + TYPE_FIELD_BITPOS (field_type
, j
)/8,
6905 field_type_p
, byte_offset_p
, bit_offset_p
,
6916 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6917 and search in it assuming it has (class) type TYPE.
6918 If found, return value, else return NULL.
6920 Searches recursively through wrapper fields (e.g., '_parent'). */
6922 static struct value
*
6923 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6927 CHECK_TYPEDEF (type
);
6929 for (i
= TYPE_NFIELDS (type
) - 1; i
>= 0; i
-= 1)
6931 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6933 if (t_field_name
== NULL
)
6936 else if (field_name_match (t_field_name
, name
))
6937 return ada_value_primitive_field (arg
, offset
, i
, type
);
6939 else if (ada_is_wrapper_field (type
, i
))
6942 ada_search_struct_field (name
, arg
,
6943 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6944 TYPE_FIELD_TYPE (type
, i
));
6949 else if (ada_is_variant_part (type
, i
))
6952 struct type
*field_type
= check_typedef (TYPE_FIELD_TYPE (type
, i
));
6953 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6955 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6958 ada_search_struct_field (name
, arg
,
6960 + TYPE_FIELD_BITPOS (field_type
, j
)/8,
6961 TYPE_FIELD_TYPE (field_type
, j
));
6970 /* Given ARG, a value of type (pointer or reference to a)*
6971 structure/union, extract the component named NAME from the ultimate
6972 target structure/union and return it as a value with its
6973 appropriate type. If ARG is a pointer or reference and the field
6974 is not packed, returns a reference to the field, otherwise the
6975 value of the field (an lvalue if ARG is an lvalue).
6977 The routine searches for NAME among all members of the structure itself
6978 and (recursively) among all members of any wrapper members
6981 ERR is a name (for use in error messages) that identifies the class
6982 of entity that ARG is supposed to be. ERR may be null, indicating
6983 that on error, the function simply returns NULL, and does not
6984 throw an error. (FIXME: True only if ARG is a pointer or reference
6988 ada_value_struct_elt (struct value
*arg
, char *name
, char *err
)
6990 struct type
*t
, *t1
;
6994 t1
= t
= check_typedef (VALUE_TYPE (arg
));
6995 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6997 t1
= TYPE_TARGET_TYPE (t
);
7003 error ("Bad value type in a %s.", err
);
7006 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7013 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7015 t1
= TYPE_TARGET_TYPE (t
);
7021 error ("Bad value type in a %s.", err
);
7024 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
7026 arg
= value_ind (arg
);
7033 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
7038 error ("Attempt to extract a component of a value that is not a %s.",
7043 v
= ada_search_struct_field (name
, arg
, 0, t
);
7046 int bit_offset
, bit_size
, byte_offset
;
7047 struct type
*field_type
;
7050 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
7051 address
= value_as_address (arg
);
7053 address
= unpack_pointer (t
, VALUE_CONTENTS (arg
));
7055 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
);
7056 if (find_struct_field (name
, t1
, 0,
7057 &field_type
, &byte_offset
, &bit_offset
, &bit_size
))
7061 arg
= ada_value_ind (arg
);
7062 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
7063 bit_offset
, bit_size
,
7067 v
= value_from_pointer (lookup_reference_type (field_type
),
7068 address
+ byte_offset
);
7072 if (v
== NULL
&& err
!= NULL
)
7073 error ("There is no member named %s.", name
);
7078 /* Given a type TYPE, look up the type of the component of type named NAME.
7079 If DISPP is non-null, add its byte displacement from the beginning of a
7080 structure (pointed to by a value) of type TYPE to *DISPP (does not
7081 work for packed fields).
7083 Matches any field whose name has NAME as a prefix, possibly
7086 TYPE can be either a struct or union. If REFOK, TYPE may also
7087 be a (pointer or reference)+ to a struct or union, and the
7088 ultimate target type will be searched.
7090 Looks recursively into variant clauses and parent types.
7092 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7093 TYPE is not a type of the right kind. */
7095 static struct type
*
7096 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
7097 int noerr
, int *dispp
)
7104 if (refok
&& type
!= NULL
)
7107 CHECK_TYPEDEF (type
);
7108 if (TYPE_CODE (type
) != TYPE_CODE_PTR
7109 && TYPE_CODE (type
) != TYPE_CODE_REF
)
7111 type
= TYPE_TARGET_TYPE (type
);
7115 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
&&
7116 TYPE_CODE (type
) != TYPE_CODE_UNION
))
7122 target_terminal_ours ();
7123 gdb_flush (gdb_stdout
);
7124 fprintf_unfiltered (gdb_stderr
, "Type ");
7126 fprintf_unfiltered (gdb_stderr
, "(null)");
7128 type_print (type
, "", gdb_stderr
, -1);
7129 error (" is not a structure or union type");
7133 type
= to_static_fixed_type (type
);
7135 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7137 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
7141 if (t_field_name
== NULL
)
7144 else if (field_name_match (t_field_name
, name
))
7147 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
7148 return check_typedef (TYPE_FIELD_TYPE (type
, i
));
7151 else if (ada_is_wrapper_field (type
, i
))
7154 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
7159 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7164 else if (ada_is_variant_part (type
, i
))
7167 struct type
*field_type
= check_typedef (TYPE_FIELD_TYPE (type
, i
));
7169 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
7172 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
7177 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
7188 target_terminal_ours ();
7189 gdb_flush (gdb_stdout
);
7190 fprintf_unfiltered (gdb_stderr
, "Type ");
7191 type_print (type
, "", gdb_stderr
, -1);
7192 fprintf_unfiltered (gdb_stderr
, " has no component named ");
7193 error ("%s", name
== NULL
? "<null>" : name
);
7199 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7200 within a value of type OUTER_TYPE that is stored in GDB at
7201 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7202 numbering from 0) is applicable. Returns -1 if none are. */
7205 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
7206 char *outer_valaddr
)
7211 struct type
*discrim_type
;
7212 char *discrim_name
= ada_variant_discrim_name (var_type
);
7213 LONGEST discrim_val
;
7217 ada_lookup_struct_elt_type (outer_type
, discrim_name
, 1, 1, &disp
);
7218 if (discrim_type
== NULL
)
7220 discrim_val
= unpack_long (discrim_type
, outer_valaddr
+ disp
);
7223 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
7225 if (ada_is_others_clause (var_type
, i
))
7227 else if (ada_in_variant (discrim_val
, var_type
, i
))
7231 return others_clause
;
7236 /* Dynamic-Sized Records */
7238 /* Strategy: The type ostensibly attached to a value with dynamic size
7239 (i.e., a size that is not statically recorded in the debugging
7240 data) does not accurately reflect the size or layout of the value.
7241 Our strategy is to convert these values to values with accurate,
7242 conventional types that are constructed on the fly. */
7244 /* There is a subtle and tricky problem here. In general, we cannot
7245 determine the size of dynamic records without its data. However,
7246 the 'struct value' data structure, which GDB uses to represent
7247 quantities in the inferior process (the target), requires the size
7248 of the type at the time of its allocation in order to reserve space
7249 for GDB's internal copy of the data. That's why the
7250 'to_fixed_xxx_type' routines take (target) addresses as parameters,
7251 rather than struct value*s.
7253 However, GDB's internal history variables ($1, $2, etc.) are
7254 struct value*s containing internal copies of the data that are not, in
7255 general, the same as the data at their corresponding addresses in
7256 the target. Fortunately, the types we give to these values are all
7257 conventional, fixed-size types (as per the strategy described
7258 above), so that we don't usually have to perform the
7259 'to_fixed_xxx_type' conversions to look at their values.
7260 Unfortunately, there is one exception: if one of the internal
7261 history variables is an array whose elements are unconstrained
7262 records, then we will need to create distinct fixed types for each
7263 element selected. */
7265 /* The upshot of all of this is that many routines take a (type, host
7266 address, target address) triple as arguments to represent a value.
7267 The host address, if non-null, is supposed to contain an internal
7268 copy of the relevant data; otherwise, the program is to consult the
7269 target at the target address. */
7271 /* Assuming that VAL0 represents a pointer value, the result of
7272 dereferencing it. Differs from value_ind in its treatment of
7273 dynamic-sized types. */
7276 ada_value_ind (struct value
*val0
)
7278 struct value
*val
= unwrap_value (value_ind (val0
));
7279 return ada_to_fixed_value (val
);
7282 /* The value resulting from dereferencing any "reference to"
7283 qualifiers on VAL0. */
7285 static struct value
*
7286 ada_coerce_ref (struct value
*val0
)
7288 if (TYPE_CODE (VALUE_TYPE (val0
)) == TYPE_CODE_REF
)
7290 struct value
*val
= val0
;
7292 val
= unwrap_value (val
);
7293 return ada_to_fixed_value (val
);
7299 /* Return OFF rounded upward if necessary to a multiple of
7300 ALIGNMENT (a power of 2). */
7303 align_value (unsigned int off
, unsigned int alignment
)
7305 return (off
+ alignment
- 1) & ~(alignment
- 1);
7308 /* Return the bit alignment required for field #F of template type TYPE. */
7311 field_alignment (struct type
*type
, int f
)
7313 const char *name
= TYPE_FIELD_NAME (type
, f
);
7314 int len
= (name
== NULL
) ? 0 : strlen (name
);
7317 if (!isdigit (name
[len
- 1]))
7320 if (isdigit (name
[len
- 2]))
7321 align_offset
= len
- 2;
7323 align_offset
= len
- 1;
7325 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
7326 return TARGET_CHAR_BIT
;
7328 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7331 /* Find a symbol named NAME. Ignores ambiguity. */
7334 ada_find_any_symbol (const char *name
)
7338 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7339 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7342 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7346 /* Find a type named NAME. Ignores ambiguity. */
7349 ada_find_any_type (const char *name
)
7351 struct symbol
*sym
= ada_find_any_symbol (name
);
7354 return SYMBOL_TYPE (sym
);
7359 /* Given a symbol NAME and its associated BLOCK, search all symbols
7360 for its ___XR counterpart, which is the ``renaming'' symbol
7361 associated to NAME. Return this symbol if found, return
7365 ada_find_renaming_symbol (const char *name
, struct block
*block
)
7367 const struct symbol
*function_sym
= block_function (block
);
7370 if (function_sym
!= NULL
)
7372 /* If the symbol is defined inside a function, NAME is not fully
7373 qualified. This means we need to prepend the function name
7374 as well as adding the ``___XR'' suffix to build the name of
7375 the associated renaming symbol. */
7376 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7377 const int function_name_len
= strlen (function_name
);
7378 const int rename_len
= function_name_len
7381 + 6 /* "___XR\0" */;
7383 /* Library-level functions are a special case, as GNAT adds
7384 a ``_ada_'' prefix to the function name to avoid namespace
7385 pollution. However, the renaming symbol themselves do not
7386 have this prefix, so we need to skip this prefix if present. */
7387 if (function_name_len
> 5 /* "_ada_" */
7388 && strstr (function_name
, "_ada_") == function_name
)
7389 function_name
= function_name
+ 5;
7391 rename
= (char *) alloca (rename_len
* sizeof (char));
7392 sprintf (rename
, "%s__%s___XR", function_name
, name
);
7396 const int rename_len
= strlen (name
) + 6;
7397 rename
= (char *) alloca (rename_len
* sizeof (char));
7398 sprintf (rename
, "%s___XR", name
);
7401 return ada_find_any_symbol (rename
);
7404 /* Because of GNAT encoding conventions, several GDB symbols may match a
7405 given type name. If the type denoted by TYPE0 is to be preferred to
7406 that of TYPE1 for purposes of type printing, return non-zero;
7407 otherwise return 0. */
7410 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7414 else if (type0
== NULL
)
7416 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7418 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7420 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7422 else if (ada_is_packed_array_type (type0
))
7424 else if (ada_is_array_descriptor_type (type0
)
7425 && !ada_is_array_descriptor_type (type1
))
7427 else if (ada_renaming_type (type0
) != NULL
7428 && ada_renaming_type (type1
) == NULL
)
7433 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7434 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7437 ada_type_name (struct type
*type
)
7441 else if (TYPE_NAME (type
) != NULL
)
7442 return TYPE_NAME (type
);
7444 return TYPE_TAG_NAME (type
);
7447 /* Find a parallel type to TYPE whose name is formed by appending
7448 SUFFIX to the name of TYPE. */
7451 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7454 static size_t name_len
= 0;
7456 char *typename
= ada_type_name (type
);
7458 if (typename
== NULL
)
7461 len
= strlen (typename
);
7463 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
7465 strcpy (name
, typename
);
7466 strcpy (name
+ len
, suffix
);
7468 return ada_find_any_type (name
);
7472 /* If TYPE is a variable-size record type, return the corresponding template
7473 type describing its fields. Otherwise, return NULL. */
7475 static struct type
*
7476 dynamic_template_type (struct type
*type
)
7478 CHECK_TYPEDEF (type
);
7480 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7481 || ada_type_name (type
) == NULL
)
7485 int len
= strlen (ada_type_name (type
));
7486 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7489 return ada_find_parallel_type (type
, "___XVE");
7493 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7494 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7497 is_dynamic_field (struct type
*templ_type
, int field_num
)
7499 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7501 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7502 && strstr (name
, "___XVL") != NULL
;
7505 /* The index of the variant field of TYPE, or -1 if TYPE does not
7506 represent a variant record type. */
7509 variant_field_index (struct type
*type
)
7513 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7516 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7518 if (ada_is_variant_part (type
, f
))
7524 /* A record type with no fields. */
7526 static struct type
*
7527 empty_record (struct objfile
*objfile
)
7529 struct type
*type
= alloc_type (objfile
);
7530 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7531 TYPE_NFIELDS (type
) = 0;
7532 TYPE_FIELDS (type
) = NULL
;
7533 TYPE_NAME (type
) = "<empty>";
7534 TYPE_TAG_NAME (type
) = NULL
;
7535 TYPE_FLAGS (type
) = 0;
7536 TYPE_LENGTH (type
) = 0;
7540 /* An ordinary record type (with fixed-length fields) that describes
7541 the value of type TYPE at VALADDR or ADDRESS (see comments at
7542 the beginning of this section) VAL according to GNAT conventions.
7543 DVAL0 should describe the (portion of a) record that contains any
7544 necessary discriminants. It should be NULL if VALUE_TYPE (VAL) is
7545 an outer-level type (i.e., as opposed to a branch of a variant.) A
7546 variant field (unless unchecked) is replaced by a particular branch
7549 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7550 length are not statically known are discarded. As a consequence,
7551 VALADDR, ADDRESS and DVAL0 are ignored.
7553 NOTE: Limitations: For now, we assume that dynamic fields and
7554 variants occupy whole numbers of bytes. However, they need not be
7558 ada_template_to_fixed_record_type_1 (struct type
*type
, char *valaddr
,
7559 CORE_ADDR address
, struct value
*dval0
,
7560 int keep_dynamic_fields
)
7562 struct value
*mark
= value_mark ();
7565 int nfields
, bit_len
;
7568 int fld_bit_len
, bit_incr
;
7571 /* Compute the number of fields in this record type that are going
7572 to be processed: unless keep_dynamic_fields, this includes only
7573 fields whose position and length are static will be processed. */
7574 if (keep_dynamic_fields
)
7575 nfields
= TYPE_NFIELDS (type
);
7579 while (nfields
< TYPE_NFIELDS (type
)
7580 && !ada_is_variant_part (type
, nfields
)
7581 && !is_dynamic_field (type
, nfields
))
7585 rtype
= alloc_type (TYPE_OBJFILE (type
));
7586 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7587 INIT_CPLUS_SPECIFIC (rtype
);
7588 TYPE_NFIELDS (rtype
) = nfields
;
7589 TYPE_FIELDS (rtype
) = (struct field
*)
7590 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7591 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7592 TYPE_NAME (rtype
) = ada_type_name (type
);
7593 TYPE_TAG_NAME (rtype
) = NULL
;
7594 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
7600 for (f
= 0; f
< nfields
; f
+= 1)
7604 field_alignment (type
, f
)) + TYPE_FIELD_BITPOS (type
, f
);
7605 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
7606 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7608 if (ada_is_variant_part (type
, f
))
7611 fld_bit_len
= bit_incr
= 0;
7613 else if (is_dynamic_field (type
, f
))
7616 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7620 TYPE_FIELD_TYPE (rtype
, f
) =
7623 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
7624 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7625 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7626 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7627 bit_incr
= fld_bit_len
=
7628 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7632 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
7633 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7634 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7635 bit_incr
= fld_bit_len
=
7636 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7638 bit_incr
= fld_bit_len
=
7639 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
7641 if (off
+ fld_bit_len
> bit_len
)
7642 bit_len
= off
+ fld_bit_len
;
7644 TYPE_LENGTH (rtype
) =
7645 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7648 /* We handle the variant part, if any, at the end because of certain
7649 odd cases in which it is re-ordered so as NOT the last field of
7650 the record. This can happen in the presence of representation
7652 if (variant_field
>= 0)
7654 struct type
*branch_type
;
7656 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7659 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7664 to_fixed_variant_branch_type
7665 (TYPE_FIELD_TYPE (type
, variant_field
),
7666 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7667 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7668 if (branch_type
== NULL
)
7670 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7671 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7672 TYPE_NFIELDS (rtype
) -= 1;
7676 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7677 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7679 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7681 if (off
+ fld_bit_len
> bit_len
)
7682 bit_len
= off
+ fld_bit_len
;
7683 TYPE_LENGTH (rtype
) =
7684 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7688 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
), TYPE_LENGTH (type
));
7690 value_free_to_mark (mark
);
7691 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7692 error ("record type with dynamic size is larger than varsize-limit");
7696 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7699 static struct type
*
7700 template_to_fixed_record_type (struct type
*type
, char *valaddr
,
7701 CORE_ADDR address
, struct value
*dval0
)
7703 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7707 /* An ordinary record type in which ___XVL-convention fields and
7708 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7709 static approximations, containing all possible fields. Uses
7710 no runtime values. Useless for use in values, but that's OK,
7711 since the results are used only for type determinations. Works on both
7712 structs and unions. Representation note: to save space, we memorize
7713 the result of this function in the TYPE_TARGET_TYPE of the
7716 static struct type
*
7717 template_to_static_fixed_type (struct type
*type0
)
7723 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7724 return TYPE_TARGET_TYPE (type0
);
7726 nfields
= TYPE_NFIELDS (type0
);
7729 for (f
= 0; f
< nfields
; f
+= 1)
7731 struct type
*field_type
= CHECK_TYPEDEF (TYPE_FIELD_TYPE (type0
, f
));
7732 struct type
*new_type
;
7734 if (is_dynamic_field (type0
, f
))
7735 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7737 new_type
= to_static_fixed_type (field_type
);
7738 if (type
== type0
&& new_type
!= field_type
)
7740 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
7741 TYPE_CODE (type
) = TYPE_CODE (type0
);
7742 INIT_CPLUS_SPECIFIC (type
);
7743 TYPE_NFIELDS (type
) = nfields
;
7744 TYPE_FIELDS (type
) = (struct field
*)
7745 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7746 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7747 sizeof (struct field
) * nfields
);
7748 TYPE_NAME (type
) = ada_type_name (type0
);
7749 TYPE_TAG_NAME (type
) = NULL
;
7750 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
7751 TYPE_LENGTH (type
) = 0;
7753 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7754 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7759 /* Given an object of type TYPE whose contents are at VALADDR and
7760 whose address in memory is ADDRESS, returns a revision of TYPE --
7761 a non-dynamic-sized record with a variant part -- in which
7762 the variant part is replaced with the appropriate branch. Looks
7763 for discriminant values in DVAL0, which can be NULL if the record
7764 contains the necessary discriminant values. */
7766 static struct type
*
7767 to_record_with_fixed_variant_part (struct type
*type
, char *valaddr
,
7768 CORE_ADDR address
, struct value
*dval0
)
7770 struct value
*mark
= value_mark ();
7773 struct type
*branch_type
;
7774 int nfields
= TYPE_NFIELDS (type
);
7775 int variant_field
= variant_field_index (type
);
7777 if (variant_field
== -1)
7781 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7785 rtype
= alloc_type (TYPE_OBJFILE (type
));
7786 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7787 INIT_CPLUS_SPECIFIC (rtype
);
7788 TYPE_NFIELDS (rtype
) = nfields
;
7789 TYPE_FIELDS (rtype
) =
7790 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7791 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7792 sizeof (struct field
) * nfields
);
7793 TYPE_NAME (rtype
) = ada_type_name (type
);
7794 TYPE_TAG_NAME (rtype
) = NULL
;
7795 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
7796 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7798 branch_type
= to_fixed_variant_branch_type
7799 (TYPE_FIELD_TYPE (type
, variant_field
),
7800 cond_offset_host (valaddr
,
7801 TYPE_FIELD_BITPOS (type
, variant_field
)
7803 cond_offset_target (address
,
7804 TYPE_FIELD_BITPOS (type
, variant_field
)
7805 / TARGET_CHAR_BIT
), dval
);
7806 if (branch_type
== NULL
)
7809 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7810 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7811 TYPE_NFIELDS (rtype
) -= 1;
7815 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7816 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7817 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7818 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7820 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7822 value_free_to_mark (mark
);
7826 /* An ordinary record type (with fixed-length fields) that describes
7827 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7828 beginning of this section]. Any necessary discriminants' values
7829 should be in DVAL, a record value; it may be NULL if the object
7830 at ADDR itself contains any necessary discriminant values.
7831 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7832 values from the record are needed. Except in the case that DVAL,
7833 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7834 unchecked) is replaced by a particular branch of the variant.
7836 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7837 is questionable and may be removed. It can arise during the
7838 processing of an unconstrained-array-of-record type where all the
7839 variant branches have exactly the same size. This is because in
7840 such cases, the compiler does not bother to use the XVS convention
7841 when encoding the record. I am currently dubious of this
7842 shortcut and suspect the compiler should be altered. FIXME. */
7844 static struct type
*
7845 to_fixed_record_type (struct type
*type0
, char *valaddr
,
7846 CORE_ADDR address
, struct value
*dval
)
7848 struct type
*templ_type
;
7850 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7853 templ_type
= dynamic_template_type (type0
);
7855 if (templ_type
!= NULL
)
7856 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7857 else if (variant_field_index (type0
) >= 0)
7859 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7861 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7866 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
7872 /* An ordinary record type (with fixed-length fields) that describes
7873 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7874 union type. Any necessary discriminants' values should be in DVAL,
7875 a record value. That is, this routine selects the appropriate
7876 branch of the union at ADDR according to the discriminant value
7877 indicated in the union's type name. */
7879 static struct type
*
7880 to_fixed_variant_branch_type (struct type
*var_type0
, char *valaddr
,
7881 CORE_ADDR address
, struct value
*dval
)
7884 struct type
*templ_type
;
7885 struct type
*var_type
;
7887 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7888 var_type
= TYPE_TARGET_TYPE (var_type0
);
7890 var_type
= var_type0
;
7892 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7894 if (templ_type
!= NULL
)
7895 var_type
= templ_type
;
7898 ada_which_variant_applies (var_type
,
7899 VALUE_TYPE (dval
), VALUE_CONTENTS (dval
));
7902 return empty_record (TYPE_OBJFILE (var_type
));
7903 else if (is_dynamic_field (var_type
, which
))
7904 return to_fixed_record_type
7905 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7906 valaddr
, address
, dval
);
7907 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7909 to_fixed_record_type
7910 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7912 return TYPE_FIELD_TYPE (var_type
, which
);
7915 /* Assuming that TYPE0 is an array type describing the type of a value
7916 at ADDR, and that DVAL describes a record containing any
7917 discriminants used in TYPE0, returns a type for the value that
7918 contains no dynamic components (that is, no components whose sizes
7919 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7920 true, gives an error message if the resulting type's size is over
7923 static struct type
*
7924 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7927 struct type
*index_type_desc
;
7928 struct type
*result
;
7930 if (ada_is_packed_array_type (type0
) /* revisit? */
7931 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
7934 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7935 if (index_type_desc
== NULL
)
7937 struct type
*elt_type0
= check_typedef (TYPE_TARGET_TYPE (type0
));
7938 /* NOTE: elt_type---the fixed version of elt_type0---should never
7939 depend on the contents of the array in properly constructed
7941 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
);
7943 if (elt_type0
== elt_type
)
7946 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7947 elt_type
, TYPE_INDEX_TYPE (type0
));
7952 struct type
*elt_type0
;
7955 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7956 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7958 /* NOTE: result---the fixed version of elt_type0---should never
7959 depend on the contents of the array in properly constructed
7961 result
= ada_to_fixed_type (check_typedef (elt_type0
), 0, 0, dval
);
7962 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7964 struct type
*range_type
=
7965 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7966 dval
, TYPE_OBJFILE (type0
));
7967 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7968 result
, range_type
);
7970 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7971 error ("array type with dynamic size is larger than varsize-limit");
7974 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
7979 /* A standard type (containing no dynamically sized components)
7980 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7981 DVAL describes a record containing any discriminants used in TYPE0,
7982 and may be NULL if there are none, or if the object of type TYPE at
7983 ADDRESS or in VALADDR contains these discriminants. */
7986 ada_to_fixed_type (struct type
*type
, char *valaddr
,
7987 CORE_ADDR address
, struct value
*dval
)
7989 CHECK_TYPEDEF (type
);
7990 switch (TYPE_CODE (type
))
7994 case TYPE_CODE_STRUCT
:
7996 struct type
*static_type
= to_static_fixed_type (type
);
7997 if (ada_is_tagged_type (static_type
, 0))
7999 struct type
*real_type
=
8000 type_from_tag (value_tag_from_contents_and_address (static_type
,
8003 if (real_type
!= NULL
)
8006 return to_fixed_record_type (type
, valaddr
, address
, NULL
);
8008 case TYPE_CODE_ARRAY
:
8009 return to_fixed_array_type (type
, dval
, 1);
8010 case TYPE_CODE_UNION
:
8014 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8018 /* A standard (static-sized) type corresponding as well as possible to
8019 TYPE0, but based on no runtime data. */
8021 static struct type
*
8022 to_static_fixed_type (struct type
*type0
)
8029 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
8032 CHECK_TYPEDEF (type0
);
8034 switch (TYPE_CODE (type0
))
8038 case TYPE_CODE_STRUCT
:
8039 type
= dynamic_template_type (type0
);
8041 return template_to_static_fixed_type (type
);
8043 return template_to_static_fixed_type (type0
);
8044 case TYPE_CODE_UNION
:
8045 type
= ada_find_parallel_type (type0
, "___XVU");
8047 return template_to_static_fixed_type (type
);
8049 return template_to_static_fixed_type (type0
);
8053 /* A static approximation of TYPE with all type wrappers removed. */
8055 static struct type
*
8056 static_unwrap_type (struct type
*type
)
8058 if (ada_is_aligner_type (type
))
8060 struct type
*type1
= TYPE_FIELD_TYPE (check_typedef (type
), 0);
8061 if (ada_type_name (type1
) == NULL
)
8062 TYPE_NAME (type1
) = ada_type_name (type
);
8064 return static_unwrap_type (type1
);
8068 struct type
*raw_real_type
= ada_get_base_type (type
);
8069 if (raw_real_type
== type
)
8072 return to_static_fixed_type (raw_real_type
);
8076 /* In some cases, incomplete and private types require
8077 cross-references that are not resolved as records (for example,
8079 type FooP is access Foo;
8081 type Foo is array ...;
8082 ). In these cases, since there is no mechanism for producing
8083 cross-references to such types, we instead substitute for FooP a
8084 stub enumeration type that is nowhere resolved, and whose tag is
8085 the name of the actual type. Call these types "non-record stubs". */
8087 /* A type equivalent to TYPE that is not a non-record stub, if one
8088 exists, otherwise TYPE. */
8091 ada_completed_type (struct type
*type
)
8093 CHECK_TYPEDEF (type
);
8094 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8095 || (TYPE_FLAGS (type
) & TYPE_FLAG_STUB
) == 0
8096 || TYPE_TAG_NAME (type
) == NULL
)
8100 char *name
= TYPE_TAG_NAME (type
);
8101 struct type
*type1
= ada_find_any_type (name
);
8102 return (type1
== NULL
) ? type
: type1
;
8106 /* A value representing the data at VALADDR/ADDRESS as described by
8107 type TYPE0, but with a standard (static-sized) type that correctly
8108 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8109 type, then return VAL0 [this feature is simply to avoid redundant
8110 creation of struct values]. */
8112 static struct value
*
8113 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8116 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
);
8117 if (type
== type0
&& val0
!= NULL
)
8120 return value_from_contents_and_address (type
, 0, address
);
8123 /* A value representing VAL, but with a standard (static-sized) type
8124 that correctly describes it. Does not necessarily create a new
8127 static struct value
*
8128 ada_to_fixed_value (struct value
*val
)
8130 return ada_to_fixed_value_create (VALUE_TYPE (val
),
8131 VALUE_ADDRESS (val
) + VALUE_OFFSET (val
),
8135 /* If the PC is pointing inside a function prologue, then re-adjust it
8136 past this prologue. */
8139 adjust_pc_past_prologue (CORE_ADDR
*pc
)
8141 struct symbol
*func_sym
= find_pc_function (*pc
);
8145 const struct symtab_and_line sal
= find_function_start_sal (func_sym
, 1);
8152 /* A value representing VAL, but with a standard (static-sized) type
8153 chosen to approximate the real type of VAL as well as possible, but
8154 without consulting any runtime values. For Ada dynamic-sized
8155 types, therefore, the type of the result is likely to be inaccurate. */
8158 ada_to_static_fixed_value (struct value
*val
)
8161 to_static_fixed_type (static_unwrap_type (VALUE_TYPE (val
)));
8162 if (type
== VALUE_TYPE (val
))
8165 return coerce_unspec_val_to_type (val
, type
);
8171 /* Table mapping attribute numbers to names.
8172 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8174 static const char *attribute_names
[] = {
8192 ada_attribute_name (enum exp_opcode n
)
8194 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8195 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8197 return attribute_names
[0];
8200 /* Evaluate the 'POS attribute applied to ARG. */
8203 pos_atr (struct value
*arg
)
8205 struct type
*type
= VALUE_TYPE (arg
);
8207 if (!discrete_type_p (type
))
8208 error ("'POS only defined on discrete types");
8210 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8213 LONGEST v
= value_as_long (arg
);
8215 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8217 if (v
== TYPE_FIELD_BITPOS (type
, i
))
8220 error ("enumeration value is invalid: can't find 'POS");
8223 return value_as_long (arg
);
8226 static struct value
*
8227 value_pos_atr (struct value
*arg
)
8229 return value_from_longest (builtin_type_ada_int
, pos_atr (arg
));
8232 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8234 static struct value
*
8235 value_val_atr (struct type
*type
, struct value
*arg
)
8237 if (!discrete_type_p (type
))
8238 error ("'VAL only defined on discrete types");
8239 if (!integer_type_p (VALUE_TYPE (arg
)))
8240 error ("'VAL requires integral argument");
8242 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8244 long pos
= value_as_long (arg
);
8245 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8246 error ("argument to 'VAL out of range");
8247 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
8250 return value_from_longest (type
, value_as_long (arg
));
8256 /* True if TYPE appears to be an Ada character type.
8257 [At the moment, this is true only for Character and Wide_Character;
8258 It is a heuristic test that could stand improvement]. */
8261 ada_is_character_type (struct type
*type
)
8263 const char *name
= ada_type_name (type
);
8266 && (TYPE_CODE (type
) == TYPE_CODE_CHAR
8267 || TYPE_CODE (type
) == TYPE_CODE_INT
8268 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8269 && (strcmp (name
, "character") == 0
8270 || strcmp (name
, "wide_character") == 0
8271 || strcmp (name
, "unsigned char") == 0);
8274 /* True if TYPE appears to be an Ada string type. */
8277 ada_is_string_type (struct type
*type
)
8279 CHECK_TYPEDEF (type
);
8281 && TYPE_CODE (type
) != TYPE_CODE_PTR
8282 && (ada_is_simple_array_type (type
) || ada_is_array_descriptor_type (type
))
8283 && ada_array_arity (type
) == 1)
8285 struct type
*elttype
= ada_array_element_type (type
, 1);
8287 return ada_is_character_type (elttype
);
8294 /* True if TYPE is a struct type introduced by the compiler to force the
8295 alignment of a value. Such types have a single field with a
8296 distinctive name. */
8299 ada_is_aligner_type (struct type
*type
)
8301 CHECK_TYPEDEF (type
);
8302 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8303 && TYPE_NFIELDS (type
) == 1
8304 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8307 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8308 the parallel type. */
8311 ada_get_base_type (struct type
*raw_type
)
8313 struct type
*real_type_namer
;
8314 struct type
*raw_real_type
;
8316 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8319 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8320 if (real_type_namer
== NULL
8321 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8322 || TYPE_NFIELDS (real_type_namer
) != 1)
8325 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8326 if (raw_real_type
== NULL
)
8329 return raw_real_type
;
8332 /* The type of value designated by TYPE, with all aligners removed. */
8335 ada_aligned_type (struct type
*type
)
8337 if (ada_is_aligner_type (type
))
8338 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8340 return ada_get_base_type (type
);
8344 /* The address of the aligned value in an object at address VALADDR
8345 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8348 ada_aligned_value_addr (struct type
*type
, char *valaddr
)
8350 if (ada_is_aligner_type (type
))
8351 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8353 TYPE_FIELD_BITPOS (type
,
8354 0) / TARGET_CHAR_BIT
);
8361 /* The printed representation of an enumeration literal with encoded
8362 name NAME. The value is good to the next call of ada_enum_name. */
8364 ada_enum_name (const char *name
)
8366 static char *result
;
8367 static size_t result_len
= 0;
8370 /* First, unqualify the enumeration name:
8371 1. Search for the last '.' character. If we find one, then skip
8372 all the preceeding characters, the unqualified name starts
8373 right after that dot.
8374 2. Otherwise, we may be debugging on a target where the compiler
8375 translates dots into "__". Search forward for double underscores,
8376 but stop searching when we hit an overloading suffix, which is
8377 of the form "__" followed by digits. */
8379 if ((tmp
= strrchr (name
, '.')) != NULL
)
8383 while ((tmp
= strstr (name
, "__")) != NULL
)
8385 if (isdigit (tmp
[2]))
8395 if (name
[1] == 'U' || name
[1] == 'W')
8397 if (sscanf (name
+ 2, "%x", &v
) != 1)
8403 GROW_VECT (result
, result_len
, 16);
8404 if (isascii (v
) && isprint (v
))
8405 sprintf (result
, "'%c'", v
);
8406 else if (name
[1] == 'U')
8407 sprintf (result
, "[\"%02x\"]", v
);
8409 sprintf (result
, "[\"%04x\"]", v
);
8415 if ((tmp
= strstr (name
, "__")) != NULL
8416 || (tmp
= strstr (name
, "$")) != NULL
)
8418 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
8419 strncpy (result
, name
, tmp
- name
);
8420 result
[tmp
- name
] = '\0';
8428 static struct value
*
8429 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
8432 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
8433 (expect_type
, exp
, pos
, noside
);
8436 /* Evaluate the subexpression of EXP starting at *POS as for
8437 evaluate_type, updating *POS to point just past the evaluated
8440 static struct value
*
8441 evaluate_subexp_type (struct expression
*exp
, int *pos
)
8443 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
8444 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8447 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8450 static struct value
*
8451 unwrap_value (struct value
*val
)
8453 struct type
*type
= check_typedef (VALUE_TYPE (val
));
8454 if (ada_is_aligner_type (type
))
8456 struct value
*v
= value_struct_elt (&val
, NULL
, "F",
8457 NULL
, "internal structure");
8458 struct type
*val_type
= check_typedef (VALUE_TYPE (v
));
8459 if (ada_type_name (val_type
) == NULL
)
8460 TYPE_NAME (val_type
) = ada_type_name (type
);
8462 return unwrap_value (v
);
8466 struct type
*raw_real_type
=
8467 ada_completed_type (ada_get_base_type (type
));
8469 if (type
== raw_real_type
)
8473 coerce_unspec_val_to_type
8474 (val
, ada_to_fixed_type (raw_real_type
, 0,
8475 VALUE_ADDRESS (val
) + VALUE_OFFSET (val
),
8480 static struct value
*
8481 cast_to_fixed (struct type
*type
, struct value
*arg
)
8485 if (type
== VALUE_TYPE (arg
))
8487 else if (ada_is_fixed_point_type (VALUE_TYPE (arg
)))
8488 val
= ada_float_to_fixed (type
,
8489 ada_fixed_to_float (VALUE_TYPE (arg
),
8490 value_as_long (arg
)));
8494 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
8495 val
= ada_float_to_fixed (type
, argd
);
8498 return value_from_longest (type
, val
);
8501 static struct value
*
8502 cast_from_fixed_to_double (struct value
*arg
)
8504 DOUBLEST val
= ada_fixed_to_float (VALUE_TYPE (arg
),
8505 value_as_long (arg
));
8506 return value_from_double (builtin_type_double
, val
);
8509 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8510 return the converted value. */
8512 static struct value
*
8513 coerce_for_assign (struct type
*type
, struct value
*val
)
8515 struct type
*type2
= VALUE_TYPE (val
);
8519 CHECK_TYPEDEF (type2
);
8520 CHECK_TYPEDEF (type
);
8522 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
8523 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8525 val
= ada_value_ind (val
);
8526 type2
= VALUE_TYPE (val
);
8529 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
8530 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8532 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
8533 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8534 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
8535 error ("Incompatible types in assignment");
8536 VALUE_TYPE (val
) = type
;
8541 static struct value
*
8542 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8545 struct type
*type1
, *type2
;
8550 type1
= base_type (check_typedef (VALUE_TYPE (arg1
)));
8551 type2
= base_type (check_typedef (VALUE_TYPE (arg2
)));
8553 if (TYPE_CODE (type1
) != TYPE_CODE_INT
|| TYPE_CODE (type2
) != TYPE_CODE_INT
)
8554 return value_binop (arg1
, arg2
, op
);
8563 return value_binop (arg1
, arg2
, op
);
8566 v2
= value_as_long (arg2
);
8568 error ("second operand of %s must not be zero.", op_string (op
));
8570 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8571 return value_binop (arg1
, arg2
, op
);
8573 v1
= value_as_long (arg1
);
8578 if (! TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
%v2
) < 0)
8579 v
+= v
> 0 ? -1 : 1;
8587 /* Should not reach this point. */
8591 val
= allocate_value (type1
);
8592 store_unsigned_integer (VALUE_CONTENTS_RAW (val
),
8593 TYPE_LENGTH (VALUE_TYPE (val
)),
8599 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8601 if (ada_is_direct_array_type (VALUE_TYPE (arg1
))
8602 || ada_is_direct_array_type (VALUE_TYPE (arg2
)))
8604 arg1
= ada_coerce_to_simple_array (arg1
);
8605 arg2
= ada_coerce_to_simple_array (arg2
);
8606 if (TYPE_CODE (VALUE_TYPE (arg1
)) != TYPE_CODE_ARRAY
8607 || TYPE_CODE (VALUE_TYPE (arg2
)) != TYPE_CODE_ARRAY
)
8608 error ("Attempt to compare array with non-array");
8609 /* FIXME: The following works only for types whose
8610 representations use all bits (no padding or undefined bits)
8611 and do not have user-defined equality. */
8613 TYPE_LENGTH (VALUE_TYPE (arg1
)) == TYPE_LENGTH (VALUE_TYPE (arg2
))
8614 && memcmp (VALUE_CONTENTS (arg1
), VALUE_CONTENTS (arg2
),
8615 TYPE_LENGTH (VALUE_TYPE (arg1
))) == 0;
8617 return value_equal (arg1
, arg2
);
8621 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8622 int *pos
, enum noside noside
)
8625 int tem
, tem2
, tem3
;
8627 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8630 struct value
**argvec
;
8634 op
= exp
->elts
[pc
].opcode
;
8641 unwrap_value (evaluate_subexp_standard
8642 (expect_type
, exp
, pos
, noside
));
8646 struct value
*result
;
8648 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8649 /* The result type will have code OP_STRING, bashed there from
8650 OP_ARRAY. Bash it back. */
8651 if (TYPE_CODE (VALUE_TYPE (result
)) == TYPE_CODE_STRING
)
8652 TYPE_CODE (VALUE_TYPE (result
)) = TYPE_CODE_ARRAY
;
8658 type
= exp
->elts
[pc
+ 1].type
;
8659 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8660 if (noside
== EVAL_SKIP
)
8662 if (type
!= check_typedef (VALUE_TYPE (arg1
)))
8664 if (ada_is_fixed_point_type (type
))
8665 arg1
= cast_to_fixed (type
, arg1
);
8666 else if (ada_is_fixed_point_type (VALUE_TYPE (arg1
)))
8667 arg1
= value_cast (type
, cast_from_fixed_to_double (arg1
));
8668 else if (VALUE_LVAL (arg1
) == lval_memory
)
8670 /* This is in case of the really obscure (and undocumented,
8671 but apparently expected) case of (Foo) Bar.all, where Bar
8672 is an integer constant and Foo is a dynamic-sized type.
8673 If we don't do this, ARG1 will simply be relabeled with
8675 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8676 return value_zero (to_static_fixed_type (type
), not_lval
);
8678 ada_to_fixed_value_create
8679 (type
, VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
), 0);
8682 arg1
= value_cast (type
, arg1
);
8688 type
= exp
->elts
[pc
+ 1].type
;
8689 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8692 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8693 arg2
= evaluate_subexp (VALUE_TYPE (arg1
), exp
, pos
, noside
);
8694 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8696 if (ada_is_fixed_point_type (VALUE_TYPE (arg1
)))
8697 arg2
= cast_to_fixed (VALUE_TYPE (arg1
), arg2
);
8698 else if (ada_is_fixed_point_type (VALUE_TYPE (arg2
)))
8700 ("Fixed-point values must be assigned to fixed-point variables");
8702 arg2
= coerce_for_assign (VALUE_TYPE (arg1
), arg2
);
8703 return ada_value_assign (arg1
, arg2
);
8706 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8707 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8708 if (noside
== EVAL_SKIP
)
8710 if ((ada_is_fixed_point_type (VALUE_TYPE (arg1
))
8711 || ada_is_fixed_point_type (VALUE_TYPE (arg2
)))
8712 && VALUE_TYPE (arg1
) != VALUE_TYPE (arg2
))
8714 ("Operands of fixed-point addition must have the same type");
8715 return value_cast (VALUE_TYPE (arg1
), value_add (arg1
, arg2
));
8718 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8719 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8720 if (noside
== EVAL_SKIP
)
8722 if ((ada_is_fixed_point_type (VALUE_TYPE (arg1
))
8723 || ada_is_fixed_point_type (VALUE_TYPE (arg2
)))
8724 && VALUE_TYPE (arg1
) != VALUE_TYPE (arg2
))
8726 ("Operands of fixed-point subtraction must have the same type");
8727 return value_cast (VALUE_TYPE (arg1
), value_sub (arg1
, arg2
));
8731 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8732 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8733 if (noside
== EVAL_SKIP
)
8735 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8736 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8737 return value_zero (VALUE_TYPE (arg1
), not_lval
);
8740 if (ada_is_fixed_point_type (VALUE_TYPE (arg1
)))
8741 arg1
= cast_from_fixed_to_double (arg1
);
8742 if (ada_is_fixed_point_type (VALUE_TYPE (arg2
)))
8743 arg2
= cast_from_fixed_to_double (arg2
);
8744 return ada_value_binop (arg1
, arg2
, op
);
8749 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8750 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8751 if (noside
== EVAL_SKIP
)
8753 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8754 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8755 return value_zero (VALUE_TYPE (arg1
), not_lval
);
8757 return ada_value_binop (arg1
, arg2
, op
);
8760 case BINOP_NOTEQUAL
:
8761 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8762 arg2
= evaluate_subexp (VALUE_TYPE (arg1
), exp
, pos
, noside
);
8763 if (noside
== EVAL_SKIP
)
8765 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8768 tem
= ada_value_equal (arg1
, arg2
);
8769 if (op
== BINOP_NOTEQUAL
)
8771 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
8774 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8775 if (noside
== EVAL_SKIP
)
8777 else if (ada_is_fixed_point_type (VALUE_TYPE (arg1
)))
8778 return value_cast (VALUE_TYPE (arg1
), value_neg (arg1
));
8780 return value_neg (arg1
);
8784 if (noside
== EVAL_SKIP
)
8789 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8790 /* Only encountered when an unresolved symbol occurs in a
8791 context other than a function call, in which case, it is
8793 error ("Unexpected unresolved symbol, %s, during evaluation",
8794 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8795 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8799 (to_static_fixed_type
8800 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8806 unwrap_value (evaluate_subexp_standard
8807 (expect_type
, exp
, pos
, noside
));
8808 return ada_to_fixed_value (arg1
);
8814 /* Allocate arg vector, including space for the function to be
8815 called in argvec[0] and a terminating NULL. */
8816 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8818 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8820 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8821 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8822 error ("Unexpected unresolved symbol, %s, during evaluation",
8823 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8826 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8827 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8830 if (noside
== EVAL_SKIP
)
8834 if (ada_is_packed_array_type (desc_base_type (VALUE_TYPE (argvec
[0]))))
8835 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8836 else if (TYPE_CODE (VALUE_TYPE (argvec
[0])) == TYPE_CODE_REF
8837 || (TYPE_CODE (VALUE_TYPE (argvec
[0])) == TYPE_CODE_ARRAY
8838 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8839 argvec
[0] = value_addr (argvec
[0]);
8841 type
= check_typedef (VALUE_TYPE (argvec
[0]));
8842 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8844 switch (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (type
))))
8846 case TYPE_CODE_FUNC
:
8847 type
= check_typedef (TYPE_TARGET_TYPE (type
));
8849 case TYPE_CODE_ARRAY
:
8851 case TYPE_CODE_STRUCT
:
8852 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8853 argvec
[0] = ada_value_ind (argvec
[0]);
8854 type
= check_typedef (TYPE_TARGET_TYPE (type
));
8857 error ("cannot subscript or call something of type `%s'",
8858 ada_type_name (VALUE_TYPE (argvec
[0])));
8863 switch (TYPE_CODE (type
))
8865 case TYPE_CODE_FUNC
:
8866 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8867 return allocate_value (TYPE_TARGET_TYPE (type
));
8868 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8869 case TYPE_CODE_STRUCT
:
8873 /* Make sure to use the parallel ___XVS type if any.
8874 Otherwise, we won't be able to find the array arity
8875 and element type. */
8876 type
= ada_get_base_type (type
);
8878 arity
= ada_array_arity (type
);
8879 type
= ada_array_element_type (type
, nargs
);
8881 error ("cannot subscript or call a record");
8883 error ("wrong number of subscripts; expecting %d", arity
);
8884 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8885 return allocate_value (ada_aligned_type (type
));
8887 unwrap_value (ada_value_subscript
8888 (argvec
[0], nargs
, argvec
+ 1));
8890 case TYPE_CODE_ARRAY
:
8891 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8893 type
= ada_array_element_type (type
, nargs
);
8895 error ("element type of array unknown");
8897 return allocate_value (ada_aligned_type (type
));
8900 unwrap_value (ada_value_subscript
8901 (ada_coerce_to_simple_array (argvec
[0]),
8902 nargs
, argvec
+ 1));
8903 case TYPE_CODE_PTR
: /* Pointer to array */
8904 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8905 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8907 type
= ada_array_element_type (type
, nargs
);
8909 error ("element type of array unknown");
8911 return allocate_value (ada_aligned_type (type
));
8914 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8915 nargs
, argvec
+ 1));
8918 error ("Internal error in evaluate_subexp");
8923 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8924 struct value
*low_bound_val
=
8925 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8926 LONGEST low_bound
= pos_atr (low_bound_val
);
8928 = pos_atr (evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
));
8929 if (noside
== EVAL_SKIP
)
8932 /* If this is a reference type or a pointer type, and
8933 the target type has an XVS parallel type, then get
8934 the real target type. */
8935 if (TYPE_CODE (VALUE_TYPE (array
)) == TYPE_CODE_REF
8936 || TYPE_CODE (VALUE_TYPE (array
)) == TYPE_CODE_PTR
)
8937 TYPE_TARGET_TYPE (VALUE_TYPE (array
)) =
8938 ada_get_base_type (TYPE_TARGET_TYPE (VALUE_TYPE (array
)));
8940 /* If this is a reference to an aligner type, then remove all
8942 if (TYPE_CODE (VALUE_TYPE (array
)) == TYPE_CODE_REF
8943 && ada_is_aligner_type (TYPE_TARGET_TYPE (VALUE_TYPE (array
))))
8944 TYPE_TARGET_TYPE (VALUE_TYPE (array
)) =
8945 ada_aligned_type (TYPE_TARGET_TYPE (VALUE_TYPE (array
)));
8947 if (ada_is_packed_array_type (VALUE_TYPE (array
)))
8948 error ("cannot slice a packed array");
8950 /* If this is a reference to an array or an array lvalue,
8951 convert to a pointer. */
8952 if (TYPE_CODE (VALUE_TYPE (array
)) == TYPE_CODE_REF
8953 || (TYPE_CODE (VALUE_TYPE (array
)) == TYPE_CODE_ARRAY
8954 && VALUE_LVAL (array
) == lval_memory
))
8955 array
= value_addr (array
);
8957 if (noside
== EVAL_AVOID_SIDE_EFFECTS
&&
8958 ada_is_array_descriptor_type (check_typedef (VALUE_TYPE (array
))))
8960 /* Try dereferencing the array, in case it is an access
8962 struct type
*arrType
= ada_type_of_array (array
, 0);
8963 if (arrType
!= NULL
)
8964 array
= value_at_lazy (arrType
, 0, NULL
);
8967 array
= ada_coerce_to_simple_array_ptr (array
);
8969 /* When EVAL_AVOID_SIDE_EFFECTS, we may get the bounds wrong,
8970 but only in contexts where the value is not being requested
8972 if (TYPE_CODE (VALUE_TYPE (array
)) == TYPE_CODE_PTR
)
8974 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8975 return ada_value_ind (array
);
8976 else if (high_bound
< low_bound
)
8977 return empty_array (TYPE_TARGET_TYPE (VALUE_TYPE (array
)),
8981 struct type
*arr_type0
=
8982 to_fixed_array_type (TYPE_TARGET_TYPE (VALUE_TYPE (array
)),
8984 struct value
*item0
=
8985 ada_value_ptr_subscript (array
, arr_type0
, 1,
8987 struct value
*slice
=
8988 value_repeat (item0
, high_bound
- low_bound
+ 1);
8989 struct type
*arr_type1
= VALUE_TYPE (slice
);
8990 TYPE_LOW_BOUND (TYPE_INDEX_TYPE (arr_type1
)) = low_bound
;
8991 TYPE_HIGH_BOUND (TYPE_INDEX_TYPE (arr_type1
)) += low_bound
;
8995 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8997 else if (high_bound
< low_bound
)
8998 return empty_array (VALUE_TYPE (array
), low_bound
);
9000 return value_slice (array
, low_bound
, high_bound
- low_bound
+ 1);
9005 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9006 type
= exp
->elts
[pc
+ 1].type
;
9008 if (noside
== EVAL_SKIP
)
9011 switch (TYPE_CODE (type
))
9014 lim_warning ("Membership test incompletely implemented; "
9015 "always returns true", 0);
9016 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
9018 case TYPE_CODE_RANGE
:
9019 arg2
= value_from_longest (builtin_type_int
,
9020 TYPE_LOW_BOUND (type
));
9021 arg3
= value_from_longest (builtin_type_int
,
9022 TYPE_HIGH_BOUND (type
));
9024 value_from_longest (builtin_type_int
,
9025 (value_less (arg1
, arg3
)
9026 || value_equal (arg1
, arg3
))
9027 && (value_less (arg2
, arg1
)
9028 || value_equal (arg2
, arg1
)));
9031 case BINOP_IN_BOUNDS
:
9033 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9034 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9036 if (noside
== EVAL_SKIP
)
9039 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9040 return value_zero (builtin_type_int
, not_lval
);
9042 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9044 if (tem
< 1 || tem
> ada_array_arity (VALUE_TYPE (arg2
)))
9045 error ("invalid dimension number to '%s", "range");
9047 arg3
= ada_array_bound (arg2
, tem
, 1);
9048 arg2
= ada_array_bound (arg2
, tem
, 0);
9051 value_from_longest (builtin_type_int
,
9052 (value_less (arg1
, arg3
)
9053 || value_equal (arg1
, arg3
))
9054 && (value_less (arg2
, arg1
)
9055 || value_equal (arg2
, arg1
)));
9057 case TERNOP_IN_RANGE
:
9058 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9059 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9060 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9062 if (noside
== EVAL_SKIP
)
9066 value_from_longest (builtin_type_int
,
9067 (value_less (arg1
, arg3
)
9068 || value_equal (arg1
, arg3
))
9069 && (value_less (arg2
, arg1
)
9070 || value_equal (arg2
, arg1
)));
9076 struct type
*type_arg
;
9077 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9079 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9081 type_arg
= exp
->elts
[pc
+ 2].type
;
9085 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9089 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9090 error ("illegal operand to '%s", ada_attribute_name (op
));
9091 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9094 if (noside
== EVAL_SKIP
)
9097 if (type_arg
== NULL
)
9099 arg1
= ada_coerce_ref (arg1
);
9101 if (ada_is_packed_array_type (VALUE_TYPE (arg1
)))
9102 arg1
= ada_coerce_to_simple_array (arg1
);
9104 if (tem
< 1 || tem
> ada_array_arity (VALUE_TYPE (arg1
)))
9105 error ("invalid dimension number to '%s",
9106 ada_attribute_name (op
));
9108 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9110 type
= ada_index_type (VALUE_TYPE (arg1
), tem
);
9113 ("attempt to take bound of something that is not an array");
9114 return allocate_value (type
);
9119 default: /* Should never happen. */
9120 error ("unexpected attribute encountered");
9122 return ada_array_bound (arg1
, tem
, 0);
9124 return ada_array_bound (arg1
, tem
, 1);
9126 return ada_array_length (arg1
, tem
);
9129 else if (discrete_type_p (type_arg
))
9131 struct type
*range_type
;
9132 char *name
= ada_type_name (type_arg
);
9134 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9136 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
9137 if (range_type
== NULL
)
9138 range_type
= type_arg
;
9142 error ("unexpected attribute encountered");
9144 return discrete_type_low_bound (range_type
);
9146 return discrete_type_high_bound (range_type
);
9148 error ("the 'length attribute applies only to array types");
9151 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9152 error ("unimplemented type attribute");
9157 if (ada_is_packed_array_type (type_arg
))
9158 type_arg
= decode_packed_array_type (type_arg
);
9160 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
9161 error ("invalid dimension number to '%s",
9162 ada_attribute_name (op
));
9164 type
= ada_index_type (type_arg
, tem
);
9166 error ("attempt to take bound of something that is not an array");
9167 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9168 return allocate_value (type
);
9173 error ("unexpected attribute encountered");
9175 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9176 return value_from_longest (type
, low
);
9179 ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
9180 return value_from_longest (type
, high
);
9182 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9183 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
9184 return value_from_longest (type
, high
- low
+ 1);
9190 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9191 if (noside
== EVAL_SKIP
)
9194 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9195 return value_zero (ada_tag_type (arg1
), not_lval
);
9197 return ada_value_tag (arg1
);
9201 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9202 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9203 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9204 if (noside
== EVAL_SKIP
)
9206 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9207 return value_zero (VALUE_TYPE (arg1
), not_lval
);
9209 return value_binop (arg1
, arg2
,
9210 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9212 case OP_ATR_MODULUS
:
9214 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
9215 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9217 if (noside
== EVAL_SKIP
)
9220 if (!ada_is_modular_type (type_arg
))
9221 error ("'modulus must be applied to modular type");
9223 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9224 ada_modulus (type_arg
));
9229 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9230 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9231 if (noside
== EVAL_SKIP
)
9233 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9234 return value_zero (builtin_type_ada_int
, not_lval
);
9236 return value_pos_atr (arg1
);
9239 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9240 if (noside
== EVAL_SKIP
)
9242 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9243 return value_zero (builtin_type_ada_int
, not_lval
);
9245 return value_from_longest (builtin_type_ada_int
,
9247 * TYPE_LENGTH (VALUE_TYPE (arg1
)));
9250 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9251 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9252 type
= exp
->elts
[pc
+ 2].type
;
9253 if (noside
== EVAL_SKIP
)
9255 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9256 return value_zero (type
, not_lval
);
9258 return value_val_atr (type
, arg1
);
9261 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9262 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9263 if (noside
== EVAL_SKIP
)
9265 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9266 return value_zero (VALUE_TYPE (arg1
), not_lval
);
9268 return value_binop (arg1
, arg2
, op
);
9271 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9272 if (noside
== EVAL_SKIP
)
9278 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9279 if (noside
== EVAL_SKIP
)
9281 if (value_less (arg1
, value_zero (VALUE_TYPE (arg1
), not_lval
)))
9282 return value_neg (arg1
);
9287 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
9288 expect_type
= TYPE_TARGET_TYPE (check_typedef (expect_type
));
9289 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
9290 if (noside
== EVAL_SKIP
)
9292 type
= check_typedef (VALUE_TYPE (arg1
));
9293 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9295 if (ada_is_array_descriptor_type (type
))
9296 /* GDB allows dereferencing GNAT array descriptors. */
9298 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9299 if (arrType
== NULL
)
9300 error ("Attempt to dereference null array pointer.");
9301 return value_at_lazy (arrType
, 0, NULL
);
9303 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9304 || TYPE_CODE (type
) == TYPE_CODE_REF
9305 /* In C you can dereference an array to get the 1st elt. */
9306 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9309 (to_static_fixed_type
9310 (ada_aligned_type (check_typedef (TYPE_TARGET_TYPE (type
)))),
9312 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9313 /* GDB allows dereferencing an int. */
9314 return value_zero (builtin_type_int
, lval_memory
);
9316 error ("Attempt to take contents of a non-pointer value.");
9318 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9319 type
= check_typedef (VALUE_TYPE (arg1
));
9321 if (ada_is_array_descriptor_type (type
))
9322 /* GDB allows dereferencing GNAT array descriptors. */
9323 return ada_coerce_to_simple_array (arg1
);
9325 return ada_value_ind (arg1
);
9327 case STRUCTOP_STRUCT
:
9328 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9329 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9330 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9331 if (noside
== EVAL_SKIP
)
9333 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9335 struct type
*type1
= VALUE_TYPE (arg1
);
9336 if (ada_is_tagged_type (type1
, 1))
9338 type
= ada_lookup_struct_elt_type (type1
,
9339 &exp
->elts
[pc
+ 2].string
,
9342 /* In this case, we assume that the field COULD exist
9343 in some extension of the type. Return an object of
9344 "type" void, which will match any formal
9345 (see ada_type_match). */
9346 return value_zero (builtin_type_void
, lval_memory
);
9349 type
= ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
,
9352 return value_zero (ada_aligned_type (type
), lval_memory
);
9356 ada_to_fixed_value (unwrap_value
9357 (ada_value_struct_elt
9358 (arg1
, &exp
->elts
[pc
+ 2].string
, "record")));
9360 /* The value is not supposed to be used. This is here to make it
9361 easier to accommodate expressions that contain types. */
9363 if (noside
== EVAL_SKIP
)
9365 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9366 return allocate_value (builtin_type_void
);
9368 error ("Attempt to use a type name as an expression");
9372 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
9378 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9379 type name that encodes the 'small and 'delta information.
9380 Otherwise, return NULL. */
9383 fixed_type_info (struct type
*type
)
9385 const char *name
= ada_type_name (type
);
9386 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9388 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9390 const char *tail
= strstr (name
, "___XF_");
9396 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9397 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9402 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9405 ada_is_fixed_point_type (struct type
*type
)
9407 return fixed_type_info (type
) != NULL
;
9410 /* Return non-zero iff TYPE represents a System.Address type. */
9413 ada_is_system_address_type (struct type
*type
)
9415 return (TYPE_NAME (type
)
9416 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9419 /* Assuming that TYPE is the representation of an Ada fixed-point
9420 type, return its delta, or -1 if the type is malformed and the
9421 delta cannot be determined. */
9424 ada_delta (struct type
*type
)
9426 const char *encoding
= fixed_type_info (type
);
9429 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9432 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9435 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9436 factor ('SMALL value) associated with the type. */
9439 scaling_factor (struct type
*type
)
9441 const char *encoding
= fixed_type_info (type
);
9442 unsigned long num0
, den0
, num1
, den1
;
9445 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9450 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9452 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9456 /* Assuming that X is the representation of a value of fixed-point
9457 type TYPE, return its floating-point equivalent. */
9460 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9462 return (DOUBLEST
) x
*scaling_factor (type
);
9465 /* The representation of a fixed-point value of type TYPE
9466 corresponding to the value X. */
9469 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9471 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9475 /* VAX floating formats */
9477 /* Non-zero iff TYPE represents one of the special VAX floating-point
9481 ada_is_vax_floating_type (struct type
*type
)
9484 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9487 && (TYPE_CODE (type
) == TYPE_CODE_INT
9488 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9489 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9492 /* The type of special VAX floating-point type this is, assuming
9493 ada_is_vax_floating_point. */
9496 ada_vax_float_type_suffix (struct type
*type
)
9498 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9501 /* A value representing the special debugging function that outputs
9502 VAX floating-point values of the type represented by TYPE. Assumes
9503 ada_is_vax_floating_type (TYPE). */
9506 ada_vax_float_print_function (struct type
*type
)
9508 switch (ada_vax_float_type_suffix (type
))
9511 return get_var_value ("DEBUG_STRING_F", 0);
9513 return get_var_value ("DEBUG_STRING_D", 0);
9515 return get_var_value ("DEBUG_STRING_G", 0);
9517 error ("invalid VAX floating-point type");
9524 /* Scan STR beginning at position K for a discriminant name, and
9525 return the value of that discriminant field of DVAL in *PX. If
9526 PNEW_K is not null, put the position of the character beyond the
9527 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9528 not alter *PX and *PNEW_K if unsuccessful. */
9531 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9534 static char *bound_buffer
= NULL
;
9535 static size_t bound_buffer_len
= 0;
9538 struct value
*bound_val
;
9540 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9543 pend
= strstr (str
+ k
, "__");
9547 k
+= strlen (bound
);
9551 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9552 bound
= bound_buffer
;
9553 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9554 bound
[pend
- (str
+ k
)] = '\0';
9558 bound_val
= ada_search_struct_field (bound
, dval
, 0, VALUE_TYPE (dval
));
9559 if (bound_val
== NULL
)
9562 *px
= value_as_long (bound_val
);
9568 /* Value of variable named NAME in the current environment. If
9569 no such variable found, then if ERR_MSG is null, returns 0, and
9570 otherwise causes an error with message ERR_MSG. */
9572 static struct value
*
9573 get_var_value (char *name
, char *err_msg
)
9575 struct ada_symbol_info
*syms
;
9578 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9583 if (err_msg
== NULL
)
9586 error ("%s", err_msg
);
9589 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9592 /* Value of integer variable named NAME in the current environment. If
9593 no such variable found, returns 0, and sets *FLAG to 0. If
9594 successful, sets *FLAG to 1. */
9597 get_int_var_value (char *name
, int *flag
)
9599 struct value
*var_val
= get_var_value (name
, 0);
9611 return value_as_long (var_val
);
9616 /* Return a range type whose base type is that of the range type named
9617 NAME in the current environment, and whose bounds are calculated
9618 from NAME according to the GNAT range encoding conventions.
9619 Extract discriminant values, if needed, from DVAL. If a new type
9620 must be created, allocate in OBJFILE's space. The bounds
9621 information, in general, is encoded in NAME, the base type given in
9622 the named range type. */
9624 static struct type
*
9625 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9627 struct type
*raw_type
= ada_find_any_type (name
);
9628 struct type
*base_type
;
9631 if (raw_type
== NULL
)
9632 base_type
= builtin_type_int
;
9633 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9634 base_type
= TYPE_TARGET_TYPE (raw_type
);
9636 base_type
= raw_type
;
9638 subtype_info
= strstr (name
, "___XD");
9639 if (subtype_info
== NULL
)
9643 static char *name_buf
= NULL
;
9644 static size_t name_len
= 0;
9645 int prefix_len
= subtype_info
- name
;
9651 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9652 strncpy (name_buf
, name
, prefix_len
);
9653 name_buf
[prefix_len
] = '\0';
9656 bounds_str
= strchr (subtype_info
, '_');
9659 if (*subtype_info
== 'L')
9661 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9662 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9664 if (bounds_str
[n
] == '_')
9666 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9673 strcpy (name_buf
+ prefix_len
, "___L");
9674 L
= get_int_var_value (name_buf
, &ok
);
9677 lim_warning ("Unknown lower bound, using 1.", 1);
9682 if (*subtype_info
== 'U')
9684 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9685 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9691 strcpy (name_buf
+ prefix_len
, "___U");
9692 U
= get_int_var_value (name_buf
, &ok
);
9695 lim_warning ("Unknown upper bound, using %ld.", (long) L
);
9700 if (objfile
== NULL
)
9701 objfile
= TYPE_OBJFILE (base_type
);
9702 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9703 TYPE_NAME (type
) = name
;
9708 /* True iff NAME is the name of a range type. */
9711 ada_is_range_type_name (const char *name
)
9713 return (name
!= NULL
&& strstr (name
, "___XD"));
9719 /* True iff TYPE is an Ada modular type. */
9722 ada_is_modular_type (struct type
*type
)
9724 struct type
*subranged_type
= base_type (type
);
9726 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9727 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
9728 && TYPE_UNSIGNED (subranged_type
));
9731 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9734 ada_modulus (struct type
* type
)
9736 return TYPE_HIGH_BOUND (type
) + 1;
9740 /* Information about operators given special treatment in functions
9742 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
9744 #define ADA_OPERATORS \
9745 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
9746 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
9747 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
9748 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
9749 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
9750 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
9751 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
9752 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
9753 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
9754 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
9755 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
9756 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
9757 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
9758 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
9759 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
9760 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0)
9763 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
9765 switch (exp
->elts
[pc
- 1].opcode
)
9768 operator_length_standard (exp
, pc
, oplenp
, argsp
);
9771 #define OP_DEFN(op, len, args, binop) \
9772 case op: *oplenp = len; *argsp = args; break;
9779 ada_op_name (enum exp_opcode opcode
)
9784 return op_name_standard (opcode
);
9785 #define OP_DEFN(op, len, args, binop) case op: return #op;
9791 /* As for operator_length, but assumes PC is pointing at the first
9792 element of the operator, and gives meaningful results only for the
9793 Ada-specific operators. */
9796 ada_forward_operator_length (struct expression
*exp
, int pc
,
9797 int *oplenp
, int *argsp
)
9799 switch (exp
->elts
[pc
].opcode
)
9802 *oplenp
= *argsp
= 0;
9804 #define OP_DEFN(op, len, args, binop) \
9805 case op: *oplenp = len; *argsp = args; break;
9812 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
9814 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
9819 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
9823 /* Ada attributes ('Foo). */
9830 case OP_ATR_MODULUS
:
9839 fprintf_filtered (stream
, "Type @");
9840 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
9841 fprintf_filtered (stream
, " (");
9842 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
9843 fprintf_filtered (stream
, ")");
9845 case BINOP_IN_BOUNDS
:
9846 fprintf_filtered (stream
, " (%d)", (int) exp
->elts
[pc
+ 2].longconst
);
9848 case TERNOP_IN_RANGE
:
9852 return dump_subexp_body_standard (exp
, stream
, elt
);
9856 for (i
= 0; i
< nargs
; i
+= 1)
9857 elt
= dump_subexp (exp
, stream
, elt
);
9862 /* The Ada extension of print_subexp (q.v.). */
9865 ada_print_subexp (struct expression
*exp
, int *pos
,
9866 struct ui_file
*stream
, enum precedence prec
)
9870 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
9872 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9877 print_subexp_standard (exp
, pos
, stream
, prec
);
9882 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
9885 case BINOP_IN_BOUNDS
:
9887 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
9888 fputs_filtered (" in ", stream
);
9889 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
9890 fputs_filtered ("'range", stream
);
9891 if (exp
->elts
[pc
+ 1].longconst
> 1)
9892 fprintf_filtered (stream
, "(%ld)", (long) exp
->elts
[pc
+ 1].longconst
);
9895 case TERNOP_IN_RANGE
:
9897 if (prec
>= PREC_EQUAL
)
9898 fputs_filtered ("(", stream
);
9899 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
9900 fputs_filtered (" in ", stream
);
9901 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
9902 fputs_filtered (" .. ", stream
);
9903 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
9904 if (prec
>= PREC_EQUAL
)
9905 fputs_filtered (")", stream
);
9914 case OP_ATR_MODULUS
:
9920 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9922 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
9923 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
9927 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
9928 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
9932 for (tem
= 1; tem
< nargs
; tem
+= 1)
9934 fputs_filtered ( (tem
== 1) ? " (" : ", ", stream
);
9935 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
9937 fputs_filtered (")", stream
);
9943 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
9944 fputs_filtered ("'(", stream
);
9945 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
9946 fputs_filtered (")", stream
);
9951 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
9952 fputs_filtered (" in ", stream
);
9953 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
9958 /* Table mapping opcodes into strings for printing operators
9959 and precedences of the operators. */
9961 static const struct op_print ada_op_print_tab
[] = {
9962 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
9963 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
9964 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
9965 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
9966 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
9967 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
9968 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
9969 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
9970 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
9971 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
9972 {">", BINOP_GTR
, PREC_ORDER
, 0},
9973 {"<", BINOP_LESS
, PREC_ORDER
, 0},
9974 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
9975 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
9976 {"+", BINOP_ADD
, PREC_ADD
, 0},
9977 {"-", BINOP_SUB
, PREC_ADD
, 0},
9978 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
9979 {"*", BINOP_MUL
, PREC_MUL
, 0},
9980 {"/", BINOP_DIV
, PREC_MUL
, 0},
9981 {"rem", BINOP_REM
, PREC_MUL
, 0},
9982 {"mod", BINOP_MOD
, PREC_MUL
, 0},
9983 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
9984 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
9985 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
9986 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
9987 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
9988 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
9989 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
9990 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
9991 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
9992 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
9996 /* Assorted Types and Interfaces */
9998 struct type
*builtin_type_ada_int
;
9999 struct type
*builtin_type_ada_short
;
10000 struct type
*builtin_type_ada_long
;
10001 struct type
*builtin_type_ada_long_long
;
10002 struct type
*builtin_type_ada_char
;
10003 struct type
*builtin_type_ada_float
;
10004 struct type
*builtin_type_ada_double
;
10005 struct type
*builtin_type_ada_long_double
;
10006 struct type
*builtin_type_ada_natural
;
10007 struct type
*builtin_type_ada_positive
;
10008 struct type
*builtin_type_ada_system_address
;
10010 struct type
**const (ada_builtin_types
[]) =
10012 &builtin_type_ada_int
,
10013 &builtin_type_ada_long
,
10014 &builtin_type_ada_short
,
10015 &builtin_type_ada_char
,
10016 &builtin_type_ada_float
,
10017 &builtin_type_ada_double
,
10018 &builtin_type_ada_long_long
,
10019 &builtin_type_ada_long_double
,
10020 &builtin_type_ada_natural
, &builtin_type_ada_positive
,
10021 /* The following types are carried over from C for convenience. */
10023 &builtin_type_long
,
10024 &builtin_type_short
,
10025 &builtin_type_char
,
10026 &builtin_type_float
,
10027 &builtin_type_double
,
10028 &builtin_type_long_long
,
10029 &builtin_type_void
,
10030 &builtin_type_signed_char
,
10031 &builtin_type_unsigned_char
,
10032 &builtin_type_unsigned_short
,
10033 &builtin_type_unsigned_int
,
10034 &builtin_type_unsigned_long
,
10035 &builtin_type_unsigned_long_long
,
10036 &builtin_type_long_double
,
10037 &builtin_type_complex
,
10038 &builtin_type_double_complex
,
10042 /* Not really used, but needed in the ada_language_defn. */
10045 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10047 ada_emit_char (c
, stream
, quoter
, 1);
10053 warnings_issued
= 0;
10054 return ada_parse ();
10057 static const struct exp_descriptor ada_exp_descriptor
=
10060 ada_operator_length
,
10062 ada_dump_subexp_body
,
10063 ada_evaluate_subexp
10066 const struct language_defn ada_language_defn
= {
10067 "ada", /* Language name */
10072 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10073 that's not quite what this means. */
10076 ada_lookup_minimal_symbol
,
10078 &ada_exp_descriptor
,
10082 ada_printchar
, /* Print a character constant */
10083 ada_printstr
, /* Function to print string constant */
10084 emit_char
, /* Function to print single char (not used) */
10085 ada_create_fundamental_type
, /* Create fundamental type in this language */
10086 ada_print_type
, /* Print a type using appropriate syntax */
10087 ada_val_print
, /* Print a value using appropriate syntax */
10088 ada_value_print
, /* Print a top-level value */
10089 NULL
, /* Language specific skip_trampoline */
10090 NULL
, /* value_of_this */
10091 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10092 basic_lookup_transparent_type
,/* lookup_transparent_type */
10093 ada_la_decode
, /* Language specific symbol demangler */
10094 {"", "", "", ""}, /* Binary format info */
10096 {"8#%lo#", "8#", "o", "#"}, /* Octal format info */
10097 {"%ld", "", "d", ""}, /* Decimal format info */
10098 {"16#%lx#", "16#", "x", "#"}, /* Hex format info */
10100 /* Copied from c-lang.c. */
10101 {"0%lo", "0", "o", ""}, /* Octal format info */
10102 {"%ld", "", "d", ""}, /* Decimal format info */
10103 {"0x%lx", "0x", "x", ""}, /* Hex format info */
10105 ada_op_print_tab
, /* expression operators for printing */
10106 0, /* c-style arrays */
10107 1, /* String lower bound */
10108 &builtin_type_ada_char
,
10109 ada_get_gdb_completer_word_break_characters
,
10111 ada_translate_error_message
, /* Substitute Ada-specific terminology
10112 in errors and warnings. */
10118 build_ada_types (void) {
10119 builtin_type_ada_int
=
10120 init_type (TYPE_CODE_INT
, TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10121 0, "integer", (struct objfile
*) NULL
);
10122 builtin_type_ada_long
=
10123 init_type (TYPE_CODE_INT
, TARGET_LONG_BIT
/ TARGET_CHAR_BIT
,
10124 0, "long_integer", (struct objfile
*) NULL
);
10125 builtin_type_ada_short
=
10126 init_type (TYPE_CODE_INT
, TARGET_SHORT_BIT
/ TARGET_CHAR_BIT
,
10127 0, "short_integer", (struct objfile
*) NULL
);
10128 builtin_type_ada_char
=
10129 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10130 0, "character", (struct objfile
*) NULL
);
10131 builtin_type_ada_float
=
10132 init_type (TYPE_CODE_FLT
, TARGET_FLOAT_BIT
/ TARGET_CHAR_BIT
,
10133 0, "float", (struct objfile
*) NULL
);
10134 builtin_type_ada_double
=
10135 init_type (TYPE_CODE_FLT
, TARGET_DOUBLE_BIT
/ TARGET_CHAR_BIT
,
10136 0, "long_float", (struct objfile
*) NULL
);
10137 builtin_type_ada_long_long
=
10138 init_type (TYPE_CODE_INT
, TARGET_LONG_LONG_BIT
/ TARGET_CHAR_BIT
,
10139 0, "long_long_integer", (struct objfile
*) NULL
);
10140 builtin_type_ada_long_double
=
10141 init_type (TYPE_CODE_FLT
, TARGET_LONG_DOUBLE_BIT
/ TARGET_CHAR_BIT
,
10142 0, "long_long_float", (struct objfile
*) NULL
);
10143 builtin_type_ada_natural
=
10144 init_type (TYPE_CODE_INT
, TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10145 0, "natural", (struct objfile
*) NULL
);
10146 builtin_type_ada_positive
=
10147 init_type (TYPE_CODE_INT
, TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10148 0, "positive", (struct objfile
*) NULL
);
10151 builtin_type_ada_system_address
=
10152 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10153 (struct objfile
*) NULL
));
10154 TYPE_NAME (builtin_type_ada_system_address
) = "system__address";
10158 _initialize_ada_language (void)
10161 build_ada_types ();
10162 deprecated_register_gdbarch_swap (NULL
, 0, build_ada_types
);
10163 add_language (&ada_language_defn
);
10167 (add_set_cmd ("varsize-limit", class_support
, var_uinteger
,
10168 (char *) &varsize_limit
,
10169 "Set maximum bytes in dynamic-sized object.",
10170 &setlist
), &showlist
);
10172 varsize_limit
= 65536;
10174 obstack_init (&symbol_list_obstack
);
10175 obstack_init (&cache_space
);
10177 decoded_names_store
= htab_create_alloc_ex
10178 (256, htab_hash_string
, (int (*) (const void *, const void *)) streq
,
10179 NULL
, NULL
, xmcalloc
, xmfree
);
10182 /* Create a fundamental Ada type using default reasonable for the current
10185 Some object/debugging file formats (DWARF version 1, COFF, etc) do not
10186 define fundamental types such as "int" or "double". Others (stabs or
10187 DWARF version 2, etc) do define fundamental types. For the formats which
10188 don't provide fundamental types, gdb can create such types using this
10191 FIXME: Some compilers distinguish explicitly signed integral types
10192 (signed short, signed int, signed long) from "regular" integral types
10193 (short, int, long) in the debugging information. There is some dis-
10194 agreement as to how useful this feature is. In particular, gcc does
10195 not support this. Also, only some debugging formats allow the
10196 distinction to be passed on to a debugger. For now, we always just
10197 use "short", "int", or "long" as the type name, for both the implicit
10198 and explicitly signed types. This also makes life easier for the
10199 gdb test suite since we don't have to account for the differences
10200 in output depending upon what the compiler and debugging format
10201 support. We will probably have to re-examine the issue when gdb
10202 starts taking it's fundamental type information directly from the
10203 debugging information supplied by the compiler. fnf@cygnus.com */
10205 static struct type
*
10206 ada_create_fundamental_type (struct objfile
*objfile
, int typeid)
10208 struct type
*type
= NULL
;
10213 /* FIXME: For now, if we are asked to produce a type not in this
10214 language, create the equivalent of a C integer type with the
10215 name "<?type?>". When all the dust settles from the type
10216 reconstruction work, this should probably become an error. */
10217 type
= init_type (TYPE_CODE_INT
,
10218 TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10219 0, "<?type?>", objfile
);
10220 warning ("internal error: no Ada fundamental type %d", typeid);
10223 type
= init_type (TYPE_CODE_VOID
,
10224 TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10225 0, "void", objfile
);
10228 type
= init_type (TYPE_CODE_INT
,
10229 TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10230 0, "character", objfile
);
10232 case FT_SIGNED_CHAR
:
10233 type
= init_type (TYPE_CODE_INT
,
10234 TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10235 0, "signed char", objfile
);
10237 case FT_UNSIGNED_CHAR
:
10238 type
= init_type (TYPE_CODE_INT
,
10239 TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10240 TYPE_FLAG_UNSIGNED
, "unsigned char", objfile
);
10243 type
= init_type (TYPE_CODE_INT
,
10244 TARGET_SHORT_BIT
/ TARGET_CHAR_BIT
,
10245 0, "short_integer", objfile
);
10247 case FT_SIGNED_SHORT
:
10248 type
= init_type (TYPE_CODE_INT
,
10249 TARGET_SHORT_BIT
/ TARGET_CHAR_BIT
,
10250 0, "short_integer", objfile
);
10252 case FT_UNSIGNED_SHORT
:
10253 type
= init_type (TYPE_CODE_INT
,
10254 TARGET_SHORT_BIT
/ TARGET_CHAR_BIT
,
10255 TYPE_FLAG_UNSIGNED
, "unsigned short", objfile
);
10258 type
= init_type (TYPE_CODE_INT
,
10259 TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10260 0, "integer", objfile
);
10262 case FT_SIGNED_INTEGER
:
10263 type
= init_type (TYPE_CODE_INT
, TARGET_INT_BIT
/ TARGET_CHAR_BIT
, 0, "integer", objfile
); /* FIXME -fnf */
10265 case FT_UNSIGNED_INTEGER
:
10266 type
= init_type (TYPE_CODE_INT
,
10267 TARGET_INT_BIT
/ TARGET_CHAR_BIT
,
10268 TYPE_FLAG_UNSIGNED
, "unsigned int", objfile
);
10271 type
= init_type (TYPE_CODE_INT
,
10272 TARGET_LONG_BIT
/ TARGET_CHAR_BIT
,
10273 0, "long_integer", objfile
);
10275 case FT_SIGNED_LONG
:
10276 type
= init_type (TYPE_CODE_INT
,
10277 TARGET_LONG_BIT
/ TARGET_CHAR_BIT
,
10278 0, "long_integer", objfile
);
10280 case FT_UNSIGNED_LONG
:
10281 type
= init_type (TYPE_CODE_INT
,
10282 TARGET_LONG_BIT
/ TARGET_CHAR_BIT
,
10283 TYPE_FLAG_UNSIGNED
, "unsigned long", objfile
);
10286 type
= init_type (TYPE_CODE_INT
,
10287 TARGET_LONG_LONG_BIT
/ TARGET_CHAR_BIT
,
10288 0, "long_long_integer", objfile
);
10290 case FT_SIGNED_LONG_LONG
:
10291 type
= init_type (TYPE_CODE_INT
,
10292 TARGET_LONG_LONG_BIT
/ TARGET_CHAR_BIT
,
10293 0, "long_long_integer", objfile
);
10295 case FT_UNSIGNED_LONG_LONG
:
10296 type
= init_type (TYPE_CODE_INT
,
10297 TARGET_LONG_LONG_BIT
/ TARGET_CHAR_BIT
,
10298 TYPE_FLAG_UNSIGNED
, "unsigned long long", objfile
);
10301 type
= init_type (TYPE_CODE_FLT
,
10302 TARGET_FLOAT_BIT
/ TARGET_CHAR_BIT
,
10303 0, "float", objfile
);
10305 case FT_DBL_PREC_FLOAT
:
10306 type
= init_type (TYPE_CODE_FLT
,
10307 TARGET_DOUBLE_BIT
/ TARGET_CHAR_BIT
,
10308 0, "long_float", objfile
);
10310 case FT_EXT_PREC_FLOAT
:
10311 type
= init_type (TYPE_CODE_FLT
,
10312 TARGET_LONG_DOUBLE_BIT
/ TARGET_CHAR_BIT
,
10313 0, "long_long_float", objfile
);
10320 ada_dump_symtab (struct symtab
*s
)
10323 fprintf (stderr
, "New symtab: [\n");
10324 fprintf (stderr
, " Name: %s/%s;\n",
10325 s
->dirname
? s
->dirname
: "?", s
->filename
? s
->filename
: "?");
10326 fprintf (stderr
, " Format: %s;\n", s
->debugformat
);
10327 if (s
->linetable
!= NULL
)
10329 fprintf (stderr
, " Line table (section %d):\n", s
->block_line_section
);
10330 for (i
= 0; i
< s
->linetable
->nitems
; i
+= 1)
10332 struct linetable_entry
*e
= s
->linetable
->item
+ i
;
10333 fprintf (stderr
, " %4ld: %8lx\n", (long) e
->line
, (long) e
->pc
);
10336 fprintf (stderr
, "]\n");