]> git.ipfire.org Git - thirdparty/binutils-gdb.git/blame - gdb/ada-lang.c
* gdb.cp/classes.exp (test_ptype_class_objects): Remove
[thirdparty/binutils-gdb.git] / gdb / ada-lang.c
CommitLineData
6e681866 1/* Ada language support routines for GDB, the GNU debugger.
10a2c479 2
0b302171
JB
3 Copyright (C) 1992-1994, 1997-2000, 2003-2005, 2007-2012 Free
4 Software Foundation, Inc.
14f9c5c9 5
a9762ec7 6 This file is part of GDB.
14f9c5c9 7
a9762ec7
JB
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
14f9c5c9 12
a9762ec7
JB
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
14f9c5c9 17
a9762ec7
JB
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
14f9c5c9 20
96d887e8 21
4c4b4cd2 22#include "defs.h"
14f9c5c9 23#include <stdio.h>
0c30c098 24#include "gdb_string.h"
14f9c5c9
AS
25#include <ctype.h>
26#include <stdarg.h>
27#include "demangle.h"
4c4b4cd2
PH
28#include "gdb_regex.h"
29#include "frame.h"
14f9c5c9
AS
30#include "symtab.h"
31#include "gdbtypes.h"
32#include "gdbcmd.h"
33#include "expression.h"
34#include "parser-defs.h"
35#include "language.h"
36#include "c-lang.h"
37#include "inferior.h"
38#include "symfile.h"
39#include "objfiles.h"
40#include "breakpoint.h"
41#include "gdbcore.h"
4c4b4cd2
PH
42#include "hashtab.h"
43#include "gdb_obstack.h"
14f9c5c9 44#include "ada-lang.h"
4c4b4cd2
PH
45#include "completer.h"
46#include "gdb_stat.h"
47#ifdef UI_OUT
14f9c5c9 48#include "ui-out.h"
4c4b4cd2 49#endif
fe898f56 50#include "block.h"
04714b91 51#include "infcall.h"
de4f826b 52#include "dictionary.h"
60250e8b 53#include "exceptions.h"
f7f9143b
JB
54#include "annotate.h"
55#include "valprint.h"
9bbc9174 56#include "source.h"
0259addd 57#include "observer.h"
2ba95b9b 58#include "vec.h"
692465f1 59#include "stack.h"
fa864999 60#include "gdb_vecs.h"
14f9c5c9 61
ccefe4c4 62#include "psymtab.h"
40bc484c 63#include "value.h"
956a9fb9 64#include "mi/mi-common.h"
9ac4176b 65#include "arch-utils.h"
28010a5d 66#include "exceptions.h"
0fcd72ba 67#include "cli/cli-utils.h"
ccefe4c4 68
4c4b4cd2 69/* Define whether or not the C operator '/' truncates towards zero for
0963b4bd 70 differently signed operands (truncation direction is undefined in C).
4c4b4cd2
PH
71 Copied from valarith.c. */
72
73#ifndef TRUNCATION_TOWARDS_ZERO
74#define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
75#endif
76
d2e4a39e 77static struct type *desc_base_type (struct type *);
14f9c5c9 78
d2e4a39e 79static struct type *desc_bounds_type (struct type *);
14f9c5c9 80
d2e4a39e 81static struct value *desc_bounds (struct value *);
14f9c5c9 82
d2e4a39e 83static int fat_pntr_bounds_bitpos (struct type *);
14f9c5c9 84
d2e4a39e 85static int fat_pntr_bounds_bitsize (struct type *);
14f9c5c9 86
556bdfd4 87static struct type *desc_data_target_type (struct type *);
14f9c5c9 88
d2e4a39e 89static struct value *desc_data (struct value *);
14f9c5c9 90
d2e4a39e 91static int fat_pntr_data_bitpos (struct type *);
14f9c5c9 92
d2e4a39e 93static int fat_pntr_data_bitsize (struct type *);
14f9c5c9 94
d2e4a39e 95static struct value *desc_one_bound (struct value *, int, int);
14f9c5c9 96
d2e4a39e 97static int desc_bound_bitpos (struct type *, int, int);
14f9c5c9 98
d2e4a39e 99static int desc_bound_bitsize (struct type *, int, int);
14f9c5c9 100
d2e4a39e 101static struct type *desc_index_type (struct type *, int);
14f9c5c9 102
d2e4a39e 103static int desc_arity (struct type *);
14f9c5c9 104
d2e4a39e 105static int ada_type_match (struct type *, struct type *, int);
14f9c5c9 106
d2e4a39e 107static int ada_args_match (struct symbol *, struct value **, int);
14f9c5c9 108
40658b94
PH
109static int full_match (const char *, const char *);
110
40bc484c 111static struct value *make_array_descriptor (struct type *, struct value *);
14f9c5c9 112
4c4b4cd2 113static void ada_add_block_symbols (struct obstack *,
76a01679 114 struct block *, const char *,
2570f2b7 115 domain_enum, struct objfile *, int);
14f9c5c9 116
4c4b4cd2 117static int is_nonfunction (struct ada_symbol_info *, int);
14f9c5c9 118
76a01679 119static void add_defn_to_vec (struct obstack *, struct symbol *,
2570f2b7 120 struct block *);
14f9c5c9 121
4c4b4cd2
PH
122static int num_defns_collected (struct obstack *);
123
124static struct ada_symbol_info *defns_collected (struct obstack *, int);
14f9c5c9 125
4c4b4cd2 126static struct value *resolve_subexp (struct expression **, int *, int,
76a01679 127 struct type *);
14f9c5c9 128
d2e4a39e 129static void replace_operator_with_call (struct expression **, int, int, int,
4c4b4cd2 130 struct symbol *, struct block *);
14f9c5c9 131
d2e4a39e 132static int possible_user_operator_p (enum exp_opcode, struct value **);
14f9c5c9 133
4c4b4cd2
PH
134static char *ada_op_name (enum exp_opcode);
135
136static const char *ada_decoded_op_name (enum exp_opcode);
14f9c5c9 137
d2e4a39e 138static int numeric_type_p (struct type *);
14f9c5c9 139
d2e4a39e 140static int integer_type_p (struct type *);
14f9c5c9 141
d2e4a39e 142static int scalar_type_p (struct type *);
14f9c5c9 143
d2e4a39e 144static int discrete_type_p (struct type *);
14f9c5c9 145
aeb5907d
JB
146static enum ada_renaming_category parse_old_style_renaming (struct type *,
147 const char **,
148 int *,
149 const char **);
150
151static struct symbol *find_old_style_renaming_symbol (const char *,
152 struct block *);
153
4c4b4cd2 154static struct type *ada_lookup_struct_elt_type (struct type *, char *,
76a01679 155 int, int, int *);
4c4b4cd2 156
d2e4a39e 157static struct value *evaluate_subexp_type (struct expression *, int *);
14f9c5c9 158
b4ba55a1
JB
159static struct type *ada_find_parallel_type_with_name (struct type *,
160 const char *);
161
d2e4a39e 162static int is_dynamic_field (struct type *, int);
14f9c5c9 163
10a2c479 164static struct type *to_fixed_variant_branch_type (struct type *,
fc1a4b47 165 const gdb_byte *,
4c4b4cd2
PH
166 CORE_ADDR, struct value *);
167
168static struct type *to_fixed_array_type (struct type *, struct value *, int);
14f9c5c9 169
28c85d6c 170static struct type *to_fixed_range_type (struct type *, struct value *);
14f9c5c9 171
d2e4a39e 172static struct type *to_static_fixed_type (struct type *);
f192137b 173static struct type *static_unwrap_type (struct type *type);
14f9c5c9 174
d2e4a39e 175static struct value *unwrap_value (struct value *);
14f9c5c9 176
ad82864c 177static struct type *constrained_packed_array_type (struct type *, long *);
14f9c5c9 178
ad82864c 179static struct type *decode_constrained_packed_array_type (struct type *);
14f9c5c9 180
ad82864c
JB
181static long decode_packed_array_bitsize (struct type *);
182
183static struct value *decode_constrained_packed_array (struct value *);
184
185static int ada_is_packed_array_type (struct type *);
186
187static int ada_is_unconstrained_packed_array_type (struct type *);
14f9c5c9 188
d2e4a39e 189static struct value *value_subscript_packed (struct value *, int,
4c4b4cd2 190 struct value **);
14f9c5c9 191
50810684 192static void move_bits (gdb_byte *, int, const gdb_byte *, int, int, int);
52ce6436 193
4c4b4cd2
PH
194static struct value *coerce_unspec_val_to_type (struct value *,
195 struct type *);
14f9c5c9 196
d2e4a39e 197static struct value *get_var_value (char *, char *);
14f9c5c9 198
d2e4a39e 199static int lesseq_defined_than (struct symbol *, struct symbol *);
14f9c5c9 200
d2e4a39e 201static int equiv_types (struct type *, struct type *);
14f9c5c9 202
d2e4a39e 203static int is_name_suffix (const char *);
14f9c5c9 204
73589123
PH
205static int advance_wild_match (const char **, const char *, int);
206
207static int wild_match (const char *, const char *);
14f9c5c9 208
d2e4a39e 209static struct value *ada_coerce_ref (struct value *);
14f9c5c9 210
4c4b4cd2
PH
211static LONGEST pos_atr (struct value *);
212
3cb382c9 213static struct value *value_pos_atr (struct type *, struct value *);
14f9c5c9 214
d2e4a39e 215static struct value *value_val_atr (struct type *, struct value *);
14f9c5c9 216
4c4b4cd2
PH
217static struct symbol *standard_lookup (const char *, const struct block *,
218 domain_enum);
14f9c5c9 219
4c4b4cd2
PH
220static struct value *ada_search_struct_field (char *, struct value *, int,
221 struct type *);
222
223static struct value *ada_value_primitive_field (struct value *, int, int,
224 struct type *);
225
0d5cff50 226static int find_struct_field (const char *, struct type *, int,
52ce6436 227 struct type **, int *, int *, int *, int *);
4c4b4cd2
PH
228
229static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR,
230 struct value *);
231
4c4b4cd2
PH
232static int ada_resolve_function (struct ada_symbol_info *, int,
233 struct value **, int, const char *,
234 struct type *);
235
4c4b4cd2
PH
236static int ada_is_direct_array_type (struct type *);
237
72d5681a
PH
238static void ada_language_arch_info (struct gdbarch *,
239 struct language_arch_info *);
714e53ab
PH
240
241static void check_size (const struct type *);
52ce6436
PH
242
243static struct value *ada_index_struct_field (int, struct value *, int,
244 struct type *);
245
246static struct value *assign_aggregate (struct value *, struct value *,
0963b4bd
MS
247 struct expression *,
248 int *, enum noside);
52ce6436
PH
249
250static void aggregate_assign_from_choices (struct value *, struct value *,
251 struct expression *,
252 int *, LONGEST *, int *,
253 int, LONGEST, LONGEST);
254
255static void aggregate_assign_positional (struct value *, struct value *,
256 struct expression *,
257 int *, LONGEST *, int *, int,
258 LONGEST, LONGEST);
259
260
261static void aggregate_assign_others (struct value *, struct value *,
262 struct expression *,
263 int *, LONGEST *, int, LONGEST, LONGEST);
264
265
266static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int);
267
268
269static struct value *ada_evaluate_subexp (struct type *, struct expression *,
270 int *, enum noside);
271
272static void ada_forward_operator_length (struct expression *, int, int *,
273 int *);
852dff6c
JB
274
275static struct type *ada_find_any_type (const char *name);
4c4b4cd2
PH
276\f
277
76a01679 278
4c4b4cd2 279/* Maximum-sized dynamic type. */
14f9c5c9
AS
280static unsigned int varsize_limit;
281
4c4b4cd2
PH
282/* FIXME: brobecker/2003-09-17: No longer a const because it is
283 returned by a function that does not return a const char *. */
284static char *ada_completer_word_break_characters =
285#ifdef VMS
286 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
287#else
14f9c5c9 288 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
4c4b4cd2 289#endif
14f9c5c9 290
4c4b4cd2 291/* The name of the symbol to use to get the name of the main subprogram. */
76a01679 292static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
4c4b4cd2 293 = "__gnat_ada_main_program_name";
14f9c5c9 294
4c4b4cd2
PH
295/* Limit on the number of warnings to raise per expression evaluation. */
296static int warning_limit = 2;
297
298/* Number of warning messages issued; reset to 0 by cleanups after
299 expression evaluation. */
300static int warnings_issued = 0;
301
302static const char *known_runtime_file_name_patterns[] = {
303 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
304};
305
306static const char *known_auxiliary_function_name_patterns[] = {
307 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
308};
309
310/* Space for allocating results of ada_lookup_symbol_list. */
311static struct obstack symbol_list_obstack;
312
e802dbe0
JB
313 /* Inferior-specific data. */
314
315/* Per-inferior data for this module. */
316
317struct ada_inferior_data
318{
319 /* The ada__tags__type_specific_data type, which is used when decoding
320 tagged types. With older versions of GNAT, this type was directly
321 accessible through a component ("tsd") in the object tag. But this
322 is no longer the case, so we cache it for each inferior. */
323 struct type *tsd_type;
3eecfa55
JB
324
325 /* The exception_support_info data. This data is used to determine
326 how to implement support for Ada exception catchpoints in a given
327 inferior. */
328 const struct exception_support_info *exception_info;
e802dbe0
JB
329};
330
331/* Our key to this module's inferior data. */
332static const struct inferior_data *ada_inferior_data;
333
334/* A cleanup routine for our inferior data. */
335static void
336ada_inferior_data_cleanup (struct inferior *inf, void *arg)
337{
338 struct ada_inferior_data *data;
339
340 data = inferior_data (inf, ada_inferior_data);
341 if (data != NULL)
342 xfree (data);
343}
344
345/* Return our inferior data for the given inferior (INF).
346
347 This function always returns a valid pointer to an allocated
348 ada_inferior_data structure. If INF's inferior data has not
349 been previously set, this functions creates a new one with all
350 fields set to zero, sets INF's inferior to it, and then returns
351 a pointer to that newly allocated ada_inferior_data. */
352
353static struct ada_inferior_data *
354get_ada_inferior_data (struct inferior *inf)
355{
356 struct ada_inferior_data *data;
357
358 data = inferior_data (inf, ada_inferior_data);
359 if (data == NULL)
360 {
361 data = XZALLOC (struct ada_inferior_data);
362 set_inferior_data (inf, ada_inferior_data, data);
363 }
364
365 return data;
366}
367
368/* Perform all necessary cleanups regarding our module's inferior data
369 that is required after the inferior INF just exited. */
370
371static void
372ada_inferior_exit (struct inferior *inf)
373{
374 ada_inferior_data_cleanup (inf, NULL);
375 set_inferior_data (inf, ada_inferior_data, NULL);
376}
377
4c4b4cd2
PH
378 /* Utilities */
379
720d1a40 380/* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
eed9788b 381 all typedef layers have been peeled. Otherwise, return TYPE.
720d1a40
JB
382
383 Normally, we really expect a typedef type to only have 1 typedef layer.
384 In other words, we really expect the target type of a typedef type to be
385 a non-typedef type. This is particularly true for Ada units, because
386 the language does not have a typedef vs not-typedef distinction.
387 In that respect, the Ada compiler has been trying to eliminate as many
388 typedef definitions in the debugging information, since they generally
389 do not bring any extra information (we still use typedef under certain
390 circumstances related mostly to the GNAT encoding).
391
392 Unfortunately, we have seen situations where the debugging information
393 generated by the compiler leads to such multiple typedef layers. For
394 instance, consider the following example with stabs:
395
396 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
397 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
398
399 This is an error in the debugging information which causes type
400 pck__float_array___XUP to be defined twice, and the second time,
401 it is defined as a typedef of a typedef.
402
403 This is on the fringe of legality as far as debugging information is
404 concerned, and certainly unexpected. But it is easy to handle these
405 situations correctly, so we can afford to be lenient in this case. */
406
407static struct type *
408ada_typedef_target_type (struct type *type)
409{
410 while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
411 type = TYPE_TARGET_TYPE (type);
412 return type;
413}
414
41d27058
JB
415/* Given DECODED_NAME a string holding a symbol name in its
416 decoded form (ie using the Ada dotted notation), returns
417 its unqualified name. */
418
419static const char *
420ada_unqualified_name (const char *decoded_name)
421{
422 const char *result = strrchr (decoded_name, '.');
423
424 if (result != NULL)
425 result++; /* Skip the dot... */
426 else
427 result = decoded_name;
428
429 return result;
430}
431
432/* Return a string starting with '<', followed by STR, and '>'.
433 The result is good until the next call. */
434
435static char *
436add_angle_brackets (const char *str)
437{
438 static char *result = NULL;
439
440 xfree (result);
88c15c34 441 result = xstrprintf ("<%s>", str);
41d27058
JB
442 return result;
443}
96d887e8 444
4c4b4cd2
PH
445static char *
446ada_get_gdb_completer_word_break_characters (void)
447{
448 return ada_completer_word_break_characters;
449}
450
e79af960
JB
451/* Print an array element index using the Ada syntax. */
452
453static void
454ada_print_array_index (struct value *index_value, struct ui_file *stream,
79a45b7d 455 const struct value_print_options *options)
e79af960 456{
79a45b7d 457 LA_VALUE_PRINT (index_value, stream, options);
e79af960
JB
458 fprintf_filtered (stream, " => ");
459}
460
f27cf670 461/* Assuming VECT points to an array of *SIZE objects of size
14f9c5c9 462 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
f27cf670 463 updating *SIZE as necessary and returning the (new) array. */
14f9c5c9 464
f27cf670
AS
465void *
466grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
14f9c5c9 467{
d2e4a39e
AS
468 if (*size < min_size)
469 {
470 *size *= 2;
471 if (*size < min_size)
4c4b4cd2 472 *size = min_size;
f27cf670 473 vect = xrealloc (vect, *size * element_size);
d2e4a39e 474 }
f27cf670 475 return vect;
14f9c5c9
AS
476}
477
478/* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
4c4b4cd2 479 suffix of FIELD_NAME beginning "___". */
14f9c5c9
AS
480
481static int
ebf56fd3 482field_name_match (const char *field_name, const char *target)
14f9c5c9
AS
483{
484 int len = strlen (target);
5b4ee69b 485
d2e4a39e 486 return
4c4b4cd2
PH
487 (strncmp (field_name, target, len) == 0
488 && (field_name[len] == '\0'
489 || (strncmp (field_name + len, "___", 3) == 0
76a01679
JB
490 && strcmp (field_name + strlen (field_name) - 6,
491 "___XVN") != 0)));
14f9c5c9
AS
492}
493
494
872c8b51
JB
495/* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
496 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
497 and return its index. This function also handles fields whose name
498 have ___ suffixes because the compiler sometimes alters their name
499 by adding such a suffix to represent fields with certain constraints.
500 If the field could not be found, return a negative number if
501 MAYBE_MISSING is set. Otherwise raise an error. */
4c4b4cd2
PH
502
503int
504ada_get_field_index (const struct type *type, const char *field_name,
505 int maybe_missing)
506{
507 int fieldno;
872c8b51
JB
508 struct type *struct_type = check_typedef ((struct type *) type);
509
510 for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++)
511 if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name))
4c4b4cd2
PH
512 return fieldno;
513
514 if (!maybe_missing)
323e0a4a 515 error (_("Unable to find field %s in struct %s. Aborting"),
872c8b51 516 field_name, TYPE_NAME (struct_type));
4c4b4cd2
PH
517
518 return -1;
519}
520
521/* The length of the prefix of NAME prior to any "___" suffix. */
14f9c5c9
AS
522
523int
d2e4a39e 524ada_name_prefix_len (const char *name)
14f9c5c9
AS
525{
526 if (name == NULL)
527 return 0;
d2e4a39e 528 else
14f9c5c9 529 {
d2e4a39e 530 const char *p = strstr (name, "___");
5b4ee69b 531
14f9c5c9 532 if (p == NULL)
4c4b4cd2 533 return strlen (name);
14f9c5c9 534 else
4c4b4cd2 535 return p - name;
14f9c5c9
AS
536 }
537}
538
4c4b4cd2
PH
539/* Return non-zero if SUFFIX is a suffix of STR.
540 Return zero if STR is null. */
541
14f9c5c9 542static int
d2e4a39e 543is_suffix (const char *str, const char *suffix)
14f9c5c9
AS
544{
545 int len1, len2;
5b4ee69b 546
14f9c5c9
AS
547 if (str == NULL)
548 return 0;
549 len1 = strlen (str);
550 len2 = strlen (suffix);
4c4b4cd2 551 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
14f9c5c9
AS
552}
553
4c4b4cd2
PH
554/* The contents of value VAL, treated as a value of type TYPE. The
555 result is an lval in memory if VAL is. */
14f9c5c9 556
d2e4a39e 557static struct value *
4c4b4cd2 558coerce_unspec_val_to_type (struct value *val, struct type *type)
14f9c5c9 559{
61ee279c 560 type = ada_check_typedef (type);
df407dfe 561 if (value_type (val) == type)
4c4b4cd2 562 return val;
d2e4a39e 563 else
14f9c5c9 564 {
4c4b4cd2
PH
565 struct value *result;
566
567 /* Make sure that the object size is not unreasonable before
568 trying to allocate some memory for it. */
714e53ab 569 check_size (type);
4c4b4cd2 570
41e8491f
JK
571 if (value_lazy (val)
572 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
573 result = allocate_value_lazy (type);
574 else
575 {
576 result = allocate_value (type);
577 memcpy (value_contents_raw (result), value_contents (val),
578 TYPE_LENGTH (type));
579 }
74bcbdf3 580 set_value_component_location (result, val);
9bbda503
AC
581 set_value_bitsize (result, value_bitsize (val));
582 set_value_bitpos (result, value_bitpos (val));
42ae5230 583 set_value_address (result, value_address (val));
2fa15f23 584 set_value_optimized_out (result, value_optimized_out (val));
14f9c5c9
AS
585 return result;
586 }
587}
588
fc1a4b47
AC
589static const gdb_byte *
590cond_offset_host (const gdb_byte *valaddr, long offset)
14f9c5c9
AS
591{
592 if (valaddr == NULL)
593 return NULL;
594 else
595 return valaddr + offset;
596}
597
598static CORE_ADDR
ebf56fd3 599cond_offset_target (CORE_ADDR address, long offset)
14f9c5c9
AS
600{
601 if (address == 0)
602 return 0;
d2e4a39e 603 else
14f9c5c9
AS
604 return address + offset;
605}
606
4c4b4cd2
PH
607/* Issue a warning (as for the definition of warning in utils.c, but
608 with exactly one argument rather than ...), unless the limit on the
609 number of warnings has passed during the evaluation of the current
610 expression. */
a2249542 611
77109804
AC
612/* FIXME: cagney/2004-10-10: This function is mimicking the behavior
613 provided by "complaint". */
a0b31db1 614static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2);
77109804 615
14f9c5c9 616static void
a2249542 617lim_warning (const char *format, ...)
14f9c5c9 618{
a2249542 619 va_list args;
a2249542 620
5b4ee69b 621 va_start (args, format);
4c4b4cd2
PH
622 warnings_issued += 1;
623 if (warnings_issued <= warning_limit)
a2249542
MK
624 vwarning (format, args);
625
626 va_end (args);
4c4b4cd2
PH
627}
628
714e53ab
PH
629/* Issue an error if the size of an object of type T is unreasonable,
630 i.e. if it would be a bad idea to allocate a value of this type in
631 GDB. */
632
633static void
634check_size (const struct type *type)
635{
636 if (TYPE_LENGTH (type) > varsize_limit)
323e0a4a 637 error (_("object size is larger than varsize-limit"));
714e53ab
PH
638}
639
0963b4bd 640/* Maximum value of a SIZE-byte signed integer type. */
4c4b4cd2 641static LONGEST
c3e5cd34 642max_of_size (int size)
4c4b4cd2 643{
76a01679 644 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
5b4ee69b 645
76a01679 646 return top_bit | (top_bit - 1);
4c4b4cd2
PH
647}
648
0963b4bd 649/* Minimum value of a SIZE-byte signed integer type. */
4c4b4cd2 650static LONGEST
c3e5cd34 651min_of_size (int size)
4c4b4cd2 652{
c3e5cd34 653 return -max_of_size (size) - 1;
4c4b4cd2
PH
654}
655
0963b4bd 656/* Maximum value of a SIZE-byte unsigned integer type. */
4c4b4cd2 657static ULONGEST
c3e5cd34 658umax_of_size (int size)
4c4b4cd2 659{
76a01679 660 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
5b4ee69b 661
76a01679 662 return top_bit | (top_bit - 1);
4c4b4cd2
PH
663}
664
0963b4bd 665/* Maximum value of integral type T, as a signed quantity. */
c3e5cd34
PH
666static LONGEST
667max_of_type (struct type *t)
4c4b4cd2 668{
c3e5cd34
PH
669 if (TYPE_UNSIGNED (t))
670 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
671 else
672 return max_of_size (TYPE_LENGTH (t));
673}
674
0963b4bd 675/* Minimum value of integral type T, as a signed quantity. */
c3e5cd34
PH
676static LONGEST
677min_of_type (struct type *t)
678{
679 if (TYPE_UNSIGNED (t))
680 return 0;
681 else
682 return min_of_size (TYPE_LENGTH (t));
4c4b4cd2
PH
683}
684
685/* The largest value in the domain of TYPE, a discrete type, as an integer. */
43bbcdc2
PH
686LONGEST
687ada_discrete_type_high_bound (struct type *type)
4c4b4cd2 688{
76a01679 689 switch (TYPE_CODE (type))
4c4b4cd2
PH
690 {
691 case TYPE_CODE_RANGE:
690cc4eb 692 return TYPE_HIGH_BOUND (type);
4c4b4cd2 693 case TYPE_CODE_ENUM:
14e75d8e 694 return TYPE_FIELD_ENUMVAL (type, TYPE_NFIELDS (type) - 1);
690cc4eb
PH
695 case TYPE_CODE_BOOL:
696 return 1;
697 case TYPE_CODE_CHAR:
76a01679 698 case TYPE_CODE_INT:
690cc4eb 699 return max_of_type (type);
4c4b4cd2 700 default:
43bbcdc2 701 error (_("Unexpected type in ada_discrete_type_high_bound."));
4c4b4cd2
PH
702 }
703}
704
14e75d8e 705/* The smallest value in the domain of TYPE, a discrete type, as an integer. */
43bbcdc2
PH
706LONGEST
707ada_discrete_type_low_bound (struct type *type)
4c4b4cd2 708{
76a01679 709 switch (TYPE_CODE (type))
4c4b4cd2
PH
710 {
711 case TYPE_CODE_RANGE:
690cc4eb 712 return TYPE_LOW_BOUND (type);
4c4b4cd2 713 case TYPE_CODE_ENUM:
14e75d8e 714 return TYPE_FIELD_ENUMVAL (type, 0);
690cc4eb
PH
715 case TYPE_CODE_BOOL:
716 return 0;
717 case TYPE_CODE_CHAR:
76a01679 718 case TYPE_CODE_INT:
690cc4eb 719 return min_of_type (type);
4c4b4cd2 720 default:
43bbcdc2 721 error (_("Unexpected type in ada_discrete_type_low_bound."));
4c4b4cd2
PH
722 }
723}
724
725/* The identity on non-range types. For range types, the underlying
76a01679 726 non-range scalar type. */
4c4b4cd2
PH
727
728static struct type *
18af8284 729get_base_type (struct type *type)
4c4b4cd2
PH
730{
731 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
732 {
76a01679
JB
733 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
734 return type;
4c4b4cd2
PH
735 type = TYPE_TARGET_TYPE (type);
736 }
737 return type;
14f9c5c9 738}
41246937
JB
739
740/* Return a decoded version of the given VALUE. This means returning
741 a value whose type is obtained by applying all the GNAT-specific
742 encondings, making the resulting type a static but standard description
743 of the initial type. */
744
745struct value *
746ada_get_decoded_value (struct value *value)
747{
748 struct type *type = ada_check_typedef (value_type (value));
749
750 if (ada_is_array_descriptor_type (type)
751 || (ada_is_constrained_packed_array_type (type)
752 && TYPE_CODE (type) != TYPE_CODE_PTR))
753 {
754 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) /* array access type. */
755 value = ada_coerce_to_simple_array_ptr (value);
756 else
757 value = ada_coerce_to_simple_array (value);
758 }
759 else
760 value = ada_to_fixed_value (value);
761
762 return value;
763}
764
765/* Same as ada_get_decoded_value, but with the given TYPE.
766 Because there is no associated actual value for this type,
767 the resulting type might be a best-effort approximation in
768 the case of dynamic types. */
769
770struct type *
771ada_get_decoded_type (struct type *type)
772{
773 type = to_static_fixed_type (type);
774 if (ada_is_constrained_packed_array_type (type))
775 type = ada_coerce_to_simple_array_type (type);
776 return type;
777}
778
4c4b4cd2 779\f
76a01679 780
4c4b4cd2 781 /* Language Selection */
14f9c5c9
AS
782
783/* If the main program is in Ada, return language_ada, otherwise return LANG
ccefe4c4 784 (the main program is in Ada iif the adainit symbol is found). */
d2e4a39e 785
14f9c5c9 786enum language
ccefe4c4 787ada_update_initial_language (enum language lang)
14f9c5c9 788{
d2e4a39e 789 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
4c4b4cd2
PH
790 (struct objfile *) NULL) != NULL)
791 return language_ada;
14f9c5c9
AS
792
793 return lang;
794}
96d887e8
PH
795
796/* If the main procedure is written in Ada, then return its name.
797 The result is good until the next call. Return NULL if the main
798 procedure doesn't appear to be in Ada. */
799
800char *
801ada_main_name (void)
802{
803 struct minimal_symbol *msym;
f9bc20b9 804 static char *main_program_name = NULL;
6c038f32 805
96d887e8
PH
806 /* For Ada, the name of the main procedure is stored in a specific
807 string constant, generated by the binder. Look for that symbol,
808 extract its address, and then read that string. If we didn't find
809 that string, then most probably the main procedure is not written
810 in Ada. */
811 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
812
813 if (msym != NULL)
814 {
f9bc20b9
JB
815 CORE_ADDR main_program_name_addr;
816 int err_code;
817
96d887e8
PH
818 main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
819 if (main_program_name_addr == 0)
323e0a4a 820 error (_("Invalid address for Ada main program name."));
96d887e8 821
f9bc20b9
JB
822 xfree (main_program_name);
823 target_read_string (main_program_name_addr, &main_program_name,
824 1024, &err_code);
825
826 if (err_code != 0)
827 return NULL;
96d887e8
PH
828 return main_program_name;
829 }
830
831 /* The main procedure doesn't seem to be in Ada. */
832 return NULL;
833}
14f9c5c9 834\f
4c4b4cd2 835 /* Symbols */
d2e4a39e 836
4c4b4cd2
PH
837/* Table of Ada operators and their GNAT-encoded names. Last entry is pair
838 of NULLs. */
14f9c5c9 839
d2e4a39e
AS
840const struct ada_opname_map ada_opname_table[] = {
841 {"Oadd", "\"+\"", BINOP_ADD},
842 {"Osubtract", "\"-\"", BINOP_SUB},
843 {"Omultiply", "\"*\"", BINOP_MUL},
844 {"Odivide", "\"/\"", BINOP_DIV},
845 {"Omod", "\"mod\"", BINOP_MOD},
846 {"Orem", "\"rem\"", BINOP_REM},
847 {"Oexpon", "\"**\"", BINOP_EXP},
848 {"Olt", "\"<\"", BINOP_LESS},
849 {"Ole", "\"<=\"", BINOP_LEQ},
850 {"Ogt", "\">\"", BINOP_GTR},
851 {"Oge", "\">=\"", BINOP_GEQ},
852 {"Oeq", "\"=\"", BINOP_EQUAL},
853 {"One", "\"/=\"", BINOP_NOTEQUAL},
854 {"Oand", "\"and\"", BINOP_BITWISE_AND},
855 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
856 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
857 {"Oconcat", "\"&\"", BINOP_CONCAT},
858 {"Oabs", "\"abs\"", UNOP_ABS},
859 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
860 {"Oadd", "\"+\"", UNOP_PLUS},
861 {"Osubtract", "\"-\"", UNOP_NEG},
862 {NULL, NULL}
14f9c5c9
AS
863};
864
4c4b4cd2
PH
865/* The "encoded" form of DECODED, according to GNAT conventions.
866 The result is valid until the next call to ada_encode. */
867
14f9c5c9 868char *
4c4b4cd2 869ada_encode (const char *decoded)
14f9c5c9 870{
4c4b4cd2
PH
871 static char *encoding_buffer = NULL;
872 static size_t encoding_buffer_size = 0;
d2e4a39e 873 const char *p;
14f9c5c9 874 int k;
d2e4a39e 875
4c4b4cd2 876 if (decoded == NULL)
14f9c5c9
AS
877 return NULL;
878
4c4b4cd2
PH
879 GROW_VECT (encoding_buffer, encoding_buffer_size,
880 2 * strlen (decoded) + 10);
14f9c5c9
AS
881
882 k = 0;
4c4b4cd2 883 for (p = decoded; *p != '\0'; p += 1)
14f9c5c9 884 {
cdc7bb92 885 if (*p == '.')
4c4b4cd2
PH
886 {
887 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
888 k += 2;
889 }
14f9c5c9 890 else if (*p == '"')
4c4b4cd2
PH
891 {
892 const struct ada_opname_map *mapping;
893
894 for (mapping = ada_opname_table;
1265e4aa
JB
895 mapping->encoded != NULL
896 && strncmp (mapping->decoded, p,
897 strlen (mapping->decoded)) != 0; mapping += 1)
4c4b4cd2
PH
898 ;
899 if (mapping->encoded == NULL)
323e0a4a 900 error (_("invalid Ada operator name: %s"), p);
4c4b4cd2
PH
901 strcpy (encoding_buffer + k, mapping->encoded);
902 k += strlen (mapping->encoded);
903 break;
904 }
d2e4a39e 905 else
4c4b4cd2
PH
906 {
907 encoding_buffer[k] = *p;
908 k += 1;
909 }
14f9c5c9
AS
910 }
911
4c4b4cd2
PH
912 encoding_buffer[k] = '\0';
913 return encoding_buffer;
14f9c5c9
AS
914}
915
916/* Return NAME folded to lower case, or, if surrounded by single
4c4b4cd2
PH
917 quotes, unfolded, but with the quotes stripped away. Result good
918 to next call. */
919
d2e4a39e
AS
920char *
921ada_fold_name (const char *name)
14f9c5c9 922{
d2e4a39e 923 static char *fold_buffer = NULL;
14f9c5c9
AS
924 static size_t fold_buffer_size = 0;
925
926 int len = strlen (name);
d2e4a39e 927 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
14f9c5c9
AS
928
929 if (name[0] == '\'')
930 {
d2e4a39e
AS
931 strncpy (fold_buffer, name + 1, len - 2);
932 fold_buffer[len - 2] = '\000';
14f9c5c9
AS
933 }
934 else
935 {
936 int i;
5b4ee69b 937
14f9c5c9 938 for (i = 0; i <= len; i += 1)
4c4b4cd2 939 fold_buffer[i] = tolower (name[i]);
14f9c5c9
AS
940 }
941
942 return fold_buffer;
943}
944
529cad9c
PH
945/* Return nonzero if C is either a digit or a lowercase alphabet character. */
946
947static int
948is_lower_alphanum (const char c)
949{
950 return (isdigit (c) || (isalpha (c) && islower (c)));
951}
952
c90092fe
JB
953/* ENCODED is the linkage name of a symbol and LEN contains its length.
954 This function saves in LEN the length of that same symbol name but
955 without either of these suffixes:
29480c32
JB
956 . .{DIGIT}+
957 . ${DIGIT}+
958 . ___{DIGIT}+
959 . __{DIGIT}+.
c90092fe 960
29480c32
JB
961 These are suffixes introduced by the compiler for entities such as
962 nested subprogram for instance, in order to avoid name clashes.
963 They do not serve any purpose for the debugger. */
964
965static void
966ada_remove_trailing_digits (const char *encoded, int *len)
967{
968 if (*len > 1 && isdigit (encoded[*len - 1]))
969 {
970 int i = *len - 2;
5b4ee69b 971
29480c32
JB
972 while (i > 0 && isdigit (encoded[i]))
973 i--;
974 if (i >= 0 && encoded[i] == '.')
975 *len = i;
976 else if (i >= 0 && encoded[i] == '$')
977 *len = i;
978 else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
979 *len = i - 2;
980 else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
981 *len = i - 1;
982 }
983}
984
985/* Remove the suffix introduced by the compiler for protected object
986 subprograms. */
987
988static void
989ada_remove_po_subprogram_suffix (const char *encoded, int *len)
990{
991 /* Remove trailing N. */
992
993 /* Protected entry subprograms are broken into two
994 separate subprograms: The first one is unprotected, and has
995 a 'N' suffix; the second is the protected version, and has
0963b4bd 996 the 'P' suffix. The second calls the first one after handling
29480c32
JB
997 the protection. Since the P subprograms are internally generated,
998 we leave these names undecoded, giving the user a clue that this
999 entity is internal. */
1000
1001 if (*len > 1
1002 && encoded[*len - 1] == 'N'
1003 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
1004 *len = *len - 1;
1005}
1006
69fadcdf
JB
1007/* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1008
1009static void
1010ada_remove_Xbn_suffix (const char *encoded, int *len)
1011{
1012 int i = *len - 1;
1013
1014 while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n'))
1015 i--;
1016
1017 if (encoded[i] != 'X')
1018 return;
1019
1020 if (i == 0)
1021 return;
1022
1023 if (isalnum (encoded[i-1]))
1024 *len = i;
1025}
1026
29480c32
JB
1027/* If ENCODED follows the GNAT entity encoding conventions, then return
1028 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1029 replaced by ENCODED.
14f9c5c9 1030
4c4b4cd2 1031 The resulting string is valid until the next call of ada_decode.
29480c32 1032 If the string is unchanged by decoding, the original string pointer
4c4b4cd2
PH
1033 is returned. */
1034
1035const char *
1036ada_decode (const char *encoded)
14f9c5c9
AS
1037{
1038 int i, j;
1039 int len0;
d2e4a39e 1040 const char *p;
4c4b4cd2 1041 char *decoded;
14f9c5c9 1042 int at_start_name;
4c4b4cd2
PH
1043 static char *decoding_buffer = NULL;
1044 static size_t decoding_buffer_size = 0;
d2e4a39e 1045
29480c32
JB
1046 /* The name of the Ada main procedure starts with "_ada_".
1047 This prefix is not part of the decoded name, so skip this part
1048 if we see this prefix. */
4c4b4cd2
PH
1049 if (strncmp (encoded, "_ada_", 5) == 0)
1050 encoded += 5;
14f9c5c9 1051
29480c32
JB
1052 /* If the name starts with '_', then it is not a properly encoded
1053 name, so do not attempt to decode it. Similarly, if the name
1054 starts with '<', the name should not be decoded. */
4c4b4cd2 1055 if (encoded[0] == '_' || encoded[0] == '<')
14f9c5c9
AS
1056 goto Suppress;
1057
4c4b4cd2 1058 len0 = strlen (encoded);
4c4b4cd2 1059
29480c32
JB
1060 ada_remove_trailing_digits (encoded, &len0);
1061 ada_remove_po_subprogram_suffix (encoded, &len0);
529cad9c 1062
4c4b4cd2
PH
1063 /* Remove the ___X.* suffix if present. Do not forget to verify that
1064 the suffix is located before the current "end" of ENCODED. We want
1065 to avoid re-matching parts of ENCODED that have previously been
1066 marked as discarded (by decrementing LEN0). */
1067 p = strstr (encoded, "___");
1068 if (p != NULL && p - encoded < len0 - 3)
14f9c5c9
AS
1069 {
1070 if (p[3] == 'X')
4c4b4cd2 1071 len0 = p - encoded;
14f9c5c9 1072 else
4c4b4cd2 1073 goto Suppress;
14f9c5c9 1074 }
4c4b4cd2 1075
29480c32
JB
1076 /* Remove any trailing TKB suffix. It tells us that this symbol
1077 is for the body of a task, but that information does not actually
1078 appear in the decoded name. */
1079
4c4b4cd2 1080 if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
14f9c5c9 1081 len0 -= 3;
76a01679 1082
a10967fa
JB
1083 /* Remove any trailing TB suffix. The TB suffix is slightly different
1084 from the TKB suffix because it is used for non-anonymous task
1085 bodies. */
1086
1087 if (len0 > 2 && strncmp (encoded + len0 - 2, "TB", 2) == 0)
1088 len0 -= 2;
1089
29480c32
JB
1090 /* Remove trailing "B" suffixes. */
1091 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1092
4c4b4cd2 1093 if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
14f9c5c9
AS
1094 len0 -= 1;
1095
4c4b4cd2 1096 /* Make decoded big enough for possible expansion by operator name. */
29480c32 1097
4c4b4cd2
PH
1098 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
1099 decoded = decoding_buffer;
14f9c5c9 1100
29480c32
JB
1101 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1102
4c4b4cd2 1103 if (len0 > 1 && isdigit (encoded[len0 - 1]))
d2e4a39e 1104 {
4c4b4cd2
PH
1105 i = len0 - 2;
1106 while ((i >= 0 && isdigit (encoded[i]))
1107 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
1108 i -= 1;
1109 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
1110 len0 = i - 1;
1111 else if (encoded[i] == '$')
1112 len0 = i;
d2e4a39e 1113 }
14f9c5c9 1114
29480c32
JB
1115 /* The first few characters that are not alphabetic are not part
1116 of any encoding we use, so we can copy them over verbatim. */
1117
4c4b4cd2
PH
1118 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
1119 decoded[j] = encoded[i];
14f9c5c9
AS
1120
1121 at_start_name = 1;
1122 while (i < len0)
1123 {
29480c32 1124 /* Is this a symbol function? */
4c4b4cd2
PH
1125 if (at_start_name && encoded[i] == 'O')
1126 {
1127 int k;
5b4ee69b 1128
4c4b4cd2
PH
1129 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
1130 {
1131 int op_len = strlen (ada_opname_table[k].encoded);
06d5cf63
JB
1132 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
1133 op_len - 1) == 0)
1134 && !isalnum (encoded[i + op_len]))
4c4b4cd2
PH
1135 {
1136 strcpy (decoded + j, ada_opname_table[k].decoded);
1137 at_start_name = 0;
1138 i += op_len;
1139 j += strlen (ada_opname_table[k].decoded);
1140 break;
1141 }
1142 }
1143 if (ada_opname_table[k].encoded != NULL)
1144 continue;
1145 }
14f9c5c9
AS
1146 at_start_name = 0;
1147
529cad9c
PH
1148 /* Replace "TK__" with "__", which will eventually be translated
1149 into "." (just below). */
1150
4c4b4cd2
PH
1151 if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
1152 i += 2;
529cad9c 1153
29480c32
JB
1154 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1155 be translated into "." (just below). These are internal names
1156 generated for anonymous blocks inside which our symbol is nested. */
1157
1158 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
1159 && encoded [i+2] == 'B' && encoded [i+3] == '_'
1160 && isdigit (encoded [i+4]))
1161 {
1162 int k = i + 5;
1163
1164 while (k < len0 && isdigit (encoded[k]))
1165 k++; /* Skip any extra digit. */
1166
1167 /* Double-check that the "__B_{DIGITS}+" sequence we found
1168 is indeed followed by "__". */
1169 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1170 i = k;
1171 }
1172
529cad9c
PH
1173 /* Remove _E{DIGITS}+[sb] */
1174
1175 /* Just as for protected object subprograms, there are 2 categories
0963b4bd 1176 of subprograms created by the compiler for each entry. The first
529cad9c
PH
1177 one implements the actual entry code, and has a suffix following
1178 the convention above; the second one implements the barrier and
1179 uses the same convention as above, except that the 'E' is replaced
1180 by a 'B'.
1181
1182 Just as above, we do not decode the name of barrier functions
1183 to give the user a clue that the code he is debugging has been
1184 internally generated. */
1185
1186 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1187 && isdigit (encoded[i+2]))
1188 {
1189 int k = i + 3;
1190
1191 while (k < len0 && isdigit (encoded[k]))
1192 k++;
1193
1194 if (k < len0
1195 && (encoded[k] == 'b' || encoded[k] == 's'))
1196 {
1197 k++;
1198 /* Just as an extra precaution, make sure that if this
1199 suffix is followed by anything else, it is a '_'.
1200 Otherwise, we matched this sequence by accident. */
1201 if (k == len0
1202 || (k < len0 && encoded[k] == '_'))
1203 i = k;
1204 }
1205 }
1206
1207 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1208 the GNAT front-end in protected object subprograms. */
1209
1210 if (i < len0 + 3
1211 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1212 {
1213 /* Backtrack a bit up until we reach either the begining of
1214 the encoded name, or "__". Make sure that we only find
1215 digits or lowercase characters. */
1216 const char *ptr = encoded + i - 1;
1217
1218 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1219 ptr--;
1220 if (ptr < encoded
1221 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1222 i++;
1223 }
1224
4c4b4cd2
PH
1225 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1226 {
29480c32
JB
1227 /* This is a X[bn]* sequence not separated from the previous
1228 part of the name with a non-alpha-numeric character (in other
1229 words, immediately following an alpha-numeric character), then
1230 verify that it is placed at the end of the encoded name. If
1231 not, then the encoding is not valid and we should abort the
1232 decoding. Otherwise, just skip it, it is used in body-nested
1233 package names. */
4c4b4cd2
PH
1234 do
1235 i += 1;
1236 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1237 if (i < len0)
1238 goto Suppress;
1239 }
cdc7bb92 1240 else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
4c4b4cd2 1241 {
29480c32 1242 /* Replace '__' by '.'. */
4c4b4cd2
PH
1243 decoded[j] = '.';
1244 at_start_name = 1;
1245 i += 2;
1246 j += 1;
1247 }
14f9c5c9 1248 else
4c4b4cd2 1249 {
29480c32
JB
1250 /* It's a character part of the decoded name, so just copy it
1251 over. */
4c4b4cd2
PH
1252 decoded[j] = encoded[i];
1253 i += 1;
1254 j += 1;
1255 }
14f9c5c9 1256 }
4c4b4cd2 1257 decoded[j] = '\000';
14f9c5c9 1258
29480c32
JB
1259 /* Decoded names should never contain any uppercase character.
1260 Double-check this, and abort the decoding if we find one. */
1261
4c4b4cd2
PH
1262 for (i = 0; decoded[i] != '\0'; i += 1)
1263 if (isupper (decoded[i]) || decoded[i] == ' ')
14f9c5c9
AS
1264 goto Suppress;
1265
4c4b4cd2
PH
1266 if (strcmp (decoded, encoded) == 0)
1267 return encoded;
1268 else
1269 return decoded;
14f9c5c9
AS
1270
1271Suppress:
4c4b4cd2
PH
1272 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1273 decoded = decoding_buffer;
1274 if (encoded[0] == '<')
1275 strcpy (decoded, encoded);
14f9c5c9 1276 else
88c15c34 1277 xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded);
4c4b4cd2
PH
1278 return decoded;
1279
1280}
1281
1282/* Table for keeping permanent unique copies of decoded names. Once
1283 allocated, names in this table are never released. While this is a
1284 storage leak, it should not be significant unless there are massive
1285 changes in the set of decoded names in successive versions of a
1286 symbol table loaded during a single session. */
1287static struct htab *decoded_names_store;
1288
1289/* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1290 in the language-specific part of GSYMBOL, if it has not been
1291 previously computed. Tries to save the decoded name in the same
1292 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1293 in any case, the decoded symbol has a lifetime at least that of
0963b4bd 1294 GSYMBOL).
4c4b4cd2
PH
1295 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1296 const, but nevertheless modified to a semantically equivalent form
0963b4bd 1297 when a decoded name is cached in it. */
4c4b4cd2 1298
76a01679
JB
1299char *
1300ada_decode_symbol (const struct general_symbol_info *gsymbol)
4c4b4cd2 1301{
76a01679 1302 char **resultp =
afa16725 1303 (char **) &gsymbol->language_specific.mangled_lang.demangled_name;
5b4ee69b 1304
4c4b4cd2
PH
1305 if (*resultp == NULL)
1306 {
1307 const char *decoded = ada_decode (gsymbol->name);
5b4ee69b 1308
714835d5 1309 if (gsymbol->obj_section != NULL)
76a01679 1310 {
714835d5 1311 struct objfile *objf = gsymbol->obj_section->objfile;
5b4ee69b 1312
714835d5
UW
1313 *resultp = obsavestring (decoded, strlen (decoded),
1314 &objf->objfile_obstack);
76a01679 1315 }
4c4b4cd2 1316 /* Sometimes, we can't find a corresponding objfile, in which
76a01679
JB
1317 case, we put the result on the heap. Since we only decode
1318 when needed, we hope this usually does not cause a
1319 significant memory leak (FIXME). */
4c4b4cd2 1320 if (*resultp == NULL)
76a01679
JB
1321 {
1322 char **slot = (char **) htab_find_slot (decoded_names_store,
1323 decoded, INSERT);
5b4ee69b 1324
76a01679
JB
1325 if (*slot == NULL)
1326 *slot = xstrdup (decoded);
1327 *resultp = *slot;
1328 }
4c4b4cd2 1329 }
14f9c5c9 1330
4c4b4cd2
PH
1331 return *resultp;
1332}
76a01679 1333
2c0b251b 1334static char *
76a01679 1335ada_la_decode (const char *encoded, int options)
4c4b4cd2
PH
1336{
1337 return xstrdup (ada_decode (encoded));
14f9c5c9
AS
1338}
1339
1340/* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
4c4b4cd2
PH
1341 suffixes that encode debugging information or leading _ada_ on
1342 SYM_NAME (see is_name_suffix commentary for the debugging
1343 information that is ignored). If WILD, then NAME need only match a
1344 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1345 either argument is NULL. */
14f9c5c9 1346
2c0b251b 1347static int
40658b94 1348match_name (const char *sym_name, const char *name, int wild)
14f9c5c9
AS
1349{
1350 if (sym_name == NULL || name == NULL)
1351 return 0;
1352 else if (wild)
73589123 1353 return wild_match (sym_name, name) == 0;
d2e4a39e
AS
1354 else
1355 {
1356 int len_name = strlen (name);
5b4ee69b 1357
4c4b4cd2
PH
1358 return (strncmp (sym_name, name, len_name) == 0
1359 && is_name_suffix (sym_name + len_name))
1360 || (strncmp (sym_name, "_ada_", 5) == 0
1361 && strncmp (sym_name + 5, name, len_name) == 0
1362 && is_name_suffix (sym_name + len_name + 5));
d2e4a39e 1363 }
14f9c5c9 1364}
14f9c5c9 1365\f
d2e4a39e 1366
4c4b4cd2 1367 /* Arrays */
14f9c5c9 1368
28c85d6c
JB
1369/* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1370 generated by the GNAT compiler to describe the index type used
1371 for each dimension of an array, check whether it follows the latest
1372 known encoding. If not, fix it up to conform to the latest encoding.
1373 Otherwise, do nothing. This function also does nothing if
1374 INDEX_DESC_TYPE is NULL.
1375
1376 The GNAT encoding used to describle the array index type evolved a bit.
1377 Initially, the information would be provided through the name of each
1378 field of the structure type only, while the type of these fields was
1379 described as unspecified and irrelevant. The debugger was then expected
1380 to perform a global type lookup using the name of that field in order
1381 to get access to the full index type description. Because these global
1382 lookups can be very expensive, the encoding was later enhanced to make
1383 the global lookup unnecessary by defining the field type as being
1384 the full index type description.
1385
1386 The purpose of this routine is to allow us to support older versions
1387 of the compiler by detecting the use of the older encoding, and by
1388 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1389 we essentially replace each field's meaningless type by the associated
1390 index subtype). */
1391
1392void
1393ada_fixup_array_indexes_type (struct type *index_desc_type)
1394{
1395 int i;
1396
1397 if (index_desc_type == NULL)
1398 return;
1399 gdb_assert (TYPE_NFIELDS (index_desc_type) > 0);
1400
1401 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1402 to check one field only, no need to check them all). If not, return
1403 now.
1404
1405 If our INDEX_DESC_TYPE was generated using the older encoding,
1406 the field type should be a meaningless integer type whose name
1407 is not equal to the field name. */
1408 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL
1409 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)),
1410 TYPE_FIELD_NAME (index_desc_type, 0)) == 0)
1411 return;
1412
1413 /* Fixup each field of INDEX_DESC_TYPE. */
1414 for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++)
1415 {
0d5cff50 1416 const char *name = TYPE_FIELD_NAME (index_desc_type, i);
28c85d6c
JB
1417 struct type *raw_type = ada_check_typedef (ada_find_any_type (name));
1418
1419 if (raw_type)
1420 TYPE_FIELD_TYPE (index_desc_type, i) = raw_type;
1421 }
1422}
1423
4c4b4cd2 1424/* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
14f9c5c9 1425
d2e4a39e
AS
1426static char *bound_name[] = {
1427 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
14f9c5c9
AS
1428 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1429};
1430
1431/* Maximum number of array dimensions we are prepared to handle. */
1432
4c4b4cd2 1433#define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
14f9c5c9 1434
14f9c5c9 1435
4c4b4cd2
PH
1436/* The desc_* routines return primitive portions of array descriptors
1437 (fat pointers). */
14f9c5c9
AS
1438
1439/* The descriptor or array type, if any, indicated by TYPE; removes
4c4b4cd2
PH
1440 level of indirection, if needed. */
1441
d2e4a39e
AS
1442static struct type *
1443desc_base_type (struct type *type)
14f9c5c9
AS
1444{
1445 if (type == NULL)
1446 return NULL;
61ee279c 1447 type = ada_check_typedef (type);
720d1a40
JB
1448 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
1449 type = ada_typedef_target_type (type);
1450
1265e4aa
JB
1451 if (type != NULL
1452 && (TYPE_CODE (type) == TYPE_CODE_PTR
1453 || TYPE_CODE (type) == TYPE_CODE_REF))
61ee279c 1454 return ada_check_typedef (TYPE_TARGET_TYPE (type));
14f9c5c9
AS
1455 else
1456 return type;
1457}
1458
4c4b4cd2
PH
1459/* True iff TYPE indicates a "thin" array pointer type. */
1460
14f9c5c9 1461static int
d2e4a39e 1462is_thin_pntr (struct type *type)
14f9c5c9 1463{
d2e4a39e 1464 return
14f9c5c9
AS
1465 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1466 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1467}
1468
4c4b4cd2
PH
1469/* The descriptor type for thin pointer type TYPE. */
1470
d2e4a39e
AS
1471static struct type *
1472thin_descriptor_type (struct type *type)
14f9c5c9 1473{
d2e4a39e 1474 struct type *base_type = desc_base_type (type);
5b4ee69b 1475
14f9c5c9
AS
1476 if (base_type == NULL)
1477 return NULL;
1478 if (is_suffix (ada_type_name (base_type), "___XVE"))
1479 return base_type;
d2e4a39e 1480 else
14f9c5c9 1481 {
d2e4a39e 1482 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
5b4ee69b 1483
14f9c5c9 1484 if (alt_type == NULL)
4c4b4cd2 1485 return base_type;
14f9c5c9 1486 else
4c4b4cd2 1487 return alt_type;
14f9c5c9
AS
1488 }
1489}
1490
4c4b4cd2
PH
1491/* A pointer to the array data for thin-pointer value VAL. */
1492
d2e4a39e
AS
1493static struct value *
1494thin_data_pntr (struct value *val)
14f9c5c9 1495{
828292f2 1496 struct type *type = ada_check_typedef (value_type (val));
556bdfd4 1497 struct type *data_type = desc_data_target_type (thin_descriptor_type (type));
5b4ee69b 1498
556bdfd4
UW
1499 data_type = lookup_pointer_type (data_type);
1500
14f9c5c9 1501 if (TYPE_CODE (type) == TYPE_CODE_PTR)
556bdfd4 1502 return value_cast (data_type, value_copy (val));
d2e4a39e 1503 else
42ae5230 1504 return value_from_longest (data_type, value_address (val));
14f9c5c9
AS
1505}
1506
4c4b4cd2
PH
1507/* True iff TYPE indicates a "thick" array pointer type. */
1508
14f9c5c9 1509static int
d2e4a39e 1510is_thick_pntr (struct type *type)
14f9c5c9
AS
1511{
1512 type = desc_base_type (type);
1513 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
4c4b4cd2 1514 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
14f9c5c9
AS
1515}
1516
4c4b4cd2
PH
1517/* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1518 pointer to one, the type of its bounds data; otherwise, NULL. */
76a01679 1519
d2e4a39e
AS
1520static struct type *
1521desc_bounds_type (struct type *type)
14f9c5c9 1522{
d2e4a39e 1523 struct type *r;
14f9c5c9
AS
1524
1525 type = desc_base_type (type);
1526
1527 if (type == NULL)
1528 return NULL;
1529 else if (is_thin_pntr (type))
1530 {
1531 type = thin_descriptor_type (type);
1532 if (type == NULL)
4c4b4cd2 1533 return NULL;
14f9c5c9
AS
1534 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1535 if (r != NULL)
61ee279c 1536 return ada_check_typedef (r);
14f9c5c9
AS
1537 }
1538 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1539 {
1540 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1541 if (r != NULL)
61ee279c 1542 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
14f9c5c9
AS
1543 }
1544 return NULL;
1545}
1546
1547/* If ARR is an array descriptor (fat or thin pointer), or pointer to
4c4b4cd2
PH
1548 one, a pointer to its bounds data. Otherwise NULL. */
1549
d2e4a39e
AS
1550static struct value *
1551desc_bounds (struct value *arr)
14f9c5c9 1552{
df407dfe 1553 struct type *type = ada_check_typedef (value_type (arr));
5b4ee69b 1554
d2e4a39e 1555 if (is_thin_pntr (type))
14f9c5c9 1556 {
d2e4a39e 1557 struct type *bounds_type =
4c4b4cd2 1558 desc_bounds_type (thin_descriptor_type (type));
14f9c5c9
AS
1559 LONGEST addr;
1560
4cdfadb1 1561 if (bounds_type == NULL)
323e0a4a 1562 error (_("Bad GNAT array descriptor"));
14f9c5c9
AS
1563
1564 /* NOTE: The following calculation is not really kosher, but
d2e4a39e 1565 since desc_type is an XVE-encoded type (and shouldn't be),
4c4b4cd2 1566 the correct calculation is a real pain. FIXME (and fix GCC). */
14f9c5c9 1567 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4c4b4cd2 1568 addr = value_as_long (arr);
d2e4a39e 1569 else
42ae5230 1570 addr = value_address (arr);
14f9c5c9 1571
d2e4a39e 1572 return
4c4b4cd2
PH
1573 value_from_longest (lookup_pointer_type (bounds_type),
1574 addr - TYPE_LENGTH (bounds_type));
14f9c5c9
AS
1575 }
1576
1577 else if (is_thick_pntr (type))
05e522ef
JB
1578 {
1579 struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1580 _("Bad GNAT array descriptor"));
1581 struct type *p_bounds_type = value_type (p_bounds);
1582
1583 if (p_bounds_type
1584 && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR)
1585 {
1586 struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type);
1587
1588 if (TYPE_STUB (target_type))
1589 p_bounds = value_cast (lookup_pointer_type
1590 (ada_check_typedef (target_type)),
1591 p_bounds);
1592 }
1593 else
1594 error (_("Bad GNAT array descriptor"));
1595
1596 return p_bounds;
1597 }
14f9c5c9
AS
1598 else
1599 return NULL;
1600}
1601
4c4b4cd2
PH
1602/* If TYPE is the type of an array-descriptor (fat pointer), the bit
1603 position of the field containing the address of the bounds data. */
1604
14f9c5c9 1605static int
d2e4a39e 1606fat_pntr_bounds_bitpos (struct type *type)
14f9c5c9
AS
1607{
1608 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1609}
1610
1611/* If TYPE is the type of an array-descriptor (fat pointer), the bit
4c4b4cd2
PH
1612 size of the field containing the address of the bounds data. */
1613
14f9c5c9 1614static int
d2e4a39e 1615fat_pntr_bounds_bitsize (struct type *type)
14f9c5c9
AS
1616{
1617 type = desc_base_type (type);
1618
d2e4a39e 1619 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
14f9c5c9
AS
1620 return TYPE_FIELD_BITSIZE (type, 1);
1621 else
61ee279c 1622 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
14f9c5c9
AS
1623}
1624
4c4b4cd2 1625/* If TYPE is the type of an array descriptor (fat or thin pointer) or a
556bdfd4
UW
1626 pointer to one, the type of its array data (a array-with-no-bounds type);
1627 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1628 data. */
4c4b4cd2 1629
d2e4a39e 1630static struct type *
556bdfd4 1631desc_data_target_type (struct type *type)
14f9c5c9
AS
1632{
1633 type = desc_base_type (type);
1634
4c4b4cd2 1635 /* NOTE: The following is bogus; see comment in desc_bounds. */
14f9c5c9 1636 if (is_thin_pntr (type))
556bdfd4 1637 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1));
14f9c5c9 1638 else if (is_thick_pntr (type))
556bdfd4
UW
1639 {
1640 struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1);
1641
1642 if (data_type
1643 && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR)
05e522ef 1644 return ada_check_typedef (TYPE_TARGET_TYPE (data_type));
556bdfd4
UW
1645 }
1646
1647 return NULL;
14f9c5c9
AS
1648}
1649
1650/* If ARR is an array descriptor (fat or thin pointer), a pointer to
1651 its array data. */
4c4b4cd2 1652
d2e4a39e
AS
1653static struct value *
1654desc_data (struct value *arr)
14f9c5c9 1655{
df407dfe 1656 struct type *type = value_type (arr);
5b4ee69b 1657
14f9c5c9
AS
1658 if (is_thin_pntr (type))
1659 return thin_data_pntr (arr);
1660 else if (is_thick_pntr (type))
d2e4a39e 1661 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
323e0a4a 1662 _("Bad GNAT array descriptor"));
14f9c5c9
AS
1663 else
1664 return NULL;
1665}
1666
1667
1668/* If TYPE is the type of an array-descriptor (fat pointer), the bit
4c4b4cd2
PH
1669 position of the field containing the address of the data. */
1670
14f9c5c9 1671static int
d2e4a39e 1672fat_pntr_data_bitpos (struct type *type)
14f9c5c9
AS
1673{
1674 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1675}
1676
1677/* If TYPE is the type of an array-descriptor (fat pointer), the bit
4c4b4cd2
PH
1678 size of the field containing the address of the data. */
1679
14f9c5c9 1680static int
d2e4a39e 1681fat_pntr_data_bitsize (struct type *type)
14f9c5c9
AS
1682{
1683 type = desc_base_type (type);
1684
1685 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1686 return TYPE_FIELD_BITSIZE (type, 0);
d2e4a39e 1687 else
14f9c5c9
AS
1688 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1689}
1690
4c4b4cd2 1691/* If BOUNDS is an array-bounds structure (or pointer to one), return
14f9c5c9 1692 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
4c4b4cd2
PH
1693 bound, if WHICH is 1. The first bound is I=1. */
1694
d2e4a39e
AS
1695static struct value *
1696desc_one_bound (struct value *bounds, int i, int which)
14f9c5c9 1697{
d2e4a39e 1698 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
323e0a4a 1699 _("Bad GNAT array descriptor bounds"));
14f9c5c9
AS
1700}
1701
1702/* If BOUNDS is an array-bounds structure type, return the bit position
1703 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
4c4b4cd2
PH
1704 bound, if WHICH is 1. The first bound is I=1. */
1705
14f9c5c9 1706static int
d2e4a39e 1707desc_bound_bitpos (struct type *type, int i, int which)
14f9c5c9 1708{
d2e4a39e 1709 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
14f9c5c9
AS
1710}
1711
1712/* If BOUNDS is an array-bounds structure type, return the bit field size
1713 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
4c4b4cd2
PH
1714 bound, if WHICH is 1. The first bound is I=1. */
1715
76a01679 1716static int
d2e4a39e 1717desc_bound_bitsize (struct type *type, int i, int which)
14f9c5c9
AS
1718{
1719 type = desc_base_type (type);
1720
d2e4a39e
AS
1721 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1722 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1723 else
1724 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
14f9c5c9
AS
1725}
1726
1727/* If TYPE is the type of an array-bounds structure, the type of its
4c4b4cd2
PH
1728 Ith bound (numbering from 1). Otherwise, NULL. */
1729
d2e4a39e
AS
1730static struct type *
1731desc_index_type (struct type *type, int i)
14f9c5c9
AS
1732{
1733 type = desc_base_type (type);
1734
1735 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
d2e4a39e
AS
1736 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1737 else
14f9c5c9
AS
1738 return NULL;
1739}
1740
4c4b4cd2
PH
1741/* The number of index positions in the array-bounds type TYPE.
1742 Return 0 if TYPE is NULL. */
1743
14f9c5c9 1744static int
d2e4a39e 1745desc_arity (struct type *type)
14f9c5c9
AS
1746{
1747 type = desc_base_type (type);
1748
1749 if (type != NULL)
1750 return TYPE_NFIELDS (type) / 2;
1751 return 0;
1752}
1753
4c4b4cd2
PH
1754/* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1755 an array descriptor type (representing an unconstrained array
1756 type). */
1757
76a01679
JB
1758static int
1759ada_is_direct_array_type (struct type *type)
4c4b4cd2
PH
1760{
1761 if (type == NULL)
1762 return 0;
61ee279c 1763 type = ada_check_typedef (type);
4c4b4cd2 1764 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
76a01679 1765 || ada_is_array_descriptor_type (type));
4c4b4cd2
PH
1766}
1767
52ce6436 1768/* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
0963b4bd 1769 * to one. */
52ce6436 1770
2c0b251b 1771static int
52ce6436
PH
1772ada_is_array_type (struct type *type)
1773{
1774 while (type != NULL
1775 && (TYPE_CODE (type) == TYPE_CODE_PTR
1776 || TYPE_CODE (type) == TYPE_CODE_REF))
1777 type = TYPE_TARGET_TYPE (type);
1778 return ada_is_direct_array_type (type);
1779}
1780
4c4b4cd2 1781/* Non-zero iff TYPE is a simple array type or pointer to one. */
14f9c5c9 1782
14f9c5c9 1783int
4c4b4cd2 1784ada_is_simple_array_type (struct type *type)
14f9c5c9
AS
1785{
1786 if (type == NULL)
1787 return 0;
61ee279c 1788 type = ada_check_typedef (type);
14f9c5c9 1789 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
4c4b4cd2 1790 || (TYPE_CODE (type) == TYPE_CODE_PTR
b0dd7688
JB
1791 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type)))
1792 == TYPE_CODE_ARRAY));
14f9c5c9
AS
1793}
1794
4c4b4cd2
PH
1795/* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1796
14f9c5c9 1797int
4c4b4cd2 1798ada_is_array_descriptor_type (struct type *type)
14f9c5c9 1799{
556bdfd4 1800 struct type *data_type = desc_data_target_type (type);
14f9c5c9
AS
1801
1802 if (type == NULL)
1803 return 0;
61ee279c 1804 type = ada_check_typedef (type);
556bdfd4
UW
1805 return (data_type != NULL
1806 && TYPE_CODE (data_type) == TYPE_CODE_ARRAY
1807 && desc_arity (desc_bounds_type (type)) > 0);
14f9c5c9
AS
1808}
1809
1810/* Non-zero iff type is a partially mal-formed GNAT array
4c4b4cd2 1811 descriptor. FIXME: This is to compensate for some problems with
14f9c5c9 1812 debugging output from GNAT. Re-examine periodically to see if it
4c4b4cd2
PH
1813 is still needed. */
1814
14f9c5c9 1815int
ebf56fd3 1816ada_is_bogus_array_descriptor (struct type *type)
14f9c5c9 1817{
d2e4a39e 1818 return
14f9c5c9
AS
1819 type != NULL
1820 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1821 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
4c4b4cd2
PH
1822 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1823 && !ada_is_array_descriptor_type (type);
14f9c5c9
AS
1824}
1825
1826
4c4b4cd2 1827/* If ARR has a record type in the form of a standard GNAT array descriptor,
14f9c5c9 1828 (fat pointer) returns the type of the array data described---specifically,
4c4b4cd2 1829 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
14f9c5c9 1830 in from the descriptor; otherwise, they are left unspecified. If
4c4b4cd2
PH
1831 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1832 returns NULL. The result is simply the type of ARR if ARR is not
14f9c5c9 1833 a descriptor. */
d2e4a39e
AS
1834struct type *
1835ada_type_of_array (struct value *arr, int bounds)
14f9c5c9 1836{
ad82864c
JB
1837 if (ada_is_constrained_packed_array_type (value_type (arr)))
1838 return decode_constrained_packed_array_type (value_type (arr));
14f9c5c9 1839
df407dfe
AC
1840 if (!ada_is_array_descriptor_type (value_type (arr)))
1841 return value_type (arr);
d2e4a39e
AS
1842
1843 if (!bounds)
ad82864c
JB
1844 {
1845 struct type *array_type =
1846 ada_check_typedef (desc_data_target_type (value_type (arr)));
1847
1848 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1849 TYPE_FIELD_BITSIZE (array_type, 0) =
1850 decode_packed_array_bitsize (value_type (arr));
1851
1852 return array_type;
1853 }
14f9c5c9
AS
1854 else
1855 {
d2e4a39e 1856 struct type *elt_type;
14f9c5c9 1857 int arity;
d2e4a39e 1858 struct value *descriptor;
14f9c5c9 1859
df407dfe
AC
1860 elt_type = ada_array_element_type (value_type (arr), -1);
1861 arity = ada_array_arity (value_type (arr));
14f9c5c9 1862
d2e4a39e 1863 if (elt_type == NULL || arity == 0)
df407dfe 1864 return ada_check_typedef (value_type (arr));
14f9c5c9
AS
1865
1866 descriptor = desc_bounds (arr);
d2e4a39e 1867 if (value_as_long (descriptor) == 0)
4c4b4cd2 1868 return NULL;
d2e4a39e 1869 while (arity > 0)
4c4b4cd2 1870 {
e9bb382b
UW
1871 struct type *range_type = alloc_type_copy (value_type (arr));
1872 struct type *array_type = alloc_type_copy (value_type (arr));
4c4b4cd2
PH
1873 struct value *low = desc_one_bound (descriptor, arity, 0);
1874 struct value *high = desc_one_bound (descriptor, arity, 1);
4c4b4cd2 1875
5b4ee69b 1876 arity -= 1;
df407dfe 1877 create_range_type (range_type, value_type (low),
529cad9c
PH
1878 longest_to_int (value_as_long (low)),
1879 longest_to_int (value_as_long (high)));
4c4b4cd2 1880 elt_type = create_array_type (array_type, elt_type, range_type);
ad82864c
JB
1881
1882 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
e67ad678
JB
1883 {
1884 /* We need to store the element packed bitsize, as well as
1885 recompute the array size, because it was previously
1886 computed based on the unpacked element size. */
1887 LONGEST lo = value_as_long (low);
1888 LONGEST hi = value_as_long (high);
1889
1890 TYPE_FIELD_BITSIZE (elt_type, 0) =
1891 decode_packed_array_bitsize (value_type (arr));
1892 /* If the array has no element, then the size is already
1893 zero, and does not need to be recomputed. */
1894 if (lo < hi)
1895 {
1896 int array_bitsize =
1897 (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0);
1898
1899 TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8;
1900 }
1901 }
4c4b4cd2 1902 }
14f9c5c9
AS
1903
1904 return lookup_pointer_type (elt_type);
1905 }
1906}
1907
1908/* If ARR does not represent an array, returns ARR unchanged.
4c4b4cd2
PH
1909 Otherwise, returns either a standard GDB array with bounds set
1910 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1911 GDB array. Returns NULL if ARR is a null fat pointer. */
1912
d2e4a39e
AS
1913struct value *
1914ada_coerce_to_simple_array_ptr (struct value *arr)
14f9c5c9 1915{
df407dfe 1916 if (ada_is_array_descriptor_type (value_type (arr)))
14f9c5c9 1917 {
d2e4a39e 1918 struct type *arrType = ada_type_of_array (arr, 1);
5b4ee69b 1919
14f9c5c9 1920 if (arrType == NULL)
4c4b4cd2 1921 return NULL;
14f9c5c9
AS
1922 return value_cast (arrType, value_copy (desc_data (arr)));
1923 }
ad82864c
JB
1924 else if (ada_is_constrained_packed_array_type (value_type (arr)))
1925 return decode_constrained_packed_array (arr);
14f9c5c9
AS
1926 else
1927 return arr;
1928}
1929
1930/* If ARR does not represent an array, returns ARR unchanged.
1931 Otherwise, returns a standard GDB array describing ARR (which may
4c4b4cd2
PH
1932 be ARR itself if it already is in the proper form). */
1933
720d1a40 1934struct value *
d2e4a39e 1935ada_coerce_to_simple_array (struct value *arr)
14f9c5c9 1936{
df407dfe 1937 if (ada_is_array_descriptor_type (value_type (arr)))
14f9c5c9 1938 {
d2e4a39e 1939 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
5b4ee69b 1940
14f9c5c9 1941 if (arrVal == NULL)
323e0a4a 1942 error (_("Bounds unavailable for null array pointer."));
529cad9c 1943 check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
14f9c5c9
AS
1944 return value_ind (arrVal);
1945 }
ad82864c
JB
1946 else if (ada_is_constrained_packed_array_type (value_type (arr)))
1947 return decode_constrained_packed_array (arr);
d2e4a39e 1948 else
14f9c5c9
AS
1949 return arr;
1950}
1951
1952/* If TYPE represents a GNAT array type, return it translated to an
1953 ordinary GDB array type (possibly with BITSIZE fields indicating
4c4b4cd2
PH
1954 packing). For other types, is the identity. */
1955
d2e4a39e
AS
1956struct type *
1957ada_coerce_to_simple_array_type (struct type *type)
14f9c5c9 1958{
ad82864c
JB
1959 if (ada_is_constrained_packed_array_type (type))
1960 return decode_constrained_packed_array_type (type);
17280b9f
UW
1961
1962 if (ada_is_array_descriptor_type (type))
556bdfd4 1963 return ada_check_typedef (desc_data_target_type (type));
17280b9f
UW
1964
1965 return type;
14f9c5c9
AS
1966}
1967
4c4b4cd2
PH
1968/* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1969
ad82864c
JB
1970static int
1971ada_is_packed_array_type (struct type *type)
14f9c5c9
AS
1972{
1973 if (type == NULL)
1974 return 0;
4c4b4cd2 1975 type = desc_base_type (type);
61ee279c 1976 type = ada_check_typedef (type);
d2e4a39e 1977 return
14f9c5c9
AS
1978 ada_type_name (type) != NULL
1979 && strstr (ada_type_name (type), "___XP") != NULL;
1980}
1981
ad82864c
JB
1982/* Non-zero iff TYPE represents a standard GNAT constrained
1983 packed-array type. */
1984
1985int
1986ada_is_constrained_packed_array_type (struct type *type)
1987{
1988 return ada_is_packed_array_type (type)
1989 && !ada_is_array_descriptor_type (type);
1990}
1991
1992/* Non-zero iff TYPE represents an array descriptor for a
1993 unconstrained packed-array type. */
1994
1995static int
1996ada_is_unconstrained_packed_array_type (struct type *type)
1997{
1998 return ada_is_packed_array_type (type)
1999 && ada_is_array_descriptor_type (type);
2000}
2001
2002/* Given that TYPE encodes a packed array type (constrained or unconstrained),
2003 return the size of its elements in bits. */
2004
2005static long
2006decode_packed_array_bitsize (struct type *type)
2007{
0d5cff50
DE
2008 const char *raw_name;
2009 const char *tail;
ad82864c
JB
2010 long bits;
2011
720d1a40
JB
2012 /* Access to arrays implemented as fat pointers are encoded as a typedef
2013 of the fat pointer type. We need the name of the fat pointer type
2014 to do the decoding, so strip the typedef layer. */
2015 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
2016 type = ada_typedef_target_type (type);
2017
2018 raw_name = ada_type_name (ada_check_typedef (type));
ad82864c
JB
2019 if (!raw_name)
2020 raw_name = ada_type_name (desc_base_type (type));
2021
2022 if (!raw_name)
2023 return 0;
2024
2025 tail = strstr (raw_name, "___XP");
720d1a40 2026 gdb_assert (tail != NULL);
ad82864c
JB
2027
2028 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
2029 {
2030 lim_warning
2031 (_("could not understand bit size information on packed array"));
2032 return 0;
2033 }
2034
2035 return bits;
2036}
2037
14f9c5c9
AS
2038/* Given that TYPE is a standard GDB array type with all bounds filled
2039 in, and that the element size of its ultimate scalar constituents
2040 (that is, either its elements, or, if it is an array of arrays, its
2041 elements' elements, etc.) is *ELT_BITS, return an identical type,
2042 but with the bit sizes of its elements (and those of any
2043 constituent arrays) recorded in the BITSIZE components of its
4c4b4cd2
PH
2044 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2045 in bits. */
2046
d2e4a39e 2047static struct type *
ad82864c 2048constrained_packed_array_type (struct type *type, long *elt_bits)
14f9c5c9 2049{
d2e4a39e
AS
2050 struct type *new_elt_type;
2051 struct type *new_type;
99b1c762
JB
2052 struct type *index_type_desc;
2053 struct type *index_type;
14f9c5c9
AS
2054 LONGEST low_bound, high_bound;
2055
61ee279c 2056 type = ada_check_typedef (type);
14f9c5c9
AS
2057 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2058 return type;
2059
99b1c762
JB
2060 index_type_desc = ada_find_parallel_type (type, "___XA");
2061 if (index_type_desc)
2062 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, 0),
2063 NULL);
2064 else
2065 index_type = TYPE_INDEX_TYPE (type);
2066
e9bb382b 2067 new_type = alloc_type_copy (type);
ad82864c
JB
2068 new_elt_type =
2069 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
2070 elt_bits);
99b1c762 2071 create_array_type (new_type, new_elt_type, index_type);
14f9c5c9
AS
2072 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
2073 TYPE_NAME (new_type) = ada_type_name (type);
2074
99b1c762 2075 if (get_discrete_bounds (index_type, &low_bound, &high_bound) < 0)
14f9c5c9
AS
2076 low_bound = high_bound = 0;
2077 if (high_bound < low_bound)
2078 *elt_bits = TYPE_LENGTH (new_type) = 0;
d2e4a39e 2079 else
14f9c5c9
AS
2080 {
2081 *elt_bits *= (high_bound - low_bound + 1);
d2e4a39e 2082 TYPE_LENGTH (new_type) =
4c4b4cd2 2083 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
14f9c5c9
AS
2084 }
2085
876cecd0 2086 TYPE_FIXED_INSTANCE (new_type) = 1;
14f9c5c9
AS
2087 return new_type;
2088}
2089
ad82864c
JB
2090/* The array type encoded by TYPE, where
2091 ada_is_constrained_packed_array_type (TYPE). */
4c4b4cd2 2092
d2e4a39e 2093static struct type *
ad82864c 2094decode_constrained_packed_array_type (struct type *type)
d2e4a39e 2095{
0d5cff50 2096 const char *raw_name = ada_type_name (ada_check_typedef (type));
727e3d2e 2097 char *name;
0d5cff50 2098 const char *tail;
d2e4a39e 2099 struct type *shadow_type;
14f9c5c9 2100 long bits;
14f9c5c9 2101
727e3d2e
JB
2102 if (!raw_name)
2103 raw_name = ada_type_name (desc_base_type (type));
2104
2105 if (!raw_name)
2106 return NULL;
2107
2108 name = (char *) alloca (strlen (raw_name) + 1);
2109 tail = strstr (raw_name, "___XP");
4c4b4cd2
PH
2110 type = desc_base_type (type);
2111
14f9c5c9
AS
2112 memcpy (name, raw_name, tail - raw_name);
2113 name[tail - raw_name] = '\000';
2114
b4ba55a1
JB
2115 shadow_type = ada_find_parallel_type_with_name (type, name);
2116
2117 if (shadow_type == NULL)
14f9c5c9 2118 {
323e0a4a 2119 lim_warning (_("could not find bounds information on packed array"));
14f9c5c9
AS
2120 return NULL;
2121 }
cb249c71 2122 CHECK_TYPEDEF (shadow_type);
14f9c5c9
AS
2123
2124 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
2125 {
0963b4bd
MS
2126 lim_warning (_("could not understand bounds "
2127 "information on packed array"));
14f9c5c9
AS
2128 return NULL;
2129 }
d2e4a39e 2130
ad82864c
JB
2131 bits = decode_packed_array_bitsize (type);
2132 return constrained_packed_array_type (shadow_type, &bits);
14f9c5c9
AS
2133}
2134
ad82864c
JB
2135/* Given that ARR is a struct value *indicating a GNAT constrained packed
2136 array, returns a simple array that denotes that array. Its type is a
14f9c5c9
AS
2137 standard GDB array type except that the BITSIZEs of the array
2138 target types are set to the number of bits in each element, and the
4c4b4cd2 2139 type length is set appropriately. */
14f9c5c9 2140
d2e4a39e 2141static struct value *
ad82864c 2142decode_constrained_packed_array (struct value *arr)
14f9c5c9 2143{
4c4b4cd2 2144 struct type *type;
14f9c5c9 2145
4c4b4cd2 2146 arr = ada_coerce_ref (arr);
284614f0
JB
2147
2148 /* If our value is a pointer, then dererence it. Make sure that
2149 this operation does not cause the target type to be fixed, as
2150 this would indirectly cause this array to be decoded. The rest
2151 of the routine assumes that the array hasn't been decoded yet,
2152 so we use the basic "value_ind" routine to perform the dereferencing,
2153 as opposed to using "ada_value_ind". */
828292f2 2154 if (TYPE_CODE (ada_check_typedef (value_type (arr))) == TYPE_CODE_PTR)
284614f0 2155 arr = value_ind (arr);
4c4b4cd2 2156
ad82864c 2157 type = decode_constrained_packed_array_type (value_type (arr));
14f9c5c9
AS
2158 if (type == NULL)
2159 {
323e0a4a 2160 error (_("can't unpack array"));
14f9c5c9
AS
2161 return NULL;
2162 }
61ee279c 2163
50810684 2164 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr)))
32c9a795 2165 && ada_is_modular_type (value_type (arr)))
61ee279c
PH
2166 {
2167 /* This is a (right-justified) modular type representing a packed
2168 array with no wrapper. In order to interpret the value through
2169 the (left-justified) packed array type we just built, we must
2170 first left-justify it. */
2171 int bit_size, bit_pos;
2172 ULONGEST mod;
2173
df407dfe 2174 mod = ada_modulus (value_type (arr)) - 1;
61ee279c
PH
2175 bit_size = 0;
2176 while (mod > 0)
2177 {
2178 bit_size += 1;
2179 mod >>= 1;
2180 }
df407dfe 2181 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
61ee279c
PH
2182 arr = ada_value_primitive_packed_val (arr, NULL,
2183 bit_pos / HOST_CHAR_BIT,
2184 bit_pos % HOST_CHAR_BIT,
2185 bit_size,
2186 type);
2187 }
2188
4c4b4cd2 2189 return coerce_unspec_val_to_type (arr, type);
14f9c5c9
AS
2190}
2191
2192
2193/* The value of the element of packed array ARR at the ARITY indices
4c4b4cd2 2194 given in IND. ARR must be a simple array. */
14f9c5c9 2195
d2e4a39e
AS
2196static struct value *
2197value_subscript_packed (struct value *arr, int arity, struct value **ind)
14f9c5c9
AS
2198{
2199 int i;
2200 int bits, elt_off, bit_off;
2201 long elt_total_bit_offset;
d2e4a39e
AS
2202 struct type *elt_type;
2203 struct value *v;
14f9c5c9
AS
2204
2205 bits = 0;
2206 elt_total_bit_offset = 0;
df407dfe 2207 elt_type = ada_check_typedef (value_type (arr));
d2e4a39e 2208 for (i = 0; i < arity; i += 1)
14f9c5c9 2209 {
d2e4a39e 2210 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
4c4b4cd2
PH
2211 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
2212 error
0963b4bd
MS
2213 (_("attempt to do packed indexing of "
2214 "something other than a packed array"));
14f9c5c9 2215 else
4c4b4cd2
PH
2216 {
2217 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
2218 LONGEST lowerbound, upperbound;
2219 LONGEST idx;
2220
2221 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
2222 {
323e0a4a 2223 lim_warning (_("don't know bounds of array"));
4c4b4cd2
PH
2224 lowerbound = upperbound = 0;
2225 }
2226
3cb382c9 2227 idx = pos_atr (ind[i]);
4c4b4cd2 2228 if (idx < lowerbound || idx > upperbound)
0963b4bd
MS
2229 lim_warning (_("packed array index %ld out of bounds"),
2230 (long) idx);
4c4b4cd2
PH
2231 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
2232 elt_total_bit_offset += (idx - lowerbound) * bits;
61ee279c 2233 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
4c4b4cd2 2234 }
14f9c5c9
AS
2235 }
2236 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
2237 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
d2e4a39e
AS
2238
2239 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
4c4b4cd2 2240 bits, elt_type);
14f9c5c9
AS
2241 return v;
2242}
2243
4c4b4cd2 2244/* Non-zero iff TYPE includes negative integer values. */
14f9c5c9
AS
2245
2246static int
d2e4a39e 2247has_negatives (struct type *type)
14f9c5c9 2248{
d2e4a39e
AS
2249 switch (TYPE_CODE (type))
2250 {
2251 default:
2252 return 0;
2253 case TYPE_CODE_INT:
2254 return !TYPE_UNSIGNED (type);
2255 case TYPE_CODE_RANGE:
2256 return TYPE_LOW_BOUND (type) < 0;
2257 }
14f9c5c9 2258}
d2e4a39e 2259
14f9c5c9
AS
2260
2261/* Create a new value of type TYPE from the contents of OBJ starting
2262 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2263 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
0963b4bd 2264 assigning through the result will set the field fetched from.
4c4b4cd2
PH
2265 VALADDR is ignored unless OBJ is NULL, in which case,
2266 VALADDR+OFFSET must address the start of storage containing the
2267 packed value. The value returned in this case is never an lval.
2268 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
14f9c5c9 2269
d2e4a39e 2270struct value *
fc1a4b47 2271ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
a2bd3dcd 2272 long offset, int bit_offset, int bit_size,
4c4b4cd2 2273 struct type *type)
14f9c5c9 2274{
d2e4a39e 2275 struct value *v;
4c4b4cd2
PH
2276 int src, /* Index into the source area */
2277 targ, /* Index into the target area */
2278 srcBitsLeft, /* Number of source bits left to move */
2279 nsrc, ntarg, /* Number of source and target bytes */
2280 unusedLS, /* Number of bits in next significant
2281 byte of source that are unused */
2282 accumSize; /* Number of meaningful bits in accum */
2283 unsigned char *bytes; /* First byte containing data to unpack */
d2e4a39e 2284 unsigned char *unpacked;
4c4b4cd2 2285 unsigned long accum; /* Staging area for bits being transferred */
14f9c5c9
AS
2286 unsigned char sign;
2287 int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
4c4b4cd2
PH
2288 /* Transmit bytes from least to most significant; delta is the direction
2289 the indices move. */
50810684 2290 int delta = gdbarch_bits_big_endian (get_type_arch (type)) ? -1 : 1;
14f9c5c9 2291
61ee279c 2292 type = ada_check_typedef (type);
14f9c5c9
AS
2293
2294 if (obj == NULL)
2295 {
2296 v = allocate_value (type);
d2e4a39e 2297 bytes = (unsigned char *) (valaddr + offset);
14f9c5c9 2298 }
9214ee5f 2299 else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj))
14f9c5c9 2300 {
53ba8333 2301 v = value_at (type, value_address (obj));
d2e4a39e 2302 bytes = (unsigned char *) alloca (len);
53ba8333 2303 read_memory (value_address (v) + offset, bytes, len);
14f9c5c9 2304 }
d2e4a39e 2305 else
14f9c5c9
AS
2306 {
2307 v = allocate_value (type);
0fd88904 2308 bytes = (unsigned char *) value_contents (obj) + offset;
14f9c5c9 2309 }
d2e4a39e
AS
2310
2311 if (obj != NULL)
14f9c5c9 2312 {
53ba8333 2313 long new_offset = offset;
5b4ee69b 2314
74bcbdf3 2315 set_value_component_location (v, obj);
9bbda503
AC
2316 set_value_bitpos (v, bit_offset + value_bitpos (obj));
2317 set_value_bitsize (v, bit_size);
df407dfe 2318 if (value_bitpos (v) >= HOST_CHAR_BIT)
4c4b4cd2 2319 {
53ba8333 2320 ++new_offset;
9bbda503 2321 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
4c4b4cd2 2322 }
53ba8333
JB
2323 set_value_offset (v, new_offset);
2324
2325 /* Also set the parent value. This is needed when trying to
2326 assign a new value (in inferior memory). */
2327 set_value_parent (v, obj);
2328 value_incref (obj);
14f9c5c9
AS
2329 }
2330 else
9bbda503 2331 set_value_bitsize (v, bit_size);
0fd88904 2332 unpacked = (unsigned char *) value_contents (v);
14f9c5c9
AS
2333
2334 srcBitsLeft = bit_size;
2335 nsrc = len;
2336 ntarg = TYPE_LENGTH (type);
2337 sign = 0;
2338 if (bit_size == 0)
2339 {
2340 memset (unpacked, 0, TYPE_LENGTH (type));
2341 return v;
2342 }
50810684 2343 else if (gdbarch_bits_big_endian (get_type_arch (type)))
14f9c5c9 2344 {
d2e4a39e 2345 src = len - 1;
1265e4aa
JB
2346 if (has_negatives (type)
2347 && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
4c4b4cd2 2348 sign = ~0;
d2e4a39e
AS
2349
2350 unusedLS =
4c4b4cd2
PH
2351 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2352 % HOST_CHAR_BIT;
14f9c5c9
AS
2353
2354 switch (TYPE_CODE (type))
4c4b4cd2
PH
2355 {
2356 case TYPE_CODE_ARRAY:
2357 case TYPE_CODE_UNION:
2358 case TYPE_CODE_STRUCT:
2359 /* Non-scalar values must be aligned at a byte boundary... */
2360 accumSize =
2361 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2362 /* ... And are placed at the beginning (most-significant) bytes
2363 of the target. */
529cad9c 2364 targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
0056e4d5 2365 ntarg = targ + 1;
4c4b4cd2
PH
2366 break;
2367 default:
2368 accumSize = 0;
2369 targ = TYPE_LENGTH (type) - 1;
2370 break;
2371 }
14f9c5c9 2372 }
d2e4a39e 2373 else
14f9c5c9
AS
2374 {
2375 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2376
2377 src = targ = 0;
2378 unusedLS = bit_offset;
2379 accumSize = 0;
2380
d2e4a39e 2381 if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
4c4b4cd2 2382 sign = ~0;
14f9c5c9 2383 }
d2e4a39e 2384
14f9c5c9
AS
2385 accum = 0;
2386 while (nsrc > 0)
2387 {
2388 /* Mask for removing bits of the next source byte that are not
4c4b4cd2 2389 part of the value. */
d2e4a39e 2390 unsigned int unusedMSMask =
4c4b4cd2
PH
2391 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2392 1;
2393 /* Sign-extend bits for this byte. */
14f9c5c9 2394 unsigned int signMask = sign & ~unusedMSMask;
5b4ee69b 2395
d2e4a39e 2396 accum |=
4c4b4cd2 2397 (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
14f9c5c9 2398 accumSize += HOST_CHAR_BIT - unusedLS;
d2e4a39e 2399 if (accumSize >= HOST_CHAR_BIT)
4c4b4cd2
PH
2400 {
2401 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2402 accumSize -= HOST_CHAR_BIT;
2403 accum >>= HOST_CHAR_BIT;
2404 ntarg -= 1;
2405 targ += delta;
2406 }
14f9c5c9
AS
2407 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2408 unusedLS = 0;
2409 nsrc -= 1;
2410 src += delta;
2411 }
2412 while (ntarg > 0)
2413 {
2414 accum |= sign << accumSize;
2415 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2416 accumSize -= HOST_CHAR_BIT;
2417 accum >>= HOST_CHAR_BIT;
2418 ntarg -= 1;
2419 targ += delta;
2420 }
2421
2422 return v;
2423}
d2e4a39e 2424
14f9c5c9
AS
2425/* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2426 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
4c4b4cd2 2427 not overlap. */
14f9c5c9 2428static void
fc1a4b47 2429move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
50810684 2430 int src_offset, int n, int bits_big_endian_p)
14f9c5c9
AS
2431{
2432 unsigned int accum, mask;
2433 int accum_bits, chunk_size;
2434
2435 target += targ_offset / HOST_CHAR_BIT;
2436 targ_offset %= HOST_CHAR_BIT;
2437 source += src_offset / HOST_CHAR_BIT;
2438 src_offset %= HOST_CHAR_BIT;
50810684 2439 if (bits_big_endian_p)
14f9c5c9
AS
2440 {
2441 accum = (unsigned char) *source;
2442 source += 1;
2443 accum_bits = HOST_CHAR_BIT - src_offset;
2444
d2e4a39e 2445 while (n > 0)
4c4b4cd2
PH
2446 {
2447 int unused_right;
5b4ee69b 2448
4c4b4cd2
PH
2449 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
2450 accum_bits += HOST_CHAR_BIT;
2451 source += 1;
2452 chunk_size = HOST_CHAR_BIT - targ_offset;
2453 if (chunk_size > n)
2454 chunk_size = n;
2455 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
2456 mask = ((1 << chunk_size) - 1) << unused_right;
2457 *target =
2458 (*target & ~mask)
2459 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
2460 n -= chunk_size;
2461 accum_bits -= chunk_size;
2462 target += 1;
2463 targ_offset = 0;
2464 }
14f9c5c9
AS
2465 }
2466 else
2467 {
2468 accum = (unsigned char) *source >> src_offset;
2469 source += 1;
2470 accum_bits = HOST_CHAR_BIT - src_offset;
2471
d2e4a39e 2472 while (n > 0)
4c4b4cd2
PH
2473 {
2474 accum = accum + ((unsigned char) *source << accum_bits);
2475 accum_bits += HOST_CHAR_BIT;
2476 source += 1;
2477 chunk_size = HOST_CHAR_BIT - targ_offset;
2478 if (chunk_size > n)
2479 chunk_size = n;
2480 mask = ((1 << chunk_size) - 1) << targ_offset;
2481 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
2482 n -= chunk_size;
2483 accum_bits -= chunk_size;
2484 accum >>= chunk_size;
2485 target += 1;
2486 targ_offset = 0;
2487 }
14f9c5c9
AS
2488 }
2489}
2490
14f9c5c9
AS
2491/* Store the contents of FROMVAL into the location of TOVAL.
2492 Return a new value with the location of TOVAL and contents of
2493 FROMVAL. Handles assignment into packed fields that have
4c4b4cd2 2494 floating-point or non-scalar types. */
14f9c5c9 2495
d2e4a39e
AS
2496static struct value *
2497ada_value_assign (struct value *toval, struct value *fromval)
14f9c5c9 2498{
df407dfe
AC
2499 struct type *type = value_type (toval);
2500 int bits = value_bitsize (toval);
14f9c5c9 2501
52ce6436
PH
2502 toval = ada_coerce_ref (toval);
2503 fromval = ada_coerce_ref (fromval);
2504
2505 if (ada_is_direct_array_type (value_type (toval)))
2506 toval = ada_coerce_to_simple_array (toval);
2507 if (ada_is_direct_array_type (value_type (fromval)))
2508 fromval = ada_coerce_to_simple_array (fromval);
2509
88e3b34b 2510 if (!deprecated_value_modifiable (toval))
323e0a4a 2511 error (_("Left operand of assignment is not a modifiable lvalue."));
14f9c5c9 2512
d2e4a39e 2513 if (VALUE_LVAL (toval) == lval_memory
14f9c5c9 2514 && bits > 0
d2e4a39e 2515 && (TYPE_CODE (type) == TYPE_CODE_FLT
4c4b4cd2 2516 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
14f9c5c9 2517 {
df407dfe
AC
2518 int len = (value_bitpos (toval)
2519 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
aced2898 2520 int from_size;
d2e4a39e
AS
2521 char *buffer = (char *) alloca (len);
2522 struct value *val;
42ae5230 2523 CORE_ADDR to_addr = value_address (toval);
14f9c5c9
AS
2524
2525 if (TYPE_CODE (type) == TYPE_CODE_FLT)
4c4b4cd2 2526 fromval = value_cast (type, fromval);
14f9c5c9 2527
52ce6436 2528 read_memory (to_addr, buffer, len);
aced2898
PH
2529 from_size = value_bitsize (fromval);
2530 if (from_size == 0)
2531 from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT;
50810684 2532 if (gdbarch_bits_big_endian (get_type_arch (type)))
df407dfe 2533 move_bits (buffer, value_bitpos (toval),
50810684 2534 value_contents (fromval), from_size - bits, bits, 1);
14f9c5c9 2535 else
50810684
UW
2536 move_bits (buffer, value_bitpos (toval),
2537 value_contents (fromval), 0, bits, 0);
972daa01 2538 write_memory_with_notification (to_addr, buffer, len);
8cebebb9 2539
14f9c5c9 2540 val = value_copy (toval);
0fd88904 2541 memcpy (value_contents_raw (val), value_contents (fromval),
4c4b4cd2 2542 TYPE_LENGTH (type));
04624583 2543 deprecated_set_value_type (val, type);
d2e4a39e 2544
14f9c5c9
AS
2545 return val;
2546 }
2547
2548 return value_assign (toval, fromval);
2549}
2550
2551
52ce6436
PH
2552/* Given that COMPONENT is a memory lvalue that is part of the lvalue
2553 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2554 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2555 * COMPONENT, and not the inferior's memory. The current contents
2556 * of COMPONENT are ignored. */
2557static void
2558value_assign_to_component (struct value *container, struct value *component,
2559 struct value *val)
2560{
2561 LONGEST offset_in_container =
42ae5230 2562 (LONGEST) (value_address (component) - value_address (container));
52ce6436
PH
2563 int bit_offset_in_container =
2564 value_bitpos (component) - value_bitpos (container);
2565 int bits;
2566
2567 val = value_cast (value_type (component), val);
2568
2569 if (value_bitsize (component) == 0)
2570 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2571 else
2572 bits = value_bitsize (component);
2573
50810684 2574 if (gdbarch_bits_big_endian (get_type_arch (value_type (container))))
52ce6436
PH
2575 move_bits (value_contents_writeable (container) + offset_in_container,
2576 value_bitpos (container) + bit_offset_in_container,
2577 value_contents (val),
2578 TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
50810684 2579 bits, 1);
52ce6436
PH
2580 else
2581 move_bits (value_contents_writeable (container) + offset_in_container,
2582 value_bitpos (container) + bit_offset_in_container,
50810684 2583 value_contents (val), 0, bits, 0);
52ce6436
PH
2584}
2585
4c4b4cd2
PH
2586/* The value of the element of array ARR at the ARITY indices given in IND.
2587 ARR may be either a simple array, GNAT array descriptor, or pointer
14f9c5c9
AS
2588 thereto. */
2589
d2e4a39e
AS
2590struct value *
2591ada_value_subscript (struct value *arr, int arity, struct value **ind)
14f9c5c9
AS
2592{
2593 int k;
d2e4a39e
AS
2594 struct value *elt;
2595 struct type *elt_type;
14f9c5c9
AS
2596
2597 elt = ada_coerce_to_simple_array (arr);
2598
df407dfe 2599 elt_type = ada_check_typedef (value_type (elt));
d2e4a39e 2600 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
14f9c5c9
AS
2601 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2602 return value_subscript_packed (elt, arity, ind);
2603
2604 for (k = 0; k < arity; k += 1)
2605 {
2606 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
323e0a4a 2607 error (_("too many subscripts (%d expected)"), k);
2497b498 2608 elt = value_subscript (elt, pos_atr (ind[k]));
14f9c5c9
AS
2609 }
2610 return elt;
2611}
2612
2613/* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2614 value of the element of *ARR at the ARITY indices given in
4c4b4cd2 2615 IND. Does not read the entire array into memory. */
14f9c5c9 2616
2c0b251b 2617static struct value *
d2e4a39e 2618ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
4c4b4cd2 2619 struct value **ind)
14f9c5c9
AS
2620{
2621 int k;
2622
2623 for (k = 0; k < arity; k += 1)
2624 {
2625 LONGEST lwb, upb;
14f9c5c9
AS
2626
2627 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
323e0a4a 2628 error (_("too many subscripts (%d expected)"), k);
d2e4a39e 2629 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
4c4b4cd2 2630 value_copy (arr));
14f9c5c9 2631 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
2497b498 2632 arr = value_ptradd (arr, pos_atr (ind[k]) - lwb);
14f9c5c9
AS
2633 type = TYPE_TARGET_TYPE (type);
2634 }
2635
2636 return value_ind (arr);
2637}
2638
0b5d8877 2639/* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
f5938064
JG
2640 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2641 elements starting at index LOW. The lower bound of this array is LOW, as
0963b4bd 2642 per Ada rules. */
0b5d8877 2643static struct value *
f5938064
JG
2644ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2645 int low, int high)
0b5d8877 2646{
b0dd7688 2647 struct type *type0 = ada_check_typedef (type);
6c038f32 2648 CORE_ADDR base = value_as_address (array_ptr)
b0dd7688
JB
2649 + ((low - ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0)))
2650 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0)));
6c038f32 2651 struct type *index_type =
b0dd7688 2652 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0)),
0b5d8877 2653 low, high);
6c038f32 2654 struct type *slice_type =
b0dd7688 2655 create_array_type (NULL, TYPE_TARGET_TYPE (type0), index_type);
5b4ee69b 2656
f5938064 2657 return value_at_lazy (slice_type, base);
0b5d8877
PH
2658}
2659
2660
2661static struct value *
2662ada_value_slice (struct value *array, int low, int high)
2663{
b0dd7688 2664 struct type *type = ada_check_typedef (value_type (array));
6c038f32 2665 struct type *index_type =
0b5d8877 2666 create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
6c038f32 2667 struct type *slice_type =
0b5d8877 2668 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
5b4ee69b 2669
6c038f32 2670 return value_cast (slice_type, value_slice (array, low, high - low + 1));
0b5d8877
PH
2671}
2672
14f9c5c9
AS
2673/* If type is a record type in the form of a standard GNAT array
2674 descriptor, returns the number of dimensions for type. If arr is a
2675 simple array, returns the number of "array of"s that prefix its
4c4b4cd2 2676 type designation. Otherwise, returns 0. */
14f9c5c9
AS
2677
2678int
d2e4a39e 2679ada_array_arity (struct type *type)
14f9c5c9
AS
2680{
2681 int arity;
2682
2683 if (type == NULL)
2684 return 0;
2685
2686 type = desc_base_type (type);
2687
2688 arity = 0;
d2e4a39e 2689 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
14f9c5c9 2690 return desc_arity (desc_bounds_type (type));
d2e4a39e
AS
2691 else
2692 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
14f9c5c9 2693 {
4c4b4cd2 2694 arity += 1;
61ee279c 2695 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
14f9c5c9 2696 }
d2e4a39e 2697
14f9c5c9
AS
2698 return arity;
2699}
2700
2701/* If TYPE is a record type in the form of a standard GNAT array
2702 descriptor or a simple array type, returns the element type for
2703 TYPE after indexing by NINDICES indices, or by all indices if
4c4b4cd2 2704 NINDICES is -1. Otherwise, returns NULL. */
14f9c5c9 2705
d2e4a39e
AS
2706struct type *
2707ada_array_element_type (struct type *type, int nindices)
14f9c5c9
AS
2708{
2709 type = desc_base_type (type);
2710
d2e4a39e 2711 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
14f9c5c9
AS
2712 {
2713 int k;
d2e4a39e 2714 struct type *p_array_type;
14f9c5c9 2715
556bdfd4 2716 p_array_type = desc_data_target_type (type);
14f9c5c9
AS
2717
2718 k = ada_array_arity (type);
2719 if (k == 0)
4c4b4cd2 2720 return NULL;
d2e4a39e 2721
4c4b4cd2 2722 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
14f9c5c9 2723 if (nindices >= 0 && k > nindices)
4c4b4cd2 2724 k = nindices;
d2e4a39e 2725 while (k > 0 && p_array_type != NULL)
4c4b4cd2 2726 {
61ee279c 2727 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
4c4b4cd2
PH
2728 k -= 1;
2729 }
14f9c5c9
AS
2730 return p_array_type;
2731 }
2732 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2733 {
2734 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
4c4b4cd2
PH
2735 {
2736 type = TYPE_TARGET_TYPE (type);
2737 nindices -= 1;
2738 }
14f9c5c9
AS
2739 return type;
2740 }
2741
2742 return NULL;
2743}
2744
4c4b4cd2 2745/* The type of nth index in arrays of given type (n numbering from 1).
dd19d49e
UW
2746 Does not examine memory. Throws an error if N is invalid or TYPE
2747 is not an array type. NAME is the name of the Ada attribute being
2748 evaluated ('range, 'first, 'last, or 'length); it is used in building
2749 the error message. */
14f9c5c9 2750
1eea4ebd
UW
2751static struct type *
2752ada_index_type (struct type *type, int n, const char *name)
14f9c5c9 2753{
4c4b4cd2
PH
2754 struct type *result_type;
2755
14f9c5c9
AS
2756 type = desc_base_type (type);
2757
1eea4ebd
UW
2758 if (n < 0 || n > ada_array_arity (type))
2759 error (_("invalid dimension number to '%s"), name);
14f9c5c9 2760
4c4b4cd2 2761 if (ada_is_simple_array_type (type))
14f9c5c9
AS
2762 {
2763 int i;
2764
2765 for (i = 1; i < n; i += 1)
4c4b4cd2 2766 type = TYPE_TARGET_TYPE (type);
262452ec 2767 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
4c4b4cd2
PH
2768 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2769 has a target type of TYPE_CODE_UNDEF. We compensate here, but
76a01679 2770 perhaps stabsread.c would make more sense. */
1eea4ebd
UW
2771 if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
2772 result_type = NULL;
14f9c5c9 2773 }
d2e4a39e 2774 else
1eea4ebd
UW
2775 {
2776 result_type = desc_index_type (desc_bounds_type (type), n);
2777 if (result_type == NULL)
2778 error (_("attempt to take bound of something that is not an array"));
2779 }
2780
2781 return result_type;
14f9c5c9
AS
2782}
2783
2784/* Given that arr is an array type, returns the lower bound of the
2785 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
4c4b4cd2 2786 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
1eea4ebd
UW
2787 array-descriptor type. It works for other arrays with bounds supplied
2788 by run-time quantities other than discriminants. */
14f9c5c9 2789
abb68b3e 2790static LONGEST
1eea4ebd 2791ada_array_bound_from_type (struct type * arr_type, int n, int which)
14f9c5c9 2792{
1ce677a4 2793 struct type *type, *elt_type, *index_type_desc, *index_type;
1ce677a4 2794 int i;
262452ec
JK
2795
2796 gdb_assert (which == 0 || which == 1);
14f9c5c9 2797
ad82864c
JB
2798 if (ada_is_constrained_packed_array_type (arr_type))
2799 arr_type = decode_constrained_packed_array_type (arr_type);
14f9c5c9 2800
4c4b4cd2 2801 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
1eea4ebd 2802 return (LONGEST) - which;
14f9c5c9
AS
2803
2804 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
2805 type = TYPE_TARGET_TYPE (arr_type);
2806 else
2807 type = arr_type;
2808
1ce677a4
UW
2809 elt_type = type;
2810 for (i = n; i > 1; i--)
2811 elt_type = TYPE_TARGET_TYPE (type);
2812
14f9c5c9 2813 index_type_desc = ada_find_parallel_type (type, "___XA");
28c85d6c 2814 ada_fixup_array_indexes_type (index_type_desc);
262452ec 2815 if (index_type_desc != NULL)
28c85d6c
JB
2816 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1),
2817 NULL);
262452ec 2818 else
1ce677a4 2819 index_type = TYPE_INDEX_TYPE (elt_type);
262452ec 2820
43bbcdc2
PH
2821 return
2822 (LONGEST) (which == 0
2823 ? ada_discrete_type_low_bound (index_type)
2824 : ada_discrete_type_high_bound (index_type));
14f9c5c9
AS
2825}
2826
2827/* Given that arr is an array value, returns the lower bound of the
abb68b3e
JB
2828 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2829 WHICH is 1. This routine will also work for arrays with bounds
4c4b4cd2 2830 supplied by run-time quantities other than discriminants. */
14f9c5c9 2831
1eea4ebd 2832static LONGEST
4dc81987 2833ada_array_bound (struct value *arr, int n, int which)
14f9c5c9 2834{
df407dfe 2835 struct type *arr_type = value_type (arr);
14f9c5c9 2836
ad82864c
JB
2837 if (ada_is_constrained_packed_array_type (arr_type))
2838 return ada_array_bound (decode_constrained_packed_array (arr), n, which);
4c4b4cd2 2839 else if (ada_is_simple_array_type (arr_type))
1eea4ebd 2840 return ada_array_bound_from_type (arr_type, n, which);
14f9c5c9 2841 else
1eea4ebd 2842 return value_as_long (desc_one_bound (desc_bounds (arr), n, which));
14f9c5c9
AS
2843}
2844
2845/* Given that arr is an array value, returns the length of the
2846 nth index. This routine will also work for arrays with bounds
4c4b4cd2
PH
2847 supplied by run-time quantities other than discriminants.
2848 Does not work for arrays indexed by enumeration types with representation
2849 clauses at the moment. */
14f9c5c9 2850
1eea4ebd 2851static LONGEST
d2e4a39e 2852ada_array_length (struct value *arr, int n)
14f9c5c9 2853{
df407dfe 2854 struct type *arr_type = ada_check_typedef (value_type (arr));
14f9c5c9 2855
ad82864c
JB
2856 if (ada_is_constrained_packed_array_type (arr_type))
2857 return ada_array_length (decode_constrained_packed_array (arr), n);
14f9c5c9 2858
4c4b4cd2 2859 if (ada_is_simple_array_type (arr_type))
1eea4ebd
UW
2860 return (ada_array_bound_from_type (arr_type, n, 1)
2861 - ada_array_bound_from_type (arr_type, n, 0) + 1);
14f9c5c9 2862 else
1eea4ebd
UW
2863 return (value_as_long (desc_one_bound (desc_bounds (arr), n, 1))
2864 - value_as_long (desc_one_bound (desc_bounds (arr), n, 0)) + 1);
4c4b4cd2
PH
2865}
2866
2867/* An empty array whose type is that of ARR_TYPE (an array type),
2868 with bounds LOW to LOW-1. */
2869
2870static struct value *
2871empty_array (struct type *arr_type, int low)
2872{
b0dd7688 2873 struct type *arr_type0 = ada_check_typedef (arr_type);
6c038f32 2874 struct type *index_type =
b0dd7688 2875 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)),
0b5d8877 2876 low, low - 1);
b0dd7688 2877 struct type *elt_type = ada_array_element_type (arr_type0, 1);
5b4ee69b 2878
0b5d8877 2879 return allocate_value (create_array_type (NULL, elt_type, index_type));
14f9c5c9 2880}
14f9c5c9 2881\f
d2e4a39e 2882
4c4b4cd2 2883 /* Name resolution */
14f9c5c9 2884
4c4b4cd2
PH
2885/* The "decoded" name for the user-definable Ada operator corresponding
2886 to OP. */
14f9c5c9 2887
d2e4a39e 2888static const char *
4c4b4cd2 2889ada_decoded_op_name (enum exp_opcode op)
14f9c5c9
AS
2890{
2891 int i;
2892
4c4b4cd2 2893 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
14f9c5c9
AS
2894 {
2895 if (ada_opname_table[i].op == op)
4c4b4cd2 2896 return ada_opname_table[i].decoded;
14f9c5c9 2897 }
323e0a4a 2898 error (_("Could not find operator name for opcode"));
14f9c5c9
AS
2899}
2900
2901
4c4b4cd2
PH
2902/* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2903 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2904 undefined namespace) and converts operators that are
2905 user-defined into appropriate function calls. If CONTEXT_TYPE is
14f9c5c9
AS
2906 non-null, it provides a preferred result type [at the moment, only
2907 type void has any effect---causing procedures to be preferred over
2908 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
4c4b4cd2 2909 return type is preferred. May change (expand) *EXP. */
14f9c5c9 2910
4c4b4cd2
PH
2911static void
2912resolve (struct expression **expp, int void_context_p)
14f9c5c9 2913{
30b15541
UW
2914 struct type *context_type = NULL;
2915 int pc = 0;
2916
2917 if (void_context_p)
2918 context_type = builtin_type ((*expp)->gdbarch)->builtin_void;
2919
2920 resolve_subexp (expp, &pc, 1, context_type);
14f9c5c9
AS
2921}
2922
4c4b4cd2
PH
2923/* Resolve the operator of the subexpression beginning at
2924 position *POS of *EXPP. "Resolving" consists of replacing
2925 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2926 with their resolutions, replacing built-in operators with
2927 function calls to user-defined operators, where appropriate, and,
2928 when DEPROCEDURE_P is non-zero, converting function-valued variables
2929 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2930 are as in ada_resolve, above. */
14f9c5c9 2931
d2e4a39e 2932static struct value *
4c4b4cd2 2933resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
76a01679 2934 struct type *context_type)
14f9c5c9
AS
2935{
2936 int pc = *pos;
2937 int i;
4c4b4cd2 2938 struct expression *exp; /* Convenience: == *expp. */
14f9c5c9 2939 enum exp_opcode op = (*expp)->elts[pc].opcode;
4c4b4cd2
PH
2940 struct value **argvec; /* Vector of operand types (alloca'ed). */
2941 int nargs; /* Number of operands. */
52ce6436 2942 int oplen;
14f9c5c9
AS
2943
2944 argvec = NULL;
2945 nargs = 0;
2946 exp = *expp;
2947
52ce6436
PH
2948 /* Pass one: resolve operands, saving their types and updating *pos,
2949 if needed. */
14f9c5c9
AS
2950 switch (op)
2951 {
4c4b4cd2
PH
2952 case OP_FUNCALL:
2953 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
76a01679
JB
2954 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2955 *pos += 7;
4c4b4cd2
PH
2956 else
2957 {
2958 *pos += 3;
2959 resolve_subexp (expp, pos, 0, NULL);
2960 }
2961 nargs = longest_to_int (exp->elts[pc + 1].longconst);
14f9c5c9
AS
2962 break;
2963
14f9c5c9 2964 case UNOP_ADDR:
4c4b4cd2
PH
2965 *pos += 1;
2966 resolve_subexp (expp, pos, 0, NULL);
2967 break;
2968
52ce6436
PH
2969 case UNOP_QUAL:
2970 *pos += 3;
17466c1a 2971 resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type));
4c4b4cd2
PH
2972 break;
2973
52ce6436 2974 case OP_ATR_MODULUS:
4c4b4cd2
PH
2975 case OP_ATR_SIZE:
2976 case OP_ATR_TAG:
4c4b4cd2
PH
2977 case OP_ATR_FIRST:
2978 case OP_ATR_LAST:
2979 case OP_ATR_LENGTH:
2980 case OP_ATR_POS:
2981 case OP_ATR_VAL:
4c4b4cd2
PH
2982 case OP_ATR_MIN:
2983 case OP_ATR_MAX:
52ce6436
PH
2984 case TERNOP_IN_RANGE:
2985 case BINOP_IN_BOUNDS:
2986 case UNOP_IN_RANGE:
2987 case OP_AGGREGATE:
2988 case OP_OTHERS:
2989 case OP_CHOICES:
2990 case OP_POSITIONAL:
2991 case OP_DISCRETE_RANGE:
2992 case OP_NAME:
2993 ada_forward_operator_length (exp, pc, &oplen, &nargs);
2994 *pos += oplen;
14f9c5c9
AS
2995 break;
2996
2997 case BINOP_ASSIGN:
2998 {
4c4b4cd2
PH
2999 struct value *arg1;
3000
3001 *pos += 1;
3002 arg1 = resolve_subexp (expp, pos, 0, NULL);
3003 if (arg1 == NULL)
3004 resolve_subexp (expp, pos, 1, NULL);
3005 else
df407dfe 3006 resolve_subexp (expp, pos, 1, value_type (arg1));
4c4b4cd2 3007 break;
14f9c5c9
AS
3008 }
3009
4c4b4cd2 3010 case UNOP_CAST:
4c4b4cd2
PH
3011 *pos += 3;
3012 nargs = 1;
3013 break;
14f9c5c9 3014
4c4b4cd2
PH
3015 case BINOP_ADD:
3016 case BINOP_SUB:
3017 case BINOP_MUL:
3018 case BINOP_DIV:
3019 case BINOP_REM:
3020 case BINOP_MOD:
3021 case BINOP_EXP:
3022 case BINOP_CONCAT:
3023 case BINOP_LOGICAL_AND:
3024 case BINOP_LOGICAL_OR:
3025 case BINOP_BITWISE_AND:
3026 case BINOP_BITWISE_IOR:
3027 case BINOP_BITWISE_XOR:
14f9c5c9 3028
4c4b4cd2
PH
3029 case BINOP_EQUAL:
3030 case BINOP_NOTEQUAL:
3031 case BINOP_LESS:
3032 case BINOP_GTR:
3033 case BINOP_LEQ:
3034 case BINOP_GEQ:
14f9c5c9 3035
4c4b4cd2
PH
3036 case BINOP_REPEAT:
3037 case BINOP_SUBSCRIPT:
3038 case BINOP_COMMA:
40c8aaa9
JB
3039 *pos += 1;
3040 nargs = 2;
3041 break;
14f9c5c9 3042
4c4b4cd2
PH
3043 case UNOP_NEG:
3044 case UNOP_PLUS:
3045 case UNOP_LOGICAL_NOT:
3046 case UNOP_ABS:
3047 case UNOP_IND:
3048 *pos += 1;
3049 nargs = 1;
3050 break;
14f9c5c9 3051
4c4b4cd2
PH
3052 case OP_LONG:
3053 case OP_DOUBLE:
3054 case OP_VAR_VALUE:
3055 *pos += 4;
3056 break;
14f9c5c9 3057
4c4b4cd2
PH
3058 case OP_TYPE:
3059 case OP_BOOL:
3060 case OP_LAST:
4c4b4cd2
PH
3061 case OP_INTERNALVAR:
3062 *pos += 3;
3063 break;
14f9c5c9 3064
4c4b4cd2
PH
3065 case UNOP_MEMVAL:
3066 *pos += 3;
3067 nargs = 1;
3068 break;
3069
67f3407f
DJ
3070 case OP_REGISTER:
3071 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3072 break;
3073
4c4b4cd2
PH
3074 case STRUCTOP_STRUCT:
3075 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3076 nargs = 1;
3077 break;
3078
4c4b4cd2 3079 case TERNOP_SLICE:
4c4b4cd2
PH
3080 *pos += 1;
3081 nargs = 3;
3082 break;
3083
52ce6436 3084 case OP_STRING:
14f9c5c9 3085 break;
4c4b4cd2
PH
3086
3087 default:
323e0a4a 3088 error (_("Unexpected operator during name resolution"));
14f9c5c9
AS
3089 }
3090
76a01679 3091 argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
4c4b4cd2
PH
3092 for (i = 0; i < nargs; i += 1)
3093 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
3094 argvec[i] = NULL;
3095 exp = *expp;
3096
3097 /* Pass two: perform any resolution on principal operator. */
14f9c5c9
AS
3098 switch (op)
3099 {
3100 default:
3101 break;
3102
14f9c5c9 3103 case OP_VAR_VALUE:
4c4b4cd2 3104 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
76a01679
JB
3105 {
3106 struct ada_symbol_info *candidates;
3107 int n_candidates;
3108
3109 n_candidates =
3110 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3111 (exp->elts[pc + 2].symbol),
3112 exp->elts[pc + 1].block, VAR_DOMAIN,
d9680e73 3113 &candidates, 1);
76a01679
JB
3114
3115 if (n_candidates > 1)
3116 {
3117 /* Types tend to get re-introduced locally, so if there
3118 are any local symbols that are not types, first filter
3119 out all types. */
3120 int j;
3121 for (j = 0; j < n_candidates; j += 1)
3122 switch (SYMBOL_CLASS (candidates[j].sym))
3123 {
3124 case LOC_REGISTER:
3125 case LOC_ARG:
3126 case LOC_REF_ARG:
76a01679
JB
3127 case LOC_REGPARM_ADDR:
3128 case LOC_LOCAL:
76a01679 3129 case LOC_COMPUTED:
76a01679
JB
3130 goto FoundNonType;
3131 default:
3132 break;
3133 }
3134 FoundNonType:
3135 if (j < n_candidates)
3136 {
3137 j = 0;
3138 while (j < n_candidates)
3139 {
3140 if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
3141 {
3142 candidates[j] = candidates[n_candidates - 1];
3143 n_candidates -= 1;
3144 }
3145 else
3146 j += 1;
3147 }
3148 }
3149 }
3150
3151 if (n_candidates == 0)
323e0a4a 3152 error (_("No definition found for %s"),
76a01679
JB
3153 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3154 else if (n_candidates == 1)
3155 i = 0;
3156 else if (deprocedure_p
3157 && !is_nonfunction (candidates, n_candidates))
3158 {
06d5cf63
JB
3159 i = ada_resolve_function
3160 (candidates, n_candidates, NULL, 0,
3161 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
3162 context_type);
76a01679 3163 if (i < 0)
323e0a4a 3164 error (_("Could not find a match for %s"),
76a01679
JB
3165 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3166 }
3167 else
3168 {
323e0a4a 3169 printf_filtered (_("Multiple matches for %s\n"),
76a01679
JB
3170 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3171 user_select_syms (candidates, n_candidates, 1);
3172 i = 0;
3173 }
3174
3175 exp->elts[pc + 1].block = candidates[i].block;
3176 exp->elts[pc + 2].symbol = candidates[i].sym;
1265e4aa
JB
3177 if (innermost_block == NULL
3178 || contained_in (candidates[i].block, innermost_block))
76a01679
JB
3179 innermost_block = candidates[i].block;
3180 }
3181
3182 if (deprocedure_p
3183 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
3184 == TYPE_CODE_FUNC))
3185 {
3186 replace_operator_with_call (expp, pc, 0, 0,
3187 exp->elts[pc + 2].symbol,
3188 exp->elts[pc + 1].block);
3189 exp = *expp;
3190 }
14f9c5c9
AS
3191 break;
3192
3193 case OP_FUNCALL:
3194 {
4c4b4cd2 3195 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
76a01679 3196 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
4c4b4cd2
PH
3197 {
3198 struct ada_symbol_info *candidates;
3199 int n_candidates;
3200
3201 n_candidates =
76a01679
JB
3202 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3203 (exp->elts[pc + 5].symbol),
3204 exp->elts[pc + 4].block, VAR_DOMAIN,
d9680e73 3205 &candidates, 1);
4c4b4cd2
PH
3206 if (n_candidates == 1)
3207 i = 0;
3208 else
3209 {
06d5cf63
JB
3210 i = ada_resolve_function
3211 (candidates, n_candidates,
3212 argvec, nargs,
3213 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
3214 context_type);
4c4b4cd2 3215 if (i < 0)
323e0a4a 3216 error (_("Could not find a match for %s"),
4c4b4cd2
PH
3217 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
3218 }
3219
3220 exp->elts[pc + 4].block = candidates[i].block;
3221 exp->elts[pc + 5].symbol = candidates[i].sym;
1265e4aa
JB
3222 if (innermost_block == NULL
3223 || contained_in (candidates[i].block, innermost_block))
4c4b4cd2
PH
3224 innermost_block = candidates[i].block;
3225 }
14f9c5c9
AS
3226 }
3227 break;
3228 case BINOP_ADD:
3229 case BINOP_SUB:
3230 case BINOP_MUL:
3231 case BINOP_DIV:
3232 case BINOP_REM:
3233 case BINOP_MOD:
3234 case BINOP_CONCAT:
3235 case BINOP_BITWISE_AND:
3236 case BINOP_BITWISE_IOR:
3237 case BINOP_BITWISE_XOR:
3238 case BINOP_EQUAL:
3239 case BINOP_NOTEQUAL:
3240 case BINOP_LESS:
3241 case BINOP_GTR:
3242 case BINOP_LEQ:
3243 case BINOP_GEQ:
3244 case BINOP_EXP:
3245 case UNOP_NEG:
3246 case UNOP_PLUS:
3247 case UNOP_LOGICAL_NOT:
3248 case UNOP_ABS:
3249 if (possible_user_operator_p (op, argvec))
4c4b4cd2
PH
3250 {
3251 struct ada_symbol_info *candidates;
3252 int n_candidates;
3253
3254 n_candidates =
3255 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
3256 (struct block *) NULL, VAR_DOMAIN,
d9680e73 3257 &candidates, 1);
4c4b4cd2 3258 i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
76a01679 3259 ada_decoded_op_name (op), NULL);
4c4b4cd2
PH
3260 if (i < 0)
3261 break;
3262
76a01679
JB
3263 replace_operator_with_call (expp, pc, nargs, 1,
3264 candidates[i].sym, candidates[i].block);
4c4b4cd2
PH
3265 exp = *expp;
3266 }
14f9c5c9 3267 break;
4c4b4cd2
PH
3268
3269 case OP_TYPE:
b3dbf008 3270 case OP_REGISTER:
4c4b4cd2 3271 return NULL;
14f9c5c9
AS
3272 }
3273
3274 *pos = pc;
3275 return evaluate_subexp_type (exp, pos);
3276}
3277
3278/* Return non-zero if formal type FTYPE matches actual type ATYPE. If
4c4b4cd2 3279 MAY_DEREF is non-zero, the formal may be a pointer and the actual
5b3d5b7d 3280 a non-pointer. */
14f9c5c9 3281/* The term "match" here is rather loose. The match is heuristic and
5b3d5b7d 3282 liberal. */
14f9c5c9
AS
3283
3284static int
4dc81987 3285ada_type_match (struct type *ftype, struct type *atype, int may_deref)
14f9c5c9 3286{
61ee279c
PH
3287 ftype = ada_check_typedef (ftype);
3288 atype = ada_check_typedef (atype);
14f9c5c9
AS
3289
3290 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
3291 ftype = TYPE_TARGET_TYPE (ftype);
3292 if (TYPE_CODE (atype) == TYPE_CODE_REF)
3293 atype = TYPE_TARGET_TYPE (atype);
3294
d2e4a39e 3295 switch (TYPE_CODE (ftype))
14f9c5c9
AS
3296 {
3297 default:
5b3d5b7d 3298 return TYPE_CODE (ftype) == TYPE_CODE (atype);
14f9c5c9
AS
3299 case TYPE_CODE_PTR:
3300 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
4c4b4cd2
PH
3301 return ada_type_match (TYPE_TARGET_TYPE (ftype),
3302 TYPE_TARGET_TYPE (atype), 0);
d2e4a39e 3303 else
1265e4aa
JB
3304 return (may_deref
3305 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
14f9c5c9
AS
3306 case TYPE_CODE_INT:
3307 case TYPE_CODE_ENUM:
3308 case TYPE_CODE_RANGE:
3309 switch (TYPE_CODE (atype))
4c4b4cd2
PH
3310 {
3311 case TYPE_CODE_INT:
3312 case TYPE_CODE_ENUM:
3313 case TYPE_CODE_RANGE:
3314 return 1;
3315 default:
3316 return 0;
3317 }
14f9c5c9
AS
3318
3319 case TYPE_CODE_ARRAY:
d2e4a39e 3320 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
4c4b4cd2 3321 || ada_is_array_descriptor_type (atype));
14f9c5c9
AS
3322
3323 case TYPE_CODE_STRUCT:
4c4b4cd2
PH
3324 if (ada_is_array_descriptor_type (ftype))
3325 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3326 || ada_is_array_descriptor_type (atype));
14f9c5c9 3327 else
4c4b4cd2
PH
3328 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3329 && !ada_is_array_descriptor_type (atype));
14f9c5c9
AS
3330
3331 case TYPE_CODE_UNION:
3332 case TYPE_CODE_FLT:
3333 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3334 }
3335}
3336
3337/* Return non-zero if the formals of FUNC "sufficiently match" the
3338 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3339 may also be an enumeral, in which case it is treated as a 0-
4c4b4cd2 3340 argument function. */
14f9c5c9
AS
3341
3342static int
d2e4a39e 3343ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
14f9c5c9
AS
3344{
3345 int i;
d2e4a39e 3346 struct type *func_type = SYMBOL_TYPE (func);
14f9c5c9 3347
1265e4aa
JB
3348 if (SYMBOL_CLASS (func) == LOC_CONST
3349 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
14f9c5c9
AS
3350 return (n_actuals == 0);
3351 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3352 return 0;
3353
3354 if (TYPE_NFIELDS (func_type) != n_actuals)
3355 return 0;
3356
3357 for (i = 0; i < n_actuals; i += 1)
3358 {
4c4b4cd2 3359 if (actuals[i] == NULL)
76a01679
JB
3360 return 0;
3361 else
3362 {
5b4ee69b
MS
3363 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type,
3364 i));
df407dfe 3365 struct type *atype = ada_check_typedef (value_type (actuals[i]));
4c4b4cd2 3366
76a01679
JB
3367 if (!ada_type_match (ftype, atype, 1))
3368 return 0;
3369 }
14f9c5c9
AS
3370 }
3371 return 1;
3372}
3373
3374/* False iff function type FUNC_TYPE definitely does not produce a value
3375 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3376 FUNC_TYPE is not a valid function type with a non-null return type
3377 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3378
3379static int
d2e4a39e 3380return_match (struct type *func_type, struct type *context_type)
14f9c5c9 3381{
d2e4a39e 3382 struct type *return_type;
14f9c5c9
AS
3383
3384 if (func_type == NULL)
3385 return 1;
3386
4c4b4cd2 3387 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
18af8284 3388 return_type = get_base_type (TYPE_TARGET_TYPE (func_type));
4c4b4cd2 3389 else
18af8284 3390 return_type = get_base_type (func_type);
14f9c5c9
AS
3391 if (return_type == NULL)
3392 return 1;
3393
18af8284 3394 context_type = get_base_type (context_type);
14f9c5c9
AS
3395
3396 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3397 return context_type == NULL || return_type == context_type;
3398 else if (context_type == NULL)
3399 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3400 else
3401 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3402}
3403
3404
4c4b4cd2 3405/* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
14f9c5c9 3406 function (if any) that matches the types of the NARGS arguments in
4c4b4cd2
PH
3407 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3408 that returns that type, then eliminate matches that don't. If
3409 CONTEXT_TYPE is void and there is at least one match that does not
3410 return void, eliminate all matches that do.
3411
14f9c5c9
AS
3412 Asks the user if there is more than one match remaining. Returns -1
3413 if there is no such symbol or none is selected. NAME is used
4c4b4cd2
PH
3414 solely for messages. May re-arrange and modify SYMS in
3415 the process; the index returned is for the modified vector. */
14f9c5c9 3416
4c4b4cd2
PH
3417static int
3418ada_resolve_function (struct ada_symbol_info syms[],
3419 int nsyms, struct value **args, int nargs,
3420 const char *name, struct type *context_type)
14f9c5c9 3421{
30b15541 3422 int fallback;
14f9c5c9 3423 int k;
4c4b4cd2 3424 int m; /* Number of hits */
14f9c5c9 3425
d2e4a39e 3426 m = 0;
30b15541
UW
3427 /* In the first pass of the loop, we only accept functions matching
3428 context_type. If none are found, we add a second pass of the loop
3429 where every function is accepted. */
3430 for (fallback = 0; m == 0 && fallback < 2; fallback++)
14f9c5c9
AS
3431 {
3432 for (k = 0; k < nsyms; k += 1)
4c4b4cd2 3433 {
61ee279c 3434 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
4c4b4cd2
PH
3435
3436 if (ada_args_match (syms[k].sym, args, nargs)
30b15541 3437 && (fallback || return_match (type, context_type)))
4c4b4cd2
PH
3438 {
3439 syms[m] = syms[k];
3440 m += 1;
3441 }
3442 }
14f9c5c9
AS
3443 }
3444
3445 if (m == 0)
3446 return -1;
3447 else if (m > 1)
3448 {
323e0a4a 3449 printf_filtered (_("Multiple matches for %s\n"), name);
4c4b4cd2 3450 user_select_syms (syms, m, 1);
14f9c5c9
AS
3451 return 0;
3452 }
3453 return 0;
3454}
3455
4c4b4cd2
PH
3456/* Returns true (non-zero) iff decoded name N0 should appear before N1
3457 in a listing of choices during disambiguation (see sort_choices, below).
3458 The idea is that overloadings of a subprogram name from the
3459 same package should sort in their source order. We settle for ordering
3460 such symbols by their trailing number (__N or $N). */
3461
14f9c5c9 3462static int
0d5cff50 3463encoded_ordered_before (const char *N0, const char *N1)
14f9c5c9
AS
3464{
3465 if (N1 == NULL)
3466 return 0;
3467 else if (N0 == NULL)
3468 return 1;
3469 else
3470 {
3471 int k0, k1;
5b4ee69b 3472
d2e4a39e 3473 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
4c4b4cd2 3474 ;
d2e4a39e 3475 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
4c4b4cd2 3476 ;
d2e4a39e 3477 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
4c4b4cd2
PH
3478 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3479 {
3480 int n0, n1;
5b4ee69b 3481
4c4b4cd2
PH
3482 n0 = k0;
3483 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3484 n0 -= 1;
3485 n1 = k1;
3486 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3487 n1 -= 1;
3488 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3489 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3490 }
14f9c5c9
AS
3491 return (strcmp (N0, N1) < 0);
3492 }
3493}
d2e4a39e 3494
4c4b4cd2
PH
3495/* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3496 encoded names. */
3497
d2e4a39e 3498static void
4c4b4cd2 3499sort_choices (struct ada_symbol_info syms[], int nsyms)
14f9c5c9 3500{
4c4b4cd2 3501 int i;
5b4ee69b 3502
d2e4a39e 3503 for (i = 1; i < nsyms; i += 1)
14f9c5c9 3504 {
4c4b4cd2 3505 struct ada_symbol_info sym = syms[i];
14f9c5c9
AS
3506 int j;
3507
d2e4a39e 3508 for (j = i - 1; j >= 0; j -= 1)
4c4b4cd2
PH
3509 {
3510 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
3511 SYMBOL_LINKAGE_NAME (sym.sym)))
3512 break;
3513 syms[j + 1] = syms[j];
3514 }
d2e4a39e 3515 syms[j + 1] = sym;
14f9c5c9
AS
3516 }
3517}
3518
4c4b4cd2
PH
3519/* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3520 by asking the user (if necessary), returning the number selected,
3521 and setting the first elements of SYMS items. Error if no symbols
3522 selected. */
14f9c5c9
AS
3523
3524/* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
4c4b4cd2 3525 to be re-integrated one of these days. */
14f9c5c9
AS
3526
3527int
4c4b4cd2 3528user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
14f9c5c9
AS
3529{
3530 int i;
d2e4a39e 3531 int *chosen = (int *) alloca (sizeof (int) * nsyms);
14f9c5c9
AS
3532 int n_chosen;
3533 int first_choice = (max_results == 1) ? 1 : 2;
717d2f5a 3534 const char *select_mode = multiple_symbols_select_mode ();
14f9c5c9
AS
3535
3536 if (max_results < 1)
323e0a4a 3537 error (_("Request to select 0 symbols!"));
14f9c5c9
AS
3538 if (nsyms <= 1)
3539 return nsyms;
3540
717d2f5a
JB
3541 if (select_mode == multiple_symbols_cancel)
3542 error (_("\
3543canceled because the command is ambiguous\n\
3544See set/show multiple-symbol."));
3545
3546 /* If select_mode is "all", then return all possible symbols.
3547 Only do that if more than one symbol can be selected, of course.
3548 Otherwise, display the menu as usual. */
3549 if (select_mode == multiple_symbols_all && max_results > 1)
3550 return nsyms;
3551
323e0a4a 3552 printf_unfiltered (_("[0] cancel\n"));
14f9c5c9 3553 if (max_results > 1)
323e0a4a 3554 printf_unfiltered (_("[1] all\n"));
14f9c5c9 3555
4c4b4cd2 3556 sort_choices (syms, nsyms);
14f9c5c9
AS
3557
3558 for (i = 0; i < nsyms; i += 1)
3559 {
4c4b4cd2
PH
3560 if (syms[i].sym == NULL)
3561 continue;
3562
3563 if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
3564 {
76a01679
JB
3565 struct symtab_and_line sal =
3566 find_function_start_sal (syms[i].sym, 1);
5b4ee69b 3567
323e0a4a
AC
3568 if (sal.symtab == NULL)
3569 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3570 i + first_choice,
3571 SYMBOL_PRINT_NAME (syms[i].sym),
3572 sal.line);
3573 else
3574 printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
3575 SYMBOL_PRINT_NAME (syms[i].sym),
3576 sal.symtab->filename, sal.line);
4c4b4cd2
PH
3577 continue;
3578 }
d2e4a39e 3579 else
4c4b4cd2
PH
3580 {
3581 int is_enumeral =
3582 (SYMBOL_CLASS (syms[i].sym) == LOC_CONST
3583 && SYMBOL_TYPE (syms[i].sym) != NULL
3584 && TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
6f38eac8 3585 struct symtab *symtab = syms[i].sym->symtab;
4c4b4cd2
PH
3586
3587 if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
323e0a4a 3588 printf_unfiltered (_("[%d] %s at %s:%d\n"),
4c4b4cd2
PH
3589 i + first_choice,
3590 SYMBOL_PRINT_NAME (syms[i].sym),
3591 symtab->filename, SYMBOL_LINE (syms[i].sym));
76a01679
JB
3592 else if (is_enumeral
3593 && TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
4c4b4cd2 3594 {
a3f17187 3595 printf_unfiltered (("[%d] "), i + first_choice);
76a01679
JB
3596 ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
3597 gdb_stdout, -1, 0);
323e0a4a 3598 printf_unfiltered (_("'(%s) (enumeral)\n"),
4c4b4cd2
PH
3599 SYMBOL_PRINT_NAME (syms[i].sym));
3600 }
3601 else if (symtab != NULL)
3602 printf_unfiltered (is_enumeral
323e0a4a
AC
3603 ? _("[%d] %s in %s (enumeral)\n")
3604 : _("[%d] %s at %s:?\n"),
4c4b4cd2
PH
3605 i + first_choice,
3606 SYMBOL_PRINT_NAME (syms[i].sym),
3607 symtab->filename);
3608 else
3609 printf_unfiltered (is_enumeral
323e0a4a
AC
3610 ? _("[%d] %s (enumeral)\n")
3611 : _("[%d] %s at ?\n"),
4c4b4cd2
PH
3612 i + first_choice,
3613 SYMBOL_PRINT_NAME (syms[i].sym));
3614 }
14f9c5c9 3615 }
d2e4a39e 3616
14f9c5c9 3617 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
4c4b4cd2 3618 "overload-choice");
14f9c5c9
AS
3619
3620 for (i = 0; i < n_chosen; i += 1)
4c4b4cd2 3621 syms[i] = syms[chosen[i]];
14f9c5c9
AS
3622
3623 return n_chosen;
3624}
3625
3626/* Read and validate a set of numeric choices from the user in the
4c4b4cd2 3627 range 0 .. N_CHOICES-1. Place the results in increasing
14f9c5c9
AS
3628 order in CHOICES[0 .. N-1], and return N.
3629
3630 The user types choices as a sequence of numbers on one line
3631 separated by blanks, encoding them as follows:
3632
4c4b4cd2 3633 + A choice of 0 means to cancel the selection, throwing an error.
14f9c5c9
AS
3634 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3635 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3636
4c4b4cd2 3637 The user is not allowed to choose more than MAX_RESULTS values.
14f9c5c9
AS
3638
3639 ANNOTATION_SUFFIX, if present, is used to annotate the input
4c4b4cd2 3640 prompts (for use with the -f switch). */
14f9c5c9
AS
3641
3642int
d2e4a39e 3643get_selections (int *choices, int n_choices, int max_results,
4c4b4cd2 3644 int is_all_choice, char *annotation_suffix)
14f9c5c9 3645{
d2e4a39e 3646 char *args;
0bcd0149 3647 char *prompt;
14f9c5c9
AS
3648 int n_chosen;
3649 int first_choice = is_all_choice ? 2 : 1;
d2e4a39e 3650
14f9c5c9
AS
3651 prompt = getenv ("PS2");
3652 if (prompt == NULL)
0bcd0149 3653 prompt = "> ";
14f9c5c9 3654
0bcd0149 3655 args = command_line_input (prompt, 0, annotation_suffix);
d2e4a39e 3656
14f9c5c9 3657 if (args == NULL)
323e0a4a 3658 error_no_arg (_("one or more choice numbers"));
14f9c5c9
AS
3659
3660 n_chosen = 0;
76a01679 3661
4c4b4cd2
PH
3662 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3663 order, as given in args. Choices are validated. */
14f9c5c9
AS
3664 while (1)
3665 {
d2e4a39e 3666 char *args2;
14f9c5c9
AS
3667 int choice, j;
3668
0fcd72ba 3669 args = skip_spaces (args);
14f9c5c9 3670 if (*args == '\0' && n_chosen == 0)
323e0a4a 3671 error_no_arg (_("one or more choice numbers"));
14f9c5c9 3672 else if (*args == '\0')
4c4b4cd2 3673 break;
14f9c5c9
AS
3674
3675 choice = strtol (args, &args2, 10);
d2e4a39e 3676 if (args == args2 || choice < 0
4c4b4cd2 3677 || choice > n_choices + first_choice - 1)
323e0a4a 3678 error (_("Argument must be choice number"));
14f9c5c9
AS
3679 args = args2;
3680
d2e4a39e 3681 if (choice == 0)
323e0a4a 3682 error (_("cancelled"));
14f9c5c9
AS
3683
3684 if (choice < first_choice)
4c4b4cd2
PH
3685 {
3686 n_chosen = n_choices;
3687 for (j = 0; j < n_choices; j += 1)
3688 choices[j] = j;
3689 break;
3690 }
14f9c5c9
AS
3691 choice -= first_choice;
3692
d2e4a39e 3693 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
4c4b4cd2
PH
3694 {
3695 }
14f9c5c9
AS
3696
3697 if (j < 0 || choice != choices[j])
4c4b4cd2
PH
3698 {
3699 int k;
5b4ee69b 3700
4c4b4cd2
PH
3701 for (k = n_chosen - 1; k > j; k -= 1)
3702 choices[k + 1] = choices[k];
3703 choices[j + 1] = choice;
3704 n_chosen += 1;
3705 }
14f9c5c9
AS
3706 }
3707
3708 if (n_chosen > max_results)
323e0a4a 3709 error (_("Select no more than %d of the above"), max_results);
d2e4a39e 3710
14f9c5c9
AS
3711 return n_chosen;
3712}
3713
4c4b4cd2
PH
3714/* Replace the operator of length OPLEN at position PC in *EXPP with a call
3715 on the function identified by SYM and BLOCK, and taking NARGS
3716 arguments. Update *EXPP as needed to hold more space. */
14f9c5c9
AS
3717
3718static void
d2e4a39e 3719replace_operator_with_call (struct expression **expp, int pc, int nargs,
4c4b4cd2
PH
3720 int oplen, struct symbol *sym,
3721 struct block *block)
14f9c5c9
AS
3722{
3723 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4c4b4cd2 3724 symbol, -oplen for operator being replaced). */
d2e4a39e 3725 struct expression *newexp = (struct expression *)
8c1a34e7 3726 xzalloc (sizeof (struct expression)
4c4b4cd2 3727 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
d2e4a39e 3728 struct expression *exp = *expp;
14f9c5c9
AS
3729
3730 newexp->nelts = exp->nelts + 7 - oplen;
3731 newexp->language_defn = exp->language_defn;
3489610d 3732 newexp->gdbarch = exp->gdbarch;
14f9c5c9 3733 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
d2e4a39e 3734 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
4c4b4cd2 3735 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
14f9c5c9
AS
3736
3737 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
3738 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
3739
3740 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
3741 newexp->elts[pc + 4].block = block;
3742 newexp->elts[pc + 5].symbol = sym;
3743
3744 *expp = newexp;
aacb1f0a 3745 xfree (exp);
d2e4a39e 3746}
14f9c5c9
AS
3747
3748/* Type-class predicates */
3749
4c4b4cd2
PH
3750/* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3751 or FLOAT). */
14f9c5c9
AS
3752
3753static int
d2e4a39e 3754numeric_type_p (struct type *type)
14f9c5c9
AS
3755{
3756 if (type == NULL)
3757 return 0;
d2e4a39e
AS
3758 else
3759 {
3760 switch (TYPE_CODE (type))
4c4b4cd2
PH
3761 {
3762 case TYPE_CODE_INT:
3763 case TYPE_CODE_FLT:
3764 return 1;
3765 case TYPE_CODE_RANGE:
3766 return (type == TYPE_TARGET_TYPE (type)
3767 || numeric_type_p (TYPE_TARGET_TYPE (type)));
3768 default:
3769 return 0;
3770 }
d2e4a39e 3771 }
14f9c5c9
AS
3772}
3773
4c4b4cd2 3774/* True iff TYPE is integral (an INT or RANGE of INTs). */
14f9c5c9
AS
3775
3776static int
d2e4a39e 3777integer_type_p (struct type *type)
14f9c5c9
AS
3778{
3779 if (type == NULL)
3780 return 0;
d2e4a39e
AS
3781 else
3782 {
3783 switch (TYPE_CODE (type))
4c4b4cd2
PH
3784 {
3785 case TYPE_CODE_INT:
3786 return 1;
3787 case TYPE_CODE_RANGE:
3788 return (type == TYPE_TARGET_TYPE (type)
3789 || integer_type_p (TYPE_TARGET_TYPE (type)));
3790 default:
3791 return 0;
3792 }
d2e4a39e 3793 }
14f9c5c9
AS
3794}
3795
4c4b4cd2 3796/* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
14f9c5c9
AS
3797
3798static int
d2e4a39e 3799scalar_type_p (struct type *type)
14f9c5c9
AS
3800{
3801 if (type == NULL)
3802 return 0;
d2e4a39e
AS
3803 else
3804 {
3805 switch (TYPE_CODE (type))
4c4b4cd2
PH
3806 {
3807 case TYPE_CODE_INT:
3808 case TYPE_CODE_RANGE:
3809 case TYPE_CODE_ENUM:
3810 case TYPE_CODE_FLT:
3811 return 1;
3812 default:
3813 return 0;
3814 }
d2e4a39e 3815 }
14f9c5c9
AS
3816}
3817
4c4b4cd2 3818/* True iff TYPE is discrete (INT, RANGE, ENUM). */
14f9c5c9
AS
3819
3820static int
d2e4a39e 3821discrete_type_p (struct type *type)
14f9c5c9
AS
3822{
3823 if (type == NULL)
3824 return 0;
d2e4a39e
AS
3825 else
3826 {
3827 switch (TYPE_CODE (type))
4c4b4cd2
PH
3828 {
3829 case TYPE_CODE_INT:
3830 case TYPE_CODE_RANGE:
3831 case TYPE_CODE_ENUM:
872f0337 3832 case TYPE_CODE_BOOL:
4c4b4cd2
PH
3833 return 1;
3834 default:
3835 return 0;
3836 }
d2e4a39e 3837 }
14f9c5c9
AS
3838}
3839
4c4b4cd2
PH
3840/* Returns non-zero if OP with operands in the vector ARGS could be
3841 a user-defined function. Errs on the side of pre-defined operators
3842 (i.e., result 0). */
14f9c5c9
AS
3843
3844static int
d2e4a39e 3845possible_user_operator_p (enum exp_opcode op, struct value *args[])
14f9c5c9 3846{
76a01679 3847 struct type *type0 =
df407dfe 3848 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
d2e4a39e 3849 struct type *type1 =
df407dfe 3850 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
d2e4a39e 3851
4c4b4cd2
PH
3852 if (type0 == NULL)
3853 return 0;
3854
14f9c5c9
AS
3855 switch (op)
3856 {
3857 default:
3858 return 0;
3859
3860 case BINOP_ADD:
3861 case BINOP_SUB:
3862 case BINOP_MUL:
3863 case BINOP_DIV:
d2e4a39e 3864 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
14f9c5c9
AS
3865
3866 case BINOP_REM:
3867 case BINOP_MOD:
3868 case BINOP_BITWISE_AND:
3869 case BINOP_BITWISE_IOR:
3870 case BINOP_BITWISE_XOR:
d2e4a39e 3871 return (!(integer_type_p (type0) && integer_type_p (type1)));
14f9c5c9
AS
3872
3873 case BINOP_EQUAL:
3874 case BINOP_NOTEQUAL:
3875 case BINOP_LESS:
3876 case BINOP_GTR:
3877 case BINOP_LEQ:
3878 case BINOP_GEQ:
d2e4a39e 3879 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
14f9c5c9
AS
3880
3881 case BINOP_CONCAT:
ee90b9ab 3882 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
14f9c5c9
AS
3883
3884 case BINOP_EXP:
d2e4a39e 3885 return (!(numeric_type_p (type0) && integer_type_p (type1)));
14f9c5c9
AS
3886
3887 case UNOP_NEG:
3888 case UNOP_PLUS:
3889 case UNOP_LOGICAL_NOT:
d2e4a39e
AS
3890 case UNOP_ABS:
3891 return (!numeric_type_p (type0));
14f9c5c9
AS
3892
3893 }
3894}
3895\f
4c4b4cd2 3896 /* Renaming */
14f9c5c9 3897
aeb5907d
JB
3898/* NOTES:
3899
3900 1. In the following, we assume that a renaming type's name may
3901 have an ___XD suffix. It would be nice if this went away at some
3902 point.
3903 2. We handle both the (old) purely type-based representation of
3904 renamings and the (new) variable-based encoding. At some point,
3905 it is devoutly to be hoped that the former goes away
3906 (FIXME: hilfinger-2007-07-09).
3907 3. Subprogram renamings are not implemented, although the XRS
3908 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3909
3910/* If SYM encodes a renaming,
3911
3912 <renaming> renames <renamed entity>,
3913
3914 sets *LEN to the length of the renamed entity's name,
3915 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3916 the string describing the subcomponent selected from the renamed
0963b4bd 3917 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
aeb5907d
JB
3918 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3919 are undefined). Otherwise, returns a value indicating the category
3920 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3921 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3922 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3923 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3924 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3925 may be NULL, in which case they are not assigned.
3926
3927 [Currently, however, GCC does not generate subprogram renamings.] */
3928
3929enum ada_renaming_category
3930ada_parse_renaming (struct symbol *sym,
3931 const char **renamed_entity, int *len,
3932 const char **renaming_expr)
3933{
3934 enum ada_renaming_category kind;
3935 const char *info;
3936 const char *suffix;
3937
3938 if (sym == NULL)
3939 return ADA_NOT_RENAMING;
3940 switch (SYMBOL_CLASS (sym))
14f9c5c9 3941 {
aeb5907d
JB
3942 default:
3943 return ADA_NOT_RENAMING;
3944 case LOC_TYPEDEF:
3945 return parse_old_style_renaming (SYMBOL_TYPE (sym),
3946 renamed_entity, len, renaming_expr);
3947 case LOC_LOCAL:
3948 case LOC_STATIC:
3949 case LOC_COMPUTED:
3950 case LOC_OPTIMIZED_OUT:
3951 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
3952 if (info == NULL)
3953 return ADA_NOT_RENAMING;
3954 switch (info[5])
3955 {
3956 case '_':
3957 kind = ADA_OBJECT_RENAMING;
3958 info += 6;
3959 break;
3960 case 'E':
3961 kind = ADA_EXCEPTION_RENAMING;
3962 info += 7;
3963 break;
3964 case 'P':
3965 kind = ADA_PACKAGE_RENAMING;
3966 info += 7;
3967 break;
3968 case 'S':
3969 kind = ADA_SUBPROGRAM_RENAMING;
3970 info += 7;
3971 break;
3972 default:
3973 return ADA_NOT_RENAMING;
3974 }
14f9c5c9 3975 }
4c4b4cd2 3976
aeb5907d
JB
3977 if (renamed_entity != NULL)
3978 *renamed_entity = info;
3979 suffix = strstr (info, "___XE");
3980 if (suffix == NULL || suffix == info)
3981 return ADA_NOT_RENAMING;
3982 if (len != NULL)
3983 *len = strlen (info) - strlen (suffix);
3984 suffix += 5;
3985 if (renaming_expr != NULL)
3986 *renaming_expr = suffix;
3987 return kind;
3988}
3989
3990/* Assuming TYPE encodes a renaming according to the old encoding in
3991 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3992 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3993 ADA_NOT_RENAMING otherwise. */
3994static enum ada_renaming_category
3995parse_old_style_renaming (struct type *type,
3996 const char **renamed_entity, int *len,
3997 const char **renaming_expr)
3998{
3999 enum ada_renaming_category kind;
4000 const char *name;
4001 const char *info;
4002 const char *suffix;
14f9c5c9 4003
aeb5907d
JB
4004 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
4005 || TYPE_NFIELDS (type) != 1)
4006 return ADA_NOT_RENAMING;
14f9c5c9 4007
aeb5907d
JB
4008 name = type_name_no_tag (type);
4009 if (name == NULL)
4010 return ADA_NOT_RENAMING;
4011
4012 name = strstr (name, "___XR");
4013 if (name == NULL)
4014 return ADA_NOT_RENAMING;
4015 switch (name[5])
4016 {
4017 case '\0':
4018 case '_':
4019 kind = ADA_OBJECT_RENAMING;
4020 break;
4021 case 'E':
4022 kind = ADA_EXCEPTION_RENAMING;
4023 break;
4024 case 'P':
4025 kind = ADA_PACKAGE_RENAMING;
4026 break;
4027 case 'S':
4028 kind = ADA_SUBPROGRAM_RENAMING;
4029 break;
4030 default:
4031 return ADA_NOT_RENAMING;
4032 }
14f9c5c9 4033
aeb5907d
JB
4034 info = TYPE_FIELD_NAME (type, 0);
4035 if (info == NULL)
4036 return ADA_NOT_RENAMING;
4037 if (renamed_entity != NULL)
4038 *renamed_entity = info;
4039 suffix = strstr (info, "___XE");
4040 if (renaming_expr != NULL)
4041 *renaming_expr = suffix + 5;
4042 if (suffix == NULL || suffix == info)
4043 return ADA_NOT_RENAMING;
4044 if (len != NULL)
4045 *len = suffix - info;
4046 return kind;
a5ee536b
JB
4047}
4048
4049/* Compute the value of the given RENAMING_SYM, which is expected to
4050 be a symbol encoding a renaming expression. BLOCK is the block
4051 used to evaluate the renaming. */
52ce6436 4052
a5ee536b
JB
4053static struct value *
4054ada_read_renaming_var_value (struct symbol *renaming_sym,
4055 struct block *block)
4056{
4057 char *sym_name;
4058 struct expression *expr;
4059 struct value *value;
4060 struct cleanup *old_chain = NULL;
4061
4062 sym_name = xstrdup (SYMBOL_LINKAGE_NAME (renaming_sym));
4063 old_chain = make_cleanup (xfree, sym_name);
1bb9788d 4064 expr = parse_exp_1 (&sym_name, 0, block, 0);
a5ee536b
JB
4065 make_cleanup (free_current_contents, &expr);
4066 value = evaluate_expression (expr);
4067
4068 do_cleanups (old_chain);
4069 return value;
4070}
14f9c5c9 4071\f
d2e4a39e 4072
4c4b4cd2 4073 /* Evaluation: Function Calls */
14f9c5c9 4074
4c4b4cd2 4075/* Return an lvalue containing the value VAL. This is the identity on
40bc484c
JB
4076 lvalues, and otherwise has the side-effect of allocating memory
4077 in the inferior where a copy of the value contents is copied. */
14f9c5c9 4078
d2e4a39e 4079static struct value *
40bc484c 4080ensure_lval (struct value *val)
14f9c5c9 4081{
40bc484c
JB
4082 if (VALUE_LVAL (val) == not_lval
4083 || VALUE_LVAL (val) == lval_internalvar)
c3e5cd34 4084 {
df407dfe 4085 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
40bc484c
JB
4086 const CORE_ADDR addr =
4087 value_as_long (value_allocate_space_in_inferior (len));
c3e5cd34 4088
40bc484c 4089 set_value_address (val, addr);
a84a8a0d 4090 VALUE_LVAL (val) = lval_memory;
40bc484c 4091 write_memory (addr, value_contents (val), len);
c3e5cd34 4092 }
14f9c5c9
AS
4093
4094 return val;
4095}
4096
4097/* Return the value ACTUAL, converted to be an appropriate value for a
4098 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4099 allocating any necessary descriptors (fat pointers), or copies of
4c4b4cd2 4100 values not residing in memory, updating it as needed. */
14f9c5c9 4101
a93c0eb6 4102struct value *
40bc484c 4103ada_convert_actual (struct value *actual, struct type *formal_type0)
14f9c5c9 4104{
df407dfe 4105 struct type *actual_type = ada_check_typedef (value_type (actual));
61ee279c 4106 struct type *formal_type = ada_check_typedef (formal_type0);
d2e4a39e
AS
4107 struct type *formal_target =
4108 TYPE_CODE (formal_type) == TYPE_CODE_PTR
61ee279c 4109 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
d2e4a39e
AS
4110 struct type *actual_target =
4111 TYPE_CODE (actual_type) == TYPE_CODE_PTR
61ee279c 4112 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
14f9c5c9 4113
4c4b4cd2 4114 if (ada_is_array_descriptor_type (formal_target)
14f9c5c9 4115 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
40bc484c 4116 return make_array_descriptor (formal_type, actual);
a84a8a0d
JB
4117 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
4118 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
14f9c5c9 4119 {
a84a8a0d 4120 struct value *result;
5b4ee69b 4121
14f9c5c9 4122 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
4c4b4cd2 4123 && ada_is_array_descriptor_type (actual_target))
a84a8a0d 4124 result = desc_data (actual);
14f9c5c9 4125 else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
4c4b4cd2
PH
4126 {
4127 if (VALUE_LVAL (actual) != lval_memory)
4128 {
4129 struct value *val;
5b4ee69b 4130
df407dfe 4131 actual_type = ada_check_typedef (value_type (actual));
4c4b4cd2 4132 val = allocate_value (actual_type);
990a07ab 4133 memcpy ((char *) value_contents_raw (val),
0fd88904 4134 (char *) value_contents (actual),
4c4b4cd2 4135 TYPE_LENGTH (actual_type));
40bc484c 4136 actual = ensure_lval (val);
4c4b4cd2 4137 }
a84a8a0d 4138 result = value_addr (actual);
4c4b4cd2 4139 }
a84a8a0d
JB
4140 else
4141 return actual;
b1af9e97 4142 return value_cast_pointers (formal_type, result, 0);
14f9c5c9
AS
4143 }
4144 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
4145 return ada_value_ind (actual);
4146
4147 return actual;
4148}
4149
438c98a1
JB
4150/* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4151 type TYPE. This is usually an inefficient no-op except on some targets
4152 (such as AVR) where the representation of a pointer and an address
4153 differs. */
4154
4155static CORE_ADDR
4156value_pointer (struct value *value, struct type *type)
4157{
4158 struct gdbarch *gdbarch = get_type_arch (type);
4159 unsigned len = TYPE_LENGTH (type);
4160 gdb_byte *buf = alloca (len);
4161 CORE_ADDR addr;
4162
4163 addr = value_address (value);
4164 gdbarch_address_to_pointer (gdbarch, type, buf, addr);
4165 addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch));
4166 return addr;
4167}
4168
14f9c5c9 4169
4c4b4cd2
PH
4170/* Push a descriptor of type TYPE for array value ARR on the stack at
4171 *SP, updating *SP to reflect the new descriptor. Return either
14f9c5c9 4172 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4c4b4cd2
PH
4173 to-descriptor type rather than a descriptor type), a struct value *
4174 representing a pointer to this descriptor. */
14f9c5c9 4175
d2e4a39e 4176static struct value *
40bc484c 4177make_array_descriptor (struct type *type, struct value *arr)
14f9c5c9 4178{
d2e4a39e
AS
4179 struct type *bounds_type = desc_bounds_type (type);
4180 struct type *desc_type = desc_base_type (type);
4181 struct value *descriptor = allocate_value (desc_type);
4182 struct value *bounds = allocate_value (bounds_type);
14f9c5c9 4183 int i;
d2e4a39e 4184
0963b4bd
MS
4185 for (i = ada_array_arity (ada_check_typedef (value_type (arr)));
4186 i > 0; i -= 1)
14f9c5c9 4187 {
19f220c3
JK
4188 modify_field (value_type (bounds), value_contents_writeable (bounds),
4189 ada_array_bound (arr, i, 0),
4190 desc_bound_bitpos (bounds_type, i, 0),
4191 desc_bound_bitsize (bounds_type, i, 0));
4192 modify_field (value_type (bounds), value_contents_writeable (bounds),
4193 ada_array_bound (arr, i, 1),
4194 desc_bound_bitpos (bounds_type, i, 1),
4195 desc_bound_bitsize (bounds_type, i, 1));
14f9c5c9 4196 }
d2e4a39e 4197
40bc484c 4198 bounds = ensure_lval (bounds);
d2e4a39e 4199
19f220c3
JK
4200 modify_field (value_type (descriptor),
4201 value_contents_writeable (descriptor),
4202 value_pointer (ensure_lval (arr),
4203 TYPE_FIELD_TYPE (desc_type, 0)),
4204 fat_pntr_data_bitpos (desc_type),
4205 fat_pntr_data_bitsize (desc_type));
4206
4207 modify_field (value_type (descriptor),
4208 value_contents_writeable (descriptor),
4209 value_pointer (bounds,
4210 TYPE_FIELD_TYPE (desc_type, 1)),
4211 fat_pntr_bounds_bitpos (desc_type),
4212 fat_pntr_bounds_bitsize (desc_type));
14f9c5c9 4213
40bc484c 4214 descriptor = ensure_lval (descriptor);
14f9c5c9
AS
4215
4216 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4217 return value_addr (descriptor);
4218 else
4219 return descriptor;
4220}
14f9c5c9 4221\f
963a6417 4222/* Dummy definitions for an experimental caching module that is not
0963b4bd 4223 * used in the public sources. */
96d887e8 4224
96d887e8
PH
4225static int
4226lookup_cached_symbol (const char *name, domain_enum namespace,
2570f2b7 4227 struct symbol **sym, struct block **block)
96d887e8
PH
4228{
4229 return 0;
4230}
4231
4232static void
4233cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
2570f2b7 4234 struct block *block)
96d887e8
PH
4235{
4236}
4c4b4cd2
PH
4237\f
4238 /* Symbol Lookup */
4239
c0431670
JB
4240/* Return nonzero if wild matching should be used when searching for
4241 all symbols matching LOOKUP_NAME.
4242
4243 LOOKUP_NAME is expected to be a symbol name after transformation
4244 for Ada lookups (see ada_name_for_lookup). */
4245
4246static int
4247should_use_wild_match (const char *lookup_name)
4248{
4249 return (strstr (lookup_name, "__") == NULL);
4250}
4251
4c4b4cd2
PH
4252/* Return the result of a standard (literal, C-like) lookup of NAME in
4253 given DOMAIN, visible from lexical block BLOCK. */
4254
4255static struct symbol *
4256standard_lookup (const char *name, const struct block *block,
4257 domain_enum domain)
4258{
acbd605d
MGD
4259 /* Initialize it just to avoid a GCC false warning. */
4260 struct symbol *sym = NULL;
4c4b4cd2 4261
2570f2b7 4262 if (lookup_cached_symbol (name, domain, &sym, NULL))
4c4b4cd2 4263 return sym;
2570f2b7
UW
4264 sym = lookup_symbol_in_language (name, block, domain, language_c, 0);
4265 cache_symbol (name, domain, sym, block_found);
4c4b4cd2
PH
4266 return sym;
4267}
4268
4269
4270/* Non-zero iff there is at least one non-function/non-enumeral symbol
4271 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4272 since they contend in overloading in the same way. */
4273static int
4274is_nonfunction (struct ada_symbol_info syms[], int n)
4275{
4276 int i;
4277
4278 for (i = 0; i < n; i += 1)
4279 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
4280 && (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
4281 || SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
14f9c5c9
AS
4282 return 1;
4283
4284 return 0;
4285}
4286
4287/* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4c4b4cd2 4288 struct types. Otherwise, they may not. */
14f9c5c9
AS
4289
4290static int
d2e4a39e 4291equiv_types (struct type *type0, struct type *type1)
14f9c5c9 4292{
d2e4a39e 4293 if (type0 == type1)
14f9c5c9 4294 return 1;
d2e4a39e 4295 if (type0 == NULL || type1 == NULL
14f9c5c9
AS
4296 || TYPE_CODE (type0) != TYPE_CODE (type1))
4297 return 0;
d2e4a39e 4298 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
14f9c5c9
AS
4299 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
4300 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
4c4b4cd2 4301 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
14f9c5c9 4302 return 1;
d2e4a39e 4303
14f9c5c9
AS
4304 return 0;
4305}
4306
4307/* True iff SYM0 represents the same entity as SYM1, or one that is
4c4b4cd2 4308 no more defined than that of SYM1. */
14f9c5c9
AS
4309
4310static int
d2e4a39e 4311lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
14f9c5c9
AS
4312{
4313 if (sym0 == sym1)
4314 return 1;
176620f1 4315 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
14f9c5c9
AS
4316 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
4317 return 0;
4318
d2e4a39e 4319 switch (SYMBOL_CLASS (sym0))
14f9c5c9
AS
4320 {
4321 case LOC_UNDEF:
4322 return 1;
4323 case LOC_TYPEDEF:
4324 {
4c4b4cd2
PH
4325 struct type *type0 = SYMBOL_TYPE (sym0);
4326 struct type *type1 = SYMBOL_TYPE (sym1);
0d5cff50
DE
4327 const char *name0 = SYMBOL_LINKAGE_NAME (sym0);
4328 const char *name1 = SYMBOL_LINKAGE_NAME (sym1);
4c4b4cd2 4329 int len0 = strlen (name0);
5b4ee69b 4330
4c4b4cd2
PH
4331 return
4332 TYPE_CODE (type0) == TYPE_CODE (type1)
4333 && (equiv_types (type0, type1)
4334 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
4335 && strncmp (name1 + len0, "___XV", 5) == 0));
14f9c5c9
AS
4336 }
4337 case LOC_CONST:
4338 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
4c4b4cd2 4339 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
d2e4a39e
AS
4340 default:
4341 return 0;
14f9c5c9
AS
4342 }
4343}
4344
4c4b4cd2
PH
4345/* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4346 records in OBSTACKP. Do nothing if SYM is a duplicate. */
14f9c5c9
AS
4347
4348static void
76a01679
JB
4349add_defn_to_vec (struct obstack *obstackp,
4350 struct symbol *sym,
2570f2b7 4351 struct block *block)
14f9c5c9
AS
4352{
4353 int i;
4c4b4cd2 4354 struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
14f9c5c9 4355
529cad9c
PH
4356 /* Do not try to complete stub types, as the debugger is probably
4357 already scanning all symbols matching a certain name at the
4358 time when this function is called. Trying to replace the stub
4359 type by its associated full type will cause us to restart a scan
4360 which may lead to an infinite recursion. Instead, the client
4361 collecting the matching symbols will end up collecting several
4362 matches, with at least one of them complete. It can then filter
4363 out the stub ones if needed. */
4364
4c4b4cd2
PH
4365 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4366 {
4367 if (lesseq_defined_than (sym, prevDefns[i].sym))
4368 return;
4369 else if (lesseq_defined_than (prevDefns[i].sym, sym))
4370 {
4371 prevDefns[i].sym = sym;
4372 prevDefns[i].block = block;
4c4b4cd2 4373 return;
76a01679 4374 }
4c4b4cd2
PH
4375 }
4376
4377 {
4378 struct ada_symbol_info info;
4379
4380 info.sym = sym;
4381 info.block = block;
4c4b4cd2
PH
4382 obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
4383 }
4384}
4385
4386/* Number of ada_symbol_info structures currently collected in
4387 current vector in *OBSTACKP. */
4388
76a01679
JB
4389static int
4390num_defns_collected (struct obstack *obstackp)
4c4b4cd2
PH
4391{
4392 return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
4393}
4394
4395/* Vector of ada_symbol_info structures currently collected in current
4396 vector in *OBSTACKP. If FINISH, close off the vector and return
4397 its final address. */
4398
76a01679 4399static struct ada_symbol_info *
4c4b4cd2
PH
4400defns_collected (struct obstack *obstackp, int finish)
4401{
4402 if (finish)
4403 return obstack_finish (obstackp);
4404 else
4405 return (struct ada_symbol_info *) obstack_base (obstackp);
4406}
4407
96d887e8 4408/* Return a minimal symbol matching NAME according to Ada decoding
2e6e0353
JB
4409 rules. Returns NULL if there is no such minimal symbol. Names
4410 prefixed with "standard__" are handled specially: "standard__" is
96d887e8 4411 first stripped off, and only static and global symbols are searched. */
4c4b4cd2 4412
96d887e8
PH
4413struct minimal_symbol *
4414ada_lookup_simple_minsym (const char *name)
4c4b4cd2 4415{
4c4b4cd2 4416 struct objfile *objfile;
96d887e8 4417 struct minimal_symbol *msymbol;
dc4024cd 4418 const int wild_match_p = should_use_wild_match (name);
4c4b4cd2 4419
c0431670
JB
4420 /* Special case: If the user specifies a symbol name inside package
4421 Standard, do a non-wild matching of the symbol name without
4422 the "standard__" prefix. This was primarily introduced in order
4423 to allow the user to specifically access the standard exceptions
4424 using, for instance, Standard.Constraint_Error when Constraint_Error
4425 is ambiguous (due to the user defining its own Constraint_Error
4426 entity inside its program). */
96d887e8 4427 if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
c0431670 4428 name += sizeof ("standard__") - 1;
4c4b4cd2 4429
96d887e8
PH
4430 ALL_MSYMBOLS (objfile, msymbol)
4431 {
dc4024cd 4432 if (match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match_p)
96d887e8
PH
4433 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4434 return msymbol;
4435 }
4c4b4cd2 4436
96d887e8
PH
4437 return NULL;
4438}
4c4b4cd2 4439
96d887e8
PH
4440/* For all subprograms that statically enclose the subprogram of the
4441 selected frame, add symbols matching identifier NAME in DOMAIN
4442 and their blocks to the list of data in OBSTACKP, as for
48b78332
JB
4443 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4444 with a wildcard prefix. */
4c4b4cd2 4445
96d887e8
PH
4446static void
4447add_symbols_from_enclosing_procs (struct obstack *obstackp,
76a01679 4448 const char *name, domain_enum namespace,
48b78332 4449 int wild_match_p)
96d887e8 4450{
96d887e8 4451}
14f9c5c9 4452
96d887e8
PH
4453/* True if TYPE is definitely an artificial type supplied to a symbol
4454 for which no debugging information was given in the symbol file. */
14f9c5c9 4455
96d887e8
PH
4456static int
4457is_nondebugging_type (struct type *type)
4458{
0d5cff50 4459 const char *name = ada_type_name (type);
5b4ee69b 4460
96d887e8
PH
4461 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4462}
4c4b4cd2 4463
8f17729f
JB
4464/* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4465 that are deemed "identical" for practical purposes.
4466
4467 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4468 types and that their number of enumerals is identical (in other
4469 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4470
4471static int
4472ada_identical_enum_types_p (struct type *type1, struct type *type2)
4473{
4474 int i;
4475
4476 /* The heuristic we use here is fairly conservative. We consider
4477 that 2 enumerate types are identical if they have the same
4478 number of enumerals and that all enumerals have the same
4479 underlying value and name. */
4480
4481 /* All enums in the type should have an identical underlying value. */
4482 for (i = 0; i < TYPE_NFIELDS (type1); i++)
14e75d8e 4483 if (TYPE_FIELD_ENUMVAL (type1, i) != TYPE_FIELD_ENUMVAL (type2, i))
8f17729f
JB
4484 return 0;
4485
4486 /* All enumerals should also have the same name (modulo any numerical
4487 suffix). */
4488 for (i = 0; i < TYPE_NFIELDS (type1); i++)
4489 {
0d5cff50
DE
4490 const char *name_1 = TYPE_FIELD_NAME (type1, i);
4491 const char *name_2 = TYPE_FIELD_NAME (type2, i);
8f17729f
JB
4492 int len_1 = strlen (name_1);
4493 int len_2 = strlen (name_2);
4494
4495 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1);
4496 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2);
4497 if (len_1 != len_2
4498 || strncmp (TYPE_FIELD_NAME (type1, i),
4499 TYPE_FIELD_NAME (type2, i),
4500 len_1) != 0)
4501 return 0;
4502 }
4503
4504 return 1;
4505}
4506
4507/* Return nonzero if all the symbols in SYMS are all enumeral symbols
4508 that are deemed "identical" for practical purposes. Sometimes,
4509 enumerals are not strictly identical, but their types are so similar
4510 that they can be considered identical.
4511
4512 For instance, consider the following code:
4513
4514 type Color is (Black, Red, Green, Blue, White);
4515 type RGB_Color is new Color range Red .. Blue;
4516
4517 Type RGB_Color is a subrange of an implicit type which is a copy
4518 of type Color. If we call that implicit type RGB_ColorB ("B" is
4519 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4520 As a result, when an expression references any of the enumeral
4521 by name (Eg. "print green"), the expression is technically
4522 ambiguous and the user should be asked to disambiguate. But
4523 doing so would only hinder the user, since it wouldn't matter
4524 what choice he makes, the outcome would always be the same.
4525 So, for practical purposes, we consider them as the same. */
4526
4527static int
4528symbols_are_identical_enums (struct ada_symbol_info *syms, int nsyms)
4529{
4530 int i;
4531
4532 /* Before performing a thorough comparison check of each type,
4533 we perform a series of inexpensive checks. We expect that these
4534 checks will quickly fail in the vast majority of cases, and thus
4535 help prevent the unnecessary use of a more expensive comparison.
4536 Said comparison also expects us to make some of these checks
4537 (see ada_identical_enum_types_p). */
4538
4539 /* Quick check: All symbols should have an enum type. */
4540 for (i = 0; i < nsyms; i++)
4541 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM)
4542 return 0;
4543
4544 /* Quick check: They should all have the same value. */
4545 for (i = 1; i < nsyms; i++)
4546 if (SYMBOL_VALUE (syms[i].sym) != SYMBOL_VALUE (syms[0].sym))
4547 return 0;
4548
4549 /* Quick check: They should all have the same number of enumerals. */
4550 for (i = 1; i < nsyms; i++)
4551 if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].sym))
4552 != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].sym)))
4553 return 0;
4554
4555 /* All the sanity checks passed, so we might have a set of
4556 identical enumeration types. Perform a more complete
4557 comparison of the type of each symbol. */
4558 for (i = 1; i < nsyms; i++)
4559 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].sym),
4560 SYMBOL_TYPE (syms[0].sym)))
4561 return 0;
4562
4563 return 1;
4564}
4565
96d887e8
PH
4566/* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4567 duplicate other symbols in the list (The only case I know of where
4568 this happens is when object files containing stabs-in-ecoff are
4569 linked with files containing ordinary ecoff debugging symbols (or no
4570 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4571 Returns the number of items in the modified list. */
4c4b4cd2 4572
96d887e8
PH
4573static int
4574remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
4575{
4576 int i, j;
4c4b4cd2 4577
8f17729f
JB
4578 /* We should never be called with less than 2 symbols, as there
4579 cannot be any extra symbol in that case. But it's easy to
4580 handle, since we have nothing to do in that case. */
4581 if (nsyms < 2)
4582 return nsyms;
4583
96d887e8
PH
4584 i = 0;
4585 while (i < nsyms)
4586 {
a35ddb44 4587 int remove_p = 0;
339c13b6
JB
4588
4589 /* If two symbols have the same name and one of them is a stub type,
4590 the get rid of the stub. */
4591
4592 if (TYPE_STUB (SYMBOL_TYPE (syms[i].sym))
4593 && SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL)
4594 {
4595 for (j = 0; j < nsyms; j++)
4596 {
4597 if (j != i
4598 && !TYPE_STUB (SYMBOL_TYPE (syms[j].sym))
4599 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4600 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
4601 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0)
a35ddb44 4602 remove_p = 1;
339c13b6
JB
4603 }
4604 }
4605
4606 /* Two symbols with the same name, same class and same address
4607 should be identical. */
4608
4609 else if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
96d887e8
PH
4610 && SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
4611 && is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
4612 {
4613 for (j = 0; j < nsyms; j += 1)
4614 {
4615 if (i != j
4616 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4617 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
76a01679 4618 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
96d887e8
PH
4619 && SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
4620 && SYMBOL_VALUE_ADDRESS (syms[i].sym)
4621 == SYMBOL_VALUE_ADDRESS (syms[j].sym))
a35ddb44 4622 remove_p = 1;
4c4b4cd2 4623 }
4c4b4cd2 4624 }
339c13b6 4625
a35ddb44 4626 if (remove_p)
339c13b6
JB
4627 {
4628 for (j = i + 1; j < nsyms; j += 1)
4629 syms[j - 1] = syms[j];
4630 nsyms -= 1;
4631 }
4632
96d887e8 4633 i += 1;
14f9c5c9 4634 }
8f17729f
JB
4635
4636 /* If all the remaining symbols are identical enumerals, then
4637 just keep the first one and discard the rest.
4638
4639 Unlike what we did previously, we do not discard any entry
4640 unless they are ALL identical. This is because the symbol
4641 comparison is not a strict comparison, but rather a practical
4642 comparison. If all symbols are considered identical, then
4643 we can just go ahead and use the first one and discard the rest.
4644 But if we cannot reduce the list to a single element, we have
4645 to ask the user to disambiguate anyways. And if we have to
4646 present a multiple-choice menu, it's less confusing if the list
4647 isn't missing some choices that were identical and yet distinct. */
4648 if (symbols_are_identical_enums (syms, nsyms))
4649 nsyms = 1;
4650
96d887e8 4651 return nsyms;
14f9c5c9
AS
4652}
4653
96d887e8
PH
4654/* Given a type that corresponds to a renaming entity, use the type name
4655 to extract the scope (package name or function name, fully qualified,
4656 and following the GNAT encoding convention) where this renaming has been
4657 defined. The string returned needs to be deallocated after use. */
4c4b4cd2 4658
96d887e8
PH
4659static char *
4660xget_renaming_scope (struct type *renaming_type)
14f9c5c9 4661{
96d887e8 4662 /* The renaming types adhere to the following convention:
0963b4bd 4663 <scope>__<rename>___<XR extension>.
96d887e8
PH
4664 So, to extract the scope, we search for the "___XR" extension,
4665 and then backtrack until we find the first "__". */
76a01679 4666
96d887e8
PH
4667 const char *name = type_name_no_tag (renaming_type);
4668 char *suffix = strstr (name, "___XR");
4669 char *last;
4670 int scope_len;
4671 char *scope;
14f9c5c9 4672
96d887e8
PH
4673 /* Now, backtrack a bit until we find the first "__". Start looking
4674 at suffix - 3, as the <rename> part is at least one character long. */
14f9c5c9 4675
96d887e8
PH
4676 for (last = suffix - 3; last > name; last--)
4677 if (last[0] == '_' && last[1] == '_')
4678 break;
76a01679 4679
96d887e8 4680 /* Make a copy of scope and return it. */
14f9c5c9 4681
96d887e8
PH
4682 scope_len = last - name;
4683 scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
14f9c5c9 4684
96d887e8
PH
4685 strncpy (scope, name, scope_len);
4686 scope[scope_len] = '\0';
4c4b4cd2 4687
96d887e8 4688 return scope;
4c4b4cd2
PH
4689}
4690
96d887e8 4691/* Return nonzero if NAME corresponds to a package name. */
4c4b4cd2 4692
96d887e8
PH
4693static int
4694is_package_name (const char *name)
4c4b4cd2 4695{
96d887e8
PH
4696 /* Here, We take advantage of the fact that no symbols are generated
4697 for packages, while symbols are generated for each function.
4698 So the condition for NAME represent a package becomes equivalent
4699 to NAME not existing in our list of symbols. There is only one
4700 small complication with library-level functions (see below). */
4c4b4cd2 4701
96d887e8 4702 char *fun_name;
76a01679 4703
96d887e8
PH
4704 /* If it is a function that has not been defined at library level,
4705 then we should be able to look it up in the symbols. */
4706 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
4707 return 0;
14f9c5c9 4708
96d887e8
PH
4709 /* Library-level function names start with "_ada_". See if function
4710 "_ada_" followed by NAME can be found. */
14f9c5c9 4711
96d887e8 4712 /* Do a quick check that NAME does not contain "__", since library-level
e1d5a0d2 4713 functions names cannot contain "__" in them. */
96d887e8
PH
4714 if (strstr (name, "__") != NULL)
4715 return 0;
4c4b4cd2 4716
b435e160 4717 fun_name = xstrprintf ("_ada_%s", name);
14f9c5c9 4718
96d887e8
PH
4719 return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
4720}
14f9c5c9 4721
96d887e8 4722/* Return nonzero if SYM corresponds to a renaming entity that is
aeb5907d 4723 not visible from FUNCTION_NAME. */
14f9c5c9 4724
96d887e8 4725static int
0d5cff50 4726old_renaming_is_invisible (const struct symbol *sym, const char *function_name)
96d887e8 4727{
aeb5907d
JB
4728 char *scope;
4729
4730 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
4731 return 0;
4732
4733 scope = xget_renaming_scope (SYMBOL_TYPE (sym));
d2e4a39e 4734
96d887e8 4735 make_cleanup (xfree, scope);
14f9c5c9 4736
96d887e8
PH
4737 /* If the rename has been defined in a package, then it is visible. */
4738 if (is_package_name (scope))
aeb5907d 4739 return 0;
14f9c5c9 4740
96d887e8
PH
4741 /* Check that the rename is in the current function scope by checking
4742 that its name starts with SCOPE. */
76a01679 4743
96d887e8
PH
4744 /* If the function name starts with "_ada_", it means that it is
4745 a library-level function. Strip this prefix before doing the
4746 comparison, as the encoding for the renaming does not contain
4747 this prefix. */
4748 if (strncmp (function_name, "_ada_", 5) == 0)
4749 function_name += 5;
f26caa11 4750
aeb5907d 4751 return (strncmp (function_name, scope, strlen (scope)) != 0);
f26caa11
PH
4752}
4753
aeb5907d
JB
4754/* Remove entries from SYMS that corresponds to a renaming entity that
4755 is not visible from the function associated with CURRENT_BLOCK or
4756 that is superfluous due to the presence of more specific renaming
4757 information. Places surviving symbols in the initial entries of
4758 SYMS and returns the number of surviving symbols.
96d887e8
PH
4759
4760 Rationale:
aeb5907d
JB
4761 First, in cases where an object renaming is implemented as a
4762 reference variable, GNAT may produce both the actual reference
4763 variable and the renaming encoding. In this case, we discard the
4764 latter.
4765
4766 Second, GNAT emits a type following a specified encoding for each renaming
96d887e8
PH
4767 entity. Unfortunately, STABS currently does not support the definition
4768 of types that are local to a given lexical block, so all renamings types
4769 are emitted at library level. As a consequence, if an application
4770 contains two renaming entities using the same name, and a user tries to
4771 print the value of one of these entities, the result of the ada symbol
4772 lookup will also contain the wrong renaming type.
f26caa11 4773
96d887e8
PH
4774 This function partially covers for this limitation by attempting to
4775 remove from the SYMS list renaming symbols that should be visible
4776 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4777 method with the current information available. The implementation
4778 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4779
4780 - When the user tries to print a rename in a function while there
4781 is another rename entity defined in a package: Normally, the
4782 rename in the function has precedence over the rename in the
4783 package, so the latter should be removed from the list. This is
4784 currently not the case.
4785
4786 - This function will incorrectly remove valid renames if
4787 the CURRENT_BLOCK corresponds to a function which symbol name
4788 has been changed by an "Export" pragma. As a consequence,
4789 the user will be unable to print such rename entities. */
4c4b4cd2 4790
14f9c5c9 4791static int
aeb5907d
JB
4792remove_irrelevant_renamings (struct ada_symbol_info *syms,
4793 int nsyms, const struct block *current_block)
4c4b4cd2
PH
4794{
4795 struct symbol *current_function;
0d5cff50 4796 const char *current_function_name;
4c4b4cd2 4797 int i;
aeb5907d
JB
4798 int is_new_style_renaming;
4799
4800 /* If there is both a renaming foo___XR... encoded as a variable and
4801 a simple variable foo in the same block, discard the latter.
0963b4bd 4802 First, zero out such symbols, then compress. */
aeb5907d
JB
4803 is_new_style_renaming = 0;
4804 for (i = 0; i < nsyms; i += 1)
4805 {
4806 struct symbol *sym = syms[i].sym;
4807 struct block *block = syms[i].block;
4808 const char *name;
4809 const char *suffix;
4810
4811 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
4812 continue;
4813 name = SYMBOL_LINKAGE_NAME (sym);
4814 suffix = strstr (name, "___XR");
4815
4816 if (suffix != NULL)
4817 {
4818 int name_len = suffix - name;
4819 int j;
5b4ee69b 4820
aeb5907d
JB
4821 is_new_style_renaming = 1;
4822 for (j = 0; j < nsyms; j += 1)
4823 if (i != j && syms[j].sym != NULL
4824 && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
4825 name_len) == 0
4826 && block == syms[j].block)
4827 syms[j].sym = NULL;
4828 }
4829 }
4830 if (is_new_style_renaming)
4831 {
4832 int j, k;
4833
4834 for (j = k = 0; j < nsyms; j += 1)
4835 if (syms[j].sym != NULL)
4836 {
4837 syms[k] = syms[j];
4838 k += 1;
4839 }
4840 return k;
4841 }
4c4b4cd2
PH
4842
4843 /* Extract the function name associated to CURRENT_BLOCK.
4844 Abort if unable to do so. */
76a01679 4845
4c4b4cd2
PH
4846 if (current_block == NULL)
4847 return nsyms;
76a01679 4848
7f0df278 4849 current_function = block_linkage_function (current_block);
4c4b4cd2
PH
4850 if (current_function == NULL)
4851 return nsyms;
4852
4853 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
4854 if (current_function_name == NULL)
4855 return nsyms;
4856
4857 /* Check each of the symbols, and remove it from the list if it is
4858 a type corresponding to a renaming that is out of the scope of
4859 the current block. */
4860
4861 i = 0;
4862 while (i < nsyms)
4863 {
aeb5907d
JB
4864 if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
4865 == ADA_OBJECT_RENAMING
4866 && old_renaming_is_invisible (syms[i].sym, current_function_name))
4c4b4cd2
PH
4867 {
4868 int j;
5b4ee69b 4869
aeb5907d 4870 for (j = i + 1; j < nsyms; j += 1)
76a01679 4871 syms[j - 1] = syms[j];
4c4b4cd2
PH
4872 nsyms -= 1;
4873 }
4874 else
4875 i += 1;
4876 }
4877
4878 return nsyms;
4879}
4880
339c13b6
JB
4881/* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4882 whose name and domain match NAME and DOMAIN respectively.
4883 If no match was found, then extend the search to "enclosing"
4884 routines (in other words, if we're inside a nested function,
4885 search the symbols defined inside the enclosing functions).
d0a8ab18
JB
4886 If WILD_MATCH_P is nonzero, perform the naming matching in
4887 "wild" mode (see function "wild_match" for more info).
339c13b6
JB
4888
4889 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4890
4891static void
4892ada_add_local_symbols (struct obstack *obstackp, const char *name,
4893 struct block *block, domain_enum domain,
d0a8ab18 4894 int wild_match_p)
339c13b6
JB
4895{
4896 int block_depth = 0;
4897
4898 while (block != NULL)
4899 {
4900 block_depth += 1;
d0a8ab18
JB
4901 ada_add_block_symbols (obstackp, block, name, domain, NULL,
4902 wild_match_p);
339c13b6
JB
4903
4904 /* If we found a non-function match, assume that's the one. */
4905 if (is_nonfunction (defns_collected (obstackp, 0),
4906 num_defns_collected (obstackp)))
4907 return;
4908
4909 block = BLOCK_SUPERBLOCK (block);
4910 }
4911
4912 /* If no luck so far, try to find NAME as a local symbol in some lexically
4913 enclosing subprogram. */
4914 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
d0a8ab18 4915 add_symbols_from_enclosing_procs (obstackp, name, domain, wild_match_p);
339c13b6
JB
4916}
4917
ccefe4c4 4918/* An object of this type is used as the user_data argument when
40658b94 4919 calling the map_matching_symbols method. */
ccefe4c4 4920
40658b94 4921struct match_data
ccefe4c4 4922{
40658b94 4923 struct objfile *objfile;
ccefe4c4 4924 struct obstack *obstackp;
40658b94
PH
4925 struct symbol *arg_sym;
4926 int found_sym;
ccefe4c4
TT
4927};
4928
40658b94
PH
4929/* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4930 to a list of symbols. DATA0 is a pointer to a struct match_data *
4931 containing the obstack that collects the symbol list, the file that SYM
4932 must come from, a flag indicating whether a non-argument symbol has
4933 been found in the current block, and the last argument symbol
4934 passed in SYM within the current block (if any). When SYM is null,
4935 marking the end of a block, the argument symbol is added if no
4936 other has been found. */
ccefe4c4 4937
40658b94
PH
4938static int
4939aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0)
ccefe4c4 4940{
40658b94
PH
4941 struct match_data *data = (struct match_data *) data0;
4942
4943 if (sym == NULL)
4944 {
4945 if (!data->found_sym && data->arg_sym != NULL)
4946 add_defn_to_vec (data->obstackp,
4947 fixup_symbol_section (data->arg_sym, data->objfile),
4948 block);
4949 data->found_sym = 0;
4950 data->arg_sym = NULL;
4951 }
4952 else
4953 {
4954 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
4955 return 0;
4956 else if (SYMBOL_IS_ARGUMENT (sym))
4957 data->arg_sym = sym;
4958 else
4959 {
4960 data->found_sym = 1;
4961 add_defn_to_vec (data->obstackp,
4962 fixup_symbol_section (sym, data->objfile),
4963 block);
4964 }
4965 }
4966 return 0;
4967}
4968
4969/* Compare STRING1 to STRING2, with results as for strcmp.
4970 Compatible with strcmp_iw in that strcmp_iw (STRING1, STRING2) <= 0
4971 implies compare_names (STRING1, STRING2) (they may differ as to
4972 what symbols compare equal). */
5b4ee69b 4973
40658b94
PH
4974static int
4975compare_names (const char *string1, const char *string2)
4976{
4977 while (*string1 != '\0' && *string2 != '\0')
4978 {
4979 if (isspace (*string1) || isspace (*string2))
4980 return strcmp_iw_ordered (string1, string2);
4981 if (*string1 != *string2)
4982 break;
4983 string1 += 1;
4984 string2 += 1;
4985 }
4986 switch (*string1)
4987 {
4988 case '(':
4989 return strcmp_iw_ordered (string1, string2);
4990 case '_':
4991 if (*string2 == '\0')
4992 {
052874e8 4993 if (is_name_suffix (string1))
40658b94
PH
4994 return 0;
4995 else
1a1d5513 4996 return 1;
40658b94 4997 }
dbb8534f 4998 /* FALLTHROUGH */
40658b94
PH
4999 default:
5000 if (*string2 == '(')
5001 return strcmp_iw_ordered (string1, string2);
5002 else
5003 return *string1 - *string2;
5004 }
ccefe4c4
TT
5005}
5006
339c13b6
JB
5007/* Add to OBSTACKP all non-local symbols whose name and domain match
5008 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5009 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5010
5011static void
40658b94
PH
5012add_nonlocal_symbols (struct obstack *obstackp, const char *name,
5013 domain_enum domain, int global,
5014 int is_wild_match)
339c13b6
JB
5015{
5016 struct objfile *objfile;
40658b94 5017 struct match_data data;
339c13b6 5018
6475f2fe 5019 memset (&data, 0, sizeof data);
ccefe4c4 5020 data.obstackp = obstackp;
339c13b6 5021
ccefe4c4 5022 ALL_OBJFILES (objfile)
40658b94
PH
5023 {
5024 data.objfile = objfile;
5025
5026 if (is_wild_match)
5027 objfile->sf->qf->map_matching_symbols (name, domain, objfile, global,
5028 aux_add_nonlocal_symbols, &data,
5029 wild_match, NULL);
5030 else
5031 objfile->sf->qf->map_matching_symbols (name, domain, objfile, global,
5032 aux_add_nonlocal_symbols, &data,
5033 full_match, compare_names);
5034 }
5035
5036 if (num_defns_collected (obstackp) == 0 && global && !is_wild_match)
5037 {
5038 ALL_OBJFILES (objfile)
5039 {
5040 char *name1 = alloca (strlen (name) + sizeof ("_ada_"));
5041 strcpy (name1, "_ada_");
5042 strcpy (name1 + sizeof ("_ada_") - 1, name);
5043 data.objfile = objfile;
0963b4bd
MS
5044 objfile->sf->qf->map_matching_symbols (name1, domain,
5045 objfile, global,
5046 aux_add_nonlocal_symbols,
5047 &data,
40658b94
PH
5048 full_match, compare_names);
5049 }
5050 }
339c13b6
JB
5051}
5052
4c4b4cd2 5053/* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
9f88c959
JB
5054 scope and in global scopes, returning the number of matches.
5055 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4c4b4cd2 5056 indicating the symbols found and the blocks and symbol tables (if
9f88c959
JB
5057 any) in which they were found. This vector are transient---good only to
5058 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4c4b4cd2
PH
5059 symbol match within the nest of blocks whose innermost member is BLOCK0,
5060 is the one match returned (no other matches in that or
d9680e73
TT
5061 enclosing blocks is returned). If there are any matches in or
5062 surrounding BLOCK0, then these alone are returned. Otherwise, if
5063 FULL_SEARCH is non-zero, then the search extends to global and
5064 file-scope (static) symbol tables.
9f88c959 5065 Names prefixed with "standard__" are handled specially: "standard__"
4c4b4cd2 5066 is first stripped off, and only static and global symbols are searched. */
14f9c5c9
AS
5067
5068int
4c4b4cd2 5069ada_lookup_symbol_list (const char *name0, const struct block *block0,
d9680e73
TT
5070 domain_enum namespace,
5071 struct ada_symbol_info **results,
5072 int full_search)
14f9c5c9
AS
5073{
5074 struct symbol *sym;
14f9c5c9 5075 struct block *block;
4c4b4cd2 5076 const char *name;
82ccd55e 5077 const int wild_match_p = should_use_wild_match (name0);
14f9c5c9 5078 int cacheIfUnique;
4c4b4cd2 5079 int ndefns;
14f9c5c9 5080
4c4b4cd2
PH
5081 obstack_free (&symbol_list_obstack, NULL);
5082 obstack_init (&symbol_list_obstack);
14f9c5c9 5083
14f9c5c9
AS
5084 cacheIfUnique = 0;
5085
5086 /* Search specified block and its superiors. */
5087
4c4b4cd2 5088 name = name0;
76a01679
JB
5089 block = (struct block *) block0; /* FIXME: No cast ought to be
5090 needed, but adding const will
5091 have a cascade effect. */
339c13b6
JB
5092
5093 /* Special case: If the user specifies a symbol name inside package
5094 Standard, do a non-wild matching of the symbol name without
5095 the "standard__" prefix. This was primarily introduced in order
5096 to allow the user to specifically access the standard exceptions
5097 using, for instance, Standard.Constraint_Error when Constraint_Error
5098 is ambiguous (due to the user defining its own Constraint_Error
5099 entity inside its program). */
4c4b4cd2
PH
5100 if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
5101 {
4c4b4cd2
PH
5102 block = NULL;
5103 name = name0 + sizeof ("standard__") - 1;
5104 }
5105
339c13b6 5106 /* Check the non-global symbols. If we have ANY match, then we're done. */
14f9c5c9 5107
339c13b6 5108 ada_add_local_symbols (&symbol_list_obstack, name, block, namespace,
82ccd55e 5109 wild_match_p);
d9680e73 5110 if (num_defns_collected (&symbol_list_obstack) > 0 || !full_search)
14f9c5c9 5111 goto done;
d2e4a39e 5112
339c13b6
JB
5113 /* No non-global symbols found. Check our cache to see if we have
5114 already performed this search before. If we have, then return
5115 the same result. */
5116
14f9c5c9 5117 cacheIfUnique = 1;
2570f2b7 5118 if (lookup_cached_symbol (name0, namespace, &sym, &block))
4c4b4cd2
PH
5119 {
5120 if (sym != NULL)
2570f2b7 5121 add_defn_to_vec (&symbol_list_obstack, sym, block);
4c4b4cd2
PH
5122 goto done;
5123 }
14f9c5c9 5124
339c13b6
JB
5125 /* Search symbols from all global blocks. */
5126
40658b94 5127 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 1,
82ccd55e 5128 wild_match_p);
d2e4a39e 5129
4c4b4cd2 5130 /* Now add symbols from all per-file blocks if we've gotten no hits
339c13b6 5131 (not strictly correct, but perhaps better than an error). */
d2e4a39e 5132
4c4b4cd2 5133 if (num_defns_collected (&symbol_list_obstack) == 0)
40658b94 5134 add_nonlocal_symbols (&symbol_list_obstack, name, namespace, 0,
82ccd55e 5135 wild_match_p);
14f9c5c9 5136
4c4b4cd2
PH
5137done:
5138 ndefns = num_defns_collected (&symbol_list_obstack);
5139 *results = defns_collected (&symbol_list_obstack, 1);
5140
5141 ndefns = remove_extra_symbols (*results, ndefns);
5142
2ad01556 5143 if (ndefns == 0 && full_search)
2570f2b7 5144 cache_symbol (name0, namespace, NULL, NULL);
14f9c5c9 5145
2ad01556 5146 if (ndefns == 1 && full_search && cacheIfUnique)
2570f2b7 5147 cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block);
14f9c5c9 5148
aeb5907d 5149 ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
14f9c5c9 5150
14f9c5c9
AS
5151 return ndefns;
5152}
5153
f8eba3c6
TT
5154/* If NAME is the name of an entity, return a string that should
5155 be used to look that entity up in Ada units. This string should
5156 be deallocated after use using xfree.
5157
5158 NAME can have any form that the "break" or "print" commands might
5159 recognize. In other words, it does not have to be the "natural"
5160 name, or the "encoded" name. */
5161
5162char *
5163ada_name_for_lookup (const char *name)
5164{
5165 char *canon;
5166 int nlen = strlen (name);
5167
5168 if (name[0] == '<' && name[nlen - 1] == '>')
5169 {
5170 canon = xmalloc (nlen - 1);
5171 memcpy (canon, name + 1, nlen - 2);
5172 canon[nlen - 2] = '\0';
5173 }
5174 else
5175 canon = xstrdup (ada_encode (ada_fold_name (name)));
5176 return canon;
5177}
5178
5179/* Implementation of the la_iterate_over_symbols method. */
5180
5181static void
5182ada_iterate_over_symbols (const struct block *block,
5183 const char *name, domain_enum domain,
8e704927 5184 symbol_found_callback_ftype *callback,
f8eba3c6
TT
5185 void *data)
5186{
5187 int ndefs, i;
5188 struct ada_symbol_info *results;
5189
d9680e73 5190 ndefs = ada_lookup_symbol_list (name, block, domain, &results, 0);
f8eba3c6
TT
5191 for (i = 0; i < ndefs; ++i)
5192 {
5193 if (! (*callback) (results[i].sym, data))
5194 break;
5195 }
5196}
5197
4e5c77fe
JB
5198/* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5199 to 1, but choosing the first symbol found if there are multiple
5200 choices.
5201
5e2336be
JB
5202 The result is stored in *INFO, which must be non-NULL.
5203 If no match is found, INFO->SYM is set to NULL. */
4e5c77fe
JB
5204
5205void
5206ada_lookup_encoded_symbol (const char *name, const struct block *block,
5207 domain_enum namespace,
5e2336be 5208 struct ada_symbol_info *info)
14f9c5c9 5209{
4c4b4cd2 5210 struct ada_symbol_info *candidates;
14f9c5c9
AS
5211 int n_candidates;
5212
5e2336be
JB
5213 gdb_assert (info != NULL);
5214 memset (info, 0, sizeof (struct ada_symbol_info));
4e5c77fe
JB
5215
5216 n_candidates = ada_lookup_symbol_list (name, block, namespace, &candidates,
d9680e73 5217 1);
14f9c5c9
AS
5218
5219 if (n_candidates == 0)
4e5c77fe 5220 return;
4c4b4cd2 5221
5e2336be
JB
5222 *info = candidates[0];
5223 info->sym = fixup_symbol_section (info->sym, NULL);
4e5c77fe 5224}
aeb5907d
JB
5225
5226/* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5227 scope and in global scopes, or NULL if none. NAME is folded and
5228 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
0963b4bd 5229 choosing the first symbol if there are multiple choices.
4e5c77fe
JB
5230 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5231
aeb5907d
JB
5232struct symbol *
5233ada_lookup_symbol (const char *name, const struct block *block0,
21b556f4 5234 domain_enum namespace, int *is_a_field_of_this)
aeb5907d 5235{
5e2336be 5236 struct ada_symbol_info info;
4e5c77fe 5237
aeb5907d
JB
5238 if (is_a_field_of_this != NULL)
5239 *is_a_field_of_this = 0;
5240
4e5c77fe 5241 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
5e2336be
JB
5242 block0, namespace, &info);
5243 return info.sym;
4c4b4cd2 5244}
14f9c5c9 5245
4c4b4cd2
PH
5246static struct symbol *
5247ada_lookup_symbol_nonlocal (const char *name,
76a01679 5248 const struct block *block,
21b556f4 5249 const domain_enum domain)
4c4b4cd2 5250{
94af9270 5251 return ada_lookup_symbol (name, block_static_block (block), domain, NULL);
14f9c5c9
AS
5252}
5253
5254
4c4b4cd2
PH
5255/* True iff STR is a possible encoded suffix of a normal Ada name
5256 that is to be ignored for matching purposes. Suffixes of parallel
5257 names (e.g., XVE) are not included here. Currently, the possible suffixes
5823c3ef 5258 are given by any of the regular expressions:
4c4b4cd2 5259
babe1480
JB
5260 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5261 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
9ac7f98e 5262 TKB [subprogram suffix for task bodies]
babe1480 5263 _E[0-9]+[bs]$ [protected object entry suffixes]
61ee279c 5264 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
babe1480
JB
5265
5266 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5267 match is performed. This sequence is used to differentiate homonyms,
5268 is an optional part of a valid name suffix. */
4c4b4cd2 5269
14f9c5c9 5270static int
d2e4a39e 5271is_name_suffix (const char *str)
14f9c5c9
AS
5272{
5273 int k;
4c4b4cd2
PH
5274 const char *matching;
5275 const int len = strlen (str);
5276
babe1480
JB
5277 /* Skip optional leading __[0-9]+. */
5278
4c4b4cd2
PH
5279 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
5280 {
babe1480
JB
5281 str += 3;
5282 while (isdigit (str[0]))
5283 str += 1;
4c4b4cd2 5284 }
babe1480
JB
5285
5286 /* [.$][0-9]+ */
4c4b4cd2 5287
babe1480 5288 if (str[0] == '.' || str[0] == '$')
4c4b4cd2 5289 {
babe1480 5290 matching = str + 1;
4c4b4cd2
PH
5291 while (isdigit (matching[0]))
5292 matching += 1;
5293 if (matching[0] == '\0')
5294 return 1;
5295 }
5296
5297 /* ___[0-9]+ */
babe1480 5298
4c4b4cd2
PH
5299 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
5300 {
5301 matching = str + 3;
5302 while (isdigit (matching[0]))
5303 matching += 1;
5304 if (matching[0] == '\0')
5305 return 1;
5306 }
5307
9ac7f98e
JB
5308 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5309
5310 if (strcmp (str, "TKB") == 0)
5311 return 1;
5312
529cad9c
PH
5313#if 0
5314 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
0963b4bd
MS
5315 with a N at the end. Unfortunately, the compiler uses the same
5316 convention for other internal types it creates. So treating
529cad9c 5317 all entity names that end with an "N" as a name suffix causes
0963b4bd
MS
5318 some regressions. For instance, consider the case of an enumerated
5319 type. To support the 'Image attribute, it creates an array whose
529cad9c
PH
5320 name ends with N.
5321 Having a single character like this as a suffix carrying some
0963b4bd 5322 information is a bit risky. Perhaps we should change the encoding
529cad9c
PH
5323 to be something like "_N" instead. In the meantime, do not do
5324 the following check. */
5325 /* Protected Object Subprograms */
5326 if (len == 1 && str [0] == 'N')
5327 return 1;
5328#endif
5329
5330 /* _E[0-9]+[bs]$ */
5331 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
5332 {
5333 matching = str + 3;
5334 while (isdigit (matching[0]))
5335 matching += 1;
5336 if ((matching[0] == 'b' || matching[0] == 's')
5337 && matching [1] == '\0')
5338 return 1;
5339 }
5340
4c4b4cd2
PH
5341 /* ??? We should not modify STR directly, as we are doing below. This
5342 is fine in this case, but may become problematic later if we find
5343 that this alternative did not work, and want to try matching
5344 another one from the begining of STR. Since we modified it, we
5345 won't be able to find the begining of the string anymore! */
14f9c5c9
AS
5346 if (str[0] == 'X')
5347 {
5348 str += 1;
d2e4a39e 5349 while (str[0] != '_' && str[0] != '\0')
4c4b4cd2
PH
5350 {
5351 if (str[0] != 'n' && str[0] != 'b')
5352 return 0;
5353 str += 1;
5354 }
14f9c5c9 5355 }
babe1480 5356
14f9c5c9
AS
5357 if (str[0] == '\000')
5358 return 1;
babe1480 5359
d2e4a39e 5360 if (str[0] == '_')
14f9c5c9
AS
5361 {
5362 if (str[1] != '_' || str[2] == '\000')
4c4b4cd2 5363 return 0;
d2e4a39e 5364 if (str[2] == '_')
4c4b4cd2 5365 {
61ee279c
PH
5366 if (strcmp (str + 3, "JM") == 0)
5367 return 1;
5368 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5369 the LJM suffix in favor of the JM one. But we will
5370 still accept LJM as a valid suffix for a reasonable
5371 amount of time, just to allow ourselves to debug programs
5372 compiled using an older version of GNAT. */
4c4b4cd2
PH
5373 if (strcmp (str + 3, "LJM") == 0)
5374 return 1;
5375 if (str[3] != 'X')
5376 return 0;
1265e4aa
JB
5377 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
5378 || str[4] == 'U' || str[4] == 'P')
4c4b4cd2
PH
5379 return 1;
5380 if (str[4] == 'R' && str[5] != 'T')
5381 return 1;
5382 return 0;
5383 }
5384 if (!isdigit (str[2]))
5385 return 0;
5386 for (k = 3; str[k] != '\0'; k += 1)
5387 if (!isdigit (str[k]) && str[k] != '_')
5388 return 0;
14f9c5c9
AS
5389 return 1;
5390 }
4c4b4cd2 5391 if (str[0] == '$' && isdigit (str[1]))
14f9c5c9 5392 {
4c4b4cd2
PH
5393 for (k = 2; str[k] != '\0'; k += 1)
5394 if (!isdigit (str[k]) && str[k] != '_')
5395 return 0;
14f9c5c9
AS
5396 return 1;
5397 }
5398 return 0;
5399}
d2e4a39e 5400
aeb5907d
JB
5401/* Return non-zero if the string starting at NAME and ending before
5402 NAME_END contains no capital letters. */
529cad9c
PH
5403
5404static int
5405is_valid_name_for_wild_match (const char *name0)
5406{
5407 const char *decoded_name = ada_decode (name0);
5408 int i;
5409
5823c3ef
JB
5410 /* If the decoded name starts with an angle bracket, it means that
5411 NAME0 does not follow the GNAT encoding format. It should then
5412 not be allowed as a possible wild match. */
5413 if (decoded_name[0] == '<')
5414 return 0;
5415
529cad9c
PH
5416 for (i=0; decoded_name[i] != '\0'; i++)
5417 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
5418 return 0;
5419
5420 return 1;
5421}
5422
73589123
PH
5423/* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5424 that could start a simple name. Assumes that *NAMEP points into
5425 the string beginning at NAME0. */
4c4b4cd2 5426
14f9c5c9 5427static int
73589123 5428advance_wild_match (const char **namep, const char *name0, int target0)
14f9c5c9 5429{
73589123 5430 const char *name = *namep;
5b4ee69b 5431
5823c3ef 5432 while (1)
14f9c5c9 5433 {
aa27d0b3 5434 int t0, t1;
73589123
PH
5435
5436 t0 = *name;
5437 if (t0 == '_')
5438 {
5439 t1 = name[1];
5440 if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9'))
5441 {
5442 name += 1;
5443 if (name == name0 + 5 && strncmp (name0, "_ada", 4) == 0)
5444 break;
5445 else
5446 name += 1;
5447 }
aa27d0b3
JB
5448 else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z')
5449 || name[2] == target0))
73589123
PH
5450 {
5451 name += 2;
5452 break;
5453 }
5454 else
5455 return 0;
5456 }
5457 else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9'))
5458 name += 1;
5459 else
5823c3ef 5460 return 0;
73589123
PH
5461 }
5462
5463 *namep = name;
5464 return 1;
5465}
5466
5467/* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5468 informational suffixes of NAME (i.e., for which is_name_suffix is
5469 true). Assumes that PATN is a lower-cased Ada simple name. */
5470
5471static int
5472wild_match (const char *name, const char *patn)
5473{
22e048c9 5474 const char *p;
73589123
PH
5475 const char *name0 = name;
5476
5477 while (1)
5478 {
5479 const char *match = name;
5480
5481 if (*name == *patn)
5482 {
5483 for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1)
5484 if (*p != *name)
5485 break;
5486 if (*p == '\0' && is_name_suffix (name))
5487 return match != name0 && !is_valid_name_for_wild_match (name0);
5488
5489 if (name[-1] == '_')
5490 name -= 1;
5491 }
5492 if (!advance_wild_match (&name, name0, *patn))
5493 return 1;
96d887e8 5494 }
96d887e8
PH
5495}
5496
40658b94
PH
5497/* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5498 informational suffix. */
5499
c4d840bd
PH
5500static int
5501full_match (const char *sym_name, const char *search_name)
5502{
40658b94 5503 return !match_name (sym_name, search_name, 0);
c4d840bd
PH
5504}
5505
5506
96d887e8
PH
5507/* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5508 vector *defn_symbols, updating the list of symbols in OBSTACKP
0963b4bd 5509 (if necessary). If WILD, treat as NAME with a wildcard prefix.
96d887e8
PH
5510 OBJFILE is the section containing BLOCK.
5511 SYMTAB is recorded with each symbol added. */
5512
5513static void
5514ada_add_block_symbols (struct obstack *obstackp,
76a01679 5515 struct block *block, const char *name,
96d887e8 5516 domain_enum domain, struct objfile *objfile,
2570f2b7 5517 int wild)
96d887e8 5518{
8157b174 5519 struct block_iterator iter;
96d887e8
PH
5520 int name_len = strlen (name);
5521 /* A matching argument symbol, if any. */
5522 struct symbol *arg_sym;
5523 /* Set true when we find a matching non-argument symbol. */
5524 int found_sym;
5525 struct symbol *sym;
5526
5527 arg_sym = NULL;
5528 found_sym = 0;
5529 if (wild)
5530 {
8157b174
TT
5531 for (sym = block_iter_match_first (block, name, wild_match, &iter);
5532 sym != NULL; sym = block_iter_match_next (name, wild_match, &iter))
76a01679 5533 {
5eeb2539
AR
5534 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5535 SYMBOL_DOMAIN (sym), domain)
73589123 5536 && wild_match (SYMBOL_LINKAGE_NAME (sym), name) == 0)
76a01679 5537 {
2a2d4dc3
AS
5538 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5539 continue;
5540 else if (SYMBOL_IS_ARGUMENT (sym))
5541 arg_sym = sym;
5542 else
5543 {
76a01679
JB
5544 found_sym = 1;
5545 add_defn_to_vec (obstackp,
5546 fixup_symbol_section (sym, objfile),
2570f2b7 5547 block);
76a01679
JB
5548 }
5549 }
5550 }
96d887e8
PH
5551 }
5552 else
5553 {
8157b174
TT
5554 for (sym = block_iter_match_first (block, name, full_match, &iter);
5555 sym != NULL; sym = block_iter_match_next (name, full_match, &iter))
76a01679 5556 {
5eeb2539
AR
5557 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5558 SYMBOL_DOMAIN (sym), domain))
76a01679 5559 {
c4d840bd
PH
5560 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5561 {
5562 if (SYMBOL_IS_ARGUMENT (sym))
5563 arg_sym = sym;
5564 else
2a2d4dc3 5565 {
c4d840bd
PH
5566 found_sym = 1;
5567 add_defn_to_vec (obstackp,
5568 fixup_symbol_section (sym, objfile),
5569 block);
2a2d4dc3 5570 }
c4d840bd 5571 }
76a01679
JB
5572 }
5573 }
96d887e8
PH
5574 }
5575
5576 if (!found_sym && arg_sym != NULL)
5577 {
76a01679
JB
5578 add_defn_to_vec (obstackp,
5579 fixup_symbol_section (arg_sym, objfile),
2570f2b7 5580 block);
96d887e8
PH
5581 }
5582
5583 if (!wild)
5584 {
5585 arg_sym = NULL;
5586 found_sym = 0;
5587
5588 ALL_BLOCK_SYMBOLS (block, iter, sym)
76a01679 5589 {
5eeb2539
AR
5590 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
5591 SYMBOL_DOMAIN (sym), domain))
76a01679
JB
5592 {
5593 int cmp;
5594
5595 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
5596 if (cmp == 0)
5597 {
5598 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
5599 if (cmp == 0)
5600 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
5601 name_len);
5602 }
5603
5604 if (cmp == 0
5605 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
5606 {
2a2d4dc3
AS
5607 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
5608 {
5609 if (SYMBOL_IS_ARGUMENT (sym))
5610 arg_sym = sym;
5611 else
5612 {
5613 found_sym = 1;
5614 add_defn_to_vec (obstackp,
5615 fixup_symbol_section (sym, objfile),
5616 block);
5617 }
5618 }
76a01679
JB
5619 }
5620 }
76a01679 5621 }
96d887e8
PH
5622
5623 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5624 They aren't parameters, right? */
5625 if (!found_sym && arg_sym != NULL)
5626 {
5627 add_defn_to_vec (obstackp,
76a01679 5628 fixup_symbol_section (arg_sym, objfile),
2570f2b7 5629 block);
96d887e8
PH
5630 }
5631 }
5632}
5633\f
41d27058
JB
5634
5635 /* Symbol Completion */
5636
5637/* If SYM_NAME is a completion candidate for TEXT, return this symbol
5638 name in a form that's appropriate for the completion. The result
5639 does not need to be deallocated, but is only good until the next call.
5640
5641 TEXT_LEN is equal to the length of TEXT.
e701b3c0 5642 Perform a wild match if WILD_MATCH_P is set.
6ea35997 5643 ENCODED_P should be set if TEXT represents the start of a symbol name
41d27058
JB
5644 in its encoded form. */
5645
5646static const char *
5647symbol_completion_match (const char *sym_name,
5648 const char *text, int text_len,
6ea35997 5649 int wild_match_p, int encoded_p)
41d27058 5650{
41d27058
JB
5651 const int verbatim_match = (text[0] == '<');
5652 int match = 0;
5653
5654 if (verbatim_match)
5655 {
5656 /* Strip the leading angle bracket. */
5657 text = text + 1;
5658 text_len--;
5659 }
5660
5661 /* First, test against the fully qualified name of the symbol. */
5662
5663 if (strncmp (sym_name, text, text_len) == 0)
5664 match = 1;
5665
6ea35997 5666 if (match && !encoded_p)
41d27058
JB
5667 {
5668 /* One needed check before declaring a positive match is to verify
5669 that iff we are doing a verbatim match, the decoded version
5670 of the symbol name starts with '<'. Otherwise, this symbol name
5671 is not a suitable completion. */
5672 const char *sym_name_copy = sym_name;
5673 int has_angle_bracket;
5674
5675 sym_name = ada_decode (sym_name);
5676 has_angle_bracket = (sym_name[0] == '<');
5677 match = (has_angle_bracket == verbatim_match);
5678 sym_name = sym_name_copy;
5679 }
5680
5681 if (match && !verbatim_match)
5682 {
5683 /* When doing non-verbatim match, another check that needs to
5684 be done is to verify that the potentially matching symbol name
5685 does not include capital letters, because the ada-mode would
5686 not be able to understand these symbol names without the
5687 angle bracket notation. */
5688 const char *tmp;
5689
5690 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
5691 if (*tmp != '\0')
5692 match = 0;
5693 }
5694
5695 /* Second: Try wild matching... */
5696
e701b3c0 5697 if (!match && wild_match_p)
41d27058
JB
5698 {
5699 /* Since we are doing wild matching, this means that TEXT
5700 may represent an unqualified symbol name. We therefore must
5701 also compare TEXT against the unqualified name of the symbol. */
5702 sym_name = ada_unqualified_name (ada_decode (sym_name));
5703
5704 if (strncmp (sym_name, text, text_len) == 0)
5705 match = 1;
5706 }
5707
5708 /* Finally: If we found a mach, prepare the result to return. */
5709
5710 if (!match)
5711 return NULL;
5712
5713 if (verbatim_match)
5714 sym_name = add_angle_brackets (sym_name);
5715
6ea35997 5716 if (!encoded_p)
41d27058
JB
5717 sym_name = ada_decode (sym_name);
5718
5719 return sym_name;
5720}
5721
5722/* A companion function to ada_make_symbol_completion_list().
5723 Check if SYM_NAME represents a symbol which name would be suitable
5724 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5725 it is appended at the end of the given string vector SV.
5726
5727 ORIG_TEXT is the string original string from the user command
5728 that needs to be completed. WORD is the entire command on which
5729 completion should be performed. These two parameters are used to
5730 determine which part of the symbol name should be added to the
5731 completion vector.
c0af1706 5732 if WILD_MATCH_P is set, then wild matching is performed.
cb8e9b97 5733 ENCODED_P should be set if TEXT represents a symbol name in its
41d27058
JB
5734 encoded formed (in which case the completion should also be
5735 encoded). */
5736
5737static void
d6565258 5738symbol_completion_add (VEC(char_ptr) **sv,
41d27058
JB
5739 const char *sym_name,
5740 const char *text, int text_len,
5741 const char *orig_text, const char *word,
cb8e9b97 5742 int wild_match_p, int encoded_p)
41d27058
JB
5743{
5744 const char *match = symbol_completion_match (sym_name, text, text_len,
cb8e9b97 5745 wild_match_p, encoded_p);
41d27058
JB
5746 char *completion;
5747
5748 if (match == NULL)
5749 return;
5750
5751 /* We found a match, so add the appropriate completion to the given
5752 string vector. */
5753
5754 if (word == orig_text)
5755 {
5756 completion = xmalloc (strlen (match) + 5);
5757 strcpy (completion, match);
5758 }
5759 else if (word > orig_text)
5760 {
5761 /* Return some portion of sym_name. */
5762 completion = xmalloc (strlen (match) + 5);
5763 strcpy (completion, match + (word - orig_text));
5764 }
5765 else
5766 {
5767 /* Return some of ORIG_TEXT plus sym_name. */
5768 completion = xmalloc (strlen (match) + (orig_text - word) + 5);
5769 strncpy (completion, word, orig_text - word);
5770 completion[orig_text - word] = '\0';
5771 strcat (completion, match);
5772 }
5773
d6565258 5774 VEC_safe_push (char_ptr, *sv, completion);
41d27058
JB
5775}
5776
ccefe4c4 5777/* An object of this type is passed as the user_data argument to the
7b08b9eb 5778 expand_partial_symbol_names method. */
ccefe4c4
TT
5779struct add_partial_datum
5780{
5781 VEC(char_ptr) **completions;
5782 char *text;
5783 int text_len;
5784 char *text0;
5785 char *word;
5786 int wild_match;
5787 int encoded;
5788};
5789
7b08b9eb
JK
5790/* A callback for expand_partial_symbol_names. */
5791static int
e078317b 5792ada_expand_partial_symbol_name (const char *name, void *user_data)
ccefe4c4
TT
5793{
5794 struct add_partial_datum *data = user_data;
7b08b9eb
JK
5795
5796 return symbol_completion_match (name, data->text, data->text_len,
5797 data->wild_match, data->encoded) != NULL;
ccefe4c4
TT
5798}
5799
49c4e619
TT
5800/* Return a list of possible symbol names completing TEXT0. WORD is
5801 the entire command on which completion is made. */
41d27058 5802
49c4e619 5803static VEC (char_ptr) *
41d27058
JB
5804ada_make_symbol_completion_list (char *text0, char *word)
5805{
5806 char *text;
5807 int text_len;
b1ed564a
JB
5808 int wild_match_p;
5809 int encoded_p;
2ba95b9b 5810 VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128);
41d27058
JB
5811 struct symbol *sym;
5812 struct symtab *s;
41d27058
JB
5813 struct minimal_symbol *msymbol;
5814 struct objfile *objfile;
5815 struct block *b, *surrounding_static_block = 0;
5816 int i;
8157b174 5817 struct block_iterator iter;
41d27058
JB
5818
5819 if (text0[0] == '<')
5820 {
5821 text = xstrdup (text0);
5822 make_cleanup (xfree, text);
5823 text_len = strlen (text);
b1ed564a
JB
5824 wild_match_p = 0;
5825 encoded_p = 1;
41d27058
JB
5826 }
5827 else
5828 {
5829 text = xstrdup (ada_encode (text0));
5830 make_cleanup (xfree, text);
5831 text_len = strlen (text);
5832 for (i = 0; i < text_len; i++)
5833 text[i] = tolower (text[i]);
5834
b1ed564a 5835 encoded_p = (strstr (text0, "__") != NULL);
41d27058
JB
5836 /* If the name contains a ".", then the user is entering a fully
5837 qualified entity name, and the match must not be done in wild
5838 mode. Similarly, if the user wants to complete what looks like
5839 an encoded name, the match must not be done in wild mode. */
b1ed564a 5840 wild_match_p = (strchr (text0, '.') == NULL && !encoded_p);
41d27058
JB
5841 }
5842
5843 /* First, look at the partial symtab symbols. */
41d27058 5844 {
ccefe4c4
TT
5845 struct add_partial_datum data;
5846
5847 data.completions = &completions;
5848 data.text = text;
5849 data.text_len = text_len;
5850 data.text0 = text0;
5851 data.word = word;
b1ed564a
JB
5852 data.wild_match = wild_match_p;
5853 data.encoded = encoded_p;
7b08b9eb 5854 expand_partial_symbol_names (ada_expand_partial_symbol_name, &data);
41d27058
JB
5855 }
5856
5857 /* At this point scan through the misc symbol vectors and add each
5858 symbol you find to the list. Eventually we want to ignore
5859 anything that isn't a text symbol (everything else will be
5860 handled by the psymtab code above). */
5861
5862 ALL_MSYMBOLS (objfile, msymbol)
5863 {
5864 QUIT;
d6565258 5865 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (msymbol),
b1ed564a
JB
5866 text, text_len, text0, word, wild_match_p,
5867 encoded_p);
41d27058
JB
5868 }
5869
5870 /* Search upwards from currently selected frame (so that we can
5871 complete on local vars. */
5872
5873 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
5874 {
5875 if (!BLOCK_SUPERBLOCK (b))
5876 surrounding_static_block = b; /* For elmin of dups */
5877
5878 ALL_BLOCK_SYMBOLS (b, iter, sym)
5879 {
d6565258 5880 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
41d27058 5881 text, text_len, text0, word,
b1ed564a 5882 wild_match_p, encoded_p);
41d27058
JB
5883 }
5884 }
5885
5886 /* Go through the symtabs and check the externs and statics for
5887 symbols which match. */
5888
5889 ALL_SYMTABS (objfile, s)
5890 {
5891 QUIT;
5892 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
5893 ALL_BLOCK_SYMBOLS (b, iter, sym)
5894 {
d6565258 5895 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
41d27058 5896 text, text_len, text0, word,
b1ed564a 5897 wild_match_p, encoded_p);
41d27058
JB
5898 }
5899 }
5900
5901 ALL_SYMTABS (objfile, s)
5902 {
5903 QUIT;
5904 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
5905 /* Don't do this block twice. */
5906 if (b == surrounding_static_block)
5907 continue;
5908 ALL_BLOCK_SYMBOLS (b, iter, sym)
5909 {
d6565258 5910 symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
41d27058 5911 text, text_len, text0, word,
b1ed564a 5912 wild_match_p, encoded_p);
41d27058
JB
5913 }
5914 }
5915
49c4e619 5916 return completions;
41d27058
JB
5917}
5918
963a6417 5919 /* Field Access */
96d887e8 5920
73fb9985
JB
5921/* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5922 for tagged types. */
5923
5924static int
5925ada_is_dispatch_table_ptr_type (struct type *type)
5926{
0d5cff50 5927 const char *name;
73fb9985
JB
5928
5929 if (TYPE_CODE (type) != TYPE_CODE_PTR)
5930 return 0;
5931
5932 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
5933 if (name == NULL)
5934 return 0;
5935
5936 return (strcmp (name, "ada__tags__dispatch_table") == 0);
5937}
5938
963a6417
PH
5939/* True if field number FIELD_NUM in struct or union type TYPE is supposed
5940 to be invisible to users. */
96d887e8 5941
963a6417
PH
5942int
5943ada_is_ignored_field (struct type *type, int field_num)
96d887e8 5944{
963a6417
PH
5945 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
5946 return 1;
ffde82bf 5947
73fb9985
JB
5948 /* Check the name of that field. */
5949 {
5950 const char *name = TYPE_FIELD_NAME (type, field_num);
5951
5952 /* Anonymous field names should not be printed.
5953 brobecker/2007-02-20: I don't think this can actually happen
5954 but we don't want to print the value of annonymous fields anyway. */
5955 if (name == NULL)
5956 return 1;
5957
ffde82bf
JB
5958 /* Normally, fields whose name start with an underscore ("_")
5959 are fields that have been internally generated by the compiler,
5960 and thus should not be printed. The "_parent" field is special,
5961 however: This is a field internally generated by the compiler
5962 for tagged types, and it contains the components inherited from
5963 the parent type. This field should not be printed as is, but
5964 should not be ignored either. */
73fb9985
JB
5965 if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
5966 return 1;
5967 }
5968
5969 /* If this is the dispatch table of a tagged type, then ignore. */
5970 if (ada_is_tagged_type (type, 1)
5971 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)))
5972 return 1;
5973
5974 /* Not a special field, so it should not be ignored. */
5975 return 0;
963a6417 5976}
96d887e8 5977
963a6417 5978/* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
0963b4bd 5979 pointer or reference type whose ultimate target has a tag field. */
96d887e8 5980
963a6417
PH
5981int
5982ada_is_tagged_type (struct type *type, int refok)
5983{
5984 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
5985}
96d887e8 5986
963a6417 5987/* True iff TYPE represents the type of X'Tag */
96d887e8 5988
963a6417
PH
5989int
5990ada_is_tag_type (struct type *type)
5991{
5992 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
5993 return 0;
5994 else
96d887e8 5995 {
963a6417 5996 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
5b4ee69b 5997
963a6417
PH
5998 return (name != NULL
5999 && strcmp (name, "ada__tags__dispatch_table") == 0);
96d887e8 6000 }
96d887e8
PH
6001}
6002
963a6417 6003/* The type of the tag on VAL. */
76a01679 6004
963a6417
PH
6005struct type *
6006ada_tag_type (struct value *val)
96d887e8 6007{
df407dfe 6008 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
963a6417 6009}
96d887e8 6010
963a6417 6011/* The value of the tag on VAL. */
96d887e8 6012
963a6417
PH
6013struct value *
6014ada_value_tag (struct value *val)
6015{
03ee6b2e 6016 return ada_value_struct_elt (val, "_tag", 0);
96d887e8
PH
6017}
6018
963a6417
PH
6019/* The value of the tag on the object of type TYPE whose contents are
6020 saved at VALADDR, if it is non-null, or is at memory address
0963b4bd 6021 ADDRESS. */
96d887e8 6022
963a6417 6023static struct value *
10a2c479 6024value_tag_from_contents_and_address (struct type *type,
fc1a4b47 6025 const gdb_byte *valaddr,
963a6417 6026 CORE_ADDR address)
96d887e8 6027{
b5385fc0 6028 int tag_byte_offset;
963a6417 6029 struct type *tag_type;
5b4ee69b 6030
963a6417 6031 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
52ce6436 6032 NULL, NULL, NULL))
96d887e8 6033 {
fc1a4b47 6034 const gdb_byte *valaddr1 = ((valaddr == NULL)
10a2c479
AC
6035 ? NULL
6036 : valaddr + tag_byte_offset);
963a6417 6037 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
96d887e8 6038
963a6417 6039 return value_from_contents_and_address (tag_type, valaddr1, address1);
96d887e8 6040 }
963a6417
PH
6041 return NULL;
6042}
96d887e8 6043
963a6417
PH
6044static struct type *
6045type_from_tag (struct value *tag)
6046{
6047 const char *type_name = ada_tag_name (tag);
5b4ee69b 6048
963a6417
PH
6049 if (type_name != NULL)
6050 return ada_find_any_type (ada_encode (type_name));
6051 return NULL;
6052}
96d887e8 6053
1b611343
JB
6054/* Return the "ada__tags__type_specific_data" type. */
6055
6056static struct type *
6057ada_get_tsd_type (struct inferior *inf)
963a6417 6058{
1b611343 6059 struct ada_inferior_data *data = get_ada_inferior_data (inf);
4c4b4cd2 6060
1b611343
JB
6061 if (data->tsd_type == 0)
6062 data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data");
6063 return data->tsd_type;
6064}
529cad9c 6065
1b611343
JB
6066/* Return the TSD (type-specific data) associated to the given TAG.
6067 TAG is assumed to be the tag of a tagged-type entity.
529cad9c 6068
1b611343 6069 May return NULL if we are unable to get the TSD. */
4c4b4cd2 6070
1b611343
JB
6071static struct value *
6072ada_get_tsd_from_tag (struct value *tag)
4c4b4cd2 6073{
4c4b4cd2 6074 struct value *val;
1b611343 6075 struct type *type;
5b4ee69b 6076
1b611343
JB
6077 /* First option: The TSD is simply stored as a field of our TAG.
6078 Only older versions of GNAT would use this format, but we have
6079 to test it first, because there are no visible markers for
6080 the current approach except the absence of that field. */
529cad9c 6081
1b611343
JB
6082 val = ada_value_struct_elt (tag, "tsd", 1);
6083 if (val)
6084 return val;
e802dbe0 6085
1b611343
JB
6086 /* Try the second representation for the dispatch table (in which
6087 there is no explicit 'tsd' field in the referent of the tag pointer,
6088 and instead the tsd pointer is stored just before the dispatch
6089 table. */
e802dbe0 6090
1b611343
JB
6091 type = ada_get_tsd_type (current_inferior());
6092 if (type == NULL)
6093 return NULL;
6094 type = lookup_pointer_type (lookup_pointer_type (type));
6095 val = value_cast (type, tag);
6096 if (val == NULL)
6097 return NULL;
6098 return value_ind (value_ptradd (val, -1));
e802dbe0
JB
6099}
6100
1b611343
JB
6101/* Given the TSD of a tag (type-specific data), return a string
6102 containing the name of the associated type.
6103
6104 The returned value is good until the next call. May return NULL
6105 if we are unable to determine the tag name. */
6106
6107static char *
6108ada_tag_name_from_tsd (struct value *tsd)
529cad9c 6109{
529cad9c
PH
6110 static char name[1024];
6111 char *p;
1b611343 6112 struct value *val;
529cad9c 6113
1b611343 6114 val = ada_value_struct_elt (tsd, "expanded_name", 1);
4c4b4cd2 6115 if (val == NULL)
1b611343 6116 return NULL;
4c4b4cd2
PH
6117 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
6118 for (p = name; *p != '\0'; p += 1)
6119 if (isalpha (*p))
6120 *p = tolower (*p);
1b611343 6121 return name;
4c4b4cd2
PH
6122}
6123
6124/* The type name of the dynamic type denoted by the 'tag value TAG, as
1b611343
JB
6125 a C string.
6126
6127 Return NULL if the TAG is not an Ada tag, or if we were unable to
6128 determine the name of that tag. The result is good until the next
6129 call. */
4c4b4cd2
PH
6130
6131const char *
6132ada_tag_name (struct value *tag)
6133{
1b611343
JB
6134 volatile struct gdb_exception e;
6135 char *name = NULL;
5b4ee69b 6136
df407dfe 6137 if (!ada_is_tag_type (value_type (tag)))
4c4b4cd2 6138 return NULL;
1b611343
JB
6139
6140 /* It is perfectly possible that an exception be raised while trying
6141 to determine the TAG's name, even under normal circumstances:
6142 The associated variable may be uninitialized or corrupted, for
6143 instance. We do not let any exception propagate past this point.
6144 instead we return NULL.
6145
6146 We also do not print the error message either (which often is very
6147 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6148 the caller print a more meaningful message if necessary. */
6149 TRY_CATCH (e, RETURN_MASK_ERROR)
6150 {
6151 struct value *tsd = ada_get_tsd_from_tag (tag);
6152
6153 if (tsd != NULL)
6154 name = ada_tag_name_from_tsd (tsd);
6155 }
6156
6157 return name;
4c4b4cd2
PH
6158}
6159
6160/* The parent type of TYPE, or NULL if none. */
14f9c5c9 6161
d2e4a39e 6162struct type *
ebf56fd3 6163ada_parent_type (struct type *type)
14f9c5c9
AS
6164{
6165 int i;
6166
61ee279c 6167 type = ada_check_typedef (type);
14f9c5c9
AS
6168
6169 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6170 return NULL;
6171
6172 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6173 if (ada_is_parent_field (type, i))
0c1f74cf
JB
6174 {
6175 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
6176
6177 /* If the _parent field is a pointer, then dereference it. */
6178 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
6179 parent_type = TYPE_TARGET_TYPE (parent_type);
6180 /* If there is a parallel XVS type, get the actual base type. */
6181 parent_type = ada_get_base_type (parent_type);
6182
6183 return ada_check_typedef (parent_type);
6184 }
14f9c5c9
AS
6185
6186 return NULL;
6187}
6188
4c4b4cd2
PH
6189/* True iff field number FIELD_NUM of structure type TYPE contains the
6190 parent-type (inherited) fields of a derived type. Assumes TYPE is
6191 a structure type with at least FIELD_NUM+1 fields. */
14f9c5c9
AS
6192
6193int
ebf56fd3 6194ada_is_parent_field (struct type *type, int field_num)
14f9c5c9 6195{
61ee279c 6196 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
5b4ee69b 6197
4c4b4cd2
PH
6198 return (name != NULL
6199 && (strncmp (name, "PARENT", 6) == 0
6200 || strncmp (name, "_parent", 7) == 0));
14f9c5c9
AS
6201}
6202
4c4b4cd2 6203/* True iff field number FIELD_NUM of structure type TYPE is a
14f9c5c9 6204 transparent wrapper field (which should be silently traversed when doing
4c4b4cd2 6205 field selection and flattened when printing). Assumes TYPE is a
14f9c5c9 6206 structure type with at least FIELD_NUM+1 fields. Such fields are always
4c4b4cd2 6207 structures. */
14f9c5c9
AS
6208
6209int
ebf56fd3 6210ada_is_wrapper_field (struct type *type, int field_num)
14f9c5c9 6211{
d2e4a39e 6212 const char *name = TYPE_FIELD_NAME (type, field_num);
5b4ee69b 6213
d2e4a39e 6214 return (name != NULL
4c4b4cd2
PH
6215 && (strncmp (name, "PARENT", 6) == 0
6216 || strcmp (name, "REP") == 0
6217 || strncmp (name, "_parent", 7) == 0
6218 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
14f9c5c9
AS
6219}
6220
4c4b4cd2
PH
6221/* True iff field number FIELD_NUM of structure or union type TYPE
6222 is a variant wrapper. Assumes TYPE is a structure type with at least
6223 FIELD_NUM+1 fields. */
14f9c5c9
AS
6224
6225int
ebf56fd3 6226ada_is_variant_part (struct type *type, int field_num)
14f9c5c9 6227{
d2e4a39e 6228 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
5b4ee69b 6229
14f9c5c9 6230 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
4c4b4cd2 6231 || (is_dynamic_field (type, field_num)
c3e5cd34
PH
6232 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
6233 == TYPE_CODE_UNION)));
14f9c5c9
AS
6234}
6235
6236/* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
4c4b4cd2 6237 whose discriminants are contained in the record type OUTER_TYPE,
7c964f07
UW
6238 returns the type of the controlling discriminant for the variant.
6239 May return NULL if the type could not be found. */
14f9c5c9 6240
d2e4a39e 6241struct type *
ebf56fd3 6242ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
14f9c5c9 6243{
d2e4a39e 6244 char *name = ada_variant_discrim_name (var_type);
5b4ee69b 6245
7c964f07 6246 return ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
14f9c5c9
AS
6247}
6248
4c4b4cd2 6249/* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
14f9c5c9 6250 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
4c4b4cd2 6251 represents a 'when others' clause; otherwise 0. */
14f9c5c9
AS
6252
6253int
ebf56fd3 6254ada_is_others_clause (struct type *type, int field_num)
14f9c5c9 6255{
d2e4a39e 6256 const char *name = TYPE_FIELD_NAME (type, field_num);
5b4ee69b 6257
14f9c5c9
AS
6258 return (name != NULL && name[0] == 'O');
6259}
6260
6261/* Assuming that TYPE0 is the type of the variant part of a record,
4c4b4cd2
PH
6262 returns the name of the discriminant controlling the variant.
6263 The value is valid until the next call to ada_variant_discrim_name. */
14f9c5c9 6264
d2e4a39e 6265char *
ebf56fd3 6266ada_variant_discrim_name (struct type *type0)
14f9c5c9 6267{
d2e4a39e 6268 static char *result = NULL;
14f9c5c9 6269 static size_t result_len = 0;
d2e4a39e
AS
6270 struct type *type;
6271 const char *name;
6272 const char *discrim_end;
6273 const char *discrim_start;
14f9c5c9
AS
6274
6275 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
6276 type = TYPE_TARGET_TYPE (type0);
6277 else
6278 type = type0;
6279
6280 name = ada_type_name (type);
6281
6282 if (name == NULL || name[0] == '\000')
6283 return "";
6284
6285 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
6286 discrim_end -= 1)
6287 {
4c4b4cd2
PH
6288 if (strncmp (discrim_end, "___XVN", 6) == 0)
6289 break;
14f9c5c9
AS
6290 }
6291 if (discrim_end == name)
6292 return "";
6293
d2e4a39e 6294 for (discrim_start = discrim_end; discrim_start != name + 3;
14f9c5c9
AS
6295 discrim_start -= 1)
6296 {
d2e4a39e 6297 if (discrim_start == name + 1)
4c4b4cd2 6298 return "";
76a01679 6299 if ((discrim_start > name + 3
4c4b4cd2
PH
6300 && strncmp (discrim_start - 3, "___", 3) == 0)
6301 || discrim_start[-1] == '.')
6302 break;
14f9c5c9
AS
6303 }
6304
6305 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
6306 strncpy (result, discrim_start, discrim_end - discrim_start);
d2e4a39e 6307 result[discrim_end - discrim_start] = '\0';
14f9c5c9
AS
6308 return result;
6309}
6310
4c4b4cd2
PH
6311/* Scan STR for a subtype-encoded number, beginning at position K.
6312 Put the position of the character just past the number scanned in
6313 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6314 Return 1 if there was a valid number at the given position, and 0
6315 otherwise. A "subtype-encoded" number consists of the absolute value
6316 in decimal, followed by the letter 'm' to indicate a negative number.
6317 Assumes 0m does not occur. */
14f9c5c9
AS
6318
6319int
d2e4a39e 6320ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
14f9c5c9
AS
6321{
6322 ULONGEST RU;
6323
d2e4a39e 6324 if (!isdigit (str[k]))
14f9c5c9
AS
6325 return 0;
6326
4c4b4cd2 6327 /* Do it the hard way so as not to make any assumption about
14f9c5c9 6328 the relationship of unsigned long (%lu scan format code) and
4c4b4cd2 6329 LONGEST. */
14f9c5c9
AS
6330 RU = 0;
6331 while (isdigit (str[k]))
6332 {
d2e4a39e 6333 RU = RU * 10 + (str[k] - '0');
14f9c5c9
AS
6334 k += 1;
6335 }
6336
d2e4a39e 6337 if (str[k] == 'm')
14f9c5c9
AS
6338 {
6339 if (R != NULL)
4c4b4cd2 6340 *R = (-(LONGEST) (RU - 1)) - 1;
14f9c5c9
AS
6341 k += 1;
6342 }
6343 else if (R != NULL)
6344 *R = (LONGEST) RU;
6345
4c4b4cd2 6346 /* NOTE on the above: Technically, C does not say what the results of
14f9c5c9
AS
6347 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6348 number representable as a LONGEST (although either would probably work
6349 in most implementations). When RU>0, the locution in the then branch
4c4b4cd2 6350 above is always equivalent to the negative of RU. */
14f9c5c9
AS
6351
6352 if (new_k != NULL)
6353 *new_k = k;
6354 return 1;
6355}
6356
4c4b4cd2
PH
6357/* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6358 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6359 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
14f9c5c9 6360
d2e4a39e 6361int
ebf56fd3 6362ada_in_variant (LONGEST val, struct type *type, int field_num)
14f9c5c9 6363{
d2e4a39e 6364 const char *name = TYPE_FIELD_NAME (type, field_num);
14f9c5c9
AS
6365 int p;
6366
6367 p = 0;
6368 while (1)
6369 {
d2e4a39e 6370 switch (name[p])
4c4b4cd2
PH
6371 {
6372 case '\0':
6373 return 0;
6374 case 'S':
6375 {
6376 LONGEST W;
5b4ee69b 6377
4c4b4cd2
PH
6378 if (!ada_scan_number (name, p + 1, &W, &p))
6379 return 0;
6380 if (val == W)
6381 return 1;
6382 break;
6383 }
6384 case 'R':
6385 {
6386 LONGEST L, U;
5b4ee69b 6387
4c4b4cd2
PH
6388 if (!ada_scan_number (name, p + 1, &L, &p)
6389 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
6390 return 0;
6391 if (val >= L && val <= U)
6392 return 1;
6393 break;
6394 }
6395 case 'O':
6396 return 1;
6397 default:
6398 return 0;
6399 }
6400 }
6401}
6402
0963b4bd 6403/* FIXME: Lots of redundancy below. Try to consolidate. */
4c4b4cd2
PH
6404
6405/* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6406 ARG_TYPE, extract and return the value of one of its (non-static)
6407 fields. FIELDNO says which field. Differs from value_primitive_field
6408 only in that it can handle packed values of arbitrary type. */
14f9c5c9 6409
4c4b4cd2 6410static struct value *
d2e4a39e 6411ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
4c4b4cd2 6412 struct type *arg_type)
14f9c5c9 6413{
14f9c5c9
AS
6414 struct type *type;
6415
61ee279c 6416 arg_type = ada_check_typedef (arg_type);
14f9c5c9
AS
6417 type = TYPE_FIELD_TYPE (arg_type, fieldno);
6418
4c4b4cd2 6419 /* Handle packed fields. */
14f9c5c9
AS
6420
6421 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
6422 {
6423 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
6424 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
d2e4a39e 6425
0fd88904 6426 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
4c4b4cd2
PH
6427 offset + bit_pos / 8,
6428 bit_pos % 8, bit_size, type);
14f9c5c9
AS
6429 }
6430 else
6431 return value_primitive_field (arg1, offset, fieldno, arg_type);
6432}
6433
52ce6436
PH
6434/* Find field with name NAME in object of type TYPE. If found,
6435 set the following for each argument that is non-null:
6436 - *FIELD_TYPE_P to the field's type;
6437 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6438 an object of that type;
6439 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6440 - *BIT_SIZE_P to its size in bits if the field is packed, and
6441 0 otherwise;
6442 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6443 fields up to but not including the desired field, or by the total
6444 number of fields if not found. A NULL value of NAME never
6445 matches; the function just counts visible fields in this case.
6446
0963b4bd 6447 Returns 1 if found, 0 otherwise. */
52ce6436 6448
4c4b4cd2 6449static int
0d5cff50 6450find_struct_field (const char *name, struct type *type, int offset,
76a01679 6451 struct type **field_type_p,
52ce6436
PH
6452 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
6453 int *index_p)
4c4b4cd2
PH
6454{
6455 int i;
6456
61ee279c 6457 type = ada_check_typedef (type);
76a01679 6458
52ce6436
PH
6459 if (field_type_p != NULL)
6460 *field_type_p = NULL;
6461 if (byte_offset_p != NULL)
d5d6fca5 6462 *byte_offset_p = 0;
52ce6436
PH
6463 if (bit_offset_p != NULL)
6464 *bit_offset_p = 0;
6465 if (bit_size_p != NULL)
6466 *bit_size_p = 0;
6467
6468 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
4c4b4cd2
PH
6469 {
6470 int bit_pos = TYPE_FIELD_BITPOS (type, i);
6471 int fld_offset = offset + bit_pos / 8;
0d5cff50 6472 const char *t_field_name = TYPE_FIELD_NAME (type, i);
76a01679 6473
4c4b4cd2
PH
6474 if (t_field_name == NULL)
6475 continue;
6476
52ce6436 6477 else if (name != NULL && field_name_match (t_field_name, name))
76a01679
JB
6478 {
6479 int bit_size = TYPE_FIELD_BITSIZE (type, i);
5b4ee69b 6480
52ce6436
PH
6481 if (field_type_p != NULL)
6482 *field_type_p = TYPE_FIELD_TYPE (type, i);
6483 if (byte_offset_p != NULL)
6484 *byte_offset_p = fld_offset;
6485 if (bit_offset_p != NULL)
6486 *bit_offset_p = bit_pos % 8;
6487 if (bit_size_p != NULL)
6488 *bit_size_p = bit_size;
76a01679
JB
6489 return 1;
6490 }
4c4b4cd2
PH
6491 else if (ada_is_wrapper_field (type, i))
6492 {
52ce6436
PH
6493 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
6494 field_type_p, byte_offset_p, bit_offset_p,
6495 bit_size_p, index_p))
76a01679
JB
6496 return 1;
6497 }
4c4b4cd2
PH
6498 else if (ada_is_variant_part (type, i))
6499 {
52ce6436
PH
6500 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6501 fixed type?? */
4c4b4cd2 6502 int j;
52ce6436
PH
6503 struct type *field_type
6504 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
4c4b4cd2 6505
52ce6436 6506 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
4c4b4cd2 6507 {
76a01679
JB
6508 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
6509 fld_offset
6510 + TYPE_FIELD_BITPOS (field_type, j) / 8,
6511 field_type_p, byte_offset_p,
52ce6436 6512 bit_offset_p, bit_size_p, index_p))
76a01679 6513 return 1;
4c4b4cd2
PH
6514 }
6515 }
52ce6436
PH
6516 else if (index_p != NULL)
6517 *index_p += 1;
4c4b4cd2
PH
6518 }
6519 return 0;
6520}
6521
0963b4bd 6522/* Number of user-visible fields in record type TYPE. */
4c4b4cd2 6523
52ce6436
PH
6524static int
6525num_visible_fields (struct type *type)
6526{
6527 int n;
5b4ee69b 6528
52ce6436
PH
6529 n = 0;
6530 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
6531 return n;
6532}
14f9c5c9 6533
4c4b4cd2 6534/* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
14f9c5c9
AS
6535 and search in it assuming it has (class) type TYPE.
6536 If found, return value, else return NULL.
6537
4c4b4cd2 6538 Searches recursively through wrapper fields (e.g., '_parent'). */
14f9c5c9 6539
4c4b4cd2 6540static struct value *
d2e4a39e 6541ada_search_struct_field (char *name, struct value *arg, int offset,
4c4b4cd2 6542 struct type *type)
14f9c5c9
AS
6543{
6544 int i;
14f9c5c9 6545
5b4ee69b 6546 type = ada_check_typedef (type);
52ce6436 6547 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
14f9c5c9 6548 {
0d5cff50 6549 const char *t_field_name = TYPE_FIELD_NAME (type, i);
14f9c5c9
AS
6550
6551 if (t_field_name == NULL)
4c4b4cd2 6552 continue;
14f9c5c9
AS
6553
6554 else if (field_name_match (t_field_name, name))
4c4b4cd2 6555 return ada_value_primitive_field (arg, offset, i, type);
14f9c5c9
AS
6556
6557 else if (ada_is_wrapper_field (type, i))
4c4b4cd2 6558 {
0963b4bd 6559 struct value *v = /* Do not let indent join lines here. */
06d5cf63
JB
6560 ada_search_struct_field (name, arg,
6561 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6562 TYPE_FIELD_TYPE (type, i));
5b4ee69b 6563
4c4b4cd2
PH
6564 if (v != NULL)
6565 return v;
6566 }
14f9c5c9
AS
6567
6568 else if (ada_is_variant_part (type, i))
4c4b4cd2 6569 {
0963b4bd 6570 /* PNH: Do we ever get here? See find_struct_field. */
4c4b4cd2 6571 int j;
5b4ee69b
MS
6572 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
6573 i));
4c4b4cd2
PH
6574 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
6575
52ce6436 6576 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
4c4b4cd2 6577 {
0963b4bd
MS
6578 struct value *v = ada_search_struct_field /* Force line
6579 break. */
06d5cf63
JB
6580 (name, arg,
6581 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
6582 TYPE_FIELD_TYPE (field_type, j));
5b4ee69b 6583
4c4b4cd2
PH
6584 if (v != NULL)
6585 return v;
6586 }
6587 }
14f9c5c9
AS
6588 }
6589 return NULL;
6590}
d2e4a39e 6591
52ce6436
PH
6592static struct value *ada_index_struct_field_1 (int *, struct value *,
6593 int, struct type *);
6594
6595
6596/* Return field #INDEX in ARG, where the index is that returned by
6597 * find_struct_field through its INDEX_P argument. Adjust the address
6598 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
0963b4bd 6599 * If found, return value, else return NULL. */
52ce6436
PH
6600
6601static struct value *
6602ada_index_struct_field (int index, struct value *arg, int offset,
6603 struct type *type)
6604{
6605 return ada_index_struct_field_1 (&index, arg, offset, type);
6606}
6607
6608
6609/* Auxiliary function for ada_index_struct_field. Like
6610 * ada_index_struct_field, but takes index from *INDEX_P and modifies
0963b4bd 6611 * *INDEX_P. */
52ce6436
PH
6612
6613static struct value *
6614ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
6615 struct type *type)
6616{
6617 int i;
6618 type = ada_check_typedef (type);
6619
6620 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6621 {
6622 if (TYPE_FIELD_NAME (type, i) == NULL)
6623 continue;
6624 else if (ada_is_wrapper_field (type, i))
6625 {
0963b4bd 6626 struct value *v = /* Do not let indent join lines here. */
52ce6436
PH
6627 ada_index_struct_field_1 (index_p, arg,
6628 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6629 TYPE_FIELD_TYPE (type, i));
5b4ee69b 6630
52ce6436
PH
6631 if (v != NULL)
6632 return v;
6633 }
6634
6635 else if (ada_is_variant_part (type, i))
6636 {
6637 /* PNH: Do we ever get here? See ada_search_struct_field,
0963b4bd 6638 find_struct_field. */
52ce6436
PH
6639 error (_("Cannot assign this kind of variant record"));
6640 }
6641 else if (*index_p == 0)
6642 return ada_value_primitive_field (arg, offset, i, type);
6643 else
6644 *index_p -= 1;
6645 }
6646 return NULL;
6647}
6648
4c4b4cd2
PH
6649/* Given ARG, a value of type (pointer or reference to a)*
6650 structure/union, extract the component named NAME from the ultimate
6651 target structure/union and return it as a value with its
f5938064 6652 appropriate type.
14f9c5c9 6653
4c4b4cd2
PH
6654 The routine searches for NAME among all members of the structure itself
6655 and (recursively) among all members of any wrapper members
14f9c5c9
AS
6656 (e.g., '_parent').
6657
03ee6b2e
PH
6658 If NO_ERR, then simply return NULL in case of error, rather than
6659 calling error. */
14f9c5c9 6660
d2e4a39e 6661struct value *
03ee6b2e 6662ada_value_struct_elt (struct value *arg, char *name, int no_err)
14f9c5c9 6663{
4c4b4cd2 6664 struct type *t, *t1;
d2e4a39e 6665 struct value *v;
14f9c5c9 6666
4c4b4cd2 6667 v = NULL;
df407dfe 6668 t1 = t = ada_check_typedef (value_type (arg));
4c4b4cd2
PH
6669 if (TYPE_CODE (t) == TYPE_CODE_REF)
6670 {
6671 t1 = TYPE_TARGET_TYPE (t);
6672 if (t1 == NULL)
03ee6b2e 6673 goto BadValue;
61ee279c 6674 t1 = ada_check_typedef (t1);
4c4b4cd2 6675 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
76a01679 6676 {
994b9211 6677 arg = coerce_ref (arg);
76a01679
JB
6678 t = t1;
6679 }
4c4b4cd2 6680 }
14f9c5c9 6681
4c4b4cd2
PH
6682 while (TYPE_CODE (t) == TYPE_CODE_PTR)
6683 {
6684 t1 = TYPE_TARGET_TYPE (t);
6685 if (t1 == NULL)
03ee6b2e 6686 goto BadValue;
61ee279c 6687 t1 = ada_check_typedef (t1);
4c4b4cd2 6688 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
76a01679
JB
6689 {
6690 arg = value_ind (arg);
6691 t = t1;
6692 }
4c4b4cd2 6693 else
76a01679 6694 break;
4c4b4cd2 6695 }
14f9c5c9 6696
4c4b4cd2 6697 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
03ee6b2e 6698 goto BadValue;
14f9c5c9 6699
4c4b4cd2
PH
6700 if (t1 == t)
6701 v = ada_search_struct_field (name, arg, 0, t);
6702 else
6703 {
6704 int bit_offset, bit_size, byte_offset;
6705 struct type *field_type;
6706 CORE_ADDR address;
6707
76a01679
JB
6708 if (TYPE_CODE (t) == TYPE_CODE_PTR)
6709 address = value_as_address (arg);
4c4b4cd2 6710 else
0fd88904 6711 address = unpack_pointer (t, value_contents (arg));
14f9c5c9 6712
1ed6ede0 6713 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
76a01679
JB
6714 if (find_struct_field (name, t1, 0,
6715 &field_type, &byte_offset, &bit_offset,
52ce6436 6716 &bit_size, NULL))
76a01679
JB
6717 {
6718 if (bit_size != 0)
6719 {
714e53ab
PH
6720 if (TYPE_CODE (t) == TYPE_CODE_REF)
6721 arg = ada_coerce_ref (arg);
6722 else
6723 arg = ada_value_ind (arg);
76a01679
JB
6724 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
6725 bit_offset, bit_size,
6726 field_type);
6727 }
6728 else
f5938064 6729 v = value_at_lazy (field_type, address + byte_offset);
76a01679
JB
6730 }
6731 }
6732
03ee6b2e
PH
6733 if (v != NULL || no_err)
6734 return v;
6735 else
323e0a4a 6736 error (_("There is no member named %s."), name);
14f9c5c9 6737
03ee6b2e
PH
6738 BadValue:
6739 if (no_err)
6740 return NULL;
6741 else
0963b4bd
MS
6742 error (_("Attempt to extract a component of "
6743 "a value that is not a record."));
14f9c5c9
AS
6744}
6745
6746/* Given a type TYPE, look up the type of the component of type named NAME.
4c4b4cd2
PH
6747 If DISPP is non-null, add its byte displacement from the beginning of a
6748 structure (pointed to by a value) of type TYPE to *DISPP (does not
14f9c5c9
AS
6749 work for packed fields).
6750
6751 Matches any field whose name has NAME as a prefix, possibly
4c4b4cd2 6752 followed by "___".
14f9c5c9 6753
0963b4bd 6754 TYPE can be either a struct or union. If REFOK, TYPE may also
4c4b4cd2
PH
6755 be a (pointer or reference)+ to a struct or union, and the
6756 ultimate target type will be searched.
14f9c5c9
AS
6757
6758 Looks recursively into variant clauses and parent types.
6759
4c4b4cd2
PH
6760 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6761 TYPE is not a type of the right kind. */
14f9c5c9 6762
4c4b4cd2 6763static struct type *
76a01679
JB
6764ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
6765 int noerr, int *dispp)
14f9c5c9
AS
6766{
6767 int i;
6768
6769 if (name == NULL)
6770 goto BadName;
6771
76a01679 6772 if (refok && type != NULL)
4c4b4cd2
PH
6773 while (1)
6774 {
61ee279c 6775 type = ada_check_typedef (type);
76a01679
JB
6776 if (TYPE_CODE (type) != TYPE_CODE_PTR
6777 && TYPE_CODE (type) != TYPE_CODE_REF)
6778 break;
6779 type = TYPE_TARGET_TYPE (type);
4c4b4cd2 6780 }
14f9c5c9 6781
76a01679 6782 if (type == NULL
1265e4aa
JB
6783 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
6784 && TYPE_CODE (type) != TYPE_CODE_UNION))
14f9c5c9 6785 {
4c4b4cd2 6786 if (noerr)
76a01679 6787 return NULL;
4c4b4cd2 6788 else
76a01679
JB
6789 {
6790 target_terminal_ours ();
6791 gdb_flush (gdb_stdout);
323e0a4a
AC
6792 if (type == NULL)
6793 error (_("Type (null) is not a structure or union type"));
6794 else
6795 {
6796 /* XXX: type_sprint */
6797 fprintf_unfiltered (gdb_stderr, _("Type "));
6798 type_print (type, "", gdb_stderr, -1);
6799 error (_(" is not a structure or union type"));
6800 }
76a01679 6801 }
14f9c5c9
AS
6802 }
6803
6804 type = to_static_fixed_type (type);
6805
6806 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6807 {
0d5cff50 6808 const char *t_field_name = TYPE_FIELD_NAME (type, i);
14f9c5c9
AS
6809 struct type *t;
6810 int disp;
d2e4a39e 6811
14f9c5c9 6812 if (t_field_name == NULL)
4c4b4cd2 6813 continue;
14f9c5c9
AS
6814
6815 else if (field_name_match (t_field_name, name))
4c4b4cd2
PH
6816 {
6817 if (dispp != NULL)
6818 *dispp += TYPE_FIELD_BITPOS (type, i) / 8;
61ee279c 6819 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
4c4b4cd2 6820 }
14f9c5c9
AS
6821
6822 else if (ada_is_wrapper_field (type, i))
4c4b4cd2
PH
6823 {
6824 disp = 0;
6825 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
6826 0, 1, &disp);
6827 if (t != NULL)
6828 {
6829 if (dispp != NULL)
6830 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6831 return t;
6832 }
6833 }
14f9c5c9
AS
6834
6835 else if (ada_is_variant_part (type, i))
4c4b4cd2
PH
6836 {
6837 int j;
5b4ee69b
MS
6838 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
6839 i));
4c4b4cd2
PH
6840
6841 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
6842 {
b1f33ddd
JB
6843 /* FIXME pnh 2008/01/26: We check for a field that is
6844 NOT wrapped in a struct, since the compiler sometimes
6845 generates these for unchecked variant types. Revisit
0963b4bd 6846 if the compiler changes this practice. */
0d5cff50 6847 const char *v_field_name = TYPE_FIELD_NAME (field_type, j);
4c4b4cd2 6848 disp = 0;
b1f33ddd
JB
6849 if (v_field_name != NULL
6850 && field_name_match (v_field_name, name))
6851 t = ada_check_typedef (TYPE_FIELD_TYPE (field_type, j));
6852 else
0963b4bd
MS
6853 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type,
6854 j),
b1f33ddd
JB
6855 name, 0, 1, &disp);
6856
4c4b4cd2
PH
6857 if (t != NULL)
6858 {
6859 if (dispp != NULL)
6860 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6861 return t;
6862 }
6863 }
6864 }
14f9c5c9
AS
6865
6866 }
6867
6868BadName:
d2e4a39e 6869 if (!noerr)
14f9c5c9
AS
6870 {
6871 target_terminal_ours ();
6872 gdb_flush (gdb_stdout);
323e0a4a
AC
6873 if (name == NULL)
6874 {
6875 /* XXX: type_sprint */
6876 fprintf_unfiltered (gdb_stderr, _("Type "));
6877 type_print (type, "", gdb_stderr, -1);
6878 error (_(" has no component named <null>"));
6879 }
6880 else
6881 {
6882 /* XXX: type_sprint */
6883 fprintf_unfiltered (gdb_stderr, _("Type "));
6884 type_print (type, "", gdb_stderr, -1);
6885 error (_(" has no component named %s"), name);
6886 }
14f9c5c9
AS
6887 }
6888
6889 return NULL;
6890}
6891
b1f33ddd
JB
6892/* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6893 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6894 represents an unchecked union (that is, the variant part of a
0963b4bd 6895 record that is named in an Unchecked_Union pragma). */
b1f33ddd
JB
6896
6897static int
6898is_unchecked_variant (struct type *var_type, struct type *outer_type)
6899{
6900 char *discrim_name = ada_variant_discrim_name (var_type);
5b4ee69b 6901
b1f33ddd
JB
6902 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1, NULL)
6903 == NULL);
6904}
6905
6906
14f9c5c9
AS
6907/* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6908 within a value of type OUTER_TYPE that is stored in GDB at
4c4b4cd2
PH
6909 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6910 numbering from 0) is applicable. Returns -1 if none are. */
14f9c5c9 6911
d2e4a39e 6912int
ebf56fd3 6913ada_which_variant_applies (struct type *var_type, struct type *outer_type,
fc1a4b47 6914 const gdb_byte *outer_valaddr)
14f9c5c9
AS
6915{
6916 int others_clause;
6917 int i;
d2e4a39e 6918 char *discrim_name = ada_variant_discrim_name (var_type);
0c281816
JB
6919 struct value *outer;
6920 struct value *discrim;
14f9c5c9
AS
6921 LONGEST discrim_val;
6922
0c281816
JB
6923 outer = value_from_contents_and_address (outer_type, outer_valaddr, 0);
6924 discrim = ada_value_struct_elt (outer, discrim_name, 1);
6925 if (discrim == NULL)
14f9c5c9 6926 return -1;
0c281816 6927 discrim_val = value_as_long (discrim);
14f9c5c9
AS
6928
6929 others_clause = -1;
6930 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
6931 {
6932 if (ada_is_others_clause (var_type, i))
4c4b4cd2 6933 others_clause = i;
14f9c5c9 6934 else if (ada_in_variant (discrim_val, var_type, i))
4c4b4cd2 6935 return i;
14f9c5c9
AS
6936 }
6937
6938 return others_clause;
6939}
d2e4a39e 6940\f
14f9c5c9
AS
6941
6942
4c4b4cd2 6943 /* Dynamic-Sized Records */
14f9c5c9
AS
6944
6945/* Strategy: The type ostensibly attached to a value with dynamic size
6946 (i.e., a size that is not statically recorded in the debugging
6947 data) does not accurately reflect the size or layout of the value.
6948 Our strategy is to convert these values to values with accurate,
4c4b4cd2 6949 conventional types that are constructed on the fly. */
14f9c5c9
AS
6950
6951/* There is a subtle and tricky problem here. In general, we cannot
6952 determine the size of dynamic records without its data. However,
6953 the 'struct value' data structure, which GDB uses to represent
6954 quantities in the inferior process (the target), requires the size
6955 of the type at the time of its allocation in order to reserve space
6956 for GDB's internal copy of the data. That's why the
6957 'to_fixed_xxx_type' routines take (target) addresses as parameters,
4c4b4cd2 6958 rather than struct value*s.
14f9c5c9
AS
6959
6960 However, GDB's internal history variables ($1, $2, etc.) are
6961 struct value*s containing internal copies of the data that are not, in
6962 general, the same as the data at their corresponding addresses in
6963 the target. Fortunately, the types we give to these values are all
6964 conventional, fixed-size types (as per the strategy described
6965 above), so that we don't usually have to perform the
6966 'to_fixed_xxx_type' conversions to look at their values.
6967 Unfortunately, there is one exception: if one of the internal
6968 history variables is an array whose elements are unconstrained
6969 records, then we will need to create distinct fixed types for each
6970 element selected. */
6971
6972/* The upshot of all of this is that many routines take a (type, host
6973 address, target address) triple as arguments to represent a value.
6974 The host address, if non-null, is supposed to contain an internal
6975 copy of the relevant data; otherwise, the program is to consult the
4c4b4cd2 6976 target at the target address. */
14f9c5c9
AS
6977
6978/* Assuming that VAL0 represents a pointer value, the result of
6979 dereferencing it. Differs from value_ind in its treatment of
4c4b4cd2 6980 dynamic-sized types. */
14f9c5c9 6981
d2e4a39e
AS
6982struct value *
6983ada_value_ind (struct value *val0)
14f9c5c9 6984{
c48db5ca 6985 struct value *val = value_ind (val0);
5b4ee69b 6986
4c4b4cd2 6987 return ada_to_fixed_value (val);
14f9c5c9
AS
6988}
6989
6990/* The value resulting from dereferencing any "reference to"
4c4b4cd2
PH
6991 qualifiers on VAL0. */
6992
d2e4a39e
AS
6993static struct value *
6994ada_coerce_ref (struct value *val0)
6995{
df407dfe 6996 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
d2e4a39e
AS
6997 {
6998 struct value *val = val0;
5b4ee69b 6999
994b9211 7000 val = coerce_ref (val);
4c4b4cd2 7001 return ada_to_fixed_value (val);
d2e4a39e
AS
7002 }
7003 else
14f9c5c9
AS
7004 return val0;
7005}
7006
7007/* Return OFF rounded upward if necessary to a multiple of
4c4b4cd2 7008 ALIGNMENT (a power of 2). */
14f9c5c9
AS
7009
7010static unsigned int
ebf56fd3 7011align_value (unsigned int off, unsigned int alignment)
14f9c5c9
AS
7012{
7013 return (off + alignment - 1) & ~(alignment - 1);
7014}
7015
4c4b4cd2 7016/* Return the bit alignment required for field #F of template type TYPE. */
14f9c5c9
AS
7017
7018static unsigned int
ebf56fd3 7019field_alignment (struct type *type, int f)
14f9c5c9 7020{
d2e4a39e 7021 const char *name = TYPE_FIELD_NAME (type, f);
64a1bf19 7022 int len;
14f9c5c9
AS
7023 int align_offset;
7024
64a1bf19
JB
7025 /* The field name should never be null, unless the debugging information
7026 is somehow malformed. In this case, we assume the field does not
7027 require any alignment. */
7028 if (name == NULL)
7029 return 1;
7030
7031 len = strlen (name);
7032
4c4b4cd2
PH
7033 if (!isdigit (name[len - 1]))
7034 return 1;
14f9c5c9 7035
d2e4a39e 7036 if (isdigit (name[len - 2]))
14f9c5c9
AS
7037 align_offset = len - 2;
7038 else
7039 align_offset = len - 1;
7040
4c4b4cd2 7041 if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
14f9c5c9
AS
7042 return TARGET_CHAR_BIT;
7043
4c4b4cd2
PH
7044 return atoi (name + align_offset) * TARGET_CHAR_BIT;
7045}
7046
852dff6c 7047/* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
4c4b4cd2 7048
852dff6c
JB
7049static struct symbol *
7050ada_find_any_type_symbol (const char *name)
4c4b4cd2
PH
7051{
7052 struct symbol *sym;
7053
7054 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
7055 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
7056 return sym;
7057
7058 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
7059 return sym;
14f9c5c9
AS
7060}
7061
dddfab26
UW
7062/* Find a type named NAME. Ignores ambiguity. This routine will look
7063 solely for types defined by debug info, it will not search the GDB
7064 primitive types. */
4c4b4cd2 7065
852dff6c 7066static struct type *
ebf56fd3 7067ada_find_any_type (const char *name)
14f9c5c9 7068{
852dff6c 7069 struct symbol *sym = ada_find_any_type_symbol (name);
14f9c5c9 7070
14f9c5c9 7071 if (sym != NULL)
dddfab26 7072 return SYMBOL_TYPE (sym);
14f9c5c9 7073
dddfab26 7074 return NULL;
14f9c5c9
AS
7075}
7076
739593e0
JB
7077/* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7078 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7079 symbol, in which case it is returned. Otherwise, this looks for
7080 symbols whose name is that of NAME_SYM suffixed with "___XR".
7081 Return symbol if found, and NULL otherwise. */
4c4b4cd2
PH
7082
7083struct symbol *
739593e0 7084ada_find_renaming_symbol (struct symbol *name_sym, struct block *block)
aeb5907d 7085{
739593e0 7086 const char *name = SYMBOL_LINKAGE_NAME (name_sym);
aeb5907d
JB
7087 struct symbol *sym;
7088
739593e0
JB
7089 if (strstr (name, "___XR") != NULL)
7090 return name_sym;
7091
aeb5907d
JB
7092 sym = find_old_style_renaming_symbol (name, block);
7093
7094 if (sym != NULL)
7095 return sym;
7096
0963b4bd 7097 /* Not right yet. FIXME pnh 7/20/2007. */
852dff6c 7098 sym = ada_find_any_type_symbol (name);
aeb5907d
JB
7099 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
7100 return sym;
7101 else
7102 return NULL;
7103}
7104
7105static struct symbol *
7106find_old_style_renaming_symbol (const char *name, struct block *block)
4c4b4cd2 7107{
7f0df278 7108 const struct symbol *function_sym = block_linkage_function (block);
4c4b4cd2
PH
7109 char *rename;
7110
7111 if (function_sym != NULL)
7112 {
7113 /* If the symbol is defined inside a function, NAME is not fully
7114 qualified. This means we need to prepend the function name
7115 as well as adding the ``___XR'' suffix to build the name of
7116 the associated renaming symbol. */
0d5cff50 7117 const char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
529cad9c
PH
7118 /* Function names sometimes contain suffixes used
7119 for instance to qualify nested subprograms. When building
7120 the XR type name, we need to make sure that this suffix is
7121 not included. So do not include any suffix in the function
7122 name length below. */
69fadcdf 7123 int function_name_len = ada_name_prefix_len (function_name);
76a01679
JB
7124 const int rename_len = function_name_len + 2 /* "__" */
7125 + strlen (name) + 6 /* "___XR\0" */ ;
4c4b4cd2 7126
529cad9c 7127 /* Strip the suffix if necessary. */
69fadcdf
JB
7128 ada_remove_trailing_digits (function_name, &function_name_len);
7129 ada_remove_po_subprogram_suffix (function_name, &function_name_len);
7130 ada_remove_Xbn_suffix (function_name, &function_name_len);
529cad9c 7131
4c4b4cd2
PH
7132 /* Library-level functions are a special case, as GNAT adds
7133 a ``_ada_'' prefix to the function name to avoid namespace
aeb5907d 7134 pollution. However, the renaming symbols themselves do not
4c4b4cd2
PH
7135 have this prefix, so we need to skip this prefix if present. */
7136 if (function_name_len > 5 /* "_ada_" */
7137 && strstr (function_name, "_ada_") == function_name)
69fadcdf
JB
7138 {
7139 function_name += 5;
7140 function_name_len -= 5;
7141 }
4c4b4cd2
PH
7142
7143 rename = (char *) alloca (rename_len * sizeof (char));
69fadcdf
JB
7144 strncpy (rename, function_name, function_name_len);
7145 xsnprintf (rename + function_name_len, rename_len - function_name_len,
7146 "__%s___XR", name);
4c4b4cd2
PH
7147 }
7148 else
7149 {
7150 const int rename_len = strlen (name) + 6;
5b4ee69b 7151
4c4b4cd2 7152 rename = (char *) alloca (rename_len * sizeof (char));
88c15c34 7153 xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name);
4c4b4cd2
PH
7154 }
7155
852dff6c 7156 return ada_find_any_type_symbol (rename);
4c4b4cd2
PH
7157}
7158
14f9c5c9 7159/* Because of GNAT encoding conventions, several GDB symbols may match a
4c4b4cd2 7160 given type name. If the type denoted by TYPE0 is to be preferred to
14f9c5c9 7161 that of TYPE1 for purposes of type printing, return non-zero;
4c4b4cd2
PH
7162 otherwise return 0. */
7163
14f9c5c9 7164int
d2e4a39e 7165ada_prefer_type (struct type *type0, struct type *type1)
14f9c5c9
AS
7166{
7167 if (type1 == NULL)
7168 return 1;
7169 else if (type0 == NULL)
7170 return 0;
7171 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
7172 return 1;
7173 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
7174 return 0;
4c4b4cd2
PH
7175 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
7176 return 1;
ad82864c 7177 else if (ada_is_constrained_packed_array_type (type0))
14f9c5c9 7178 return 1;
4c4b4cd2
PH
7179 else if (ada_is_array_descriptor_type (type0)
7180 && !ada_is_array_descriptor_type (type1))
14f9c5c9 7181 return 1;
aeb5907d
JB
7182 else
7183 {
7184 const char *type0_name = type_name_no_tag (type0);
7185 const char *type1_name = type_name_no_tag (type1);
7186
7187 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
7188 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
7189 return 1;
7190 }
14f9c5c9
AS
7191 return 0;
7192}
7193
7194/* The name of TYPE, which is either its TYPE_NAME, or, if that is
4c4b4cd2
PH
7195 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7196
0d5cff50 7197const char *
d2e4a39e 7198ada_type_name (struct type *type)
14f9c5c9 7199{
d2e4a39e 7200 if (type == NULL)
14f9c5c9
AS
7201 return NULL;
7202 else if (TYPE_NAME (type) != NULL)
7203 return TYPE_NAME (type);
7204 else
7205 return TYPE_TAG_NAME (type);
7206}
7207
b4ba55a1
JB
7208/* Search the list of "descriptive" types associated to TYPE for a type
7209 whose name is NAME. */
7210
7211static struct type *
7212find_parallel_type_by_descriptive_type (struct type *type, const char *name)
7213{
7214 struct type *result;
7215
7216 /* If there no descriptive-type info, then there is no parallel type
7217 to be found. */
7218 if (!HAVE_GNAT_AUX_INFO (type))
7219 return NULL;
7220
7221 result = TYPE_DESCRIPTIVE_TYPE (type);
7222 while (result != NULL)
7223 {
0d5cff50 7224 const char *result_name = ada_type_name (result);
b4ba55a1
JB
7225
7226 if (result_name == NULL)
7227 {
7228 warning (_("unexpected null name on descriptive type"));
7229 return NULL;
7230 }
7231
7232 /* If the names match, stop. */
7233 if (strcmp (result_name, name) == 0)
7234 break;
7235
7236 /* Otherwise, look at the next item on the list, if any. */
7237 if (HAVE_GNAT_AUX_INFO (result))
7238 result = TYPE_DESCRIPTIVE_TYPE (result);
7239 else
7240 result = NULL;
7241 }
7242
7243 /* If we didn't find a match, see whether this is a packed array. With
7244 older compilers, the descriptive type information is either absent or
7245 irrelevant when it comes to packed arrays so the above lookup fails.
7246 Fall back to using a parallel lookup by name in this case. */
12ab9e09 7247 if (result == NULL && ada_is_constrained_packed_array_type (type))
b4ba55a1
JB
7248 return ada_find_any_type (name);
7249
7250 return result;
7251}
7252
7253/* Find a parallel type to TYPE with the specified NAME, using the
7254 descriptive type taken from the debugging information, if available,
7255 and otherwise using the (slower) name-based method. */
7256
7257static struct type *
7258ada_find_parallel_type_with_name (struct type *type, const char *name)
7259{
7260 struct type *result = NULL;
7261
7262 if (HAVE_GNAT_AUX_INFO (type))
7263 result = find_parallel_type_by_descriptive_type (type, name);
7264 else
7265 result = ada_find_any_type (name);
7266
7267 return result;
7268}
7269
7270/* Same as above, but specify the name of the parallel type by appending
4c4b4cd2 7271 SUFFIX to the name of TYPE. */
14f9c5c9 7272
d2e4a39e 7273struct type *
ebf56fd3 7274ada_find_parallel_type (struct type *type, const char *suffix)
14f9c5c9 7275{
0d5cff50
DE
7276 char *name;
7277 const char *typename = ada_type_name (type);
14f9c5c9 7278 int len;
d2e4a39e 7279
14f9c5c9
AS
7280 if (typename == NULL)
7281 return NULL;
7282
7283 len = strlen (typename);
7284
b4ba55a1 7285 name = (char *) alloca (len + strlen (suffix) + 1);
14f9c5c9
AS
7286
7287 strcpy (name, typename);
7288 strcpy (name + len, suffix);
7289
b4ba55a1 7290 return ada_find_parallel_type_with_name (type, name);
14f9c5c9
AS
7291}
7292
14f9c5c9 7293/* If TYPE is a variable-size record type, return the corresponding template
4c4b4cd2 7294 type describing its fields. Otherwise, return NULL. */
14f9c5c9 7295
d2e4a39e
AS
7296static struct type *
7297dynamic_template_type (struct type *type)
14f9c5c9 7298{
61ee279c 7299 type = ada_check_typedef (type);
14f9c5c9
AS
7300
7301 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
d2e4a39e 7302 || ada_type_name (type) == NULL)
14f9c5c9 7303 return NULL;
d2e4a39e 7304 else
14f9c5c9
AS
7305 {
7306 int len = strlen (ada_type_name (type));
5b4ee69b 7307
4c4b4cd2
PH
7308 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
7309 return type;
14f9c5c9 7310 else
4c4b4cd2 7311 return ada_find_parallel_type (type, "___XVE");
14f9c5c9
AS
7312 }
7313}
7314
7315/* Assuming that TEMPL_TYPE is a union or struct type, returns
4c4b4cd2 7316 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
14f9c5c9 7317
d2e4a39e
AS
7318static int
7319is_dynamic_field (struct type *templ_type, int field_num)
14f9c5c9
AS
7320{
7321 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
5b4ee69b 7322
d2e4a39e 7323 return name != NULL
14f9c5c9
AS
7324 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
7325 && strstr (name, "___XVL") != NULL;
7326}
7327
4c4b4cd2
PH
7328/* The index of the variant field of TYPE, or -1 if TYPE does not
7329 represent a variant record type. */
14f9c5c9 7330
d2e4a39e 7331static int
4c4b4cd2 7332variant_field_index (struct type *type)
14f9c5c9
AS
7333{
7334 int f;
7335
4c4b4cd2
PH
7336 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
7337 return -1;
7338
7339 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
7340 {
7341 if (ada_is_variant_part (type, f))
7342 return f;
7343 }
7344 return -1;
14f9c5c9
AS
7345}
7346
4c4b4cd2
PH
7347/* A record type with no fields. */
7348
d2e4a39e 7349static struct type *
e9bb382b 7350empty_record (struct type *template)
14f9c5c9 7351{
e9bb382b 7352 struct type *type = alloc_type_copy (template);
5b4ee69b 7353
14f9c5c9
AS
7354 TYPE_CODE (type) = TYPE_CODE_STRUCT;
7355 TYPE_NFIELDS (type) = 0;
7356 TYPE_FIELDS (type) = NULL;
b1f33ddd 7357 INIT_CPLUS_SPECIFIC (type);
14f9c5c9
AS
7358 TYPE_NAME (type) = "<empty>";
7359 TYPE_TAG_NAME (type) = NULL;
14f9c5c9
AS
7360 TYPE_LENGTH (type) = 0;
7361 return type;
7362}
7363
7364/* An ordinary record type (with fixed-length fields) that describes
4c4b4cd2
PH
7365 the value of type TYPE at VALADDR or ADDRESS (see comments at
7366 the beginning of this section) VAL according to GNAT conventions.
7367 DVAL0 should describe the (portion of a) record that contains any
df407dfe 7368 necessary discriminants. It should be NULL if value_type (VAL) is
14f9c5c9
AS
7369 an outer-level type (i.e., as opposed to a branch of a variant.) A
7370 variant field (unless unchecked) is replaced by a particular branch
4c4b4cd2 7371 of the variant.
14f9c5c9 7372
4c4b4cd2
PH
7373 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7374 length are not statically known are discarded. As a consequence,
7375 VALADDR, ADDRESS and DVAL0 are ignored.
7376
7377 NOTE: Limitations: For now, we assume that dynamic fields and
7378 variants occupy whole numbers of bytes. However, they need not be
7379 byte-aligned. */
7380
7381struct type *
10a2c479 7382ada_template_to_fixed_record_type_1 (struct type *type,
fc1a4b47 7383 const gdb_byte *valaddr,
4c4b4cd2
PH
7384 CORE_ADDR address, struct value *dval0,
7385 int keep_dynamic_fields)
14f9c5c9 7386{
d2e4a39e
AS
7387 struct value *mark = value_mark ();
7388 struct value *dval;
7389 struct type *rtype;
14f9c5c9 7390 int nfields, bit_len;
4c4b4cd2 7391 int variant_field;
14f9c5c9 7392 long off;
d94e4f4f 7393 int fld_bit_len;
14f9c5c9
AS
7394 int f;
7395
4c4b4cd2
PH
7396 /* Compute the number of fields in this record type that are going
7397 to be processed: unless keep_dynamic_fields, this includes only
7398 fields whose position and length are static will be processed. */
7399 if (keep_dynamic_fields)
7400 nfields = TYPE_NFIELDS (type);
7401 else
7402 {
7403 nfields = 0;
76a01679 7404 while (nfields < TYPE_NFIELDS (type)
4c4b4cd2
PH
7405 && !ada_is_variant_part (type, nfields)
7406 && !is_dynamic_field (type, nfields))
7407 nfields++;
7408 }
7409
e9bb382b 7410 rtype = alloc_type_copy (type);
14f9c5c9
AS
7411 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
7412 INIT_CPLUS_SPECIFIC (rtype);
7413 TYPE_NFIELDS (rtype) = nfields;
d2e4a39e 7414 TYPE_FIELDS (rtype) = (struct field *)
14f9c5c9
AS
7415 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7416 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
7417 TYPE_NAME (rtype) = ada_type_name (type);
7418 TYPE_TAG_NAME (rtype) = NULL;
876cecd0 7419 TYPE_FIXED_INSTANCE (rtype) = 1;
14f9c5c9 7420
d2e4a39e
AS
7421 off = 0;
7422 bit_len = 0;
4c4b4cd2
PH
7423 variant_field = -1;
7424
14f9c5c9
AS
7425 for (f = 0; f < nfields; f += 1)
7426 {
6c038f32
PH
7427 off = align_value (off, field_alignment (type, f))
7428 + TYPE_FIELD_BITPOS (type, f);
945b3a32 7429 SET_FIELD_BITPOS (TYPE_FIELD (rtype, f), off);
d2e4a39e 7430 TYPE_FIELD_BITSIZE (rtype, f) = 0;
14f9c5c9 7431
d2e4a39e 7432 if (ada_is_variant_part (type, f))
4c4b4cd2
PH
7433 {
7434 variant_field = f;
d94e4f4f 7435 fld_bit_len = 0;
4c4b4cd2 7436 }
14f9c5c9 7437 else if (is_dynamic_field (type, f))
4c4b4cd2 7438 {
284614f0
JB
7439 const gdb_byte *field_valaddr = valaddr;
7440 CORE_ADDR field_address = address;
7441 struct type *field_type =
7442 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f));
7443
4c4b4cd2 7444 if (dval0 == NULL)
b5304971
JG
7445 {
7446 /* rtype's length is computed based on the run-time
7447 value of discriminants. If the discriminants are not
7448 initialized, the type size may be completely bogus and
0963b4bd 7449 GDB may fail to allocate a value for it. So check the
b5304971
JG
7450 size first before creating the value. */
7451 check_size (rtype);
7452 dval = value_from_contents_and_address (rtype, valaddr, address);
7453 }
4c4b4cd2
PH
7454 else
7455 dval = dval0;
7456
284614f0
JB
7457 /* If the type referenced by this field is an aligner type, we need
7458 to unwrap that aligner type, because its size might not be set.
7459 Keeping the aligner type would cause us to compute the wrong
7460 size for this field, impacting the offset of the all the fields
7461 that follow this one. */
7462 if (ada_is_aligner_type (field_type))
7463 {
7464 long field_offset = TYPE_FIELD_BITPOS (field_type, f);
7465
7466 field_valaddr = cond_offset_host (field_valaddr, field_offset);
7467 field_address = cond_offset_target (field_address, field_offset);
7468 field_type = ada_aligned_type (field_type);
7469 }
7470
7471 field_valaddr = cond_offset_host (field_valaddr,
7472 off / TARGET_CHAR_BIT);
7473 field_address = cond_offset_target (field_address,
7474 off / TARGET_CHAR_BIT);
7475
7476 /* Get the fixed type of the field. Note that, in this case,
7477 we do not want to get the real type out of the tag: if
7478 the current field is the parent part of a tagged record,
7479 we will get the tag of the object. Clearly wrong: the real
7480 type of the parent is not the real type of the child. We
7481 would end up in an infinite loop. */
7482 field_type = ada_get_base_type (field_type);
7483 field_type = ada_to_fixed_type (field_type, field_valaddr,
7484 field_address, dval, 0);
27f2a97b
JB
7485 /* If the field size is already larger than the maximum
7486 object size, then the record itself will necessarily
7487 be larger than the maximum object size. We need to make
7488 this check now, because the size might be so ridiculously
7489 large (due to an uninitialized variable in the inferior)
7490 that it would cause an overflow when adding it to the
7491 record size. */
7492 check_size (field_type);
284614f0
JB
7493
7494 TYPE_FIELD_TYPE (rtype, f) = field_type;
4c4b4cd2 7495 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
27f2a97b
JB
7496 /* The multiplication can potentially overflow. But because
7497 the field length has been size-checked just above, and
7498 assuming that the maximum size is a reasonable value,
7499 an overflow should not happen in practice. So rather than
7500 adding overflow recovery code to this already complex code,
7501 we just assume that it's not going to happen. */
d94e4f4f 7502 fld_bit_len =
4c4b4cd2
PH
7503 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
7504 }
14f9c5c9 7505 else
4c4b4cd2 7506 {
5ded5331
JB
7507 /* Note: If this field's type is a typedef, it is important
7508 to preserve the typedef layer.
7509
7510 Otherwise, we might be transforming a typedef to a fat
7511 pointer (encoding a pointer to an unconstrained array),
7512 into a basic fat pointer (encoding an unconstrained
7513 array). As both types are implemented using the same
7514 structure, the typedef is the only clue which allows us
7515 to distinguish between the two options. Stripping it
7516 would prevent us from printing this field appropriately. */
7517 TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
4c4b4cd2
PH
7518 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
7519 if (TYPE_FIELD_BITSIZE (type, f) > 0)
d94e4f4f 7520 fld_bit_len =
4c4b4cd2
PH
7521 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
7522 else
5ded5331
JB
7523 {
7524 struct type *field_type = TYPE_FIELD_TYPE (type, f);
7525
7526 /* We need to be careful of typedefs when computing
7527 the length of our field. If this is a typedef,
7528 get the length of the target type, not the length
7529 of the typedef. */
7530 if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF)
7531 field_type = ada_typedef_target_type (field_type);
7532
7533 fld_bit_len =
7534 TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT;
7535 }
4c4b4cd2 7536 }
14f9c5c9 7537 if (off + fld_bit_len > bit_len)
4c4b4cd2 7538 bit_len = off + fld_bit_len;
d94e4f4f 7539 off += fld_bit_len;
4c4b4cd2
PH
7540 TYPE_LENGTH (rtype) =
7541 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
14f9c5c9 7542 }
4c4b4cd2
PH
7543
7544 /* We handle the variant part, if any, at the end because of certain
b1f33ddd 7545 odd cases in which it is re-ordered so as NOT to be the last field of
4c4b4cd2
PH
7546 the record. This can happen in the presence of representation
7547 clauses. */
7548 if (variant_field >= 0)
7549 {
7550 struct type *branch_type;
7551
7552 off = TYPE_FIELD_BITPOS (rtype, variant_field);
7553
7554 if (dval0 == NULL)
7555 dval = value_from_contents_and_address (rtype, valaddr, address);
7556 else
7557 dval = dval0;
7558
7559 branch_type =
7560 to_fixed_variant_branch_type
7561 (TYPE_FIELD_TYPE (type, variant_field),
7562 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
7563 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
7564 if (branch_type == NULL)
7565 {
7566 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
7567 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
7568 TYPE_NFIELDS (rtype) -= 1;
7569 }
7570 else
7571 {
7572 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7573 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7574 fld_bit_len =
7575 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
7576 TARGET_CHAR_BIT;
7577 if (off + fld_bit_len > bit_len)
7578 bit_len = off + fld_bit_len;
7579 TYPE_LENGTH (rtype) =
7580 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
7581 }
7582 }
7583
714e53ab
PH
7584 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7585 should contain the alignment of that record, which should be a strictly
7586 positive value. If null or negative, then something is wrong, most
7587 probably in the debug info. In that case, we don't round up the size
0963b4bd 7588 of the resulting type. If this record is not part of another structure,
714e53ab
PH
7589 the current RTYPE length might be good enough for our purposes. */
7590 if (TYPE_LENGTH (type) <= 0)
7591 {
323e0a4a
AC
7592 if (TYPE_NAME (rtype))
7593 warning (_("Invalid type size for `%s' detected: %d."),
7594 TYPE_NAME (rtype), TYPE_LENGTH (type));
7595 else
7596 warning (_("Invalid type size for <unnamed> detected: %d."),
7597 TYPE_LENGTH (type));
714e53ab
PH
7598 }
7599 else
7600 {
7601 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
7602 TYPE_LENGTH (type));
7603 }
14f9c5c9
AS
7604
7605 value_free_to_mark (mark);
d2e4a39e 7606 if (TYPE_LENGTH (rtype) > varsize_limit)
323e0a4a 7607 error (_("record type with dynamic size is larger than varsize-limit"));
14f9c5c9
AS
7608 return rtype;
7609}
7610
4c4b4cd2
PH
7611/* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7612 of 1. */
14f9c5c9 7613
d2e4a39e 7614static struct type *
fc1a4b47 7615template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
4c4b4cd2
PH
7616 CORE_ADDR address, struct value *dval0)
7617{
7618 return ada_template_to_fixed_record_type_1 (type, valaddr,
7619 address, dval0, 1);
7620}
7621
7622/* An ordinary record type in which ___XVL-convention fields and
7623 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7624 static approximations, containing all possible fields. Uses
7625 no runtime values. Useless for use in values, but that's OK,
7626 since the results are used only for type determinations. Works on both
7627 structs and unions. Representation note: to save space, we memorize
7628 the result of this function in the TYPE_TARGET_TYPE of the
7629 template type. */
7630
7631static struct type *
7632template_to_static_fixed_type (struct type *type0)
14f9c5c9
AS
7633{
7634 struct type *type;
7635 int nfields;
7636 int f;
7637
4c4b4cd2
PH
7638 if (TYPE_TARGET_TYPE (type0) != NULL)
7639 return TYPE_TARGET_TYPE (type0);
7640
7641 nfields = TYPE_NFIELDS (type0);
7642 type = type0;
14f9c5c9
AS
7643
7644 for (f = 0; f < nfields; f += 1)
7645 {
61ee279c 7646 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
4c4b4cd2 7647 struct type *new_type;
14f9c5c9 7648
4c4b4cd2
PH
7649 if (is_dynamic_field (type0, f))
7650 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
14f9c5c9 7651 else
f192137b 7652 new_type = static_unwrap_type (field_type);
4c4b4cd2
PH
7653 if (type == type0 && new_type != field_type)
7654 {
e9bb382b 7655 TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0);
4c4b4cd2
PH
7656 TYPE_CODE (type) = TYPE_CODE (type0);
7657 INIT_CPLUS_SPECIFIC (type);
7658 TYPE_NFIELDS (type) = nfields;
7659 TYPE_FIELDS (type) = (struct field *)
7660 TYPE_ALLOC (type, nfields * sizeof (struct field));
7661 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
7662 sizeof (struct field) * nfields);
7663 TYPE_NAME (type) = ada_type_name (type0);
7664 TYPE_TAG_NAME (type) = NULL;
876cecd0 7665 TYPE_FIXED_INSTANCE (type) = 1;
4c4b4cd2
PH
7666 TYPE_LENGTH (type) = 0;
7667 }
7668 TYPE_FIELD_TYPE (type, f) = new_type;
7669 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
14f9c5c9 7670 }
14f9c5c9
AS
7671 return type;
7672}
7673
4c4b4cd2 7674/* Given an object of type TYPE whose contents are at VALADDR and
5823c3ef
JB
7675 whose address in memory is ADDRESS, returns a revision of TYPE,
7676 which should be a non-dynamic-sized record, in which the variant
7677 part, if any, is replaced with the appropriate branch. Looks
4c4b4cd2
PH
7678 for discriminant values in DVAL0, which can be NULL if the record
7679 contains the necessary discriminant values. */
7680
d2e4a39e 7681static struct type *
fc1a4b47 7682to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
4c4b4cd2 7683 CORE_ADDR address, struct value *dval0)
14f9c5c9 7684{
d2e4a39e 7685 struct value *mark = value_mark ();
4c4b4cd2 7686 struct value *dval;
d2e4a39e 7687 struct type *rtype;
14f9c5c9
AS
7688 struct type *branch_type;
7689 int nfields = TYPE_NFIELDS (type);
4c4b4cd2 7690 int variant_field = variant_field_index (type);
14f9c5c9 7691
4c4b4cd2 7692 if (variant_field == -1)
14f9c5c9
AS
7693 return type;
7694
4c4b4cd2
PH
7695 if (dval0 == NULL)
7696 dval = value_from_contents_and_address (type, valaddr, address);
7697 else
7698 dval = dval0;
7699
e9bb382b 7700 rtype = alloc_type_copy (type);
14f9c5c9 7701 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
4c4b4cd2
PH
7702 INIT_CPLUS_SPECIFIC (rtype);
7703 TYPE_NFIELDS (rtype) = nfields;
d2e4a39e
AS
7704 TYPE_FIELDS (rtype) =
7705 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
7706 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
4c4b4cd2 7707 sizeof (struct field) * nfields);
14f9c5c9
AS
7708 TYPE_NAME (rtype) = ada_type_name (type);
7709 TYPE_TAG_NAME (rtype) = NULL;
876cecd0 7710 TYPE_FIXED_INSTANCE (rtype) = 1;
14f9c5c9
AS
7711 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
7712
4c4b4cd2
PH
7713 branch_type = to_fixed_variant_branch_type
7714 (TYPE_FIELD_TYPE (type, variant_field),
d2e4a39e 7715 cond_offset_host (valaddr,
4c4b4cd2
PH
7716 TYPE_FIELD_BITPOS (type, variant_field)
7717 / TARGET_CHAR_BIT),
d2e4a39e 7718 cond_offset_target (address,
4c4b4cd2
PH
7719 TYPE_FIELD_BITPOS (type, variant_field)
7720 / TARGET_CHAR_BIT), dval);
d2e4a39e 7721 if (branch_type == NULL)
14f9c5c9 7722 {
4c4b4cd2 7723 int f;
5b4ee69b 7724
4c4b4cd2
PH
7725 for (f = variant_field + 1; f < nfields; f += 1)
7726 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
14f9c5c9 7727 TYPE_NFIELDS (rtype) -= 1;
14f9c5c9
AS
7728 }
7729 else
7730 {
4c4b4cd2
PH
7731 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
7732 TYPE_FIELD_NAME (rtype, variant_field) = "S";
7733 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
14f9c5c9 7734 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
14f9c5c9 7735 }
4c4b4cd2 7736 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
d2e4a39e 7737
4c4b4cd2 7738 value_free_to_mark (mark);
14f9c5c9
AS
7739 return rtype;
7740}
7741
7742/* An ordinary record type (with fixed-length fields) that describes
7743 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7744 beginning of this section]. Any necessary discriminants' values
4c4b4cd2
PH
7745 should be in DVAL, a record value; it may be NULL if the object
7746 at ADDR itself contains any necessary discriminant values.
7747 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7748 values from the record are needed. Except in the case that DVAL,
7749 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7750 unchecked) is replaced by a particular branch of the variant.
7751
7752 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7753 is questionable and may be removed. It can arise during the
7754 processing of an unconstrained-array-of-record type where all the
7755 variant branches have exactly the same size. This is because in
7756 such cases, the compiler does not bother to use the XVS convention
7757 when encoding the record. I am currently dubious of this
7758 shortcut and suspect the compiler should be altered. FIXME. */
14f9c5c9 7759
d2e4a39e 7760static struct type *
fc1a4b47 7761to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
4c4b4cd2 7762 CORE_ADDR address, struct value *dval)
14f9c5c9 7763{
d2e4a39e 7764 struct type *templ_type;
14f9c5c9 7765
876cecd0 7766 if (TYPE_FIXED_INSTANCE (type0))
4c4b4cd2
PH
7767 return type0;
7768
d2e4a39e 7769 templ_type = dynamic_template_type (type0);
14f9c5c9
AS
7770
7771 if (templ_type != NULL)
7772 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
4c4b4cd2
PH
7773 else if (variant_field_index (type0) >= 0)
7774 {
7775 if (dval == NULL && valaddr == NULL && address == 0)
7776 return type0;
7777 return to_record_with_fixed_variant_part (type0, valaddr, address,
7778 dval);
7779 }
14f9c5c9
AS
7780 else
7781 {
876cecd0 7782 TYPE_FIXED_INSTANCE (type0) = 1;
14f9c5c9
AS
7783 return type0;
7784 }
7785
7786}
7787
7788/* An ordinary record type (with fixed-length fields) that describes
7789 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7790 union type. Any necessary discriminants' values should be in DVAL,
7791 a record value. That is, this routine selects the appropriate
7792 branch of the union at ADDR according to the discriminant value
b1f33ddd 7793 indicated in the union's type name. Returns VAR_TYPE0 itself if
0963b4bd 7794 it represents a variant subject to a pragma Unchecked_Union. */
14f9c5c9 7795
d2e4a39e 7796static struct type *
fc1a4b47 7797to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
4c4b4cd2 7798 CORE_ADDR address, struct value *dval)
14f9c5c9
AS
7799{
7800 int which;
d2e4a39e
AS
7801 struct type *templ_type;
7802 struct type *var_type;
14f9c5c9
AS
7803
7804 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
7805 var_type = TYPE_TARGET_TYPE (var_type0);
d2e4a39e 7806 else
14f9c5c9
AS
7807 var_type = var_type0;
7808
7809 templ_type = ada_find_parallel_type (var_type, "___XVU");
7810
7811 if (templ_type != NULL)
7812 var_type = templ_type;
7813
b1f33ddd
JB
7814 if (is_unchecked_variant (var_type, value_type (dval)))
7815 return var_type0;
d2e4a39e
AS
7816 which =
7817 ada_which_variant_applies (var_type,
0fd88904 7818 value_type (dval), value_contents (dval));
14f9c5c9
AS
7819
7820 if (which < 0)
e9bb382b 7821 return empty_record (var_type);
14f9c5c9 7822 else if (is_dynamic_field (var_type, which))
4c4b4cd2 7823 return to_fixed_record_type
d2e4a39e
AS
7824 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
7825 valaddr, address, dval);
4c4b4cd2 7826 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
d2e4a39e
AS
7827 return
7828 to_fixed_record_type
7829 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
14f9c5c9
AS
7830 else
7831 return TYPE_FIELD_TYPE (var_type, which);
7832}
7833
7834/* Assuming that TYPE0 is an array type describing the type of a value
7835 at ADDR, and that DVAL describes a record containing any
7836 discriminants used in TYPE0, returns a type for the value that
7837 contains no dynamic components (that is, no components whose sizes
7838 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7839 true, gives an error message if the resulting type's size is over
4c4b4cd2 7840 varsize_limit. */
14f9c5c9 7841
d2e4a39e
AS
7842static struct type *
7843to_fixed_array_type (struct type *type0, struct value *dval,
4c4b4cd2 7844 int ignore_too_big)
14f9c5c9 7845{
d2e4a39e
AS
7846 struct type *index_type_desc;
7847 struct type *result;
ad82864c 7848 int constrained_packed_array_p;
14f9c5c9 7849
b0dd7688 7850 type0 = ada_check_typedef (type0);
284614f0 7851 if (TYPE_FIXED_INSTANCE (type0))
4c4b4cd2 7852 return type0;
14f9c5c9 7853
ad82864c
JB
7854 constrained_packed_array_p = ada_is_constrained_packed_array_type (type0);
7855 if (constrained_packed_array_p)
7856 type0 = decode_constrained_packed_array_type (type0);
284614f0 7857
14f9c5c9 7858 index_type_desc = ada_find_parallel_type (type0, "___XA");
28c85d6c 7859 ada_fixup_array_indexes_type (index_type_desc);
14f9c5c9
AS
7860 if (index_type_desc == NULL)
7861 {
61ee279c 7862 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
5b4ee69b 7863
14f9c5c9 7864 /* NOTE: elt_type---the fixed version of elt_type0---should never
4c4b4cd2
PH
7865 depend on the contents of the array in properly constructed
7866 debugging data. */
529cad9c
PH
7867 /* Create a fixed version of the array element type.
7868 We're not providing the address of an element here,
e1d5a0d2 7869 and thus the actual object value cannot be inspected to do
529cad9c
PH
7870 the conversion. This should not be a problem, since arrays of
7871 unconstrained objects are not allowed. In particular, all
7872 the elements of an array of a tagged type should all be of
7873 the same type specified in the debugging info. No need to
7874 consult the object tag. */
1ed6ede0 7875 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
14f9c5c9 7876
284614f0
JB
7877 /* Make sure we always create a new array type when dealing with
7878 packed array types, since we're going to fix-up the array
7879 type length and element bitsize a little further down. */
ad82864c 7880 if (elt_type0 == elt_type && !constrained_packed_array_p)
4c4b4cd2 7881 result = type0;
14f9c5c9 7882 else
e9bb382b 7883 result = create_array_type (alloc_type_copy (type0),
4c4b4cd2 7884 elt_type, TYPE_INDEX_TYPE (type0));
14f9c5c9
AS
7885 }
7886 else
7887 {
7888 int i;
7889 struct type *elt_type0;
7890
7891 elt_type0 = type0;
7892 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
4c4b4cd2 7893 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
14f9c5c9
AS
7894
7895 /* NOTE: result---the fixed version of elt_type0---should never
4c4b4cd2
PH
7896 depend on the contents of the array in properly constructed
7897 debugging data. */
529cad9c
PH
7898 /* Create a fixed version of the array element type.
7899 We're not providing the address of an element here,
e1d5a0d2 7900 and thus the actual object value cannot be inspected to do
529cad9c
PH
7901 the conversion. This should not be a problem, since arrays of
7902 unconstrained objects are not allowed. In particular, all
7903 the elements of an array of a tagged type should all be of
7904 the same type specified in the debugging info. No need to
7905 consult the object tag. */
1ed6ede0
JB
7906 result =
7907 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
1ce677a4
UW
7908
7909 elt_type0 = type0;
14f9c5c9 7910 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
4c4b4cd2
PH
7911 {
7912 struct type *range_type =
28c85d6c 7913 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval);
5b4ee69b 7914
e9bb382b 7915 result = create_array_type (alloc_type_copy (elt_type0),
4c4b4cd2 7916 result, range_type);
1ce677a4 7917 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
4c4b4cd2 7918 }
d2e4a39e 7919 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
323e0a4a 7920 error (_("array type with dynamic size is larger than varsize-limit"));
14f9c5c9
AS
7921 }
7922
2e6fda7d
JB
7923 /* We want to preserve the type name. This can be useful when
7924 trying to get the type name of a value that has already been
7925 printed (for instance, if the user did "print VAR; whatis $". */
7926 TYPE_NAME (result) = TYPE_NAME (type0);
7927
ad82864c 7928 if (constrained_packed_array_p)
284614f0
JB
7929 {
7930 /* So far, the resulting type has been created as if the original
7931 type was a regular (non-packed) array type. As a result, the
7932 bitsize of the array elements needs to be set again, and the array
7933 length needs to be recomputed based on that bitsize. */
7934 int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result));
7935 int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0);
7936
7937 TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0);
7938 TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT;
7939 if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize)
7940 TYPE_LENGTH (result)++;
7941 }
7942
876cecd0 7943 TYPE_FIXED_INSTANCE (result) = 1;
14f9c5c9 7944 return result;
d2e4a39e 7945}
14f9c5c9
AS
7946
7947
7948/* A standard type (containing no dynamically sized components)
7949 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7950 DVAL describes a record containing any discriminants used in TYPE0,
4c4b4cd2 7951 and may be NULL if there are none, or if the object of type TYPE at
529cad9c
PH
7952 ADDRESS or in VALADDR contains these discriminants.
7953
1ed6ede0
JB
7954 If CHECK_TAG is not null, in the case of tagged types, this function
7955 attempts to locate the object's tag and use it to compute the actual
7956 type. However, when ADDRESS is null, we cannot use it to determine the
7957 location of the tag, and therefore compute the tagged type's actual type.
7958 So we return the tagged type without consulting the tag. */
529cad9c 7959
f192137b
JB
7960static struct type *
7961ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
1ed6ede0 7962 CORE_ADDR address, struct value *dval, int check_tag)
14f9c5c9 7963{
61ee279c 7964 type = ada_check_typedef (type);
d2e4a39e
AS
7965 switch (TYPE_CODE (type))
7966 {
7967 default:
14f9c5c9 7968 return type;
d2e4a39e 7969 case TYPE_CODE_STRUCT:
4c4b4cd2 7970 {
76a01679 7971 struct type *static_type = to_static_fixed_type (type);
1ed6ede0
JB
7972 struct type *fixed_record_type =
7973 to_fixed_record_type (type, valaddr, address, NULL);
5b4ee69b 7974
529cad9c
PH
7975 /* If STATIC_TYPE is a tagged type and we know the object's address,
7976 then we can determine its tag, and compute the object's actual
0963b4bd 7977 type from there. Note that we have to use the fixed record
1ed6ede0
JB
7978 type (the parent part of the record may have dynamic fields
7979 and the way the location of _tag is expressed may depend on
7980 them). */
529cad9c 7981
1ed6ede0 7982 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
76a01679
JB
7983 {
7984 struct type *real_type =
1ed6ede0
JB
7985 type_from_tag (value_tag_from_contents_and_address
7986 (fixed_record_type,
7987 valaddr,
7988 address));
5b4ee69b 7989
76a01679 7990 if (real_type != NULL)
1ed6ede0 7991 return to_fixed_record_type (real_type, valaddr, address, NULL);
76a01679 7992 }
4af88198
JB
7993
7994 /* Check to see if there is a parallel ___XVZ variable.
7995 If there is, then it provides the actual size of our type. */
7996 else if (ada_type_name (fixed_record_type) != NULL)
7997 {
0d5cff50 7998 const char *name = ada_type_name (fixed_record_type);
4af88198
JB
7999 char *xvz_name = alloca (strlen (name) + 7 /* "___XVZ\0" */);
8000 int xvz_found = 0;
8001 LONGEST size;
8002
88c15c34 8003 xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name);
4af88198
JB
8004 size = get_int_var_value (xvz_name, &xvz_found);
8005 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
8006 {
8007 fixed_record_type = copy_type (fixed_record_type);
8008 TYPE_LENGTH (fixed_record_type) = size;
8009
8010 /* The FIXED_RECORD_TYPE may have be a stub. We have
8011 observed this when the debugging info is STABS, and
8012 apparently it is something that is hard to fix.
8013
8014 In practice, we don't need the actual type definition
8015 at all, because the presence of the XVZ variable allows us
8016 to assume that there must be a XVS type as well, which we
8017 should be able to use later, when we need the actual type
8018 definition.
8019
8020 In the meantime, pretend that the "fixed" type we are
8021 returning is NOT a stub, because this can cause trouble
8022 when using this type to create new types targeting it.
8023 Indeed, the associated creation routines often check
8024 whether the target type is a stub and will try to replace
0963b4bd 8025 it, thus using a type with the wrong size. This, in turn,
4af88198
JB
8026 might cause the new type to have the wrong size too.
8027 Consider the case of an array, for instance, where the size
8028 of the array is computed from the number of elements in
8029 our array multiplied by the size of its element. */
8030 TYPE_STUB (fixed_record_type) = 0;
8031 }
8032 }
1ed6ede0 8033 return fixed_record_type;
4c4b4cd2 8034 }
d2e4a39e 8035 case TYPE_CODE_ARRAY:
4c4b4cd2 8036 return to_fixed_array_type (type, dval, 1);
d2e4a39e
AS
8037 case TYPE_CODE_UNION:
8038 if (dval == NULL)
4c4b4cd2 8039 return type;
d2e4a39e 8040 else
4c4b4cd2 8041 return to_fixed_variant_branch_type (type, valaddr, address, dval);
d2e4a39e 8042 }
14f9c5c9
AS
8043}
8044
f192137b
JB
8045/* The same as ada_to_fixed_type_1, except that it preserves the type
8046 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
96dbd2c1
JB
8047
8048 The typedef layer needs be preserved in order to differentiate between
8049 arrays and array pointers when both types are implemented using the same
8050 fat pointer. In the array pointer case, the pointer is encoded as
8051 a typedef of the pointer type. For instance, considering:
8052
8053 type String_Access is access String;
8054 S1 : String_Access := null;
8055
8056 To the debugger, S1 is defined as a typedef of type String. But
8057 to the user, it is a pointer. So if the user tries to print S1,
8058 we should not dereference the array, but print the array address
8059 instead.
8060
8061 If we didn't preserve the typedef layer, we would lose the fact that
8062 the type is to be presented as a pointer (needs de-reference before
8063 being printed). And we would also use the source-level type name. */
f192137b
JB
8064
8065struct type *
8066ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
8067 CORE_ADDR address, struct value *dval, int check_tag)
8068
8069{
8070 struct type *fixed_type =
8071 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
8072
96dbd2c1
JB
8073 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8074 then preserve the typedef layer.
8075
8076 Implementation note: We can only check the main-type portion of
8077 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8078 from TYPE now returns a type that has the same instance flags
8079 as TYPE. For instance, if TYPE is a "typedef const", and its
8080 target type is a "struct", then the typedef elimination will return
8081 a "const" version of the target type. See check_typedef for more
8082 details about how the typedef layer elimination is done.
8083
8084 brobecker/2010-11-19: It seems to me that the only case where it is
8085 useful to preserve the typedef layer is when dealing with fat pointers.
8086 Perhaps, we could add a check for that and preserve the typedef layer
8087 only in that situation. But this seems unecessary so far, probably
8088 because we call check_typedef/ada_check_typedef pretty much everywhere.
8089 */
f192137b 8090 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
720d1a40 8091 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type))
96dbd2c1 8092 == TYPE_MAIN_TYPE (fixed_type)))
f192137b
JB
8093 return type;
8094
8095 return fixed_type;
8096}
8097
14f9c5c9 8098/* A standard (static-sized) type corresponding as well as possible to
4c4b4cd2 8099 TYPE0, but based on no runtime data. */
14f9c5c9 8100
d2e4a39e
AS
8101static struct type *
8102to_static_fixed_type (struct type *type0)
14f9c5c9 8103{
d2e4a39e 8104 struct type *type;
14f9c5c9
AS
8105
8106 if (type0 == NULL)
8107 return NULL;
8108
876cecd0 8109 if (TYPE_FIXED_INSTANCE (type0))
4c4b4cd2
PH
8110 return type0;
8111
61ee279c 8112 type0 = ada_check_typedef (type0);
d2e4a39e 8113
14f9c5c9
AS
8114 switch (TYPE_CODE (type0))
8115 {
8116 default:
8117 return type0;
8118 case TYPE_CODE_STRUCT:
8119 type = dynamic_template_type (type0);
d2e4a39e 8120 if (type != NULL)
4c4b4cd2
PH
8121 return template_to_static_fixed_type (type);
8122 else
8123 return template_to_static_fixed_type (type0);
14f9c5c9
AS
8124 case TYPE_CODE_UNION:
8125 type = ada_find_parallel_type (type0, "___XVU");
8126 if (type != NULL)
4c4b4cd2
PH
8127 return template_to_static_fixed_type (type);
8128 else
8129 return template_to_static_fixed_type (type0);
14f9c5c9
AS
8130 }
8131}
8132
4c4b4cd2
PH
8133/* A static approximation of TYPE with all type wrappers removed. */
8134
d2e4a39e
AS
8135static struct type *
8136static_unwrap_type (struct type *type)
14f9c5c9
AS
8137{
8138 if (ada_is_aligner_type (type))
8139 {
61ee279c 8140 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
14f9c5c9 8141 if (ada_type_name (type1) == NULL)
4c4b4cd2 8142 TYPE_NAME (type1) = ada_type_name (type);
14f9c5c9
AS
8143
8144 return static_unwrap_type (type1);
8145 }
d2e4a39e 8146 else
14f9c5c9 8147 {
d2e4a39e 8148 struct type *raw_real_type = ada_get_base_type (type);
5b4ee69b 8149
d2e4a39e 8150 if (raw_real_type == type)
4c4b4cd2 8151 return type;
14f9c5c9 8152 else
4c4b4cd2 8153 return to_static_fixed_type (raw_real_type);
14f9c5c9
AS
8154 }
8155}
8156
8157/* In some cases, incomplete and private types require
4c4b4cd2 8158 cross-references that are not resolved as records (for example,
14f9c5c9
AS
8159 type Foo;
8160 type FooP is access Foo;
8161 V: FooP;
8162 type Foo is array ...;
4c4b4cd2 8163 ). In these cases, since there is no mechanism for producing
14f9c5c9
AS
8164 cross-references to such types, we instead substitute for FooP a
8165 stub enumeration type that is nowhere resolved, and whose tag is
4c4b4cd2 8166 the name of the actual type. Call these types "non-record stubs". */
14f9c5c9
AS
8167
8168/* A type equivalent to TYPE that is not a non-record stub, if one
4c4b4cd2
PH
8169 exists, otherwise TYPE. */
8170
d2e4a39e 8171struct type *
61ee279c 8172ada_check_typedef (struct type *type)
14f9c5c9 8173{
727e3d2e
JB
8174 if (type == NULL)
8175 return NULL;
8176
720d1a40
JB
8177 /* If our type is a typedef type of a fat pointer, then we're done.
8178 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8179 what allows us to distinguish between fat pointers that represent
8180 array types, and fat pointers that represent array access types
8181 (in both cases, the compiler implements them as fat pointers). */
8182 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
8183 && is_thick_pntr (ada_typedef_target_type (type)))
8184 return type;
8185
14f9c5c9
AS
8186 CHECK_TYPEDEF (type);
8187 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
529cad9c 8188 || !TYPE_STUB (type)
14f9c5c9
AS
8189 || TYPE_TAG_NAME (type) == NULL)
8190 return type;
d2e4a39e 8191 else
14f9c5c9 8192 {
0d5cff50 8193 const char *name = TYPE_TAG_NAME (type);
d2e4a39e 8194 struct type *type1 = ada_find_any_type (name);
5b4ee69b 8195
05e522ef
JB
8196 if (type1 == NULL)
8197 return type;
8198
8199 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8200 stubs pointing to arrays, as we don't create symbols for array
3a867c22
JB
8201 types, only for the typedef-to-array types). If that's the case,
8202 strip the typedef layer. */
8203 if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF)
8204 type1 = ada_check_typedef (type1);
8205
8206 return type1;
14f9c5c9
AS
8207 }
8208}
8209
8210/* A value representing the data at VALADDR/ADDRESS as described by
8211 type TYPE0, but with a standard (static-sized) type that correctly
8212 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8213 type, then return VAL0 [this feature is simply to avoid redundant
4c4b4cd2 8214 creation of struct values]. */
14f9c5c9 8215
4c4b4cd2
PH
8216static struct value *
8217ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
8218 struct value *val0)
14f9c5c9 8219{
1ed6ede0 8220 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
5b4ee69b 8221
14f9c5c9
AS
8222 if (type == type0 && val0 != NULL)
8223 return val0;
d2e4a39e 8224 else
4c4b4cd2
PH
8225 return value_from_contents_and_address (type, 0, address);
8226}
8227
8228/* A value representing VAL, but with a standard (static-sized) type
8229 that correctly describes it. Does not necessarily create a new
8230 value. */
8231
0c3acc09 8232struct value *
4c4b4cd2
PH
8233ada_to_fixed_value (struct value *val)
8234{
c48db5ca
JB
8235 val = unwrap_value (val);
8236 val = ada_to_fixed_value_create (value_type (val),
8237 value_address (val),
8238 val);
8239 return val;
14f9c5c9 8240}
d2e4a39e 8241\f
14f9c5c9 8242
14f9c5c9
AS
8243/* Attributes */
8244
4c4b4cd2
PH
8245/* Table mapping attribute numbers to names.
8246 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
14f9c5c9 8247
d2e4a39e 8248static const char *attribute_names[] = {
14f9c5c9
AS
8249 "<?>",
8250
d2e4a39e 8251 "first",
14f9c5c9
AS
8252 "last",
8253 "length",
8254 "image",
14f9c5c9
AS
8255 "max",
8256 "min",
4c4b4cd2
PH
8257 "modulus",
8258 "pos",
8259 "size",
8260 "tag",
14f9c5c9 8261 "val",
14f9c5c9
AS
8262 0
8263};
8264
d2e4a39e 8265const char *
4c4b4cd2 8266ada_attribute_name (enum exp_opcode n)
14f9c5c9 8267{
4c4b4cd2
PH
8268 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
8269 return attribute_names[n - OP_ATR_FIRST + 1];
14f9c5c9
AS
8270 else
8271 return attribute_names[0];
8272}
8273
4c4b4cd2 8274/* Evaluate the 'POS attribute applied to ARG. */
14f9c5c9 8275
4c4b4cd2
PH
8276static LONGEST
8277pos_atr (struct value *arg)
14f9c5c9 8278{
24209737
PH
8279 struct value *val = coerce_ref (arg);
8280 struct type *type = value_type (val);
14f9c5c9 8281
d2e4a39e 8282 if (!discrete_type_p (type))
323e0a4a 8283 error (_("'POS only defined on discrete types"));
14f9c5c9
AS
8284
8285 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
8286 {
8287 int i;
24209737 8288 LONGEST v = value_as_long (val);
14f9c5c9 8289
d2e4a39e 8290 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
4c4b4cd2 8291 {
14e75d8e 8292 if (v == TYPE_FIELD_ENUMVAL (type, i))
4c4b4cd2
PH
8293 return i;
8294 }
323e0a4a 8295 error (_("enumeration value is invalid: can't find 'POS"));
14f9c5c9
AS
8296 }
8297 else
24209737 8298 return value_as_long (val);
4c4b4cd2
PH
8299}
8300
8301static struct value *
3cb382c9 8302value_pos_atr (struct type *type, struct value *arg)
4c4b4cd2 8303{
3cb382c9 8304 return value_from_longest (type, pos_atr (arg));
14f9c5c9
AS
8305}
8306
4c4b4cd2 8307/* Evaluate the TYPE'VAL attribute applied to ARG. */
14f9c5c9 8308
d2e4a39e
AS
8309static struct value *
8310value_val_atr (struct type *type, struct value *arg)
14f9c5c9 8311{
d2e4a39e 8312 if (!discrete_type_p (type))
323e0a4a 8313 error (_("'VAL only defined on discrete types"));
df407dfe 8314 if (!integer_type_p (value_type (arg)))
323e0a4a 8315 error (_("'VAL requires integral argument"));
14f9c5c9
AS
8316
8317 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
8318 {
8319 long pos = value_as_long (arg);
5b4ee69b 8320
14f9c5c9 8321 if (pos < 0 || pos >= TYPE_NFIELDS (type))
323e0a4a 8322 error (_("argument to 'VAL out of range"));
14e75d8e 8323 return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, pos));
14f9c5c9
AS
8324 }
8325 else
8326 return value_from_longest (type, value_as_long (arg));
8327}
14f9c5c9 8328\f
d2e4a39e 8329
4c4b4cd2 8330 /* Evaluation */
14f9c5c9 8331
4c4b4cd2
PH
8332/* True if TYPE appears to be an Ada character type.
8333 [At the moment, this is true only for Character and Wide_Character;
8334 It is a heuristic test that could stand improvement]. */
14f9c5c9 8335
d2e4a39e
AS
8336int
8337ada_is_character_type (struct type *type)
14f9c5c9 8338{
7b9f71f2
JB
8339 const char *name;
8340
8341 /* If the type code says it's a character, then assume it really is,
8342 and don't check any further. */
8343 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
8344 return 1;
8345
8346 /* Otherwise, assume it's a character type iff it is a discrete type
8347 with a known character type name. */
8348 name = ada_type_name (type);
8349 return (name != NULL
8350 && (TYPE_CODE (type) == TYPE_CODE_INT
8351 || TYPE_CODE (type) == TYPE_CODE_RANGE)
8352 && (strcmp (name, "character") == 0
8353 || strcmp (name, "wide_character") == 0
5a517ebd 8354 || strcmp (name, "wide_wide_character") == 0
7b9f71f2 8355 || strcmp (name, "unsigned char") == 0));
14f9c5c9
AS
8356}
8357
4c4b4cd2 8358/* True if TYPE appears to be an Ada string type. */
14f9c5c9
AS
8359
8360int
ebf56fd3 8361ada_is_string_type (struct type *type)
14f9c5c9 8362{
61ee279c 8363 type = ada_check_typedef (type);
d2e4a39e 8364 if (type != NULL
14f9c5c9 8365 && TYPE_CODE (type) != TYPE_CODE_PTR
76a01679
JB
8366 && (ada_is_simple_array_type (type)
8367 || ada_is_array_descriptor_type (type))
14f9c5c9
AS
8368 && ada_array_arity (type) == 1)
8369 {
8370 struct type *elttype = ada_array_element_type (type, 1);
8371
8372 return ada_is_character_type (elttype);
8373 }
d2e4a39e 8374 else
14f9c5c9
AS
8375 return 0;
8376}
8377
5bf03f13
JB
8378/* The compiler sometimes provides a parallel XVS type for a given
8379 PAD type. Normally, it is safe to follow the PAD type directly,
8380 but older versions of the compiler have a bug that causes the offset
8381 of its "F" field to be wrong. Following that field in that case
8382 would lead to incorrect results, but this can be worked around
8383 by ignoring the PAD type and using the associated XVS type instead.
8384
8385 Set to True if the debugger should trust the contents of PAD types.
8386 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8387static int trust_pad_over_xvs = 1;
14f9c5c9
AS
8388
8389/* True if TYPE is a struct type introduced by the compiler to force the
8390 alignment of a value. Such types have a single field with a
4c4b4cd2 8391 distinctive name. */
14f9c5c9
AS
8392
8393int
ebf56fd3 8394ada_is_aligner_type (struct type *type)
14f9c5c9 8395{
61ee279c 8396 type = ada_check_typedef (type);
714e53ab 8397
5bf03f13 8398 if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL)
714e53ab
PH
8399 return 0;
8400
14f9c5c9 8401 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
4c4b4cd2
PH
8402 && TYPE_NFIELDS (type) == 1
8403 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
14f9c5c9
AS
8404}
8405
8406/* If there is an ___XVS-convention type parallel to SUBTYPE, return
4c4b4cd2 8407 the parallel type. */
14f9c5c9 8408
d2e4a39e
AS
8409struct type *
8410ada_get_base_type (struct type *raw_type)
14f9c5c9 8411{
d2e4a39e
AS
8412 struct type *real_type_namer;
8413 struct type *raw_real_type;
14f9c5c9
AS
8414
8415 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
8416 return raw_type;
8417
284614f0
JB
8418 if (ada_is_aligner_type (raw_type))
8419 /* The encoding specifies that we should always use the aligner type.
8420 So, even if this aligner type has an associated XVS type, we should
8421 simply ignore it.
8422
8423 According to the compiler gurus, an XVS type parallel to an aligner
8424 type may exist because of a stabs limitation. In stabs, aligner
8425 types are empty because the field has a variable-sized type, and
8426 thus cannot actually be used as an aligner type. As a result,
8427 we need the associated parallel XVS type to decode the type.
8428 Since the policy in the compiler is to not change the internal
8429 representation based on the debugging info format, we sometimes
8430 end up having a redundant XVS type parallel to the aligner type. */
8431 return raw_type;
8432
14f9c5c9 8433 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
d2e4a39e 8434 if (real_type_namer == NULL
14f9c5c9
AS
8435 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
8436 || TYPE_NFIELDS (real_type_namer) != 1)
8437 return raw_type;
8438
f80d3ff2
JB
8439 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF)
8440 {
8441 /* This is an older encoding form where the base type needs to be
8442 looked up by name. We prefer the newer enconding because it is
8443 more efficient. */
8444 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
8445 if (raw_real_type == NULL)
8446 return raw_type;
8447 else
8448 return raw_real_type;
8449 }
8450
8451 /* The field in our XVS type is a reference to the base type. */
8452 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0));
d2e4a39e 8453}
14f9c5c9 8454
4c4b4cd2 8455/* The type of value designated by TYPE, with all aligners removed. */
14f9c5c9 8456
d2e4a39e
AS
8457struct type *
8458ada_aligned_type (struct type *type)
14f9c5c9
AS
8459{
8460 if (ada_is_aligner_type (type))
8461 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
8462 else
8463 return ada_get_base_type (type);
8464}
8465
8466
8467/* The address of the aligned value in an object at address VALADDR
4c4b4cd2 8468 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
14f9c5c9 8469
fc1a4b47
AC
8470const gdb_byte *
8471ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
14f9c5c9 8472{
d2e4a39e 8473 if (ada_is_aligner_type (type))
14f9c5c9 8474 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
4c4b4cd2
PH
8475 valaddr +
8476 TYPE_FIELD_BITPOS (type,
8477 0) / TARGET_CHAR_BIT);
14f9c5c9
AS
8478 else
8479 return valaddr;
8480}
8481
4c4b4cd2
PH
8482
8483
14f9c5c9 8484/* The printed representation of an enumeration literal with encoded
4c4b4cd2 8485 name NAME. The value is good to the next call of ada_enum_name. */
d2e4a39e
AS
8486const char *
8487ada_enum_name (const char *name)
14f9c5c9 8488{
4c4b4cd2
PH
8489 static char *result;
8490 static size_t result_len = 0;
d2e4a39e 8491 char *tmp;
14f9c5c9 8492
4c4b4cd2
PH
8493 /* First, unqualify the enumeration name:
8494 1. Search for the last '.' character. If we find one, then skip
177b42fe 8495 all the preceding characters, the unqualified name starts
76a01679 8496 right after that dot.
4c4b4cd2 8497 2. Otherwise, we may be debugging on a target where the compiler
76a01679
JB
8498 translates dots into "__". Search forward for double underscores,
8499 but stop searching when we hit an overloading suffix, which is
8500 of the form "__" followed by digits. */
4c4b4cd2 8501
c3e5cd34
PH
8502 tmp = strrchr (name, '.');
8503 if (tmp != NULL)
4c4b4cd2
PH
8504 name = tmp + 1;
8505 else
14f9c5c9 8506 {
4c4b4cd2
PH
8507 while ((tmp = strstr (name, "__")) != NULL)
8508 {
8509 if (isdigit (tmp[2]))
8510 break;
8511 else
8512 name = tmp + 2;
8513 }
14f9c5c9
AS
8514 }
8515
8516 if (name[0] == 'Q')
8517 {
14f9c5c9 8518 int v;
5b4ee69b 8519
14f9c5c9 8520 if (name[1] == 'U' || name[1] == 'W')
4c4b4cd2
PH
8521 {
8522 if (sscanf (name + 2, "%x", &v) != 1)
8523 return name;
8524 }
14f9c5c9 8525 else
4c4b4cd2 8526 return name;
14f9c5c9 8527
4c4b4cd2 8528 GROW_VECT (result, result_len, 16);
14f9c5c9 8529 if (isascii (v) && isprint (v))
88c15c34 8530 xsnprintf (result, result_len, "'%c'", v);
14f9c5c9 8531 else if (name[1] == 'U')
88c15c34 8532 xsnprintf (result, result_len, "[\"%02x\"]", v);
14f9c5c9 8533 else
88c15c34 8534 xsnprintf (result, result_len, "[\"%04x\"]", v);
14f9c5c9
AS
8535
8536 return result;
8537 }
d2e4a39e 8538 else
4c4b4cd2 8539 {
c3e5cd34
PH
8540 tmp = strstr (name, "__");
8541 if (tmp == NULL)
8542 tmp = strstr (name, "$");
8543 if (tmp != NULL)
4c4b4cd2
PH
8544 {
8545 GROW_VECT (result, result_len, tmp - name + 1);
8546 strncpy (result, name, tmp - name);
8547 result[tmp - name] = '\0';
8548 return result;
8549 }
8550
8551 return name;
8552 }
14f9c5c9
AS
8553}
8554
14f9c5c9
AS
8555/* Evaluate the subexpression of EXP starting at *POS as for
8556 evaluate_type, updating *POS to point just past the evaluated
4c4b4cd2 8557 expression. */
14f9c5c9 8558
d2e4a39e
AS
8559static struct value *
8560evaluate_subexp_type (struct expression *exp, int *pos)
14f9c5c9 8561{
4b27a620 8562 return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
14f9c5c9
AS
8563}
8564
8565/* If VAL is wrapped in an aligner or subtype wrapper, return the
4c4b4cd2 8566 value it wraps. */
14f9c5c9 8567
d2e4a39e
AS
8568static struct value *
8569unwrap_value (struct value *val)
14f9c5c9 8570{
df407dfe 8571 struct type *type = ada_check_typedef (value_type (val));
5b4ee69b 8572
14f9c5c9
AS
8573 if (ada_is_aligner_type (type))
8574 {
de4d072f 8575 struct value *v = ada_value_struct_elt (val, "F", 0);
df407dfe 8576 struct type *val_type = ada_check_typedef (value_type (v));
5b4ee69b 8577
14f9c5c9 8578 if (ada_type_name (val_type) == NULL)
4c4b4cd2 8579 TYPE_NAME (val_type) = ada_type_name (type);
14f9c5c9
AS
8580
8581 return unwrap_value (v);
8582 }
d2e4a39e 8583 else
14f9c5c9 8584 {
d2e4a39e 8585 struct type *raw_real_type =
61ee279c 8586 ada_check_typedef (ada_get_base_type (type));
d2e4a39e 8587
5bf03f13
JB
8588 /* If there is no parallel XVS or XVE type, then the value is
8589 already unwrapped. Return it without further modification. */
8590 if ((type == raw_real_type)
8591 && ada_find_parallel_type (type, "___XVE") == NULL)
8592 return val;
14f9c5c9 8593
d2e4a39e 8594 return
4c4b4cd2
PH
8595 coerce_unspec_val_to_type
8596 (val, ada_to_fixed_type (raw_real_type, 0,
42ae5230 8597 value_address (val),
1ed6ede0 8598 NULL, 1));
14f9c5c9
AS
8599 }
8600}
d2e4a39e
AS
8601
8602static struct value *
8603cast_to_fixed (struct type *type, struct value *arg)
14f9c5c9
AS
8604{
8605 LONGEST val;
8606
df407dfe 8607 if (type == value_type (arg))
14f9c5c9 8608 return arg;
df407dfe 8609 else if (ada_is_fixed_point_type (value_type (arg)))
d2e4a39e 8610 val = ada_float_to_fixed (type,
df407dfe 8611 ada_fixed_to_float (value_type (arg),
4c4b4cd2 8612 value_as_long (arg)));
d2e4a39e 8613 else
14f9c5c9 8614 {
a53b7a21 8615 DOUBLEST argd = value_as_double (arg);
5b4ee69b 8616
14f9c5c9
AS
8617 val = ada_float_to_fixed (type, argd);
8618 }
8619
8620 return value_from_longest (type, val);
8621}
8622
d2e4a39e 8623static struct value *
a53b7a21 8624cast_from_fixed (struct type *type, struct value *arg)
14f9c5c9 8625{
df407dfe 8626 DOUBLEST val = ada_fixed_to_float (value_type (arg),
4c4b4cd2 8627 value_as_long (arg));
5b4ee69b 8628
a53b7a21 8629 return value_from_double (type, val);
14f9c5c9
AS
8630}
8631
d99dcf51
JB
8632/* Given two array types T1 and T2, return nonzero iff both arrays
8633 contain the same number of elements. */
8634
8635static int
8636ada_same_array_size_p (struct type *t1, struct type *t2)
8637{
8638 LONGEST lo1, hi1, lo2, hi2;
8639
8640 /* Get the array bounds in order to verify that the size of
8641 the two arrays match. */
8642 if (!get_array_bounds (t1, &lo1, &hi1)
8643 || !get_array_bounds (t2, &lo2, &hi2))
8644 error (_("unable to determine array bounds"));
8645
8646 /* To make things easier for size comparison, normalize a bit
8647 the case of empty arrays by making sure that the difference
8648 between upper bound and lower bound is always -1. */
8649 if (lo1 > hi1)
8650 hi1 = lo1 - 1;
8651 if (lo2 > hi2)
8652 hi2 = lo2 - 1;
8653
8654 return (hi1 - lo1 == hi2 - lo2);
8655}
8656
8657/* Assuming that VAL is an array of integrals, and TYPE represents
8658 an array with the same number of elements, but with wider integral
8659 elements, return an array "casted" to TYPE. In practice, this
8660 means that the returned array is built by casting each element
8661 of the original array into TYPE's (wider) element type. */
8662
8663static struct value *
8664ada_promote_array_of_integrals (struct type *type, struct value *val)
8665{
8666 struct type *elt_type = TYPE_TARGET_TYPE (type);
8667 LONGEST lo, hi;
8668 struct value *res;
8669 LONGEST i;
8670
8671 /* Verify that both val and type are arrays of scalars, and
8672 that the size of val's elements is smaller than the size
8673 of type's element. */
8674 gdb_assert (TYPE_CODE (type) == TYPE_CODE_ARRAY);
8675 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type)));
8676 gdb_assert (TYPE_CODE (value_type (val)) == TYPE_CODE_ARRAY);
8677 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val))));
8678 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type))
8679 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val))));
8680
8681 if (!get_array_bounds (type, &lo, &hi))
8682 error (_("unable to determine array bounds"));
8683
8684 res = allocate_value (type);
8685
8686 /* Promote each array element. */
8687 for (i = 0; i < hi - lo + 1; i++)
8688 {
8689 struct value *elt = value_cast (elt_type, value_subscript (val, lo + i));
8690
8691 memcpy (value_contents_writeable (res) + (i * TYPE_LENGTH (elt_type)),
8692 value_contents_all (elt), TYPE_LENGTH (elt_type));
8693 }
8694
8695 return res;
8696}
8697
4c4b4cd2
PH
8698/* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8699 return the converted value. */
8700
d2e4a39e
AS
8701static struct value *
8702coerce_for_assign (struct type *type, struct value *val)
14f9c5c9 8703{
df407dfe 8704 struct type *type2 = value_type (val);
5b4ee69b 8705
14f9c5c9
AS
8706 if (type == type2)
8707 return val;
8708
61ee279c
PH
8709 type2 = ada_check_typedef (type2);
8710 type = ada_check_typedef (type);
14f9c5c9 8711
d2e4a39e
AS
8712 if (TYPE_CODE (type2) == TYPE_CODE_PTR
8713 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
14f9c5c9
AS
8714 {
8715 val = ada_value_ind (val);
df407dfe 8716 type2 = value_type (val);
14f9c5c9
AS
8717 }
8718
d2e4a39e 8719 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
14f9c5c9
AS
8720 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
8721 {
d99dcf51
JB
8722 if (!ada_same_array_size_p (type, type2))
8723 error (_("cannot assign arrays of different length"));
8724
8725 if (is_integral_type (TYPE_TARGET_TYPE (type))
8726 && is_integral_type (TYPE_TARGET_TYPE (type2))
8727 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
8728 < TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
8729 {
8730 /* Allow implicit promotion of the array elements to
8731 a wider type. */
8732 return ada_promote_array_of_integrals (type, val);
8733 }
8734
8735 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
8736 != TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
323e0a4a 8737 error (_("Incompatible types in assignment"));
04624583 8738 deprecated_set_value_type (val, type);
14f9c5c9 8739 }
d2e4a39e 8740 return val;
14f9c5c9
AS
8741}
8742
4c4b4cd2
PH
8743static struct value *
8744ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
8745{
8746 struct value *val;
8747 struct type *type1, *type2;
8748 LONGEST v, v1, v2;
8749
994b9211
AC
8750 arg1 = coerce_ref (arg1);
8751 arg2 = coerce_ref (arg2);
18af8284
JB
8752 type1 = get_base_type (ada_check_typedef (value_type (arg1)));
8753 type2 = get_base_type (ada_check_typedef (value_type (arg2)));
4c4b4cd2 8754
76a01679
JB
8755 if (TYPE_CODE (type1) != TYPE_CODE_INT
8756 || TYPE_CODE (type2) != TYPE_CODE_INT)
4c4b4cd2
PH
8757 return value_binop (arg1, arg2, op);
8758
76a01679 8759 switch (op)
4c4b4cd2
PH
8760 {
8761 case BINOP_MOD:
8762 case BINOP_DIV:
8763 case BINOP_REM:
8764 break;
8765 default:
8766 return value_binop (arg1, arg2, op);
8767 }
8768
8769 v2 = value_as_long (arg2);
8770 if (v2 == 0)
323e0a4a 8771 error (_("second operand of %s must not be zero."), op_string (op));
4c4b4cd2
PH
8772
8773 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
8774 return value_binop (arg1, arg2, op);
8775
8776 v1 = value_as_long (arg1);
8777 switch (op)
8778 {
8779 case BINOP_DIV:
8780 v = v1 / v2;
76a01679
JB
8781 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
8782 v += v > 0 ? -1 : 1;
4c4b4cd2
PH
8783 break;
8784 case BINOP_REM:
8785 v = v1 % v2;
76a01679
JB
8786 if (v * v1 < 0)
8787 v -= v2;
4c4b4cd2
PH
8788 break;
8789 default:
8790 /* Should not reach this point. */
8791 v = 0;
8792 }
8793
8794 val = allocate_value (type1);
990a07ab 8795 store_unsigned_integer (value_contents_raw (val),
e17a4113
UW
8796 TYPE_LENGTH (value_type (val)),
8797 gdbarch_byte_order (get_type_arch (type1)), v);
4c4b4cd2
PH
8798 return val;
8799}
8800
8801static int
8802ada_value_equal (struct value *arg1, struct value *arg2)
8803{
df407dfe
AC
8804 if (ada_is_direct_array_type (value_type (arg1))
8805 || ada_is_direct_array_type (value_type (arg2)))
4c4b4cd2 8806 {
f58b38bf
JB
8807 /* Automatically dereference any array reference before
8808 we attempt to perform the comparison. */
8809 arg1 = ada_coerce_ref (arg1);
8810 arg2 = ada_coerce_ref (arg2);
8811
4c4b4cd2
PH
8812 arg1 = ada_coerce_to_simple_array (arg1);
8813 arg2 = ada_coerce_to_simple_array (arg2);
df407dfe
AC
8814 if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
8815 || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
323e0a4a 8816 error (_("Attempt to compare array with non-array"));
4c4b4cd2 8817 /* FIXME: The following works only for types whose
76a01679
JB
8818 representations use all bits (no padding or undefined bits)
8819 and do not have user-defined equality. */
8820 return
df407dfe 8821 TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
0fd88904 8822 && memcmp (value_contents (arg1), value_contents (arg2),
df407dfe 8823 TYPE_LENGTH (value_type (arg1))) == 0;
4c4b4cd2
PH
8824 }
8825 return value_equal (arg1, arg2);
8826}
8827
52ce6436
PH
8828/* Total number of component associations in the aggregate starting at
8829 index PC in EXP. Assumes that index PC is the start of an
0963b4bd 8830 OP_AGGREGATE. */
52ce6436
PH
8831
8832static int
8833num_component_specs (struct expression *exp, int pc)
8834{
8835 int n, m, i;
5b4ee69b 8836
52ce6436
PH
8837 m = exp->elts[pc + 1].longconst;
8838 pc += 3;
8839 n = 0;
8840 for (i = 0; i < m; i += 1)
8841 {
8842 switch (exp->elts[pc].opcode)
8843 {
8844 default:
8845 n += 1;
8846 break;
8847 case OP_CHOICES:
8848 n += exp->elts[pc + 1].longconst;
8849 break;
8850 }
8851 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
8852 }
8853 return n;
8854}
8855
8856/* Assign the result of evaluating EXP starting at *POS to the INDEXth
8857 component of LHS (a simple array or a record), updating *POS past
8858 the expression, assuming that LHS is contained in CONTAINER. Does
8859 not modify the inferior's memory, nor does it modify LHS (unless
8860 LHS == CONTAINER). */
8861
8862static void
8863assign_component (struct value *container, struct value *lhs, LONGEST index,
8864 struct expression *exp, int *pos)
8865{
8866 struct value *mark = value_mark ();
8867 struct value *elt;
5b4ee69b 8868
52ce6436
PH
8869 if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
8870 {
22601c15
UW
8871 struct type *index_type = builtin_type (exp->gdbarch)->builtin_int;
8872 struct value *index_val = value_from_longest (index_type, index);
5b4ee69b 8873
52ce6436
PH
8874 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
8875 }
8876 else
8877 {
8878 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
c48db5ca 8879 elt = ada_to_fixed_value (elt);
52ce6436
PH
8880 }
8881
8882 if (exp->elts[*pos].opcode == OP_AGGREGATE)
8883 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
8884 else
8885 value_assign_to_component (container, elt,
8886 ada_evaluate_subexp (NULL, exp, pos,
8887 EVAL_NORMAL));
8888
8889 value_free_to_mark (mark);
8890}
8891
8892/* Assuming that LHS represents an lvalue having a record or array
8893 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8894 of that aggregate's value to LHS, advancing *POS past the
8895 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8896 lvalue containing LHS (possibly LHS itself). Does not modify
8897 the inferior's memory, nor does it modify the contents of
0963b4bd 8898 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
52ce6436
PH
8899
8900static struct value *
8901assign_aggregate (struct value *container,
8902 struct value *lhs, struct expression *exp,
8903 int *pos, enum noside noside)
8904{
8905 struct type *lhs_type;
8906 int n = exp->elts[*pos+1].longconst;
8907 LONGEST low_index, high_index;
8908 int num_specs;
8909 LONGEST *indices;
8910 int max_indices, num_indices;
8911 int is_array_aggregate;
8912 int i;
52ce6436
PH
8913
8914 *pos += 3;
8915 if (noside != EVAL_NORMAL)
8916 {
52ce6436
PH
8917 for (i = 0; i < n; i += 1)
8918 ada_evaluate_subexp (NULL, exp, pos, noside);
8919 return container;
8920 }
8921
8922 container = ada_coerce_ref (container);
8923 if (ada_is_direct_array_type (value_type (container)))
8924 container = ada_coerce_to_simple_array (container);
8925 lhs = ada_coerce_ref (lhs);
8926 if (!deprecated_value_modifiable (lhs))
8927 error (_("Left operand of assignment is not a modifiable lvalue."));
8928
8929 lhs_type = value_type (lhs);
8930 if (ada_is_direct_array_type (lhs_type))
8931 {
8932 lhs = ada_coerce_to_simple_array (lhs);
8933 lhs_type = value_type (lhs);
8934 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
8935 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
8936 is_array_aggregate = 1;
8937 }
8938 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
8939 {
8940 low_index = 0;
8941 high_index = num_visible_fields (lhs_type) - 1;
8942 is_array_aggregate = 0;
8943 }
8944 else
8945 error (_("Left-hand side must be array or record."));
8946
8947 num_specs = num_component_specs (exp, *pos - 3);
8948 max_indices = 4 * num_specs + 4;
8949 indices = alloca (max_indices * sizeof (indices[0]));
8950 indices[0] = indices[1] = low_index - 1;
8951 indices[2] = indices[3] = high_index + 1;
8952 num_indices = 4;
8953
8954 for (i = 0; i < n; i += 1)
8955 {
8956 switch (exp->elts[*pos].opcode)
8957 {
1fbf5ada
JB
8958 case OP_CHOICES:
8959 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
8960 &num_indices, max_indices,
8961 low_index, high_index);
8962 break;
8963 case OP_POSITIONAL:
8964 aggregate_assign_positional (container, lhs, exp, pos, indices,
52ce6436
PH
8965 &num_indices, max_indices,
8966 low_index, high_index);
1fbf5ada
JB
8967 break;
8968 case OP_OTHERS:
8969 if (i != n-1)
8970 error (_("Misplaced 'others' clause"));
8971 aggregate_assign_others (container, lhs, exp, pos, indices,
8972 num_indices, low_index, high_index);
8973 break;
8974 default:
8975 error (_("Internal error: bad aggregate clause"));
52ce6436
PH
8976 }
8977 }
8978
8979 return container;
8980}
8981
8982/* Assign into the component of LHS indexed by the OP_POSITIONAL
8983 construct at *POS, updating *POS past the construct, given that
8984 the positions are relative to lower bound LOW, where HIGH is the
8985 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8986 updating *NUM_INDICES as needed. CONTAINER is as for
0963b4bd 8987 assign_aggregate. */
52ce6436
PH
8988static void
8989aggregate_assign_positional (struct value *container,
8990 struct value *lhs, struct expression *exp,
8991 int *pos, LONGEST *indices, int *num_indices,
8992 int max_indices, LONGEST low, LONGEST high)
8993{
8994 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
8995
8996 if (ind - 1 == high)
e1d5a0d2 8997 warning (_("Extra components in aggregate ignored."));
52ce6436
PH
8998 if (ind <= high)
8999 {
9000 add_component_interval (ind, ind, indices, num_indices, max_indices);
9001 *pos += 3;
9002 assign_component (container, lhs, ind, exp, pos);
9003 }
9004 else
9005 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9006}
9007
9008/* Assign into the components of LHS indexed by the OP_CHOICES
9009 construct at *POS, updating *POS past the construct, given that
9010 the allowable indices are LOW..HIGH. Record the indices assigned
9011 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
0963b4bd 9012 needed. CONTAINER is as for assign_aggregate. */
52ce6436
PH
9013static void
9014aggregate_assign_from_choices (struct value *container,
9015 struct value *lhs, struct expression *exp,
9016 int *pos, LONGEST *indices, int *num_indices,
9017 int max_indices, LONGEST low, LONGEST high)
9018{
9019 int j;
9020 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
9021 int choice_pos, expr_pc;
9022 int is_array = ada_is_direct_array_type (value_type (lhs));
9023
9024 choice_pos = *pos += 3;
9025
9026 for (j = 0; j < n_choices; j += 1)
9027 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9028 expr_pc = *pos;
9029 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9030
9031 for (j = 0; j < n_choices; j += 1)
9032 {
9033 LONGEST lower, upper;
9034 enum exp_opcode op = exp->elts[choice_pos].opcode;
5b4ee69b 9035
52ce6436
PH
9036 if (op == OP_DISCRETE_RANGE)
9037 {
9038 choice_pos += 1;
9039 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
9040 EVAL_NORMAL));
9041 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
9042 EVAL_NORMAL));
9043 }
9044 else if (is_array)
9045 {
9046 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
9047 EVAL_NORMAL));
9048 upper = lower;
9049 }
9050 else
9051 {
9052 int ind;
0d5cff50 9053 const char *name;
5b4ee69b 9054
52ce6436
PH
9055 switch (op)
9056 {
9057 case OP_NAME:
9058 name = &exp->elts[choice_pos + 2].string;
9059 break;
9060 case OP_VAR_VALUE:
9061 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
9062 break;
9063 default:
9064 error (_("Invalid record component association."));
9065 }
9066 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
9067 ind = 0;
9068 if (! find_struct_field (name, value_type (lhs), 0,
9069 NULL, NULL, NULL, NULL, &ind))
9070 error (_("Unknown component name: %s."), name);
9071 lower = upper = ind;
9072 }
9073
9074 if (lower <= upper && (lower < low || upper > high))
9075 error (_("Index in component association out of bounds."));
9076
9077 add_component_interval (lower, upper, indices, num_indices,
9078 max_indices);
9079 while (lower <= upper)
9080 {
9081 int pos1;
5b4ee69b 9082
52ce6436
PH
9083 pos1 = expr_pc;
9084 assign_component (container, lhs, lower, exp, &pos1);
9085 lower += 1;
9086 }
9087 }
9088}
9089
9090/* Assign the value of the expression in the OP_OTHERS construct in
9091 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9092 have not been previously assigned. The index intervals already assigned
9093 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
0963b4bd 9094 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
52ce6436
PH
9095static void
9096aggregate_assign_others (struct value *container,
9097 struct value *lhs, struct expression *exp,
9098 int *pos, LONGEST *indices, int num_indices,
9099 LONGEST low, LONGEST high)
9100{
9101 int i;
5ce64950 9102 int expr_pc = *pos + 1;
52ce6436
PH
9103
9104 for (i = 0; i < num_indices - 2; i += 2)
9105 {
9106 LONGEST ind;
5b4ee69b 9107
52ce6436
PH
9108 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
9109 {
5ce64950 9110 int localpos;
5b4ee69b 9111
5ce64950
MS
9112 localpos = expr_pc;
9113 assign_component (container, lhs, ind, exp, &localpos);
52ce6436
PH
9114 }
9115 }
9116 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
9117}
9118
9119/* Add the interval [LOW .. HIGH] to the sorted set of intervals
9120 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9121 modifying *SIZE as needed. It is an error if *SIZE exceeds
9122 MAX_SIZE. The resulting intervals do not overlap. */
9123static void
9124add_component_interval (LONGEST low, LONGEST high,
9125 LONGEST* indices, int *size, int max_size)
9126{
9127 int i, j;
5b4ee69b 9128
52ce6436
PH
9129 for (i = 0; i < *size; i += 2) {
9130 if (high >= indices[i] && low <= indices[i + 1])
9131 {
9132 int kh;
5b4ee69b 9133
52ce6436
PH
9134 for (kh = i + 2; kh < *size; kh += 2)
9135 if (high < indices[kh])
9136 break;
9137 if (low < indices[i])
9138 indices[i] = low;
9139 indices[i + 1] = indices[kh - 1];
9140 if (high > indices[i + 1])
9141 indices[i + 1] = high;
9142 memcpy (indices + i + 2, indices + kh, *size - kh);
9143 *size -= kh - i - 2;
9144 return;
9145 }
9146 else if (high < indices[i])
9147 break;
9148 }
9149
9150 if (*size == max_size)
9151 error (_("Internal error: miscounted aggregate components."));
9152 *size += 2;
9153 for (j = *size-1; j >= i+2; j -= 1)
9154 indices[j] = indices[j - 2];
9155 indices[i] = low;
9156 indices[i + 1] = high;
9157}
9158
6e48bd2c
JB
9159/* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9160 is different. */
9161
9162static struct value *
9163ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
9164{
9165 if (type == ada_check_typedef (value_type (arg2)))
9166 return arg2;
9167
9168 if (ada_is_fixed_point_type (type))
9169 return (cast_to_fixed (type, arg2));
9170
9171 if (ada_is_fixed_point_type (value_type (arg2)))
a53b7a21 9172 return cast_from_fixed (type, arg2);
6e48bd2c
JB
9173
9174 return value_cast (type, arg2);
9175}
9176
284614f0
JB
9177/* Evaluating Ada expressions, and printing their result.
9178 ------------------------------------------------------
9179
21649b50
JB
9180 1. Introduction:
9181 ----------------
9182
284614f0
JB
9183 We usually evaluate an Ada expression in order to print its value.
9184 We also evaluate an expression in order to print its type, which
9185 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9186 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9187 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9188 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9189 similar.
9190
9191 Evaluating expressions is a little more complicated for Ada entities
9192 than it is for entities in languages such as C. The main reason for
9193 this is that Ada provides types whose definition might be dynamic.
9194 One example of such types is variant records. Or another example
9195 would be an array whose bounds can only be known at run time.
9196
9197 The following description is a general guide as to what should be
9198 done (and what should NOT be done) in order to evaluate an expression
9199 involving such types, and when. This does not cover how the semantic
9200 information is encoded by GNAT as this is covered separatly. For the
9201 document used as the reference for the GNAT encoding, see exp_dbug.ads
9202 in the GNAT sources.
9203
9204 Ideally, we should embed each part of this description next to its
9205 associated code. Unfortunately, the amount of code is so vast right
9206 now that it's hard to see whether the code handling a particular
9207 situation might be duplicated or not. One day, when the code is
9208 cleaned up, this guide might become redundant with the comments
9209 inserted in the code, and we might want to remove it.
9210
21649b50
JB
9211 2. ``Fixing'' an Entity, the Simple Case:
9212 -----------------------------------------
9213
284614f0
JB
9214 When evaluating Ada expressions, the tricky issue is that they may
9215 reference entities whose type contents and size are not statically
9216 known. Consider for instance a variant record:
9217
9218 type Rec (Empty : Boolean := True) is record
9219 case Empty is
9220 when True => null;
9221 when False => Value : Integer;
9222 end case;
9223 end record;
9224 Yes : Rec := (Empty => False, Value => 1);
9225 No : Rec := (empty => True);
9226
9227 The size and contents of that record depends on the value of the
9228 descriminant (Rec.Empty). At this point, neither the debugging
9229 information nor the associated type structure in GDB are able to
9230 express such dynamic types. So what the debugger does is to create
9231 "fixed" versions of the type that applies to the specific object.
9232 We also informally refer to this opperation as "fixing" an object,
9233 which means creating its associated fixed type.
9234
9235 Example: when printing the value of variable "Yes" above, its fixed
9236 type would look like this:
9237
9238 type Rec is record
9239 Empty : Boolean;
9240 Value : Integer;
9241 end record;
9242
9243 On the other hand, if we printed the value of "No", its fixed type
9244 would become:
9245
9246 type Rec is record
9247 Empty : Boolean;
9248 end record;
9249
9250 Things become a little more complicated when trying to fix an entity
9251 with a dynamic type that directly contains another dynamic type,
9252 such as an array of variant records, for instance. There are
9253 two possible cases: Arrays, and records.
9254
21649b50
JB
9255 3. ``Fixing'' Arrays:
9256 ---------------------
9257
9258 The type structure in GDB describes an array in terms of its bounds,
9259 and the type of its elements. By design, all elements in the array
9260 have the same type and we cannot represent an array of variant elements
9261 using the current type structure in GDB. When fixing an array,
9262 we cannot fix the array element, as we would potentially need one
9263 fixed type per element of the array. As a result, the best we can do
9264 when fixing an array is to produce an array whose bounds and size
9265 are correct (allowing us to read it from memory), but without having
9266 touched its element type. Fixing each element will be done later,
9267 when (if) necessary.
9268
9269 Arrays are a little simpler to handle than records, because the same
9270 amount of memory is allocated for each element of the array, even if
1b536f04 9271 the amount of space actually used by each element differs from element
21649b50 9272 to element. Consider for instance the following array of type Rec:
284614f0
JB
9273
9274 type Rec_Array is array (1 .. 2) of Rec;
9275
1b536f04
JB
9276 The actual amount of memory occupied by each element might be different
9277 from element to element, depending on the value of their discriminant.
21649b50 9278 But the amount of space reserved for each element in the array remains
1b536f04 9279 fixed regardless. So we simply need to compute that size using
21649b50
JB
9280 the debugging information available, from which we can then determine
9281 the array size (we multiply the number of elements of the array by
9282 the size of each element).
9283
9284 The simplest case is when we have an array of a constrained element
9285 type. For instance, consider the following type declarations:
9286
9287 type Bounded_String (Max_Size : Integer) is
9288 Length : Integer;
9289 Buffer : String (1 .. Max_Size);
9290 end record;
9291 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9292
9293 In this case, the compiler describes the array as an array of
9294 variable-size elements (identified by its XVS suffix) for which
9295 the size can be read in the parallel XVZ variable.
9296
9297 In the case of an array of an unconstrained element type, the compiler
9298 wraps the array element inside a private PAD type. This type should not
9299 be shown to the user, and must be "unwrap"'ed before printing. Note
284614f0
JB
9300 that we also use the adjective "aligner" in our code to designate
9301 these wrapper types.
9302
1b536f04 9303 In some cases, the size allocated for each element is statically
21649b50
JB
9304 known. In that case, the PAD type already has the correct size,
9305 and the array element should remain unfixed.
9306
9307 But there are cases when this size is not statically known.
9308 For instance, assuming that "Five" is an integer variable:
284614f0
JB
9309
9310 type Dynamic is array (1 .. Five) of Integer;
9311 type Wrapper (Has_Length : Boolean := False) is record
9312 Data : Dynamic;
9313 case Has_Length is
9314 when True => Length : Integer;
9315 when False => null;
9316 end case;
9317 end record;
9318 type Wrapper_Array is array (1 .. 2) of Wrapper;
9319
9320 Hello : Wrapper_Array := (others => (Has_Length => True,
9321 Data => (others => 17),
9322 Length => 1));
9323
9324
9325 The debugging info would describe variable Hello as being an
9326 array of a PAD type. The size of that PAD type is not statically
9327 known, but can be determined using a parallel XVZ variable.
9328 In that case, a copy of the PAD type with the correct size should
9329 be used for the fixed array.
9330
21649b50
JB
9331 3. ``Fixing'' record type objects:
9332 ----------------------------------
9333
9334 Things are slightly different from arrays in the case of dynamic
284614f0
JB
9335 record types. In this case, in order to compute the associated
9336 fixed type, we need to determine the size and offset of each of
9337 its components. This, in turn, requires us to compute the fixed
9338 type of each of these components.
9339
9340 Consider for instance the example:
9341
9342 type Bounded_String (Max_Size : Natural) is record
9343 Str : String (1 .. Max_Size);
9344 Length : Natural;
9345 end record;
9346 My_String : Bounded_String (Max_Size => 10);
9347
9348 In that case, the position of field "Length" depends on the size
9349 of field Str, which itself depends on the value of the Max_Size
21649b50 9350 discriminant. In order to fix the type of variable My_String,
284614f0
JB
9351 we need to fix the type of field Str. Therefore, fixing a variant
9352 record requires us to fix each of its components.
9353
9354 However, if a component does not have a dynamic size, the component
9355 should not be fixed. In particular, fields that use a PAD type
9356 should not fixed. Here is an example where this might happen
9357 (assuming type Rec above):
9358
9359 type Container (Big : Boolean) is record
9360 First : Rec;
9361 After : Integer;
9362 case Big is
9363 when True => Another : Integer;
9364 when False => null;
9365 end case;
9366 end record;
9367 My_Container : Container := (Big => False,
9368 First => (Empty => True),
9369 After => 42);
9370
9371 In that example, the compiler creates a PAD type for component First,
9372 whose size is constant, and then positions the component After just
9373 right after it. The offset of component After is therefore constant
9374 in this case.
9375
9376 The debugger computes the position of each field based on an algorithm
9377 that uses, among other things, the actual position and size of the field
21649b50
JB
9378 preceding it. Let's now imagine that the user is trying to print
9379 the value of My_Container. If the type fixing was recursive, we would
284614f0
JB
9380 end up computing the offset of field After based on the size of the
9381 fixed version of field First. And since in our example First has
9382 only one actual field, the size of the fixed type is actually smaller
9383 than the amount of space allocated to that field, and thus we would
9384 compute the wrong offset of field After.
9385
21649b50
JB
9386 To make things more complicated, we need to watch out for dynamic
9387 components of variant records (identified by the ___XVL suffix in
9388 the component name). Even if the target type is a PAD type, the size
9389 of that type might not be statically known. So the PAD type needs
9390 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9391 we might end up with the wrong size for our component. This can be
9392 observed with the following type declarations:
284614f0
JB
9393
9394 type Octal is new Integer range 0 .. 7;
9395 type Octal_Array is array (Positive range <>) of Octal;
9396 pragma Pack (Octal_Array);
9397
9398 type Octal_Buffer (Size : Positive) is record
9399 Buffer : Octal_Array (1 .. Size);
9400 Length : Integer;
9401 end record;
9402
9403 In that case, Buffer is a PAD type whose size is unset and needs
9404 to be computed by fixing the unwrapped type.
9405
21649b50
JB
9406 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9407 ----------------------------------------------------------
9408
9409 Lastly, when should the sub-elements of an entity that remained unfixed
284614f0
JB
9410 thus far, be actually fixed?
9411
9412 The answer is: Only when referencing that element. For instance
9413 when selecting one component of a record, this specific component
9414 should be fixed at that point in time. Or when printing the value
9415 of a record, each component should be fixed before its value gets
9416 printed. Similarly for arrays, the element of the array should be
9417 fixed when printing each element of the array, or when extracting
9418 one element out of that array. On the other hand, fixing should
9419 not be performed on the elements when taking a slice of an array!
9420
9421 Note that one of the side-effects of miscomputing the offset and
9422 size of each field is that we end up also miscomputing the size
9423 of the containing type. This can have adverse results when computing
9424 the value of an entity. GDB fetches the value of an entity based
9425 on the size of its type, and thus a wrong size causes GDB to fetch
9426 the wrong amount of memory. In the case where the computed size is
9427 too small, GDB fetches too little data to print the value of our
9428 entiry. Results in this case as unpredicatble, as we usually read
9429 past the buffer containing the data =:-o. */
9430
9431/* Implement the evaluate_exp routine in the exp_descriptor structure
9432 for the Ada language. */
9433
52ce6436 9434static struct value *
ebf56fd3 9435ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
4c4b4cd2 9436 int *pos, enum noside noside)
14f9c5c9
AS
9437{
9438 enum exp_opcode op;
b5385fc0 9439 int tem;
14f9c5c9
AS
9440 int pc;
9441 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
9442 struct type *type;
52ce6436 9443 int nargs, oplen;
d2e4a39e 9444 struct value **argvec;
14f9c5c9 9445
d2e4a39e
AS
9446 pc = *pos;
9447 *pos += 1;
14f9c5c9
AS
9448 op = exp->elts[pc].opcode;
9449
d2e4a39e 9450 switch (op)
14f9c5c9
AS
9451 {
9452 default:
9453 *pos -= 1;
6e48bd2c
JB
9454 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
9455 arg1 = unwrap_value (arg1);
9456
9457 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9458 then we need to perform the conversion manually, because
9459 evaluate_subexp_standard doesn't do it. This conversion is
9460 necessary in Ada because the different kinds of float/fixed
9461 types in Ada have different representations.
9462
9463 Similarly, we need to perform the conversion from OP_LONG
9464 ourselves. */
9465 if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
9466 arg1 = ada_value_cast (expect_type, arg1, noside);
9467
9468 return arg1;
4c4b4cd2
PH
9469
9470 case OP_STRING:
9471 {
76a01679 9472 struct value *result;
5b4ee69b 9473
76a01679
JB
9474 *pos -= 1;
9475 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
9476 /* The result type will have code OP_STRING, bashed there from
9477 OP_ARRAY. Bash it back. */
df407dfe
AC
9478 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
9479 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
76a01679 9480 return result;
4c4b4cd2 9481 }
14f9c5c9
AS
9482
9483 case UNOP_CAST:
9484 (*pos) += 2;
9485 type = exp->elts[pc + 1].type;
9486 arg1 = evaluate_subexp (type, exp, pos, noside);
9487 if (noside == EVAL_SKIP)
4c4b4cd2 9488 goto nosideret;
6e48bd2c 9489 arg1 = ada_value_cast (type, arg1, noside);
14f9c5c9
AS
9490 return arg1;
9491
4c4b4cd2
PH
9492 case UNOP_QUAL:
9493 (*pos) += 2;
9494 type = exp->elts[pc + 1].type;
9495 return ada_evaluate_subexp (type, exp, pos, noside);
9496
14f9c5c9
AS
9497 case BINOP_ASSIGN:
9498 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
52ce6436
PH
9499 if (exp->elts[*pos].opcode == OP_AGGREGATE)
9500 {
9501 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
9502 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
9503 return arg1;
9504 return ada_value_assign (arg1, arg1);
9505 }
003f3813
JB
9506 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9507 except if the lhs of our assignment is a convenience variable.
9508 In the case of assigning to a convenience variable, the lhs
9509 should be exactly the result of the evaluation of the rhs. */
9510 type = value_type (arg1);
9511 if (VALUE_LVAL (arg1) == lval_internalvar)
9512 type = NULL;
9513 arg2 = evaluate_subexp (type, exp, pos, noside);
14f9c5c9 9514 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
4c4b4cd2 9515 return arg1;
df407dfe
AC
9516 if (ada_is_fixed_point_type (value_type (arg1)))
9517 arg2 = cast_to_fixed (value_type (arg1), arg2);
9518 else if (ada_is_fixed_point_type (value_type (arg2)))
76a01679 9519 error
323e0a4a 9520 (_("Fixed-point values must be assigned to fixed-point variables"));
d2e4a39e 9521 else
df407dfe 9522 arg2 = coerce_for_assign (value_type (arg1), arg2);
4c4b4cd2 9523 return ada_value_assign (arg1, arg2);
14f9c5c9
AS
9524
9525 case BINOP_ADD:
9526 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
9527 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
9528 if (noside == EVAL_SKIP)
4c4b4cd2 9529 goto nosideret;
2ac8a782
JB
9530 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
9531 return (value_from_longest
9532 (value_type (arg1),
9533 value_as_long (arg1) + value_as_long (arg2)));
df407dfe
AC
9534 if ((ada_is_fixed_point_type (value_type (arg1))
9535 || ada_is_fixed_point_type (value_type (arg2)))
9536 && value_type (arg1) != value_type (arg2))
323e0a4a 9537 error (_("Operands of fixed-point addition must have the same type"));
b7789565
JB
9538 /* Do the addition, and cast the result to the type of the first
9539 argument. We cannot cast the result to a reference type, so if
9540 ARG1 is a reference type, find its underlying type. */
9541 type = value_type (arg1);
9542 while (TYPE_CODE (type) == TYPE_CODE_REF)
9543 type = TYPE_TARGET_TYPE (type);
f44316fa 9544 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
89eef114 9545 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
14f9c5c9
AS
9546
9547 case BINOP_SUB:
9548 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
9549 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
9550 if (noside == EVAL_SKIP)
4c4b4cd2 9551 goto nosideret;
2ac8a782
JB
9552 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
9553 return (value_from_longest
9554 (value_type (arg1),
9555 value_as_long (arg1) - value_as_long (arg2)));
df407dfe
AC
9556 if ((ada_is_fixed_point_type (value_type (arg1))
9557 || ada_is_fixed_point_type (value_type (arg2)))
9558 && value_type (arg1) != value_type (arg2))
0963b4bd
MS
9559 error (_("Operands of fixed-point subtraction "
9560 "must have the same type"));
b7789565
JB
9561 /* Do the substraction, and cast the result to the type of the first
9562 argument. We cannot cast the result to a reference type, so if
9563 ARG1 is a reference type, find its underlying type. */
9564 type = value_type (arg1);
9565 while (TYPE_CODE (type) == TYPE_CODE_REF)
9566 type = TYPE_TARGET_TYPE (type);
f44316fa 9567 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
89eef114 9568 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
14f9c5c9
AS
9569
9570 case BINOP_MUL:
9571 case BINOP_DIV:
e1578042
JB
9572 case BINOP_REM:
9573 case BINOP_MOD:
14f9c5c9
AS
9574 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9575 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9576 if (noside == EVAL_SKIP)
4c4b4cd2 9577 goto nosideret;
e1578042 9578 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9c2be529
JB
9579 {
9580 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9581 return value_zero (value_type (arg1), not_lval);
9582 }
14f9c5c9 9583 else
4c4b4cd2 9584 {
a53b7a21 9585 type = builtin_type (exp->gdbarch)->builtin_double;
df407dfe 9586 if (ada_is_fixed_point_type (value_type (arg1)))
a53b7a21 9587 arg1 = cast_from_fixed (type, arg1);
df407dfe 9588 if (ada_is_fixed_point_type (value_type (arg2)))
a53b7a21 9589 arg2 = cast_from_fixed (type, arg2);
f44316fa 9590 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
4c4b4cd2
PH
9591 return ada_value_binop (arg1, arg2, op);
9592 }
9593
4c4b4cd2
PH
9594 case BINOP_EQUAL:
9595 case BINOP_NOTEQUAL:
14f9c5c9 9596 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
df407dfe 9597 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
14f9c5c9 9598 if (noside == EVAL_SKIP)
76a01679 9599 goto nosideret;
4c4b4cd2 9600 if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 9601 tem = 0;
4c4b4cd2 9602 else
f44316fa
UW
9603 {
9604 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9605 tem = ada_value_equal (arg1, arg2);
9606 }
4c4b4cd2 9607 if (op == BINOP_NOTEQUAL)
76a01679 9608 tem = !tem;
fbb06eb1
UW
9609 type = language_bool_type (exp->language_defn, exp->gdbarch);
9610 return value_from_longest (type, (LONGEST) tem);
4c4b4cd2
PH
9611
9612 case UNOP_NEG:
9613 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9614 if (noside == EVAL_SKIP)
9615 goto nosideret;
df407dfe
AC
9616 else if (ada_is_fixed_point_type (value_type (arg1)))
9617 return value_cast (value_type (arg1), value_neg (arg1));
14f9c5c9 9618 else
f44316fa
UW
9619 {
9620 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
9621 return value_neg (arg1);
9622 }
4c4b4cd2 9623
2330c6c6
JB
9624 case BINOP_LOGICAL_AND:
9625 case BINOP_LOGICAL_OR:
9626 case UNOP_LOGICAL_NOT:
000d5124
JB
9627 {
9628 struct value *val;
9629
9630 *pos -= 1;
9631 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
fbb06eb1
UW
9632 type = language_bool_type (exp->language_defn, exp->gdbarch);
9633 return value_cast (type, val);
000d5124 9634 }
2330c6c6
JB
9635
9636 case BINOP_BITWISE_AND:
9637 case BINOP_BITWISE_IOR:
9638 case BINOP_BITWISE_XOR:
000d5124
JB
9639 {
9640 struct value *val;
9641
9642 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
9643 *pos = pc;
9644 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
9645
9646 return value_cast (value_type (arg1), val);
9647 }
2330c6c6 9648
14f9c5c9
AS
9649 case OP_VAR_VALUE:
9650 *pos -= 1;
6799def4 9651
14f9c5c9 9652 if (noside == EVAL_SKIP)
4c4b4cd2
PH
9653 {
9654 *pos += 4;
9655 goto nosideret;
9656 }
9657 else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
76a01679
JB
9658 /* Only encountered when an unresolved symbol occurs in a
9659 context other than a function call, in which case, it is
52ce6436 9660 invalid. */
323e0a4a 9661 error (_("Unexpected unresolved symbol, %s, during evaluation"),
4c4b4cd2 9662 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
14f9c5c9 9663 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
4c4b4cd2 9664 {
0c1f74cf 9665 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
31dbc1c5
JB
9666 /* Check to see if this is a tagged type. We also need to handle
9667 the case where the type is a reference to a tagged type, but
9668 we have to be careful to exclude pointers to tagged types.
9669 The latter should be shown as usual (as a pointer), whereas
9670 a reference should mostly be transparent to the user. */
9671 if (ada_is_tagged_type (type, 0)
9672 || (TYPE_CODE(type) == TYPE_CODE_REF
9673 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)))
0c1f74cf
JB
9674 {
9675 /* Tagged types are a little special in the fact that the real
9676 type is dynamic and can only be determined by inspecting the
9677 object's tag. This means that we need to get the object's
9678 value first (EVAL_NORMAL) and then extract the actual object
9679 type from its tag.
9680
9681 Note that we cannot skip the final step where we extract
9682 the object type from its tag, because the EVAL_NORMAL phase
9683 results in dynamic components being resolved into fixed ones.
9684 This can cause problems when trying to print the type
9685 description of tagged types whose parent has a dynamic size:
9686 We use the type name of the "_parent" component in order
9687 to print the name of the ancestor type in the type description.
9688 If that component had a dynamic size, the resolution into
9689 a fixed type would result in the loss of that type name,
9690 thus preventing us from printing the name of the ancestor
9691 type in the type description. */
b79819ba
JB
9692 struct type *actual_type;
9693
0c1f74cf 9694 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
b79819ba
JB
9695 actual_type = type_from_tag (ada_value_tag (arg1));
9696 if (actual_type == NULL)
9697 /* If, for some reason, we were unable to determine
9698 the actual type from the tag, then use the static
9699 approximation that we just computed as a fallback.
9700 This can happen if the debugging information is
9701 incomplete, for instance. */
9702 actual_type = type;
9703
9704 return value_zero (actual_type, not_lval);
0c1f74cf
JB
9705 }
9706
4c4b4cd2
PH
9707 *pos += 4;
9708 return value_zero
9709 (to_static_fixed_type
9710 (static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
9711 not_lval);
9712 }
d2e4a39e 9713 else
4c4b4cd2 9714 {
284614f0 9715 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
4c4b4cd2
PH
9716 return ada_to_fixed_value (arg1);
9717 }
9718
9719 case OP_FUNCALL:
9720 (*pos) += 2;
9721
9722 /* Allocate arg vector, including space for the function to be
9723 called in argvec[0] and a terminating NULL. */
9724 nargs = longest_to_int (exp->elts[pc + 1].longconst);
9725 argvec =
9726 (struct value **) alloca (sizeof (struct value *) * (nargs + 2));
9727
9728 if (exp->elts[*pos].opcode == OP_VAR_VALUE
76a01679 9729 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
323e0a4a 9730 error (_("Unexpected unresolved symbol, %s, during evaluation"),
4c4b4cd2
PH
9731 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
9732 else
9733 {
9734 for (tem = 0; tem <= nargs; tem += 1)
9735 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9736 argvec[tem] = 0;
9737
9738 if (noside == EVAL_SKIP)
9739 goto nosideret;
9740 }
9741
ad82864c
JB
9742 if (ada_is_constrained_packed_array_type
9743 (desc_base_type (value_type (argvec[0]))))
4c4b4cd2 9744 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
284614f0
JB
9745 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
9746 && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0)
9747 /* This is a packed array that has already been fixed, and
9748 therefore already coerced to a simple array. Nothing further
9749 to do. */
9750 ;
df407dfe
AC
9751 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
9752 || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
76a01679 9753 && VALUE_LVAL (argvec[0]) == lval_memory))
4c4b4cd2
PH
9754 argvec[0] = value_addr (argvec[0]);
9755
df407dfe 9756 type = ada_check_typedef (value_type (argvec[0]));
720d1a40
JB
9757
9758 /* Ada allows us to implicitly dereference arrays when subscripting
8f465ea7
JB
9759 them. So, if this is an array typedef (encoding use for array
9760 access types encoded as fat pointers), strip it now. */
720d1a40
JB
9761 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
9762 type = ada_typedef_target_type (type);
9763
4c4b4cd2
PH
9764 if (TYPE_CODE (type) == TYPE_CODE_PTR)
9765 {
61ee279c 9766 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
4c4b4cd2
PH
9767 {
9768 case TYPE_CODE_FUNC:
61ee279c 9769 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
4c4b4cd2
PH
9770 break;
9771 case TYPE_CODE_ARRAY:
9772 break;
9773 case TYPE_CODE_STRUCT:
9774 if (noside != EVAL_AVOID_SIDE_EFFECTS)
9775 argvec[0] = ada_value_ind (argvec[0]);
61ee279c 9776 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
4c4b4cd2
PH
9777 break;
9778 default:
323e0a4a 9779 error (_("cannot subscript or call something of type `%s'"),
df407dfe 9780 ada_type_name (value_type (argvec[0])));
4c4b4cd2
PH
9781 break;
9782 }
9783 }
9784
9785 switch (TYPE_CODE (type))
9786 {
9787 case TYPE_CODE_FUNC:
9788 if (noside == EVAL_AVOID_SIDE_EFFECTS)
c8ea1972
PH
9789 {
9790 struct type *rtype = TYPE_TARGET_TYPE (type);
9791
9792 if (TYPE_GNU_IFUNC (type))
9793 return allocate_value (TYPE_TARGET_TYPE (rtype));
9794 return allocate_value (rtype);
9795 }
4c4b4cd2 9796 return call_function_by_hand (argvec[0], nargs, argvec + 1);
c8ea1972
PH
9797 case TYPE_CODE_INTERNAL_FUNCTION:
9798 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9799 /* We don't know anything about what the internal
9800 function might return, but we have to return
9801 something. */
9802 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
9803 not_lval);
9804 else
9805 return call_internal_function (exp->gdbarch, exp->language_defn,
9806 argvec[0], nargs, argvec + 1);
9807
4c4b4cd2
PH
9808 case TYPE_CODE_STRUCT:
9809 {
9810 int arity;
9811
4c4b4cd2
PH
9812 arity = ada_array_arity (type);
9813 type = ada_array_element_type (type, nargs);
9814 if (type == NULL)
323e0a4a 9815 error (_("cannot subscript or call a record"));
4c4b4cd2 9816 if (arity != nargs)
323e0a4a 9817 error (_("wrong number of subscripts; expecting %d"), arity);
4c4b4cd2 9818 if (noside == EVAL_AVOID_SIDE_EFFECTS)
0a07e705 9819 return value_zero (ada_aligned_type (type), lval_memory);
4c4b4cd2
PH
9820 return
9821 unwrap_value (ada_value_subscript
9822 (argvec[0], nargs, argvec + 1));
9823 }
9824 case TYPE_CODE_ARRAY:
9825 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9826 {
9827 type = ada_array_element_type (type, nargs);
9828 if (type == NULL)
323e0a4a 9829 error (_("element type of array unknown"));
4c4b4cd2 9830 else
0a07e705 9831 return value_zero (ada_aligned_type (type), lval_memory);
4c4b4cd2
PH
9832 }
9833 return
9834 unwrap_value (ada_value_subscript
9835 (ada_coerce_to_simple_array (argvec[0]),
9836 nargs, argvec + 1));
9837 case TYPE_CODE_PTR: /* Pointer to array */
9838 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
9839 if (noside == EVAL_AVOID_SIDE_EFFECTS)
9840 {
9841 type = ada_array_element_type (type, nargs);
9842 if (type == NULL)
323e0a4a 9843 error (_("element type of array unknown"));
4c4b4cd2 9844 else
0a07e705 9845 return value_zero (ada_aligned_type (type), lval_memory);
4c4b4cd2
PH
9846 }
9847 return
9848 unwrap_value (ada_value_ptr_subscript (argvec[0], type,
9849 nargs, argvec + 1));
9850
9851 default:
e1d5a0d2
PH
9852 error (_("Attempt to index or call something other than an "
9853 "array or function"));
4c4b4cd2
PH
9854 }
9855
9856 case TERNOP_SLICE:
9857 {
9858 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9859 struct value *low_bound_val =
9860 evaluate_subexp (NULL_TYPE, exp, pos, noside);
714e53ab
PH
9861 struct value *high_bound_val =
9862 evaluate_subexp (NULL_TYPE, exp, pos, noside);
9863 LONGEST low_bound;
9864 LONGEST high_bound;
5b4ee69b 9865
994b9211
AC
9866 low_bound_val = coerce_ref (low_bound_val);
9867 high_bound_val = coerce_ref (high_bound_val);
714e53ab
PH
9868 low_bound = pos_atr (low_bound_val);
9869 high_bound = pos_atr (high_bound_val);
963a6417 9870
4c4b4cd2
PH
9871 if (noside == EVAL_SKIP)
9872 goto nosideret;
9873
4c4b4cd2
PH
9874 /* If this is a reference to an aligner type, then remove all
9875 the aligners. */
df407dfe
AC
9876 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
9877 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
9878 TYPE_TARGET_TYPE (value_type (array)) =
9879 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
4c4b4cd2 9880
ad82864c 9881 if (ada_is_constrained_packed_array_type (value_type (array)))
323e0a4a 9882 error (_("cannot slice a packed array"));
4c4b4cd2
PH
9883
9884 /* If this is a reference to an array or an array lvalue,
9885 convert to a pointer. */
df407dfe
AC
9886 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
9887 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
4c4b4cd2
PH
9888 && VALUE_LVAL (array) == lval_memory))
9889 array = value_addr (array);
9890
1265e4aa 9891 if (noside == EVAL_AVOID_SIDE_EFFECTS
61ee279c 9892 && ada_is_array_descriptor_type (ada_check_typedef
df407dfe 9893 (value_type (array))))
0b5d8877 9894 return empty_array (ada_type_of_array (array, 0), low_bound);
4c4b4cd2
PH
9895
9896 array = ada_coerce_to_simple_array_ptr (array);
9897
714e53ab
PH
9898 /* If we have more than one level of pointer indirection,
9899 dereference the value until we get only one level. */
df407dfe
AC
9900 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
9901 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
714e53ab
PH
9902 == TYPE_CODE_PTR))
9903 array = value_ind (array);
9904
9905 /* Make sure we really do have an array type before going further,
9906 to avoid a SEGV when trying to get the index type or the target
9907 type later down the road if the debug info generated by
9908 the compiler is incorrect or incomplete. */
df407dfe 9909 if (!ada_is_simple_array_type (value_type (array)))
323e0a4a 9910 error (_("cannot take slice of non-array"));
714e53ab 9911
828292f2
JB
9912 if (TYPE_CODE (ada_check_typedef (value_type (array)))
9913 == TYPE_CODE_PTR)
4c4b4cd2 9914 {
828292f2
JB
9915 struct type *type0 = ada_check_typedef (value_type (array));
9916
0b5d8877 9917 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
828292f2 9918 return empty_array (TYPE_TARGET_TYPE (type0), low_bound);
4c4b4cd2
PH
9919 else
9920 {
9921 struct type *arr_type0 =
828292f2 9922 to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1);
5b4ee69b 9923
f5938064
JG
9924 return ada_value_slice_from_ptr (array, arr_type0,
9925 longest_to_int (low_bound),
9926 longest_to_int (high_bound));
4c4b4cd2
PH
9927 }
9928 }
9929 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9930 return array;
9931 else if (high_bound < low_bound)
df407dfe 9932 return empty_array (value_type (array), low_bound);
4c4b4cd2 9933 else
529cad9c
PH
9934 return ada_value_slice (array, longest_to_int (low_bound),
9935 longest_to_int (high_bound));
4c4b4cd2 9936 }
14f9c5c9 9937
4c4b4cd2
PH
9938 case UNOP_IN_RANGE:
9939 (*pos) += 2;
9940 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8008e265 9941 type = check_typedef (exp->elts[pc + 1].type);
14f9c5c9 9942
14f9c5c9 9943 if (noside == EVAL_SKIP)
4c4b4cd2 9944 goto nosideret;
14f9c5c9 9945
4c4b4cd2
PH
9946 switch (TYPE_CODE (type))
9947 {
9948 default:
e1d5a0d2
PH
9949 lim_warning (_("Membership test incompletely implemented; "
9950 "always returns true"));
fbb06eb1
UW
9951 type = language_bool_type (exp->language_defn, exp->gdbarch);
9952 return value_from_longest (type, (LONGEST) 1);
4c4b4cd2
PH
9953
9954 case TYPE_CODE_RANGE:
030b4912
UW
9955 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
9956 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
f44316fa
UW
9957 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9958 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
fbb06eb1
UW
9959 type = language_bool_type (exp->language_defn, exp->gdbarch);
9960 return
9961 value_from_longest (type,
4c4b4cd2
PH
9962 (value_less (arg1, arg3)
9963 || value_equal (arg1, arg3))
9964 && (value_less (arg2, arg1)
9965 || value_equal (arg2, arg1)));
9966 }
9967
9968 case BINOP_IN_BOUNDS:
14f9c5c9 9969 (*pos) += 2;
4c4b4cd2
PH
9970 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
9971 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
14f9c5c9 9972
4c4b4cd2
PH
9973 if (noside == EVAL_SKIP)
9974 goto nosideret;
14f9c5c9 9975
4c4b4cd2 9976 if (noside == EVAL_AVOID_SIDE_EFFECTS)
fbb06eb1
UW
9977 {
9978 type = language_bool_type (exp->language_defn, exp->gdbarch);
9979 return value_zero (type, not_lval);
9980 }
14f9c5c9 9981
4c4b4cd2 9982 tem = longest_to_int (exp->elts[pc + 1].longconst);
14f9c5c9 9983
1eea4ebd
UW
9984 type = ada_index_type (value_type (arg2), tem, "range");
9985 if (!type)
9986 type = value_type (arg1);
14f9c5c9 9987
1eea4ebd
UW
9988 arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1));
9989 arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0));
d2e4a39e 9990
f44316fa
UW
9991 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
9992 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
fbb06eb1 9993 type = language_bool_type (exp->language_defn, exp->gdbarch);
4c4b4cd2 9994 return
fbb06eb1 9995 value_from_longest (type,
4c4b4cd2
PH
9996 (value_less (arg1, arg3)
9997 || value_equal (arg1, arg3))
9998 && (value_less (arg2, arg1)
9999 || value_equal (arg2, arg1)));
10000
10001 case TERNOP_IN_RANGE:
10002 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10003 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10004 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10005
10006 if (noside == EVAL_SKIP)
10007 goto nosideret;
10008
f44316fa
UW
10009 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10010 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
fbb06eb1 10011 type = language_bool_type (exp->language_defn, exp->gdbarch);
4c4b4cd2 10012 return
fbb06eb1 10013 value_from_longest (type,
4c4b4cd2
PH
10014 (value_less (arg1, arg3)
10015 || value_equal (arg1, arg3))
10016 && (value_less (arg2, arg1)
10017 || value_equal (arg2, arg1)));
10018
10019 case OP_ATR_FIRST:
10020 case OP_ATR_LAST:
10021 case OP_ATR_LENGTH:
10022 {
76a01679 10023 struct type *type_arg;
5b4ee69b 10024
76a01679
JB
10025 if (exp->elts[*pos].opcode == OP_TYPE)
10026 {
10027 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
10028 arg1 = NULL;
5bc23cb3 10029 type_arg = check_typedef (exp->elts[pc + 2].type);
76a01679
JB
10030 }
10031 else
10032 {
10033 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10034 type_arg = NULL;
10035 }
10036
10037 if (exp->elts[*pos].opcode != OP_LONG)
323e0a4a 10038 error (_("Invalid operand to '%s"), ada_attribute_name (op));
76a01679
JB
10039 tem = longest_to_int (exp->elts[*pos + 2].longconst);
10040 *pos += 4;
10041
10042 if (noside == EVAL_SKIP)
10043 goto nosideret;
10044
10045 if (type_arg == NULL)
10046 {
10047 arg1 = ada_coerce_ref (arg1);
10048
ad82864c 10049 if (ada_is_constrained_packed_array_type (value_type (arg1)))
76a01679
JB
10050 arg1 = ada_coerce_to_simple_array (arg1);
10051
1eea4ebd
UW
10052 type = ada_index_type (value_type (arg1), tem,
10053 ada_attribute_name (op));
10054 if (type == NULL)
10055 type = builtin_type (exp->gdbarch)->builtin_int;
76a01679
JB
10056
10057 if (noside == EVAL_AVOID_SIDE_EFFECTS)
1eea4ebd 10058 return allocate_value (type);
76a01679
JB
10059
10060 switch (op)
10061 {
10062 default: /* Should never happen. */
323e0a4a 10063 error (_("unexpected attribute encountered"));
76a01679 10064 case OP_ATR_FIRST:
1eea4ebd
UW
10065 return value_from_longest
10066 (type, ada_array_bound (arg1, tem, 0));
76a01679 10067 case OP_ATR_LAST:
1eea4ebd
UW
10068 return value_from_longest
10069 (type, ada_array_bound (arg1, tem, 1));
76a01679 10070 case OP_ATR_LENGTH:
1eea4ebd
UW
10071 return value_from_longest
10072 (type, ada_array_length (arg1, tem));
76a01679
JB
10073 }
10074 }
10075 else if (discrete_type_p (type_arg))
10076 {
10077 struct type *range_type;
0d5cff50 10078 const char *name = ada_type_name (type_arg);
5b4ee69b 10079
76a01679
JB
10080 range_type = NULL;
10081 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
28c85d6c 10082 range_type = to_fixed_range_type (type_arg, NULL);
76a01679
JB
10083 if (range_type == NULL)
10084 range_type = type_arg;
10085 switch (op)
10086 {
10087 default:
323e0a4a 10088 error (_("unexpected attribute encountered"));
76a01679 10089 case OP_ATR_FIRST:
690cc4eb 10090 return value_from_longest
43bbcdc2 10091 (range_type, ada_discrete_type_low_bound (range_type));
76a01679 10092 case OP_ATR_LAST:
690cc4eb 10093 return value_from_longest
43bbcdc2 10094 (range_type, ada_discrete_type_high_bound (range_type));
76a01679 10095 case OP_ATR_LENGTH:
323e0a4a 10096 error (_("the 'length attribute applies only to array types"));
76a01679
JB
10097 }
10098 }
10099 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
323e0a4a 10100 error (_("unimplemented type attribute"));
76a01679
JB
10101 else
10102 {
10103 LONGEST low, high;
10104
ad82864c
JB
10105 if (ada_is_constrained_packed_array_type (type_arg))
10106 type_arg = decode_constrained_packed_array_type (type_arg);
76a01679 10107
1eea4ebd 10108 type = ada_index_type (type_arg, tem, ada_attribute_name (op));
76a01679 10109 if (type == NULL)
1eea4ebd
UW
10110 type = builtin_type (exp->gdbarch)->builtin_int;
10111
76a01679
JB
10112 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10113 return allocate_value (type);
10114
10115 switch (op)
10116 {
10117 default:
323e0a4a 10118 error (_("unexpected attribute encountered"));
76a01679 10119 case OP_ATR_FIRST:
1eea4ebd 10120 low = ada_array_bound_from_type (type_arg, tem, 0);
76a01679
JB
10121 return value_from_longest (type, low);
10122 case OP_ATR_LAST:
1eea4ebd 10123 high = ada_array_bound_from_type (type_arg, tem, 1);
76a01679
JB
10124 return value_from_longest (type, high);
10125 case OP_ATR_LENGTH:
1eea4ebd
UW
10126 low = ada_array_bound_from_type (type_arg, tem, 0);
10127 high = ada_array_bound_from_type (type_arg, tem, 1);
76a01679
JB
10128 return value_from_longest (type, high - low + 1);
10129 }
10130 }
14f9c5c9
AS
10131 }
10132
4c4b4cd2
PH
10133 case OP_ATR_TAG:
10134 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10135 if (noside == EVAL_SKIP)
76a01679 10136 goto nosideret;
4c4b4cd2
PH
10137
10138 if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 10139 return value_zero (ada_tag_type (arg1), not_lval);
4c4b4cd2
PH
10140
10141 return ada_value_tag (arg1);
10142
10143 case OP_ATR_MIN:
10144 case OP_ATR_MAX:
10145 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
14f9c5c9
AS
10146 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10147 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10148 if (noside == EVAL_SKIP)
76a01679 10149 goto nosideret;
d2e4a39e 10150 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
df407dfe 10151 return value_zero (value_type (arg1), not_lval);
14f9c5c9 10152 else
f44316fa
UW
10153 {
10154 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10155 return value_binop (arg1, arg2,
10156 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
10157 }
14f9c5c9 10158
4c4b4cd2
PH
10159 case OP_ATR_MODULUS:
10160 {
31dedfee 10161 struct type *type_arg = check_typedef (exp->elts[pc + 2].type);
4c4b4cd2 10162
5b4ee69b 10163 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
76a01679
JB
10164 if (noside == EVAL_SKIP)
10165 goto nosideret;
4c4b4cd2 10166
76a01679 10167 if (!ada_is_modular_type (type_arg))
323e0a4a 10168 error (_("'modulus must be applied to modular type"));
4c4b4cd2 10169
76a01679
JB
10170 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
10171 ada_modulus (type_arg));
4c4b4cd2
PH
10172 }
10173
10174
10175 case OP_ATR_POS:
10176 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
14f9c5c9
AS
10177 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10178 if (noside == EVAL_SKIP)
76a01679 10179 goto nosideret;
3cb382c9
UW
10180 type = builtin_type (exp->gdbarch)->builtin_int;
10181 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10182 return value_zero (type, not_lval);
14f9c5c9 10183 else
3cb382c9 10184 return value_pos_atr (type, arg1);
14f9c5c9 10185
4c4b4cd2
PH
10186 case OP_ATR_SIZE:
10187 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8c1c099f
JB
10188 type = value_type (arg1);
10189
10190 /* If the argument is a reference, then dereference its type, since
10191 the user is really asking for the size of the actual object,
10192 not the size of the pointer. */
10193 if (TYPE_CODE (type) == TYPE_CODE_REF)
10194 type = TYPE_TARGET_TYPE (type);
10195
4c4b4cd2 10196 if (noside == EVAL_SKIP)
76a01679 10197 goto nosideret;
4c4b4cd2 10198 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
22601c15 10199 return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval);
4c4b4cd2 10200 else
22601c15 10201 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int,
8c1c099f 10202 TARGET_CHAR_BIT * TYPE_LENGTH (type));
4c4b4cd2
PH
10203
10204 case OP_ATR_VAL:
10205 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
14f9c5c9 10206 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
4c4b4cd2 10207 type = exp->elts[pc + 2].type;
14f9c5c9 10208 if (noside == EVAL_SKIP)
76a01679 10209 goto nosideret;
4c4b4cd2 10210 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 10211 return value_zero (type, not_lval);
4c4b4cd2 10212 else
76a01679 10213 return value_val_atr (type, arg1);
4c4b4cd2
PH
10214
10215 case BINOP_EXP:
10216 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10217 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10218 if (noside == EVAL_SKIP)
10219 goto nosideret;
10220 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
df407dfe 10221 return value_zero (value_type (arg1), not_lval);
4c4b4cd2 10222 else
f44316fa
UW
10223 {
10224 /* For integer exponentiation operations,
10225 only promote the first argument. */
10226 if (is_integral_type (value_type (arg2)))
10227 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10228 else
10229 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10230
10231 return value_binop (arg1, arg2, op);
10232 }
4c4b4cd2
PH
10233
10234 case UNOP_PLUS:
10235 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10236 if (noside == EVAL_SKIP)
10237 goto nosideret;
10238 else
10239 return arg1;
10240
10241 case UNOP_ABS:
10242 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10243 if (noside == EVAL_SKIP)
10244 goto nosideret;
f44316fa 10245 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
df407dfe 10246 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
4c4b4cd2 10247 return value_neg (arg1);
14f9c5c9 10248 else
4c4b4cd2 10249 return arg1;
14f9c5c9
AS
10250
10251 case UNOP_IND:
6b0d7253 10252 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
14f9c5c9 10253 if (noside == EVAL_SKIP)
4c4b4cd2 10254 goto nosideret;
df407dfe 10255 type = ada_check_typedef (value_type (arg1));
14f9c5c9 10256 if (noside == EVAL_AVOID_SIDE_EFFECTS)
4c4b4cd2
PH
10257 {
10258 if (ada_is_array_descriptor_type (type))
10259 /* GDB allows dereferencing GNAT array descriptors. */
10260 {
10261 struct type *arrType = ada_type_of_array (arg1, 0);
5b4ee69b 10262
4c4b4cd2 10263 if (arrType == NULL)
323e0a4a 10264 error (_("Attempt to dereference null array pointer."));
00a4c844 10265 return value_at_lazy (arrType, 0);
4c4b4cd2
PH
10266 }
10267 else if (TYPE_CODE (type) == TYPE_CODE_PTR
10268 || TYPE_CODE (type) == TYPE_CODE_REF
10269 /* In C you can dereference an array to get the 1st elt. */
10270 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
714e53ab
PH
10271 {
10272 type = to_static_fixed_type
10273 (ada_aligned_type
10274 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
10275 check_size (type);
10276 return value_zero (type, lval_memory);
10277 }
4c4b4cd2 10278 else if (TYPE_CODE (type) == TYPE_CODE_INT)
6b0d7253
JB
10279 {
10280 /* GDB allows dereferencing an int. */
10281 if (expect_type == NULL)
10282 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
10283 lval_memory);
10284 else
10285 {
10286 expect_type =
10287 to_static_fixed_type (ada_aligned_type (expect_type));
10288 return value_zero (expect_type, lval_memory);
10289 }
10290 }
4c4b4cd2 10291 else
323e0a4a 10292 error (_("Attempt to take contents of a non-pointer value."));
4c4b4cd2 10293 }
0963b4bd 10294 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
df407dfe 10295 type = ada_check_typedef (value_type (arg1));
d2e4a39e 10296
96967637
JB
10297 if (TYPE_CODE (type) == TYPE_CODE_INT)
10298 /* GDB allows dereferencing an int. If we were given
10299 the expect_type, then use that as the target type.
10300 Otherwise, assume that the target type is an int. */
10301 {
10302 if (expect_type != NULL)
10303 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
10304 arg1));
10305 else
10306 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
10307 (CORE_ADDR) value_as_address (arg1));
10308 }
6b0d7253 10309
4c4b4cd2
PH
10310 if (ada_is_array_descriptor_type (type))
10311 /* GDB allows dereferencing GNAT array descriptors. */
10312 return ada_coerce_to_simple_array (arg1);
14f9c5c9 10313 else
4c4b4cd2 10314 return ada_value_ind (arg1);
14f9c5c9
AS
10315
10316 case STRUCTOP_STRUCT:
10317 tem = longest_to_int (exp->elts[pc + 1].longconst);
10318 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
10319 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10320 if (noside == EVAL_SKIP)
4c4b4cd2 10321 goto nosideret;
14f9c5c9 10322 if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 10323 {
df407dfe 10324 struct type *type1 = value_type (arg1);
5b4ee69b 10325
76a01679
JB
10326 if (ada_is_tagged_type (type1, 1))
10327 {
10328 type = ada_lookup_struct_elt_type (type1,
10329 &exp->elts[pc + 2].string,
10330 1, 1, NULL);
10331 if (type == NULL)
10332 /* In this case, we assume that the field COULD exist
10333 in some extension of the type. Return an object of
10334 "type" void, which will match any formal
0963b4bd 10335 (see ada_type_match). */
30b15541
UW
10336 return value_zero (builtin_type (exp->gdbarch)->builtin_void,
10337 lval_memory);
76a01679
JB
10338 }
10339 else
10340 type =
10341 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
10342 0, NULL);
10343
10344 return value_zero (ada_aligned_type (type), lval_memory);
10345 }
14f9c5c9 10346 else
284614f0
JB
10347 arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0);
10348 arg1 = unwrap_value (arg1);
10349 return ada_to_fixed_value (arg1);
10350
14f9c5c9 10351 case OP_TYPE:
4c4b4cd2
PH
10352 /* The value is not supposed to be used. This is here to make it
10353 easier to accommodate expressions that contain types. */
14f9c5c9
AS
10354 (*pos) += 2;
10355 if (noside == EVAL_SKIP)
4c4b4cd2 10356 goto nosideret;
14f9c5c9 10357 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
a6cfbe68 10358 return allocate_value (exp->elts[pc + 1].type);
14f9c5c9 10359 else
323e0a4a 10360 error (_("Attempt to use a type name as an expression"));
52ce6436
PH
10361
10362 case OP_AGGREGATE:
10363 case OP_CHOICES:
10364 case OP_OTHERS:
10365 case OP_DISCRETE_RANGE:
10366 case OP_POSITIONAL:
10367 case OP_NAME:
10368 if (noside == EVAL_NORMAL)
10369 switch (op)
10370 {
10371 case OP_NAME:
10372 error (_("Undefined name, ambiguous name, or renaming used in "
e1d5a0d2 10373 "component association: %s."), &exp->elts[pc+2].string);
52ce6436
PH
10374 case OP_AGGREGATE:
10375 error (_("Aggregates only allowed on the right of an assignment"));
10376 default:
0963b4bd
MS
10377 internal_error (__FILE__, __LINE__,
10378 _("aggregate apparently mangled"));
52ce6436
PH
10379 }
10380
10381 ada_forward_operator_length (exp, pc, &oplen, &nargs);
10382 *pos += oplen - 1;
10383 for (tem = 0; tem < nargs; tem += 1)
10384 ada_evaluate_subexp (NULL, exp, pos, noside);
10385 goto nosideret;
14f9c5c9
AS
10386 }
10387
10388nosideret:
22601c15 10389 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1);
14f9c5c9 10390}
14f9c5c9 10391\f
d2e4a39e 10392
4c4b4cd2 10393 /* Fixed point */
14f9c5c9
AS
10394
10395/* If TYPE encodes an Ada fixed-point type, return the suffix of the
10396 type name that encodes the 'small and 'delta information.
4c4b4cd2 10397 Otherwise, return NULL. */
14f9c5c9 10398
d2e4a39e 10399static const char *
ebf56fd3 10400fixed_type_info (struct type *type)
14f9c5c9 10401{
d2e4a39e 10402 const char *name = ada_type_name (type);
14f9c5c9
AS
10403 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
10404
d2e4a39e
AS
10405 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
10406 {
14f9c5c9 10407 const char *tail = strstr (name, "___XF_");
5b4ee69b 10408
14f9c5c9 10409 if (tail == NULL)
4c4b4cd2 10410 return NULL;
d2e4a39e 10411 else
4c4b4cd2 10412 return tail + 5;
14f9c5c9
AS
10413 }
10414 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
10415 return fixed_type_info (TYPE_TARGET_TYPE (type));
10416 else
10417 return NULL;
10418}
10419
4c4b4cd2 10420/* Returns non-zero iff TYPE represents an Ada fixed-point type. */
14f9c5c9
AS
10421
10422int
ebf56fd3 10423ada_is_fixed_point_type (struct type *type)
14f9c5c9
AS
10424{
10425 return fixed_type_info (type) != NULL;
10426}
10427
4c4b4cd2
PH
10428/* Return non-zero iff TYPE represents a System.Address type. */
10429
10430int
10431ada_is_system_address_type (struct type *type)
10432{
10433 return (TYPE_NAME (type)
10434 && strcmp (TYPE_NAME (type), "system__address") == 0);
10435}
10436
14f9c5c9
AS
10437/* Assuming that TYPE is the representation of an Ada fixed-point
10438 type, return its delta, or -1 if the type is malformed and the
4c4b4cd2 10439 delta cannot be determined. */
14f9c5c9
AS
10440
10441DOUBLEST
ebf56fd3 10442ada_delta (struct type *type)
14f9c5c9
AS
10443{
10444 const char *encoding = fixed_type_info (type);
facc390f 10445 DOUBLEST num, den;
14f9c5c9 10446
facc390f
JB
10447 /* Strictly speaking, num and den are encoded as integer. However,
10448 they may not fit into a long, and they will have to be converted
10449 to DOUBLEST anyway. So scan them as DOUBLEST. */
10450 if (sscanf (encoding, "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
10451 &num, &den) < 2)
14f9c5c9 10452 return -1.0;
d2e4a39e 10453 else
facc390f 10454 return num / den;
14f9c5c9
AS
10455}
10456
10457/* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
4c4b4cd2 10458 factor ('SMALL value) associated with the type. */
14f9c5c9
AS
10459
10460static DOUBLEST
ebf56fd3 10461scaling_factor (struct type *type)
14f9c5c9
AS
10462{
10463 const char *encoding = fixed_type_info (type);
facc390f 10464 DOUBLEST num0, den0, num1, den1;
14f9c5c9 10465 int n;
d2e4a39e 10466
facc390f
JB
10467 /* Strictly speaking, num's and den's are encoded as integer. However,
10468 they may not fit into a long, and they will have to be converted
10469 to DOUBLEST anyway. So scan them as DOUBLEST. */
10470 n = sscanf (encoding,
10471 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT
10472 "_%" DOUBLEST_SCAN_FORMAT "_%" DOUBLEST_SCAN_FORMAT,
10473 &num0, &den0, &num1, &den1);
14f9c5c9
AS
10474
10475 if (n < 2)
10476 return 1.0;
10477 else if (n == 4)
facc390f 10478 return num1 / den1;
d2e4a39e 10479 else
facc390f 10480 return num0 / den0;
14f9c5c9
AS
10481}
10482
10483
10484/* Assuming that X is the representation of a value of fixed-point
4c4b4cd2 10485 type TYPE, return its floating-point equivalent. */
14f9c5c9
AS
10486
10487DOUBLEST
ebf56fd3 10488ada_fixed_to_float (struct type *type, LONGEST x)
14f9c5c9 10489{
d2e4a39e 10490 return (DOUBLEST) x *scaling_factor (type);
14f9c5c9
AS
10491}
10492
4c4b4cd2
PH
10493/* The representation of a fixed-point value of type TYPE
10494 corresponding to the value X. */
14f9c5c9
AS
10495
10496LONGEST
ebf56fd3 10497ada_float_to_fixed (struct type *type, DOUBLEST x)
14f9c5c9
AS
10498{
10499 return (LONGEST) (x / scaling_factor (type) + 0.5);
10500}
10501
14f9c5c9 10502\f
d2e4a39e 10503
4c4b4cd2 10504 /* Range types */
14f9c5c9
AS
10505
10506/* Scan STR beginning at position K for a discriminant name, and
10507 return the value of that discriminant field of DVAL in *PX. If
10508 PNEW_K is not null, put the position of the character beyond the
10509 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
4c4b4cd2 10510 not alter *PX and *PNEW_K if unsuccessful. */
14f9c5c9
AS
10511
10512static int
07d8f827 10513scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
76a01679 10514 int *pnew_k)
14f9c5c9
AS
10515{
10516 static char *bound_buffer = NULL;
10517 static size_t bound_buffer_len = 0;
10518 char *bound;
10519 char *pend;
d2e4a39e 10520 struct value *bound_val;
14f9c5c9
AS
10521
10522 if (dval == NULL || str == NULL || str[k] == '\0')
10523 return 0;
10524
d2e4a39e 10525 pend = strstr (str + k, "__");
14f9c5c9
AS
10526 if (pend == NULL)
10527 {
d2e4a39e 10528 bound = str + k;
14f9c5c9
AS
10529 k += strlen (bound);
10530 }
d2e4a39e 10531 else
14f9c5c9 10532 {
d2e4a39e 10533 GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
14f9c5c9 10534 bound = bound_buffer;
d2e4a39e
AS
10535 strncpy (bound_buffer, str + k, pend - (str + k));
10536 bound[pend - (str + k)] = '\0';
10537 k = pend - str;
14f9c5c9 10538 }
d2e4a39e 10539
df407dfe 10540 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
14f9c5c9
AS
10541 if (bound_val == NULL)
10542 return 0;
10543
10544 *px = value_as_long (bound_val);
10545 if (pnew_k != NULL)
10546 *pnew_k = k;
10547 return 1;
10548}
10549
10550/* Value of variable named NAME in the current environment. If
10551 no such variable found, then if ERR_MSG is null, returns 0, and
4c4b4cd2
PH
10552 otherwise causes an error with message ERR_MSG. */
10553
d2e4a39e
AS
10554static struct value *
10555get_var_value (char *name, char *err_msg)
14f9c5c9 10556{
4c4b4cd2 10557 struct ada_symbol_info *syms;
14f9c5c9
AS
10558 int nsyms;
10559
4c4b4cd2 10560 nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
d9680e73 10561 &syms, 1);
14f9c5c9
AS
10562
10563 if (nsyms != 1)
10564 {
10565 if (err_msg == NULL)
4c4b4cd2 10566 return 0;
14f9c5c9 10567 else
8a3fe4f8 10568 error (("%s"), err_msg);
14f9c5c9
AS
10569 }
10570
4c4b4cd2 10571 return value_of_variable (syms[0].sym, syms[0].block);
14f9c5c9 10572}
d2e4a39e 10573
14f9c5c9 10574/* Value of integer variable named NAME in the current environment. If
4c4b4cd2
PH
10575 no such variable found, returns 0, and sets *FLAG to 0. If
10576 successful, sets *FLAG to 1. */
10577
14f9c5c9 10578LONGEST
4c4b4cd2 10579get_int_var_value (char *name, int *flag)
14f9c5c9 10580{
4c4b4cd2 10581 struct value *var_val = get_var_value (name, 0);
d2e4a39e 10582
14f9c5c9
AS
10583 if (var_val == 0)
10584 {
10585 if (flag != NULL)
4c4b4cd2 10586 *flag = 0;
14f9c5c9
AS
10587 return 0;
10588 }
10589 else
10590 {
10591 if (flag != NULL)
4c4b4cd2 10592 *flag = 1;
14f9c5c9
AS
10593 return value_as_long (var_val);
10594 }
10595}
d2e4a39e 10596
14f9c5c9
AS
10597
10598/* Return a range type whose base type is that of the range type named
10599 NAME in the current environment, and whose bounds are calculated
4c4b4cd2 10600 from NAME according to the GNAT range encoding conventions.
1ce677a4
UW
10601 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10602 corresponding range type from debug information; fall back to using it
10603 if symbol lookup fails. If a new type must be created, allocate it
10604 like ORIG_TYPE was. The bounds information, in general, is encoded
10605 in NAME, the base type given in the named range type. */
14f9c5c9 10606
d2e4a39e 10607static struct type *
28c85d6c 10608to_fixed_range_type (struct type *raw_type, struct value *dval)
14f9c5c9 10609{
0d5cff50 10610 const char *name;
14f9c5c9 10611 struct type *base_type;
d2e4a39e 10612 char *subtype_info;
14f9c5c9 10613
28c85d6c
JB
10614 gdb_assert (raw_type != NULL);
10615 gdb_assert (TYPE_NAME (raw_type) != NULL);
dddfab26 10616
1ce677a4 10617 if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
14f9c5c9
AS
10618 base_type = TYPE_TARGET_TYPE (raw_type);
10619 else
10620 base_type = raw_type;
10621
28c85d6c 10622 name = TYPE_NAME (raw_type);
14f9c5c9
AS
10623 subtype_info = strstr (name, "___XD");
10624 if (subtype_info == NULL)
690cc4eb 10625 {
43bbcdc2
PH
10626 LONGEST L = ada_discrete_type_low_bound (raw_type);
10627 LONGEST U = ada_discrete_type_high_bound (raw_type);
5b4ee69b 10628
690cc4eb
PH
10629 if (L < INT_MIN || U > INT_MAX)
10630 return raw_type;
10631 else
28c85d6c 10632 return create_range_type (alloc_type_copy (raw_type), raw_type,
43bbcdc2
PH
10633 ada_discrete_type_low_bound (raw_type),
10634 ada_discrete_type_high_bound (raw_type));
690cc4eb 10635 }
14f9c5c9
AS
10636 else
10637 {
10638 static char *name_buf = NULL;
10639 static size_t name_len = 0;
10640 int prefix_len = subtype_info - name;
10641 LONGEST L, U;
10642 struct type *type;
10643 char *bounds_str;
10644 int n;
10645
10646 GROW_VECT (name_buf, name_len, prefix_len + 5);
10647 strncpy (name_buf, name, prefix_len);
10648 name_buf[prefix_len] = '\0';
10649
10650 subtype_info += 5;
10651 bounds_str = strchr (subtype_info, '_');
10652 n = 1;
10653
d2e4a39e 10654 if (*subtype_info == 'L')
4c4b4cd2
PH
10655 {
10656 if (!ada_scan_number (bounds_str, n, &L, &n)
10657 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
10658 return raw_type;
10659 if (bounds_str[n] == '_')
10660 n += 2;
0963b4bd 10661 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
4c4b4cd2
PH
10662 n += 1;
10663 subtype_info += 1;
10664 }
d2e4a39e 10665 else
4c4b4cd2
PH
10666 {
10667 int ok;
5b4ee69b 10668
4c4b4cd2
PH
10669 strcpy (name_buf + prefix_len, "___L");
10670 L = get_int_var_value (name_buf, &ok);
10671 if (!ok)
10672 {
323e0a4a 10673 lim_warning (_("Unknown lower bound, using 1."));
4c4b4cd2
PH
10674 L = 1;
10675 }
10676 }
14f9c5c9 10677
d2e4a39e 10678 if (*subtype_info == 'U')
4c4b4cd2
PH
10679 {
10680 if (!ada_scan_number (bounds_str, n, &U, &n)
10681 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
10682 return raw_type;
10683 }
d2e4a39e 10684 else
4c4b4cd2
PH
10685 {
10686 int ok;
5b4ee69b 10687
4c4b4cd2
PH
10688 strcpy (name_buf + prefix_len, "___U");
10689 U = get_int_var_value (name_buf, &ok);
10690 if (!ok)
10691 {
323e0a4a 10692 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
4c4b4cd2
PH
10693 U = L;
10694 }
10695 }
14f9c5c9 10696
28c85d6c 10697 type = create_range_type (alloc_type_copy (raw_type), base_type, L, U);
d2e4a39e 10698 TYPE_NAME (type) = name;
14f9c5c9
AS
10699 return type;
10700 }
10701}
10702
4c4b4cd2
PH
10703/* True iff NAME is the name of a range type. */
10704
14f9c5c9 10705int
d2e4a39e 10706ada_is_range_type_name (const char *name)
14f9c5c9
AS
10707{
10708 return (name != NULL && strstr (name, "___XD"));
d2e4a39e 10709}
14f9c5c9 10710\f
d2e4a39e 10711
4c4b4cd2
PH
10712 /* Modular types */
10713
10714/* True iff TYPE is an Ada modular type. */
14f9c5c9 10715
14f9c5c9 10716int
d2e4a39e 10717ada_is_modular_type (struct type *type)
14f9c5c9 10718{
18af8284 10719 struct type *subranged_type = get_base_type (type);
14f9c5c9
AS
10720
10721 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
690cc4eb 10722 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
4c4b4cd2 10723 && TYPE_UNSIGNED (subranged_type));
14f9c5c9
AS
10724}
10725
4c4b4cd2
PH
10726/* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10727
61ee279c 10728ULONGEST
0056e4d5 10729ada_modulus (struct type *type)
14f9c5c9 10730{
43bbcdc2 10731 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
14f9c5c9 10732}
d2e4a39e 10733\f
f7f9143b
JB
10734
10735/* Ada exception catchpoint support:
10736 ---------------------------------
10737
10738 We support 3 kinds of exception catchpoints:
10739 . catchpoints on Ada exceptions
10740 . catchpoints on unhandled Ada exceptions
10741 . catchpoints on failed assertions
10742
10743 Exceptions raised during failed assertions, or unhandled exceptions
10744 could perfectly be caught with the general catchpoint on Ada exceptions.
10745 However, we can easily differentiate these two special cases, and having
10746 the option to distinguish these two cases from the rest can be useful
10747 to zero-in on certain situations.
10748
10749 Exception catchpoints are a specialized form of breakpoint,
10750 since they rely on inserting breakpoints inside known routines
10751 of the GNAT runtime. The implementation therefore uses a standard
10752 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10753 of breakpoint_ops.
10754
0259addd
JB
10755 Support in the runtime for exception catchpoints have been changed
10756 a few times already, and these changes affect the implementation
10757 of these catchpoints. In order to be able to support several
10758 variants of the runtime, we use a sniffer that will determine
28010a5d 10759 the runtime variant used by the program being debugged. */
f7f9143b
JB
10760
10761/* The different types of catchpoints that we introduced for catching
10762 Ada exceptions. */
10763
10764enum exception_catchpoint_kind
10765{
10766 ex_catch_exception,
10767 ex_catch_exception_unhandled,
10768 ex_catch_assert
10769};
10770
3d0b0fa3
JB
10771/* Ada's standard exceptions. */
10772
10773static char *standard_exc[] = {
10774 "constraint_error",
10775 "program_error",
10776 "storage_error",
10777 "tasking_error"
10778};
10779
0259addd
JB
10780typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
10781
10782/* A structure that describes how to support exception catchpoints
10783 for a given executable. */
10784
10785struct exception_support_info
10786{
10787 /* The name of the symbol to break on in order to insert
10788 a catchpoint on exceptions. */
10789 const char *catch_exception_sym;
10790
10791 /* The name of the symbol to break on in order to insert
10792 a catchpoint on unhandled exceptions. */
10793 const char *catch_exception_unhandled_sym;
10794
10795 /* The name of the symbol to break on in order to insert
10796 a catchpoint on failed assertions. */
10797 const char *catch_assert_sym;
10798
10799 /* Assuming that the inferior just triggered an unhandled exception
10800 catchpoint, this function is responsible for returning the address
10801 in inferior memory where the name of that exception is stored.
10802 Return zero if the address could not be computed. */
10803 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
10804};
10805
10806static CORE_ADDR ada_unhandled_exception_name_addr (void);
10807static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
10808
10809/* The following exception support info structure describes how to
10810 implement exception catchpoints with the latest version of the
10811 Ada runtime (as of 2007-03-06). */
10812
10813static const struct exception_support_info default_exception_support_info =
10814{
10815 "__gnat_debug_raise_exception", /* catch_exception_sym */
10816 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10817 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10818 ada_unhandled_exception_name_addr
10819};
10820
10821/* The following exception support info structure describes how to
10822 implement exception catchpoints with a slightly older version
10823 of the Ada runtime. */
10824
10825static const struct exception_support_info exception_support_info_fallback =
10826{
10827 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10828 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10829 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10830 ada_unhandled_exception_name_addr_from_raise
10831};
10832
f17011e0
JB
10833/* Return nonzero if we can detect the exception support routines
10834 described in EINFO.
10835
10836 This function errors out if an abnormal situation is detected
10837 (for instance, if we find the exception support routines, but
10838 that support is found to be incomplete). */
10839
10840static int
10841ada_has_this_exception_support (const struct exception_support_info *einfo)
10842{
10843 struct symbol *sym;
10844
10845 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10846 that should be compiled with debugging information. As a result, we
10847 expect to find that symbol in the symtabs. */
10848
10849 sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN);
10850 if (sym == NULL)
a6af7abe
JB
10851 {
10852 /* Perhaps we did not find our symbol because the Ada runtime was
10853 compiled without debugging info, or simply stripped of it.
10854 It happens on some GNU/Linux distributions for instance, where
10855 users have to install a separate debug package in order to get
10856 the runtime's debugging info. In that situation, let the user
10857 know why we cannot insert an Ada exception catchpoint.
10858
10859 Note: Just for the purpose of inserting our Ada exception
10860 catchpoint, we could rely purely on the associated minimal symbol.
10861 But we would be operating in degraded mode anyway, since we are
10862 still lacking the debugging info needed later on to extract
10863 the name of the exception being raised (this name is printed in
10864 the catchpoint message, and is also used when trying to catch
10865 a specific exception). We do not handle this case for now. */
10866 if (lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL))
10867 error (_("Your Ada runtime appears to be missing some debugging "
10868 "information.\nCannot insert Ada exception catchpoint "
10869 "in this configuration."));
10870
10871 return 0;
10872 }
f17011e0
JB
10873
10874 /* Make sure that the symbol we found corresponds to a function. */
10875
10876 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
10877 error (_("Symbol \"%s\" is not a function (class = %d)"),
10878 SYMBOL_LINKAGE_NAME (sym), SYMBOL_CLASS (sym));
10879
10880 return 1;
10881}
10882
0259addd
JB
10883/* Inspect the Ada runtime and determine which exception info structure
10884 should be used to provide support for exception catchpoints.
10885
3eecfa55
JB
10886 This function will always set the per-inferior exception_info,
10887 or raise an error. */
0259addd
JB
10888
10889static void
10890ada_exception_support_info_sniffer (void)
10891{
3eecfa55 10892 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
0259addd
JB
10893
10894 /* If the exception info is already known, then no need to recompute it. */
3eecfa55 10895 if (data->exception_info != NULL)
0259addd
JB
10896 return;
10897
10898 /* Check the latest (default) exception support info. */
f17011e0 10899 if (ada_has_this_exception_support (&default_exception_support_info))
0259addd 10900 {
3eecfa55 10901 data->exception_info = &default_exception_support_info;
0259addd
JB
10902 return;
10903 }
10904
10905 /* Try our fallback exception suport info. */
f17011e0 10906 if (ada_has_this_exception_support (&exception_support_info_fallback))
0259addd 10907 {
3eecfa55 10908 data->exception_info = &exception_support_info_fallback;
0259addd
JB
10909 return;
10910 }
10911
10912 /* Sometimes, it is normal for us to not be able to find the routine
10913 we are looking for. This happens when the program is linked with
10914 the shared version of the GNAT runtime, and the program has not been
10915 started yet. Inform the user of these two possible causes if
10916 applicable. */
10917
ccefe4c4 10918 if (ada_update_initial_language (language_unknown) != language_ada)
0259addd
JB
10919 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10920
10921 /* If the symbol does not exist, then check that the program is
10922 already started, to make sure that shared libraries have been
10923 loaded. If it is not started, this may mean that the symbol is
10924 in a shared library. */
10925
10926 if (ptid_get_pid (inferior_ptid) == 0)
10927 error (_("Unable to insert catchpoint. Try to start the program first."));
10928
10929 /* At this point, we know that we are debugging an Ada program and
10930 that the inferior has been started, but we still are not able to
0963b4bd 10931 find the run-time symbols. That can mean that we are in
0259addd
JB
10932 configurable run time mode, or that a-except as been optimized
10933 out by the linker... In any case, at this point it is not worth
10934 supporting this feature. */
10935
7dda8cff 10936 error (_("Cannot insert Ada exception catchpoints in this configuration."));
0259addd
JB
10937}
10938
f7f9143b
JB
10939/* True iff FRAME is very likely to be that of a function that is
10940 part of the runtime system. This is all very heuristic, but is
10941 intended to be used as advice as to what frames are uninteresting
10942 to most users. */
10943
10944static int
10945is_known_support_routine (struct frame_info *frame)
10946{
4ed6b5be 10947 struct symtab_and_line sal;
0d5cff50 10948 const char *func_name;
692465f1 10949 enum language func_lang;
f7f9143b 10950 int i;
f7f9143b 10951
4ed6b5be
JB
10952 /* If this code does not have any debugging information (no symtab),
10953 This cannot be any user code. */
f7f9143b 10954
4ed6b5be 10955 find_frame_sal (frame, &sal);
f7f9143b
JB
10956 if (sal.symtab == NULL)
10957 return 1;
10958
4ed6b5be
JB
10959 /* If there is a symtab, but the associated source file cannot be
10960 located, then assume this is not user code: Selecting a frame
10961 for which we cannot display the code would not be very helpful
10962 for the user. This should also take care of case such as VxWorks
10963 where the kernel has some debugging info provided for a few units. */
f7f9143b 10964
9bbc9174 10965 if (symtab_to_fullname (sal.symtab) == NULL)
f7f9143b
JB
10966 return 1;
10967
4ed6b5be
JB
10968 /* Check the unit filename againt the Ada runtime file naming.
10969 We also check the name of the objfile against the name of some
10970 known system libraries that sometimes come with debugging info
10971 too. */
10972
f7f9143b
JB
10973 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
10974 {
10975 re_comp (known_runtime_file_name_patterns[i]);
f69c91ad 10976 if (re_exec (lbasename (sal.symtab->filename)))
f7f9143b 10977 return 1;
4ed6b5be
JB
10978 if (sal.symtab->objfile != NULL
10979 && re_exec (sal.symtab->objfile->name))
10980 return 1;
f7f9143b
JB
10981 }
10982
4ed6b5be 10983 /* Check whether the function is a GNAT-generated entity. */
f7f9143b 10984
e9e07ba6 10985 find_frame_funname (frame, &func_name, &func_lang, NULL);
f7f9143b
JB
10986 if (func_name == NULL)
10987 return 1;
10988
10989 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
10990 {
10991 re_comp (known_auxiliary_function_name_patterns[i]);
10992 if (re_exec (func_name))
10993 return 1;
10994 }
10995
10996 return 0;
10997}
10998
10999/* Find the first frame that contains debugging information and that is not
11000 part of the Ada run-time, starting from FI and moving upward. */
11001
0ef643c8 11002void
f7f9143b
JB
11003ada_find_printable_frame (struct frame_info *fi)
11004{
11005 for (; fi != NULL; fi = get_prev_frame (fi))
11006 {
11007 if (!is_known_support_routine (fi))
11008 {
11009 select_frame (fi);
11010 break;
11011 }
11012 }
11013
11014}
11015
11016/* Assuming that the inferior just triggered an unhandled exception
11017 catchpoint, return the address in inferior memory where the name
11018 of the exception is stored.
11019
11020 Return zero if the address could not be computed. */
11021
11022static CORE_ADDR
11023ada_unhandled_exception_name_addr (void)
0259addd
JB
11024{
11025 return parse_and_eval_address ("e.full_name");
11026}
11027
11028/* Same as ada_unhandled_exception_name_addr, except that this function
11029 should be used when the inferior uses an older version of the runtime,
11030 where the exception name needs to be extracted from a specific frame
11031 several frames up in the callstack. */
11032
11033static CORE_ADDR
11034ada_unhandled_exception_name_addr_from_raise (void)
f7f9143b
JB
11035{
11036 int frame_level;
11037 struct frame_info *fi;
3eecfa55 11038 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
f7f9143b
JB
11039
11040 /* To determine the name of this exception, we need to select
11041 the frame corresponding to RAISE_SYM_NAME. This frame is
11042 at least 3 levels up, so we simply skip the first 3 frames
11043 without checking the name of their associated function. */
11044 fi = get_current_frame ();
11045 for (frame_level = 0; frame_level < 3; frame_level += 1)
11046 if (fi != NULL)
11047 fi = get_prev_frame (fi);
11048
11049 while (fi != NULL)
11050 {
0d5cff50 11051 const char *func_name;
692465f1
JB
11052 enum language func_lang;
11053
e9e07ba6 11054 find_frame_funname (fi, &func_name, &func_lang, NULL);
f7f9143b 11055 if (func_name != NULL
3eecfa55 11056 && strcmp (func_name, data->exception_info->catch_exception_sym) == 0)
f7f9143b
JB
11057 break; /* We found the frame we were looking for... */
11058 fi = get_prev_frame (fi);
11059 }
11060
11061 if (fi == NULL)
11062 return 0;
11063
11064 select_frame (fi);
11065 return parse_and_eval_address ("id.full_name");
11066}
11067
11068/* Assuming the inferior just triggered an Ada exception catchpoint
11069 (of any type), return the address in inferior memory where the name
11070 of the exception is stored, if applicable.
11071
11072 Return zero if the address could not be computed, or if not relevant. */
11073
11074static CORE_ADDR
11075ada_exception_name_addr_1 (enum exception_catchpoint_kind ex,
11076 struct breakpoint *b)
11077{
3eecfa55
JB
11078 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
11079
f7f9143b
JB
11080 switch (ex)
11081 {
11082 case ex_catch_exception:
11083 return (parse_and_eval_address ("e.full_name"));
11084 break;
11085
11086 case ex_catch_exception_unhandled:
3eecfa55 11087 return data->exception_info->unhandled_exception_name_addr ();
f7f9143b
JB
11088 break;
11089
11090 case ex_catch_assert:
11091 return 0; /* Exception name is not relevant in this case. */
11092 break;
11093
11094 default:
11095 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11096 break;
11097 }
11098
11099 return 0; /* Should never be reached. */
11100}
11101
11102/* Same as ada_exception_name_addr_1, except that it intercepts and contains
11103 any error that ada_exception_name_addr_1 might cause to be thrown.
11104 When an error is intercepted, a warning with the error message is printed,
11105 and zero is returned. */
11106
11107static CORE_ADDR
11108ada_exception_name_addr (enum exception_catchpoint_kind ex,
11109 struct breakpoint *b)
11110{
bfd189b1 11111 volatile struct gdb_exception e;
f7f9143b
JB
11112 CORE_ADDR result = 0;
11113
11114 TRY_CATCH (e, RETURN_MASK_ERROR)
11115 {
11116 result = ada_exception_name_addr_1 (ex, b);
11117 }
11118
11119 if (e.reason < 0)
11120 {
11121 warning (_("failed to get exception name: %s"), e.message);
11122 return 0;
11123 }
11124
11125 return result;
11126}
11127
28010a5d
PA
11128static struct symtab_and_line ada_exception_sal (enum exception_catchpoint_kind,
11129 char *, char **,
c0a91b2b 11130 const struct breakpoint_ops **);
28010a5d
PA
11131static char *ada_exception_catchpoint_cond_string (const char *excep_string);
11132
11133/* Ada catchpoints.
11134
11135 In the case of catchpoints on Ada exceptions, the catchpoint will
11136 stop the target on every exception the program throws. When a user
11137 specifies the name of a specific exception, we translate this
11138 request into a condition expression (in text form), and then parse
11139 it into an expression stored in each of the catchpoint's locations.
11140 We then use this condition to check whether the exception that was
11141 raised is the one the user is interested in. If not, then the
11142 target is resumed again. We store the name of the requested
11143 exception, in order to be able to re-set the condition expression
11144 when symbols change. */
11145
11146/* An instance of this type is used to represent an Ada catchpoint
11147 breakpoint location. It includes a "struct bp_location" as a kind
11148 of base class; users downcast to "struct bp_location *" when
11149 needed. */
11150
11151struct ada_catchpoint_location
11152{
11153 /* The base class. */
11154 struct bp_location base;
11155
11156 /* The condition that checks whether the exception that was raised
11157 is the specific exception the user specified on catchpoint
11158 creation. */
11159 struct expression *excep_cond_expr;
11160};
11161
11162/* Implement the DTOR method in the bp_location_ops structure for all
11163 Ada exception catchpoint kinds. */
11164
11165static void
11166ada_catchpoint_location_dtor (struct bp_location *bl)
11167{
11168 struct ada_catchpoint_location *al = (struct ada_catchpoint_location *) bl;
11169
11170 xfree (al->excep_cond_expr);
11171}
11172
11173/* The vtable to be used in Ada catchpoint locations. */
11174
11175static const struct bp_location_ops ada_catchpoint_location_ops =
11176{
11177 ada_catchpoint_location_dtor
11178};
11179
11180/* An instance of this type is used to represent an Ada catchpoint.
11181 It includes a "struct breakpoint" as a kind of base class; users
11182 downcast to "struct breakpoint *" when needed. */
11183
11184struct ada_catchpoint
11185{
11186 /* The base class. */
11187 struct breakpoint base;
11188
11189 /* The name of the specific exception the user specified. */
11190 char *excep_string;
11191};
11192
11193/* Parse the exception condition string in the context of each of the
11194 catchpoint's locations, and store them for later evaluation. */
11195
11196static void
11197create_excep_cond_exprs (struct ada_catchpoint *c)
11198{
11199 struct cleanup *old_chain;
11200 struct bp_location *bl;
11201 char *cond_string;
11202
11203 /* Nothing to do if there's no specific exception to catch. */
11204 if (c->excep_string == NULL)
11205 return;
11206
11207 /* Same if there are no locations... */
11208 if (c->base.loc == NULL)
11209 return;
11210
11211 /* Compute the condition expression in text form, from the specific
11212 expection we want to catch. */
11213 cond_string = ada_exception_catchpoint_cond_string (c->excep_string);
11214 old_chain = make_cleanup (xfree, cond_string);
11215
11216 /* Iterate over all the catchpoint's locations, and parse an
11217 expression for each. */
11218 for (bl = c->base.loc; bl != NULL; bl = bl->next)
11219 {
11220 struct ada_catchpoint_location *ada_loc
11221 = (struct ada_catchpoint_location *) bl;
11222 struct expression *exp = NULL;
11223
11224 if (!bl->shlib_disabled)
11225 {
11226 volatile struct gdb_exception e;
11227 char *s;
11228
11229 s = cond_string;
11230 TRY_CATCH (e, RETURN_MASK_ERROR)
11231 {
1bb9788d
TT
11232 exp = parse_exp_1 (&s, bl->address,
11233 block_for_pc (bl->address), 0);
28010a5d
PA
11234 }
11235 if (e.reason < 0)
11236 warning (_("failed to reevaluate internal exception condition "
11237 "for catchpoint %d: %s"),
11238 c->base.number, e.message);
11239 }
11240
11241 ada_loc->excep_cond_expr = exp;
11242 }
11243
11244 do_cleanups (old_chain);
11245}
11246
11247/* Implement the DTOR method in the breakpoint_ops structure for all
11248 exception catchpoint kinds. */
11249
11250static void
11251dtor_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
11252{
11253 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11254
11255 xfree (c->excep_string);
348d480f 11256
2060206e 11257 bkpt_breakpoint_ops.dtor (b);
28010a5d
PA
11258}
11259
11260/* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11261 structure for all exception catchpoint kinds. */
11262
11263static struct bp_location *
11264allocate_location_exception (enum exception_catchpoint_kind ex,
11265 struct breakpoint *self)
11266{
11267 struct ada_catchpoint_location *loc;
11268
11269 loc = XNEW (struct ada_catchpoint_location);
11270 init_bp_location (&loc->base, &ada_catchpoint_location_ops, self);
11271 loc->excep_cond_expr = NULL;
11272 return &loc->base;
11273}
11274
11275/* Implement the RE_SET method in the breakpoint_ops structure for all
11276 exception catchpoint kinds. */
11277
11278static void
11279re_set_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
11280{
11281 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11282
11283 /* Call the base class's method. This updates the catchpoint's
11284 locations. */
2060206e 11285 bkpt_breakpoint_ops.re_set (b);
28010a5d
PA
11286
11287 /* Reparse the exception conditional expressions. One for each
11288 location. */
11289 create_excep_cond_exprs (c);
11290}
11291
11292/* Returns true if we should stop for this breakpoint hit. If the
11293 user specified a specific exception, we only want to cause a stop
11294 if the program thrown that exception. */
11295
11296static int
11297should_stop_exception (const struct bp_location *bl)
11298{
11299 struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner;
11300 const struct ada_catchpoint_location *ada_loc
11301 = (const struct ada_catchpoint_location *) bl;
11302 volatile struct gdb_exception ex;
11303 int stop;
11304
11305 /* With no specific exception, should always stop. */
11306 if (c->excep_string == NULL)
11307 return 1;
11308
11309 if (ada_loc->excep_cond_expr == NULL)
11310 {
11311 /* We will have a NULL expression if back when we were creating
11312 the expressions, this location's had failed to parse. */
11313 return 1;
11314 }
11315
11316 stop = 1;
11317 TRY_CATCH (ex, RETURN_MASK_ALL)
11318 {
11319 struct value *mark;
11320
11321 mark = value_mark ();
11322 stop = value_true (evaluate_expression (ada_loc->excep_cond_expr));
11323 value_free_to_mark (mark);
11324 }
11325 if (ex.reason < 0)
11326 exception_fprintf (gdb_stderr, ex,
11327 _("Error in testing exception condition:\n"));
11328 return stop;
11329}
11330
11331/* Implement the CHECK_STATUS method in the breakpoint_ops structure
11332 for all exception catchpoint kinds. */
11333
11334static void
11335check_status_exception (enum exception_catchpoint_kind ex, bpstat bs)
11336{
11337 bs->stop = should_stop_exception (bs->bp_location_at);
11338}
11339
f7f9143b
JB
11340/* Implement the PRINT_IT method in the breakpoint_ops structure
11341 for all exception catchpoint kinds. */
11342
11343static enum print_stop_action
348d480f 11344print_it_exception (enum exception_catchpoint_kind ex, bpstat bs)
f7f9143b 11345{
79a45e25 11346 struct ui_out *uiout = current_uiout;
348d480f
PA
11347 struct breakpoint *b = bs->breakpoint_at;
11348
956a9fb9 11349 annotate_catchpoint (b->number);
f7f9143b 11350
956a9fb9 11351 if (ui_out_is_mi_like_p (uiout))
f7f9143b 11352 {
956a9fb9
JB
11353 ui_out_field_string (uiout, "reason",
11354 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT));
11355 ui_out_field_string (uiout, "disp", bpdisp_text (b->disposition));
f7f9143b
JB
11356 }
11357
00eb2c4a
JB
11358 ui_out_text (uiout,
11359 b->disposition == disp_del ? "\nTemporary catchpoint "
11360 : "\nCatchpoint ");
956a9fb9
JB
11361 ui_out_field_int (uiout, "bkptno", b->number);
11362 ui_out_text (uiout, ", ");
f7f9143b 11363
f7f9143b
JB
11364 switch (ex)
11365 {
11366 case ex_catch_exception:
f7f9143b 11367 case ex_catch_exception_unhandled:
956a9fb9
JB
11368 {
11369 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
11370 char exception_name[256];
11371
11372 if (addr != 0)
11373 {
11374 read_memory (addr, exception_name, sizeof (exception_name) - 1);
11375 exception_name [sizeof (exception_name) - 1] = '\0';
11376 }
11377 else
11378 {
11379 /* For some reason, we were unable to read the exception
11380 name. This could happen if the Runtime was compiled
11381 without debugging info, for instance. In that case,
11382 just replace the exception name by the generic string
11383 "exception" - it will read as "an exception" in the
11384 notification we are about to print. */
967cff16 11385 memcpy (exception_name, "exception", sizeof ("exception"));
956a9fb9
JB
11386 }
11387 /* In the case of unhandled exception breakpoints, we print
11388 the exception name as "unhandled EXCEPTION_NAME", to make
11389 it clearer to the user which kind of catchpoint just got
11390 hit. We used ui_out_text to make sure that this extra
11391 info does not pollute the exception name in the MI case. */
11392 if (ex == ex_catch_exception_unhandled)
11393 ui_out_text (uiout, "unhandled ");
11394 ui_out_field_string (uiout, "exception-name", exception_name);
11395 }
11396 break;
f7f9143b 11397 case ex_catch_assert:
956a9fb9
JB
11398 /* In this case, the name of the exception is not really
11399 important. Just print "failed assertion" to make it clearer
11400 that his program just hit an assertion-failure catchpoint.
11401 We used ui_out_text because this info does not belong in
11402 the MI output. */
11403 ui_out_text (uiout, "failed assertion");
11404 break;
f7f9143b 11405 }
956a9fb9
JB
11406 ui_out_text (uiout, " at ");
11407 ada_find_printable_frame (get_current_frame ());
f7f9143b
JB
11408
11409 return PRINT_SRC_AND_LOC;
11410}
11411
11412/* Implement the PRINT_ONE method in the breakpoint_ops structure
11413 for all exception catchpoint kinds. */
11414
11415static void
11416print_one_exception (enum exception_catchpoint_kind ex,
a6d9a66e 11417 struct breakpoint *b, struct bp_location **last_loc)
f7f9143b 11418{
79a45e25 11419 struct ui_out *uiout = current_uiout;
28010a5d 11420 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
79a45b7d
TT
11421 struct value_print_options opts;
11422
11423 get_user_print_options (&opts);
11424 if (opts.addressprint)
f7f9143b
JB
11425 {
11426 annotate_field (4);
5af949e3 11427 ui_out_field_core_addr (uiout, "addr", b->loc->gdbarch, b->loc->address);
f7f9143b
JB
11428 }
11429
11430 annotate_field (5);
a6d9a66e 11431 *last_loc = b->loc;
f7f9143b
JB
11432 switch (ex)
11433 {
11434 case ex_catch_exception:
28010a5d 11435 if (c->excep_string != NULL)
f7f9143b 11436 {
28010a5d
PA
11437 char *msg = xstrprintf (_("`%s' Ada exception"), c->excep_string);
11438
f7f9143b
JB
11439 ui_out_field_string (uiout, "what", msg);
11440 xfree (msg);
11441 }
11442 else
11443 ui_out_field_string (uiout, "what", "all Ada exceptions");
11444
11445 break;
11446
11447 case ex_catch_exception_unhandled:
11448 ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
11449 break;
11450
11451 case ex_catch_assert:
11452 ui_out_field_string (uiout, "what", "failed Ada assertions");
11453 break;
11454
11455 default:
11456 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11457 break;
11458 }
11459}
11460
11461/* Implement the PRINT_MENTION method in the breakpoint_ops structure
11462 for all exception catchpoint kinds. */
11463
11464static void
11465print_mention_exception (enum exception_catchpoint_kind ex,
11466 struct breakpoint *b)
11467{
28010a5d 11468 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
79a45e25 11469 struct ui_out *uiout = current_uiout;
28010a5d 11470
00eb2c4a
JB
11471 ui_out_text (uiout, b->disposition == disp_del ? _("Temporary catchpoint ")
11472 : _("Catchpoint "));
11473 ui_out_field_int (uiout, "bkptno", b->number);
11474 ui_out_text (uiout, ": ");
11475
f7f9143b
JB
11476 switch (ex)
11477 {
11478 case ex_catch_exception:
28010a5d 11479 if (c->excep_string != NULL)
00eb2c4a
JB
11480 {
11481 char *info = xstrprintf (_("`%s' Ada exception"), c->excep_string);
11482 struct cleanup *old_chain = make_cleanup (xfree, info);
11483
11484 ui_out_text (uiout, info);
11485 do_cleanups (old_chain);
11486 }
f7f9143b 11487 else
00eb2c4a 11488 ui_out_text (uiout, _("all Ada exceptions"));
f7f9143b
JB
11489 break;
11490
11491 case ex_catch_exception_unhandled:
00eb2c4a 11492 ui_out_text (uiout, _("unhandled Ada exceptions"));
f7f9143b
JB
11493 break;
11494
11495 case ex_catch_assert:
00eb2c4a 11496 ui_out_text (uiout, _("failed Ada assertions"));
f7f9143b
JB
11497 break;
11498
11499 default:
11500 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11501 break;
11502 }
11503}
11504
6149aea9
PA
11505/* Implement the PRINT_RECREATE method in the breakpoint_ops structure
11506 for all exception catchpoint kinds. */
11507
11508static void
11509print_recreate_exception (enum exception_catchpoint_kind ex,
11510 struct breakpoint *b, struct ui_file *fp)
11511{
28010a5d
PA
11512 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
11513
6149aea9
PA
11514 switch (ex)
11515 {
11516 case ex_catch_exception:
11517 fprintf_filtered (fp, "catch exception");
28010a5d
PA
11518 if (c->excep_string != NULL)
11519 fprintf_filtered (fp, " %s", c->excep_string);
6149aea9
PA
11520 break;
11521
11522 case ex_catch_exception_unhandled:
78076abc 11523 fprintf_filtered (fp, "catch exception unhandled");
6149aea9
PA
11524 break;
11525
11526 case ex_catch_assert:
11527 fprintf_filtered (fp, "catch assert");
11528 break;
11529
11530 default:
11531 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
11532 }
d9b3f62e 11533 print_recreate_thread (b, fp);
6149aea9
PA
11534}
11535
f7f9143b
JB
11536/* Virtual table for "catch exception" breakpoints. */
11537
28010a5d
PA
11538static void
11539dtor_catch_exception (struct breakpoint *b)
11540{
11541 dtor_exception (ex_catch_exception, b);
11542}
11543
11544static struct bp_location *
11545allocate_location_catch_exception (struct breakpoint *self)
11546{
11547 return allocate_location_exception (ex_catch_exception, self);
11548}
11549
11550static void
11551re_set_catch_exception (struct breakpoint *b)
11552{
11553 re_set_exception (ex_catch_exception, b);
11554}
11555
11556static void
11557check_status_catch_exception (bpstat bs)
11558{
11559 check_status_exception (ex_catch_exception, bs);
11560}
11561
f7f9143b 11562static enum print_stop_action
348d480f 11563print_it_catch_exception (bpstat bs)
f7f9143b 11564{
348d480f 11565 return print_it_exception (ex_catch_exception, bs);
f7f9143b
JB
11566}
11567
11568static void
a6d9a66e 11569print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc)
f7f9143b 11570{
a6d9a66e 11571 print_one_exception (ex_catch_exception, b, last_loc);
f7f9143b
JB
11572}
11573
11574static void
11575print_mention_catch_exception (struct breakpoint *b)
11576{
11577 print_mention_exception (ex_catch_exception, b);
11578}
11579
6149aea9
PA
11580static void
11581print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp)
11582{
11583 print_recreate_exception (ex_catch_exception, b, fp);
11584}
11585
2060206e 11586static struct breakpoint_ops catch_exception_breakpoint_ops;
f7f9143b
JB
11587
11588/* Virtual table for "catch exception unhandled" breakpoints. */
11589
28010a5d
PA
11590static void
11591dtor_catch_exception_unhandled (struct breakpoint *b)
11592{
11593 dtor_exception (ex_catch_exception_unhandled, b);
11594}
11595
11596static struct bp_location *
11597allocate_location_catch_exception_unhandled (struct breakpoint *self)
11598{
11599 return allocate_location_exception (ex_catch_exception_unhandled, self);
11600}
11601
11602static void
11603re_set_catch_exception_unhandled (struct breakpoint *b)
11604{
11605 re_set_exception (ex_catch_exception_unhandled, b);
11606}
11607
11608static void
11609check_status_catch_exception_unhandled (bpstat bs)
11610{
11611 check_status_exception (ex_catch_exception_unhandled, bs);
11612}
11613
f7f9143b 11614static enum print_stop_action
348d480f 11615print_it_catch_exception_unhandled (bpstat bs)
f7f9143b 11616{
348d480f 11617 return print_it_exception (ex_catch_exception_unhandled, bs);
f7f9143b
JB
11618}
11619
11620static void
a6d9a66e
UW
11621print_one_catch_exception_unhandled (struct breakpoint *b,
11622 struct bp_location **last_loc)
f7f9143b 11623{
a6d9a66e 11624 print_one_exception (ex_catch_exception_unhandled, b, last_loc);
f7f9143b
JB
11625}
11626
11627static void
11628print_mention_catch_exception_unhandled (struct breakpoint *b)
11629{
11630 print_mention_exception (ex_catch_exception_unhandled, b);
11631}
11632
6149aea9
PA
11633static void
11634print_recreate_catch_exception_unhandled (struct breakpoint *b,
11635 struct ui_file *fp)
11636{
11637 print_recreate_exception (ex_catch_exception_unhandled, b, fp);
11638}
11639
2060206e 11640static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops;
f7f9143b
JB
11641
11642/* Virtual table for "catch assert" breakpoints. */
11643
28010a5d
PA
11644static void
11645dtor_catch_assert (struct breakpoint *b)
11646{
11647 dtor_exception (ex_catch_assert, b);
11648}
11649
11650static struct bp_location *
11651allocate_location_catch_assert (struct breakpoint *self)
11652{
11653 return allocate_location_exception (ex_catch_assert, self);
11654}
11655
11656static void
11657re_set_catch_assert (struct breakpoint *b)
11658{
11659 return re_set_exception (ex_catch_assert, b);
11660}
11661
11662static void
11663check_status_catch_assert (bpstat bs)
11664{
11665 check_status_exception (ex_catch_assert, bs);
11666}
11667
f7f9143b 11668static enum print_stop_action
348d480f 11669print_it_catch_assert (bpstat bs)
f7f9143b 11670{
348d480f 11671 return print_it_exception (ex_catch_assert, bs);
f7f9143b
JB
11672}
11673
11674static void
a6d9a66e 11675print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc)
f7f9143b 11676{
a6d9a66e 11677 print_one_exception (ex_catch_assert, b, last_loc);
f7f9143b
JB
11678}
11679
11680static void
11681print_mention_catch_assert (struct breakpoint *b)
11682{
11683 print_mention_exception (ex_catch_assert, b);
11684}
11685
6149aea9
PA
11686static void
11687print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp)
11688{
11689 print_recreate_exception (ex_catch_assert, b, fp);
11690}
11691
2060206e 11692static struct breakpoint_ops catch_assert_breakpoint_ops;
f7f9143b 11693
f7f9143b
JB
11694/* Return a newly allocated copy of the first space-separated token
11695 in ARGSP, and then adjust ARGSP to point immediately after that
11696 token.
11697
11698 Return NULL if ARGPS does not contain any more tokens. */
11699
11700static char *
11701ada_get_next_arg (char **argsp)
11702{
11703 char *args = *argsp;
11704 char *end;
11705 char *result;
11706
0fcd72ba 11707 args = skip_spaces (args);
f7f9143b
JB
11708 if (args[0] == '\0')
11709 return NULL; /* No more arguments. */
11710
11711 /* Find the end of the current argument. */
11712
0fcd72ba 11713 end = skip_to_space (args);
f7f9143b
JB
11714
11715 /* Adjust ARGSP to point to the start of the next argument. */
11716
11717 *argsp = end;
11718
11719 /* Make a copy of the current argument and return it. */
11720
11721 result = xmalloc (end - args + 1);
11722 strncpy (result, args, end - args);
11723 result[end - args] = '\0';
11724
11725 return result;
11726}
11727
11728/* Split the arguments specified in a "catch exception" command.
11729 Set EX to the appropriate catchpoint type.
28010a5d 11730 Set EXCEP_STRING to the name of the specific exception if
5845583d
JB
11731 specified by the user.
11732 If a condition is found at the end of the arguments, the condition
11733 expression is stored in COND_STRING (memory must be deallocated
11734 after use). Otherwise COND_STRING is set to NULL. */
f7f9143b
JB
11735
11736static void
11737catch_ada_exception_command_split (char *args,
11738 enum exception_catchpoint_kind *ex,
5845583d
JB
11739 char **excep_string,
11740 char **cond_string)
f7f9143b
JB
11741{
11742 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
11743 char *exception_name;
5845583d 11744 char *cond = NULL;
f7f9143b
JB
11745
11746 exception_name = ada_get_next_arg (&args);
5845583d
JB
11747 if (exception_name != NULL && strcmp (exception_name, "if") == 0)
11748 {
11749 /* This is not an exception name; this is the start of a condition
11750 expression for a catchpoint on all exceptions. So, "un-get"
11751 this token, and set exception_name to NULL. */
11752 xfree (exception_name);
11753 exception_name = NULL;
11754 args -= 2;
11755 }
f7f9143b
JB
11756 make_cleanup (xfree, exception_name);
11757
5845583d 11758 /* Check to see if we have a condition. */
f7f9143b 11759
0fcd72ba 11760 args = skip_spaces (args);
5845583d
JB
11761 if (strncmp (args, "if", 2) == 0
11762 && (isspace (args[2]) || args[2] == '\0'))
11763 {
11764 args += 2;
11765 args = skip_spaces (args);
11766
11767 if (args[0] == '\0')
11768 error (_("Condition missing after `if' keyword"));
11769 cond = xstrdup (args);
11770 make_cleanup (xfree, cond);
11771
11772 args += strlen (args);
11773 }
11774
11775 /* Check that we do not have any more arguments. Anything else
11776 is unexpected. */
f7f9143b
JB
11777
11778 if (args[0] != '\0')
11779 error (_("Junk at end of expression"));
11780
11781 discard_cleanups (old_chain);
11782
11783 if (exception_name == NULL)
11784 {
11785 /* Catch all exceptions. */
11786 *ex = ex_catch_exception;
28010a5d 11787 *excep_string = NULL;
f7f9143b
JB
11788 }
11789 else if (strcmp (exception_name, "unhandled") == 0)
11790 {
11791 /* Catch unhandled exceptions. */
11792 *ex = ex_catch_exception_unhandled;
28010a5d 11793 *excep_string = NULL;
f7f9143b
JB
11794 }
11795 else
11796 {
11797 /* Catch a specific exception. */
11798 *ex = ex_catch_exception;
28010a5d 11799 *excep_string = exception_name;
f7f9143b 11800 }
5845583d 11801 *cond_string = cond;
f7f9143b
JB
11802}
11803
11804/* Return the name of the symbol on which we should break in order to
11805 implement a catchpoint of the EX kind. */
11806
11807static const char *
11808ada_exception_sym_name (enum exception_catchpoint_kind ex)
11809{
3eecfa55
JB
11810 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
11811
11812 gdb_assert (data->exception_info != NULL);
0259addd 11813
f7f9143b
JB
11814 switch (ex)
11815 {
11816 case ex_catch_exception:
3eecfa55 11817 return (data->exception_info->catch_exception_sym);
f7f9143b
JB
11818 break;
11819 case ex_catch_exception_unhandled:
3eecfa55 11820 return (data->exception_info->catch_exception_unhandled_sym);
f7f9143b
JB
11821 break;
11822 case ex_catch_assert:
3eecfa55 11823 return (data->exception_info->catch_assert_sym);
f7f9143b
JB
11824 break;
11825 default:
11826 internal_error (__FILE__, __LINE__,
11827 _("unexpected catchpoint kind (%d)"), ex);
11828 }
11829}
11830
11831/* Return the breakpoint ops "virtual table" used for catchpoints
11832 of the EX kind. */
11833
c0a91b2b 11834static const struct breakpoint_ops *
4b9eee8c 11835ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex)
f7f9143b
JB
11836{
11837 switch (ex)
11838 {
11839 case ex_catch_exception:
11840 return (&catch_exception_breakpoint_ops);
11841 break;
11842 case ex_catch_exception_unhandled:
11843 return (&catch_exception_unhandled_breakpoint_ops);
11844 break;
11845 case ex_catch_assert:
11846 return (&catch_assert_breakpoint_ops);
11847 break;
11848 default:
11849 internal_error (__FILE__, __LINE__,
11850 _("unexpected catchpoint kind (%d)"), ex);
11851 }
11852}
11853
11854/* Return the condition that will be used to match the current exception
11855 being raised with the exception that the user wants to catch. This
11856 assumes that this condition is used when the inferior just triggered
11857 an exception catchpoint.
11858
11859 The string returned is a newly allocated string that needs to be
11860 deallocated later. */
11861
11862static char *
28010a5d 11863ada_exception_catchpoint_cond_string (const char *excep_string)
f7f9143b 11864{
3d0b0fa3
JB
11865 int i;
11866
0963b4bd 11867 /* The standard exceptions are a special case. They are defined in
3d0b0fa3 11868 runtime units that have been compiled without debugging info; if
28010a5d 11869 EXCEP_STRING is the not-fully-qualified name of a standard
3d0b0fa3
JB
11870 exception (e.g. "constraint_error") then, during the evaluation
11871 of the condition expression, the symbol lookup on this name would
0963b4bd 11872 *not* return this standard exception. The catchpoint condition
3d0b0fa3
JB
11873 may then be set only on user-defined exceptions which have the
11874 same not-fully-qualified name (e.g. my_package.constraint_error).
11875
11876 To avoid this unexcepted behavior, these standard exceptions are
0963b4bd 11877 systematically prefixed by "standard". This means that "catch
3d0b0fa3
JB
11878 exception constraint_error" is rewritten into "catch exception
11879 standard.constraint_error".
11880
11881 If an exception named contraint_error is defined in another package of
11882 the inferior program, then the only way to specify this exception as a
11883 breakpoint condition is to use its fully-qualified named:
11884 e.g. my_package.constraint_error. */
11885
11886 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
11887 {
28010a5d 11888 if (strcmp (standard_exc [i], excep_string) == 0)
3d0b0fa3
JB
11889 {
11890 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
28010a5d 11891 excep_string);
3d0b0fa3
JB
11892 }
11893 }
28010a5d 11894 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string);
f7f9143b
JB
11895}
11896
11897/* Return the symtab_and_line that should be used to insert an exception
11898 catchpoint of the TYPE kind.
11899
28010a5d
PA
11900 EXCEP_STRING should contain the name of a specific exception that
11901 the catchpoint should catch, or NULL otherwise.
f7f9143b 11902
28010a5d
PA
11903 ADDR_STRING returns the name of the function where the real
11904 breakpoint that implements the catchpoints is set, depending on the
11905 type of catchpoint we need to create. */
f7f9143b
JB
11906
11907static struct symtab_and_line
28010a5d 11908ada_exception_sal (enum exception_catchpoint_kind ex, char *excep_string,
c0a91b2b 11909 char **addr_string, const struct breakpoint_ops **ops)
f7f9143b
JB
11910{
11911 const char *sym_name;
11912 struct symbol *sym;
f7f9143b 11913
0259addd
JB
11914 /* First, find out which exception support info to use. */
11915 ada_exception_support_info_sniffer ();
11916
11917 /* Then lookup the function on which we will break in order to catch
f7f9143b 11918 the Ada exceptions requested by the user. */
f7f9143b
JB
11919 sym_name = ada_exception_sym_name (ex);
11920 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
11921
f17011e0
JB
11922 /* We can assume that SYM is not NULL at this stage. If the symbol
11923 did not exist, ada_exception_support_info_sniffer would have
11924 raised an exception.
f7f9143b 11925
f17011e0
JB
11926 Also, ada_exception_support_info_sniffer should have already
11927 verified that SYM is a function symbol. */
11928 gdb_assert (sym != NULL);
11929 gdb_assert (SYMBOL_CLASS (sym) == LOC_BLOCK);
f7f9143b
JB
11930
11931 /* Set ADDR_STRING. */
f7f9143b
JB
11932 *addr_string = xstrdup (sym_name);
11933
f7f9143b 11934 /* Set OPS. */
4b9eee8c 11935 *ops = ada_exception_breakpoint_ops (ex);
f7f9143b 11936
f17011e0 11937 return find_function_start_sal (sym, 1);
f7f9143b
JB
11938}
11939
11940/* Parse the arguments (ARGS) of the "catch exception" command.
11941
f7f9143b
JB
11942 If the user asked the catchpoint to catch only a specific
11943 exception, then save the exception name in ADDR_STRING.
11944
5845583d
JB
11945 If the user provided a condition, then set COND_STRING to
11946 that condition expression (the memory must be deallocated
11947 after use). Otherwise, set COND_STRING to NULL.
11948
f7f9143b
JB
11949 See ada_exception_sal for a description of all the remaining
11950 function arguments of this function. */
11951
9ac4176b 11952static struct symtab_and_line
f7f9143b 11953ada_decode_exception_location (char *args, char **addr_string,
28010a5d 11954 char **excep_string,
5845583d 11955 char **cond_string,
c0a91b2b 11956 const struct breakpoint_ops **ops)
f7f9143b
JB
11957{
11958 enum exception_catchpoint_kind ex;
11959
5845583d 11960 catch_ada_exception_command_split (args, &ex, excep_string, cond_string);
28010a5d
PA
11961 return ada_exception_sal (ex, *excep_string, addr_string, ops);
11962}
11963
11964/* Create an Ada exception catchpoint. */
11965
11966static void
11967create_ada_exception_catchpoint (struct gdbarch *gdbarch,
11968 struct symtab_and_line sal,
11969 char *addr_string,
11970 char *excep_string,
5845583d 11971 char *cond_string,
c0a91b2b 11972 const struct breakpoint_ops *ops,
28010a5d
PA
11973 int tempflag,
11974 int from_tty)
11975{
11976 struct ada_catchpoint *c;
11977
11978 c = XNEW (struct ada_catchpoint);
11979 init_ada_exception_breakpoint (&c->base, gdbarch, sal, addr_string,
11980 ops, tempflag, from_tty);
11981 c->excep_string = excep_string;
11982 create_excep_cond_exprs (c);
5845583d
JB
11983 if (cond_string != NULL)
11984 set_breakpoint_condition (&c->base, cond_string, from_tty);
3ea46bff 11985 install_breakpoint (0, &c->base, 1);
f7f9143b
JB
11986}
11987
9ac4176b
PA
11988/* Implement the "catch exception" command. */
11989
11990static void
11991catch_ada_exception_command (char *arg, int from_tty,
11992 struct cmd_list_element *command)
11993{
11994 struct gdbarch *gdbarch = get_current_arch ();
11995 int tempflag;
11996 struct symtab_and_line sal;
11997 char *addr_string = NULL;
28010a5d 11998 char *excep_string = NULL;
5845583d 11999 char *cond_string = NULL;
c0a91b2b 12000 const struct breakpoint_ops *ops = NULL;
9ac4176b
PA
12001
12002 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
12003
12004 if (!arg)
12005 arg = "";
5845583d
JB
12006 sal = ada_decode_exception_location (arg, &addr_string, &excep_string,
12007 &cond_string, &ops);
28010a5d 12008 create_ada_exception_catchpoint (gdbarch, sal, addr_string,
5845583d
JB
12009 excep_string, cond_string, ops,
12010 tempflag, from_tty);
9ac4176b
PA
12011}
12012
5845583d
JB
12013/* Assuming that ARGS contains the arguments of a "catch assert"
12014 command, parse those arguments and return a symtab_and_line object
12015 for a failed assertion catchpoint.
12016
12017 Set ADDR_STRING to the name of the function where the real
12018 breakpoint that implements the catchpoint is set.
12019
12020 If ARGS contains a condition, set COND_STRING to that condition
12021 (the memory needs to be deallocated after use). Otherwise, set
12022 COND_STRING to NULL. */
12023
9ac4176b 12024static struct symtab_and_line
f7f9143b 12025ada_decode_assert_location (char *args, char **addr_string,
5845583d 12026 char **cond_string,
c0a91b2b 12027 const struct breakpoint_ops **ops)
f7f9143b 12028{
5845583d 12029 args = skip_spaces (args);
f7f9143b 12030
5845583d
JB
12031 /* Check whether a condition was provided. */
12032 if (strncmp (args, "if", 2) == 0
12033 && (isspace (args[2]) || args[2] == '\0'))
f7f9143b 12034 {
5845583d 12035 args += 2;
0fcd72ba 12036 args = skip_spaces (args);
5845583d
JB
12037 if (args[0] == '\0')
12038 error (_("condition missing after `if' keyword"));
12039 *cond_string = xstrdup (args);
f7f9143b
JB
12040 }
12041
5845583d
JB
12042 /* Otherwise, there should be no other argument at the end of
12043 the command. */
12044 else if (args[0] != '\0')
12045 error (_("Junk at end of arguments."));
12046
28010a5d 12047 return ada_exception_sal (ex_catch_assert, NULL, addr_string, ops);
f7f9143b
JB
12048}
12049
9ac4176b
PA
12050/* Implement the "catch assert" command. */
12051
12052static void
12053catch_assert_command (char *arg, int from_tty,
12054 struct cmd_list_element *command)
12055{
12056 struct gdbarch *gdbarch = get_current_arch ();
12057 int tempflag;
12058 struct symtab_and_line sal;
12059 char *addr_string = NULL;
5845583d 12060 char *cond_string = NULL;
c0a91b2b 12061 const struct breakpoint_ops *ops = NULL;
9ac4176b
PA
12062
12063 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
12064
12065 if (!arg)
12066 arg = "";
5845583d 12067 sal = ada_decode_assert_location (arg, &addr_string, &cond_string, &ops);
28010a5d 12068 create_ada_exception_catchpoint (gdbarch, sal, addr_string,
5845583d
JB
12069 NULL, cond_string, ops, tempflag,
12070 from_tty);
9ac4176b 12071}
4c4b4cd2
PH
12072 /* Operators */
12073/* Information about operators given special treatment in functions
12074 below. */
12075/* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
12076
12077#define ADA_OPERATORS \
12078 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
12079 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
12080 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
12081 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
12082 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
12083 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
12084 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
12085 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
12086 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
12087 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
12088 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
12089 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
12090 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
12091 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
12092 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
52ce6436
PH
12093 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
12094 OP_DEFN (OP_OTHERS, 1, 1, 0) \
12095 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
12096 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
4c4b4cd2
PH
12097
12098static void
554794dc
SDJ
12099ada_operator_length (const struct expression *exp, int pc, int *oplenp,
12100 int *argsp)
4c4b4cd2
PH
12101{
12102 switch (exp->elts[pc - 1].opcode)
12103 {
76a01679 12104 default:
4c4b4cd2
PH
12105 operator_length_standard (exp, pc, oplenp, argsp);
12106 break;
12107
12108#define OP_DEFN(op, len, args, binop) \
12109 case op: *oplenp = len; *argsp = args; break;
12110 ADA_OPERATORS;
12111#undef OP_DEFN
52ce6436
PH
12112
12113 case OP_AGGREGATE:
12114 *oplenp = 3;
12115 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
12116 break;
12117
12118 case OP_CHOICES:
12119 *oplenp = 3;
12120 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
12121 break;
4c4b4cd2
PH
12122 }
12123}
12124
c0201579
JK
12125/* Implementation of the exp_descriptor method operator_check. */
12126
12127static int
12128ada_operator_check (struct expression *exp, int pos,
12129 int (*objfile_func) (struct objfile *objfile, void *data),
12130 void *data)
12131{
12132 const union exp_element *const elts = exp->elts;
12133 struct type *type = NULL;
12134
12135 switch (elts[pos].opcode)
12136 {
12137 case UNOP_IN_RANGE:
12138 case UNOP_QUAL:
12139 type = elts[pos + 1].type;
12140 break;
12141
12142 default:
12143 return operator_check_standard (exp, pos, objfile_func, data);
12144 }
12145
12146 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
12147
12148 if (type && TYPE_OBJFILE (type)
12149 && (*objfile_func) (TYPE_OBJFILE (type), data))
12150 return 1;
12151
12152 return 0;
12153}
12154
4c4b4cd2
PH
12155static char *
12156ada_op_name (enum exp_opcode opcode)
12157{
12158 switch (opcode)
12159 {
76a01679 12160 default:
4c4b4cd2 12161 return op_name_standard (opcode);
52ce6436 12162
4c4b4cd2
PH
12163#define OP_DEFN(op, len, args, binop) case op: return #op;
12164 ADA_OPERATORS;
12165#undef OP_DEFN
52ce6436
PH
12166
12167 case OP_AGGREGATE:
12168 return "OP_AGGREGATE";
12169 case OP_CHOICES:
12170 return "OP_CHOICES";
12171 case OP_NAME:
12172 return "OP_NAME";
4c4b4cd2
PH
12173 }
12174}
12175
12176/* As for operator_length, but assumes PC is pointing at the first
12177 element of the operator, and gives meaningful results only for the
52ce6436 12178 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
4c4b4cd2
PH
12179
12180static void
76a01679
JB
12181ada_forward_operator_length (struct expression *exp, int pc,
12182 int *oplenp, int *argsp)
4c4b4cd2 12183{
76a01679 12184 switch (exp->elts[pc].opcode)
4c4b4cd2
PH
12185 {
12186 default:
12187 *oplenp = *argsp = 0;
12188 break;
52ce6436 12189
4c4b4cd2
PH
12190#define OP_DEFN(op, len, args, binop) \
12191 case op: *oplenp = len; *argsp = args; break;
12192 ADA_OPERATORS;
12193#undef OP_DEFN
52ce6436
PH
12194
12195 case OP_AGGREGATE:
12196 *oplenp = 3;
12197 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
12198 break;
12199
12200 case OP_CHOICES:
12201 *oplenp = 3;
12202 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
12203 break;
12204
12205 case OP_STRING:
12206 case OP_NAME:
12207 {
12208 int len = longest_to_int (exp->elts[pc + 1].longconst);
5b4ee69b 12209
52ce6436
PH
12210 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
12211 *argsp = 0;
12212 break;
12213 }
4c4b4cd2
PH
12214 }
12215}
12216
12217static int
12218ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
12219{
12220 enum exp_opcode op = exp->elts[elt].opcode;
12221 int oplen, nargs;
12222 int pc = elt;
12223 int i;
76a01679 12224
4c4b4cd2
PH
12225 ada_forward_operator_length (exp, elt, &oplen, &nargs);
12226
76a01679 12227 switch (op)
4c4b4cd2 12228 {
76a01679 12229 /* Ada attributes ('Foo). */
4c4b4cd2
PH
12230 case OP_ATR_FIRST:
12231 case OP_ATR_LAST:
12232 case OP_ATR_LENGTH:
12233 case OP_ATR_IMAGE:
12234 case OP_ATR_MAX:
12235 case OP_ATR_MIN:
12236 case OP_ATR_MODULUS:
12237 case OP_ATR_POS:
12238 case OP_ATR_SIZE:
12239 case OP_ATR_TAG:
12240 case OP_ATR_VAL:
12241 break;
12242
12243 case UNOP_IN_RANGE:
12244 case UNOP_QUAL:
323e0a4a
AC
12245 /* XXX: gdb_sprint_host_address, type_sprint */
12246 fprintf_filtered (stream, _("Type @"));
4c4b4cd2
PH
12247 gdb_print_host_address (exp->elts[pc + 1].type, stream);
12248 fprintf_filtered (stream, " (");
12249 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
12250 fprintf_filtered (stream, ")");
12251 break;
12252 case BINOP_IN_BOUNDS:
52ce6436
PH
12253 fprintf_filtered (stream, " (%d)",
12254 longest_to_int (exp->elts[pc + 2].longconst));
4c4b4cd2
PH
12255 break;
12256 case TERNOP_IN_RANGE:
12257 break;
12258
52ce6436
PH
12259 case OP_AGGREGATE:
12260 case OP_OTHERS:
12261 case OP_DISCRETE_RANGE:
12262 case OP_POSITIONAL:
12263 case OP_CHOICES:
12264 break;
12265
12266 case OP_NAME:
12267 case OP_STRING:
12268 {
12269 char *name = &exp->elts[elt + 2].string;
12270 int len = longest_to_int (exp->elts[elt + 1].longconst);
5b4ee69b 12271
52ce6436
PH
12272 fprintf_filtered (stream, "Text: `%.*s'", len, name);
12273 break;
12274 }
12275
4c4b4cd2
PH
12276 default:
12277 return dump_subexp_body_standard (exp, stream, elt);
12278 }
12279
12280 elt += oplen;
12281 for (i = 0; i < nargs; i += 1)
12282 elt = dump_subexp (exp, stream, elt);
12283
12284 return elt;
12285}
12286
12287/* The Ada extension of print_subexp (q.v.). */
12288
76a01679
JB
12289static void
12290ada_print_subexp (struct expression *exp, int *pos,
12291 struct ui_file *stream, enum precedence prec)
4c4b4cd2 12292{
52ce6436 12293 int oplen, nargs, i;
4c4b4cd2
PH
12294 int pc = *pos;
12295 enum exp_opcode op = exp->elts[pc].opcode;
12296
12297 ada_forward_operator_length (exp, pc, &oplen, &nargs);
12298
52ce6436 12299 *pos += oplen;
4c4b4cd2
PH
12300 switch (op)
12301 {
12302 default:
52ce6436 12303 *pos -= oplen;
4c4b4cd2
PH
12304 print_subexp_standard (exp, pos, stream, prec);
12305 return;
12306
12307 case OP_VAR_VALUE:
4c4b4cd2
PH
12308 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
12309 return;
12310
12311 case BINOP_IN_BOUNDS:
323e0a4a 12312 /* XXX: sprint_subexp */
4c4b4cd2 12313 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 12314 fputs_filtered (" in ", stream);
4c4b4cd2 12315 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 12316 fputs_filtered ("'range", stream);
4c4b4cd2 12317 if (exp->elts[pc + 1].longconst > 1)
76a01679
JB
12318 fprintf_filtered (stream, "(%ld)",
12319 (long) exp->elts[pc + 1].longconst);
4c4b4cd2
PH
12320 return;
12321
12322 case TERNOP_IN_RANGE:
4c4b4cd2 12323 if (prec >= PREC_EQUAL)
76a01679 12324 fputs_filtered ("(", stream);
323e0a4a 12325 /* XXX: sprint_subexp */
4c4b4cd2 12326 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 12327 fputs_filtered (" in ", stream);
4c4b4cd2
PH
12328 print_subexp (exp, pos, stream, PREC_EQUAL);
12329 fputs_filtered (" .. ", stream);
12330 print_subexp (exp, pos, stream, PREC_EQUAL);
12331 if (prec >= PREC_EQUAL)
76a01679
JB
12332 fputs_filtered (")", stream);
12333 return;
4c4b4cd2
PH
12334
12335 case OP_ATR_FIRST:
12336 case OP_ATR_LAST:
12337 case OP_ATR_LENGTH:
12338 case OP_ATR_IMAGE:
12339 case OP_ATR_MAX:
12340 case OP_ATR_MIN:
12341 case OP_ATR_MODULUS:
12342 case OP_ATR_POS:
12343 case OP_ATR_SIZE:
12344 case OP_ATR_TAG:
12345 case OP_ATR_VAL:
4c4b4cd2 12346 if (exp->elts[*pos].opcode == OP_TYPE)
76a01679
JB
12347 {
12348 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
12349 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0);
12350 *pos += 3;
12351 }
4c4b4cd2 12352 else
76a01679 12353 print_subexp (exp, pos, stream, PREC_SUFFIX);
4c4b4cd2
PH
12354 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
12355 if (nargs > 1)
76a01679
JB
12356 {
12357 int tem;
5b4ee69b 12358
76a01679
JB
12359 for (tem = 1; tem < nargs; tem += 1)
12360 {
12361 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
12362 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
12363 }
12364 fputs_filtered (")", stream);
12365 }
4c4b4cd2 12366 return;
14f9c5c9 12367
4c4b4cd2 12368 case UNOP_QUAL:
4c4b4cd2
PH
12369 type_print (exp->elts[pc + 1].type, "", stream, 0);
12370 fputs_filtered ("'(", stream);
12371 print_subexp (exp, pos, stream, PREC_PREFIX);
12372 fputs_filtered (")", stream);
12373 return;
14f9c5c9 12374
4c4b4cd2 12375 case UNOP_IN_RANGE:
323e0a4a 12376 /* XXX: sprint_subexp */
4c4b4cd2 12377 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 12378 fputs_filtered (" in ", stream);
4c4b4cd2
PH
12379 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0);
12380 return;
52ce6436
PH
12381
12382 case OP_DISCRETE_RANGE:
12383 print_subexp (exp, pos, stream, PREC_SUFFIX);
12384 fputs_filtered ("..", stream);
12385 print_subexp (exp, pos, stream, PREC_SUFFIX);
12386 return;
12387
12388 case OP_OTHERS:
12389 fputs_filtered ("others => ", stream);
12390 print_subexp (exp, pos, stream, PREC_SUFFIX);
12391 return;
12392
12393 case OP_CHOICES:
12394 for (i = 0; i < nargs-1; i += 1)
12395 {
12396 if (i > 0)
12397 fputs_filtered ("|", stream);
12398 print_subexp (exp, pos, stream, PREC_SUFFIX);
12399 }
12400 fputs_filtered (" => ", stream);
12401 print_subexp (exp, pos, stream, PREC_SUFFIX);
12402 return;
12403
12404 case OP_POSITIONAL:
12405 print_subexp (exp, pos, stream, PREC_SUFFIX);
12406 return;
12407
12408 case OP_AGGREGATE:
12409 fputs_filtered ("(", stream);
12410 for (i = 0; i < nargs; i += 1)
12411 {
12412 if (i > 0)
12413 fputs_filtered (", ", stream);
12414 print_subexp (exp, pos, stream, PREC_SUFFIX);
12415 }
12416 fputs_filtered (")", stream);
12417 return;
4c4b4cd2
PH
12418 }
12419}
14f9c5c9
AS
12420
12421/* Table mapping opcodes into strings for printing operators
12422 and precedences of the operators. */
12423
d2e4a39e
AS
12424static const struct op_print ada_op_print_tab[] = {
12425 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
12426 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
12427 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
12428 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
12429 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
12430 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
12431 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
12432 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
12433 {"<=", BINOP_LEQ, PREC_ORDER, 0},
12434 {">=", BINOP_GEQ, PREC_ORDER, 0},
12435 {">", BINOP_GTR, PREC_ORDER, 0},
12436 {"<", BINOP_LESS, PREC_ORDER, 0},
12437 {">>", BINOP_RSH, PREC_SHIFT, 0},
12438 {"<<", BINOP_LSH, PREC_SHIFT, 0},
12439 {"+", BINOP_ADD, PREC_ADD, 0},
12440 {"-", BINOP_SUB, PREC_ADD, 0},
12441 {"&", BINOP_CONCAT, PREC_ADD, 0},
12442 {"*", BINOP_MUL, PREC_MUL, 0},
12443 {"/", BINOP_DIV, PREC_MUL, 0},
12444 {"rem", BINOP_REM, PREC_MUL, 0},
12445 {"mod", BINOP_MOD, PREC_MUL, 0},
12446 {"**", BINOP_EXP, PREC_REPEAT, 0},
12447 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
12448 {"-", UNOP_NEG, PREC_PREFIX, 0},
12449 {"+", UNOP_PLUS, PREC_PREFIX, 0},
12450 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
12451 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
12452 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
4c4b4cd2
PH
12453 {".all", UNOP_IND, PREC_SUFFIX, 1},
12454 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
12455 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
d2e4a39e 12456 {NULL, 0, 0, 0}
14f9c5c9
AS
12457};
12458\f
72d5681a
PH
12459enum ada_primitive_types {
12460 ada_primitive_type_int,
12461 ada_primitive_type_long,
12462 ada_primitive_type_short,
12463 ada_primitive_type_char,
12464 ada_primitive_type_float,
12465 ada_primitive_type_double,
12466 ada_primitive_type_void,
12467 ada_primitive_type_long_long,
12468 ada_primitive_type_long_double,
12469 ada_primitive_type_natural,
12470 ada_primitive_type_positive,
12471 ada_primitive_type_system_address,
12472 nr_ada_primitive_types
12473};
6c038f32
PH
12474
12475static void
d4a9a881 12476ada_language_arch_info (struct gdbarch *gdbarch,
72d5681a
PH
12477 struct language_arch_info *lai)
12478{
d4a9a881 12479 const struct builtin_type *builtin = builtin_type (gdbarch);
5b4ee69b 12480
72d5681a 12481 lai->primitive_type_vector
d4a9a881 12482 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
72d5681a 12483 struct type *);
e9bb382b
UW
12484
12485 lai->primitive_type_vector [ada_primitive_type_int]
12486 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
12487 0, "integer");
12488 lai->primitive_type_vector [ada_primitive_type_long]
12489 = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch),
12490 0, "long_integer");
12491 lai->primitive_type_vector [ada_primitive_type_short]
12492 = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch),
12493 0, "short_integer");
12494 lai->string_char_type
12495 = lai->primitive_type_vector [ada_primitive_type_char]
12496 = arch_integer_type (gdbarch, TARGET_CHAR_BIT, 0, "character");
12497 lai->primitive_type_vector [ada_primitive_type_float]
12498 = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch),
12499 "float", NULL);
12500 lai->primitive_type_vector [ada_primitive_type_double]
12501 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
12502 "long_float", NULL);
12503 lai->primitive_type_vector [ada_primitive_type_long_long]
12504 = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch),
12505 0, "long_long_integer");
12506 lai->primitive_type_vector [ada_primitive_type_long_double]
12507 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
12508 "long_long_float", NULL);
12509 lai->primitive_type_vector [ada_primitive_type_natural]
12510 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
12511 0, "natural");
12512 lai->primitive_type_vector [ada_primitive_type_positive]
12513 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
12514 0, "positive");
12515 lai->primitive_type_vector [ada_primitive_type_void]
12516 = builtin->builtin_void;
12517
12518 lai->primitive_type_vector [ada_primitive_type_system_address]
12519 = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, 1, "void"));
72d5681a
PH
12520 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
12521 = "system__address";
fbb06eb1 12522
47e729a8 12523 lai->bool_type_symbol = NULL;
fbb06eb1 12524 lai->bool_type_default = builtin->builtin_bool;
6c038f32 12525}
6c038f32
PH
12526\f
12527 /* Language vector */
12528
12529/* Not really used, but needed in the ada_language_defn. */
12530
12531static void
6c7a06a3 12532emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
6c038f32 12533{
6c7a06a3 12534 ada_emit_char (c, type, stream, quoter, 1);
6c038f32
PH
12535}
12536
12537static int
12538parse (void)
12539{
12540 warnings_issued = 0;
12541 return ada_parse ();
12542}
12543
12544static const struct exp_descriptor ada_exp_descriptor = {
12545 ada_print_subexp,
12546 ada_operator_length,
c0201579 12547 ada_operator_check,
6c038f32
PH
12548 ada_op_name,
12549 ada_dump_subexp_body,
12550 ada_evaluate_subexp
12551};
12552
1a119f36 12553/* Implement the "la_get_symbol_name_cmp" language_defn method
74ccd7f5
JB
12554 for Ada. */
12555
1a119f36
JB
12556static symbol_name_cmp_ftype
12557ada_get_symbol_name_cmp (const char *lookup_name)
74ccd7f5
JB
12558{
12559 if (should_use_wild_match (lookup_name))
12560 return wild_match;
12561 else
12562 return compare_names;
12563}
12564
a5ee536b
JB
12565/* Implement the "la_read_var_value" language_defn method for Ada. */
12566
12567static struct value *
12568ada_read_var_value (struct symbol *var, struct frame_info *frame)
12569{
12570 struct block *frame_block = NULL;
12571 struct symbol *renaming_sym = NULL;
12572
12573 /* The only case where default_read_var_value is not sufficient
12574 is when VAR is a renaming... */
12575 if (frame)
12576 frame_block = get_frame_block (frame, NULL);
12577 if (frame_block)
12578 renaming_sym = ada_find_renaming_symbol (var, frame_block);
12579 if (renaming_sym != NULL)
12580 return ada_read_renaming_var_value (renaming_sym, frame_block);
12581
12582 /* This is a typical case where we expect the default_read_var_value
12583 function to work. */
12584 return default_read_var_value (var, frame);
12585}
12586
6c038f32
PH
12587const struct language_defn ada_language_defn = {
12588 "ada", /* Language name */
12589 language_ada,
6c038f32 12590 range_check_off,
6c038f32
PH
12591 case_sensitive_on, /* Yes, Ada is case-insensitive, but
12592 that's not quite what this means. */
6c038f32 12593 array_row_major,
9a044a89 12594 macro_expansion_no,
6c038f32
PH
12595 &ada_exp_descriptor,
12596 parse,
12597 ada_error,
12598 resolve,
12599 ada_printchar, /* Print a character constant */
12600 ada_printstr, /* Function to print string constant */
12601 emit_char, /* Function to print single char (not used) */
6c038f32 12602 ada_print_type, /* Print a type using appropriate syntax */
be942545 12603 ada_print_typedef, /* Print a typedef using appropriate syntax */
6c038f32
PH
12604 ada_val_print, /* Print a value using appropriate syntax */
12605 ada_value_print, /* Print a top-level value */
a5ee536b 12606 ada_read_var_value, /* la_read_var_value */
6c038f32 12607 NULL, /* Language specific skip_trampoline */
2b2d9e11 12608 NULL, /* name_of_this */
6c038f32
PH
12609 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
12610 basic_lookup_transparent_type, /* lookup_transparent_type */
12611 ada_la_decode, /* Language specific symbol demangler */
0963b4bd
MS
12612 NULL, /* Language specific
12613 class_name_from_physname */
6c038f32
PH
12614 ada_op_print_tab, /* expression operators for printing */
12615 0, /* c-style arrays */
12616 1, /* String lower bound */
6c038f32 12617 ada_get_gdb_completer_word_break_characters,
41d27058 12618 ada_make_symbol_completion_list,
72d5681a 12619 ada_language_arch_info,
e79af960 12620 ada_print_array_index,
41f1b697 12621 default_pass_by_reference,
ae6a3a4c 12622 c_get_string,
1a119f36 12623 ada_get_symbol_name_cmp, /* la_get_symbol_name_cmp */
f8eba3c6 12624 ada_iterate_over_symbols,
6c038f32
PH
12625 LANG_MAGIC
12626};
12627
2c0b251b
PA
12628/* Provide a prototype to silence -Wmissing-prototypes. */
12629extern initialize_file_ftype _initialize_ada_language;
12630
5bf03f13
JB
12631/* Command-list for the "set/show ada" prefix command. */
12632static struct cmd_list_element *set_ada_list;
12633static struct cmd_list_element *show_ada_list;
12634
12635/* Implement the "set ada" prefix command. */
12636
12637static void
12638set_ada_command (char *arg, int from_tty)
12639{
12640 printf_unfiltered (_(\
12641"\"set ada\" must be followed by the name of a setting.\n"));
12642 help_list (set_ada_list, "set ada ", -1, gdb_stdout);
12643}
12644
12645/* Implement the "show ada" prefix command. */
12646
12647static void
12648show_ada_command (char *args, int from_tty)
12649{
12650 cmd_show_list (show_ada_list, from_tty, "");
12651}
12652
2060206e
PA
12653static void
12654initialize_ada_catchpoint_ops (void)
12655{
12656 struct breakpoint_ops *ops;
12657
12658 initialize_breakpoint_ops ();
12659
12660 ops = &catch_exception_breakpoint_ops;
12661 *ops = bkpt_breakpoint_ops;
12662 ops->dtor = dtor_catch_exception;
12663 ops->allocate_location = allocate_location_catch_exception;
12664 ops->re_set = re_set_catch_exception;
12665 ops->check_status = check_status_catch_exception;
12666 ops->print_it = print_it_catch_exception;
12667 ops->print_one = print_one_catch_exception;
12668 ops->print_mention = print_mention_catch_exception;
12669 ops->print_recreate = print_recreate_catch_exception;
12670
12671 ops = &catch_exception_unhandled_breakpoint_ops;
12672 *ops = bkpt_breakpoint_ops;
12673 ops->dtor = dtor_catch_exception_unhandled;
12674 ops->allocate_location = allocate_location_catch_exception_unhandled;
12675 ops->re_set = re_set_catch_exception_unhandled;
12676 ops->check_status = check_status_catch_exception_unhandled;
12677 ops->print_it = print_it_catch_exception_unhandled;
12678 ops->print_one = print_one_catch_exception_unhandled;
12679 ops->print_mention = print_mention_catch_exception_unhandled;
12680 ops->print_recreate = print_recreate_catch_exception_unhandled;
12681
12682 ops = &catch_assert_breakpoint_ops;
12683 *ops = bkpt_breakpoint_ops;
12684 ops->dtor = dtor_catch_assert;
12685 ops->allocate_location = allocate_location_catch_assert;
12686 ops->re_set = re_set_catch_assert;
12687 ops->check_status = check_status_catch_assert;
12688 ops->print_it = print_it_catch_assert;
12689 ops->print_one = print_one_catch_assert;
12690 ops->print_mention = print_mention_catch_assert;
12691 ops->print_recreate = print_recreate_catch_assert;
12692}
12693
d2e4a39e 12694void
6c038f32 12695_initialize_ada_language (void)
14f9c5c9 12696{
6c038f32
PH
12697 add_language (&ada_language_defn);
12698
2060206e
PA
12699 initialize_ada_catchpoint_ops ();
12700
5bf03f13
JB
12701 add_prefix_cmd ("ada", no_class, set_ada_command,
12702 _("Prefix command for changing Ada-specfic settings"),
12703 &set_ada_list, "set ada ", 0, &setlist);
12704
12705 add_prefix_cmd ("ada", no_class, show_ada_command,
12706 _("Generic command for showing Ada-specific settings."),
12707 &show_ada_list, "show ada ", 0, &showlist);
12708
12709 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure,
12710 &trust_pad_over_xvs, _("\
12711Enable or disable an optimization trusting PAD types over XVS types"), _("\
12712Show whether an optimization trusting PAD types over XVS types is activated"),
12713 _("\
12714This is related to the encoding used by the GNAT compiler. The debugger\n\
12715should normally trust the contents of PAD types, but certain older versions\n\
12716of GNAT have a bug that sometimes causes the information in the PAD type\n\
12717to be incorrect. Turning this setting \"off\" allows the debugger to\n\
12718work around this bug. It is always safe to turn this option \"off\", but\n\
12719this incurs a slight performance penalty, so it is recommended to NOT change\n\
12720this option to \"off\" unless necessary."),
12721 NULL, NULL, &set_ada_list, &show_ada_list);
12722
9ac4176b
PA
12723 add_catch_command ("exception", _("\
12724Catch Ada exceptions, when raised.\n\
12725With an argument, catch only exceptions with the given name."),
12726 catch_ada_exception_command,
12727 NULL,
12728 CATCH_PERMANENT,
12729 CATCH_TEMPORARY);
12730 add_catch_command ("assert", _("\
12731Catch failed Ada assertions, when raised.\n\
12732With an argument, catch only exceptions with the given name."),
12733 catch_assert_command,
12734 NULL,
12735 CATCH_PERMANENT,
12736 CATCH_TEMPORARY);
12737
6c038f32 12738 varsize_limit = 65536;
6c038f32
PH
12739
12740 obstack_init (&symbol_list_obstack);
12741
12742 decoded_names_store = htab_create_alloc
12743 (256, htab_hash_string, (int (*)(const void *, const void *)) streq,
12744 NULL, xcalloc, xfree);
6b69afc4 12745
e802dbe0
JB
12746 /* Setup per-inferior data. */
12747 observer_attach_inferior_exit (ada_inferior_exit);
12748 ada_inferior_data
8e260fc0 12749 = register_inferior_data_with_cleanup (NULL, ada_inferior_data_cleanup);
14f9c5c9 12750}