]> git.ipfire.org Git - thirdparty/binutils-gdb.git/blame - gdb/ada-lang.c
Move type stack handling to a new class
[thirdparty/binutils-gdb.git] / gdb / ada-lang.c
CommitLineData
6e681866 1/* Ada language support routines for GDB, the GNU debugger.
10a2c479 2
42a4f53d 3 Copyright (C) 1992-2019 Free Software Foundation, Inc.
14f9c5c9 4
a9762ec7 5 This file is part of GDB.
14f9c5c9 6
a9762ec7
JB
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
14f9c5c9 11
a9762ec7
JB
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
14f9c5c9 16
a9762ec7
JB
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
14f9c5c9 19
96d887e8 20
4c4b4cd2 21#include "defs.h"
14f9c5c9 22#include <ctype.h>
14f9c5c9 23#include "demangle.h"
4c4b4cd2
PH
24#include "gdb_regex.h"
25#include "frame.h"
14f9c5c9
AS
26#include "symtab.h"
27#include "gdbtypes.h"
28#include "gdbcmd.h"
29#include "expression.h"
30#include "parser-defs.h"
31#include "language.h"
a53b64ea 32#include "varobj.h"
14f9c5c9
AS
33#include "c-lang.h"
34#include "inferior.h"
35#include "symfile.h"
36#include "objfiles.h"
37#include "breakpoint.h"
38#include "gdbcore.h"
4c4b4cd2
PH
39#include "hashtab.h"
40#include "gdb_obstack.h"
14f9c5c9 41#include "ada-lang.h"
4c4b4cd2 42#include "completer.h"
53ce3c39 43#include <sys/stat.h>
14f9c5c9 44#include "ui-out.h"
fe898f56 45#include "block.h"
04714b91 46#include "infcall.h"
de4f826b 47#include "dictionary.h"
f7f9143b
JB
48#include "annotate.h"
49#include "valprint.h"
9bbc9174 50#include "source.h"
76727919 51#include "observable.h"
0747795c 52#include "common/vec.h"
692465f1 53#include "stack.h"
0747795c 54#include "common/gdb_vecs.h"
79d43c61 55#include "typeprint.h"
22cee43f 56#include "namespace.h"
14f9c5c9 57
ccefe4c4 58#include "psymtab.h"
40bc484c 59#include "value.h"
956a9fb9 60#include "mi/mi-common.h"
9ac4176b 61#include "arch-utils.h"
0fcd72ba 62#include "cli/cli-utils.h"
14bc53a8 63#include "common/function-view.h"
d5722aa2 64#include "common/byte-vector.h"
ab816a27 65#include <algorithm>
ccefe4c4 66
4c4b4cd2 67/* Define whether or not the C operator '/' truncates towards zero for
0963b4bd 68 differently signed operands (truncation direction is undefined in C).
4c4b4cd2
PH
69 Copied from valarith.c. */
70
71#ifndef TRUNCATION_TOWARDS_ZERO
72#define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
73#endif
74
d2e4a39e 75static struct type *desc_base_type (struct type *);
14f9c5c9 76
d2e4a39e 77static struct type *desc_bounds_type (struct type *);
14f9c5c9 78
d2e4a39e 79static struct value *desc_bounds (struct value *);
14f9c5c9 80
d2e4a39e 81static int fat_pntr_bounds_bitpos (struct type *);
14f9c5c9 82
d2e4a39e 83static int fat_pntr_bounds_bitsize (struct type *);
14f9c5c9 84
556bdfd4 85static struct type *desc_data_target_type (struct type *);
14f9c5c9 86
d2e4a39e 87static struct value *desc_data (struct value *);
14f9c5c9 88
d2e4a39e 89static int fat_pntr_data_bitpos (struct type *);
14f9c5c9 90
d2e4a39e 91static int fat_pntr_data_bitsize (struct type *);
14f9c5c9 92
d2e4a39e 93static struct value *desc_one_bound (struct value *, int, int);
14f9c5c9 94
d2e4a39e 95static int desc_bound_bitpos (struct type *, int, int);
14f9c5c9 96
d2e4a39e 97static int desc_bound_bitsize (struct type *, int, int);
14f9c5c9 98
d2e4a39e 99static struct type *desc_index_type (struct type *, int);
14f9c5c9 100
d2e4a39e 101static int desc_arity (struct type *);
14f9c5c9 102
d2e4a39e 103static int ada_type_match (struct type *, struct type *, int);
14f9c5c9 104
d2e4a39e 105static int ada_args_match (struct symbol *, struct value **, int);
14f9c5c9 106
40bc484c 107static struct value *make_array_descriptor (struct type *, struct value *);
14f9c5c9 108
4c4b4cd2 109static void ada_add_block_symbols (struct obstack *,
b5ec771e
PA
110 const struct block *,
111 const lookup_name_info &lookup_name,
112 domain_enum, struct objfile *);
14f9c5c9 113
22cee43f 114static void ada_add_all_symbols (struct obstack *, const struct block *,
b5ec771e
PA
115 const lookup_name_info &lookup_name,
116 domain_enum, int, int *);
22cee43f 117
d12307c1 118static int is_nonfunction (struct block_symbol *, int);
14f9c5c9 119
76a01679 120static void add_defn_to_vec (struct obstack *, struct symbol *,
f0c5f9b2 121 const struct block *);
14f9c5c9 122
4c4b4cd2
PH
123static int num_defns_collected (struct obstack *);
124
d12307c1 125static struct block_symbol *defns_collected (struct obstack *, int);
14f9c5c9 126
e9d9f57e 127static struct value *resolve_subexp (expression_up *, int *, int,
2a612529 128 struct type *, int);
14f9c5c9 129
e9d9f57e 130static void replace_operator_with_call (expression_up *, int, int, int,
270140bd 131 struct symbol *, const struct block *);
14f9c5c9 132
d2e4a39e 133static int possible_user_operator_p (enum exp_opcode, struct value **);
14f9c5c9 134
a121b7c1 135static const char *ada_op_name (enum exp_opcode);
4c4b4cd2
PH
136
137static const char *ada_decoded_op_name (enum exp_opcode);
14f9c5c9 138
d2e4a39e 139static int numeric_type_p (struct type *);
14f9c5c9 140
d2e4a39e 141static int integer_type_p (struct type *);
14f9c5c9 142
d2e4a39e 143static int scalar_type_p (struct type *);
14f9c5c9 144
d2e4a39e 145static int discrete_type_p (struct type *);
14f9c5c9 146
aeb5907d
JB
147static enum ada_renaming_category parse_old_style_renaming (struct type *,
148 const char **,
149 int *,
150 const char **);
151
152static struct symbol *find_old_style_renaming_symbol (const char *,
270140bd 153 const struct block *);
aeb5907d 154
a121b7c1 155static struct type *ada_lookup_struct_elt_type (struct type *, const char *,
988f6b3d 156 int, int);
4c4b4cd2 157
d2e4a39e 158static struct value *evaluate_subexp_type (struct expression *, int *);
14f9c5c9 159
b4ba55a1
JB
160static struct type *ada_find_parallel_type_with_name (struct type *,
161 const char *);
162
d2e4a39e 163static int is_dynamic_field (struct type *, int);
14f9c5c9 164
10a2c479 165static struct type *to_fixed_variant_branch_type (struct type *,
fc1a4b47 166 const gdb_byte *,
4c4b4cd2
PH
167 CORE_ADDR, struct value *);
168
169static struct type *to_fixed_array_type (struct type *, struct value *, int);
14f9c5c9 170
28c85d6c 171static struct type *to_fixed_range_type (struct type *, struct value *);
14f9c5c9 172
d2e4a39e 173static struct type *to_static_fixed_type (struct type *);
f192137b 174static struct type *static_unwrap_type (struct type *type);
14f9c5c9 175
d2e4a39e 176static struct value *unwrap_value (struct value *);
14f9c5c9 177
ad82864c 178static struct type *constrained_packed_array_type (struct type *, long *);
14f9c5c9 179
ad82864c 180static struct type *decode_constrained_packed_array_type (struct type *);
14f9c5c9 181
ad82864c
JB
182static long decode_packed_array_bitsize (struct type *);
183
184static struct value *decode_constrained_packed_array (struct value *);
185
186static int ada_is_packed_array_type (struct type *);
187
188static int ada_is_unconstrained_packed_array_type (struct type *);
14f9c5c9 189
d2e4a39e 190static struct value *value_subscript_packed (struct value *, int,
4c4b4cd2 191 struct value **);
14f9c5c9 192
4c4b4cd2
PH
193static struct value *coerce_unspec_val_to_type (struct value *,
194 struct type *);
14f9c5c9 195
d2e4a39e 196static int lesseq_defined_than (struct symbol *, struct symbol *);
14f9c5c9 197
d2e4a39e 198static int equiv_types (struct type *, struct type *);
14f9c5c9 199
d2e4a39e 200static int is_name_suffix (const char *);
14f9c5c9 201
73589123
PH
202static int advance_wild_match (const char **, const char *, int);
203
b5ec771e 204static bool wild_match (const char *name, const char *patn);
14f9c5c9 205
d2e4a39e 206static struct value *ada_coerce_ref (struct value *);
14f9c5c9 207
4c4b4cd2
PH
208static LONGEST pos_atr (struct value *);
209
3cb382c9 210static struct value *value_pos_atr (struct type *, struct value *);
14f9c5c9 211
d2e4a39e 212static struct value *value_val_atr (struct type *, struct value *);
14f9c5c9 213
4c4b4cd2
PH
214static struct symbol *standard_lookup (const char *, const struct block *,
215 domain_enum);
14f9c5c9 216
108d56a4 217static struct value *ada_search_struct_field (const char *, struct value *, int,
4c4b4cd2
PH
218 struct type *);
219
220static struct value *ada_value_primitive_field (struct value *, int, int,
221 struct type *);
222
0d5cff50 223static int find_struct_field (const char *, struct type *, int,
52ce6436 224 struct type **, int *, int *, int *, int *);
4c4b4cd2 225
d12307c1 226static int ada_resolve_function (struct block_symbol *, int,
4c4b4cd2 227 struct value **, int, const char *,
2a612529 228 struct type *, int);
4c4b4cd2 229
4c4b4cd2
PH
230static int ada_is_direct_array_type (struct type *);
231
72d5681a
PH
232static void ada_language_arch_info (struct gdbarch *,
233 struct language_arch_info *);
714e53ab 234
52ce6436
PH
235static struct value *ada_index_struct_field (int, struct value *, int,
236 struct type *);
237
238static struct value *assign_aggregate (struct value *, struct value *,
0963b4bd
MS
239 struct expression *,
240 int *, enum noside);
52ce6436
PH
241
242static void aggregate_assign_from_choices (struct value *, struct value *,
243 struct expression *,
244 int *, LONGEST *, int *,
245 int, LONGEST, LONGEST);
246
247static void aggregate_assign_positional (struct value *, struct value *,
248 struct expression *,
249 int *, LONGEST *, int *, int,
250 LONGEST, LONGEST);
251
252
253static void aggregate_assign_others (struct value *, struct value *,
254 struct expression *,
255 int *, LONGEST *, int, LONGEST, LONGEST);
256
257
258static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int);
259
260
261static struct value *ada_evaluate_subexp (struct type *, struct expression *,
262 int *, enum noside);
263
264static void ada_forward_operator_length (struct expression *, int, int *,
265 int *);
852dff6c
JB
266
267static struct type *ada_find_any_type (const char *name);
b5ec771e
PA
268
269static symbol_name_matcher_ftype *ada_get_symbol_name_matcher
270 (const lookup_name_info &lookup_name);
271
4c4b4cd2
PH
272\f
273
ee01b665
JB
274/* The result of a symbol lookup to be stored in our symbol cache. */
275
276struct cache_entry
277{
278 /* The name used to perform the lookup. */
279 const char *name;
280 /* The namespace used during the lookup. */
fe978cb0 281 domain_enum domain;
ee01b665
JB
282 /* The symbol returned by the lookup, or NULL if no matching symbol
283 was found. */
284 struct symbol *sym;
285 /* The block where the symbol was found, or NULL if no matching
286 symbol was found. */
287 const struct block *block;
288 /* A pointer to the next entry with the same hash. */
289 struct cache_entry *next;
290};
291
292/* The Ada symbol cache, used to store the result of Ada-mode symbol
293 lookups in the course of executing the user's commands.
294
295 The cache is implemented using a simple, fixed-sized hash.
296 The size is fixed on the grounds that there are not likely to be
297 all that many symbols looked up during any given session, regardless
298 of the size of the symbol table. If we decide to go to a resizable
299 table, let's just use the stuff from libiberty instead. */
300
301#define HASH_SIZE 1009
302
303struct ada_symbol_cache
304{
305 /* An obstack used to store the entries in our cache. */
306 struct obstack cache_space;
307
308 /* The root of the hash table used to implement our symbol cache. */
309 struct cache_entry *root[HASH_SIZE];
310};
311
312static void ada_free_symbol_cache (struct ada_symbol_cache *sym_cache);
76a01679 313
4c4b4cd2 314/* Maximum-sized dynamic type. */
14f9c5c9
AS
315static unsigned int varsize_limit;
316
67cb5b2d 317static const char ada_completer_word_break_characters[] =
4c4b4cd2
PH
318#ifdef VMS
319 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
320#else
14f9c5c9 321 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
4c4b4cd2 322#endif
14f9c5c9 323
4c4b4cd2 324/* The name of the symbol to use to get the name of the main subprogram. */
76a01679 325static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
4c4b4cd2 326 = "__gnat_ada_main_program_name";
14f9c5c9 327
4c4b4cd2
PH
328/* Limit on the number of warnings to raise per expression evaluation. */
329static int warning_limit = 2;
330
331/* Number of warning messages issued; reset to 0 by cleanups after
332 expression evaluation. */
333static int warnings_issued = 0;
334
335static const char *known_runtime_file_name_patterns[] = {
336 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
337};
338
339static const char *known_auxiliary_function_name_patterns[] = {
340 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
341};
342
c6044dd1
JB
343/* Maintenance-related settings for this module. */
344
345static struct cmd_list_element *maint_set_ada_cmdlist;
346static struct cmd_list_element *maint_show_ada_cmdlist;
347
348/* Implement the "maintenance set ada" (prefix) command. */
349
350static void
981a3fb3 351maint_set_ada_cmd (const char *args, int from_tty)
c6044dd1 352{
635c7e8a
TT
353 help_list (maint_set_ada_cmdlist, "maintenance set ada ", all_commands,
354 gdb_stdout);
c6044dd1
JB
355}
356
357/* Implement the "maintenance show ada" (prefix) command. */
358
359static void
981a3fb3 360maint_show_ada_cmd (const char *args, int from_tty)
c6044dd1
JB
361{
362 cmd_show_list (maint_show_ada_cmdlist, from_tty, "");
363}
364
365/* The "maintenance ada set/show ignore-descriptive-type" value. */
366
367static int ada_ignore_descriptive_types_p = 0;
368
e802dbe0
JB
369 /* Inferior-specific data. */
370
371/* Per-inferior data for this module. */
372
373struct ada_inferior_data
374{
375 /* The ada__tags__type_specific_data type, which is used when decoding
376 tagged types. With older versions of GNAT, this type was directly
377 accessible through a component ("tsd") in the object tag. But this
378 is no longer the case, so we cache it for each inferior. */
379 struct type *tsd_type;
3eecfa55
JB
380
381 /* The exception_support_info data. This data is used to determine
382 how to implement support for Ada exception catchpoints in a given
383 inferior. */
384 const struct exception_support_info *exception_info;
e802dbe0
JB
385};
386
387/* Our key to this module's inferior data. */
388static const struct inferior_data *ada_inferior_data;
389
390/* A cleanup routine for our inferior data. */
391static void
392ada_inferior_data_cleanup (struct inferior *inf, void *arg)
393{
394 struct ada_inferior_data *data;
395
9a3c8263 396 data = (struct ada_inferior_data *) inferior_data (inf, ada_inferior_data);
e802dbe0
JB
397 if (data != NULL)
398 xfree (data);
399}
400
401/* Return our inferior data for the given inferior (INF).
402
403 This function always returns a valid pointer to an allocated
404 ada_inferior_data structure. If INF's inferior data has not
405 been previously set, this functions creates a new one with all
406 fields set to zero, sets INF's inferior to it, and then returns
407 a pointer to that newly allocated ada_inferior_data. */
408
409static struct ada_inferior_data *
410get_ada_inferior_data (struct inferior *inf)
411{
412 struct ada_inferior_data *data;
413
9a3c8263 414 data = (struct ada_inferior_data *) inferior_data (inf, ada_inferior_data);
e802dbe0
JB
415 if (data == NULL)
416 {
41bf6aca 417 data = XCNEW (struct ada_inferior_data);
e802dbe0
JB
418 set_inferior_data (inf, ada_inferior_data, data);
419 }
420
421 return data;
422}
423
424/* Perform all necessary cleanups regarding our module's inferior data
425 that is required after the inferior INF just exited. */
426
427static void
428ada_inferior_exit (struct inferior *inf)
429{
430 ada_inferior_data_cleanup (inf, NULL);
431 set_inferior_data (inf, ada_inferior_data, NULL);
432}
433
ee01b665
JB
434
435 /* program-space-specific data. */
436
437/* This module's per-program-space data. */
438struct ada_pspace_data
439{
440 /* The Ada symbol cache. */
441 struct ada_symbol_cache *sym_cache;
442};
443
444/* Key to our per-program-space data. */
445static const struct program_space_data *ada_pspace_data_handle;
446
447/* Return this module's data for the given program space (PSPACE).
448 If not is found, add a zero'ed one now.
449
450 This function always returns a valid object. */
451
452static struct ada_pspace_data *
453get_ada_pspace_data (struct program_space *pspace)
454{
455 struct ada_pspace_data *data;
456
9a3c8263
SM
457 data = ((struct ada_pspace_data *)
458 program_space_data (pspace, ada_pspace_data_handle));
ee01b665
JB
459 if (data == NULL)
460 {
461 data = XCNEW (struct ada_pspace_data);
462 set_program_space_data (pspace, ada_pspace_data_handle, data);
463 }
464
465 return data;
466}
467
468/* The cleanup callback for this module's per-program-space data. */
469
470static void
471ada_pspace_data_cleanup (struct program_space *pspace, void *data)
472{
9a3c8263 473 struct ada_pspace_data *pspace_data = (struct ada_pspace_data *) data;
ee01b665
JB
474
475 if (pspace_data->sym_cache != NULL)
476 ada_free_symbol_cache (pspace_data->sym_cache);
477 xfree (pspace_data);
478}
479
4c4b4cd2
PH
480 /* Utilities */
481
720d1a40 482/* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
eed9788b 483 all typedef layers have been peeled. Otherwise, return TYPE.
720d1a40
JB
484
485 Normally, we really expect a typedef type to only have 1 typedef layer.
486 In other words, we really expect the target type of a typedef type to be
487 a non-typedef type. This is particularly true for Ada units, because
488 the language does not have a typedef vs not-typedef distinction.
489 In that respect, the Ada compiler has been trying to eliminate as many
490 typedef definitions in the debugging information, since they generally
491 do not bring any extra information (we still use typedef under certain
492 circumstances related mostly to the GNAT encoding).
493
494 Unfortunately, we have seen situations where the debugging information
495 generated by the compiler leads to such multiple typedef layers. For
496 instance, consider the following example with stabs:
497
498 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
499 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
500
501 This is an error in the debugging information which causes type
502 pck__float_array___XUP to be defined twice, and the second time,
503 it is defined as a typedef of a typedef.
504
505 This is on the fringe of legality as far as debugging information is
506 concerned, and certainly unexpected. But it is easy to handle these
507 situations correctly, so we can afford to be lenient in this case. */
508
509static struct type *
510ada_typedef_target_type (struct type *type)
511{
512 while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
513 type = TYPE_TARGET_TYPE (type);
514 return type;
515}
516
41d27058
JB
517/* Given DECODED_NAME a string holding a symbol name in its
518 decoded form (ie using the Ada dotted notation), returns
519 its unqualified name. */
520
521static const char *
522ada_unqualified_name (const char *decoded_name)
523{
2b0f535a
JB
524 const char *result;
525
526 /* If the decoded name starts with '<', it means that the encoded
527 name does not follow standard naming conventions, and thus that
528 it is not your typical Ada symbol name. Trying to unqualify it
529 is therefore pointless and possibly erroneous. */
530 if (decoded_name[0] == '<')
531 return decoded_name;
532
533 result = strrchr (decoded_name, '.');
41d27058
JB
534 if (result != NULL)
535 result++; /* Skip the dot... */
536 else
537 result = decoded_name;
538
539 return result;
540}
541
39e7af3e 542/* Return a string starting with '<', followed by STR, and '>'. */
41d27058 543
39e7af3e 544static std::string
41d27058
JB
545add_angle_brackets (const char *str)
546{
39e7af3e 547 return string_printf ("<%s>", str);
41d27058 548}
96d887e8 549
67cb5b2d 550static const char *
4c4b4cd2
PH
551ada_get_gdb_completer_word_break_characters (void)
552{
553 return ada_completer_word_break_characters;
554}
555
e79af960
JB
556/* Print an array element index using the Ada syntax. */
557
558static void
559ada_print_array_index (struct value *index_value, struct ui_file *stream,
79a45b7d 560 const struct value_print_options *options)
e79af960 561{
79a45b7d 562 LA_VALUE_PRINT (index_value, stream, options);
e79af960
JB
563 fprintf_filtered (stream, " => ");
564}
565
e2b7af72
JB
566/* la_watch_location_expression for Ada. */
567
568gdb::unique_xmalloc_ptr<char>
569ada_watch_location_expression (struct type *type, CORE_ADDR addr)
570{
571 type = check_typedef (TYPE_TARGET_TYPE (check_typedef (type)));
572 std::string name = type_to_string (type);
573 return gdb::unique_xmalloc_ptr<char>
574 (xstrprintf ("{%s} %s", name.c_str (), core_addr_to_string (addr)));
575}
576
f27cf670 577/* Assuming VECT points to an array of *SIZE objects of size
14f9c5c9 578 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
f27cf670 579 updating *SIZE as necessary and returning the (new) array. */
14f9c5c9 580
f27cf670
AS
581void *
582grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
14f9c5c9 583{
d2e4a39e
AS
584 if (*size < min_size)
585 {
586 *size *= 2;
587 if (*size < min_size)
4c4b4cd2 588 *size = min_size;
f27cf670 589 vect = xrealloc (vect, *size * element_size);
d2e4a39e 590 }
f27cf670 591 return vect;
14f9c5c9
AS
592}
593
594/* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
4c4b4cd2 595 suffix of FIELD_NAME beginning "___". */
14f9c5c9
AS
596
597static int
ebf56fd3 598field_name_match (const char *field_name, const char *target)
14f9c5c9
AS
599{
600 int len = strlen (target);
5b4ee69b 601
d2e4a39e 602 return
4c4b4cd2
PH
603 (strncmp (field_name, target, len) == 0
604 && (field_name[len] == '\0'
61012eef 605 || (startswith (field_name + len, "___")
76a01679
JB
606 && strcmp (field_name + strlen (field_name) - 6,
607 "___XVN") != 0)));
14f9c5c9
AS
608}
609
610
872c8b51
JB
611/* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
612 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
613 and return its index. This function also handles fields whose name
614 have ___ suffixes because the compiler sometimes alters their name
615 by adding such a suffix to represent fields with certain constraints.
616 If the field could not be found, return a negative number if
617 MAYBE_MISSING is set. Otherwise raise an error. */
4c4b4cd2
PH
618
619int
620ada_get_field_index (const struct type *type, const char *field_name,
621 int maybe_missing)
622{
623 int fieldno;
872c8b51
JB
624 struct type *struct_type = check_typedef ((struct type *) type);
625
626 for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++)
627 if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name))
4c4b4cd2
PH
628 return fieldno;
629
630 if (!maybe_missing)
323e0a4a 631 error (_("Unable to find field %s in struct %s. Aborting"),
872c8b51 632 field_name, TYPE_NAME (struct_type));
4c4b4cd2
PH
633
634 return -1;
635}
636
637/* The length of the prefix of NAME prior to any "___" suffix. */
14f9c5c9
AS
638
639int
d2e4a39e 640ada_name_prefix_len (const char *name)
14f9c5c9
AS
641{
642 if (name == NULL)
643 return 0;
d2e4a39e 644 else
14f9c5c9 645 {
d2e4a39e 646 const char *p = strstr (name, "___");
5b4ee69b 647
14f9c5c9 648 if (p == NULL)
4c4b4cd2 649 return strlen (name);
14f9c5c9 650 else
4c4b4cd2 651 return p - name;
14f9c5c9
AS
652 }
653}
654
4c4b4cd2
PH
655/* Return non-zero if SUFFIX is a suffix of STR.
656 Return zero if STR is null. */
657
14f9c5c9 658static int
d2e4a39e 659is_suffix (const char *str, const char *suffix)
14f9c5c9
AS
660{
661 int len1, len2;
5b4ee69b 662
14f9c5c9
AS
663 if (str == NULL)
664 return 0;
665 len1 = strlen (str);
666 len2 = strlen (suffix);
4c4b4cd2 667 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
14f9c5c9
AS
668}
669
4c4b4cd2
PH
670/* The contents of value VAL, treated as a value of type TYPE. The
671 result is an lval in memory if VAL is. */
14f9c5c9 672
d2e4a39e 673static struct value *
4c4b4cd2 674coerce_unspec_val_to_type (struct value *val, struct type *type)
14f9c5c9 675{
61ee279c 676 type = ada_check_typedef (type);
df407dfe 677 if (value_type (val) == type)
4c4b4cd2 678 return val;
d2e4a39e 679 else
14f9c5c9 680 {
4c4b4cd2
PH
681 struct value *result;
682
683 /* Make sure that the object size is not unreasonable before
684 trying to allocate some memory for it. */
c1b5a1a6 685 ada_ensure_varsize_limit (type);
4c4b4cd2 686
41e8491f
JK
687 if (value_lazy (val)
688 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
689 result = allocate_value_lazy (type);
690 else
691 {
692 result = allocate_value (type);
9a0dc9e3 693 value_contents_copy_raw (result, 0, val, 0, TYPE_LENGTH (type));
41e8491f 694 }
74bcbdf3 695 set_value_component_location (result, val);
9bbda503
AC
696 set_value_bitsize (result, value_bitsize (val));
697 set_value_bitpos (result, value_bitpos (val));
42ae5230 698 set_value_address (result, value_address (val));
14f9c5c9
AS
699 return result;
700 }
701}
702
fc1a4b47
AC
703static const gdb_byte *
704cond_offset_host (const gdb_byte *valaddr, long offset)
14f9c5c9
AS
705{
706 if (valaddr == NULL)
707 return NULL;
708 else
709 return valaddr + offset;
710}
711
712static CORE_ADDR
ebf56fd3 713cond_offset_target (CORE_ADDR address, long offset)
14f9c5c9
AS
714{
715 if (address == 0)
716 return 0;
d2e4a39e 717 else
14f9c5c9
AS
718 return address + offset;
719}
720
4c4b4cd2
PH
721/* Issue a warning (as for the definition of warning in utils.c, but
722 with exactly one argument rather than ...), unless the limit on the
723 number of warnings has passed during the evaluation of the current
724 expression. */
a2249542 725
77109804
AC
726/* FIXME: cagney/2004-10-10: This function is mimicking the behavior
727 provided by "complaint". */
a0b31db1 728static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2);
77109804 729
14f9c5c9 730static void
a2249542 731lim_warning (const char *format, ...)
14f9c5c9 732{
a2249542 733 va_list args;
a2249542 734
5b4ee69b 735 va_start (args, format);
4c4b4cd2
PH
736 warnings_issued += 1;
737 if (warnings_issued <= warning_limit)
a2249542
MK
738 vwarning (format, args);
739
740 va_end (args);
4c4b4cd2
PH
741}
742
714e53ab
PH
743/* Issue an error if the size of an object of type T is unreasonable,
744 i.e. if it would be a bad idea to allocate a value of this type in
745 GDB. */
746
c1b5a1a6
JB
747void
748ada_ensure_varsize_limit (const struct type *type)
714e53ab
PH
749{
750 if (TYPE_LENGTH (type) > varsize_limit)
323e0a4a 751 error (_("object size is larger than varsize-limit"));
714e53ab
PH
752}
753
0963b4bd 754/* Maximum value of a SIZE-byte signed integer type. */
4c4b4cd2 755static LONGEST
c3e5cd34 756max_of_size (int size)
4c4b4cd2 757{
76a01679 758 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
5b4ee69b 759
76a01679 760 return top_bit | (top_bit - 1);
4c4b4cd2
PH
761}
762
0963b4bd 763/* Minimum value of a SIZE-byte signed integer type. */
4c4b4cd2 764static LONGEST
c3e5cd34 765min_of_size (int size)
4c4b4cd2 766{
c3e5cd34 767 return -max_of_size (size) - 1;
4c4b4cd2
PH
768}
769
0963b4bd 770/* Maximum value of a SIZE-byte unsigned integer type. */
4c4b4cd2 771static ULONGEST
c3e5cd34 772umax_of_size (int size)
4c4b4cd2 773{
76a01679 774 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
5b4ee69b 775
76a01679 776 return top_bit | (top_bit - 1);
4c4b4cd2
PH
777}
778
0963b4bd 779/* Maximum value of integral type T, as a signed quantity. */
c3e5cd34
PH
780static LONGEST
781max_of_type (struct type *t)
4c4b4cd2 782{
c3e5cd34
PH
783 if (TYPE_UNSIGNED (t))
784 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
785 else
786 return max_of_size (TYPE_LENGTH (t));
787}
788
0963b4bd 789/* Minimum value of integral type T, as a signed quantity. */
c3e5cd34
PH
790static LONGEST
791min_of_type (struct type *t)
792{
793 if (TYPE_UNSIGNED (t))
794 return 0;
795 else
796 return min_of_size (TYPE_LENGTH (t));
4c4b4cd2
PH
797}
798
799/* The largest value in the domain of TYPE, a discrete type, as an integer. */
43bbcdc2
PH
800LONGEST
801ada_discrete_type_high_bound (struct type *type)
4c4b4cd2 802{
c3345124 803 type = resolve_dynamic_type (type, NULL, 0);
76a01679 804 switch (TYPE_CODE (type))
4c4b4cd2
PH
805 {
806 case TYPE_CODE_RANGE:
690cc4eb 807 return TYPE_HIGH_BOUND (type);
4c4b4cd2 808 case TYPE_CODE_ENUM:
14e75d8e 809 return TYPE_FIELD_ENUMVAL (type, TYPE_NFIELDS (type) - 1);
690cc4eb
PH
810 case TYPE_CODE_BOOL:
811 return 1;
812 case TYPE_CODE_CHAR:
76a01679 813 case TYPE_CODE_INT:
690cc4eb 814 return max_of_type (type);
4c4b4cd2 815 default:
43bbcdc2 816 error (_("Unexpected type in ada_discrete_type_high_bound."));
4c4b4cd2
PH
817 }
818}
819
14e75d8e 820/* The smallest value in the domain of TYPE, a discrete type, as an integer. */
43bbcdc2
PH
821LONGEST
822ada_discrete_type_low_bound (struct type *type)
4c4b4cd2 823{
c3345124 824 type = resolve_dynamic_type (type, NULL, 0);
76a01679 825 switch (TYPE_CODE (type))
4c4b4cd2
PH
826 {
827 case TYPE_CODE_RANGE:
690cc4eb 828 return TYPE_LOW_BOUND (type);
4c4b4cd2 829 case TYPE_CODE_ENUM:
14e75d8e 830 return TYPE_FIELD_ENUMVAL (type, 0);
690cc4eb
PH
831 case TYPE_CODE_BOOL:
832 return 0;
833 case TYPE_CODE_CHAR:
76a01679 834 case TYPE_CODE_INT:
690cc4eb 835 return min_of_type (type);
4c4b4cd2 836 default:
43bbcdc2 837 error (_("Unexpected type in ada_discrete_type_low_bound."));
4c4b4cd2
PH
838 }
839}
840
841/* The identity on non-range types. For range types, the underlying
76a01679 842 non-range scalar type. */
4c4b4cd2
PH
843
844static struct type *
18af8284 845get_base_type (struct type *type)
4c4b4cd2
PH
846{
847 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
848 {
76a01679
JB
849 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
850 return type;
4c4b4cd2
PH
851 type = TYPE_TARGET_TYPE (type);
852 }
853 return type;
14f9c5c9 854}
41246937
JB
855
856/* Return a decoded version of the given VALUE. This means returning
857 a value whose type is obtained by applying all the GNAT-specific
858 encondings, making the resulting type a static but standard description
859 of the initial type. */
860
861struct value *
862ada_get_decoded_value (struct value *value)
863{
864 struct type *type = ada_check_typedef (value_type (value));
865
866 if (ada_is_array_descriptor_type (type)
867 || (ada_is_constrained_packed_array_type (type)
868 && TYPE_CODE (type) != TYPE_CODE_PTR))
869 {
870 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) /* array access type. */
871 value = ada_coerce_to_simple_array_ptr (value);
872 else
873 value = ada_coerce_to_simple_array (value);
874 }
875 else
876 value = ada_to_fixed_value (value);
877
878 return value;
879}
880
881/* Same as ada_get_decoded_value, but with the given TYPE.
882 Because there is no associated actual value for this type,
883 the resulting type might be a best-effort approximation in
884 the case of dynamic types. */
885
886struct type *
887ada_get_decoded_type (struct type *type)
888{
889 type = to_static_fixed_type (type);
890 if (ada_is_constrained_packed_array_type (type))
891 type = ada_coerce_to_simple_array_type (type);
892 return type;
893}
894
4c4b4cd2 895\f
76a01679 896
4c4b4cd2 897 /* Language Selection */
14f9c5c9
AS
898
899/* If the main program is in Ada, return language_ada, otherwise return LANG
ccefe4c4 900 (the main program is in Ada iif the adainit symbol is found). */
d2e4a39e 901
14f9c5c9 902enum language
ccefe4c4 903ada_update_initial_language (enum language lang)
14f9c5c9 904{
d2e4a39e 905 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
3b7344d5 906 (struct objfile *) NULL).minsym != NULL)
4c4b4cd2 907 return language_ada;
14f9c5c9
AS
908
909 return lang;
910}
96d887e8
PH
911
912/* If the main procedure is written in Ada, then return its name.
913 The result is good until the next call. Return NULL if the main
914 procedure doesn't appear to be in Ada. */
915
916char *
917ada_main_name (void)
918{
3b7344d5 919 struct bound_minimal_symbol msym;
e83e4e24 920 static gdb::unique_xmalloc_ptr<char> main_program_name;
6c038f32 921
96d887e8
PH
922 /* For Ada, the name of the main procedure is stored in a specific
923 string constant, generated by the binder. Look for that symbol,
924 extract its address, and then read that string. If we didn't find
925 that string, then most probably the main procedure is not written
926 in Ada. */
927 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
928
3b7344d5 929 if (msym.minsym != NULL)
96d887e8 930 {
f9bc20b9
JB
931 CORE_ADDR main_program_name_addr;
932 int err_code;
933
77e371c0 934 main_program_name_addr = BMSYMBOL_VALUE_ADDRESS (msym);
96d887e8 935 if (main_program_name_addr == 0)
323e0a4a 936 error (_("Invalid address for Ada main program name."));
96d887e8 937
f9bc20b9
JB
938 target_read_string (main_program_name_addr, &main_program_name,
939 1024, &err_code);
940
941 if (err_code != 0)
942 return NULL;
e83e4e24 943 return main_program_name.get ();
96d887e8
PH
944 }
945
946 /* The main procedure doesn't seem to be in Ada. */
947 return NULL;
948}
14f9c5c9 949\f
4c4b4cd2 950 /* Symbols */
d2e4a39e 951
4c4b4cd2
PH
952/* Table of Ada operators and their GNAT-encoded names. Last entry is pair
953 of NULLs. */
14f9c5c9 954
d2e4a39e
AS
955const struct ada_opname_map ada_opname_table[] = {
956 {"Oadd", "\"+\"", BINOP_ADD},
957 {"Osubtract", "\"-\"", BINOP_SUB},
958 {"Omultiply", "\"*\"", BINOP_MUL},
959 {"Odivide", "\"/\"", BINOP_DIV},
960 {"Omod", "\"mod\"", BINOP_MOD},
961 {"Orem", "\"rem\"", BINOP_REM},
962 {"Oexpon", "\"**\"", BINOP_EXP},
963 {"Olt", "\"<\"", BINOP_LESS},
964 {"Ole", "\"<=\"", BINOP_LEQ},
965 {"Ogt", "\">\"", BINOP_GTR},
966 {"Oge", "\">=\"", BINOP_GEQ},
967 {"Oeq", "\"=\"", BINOP_EQUAL},
968 {"One", "\"/=\"", BINOP_NOTEQUAL},
969 {"Oand", "\"and\"", BINOP_BITWISE_AND},
970 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
971 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
972 {"Oconcat", "\"&\"", BINOP_CONCAT},
973 {"Oabs", "\"abs\"", UNOP_ABS},
974 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
975 {"Oadd", "\"+\"", UNOP_PLUS},
976 {"Osubtract", "\"-\"", UNOP_NEG},
977 {NULL, NULL}
14f9c5c9
AS
978};
979
b5ec771e
PA
980/* The "encoded" form of DECODED, according to GNAT conventions. The
981 result is valid until the next call to ada_encode. If
982 THROW_ERRORS, throw an error if invalid operator name is found.
983 Otherwise, return NULL in that case. */
4c4b4cd2 984
b5ec771e
PA
985static char *
986ada_encode_1 (const char *decoded, bool throw_errors)
14f9c5c9 987{
4c4b4cd2
PH
988 static char *encoding_buffer = NULL;
989 static size_t encoding_buffer_size = 0;
d2e4a39e 990 const char *p;
14f9c5c9 991 int k;
d2e4a39e 992
4c4b4cd2 993 if (decoded == NULL)
14f9c5c9
AS
994 return NULL;
995
4c4b4cd2
PH
996 GROW_VECT (encoding_buffer, encoding_buffer_size,
997 2 * strlen (decoded) + 10);
14f9c5c9
AS
998
999 k = 0;
4c4b4cd2 1000 for (p = decoded; *p != '\0'; p += 1)
14f9c5c9 1001 {
cdc7bb92 1002 if (*p == '.')
4c4b4cd2
PH
1003 {
1004 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
1005 k += 2;
1006 }
14f9c5c9 1007 else if (*p == '"')
4c4b4cd2
PH
1008 {
1009 const struct ada_opname_map *mapping;
1010
1011 for (mapping = ada_opname_table;
1265e4aa 1012 mapping->encoded != NULL
61012eef 1013 && !startswith (p, mapping->decoded); mapping += 1)
4c4b4cd2
PH
1014 ;
1015 if (mapping->encoded == NULL)
b5ec771e
PA
1016 {
1017 if (throw_errors)
1018 error (_("invalid Ada operator name: %s"), p);
1019 else
1020 return NULL;
1021 }
4c4b4cd2
PH
1022 strcpy (encoding_buffer + k, mapping->encoded);
1023 k += strlen (mapping->encoded);
1024 break;
1025 }
d2e4a39e 1026 else
4c4b4cd2
PH
1027 {
1028 encoding_buffer[k] = *p;
1029 k += 1;
1030 }
14f9c5c9
AS
1031 }
1032
4c4b4cd2
PH
1033 encoding_buffer[k] = '\0';
1034 return encoding_buffer;
14f9c5c9
AS
1035}
1036
b5ec771e
PA
1037/* The "encoded" form of DECODED, according to GNAT conventions.
1038 The result is valid until the next call to ada_encode. */
1039
1040char *
1041ada_encode (const char *decoded)
1042{
1043 return ada_encode_1 (decoded, true);
1044}
1045
14f9c5c9 1046/* Return NAME folded to lower case, or, if surrounded by single
4c4b4cd2
PH
1047 quotes, unfolded, but with the quotes stripped away. Result good
1048 to next call. */
1049
d2e4a39e
AS
1050char *
1051ada_fold_name (const char *name)
14f9c5c9 1052{
d2e4a39e 1053 static char *fold_buffer = NULL;
14f9c5c9
AS
1054 static size_t fold_buffer_size = 0;
1055
1056 int len = strlen (name);
d2e4a39e 1057 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
14f9c5c9
AS
1058
1059 if (name[0] == '\'')
1060 {
d2e4a39e
AS
1061 strncpy (fold_buffer, name + 1, len - 2);
1062 fold_buffer[len - 2] = '\000';
14f9c5c9
AS
1063 }
1064 else
1065 {
1066 int i;
5b4ee69b 1067
14f9c5c9 1068 for (i = 0; i <= len; i += 1)
4c4b4cd2 1069 fold_buffer[i] = tolower (name[i]);
14f9c5c9
AS
1070 }
1071
1072 return fold_buffer;
1073}
1074
529cad9c
PH
1075/* Return nonzero if C is either a digit or a lowercase alphabet character. */
1076
1077static int
1078is_lower_alphanum (const char c)
1079{
1080 return (isdigit (c) || (isalpha (c) && islower (c)));
1081}
1082
c90092fe
JB
1083/* ENCODED is the linkage name of a symbol and LEN contains its length.
1084 This function saves in LEN the length of that same symbol name but
1085 without either of these suffixes:
29480c32
JB
1086 . .{DIGIT}+
1087 . ${DIGIT}+
1088 . ___{DIGIT}+
1089 . __{DIGIT}+.
c90092fe 1090
29480c32
JB
1091 These are suffixes introduced by the compiler for entities such as
1092 nested subprogram for instance, in order to avoid name clashes.
1093 They do not serve any purpose for the debugger. */
1094
1095static void
1096ada_remove_trailing_digits (const char *encoded, int *len)
1097{
1098 if (*len > 1 && isdigit (encoded[*len - 1]))
1099 {
1100 int i = *len - 2;
5b4ee69b 1101
29480c32
JB
1102 while (i > 0 && isdigit (encoded[i]))
1103 i--;
1104 if (i >= 0 && encoded[i] == '.')
1105 *len = i;
1106 else if (i >= 0 && encoded[i] == '$')
1107 *len = i;
61012eef 1108 else if (i >= 2 && startswith (encoded + i - 2, "___"))
29480c32 1109 *len = i - 2;
61012eef 1110 else if (i >= 1 && startswith (encoded + i - 1, "__"))
29480c32
JB
1111 *len = i - 1;
1112 }
1113}
1114
1115/* Remove the suffix introduced by the compiler for protected object
1116 subprograms. */
1117
1118static void
1119ada_remove_po_subprogram_suffix (const char *encoded, int *len)
1120{
1121 /* Remove trailing N. */
1122
1123 /* Protected entry subprograms are broken into two
1124 separate subprograms: The first one is unprotected, and has
1125 a 'N' suffix; the second is the protected version, and has
0963b4bd 1126 the 'P' suffix. The second calls the first one after handling
29480c32
JB
1127 the protection. Since the P subprograms are internally generated,
1128 we leave these names undecoded, giving the user a clue that this
1129 entity is internal. */
1130
1131 if (*len > 1
1132 && encoded[*len - 1] == 'N'
1133 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
1134 *len = *len - 1;
1135}
1136
69fadcdf
JB
1137/* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1138
1139static void
1140ada_remove_Xbn_suffix (const char *encoded, int *len)
1141{
1142 int i = *len - 1;
1143
1144 while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n'))
1145 i--;
1146
1147 if (encoded[i] != 'X')
1148 return;
1149
1150 if (i == 0)
1151 return;
1152
1153 if (isalnum (encoded[i-1]))
1154 *len = i;
1155}
1156
29480c32
JB
1157/* If ENCODED follows the GNAT entity encoding conventions, then return
1158 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1159 replaced by ENCODED.
14f9c5c9 1160
4c4b4cd2 1161 The resulting string is valid until the next call of ada_decode.
29480c32 1162 If the string is unchanged by decoding, the original string pointer
4c4b4cd2
PH
1163 is returned. */
1164
1165const char *
1166ada_decode (const char *encoded)
14f9c5c9
AS
1167{
1168 int i, j;
1169 int len0;
d2e4a39e 1170 const char *p;
4c4b4cd2 1171 char *decoded;
14f9c5c9 1172 int at_start_name;
4c4b4cd2
PH
1173 static char *decoding_buffer = NULL;
1174 static size_t decoding_buffer_size = 0;
d2e4a39e 1175
0d81f350
JG
1176 /* With function descriptors on PPC64, the value of a symbol named
1177 ".FN", if it exists, is the entry point of the function "FN". */
1178 if (encoded[0] == '.')
1179 encoded += 1;
1180
29480c32
JB
1181 /* The name of the Ada main procedure starts with "_ada_".
1182 This prefix is not part of the decoded name, so skip this part
1183 if we see this prefix. */
61012eef 1184 if (startswith (encoded, "_ada_"))
4c4b4cd2 1185 encoded += 5;
14f9c5c9 1186
29480c32
JB
1187 /* If the name starts with '_', then it is not a properly encoded
1188 name, so do not attempt to decode it. Similarly, if the name
1189 starts with '<', the name should not be decoded. */
4c4b4cd2 1190 if (encoded[0] == '_' || encoded[0] == '<')
14f9c5c9
AS
1191 goto Suppress;
1192
4c4b4cd2 1193 len0 = strlen (encoded);
4c4b4cd2 1194
29480c32
JB
1195 ada_remove_trailing_digits (encoded, &len0);
1196 ada_remove_po_subprogram_suffix (encoded, &len0);
529cad9c 1197
4c4b4cd2
PH
1198 /* Remove the ___X.* suffix if present. Do not forget to verify that
1199 the suffix is located before the current "end" of ENCODED. We want
1200 to avoid re-matching parts of ENCODED that have previously been
1201 marked as discarded (by decrementing LEN0). */
1202 p = strstr (encoded, "___");
1203 if (p != NULL && p - encoded < len0 - 3)
14f9c5c9
AS
1204 {
1205 if (p[3] == 'X')
4c4b4cd2 1206 len0 = p - encoded;
14f9c5c9 1207 else
4c4b4cd2 1208 goto Suppress;
14f9c5c9 1209 }
4c4b4cd2 1210
29480c32
JB
1211 /* Remove any trailing TKB suffix. It tells us that this symbol
1212 is for the body of a task, but that information does not actually
1213 appear in the decoded name. */
1214
61012eef 1215 if (len0 > 3 && startswith (encoded + len0 - 3, "TKB"))
14f9c5c9 1216 len0 -= 3;
76a01679 1217
a10967fa
JB
1218 /* Remove any trailing TB suffix. The TB suffix is slightly different
1219 from the TKB suffix because it is used for non-anonymous task
1220 bodies. */
1221
61012eef 1222 if (len0 > 2 && startswith (encoded + len0 - 2, "TB"))
a10967fa
JB
1223 len0 -= 2;
1224
29480c32
JB
1225 /* Remove trailing "B" suffixes. */
1226 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1227
61012eef 1228 if (len0 > 1 && startswith (encoded + len0 - 1, "B"))
14f9c5c9
AS
1229 len0 -= 1;
1230
4c4b4cd2 1231 /* Make decoded big enough for possible expansion by operator name. */
29480c32 1232
4c4b4cd2
PH
1233 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
1234 decoded = decoding_buffer;
14f9c5c9 1235
29480c32
JB
1236 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1237
4c4b4cd2 1238 if (len0 > 1 && isdigit (encoded[len0 - 1]))
d2e4a39e 1239 {
4c4b4cd2
PH
1240 i = len0 - 2;
1241 while ((i >= 0 && isdigit (encoded[i]))
1242 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
1243 i -= 1;
1244 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
1245 len0 = i - 1;
1246 else if (encoded[i] == '$')
1247 len0 = i;
d2e4a39e 1248 }
14f9c5c9 1249
29480c32
JB
1250 /* The first few characters that are not alphabetic are not part
1251 of any encoding we use, so we can copy them over verbatim. */
1252
4c4b4cd2
PH
1253 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
1254 decoded[j] = encoded[i];
14f9c5c9
AS
1255
1256 at_start_name = 1;
1257 while (i < len0)
1258 {
29480c32 1259 /* Is this a symbol function? */
4c4b4cd2
PH
1260 if (at_start_name && encoded[i] == 'O')
1261 {
1262 int k;
5b4ee69b 1263
4c4b4cd2
PH
1264 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
1265 {
1266 int op_len = strlen (ada_opname_table[k].encoded);
06d5cf63
JB
1267 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
1268 op_len - 1) == 0)
1269 && !isalnum (encoded[i + op_len]))
4c4b4cd2
PH
1270 {
1271 strcpy (decoded + j, ada_opname_table[k].decoded);
1272 at_start_name = 0;
1273 i += op_len;
1274 j += strlen (ada_opname_table[k].decoded);
1275 break;
1276 }
1277 }
1278 if (ada_opname_table[k].encoded != NULL)
1279 continue;
1280 }
14f9c5c9
AS
1281 at_start_name = 0;
1282
529cad9c
PH
1283 /* Replace "TK__" with "__", which will eventually be translated
1284 into "." (just below). */
1285
61012eef 1286 if (i < len0 - 4 && startswith (encoded + i, "TK__"))
4c4b4cd2 1287 i += 2;
529cad9c 1288
29480c32
JB
1289 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1290 be translated into "." (just below). These are internal names
1291 generated for anonymous blocks inside which our symbol is nested. */
1292
1293 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
1294 && encoded [i+2] == 'B' && encoded [i+3] == '_'
1295 && isdigit (encoded [i+4]))
1296 {
1297 int k = i + 5;
1298
1299 while (k < len0 && isdigit (encoded[k]))
1300 k++; /* Skip any extra digit. */
1301
1302 /* Double-check that the "__B_{DIGITS}+" sequence we found
1303 is indeed followed by "__". */
1304 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1305 i = k;
1306 }
1307
529cad9c
PH
1308 /* Remove _E{DIGITS}+[sb] */
1309
1310 /* Just as for protected object subprograms, there are 2 categories
0963b4bd 1311 of subprograms created by the compiler for each entry. The first
529cad9c
PH
1312 one implements the actual entry code, and has a suffix following
1313 the convention above; the second one implements the barrier and
1314 uses the same convention as above, except that the 'E' is replaced
1315 by a 'B'.
1316
1317 Just as above, we do not decode the name of barrier functions
1318 to give the user a clue that the code he is debugging has been
1319 internally generated. */
1320
1321 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1322 && isdigit (encoded[i+2]))
1323 {
1324 int k = i + 3;
1325
1326 while (k < len0 && isdigit (encoded[k]))
1327 k++;
1328
1329 if (k < len0
1330 && (encoded[k] == 'b' || encoded[k] == 's'))
1331 {
1332 k++;
1333 /* Just as an extra precaution, make sure that if this
1334 suffix is followed by anything else, it is a '_'.
1335 Otherwise, we matched this sequence by accident. */
1336 if (k == len0
1337 || (k < len0 && encoded[k] == '_'))
1338 i = k;
1339 }
1340 }
1341
1342 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1343 the GNAT front-end in protected object subprograms. */
1344
1345 if (i < len0 + 3
1346 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1347 {
1348 /* Backtrack a bit up until we reach either the begining of
1349 the encoded name, or "__". Make sure that we only find
1350 digits or lowercase characters. */
1351 const char *ptr = encoded + i - 1;
1352
1353 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1354 ptr--;
1355 if (ptr < encoded
1356 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1357 i++;
1358 }
1359
4c4b4cd2
PH
1360 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1361 {
29480c32
JB
1362 /* This is a X[bn]* sequence not separated from the previous
1363 part of the name with a non-alpha-numeric character (in other
1364 words, immediately following an alpha-numeric character), then
1365 verify that it is placed at the end of the encoded name. If
1366 not, then the encoding is not valid and we should abort the
1367 decoding. Otherwise, just skip it, it is used in body-nested
1368 package names. */
4c4b4cd2
PH
1369 do
1370 i += 1;
1371 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1372 if (i < len0)
1373 goto Suppress;
1374 }
cdc7bb92 1375 else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
4c4b4cd2 1376 {
29480c32 1377 /* Replace '__' by '.'. */
4c4b4cd2
PH
1378 decoded[j] = '.';
1379 at_start_name = 1;
1380 i += 2;
1381 j += 1;
1382 }
14f9c5c9 1383 else
4c4b4cd2 1384 {
29480c32
JB
1385 /* It's a character part of the decoded name, so just copy it
1386 over. */
4c4b4cd2
PH
1387 decoded[j] = encoded[i];
1388 i += 1;
1389 j += 1;
1390 }
14f9c5c9 1391 }
4c4b4cd2 1392 decoded[j] = '\000';
14f9c5c9 1393
29480c32
JB
1394 /* Decoded names should never contain any uppercase character.
1395 Double-check this, and abort the decoding if we find one. */
1396
4c4b4cd2
PH
1397 for (i = 0; decoded[i] != '\0'; i += 1)
1398 if (isupper (decoded[i]) || decoded[i] == ' ')
14f9c5c9
AS
1399 goto Suppress;
1400
4c4b4cd2
PH
1401 if (strcmp (decoded, encoded) == 0)
1402 return encoded;
1403 else
1404 return decoded;
14f9c5c9
AS
1405
1406Suppress:
4c4b4cd2
PH
1407 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1408 decoded = decoding_buffer;
1409 if (encoded[0] == '<')
1410 strcpy (decoded, encoded);
14f9c5c9 1411 else
88c15c34 1412 xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded);
4c4b4cd2
PH
1413 return decoded;
1414
1415}
1416
1417/* Table for keeping permanent unique copies of decoded names. Once
1418 allocated, names in this table are never released. While this is a
1419 storage leak, it should not be significant unless there are massive
1420 changes in the set of decoded names in successive versions of a
1421 symbol table loaded during a single session. */
1422static struct htab *decoded_names_store;
1423
1424/* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1425 in the language-specific part of GSYMBOL, if it has not been
1426 previously computed. Tries to save the decoded name in the same
1427 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1428 in any case, the decoded symbol has a lifetime at least that of
0963b4bd 1429 GSYMBOL).
4c4b4cd2
PH
1430 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1431 const, but nevertheless modified to a semantically equivalent form
0963b4bd 1432 when a decoded name is cached in it. */
4c4b4cd2 1433
45e6c716 1434const char *
f85f34ed 1435ada_decode_symbol (const struct general_symbol_info *arg)
4c4b4cd2 1436{
f85f34ed
TT
1437 struct general_symbol_info *gsymbol = (struct general_symbol_info *) arg;
1438 const char **resultp =
615b3f62 1439 &gsymbol->language_specific.demangled_name;
5b4ee69b 1440
f85f34ed 1441 if (!gsymbol->ada_mangled)
4c4b4cd2
PH
1442 {
1443 const char *decoded = ada_decode (gsymbol->name);
f85f34ed 1444 struct obstack *obstack = gsymbol->language_specific.obstack;
5b4ee69b 1445
f85f34ed 1446 gsymbol->ada_mangled = 1;
5b4ee69b 1447
f85f34ed 1448 if (obstack != NULL)
224c3ddb
SM
1449 *resultp
1450 = (const char *) obstack_copy0 (obstack, decoded, strlen (decoded));
f85f34ed 1451 else
76a01679 1452 {
f85f34ed
TT
1453 /* Sometimes, we can't find a corresponding objfile, in
1454 which case, we put the result on the heap. Since we only
1455 decode when needed, we hope this usually does not cause a
1456 significant memory leak (FIXME). */
1457
76a01679
JB
1458 char **slot = (char **) htab_find_slot (decoded_names_store,
1459 decoded, INSERT);
5b4ee69b 1460
76a01679
JB
1461 if (*slot == NULL)
1462 *slot = xstrdup (decoded);
1463 *resultp = *slot;
1464 }
4c4b4cd2 1465 }
14f9c5c9 1466
4c4b4cd2
PH
1467 return *resultp;
1468}
76a01679 1469
2c0b251b 1470static char *
76a01679 1471ada_la_decode (const char *encoded, int options)
4c4b4cd2
PH
1472{
1473 return xstrdup (ada_decode (encoded));
14f9c5c9
AS
1474}
1475
8b302db8
TT
1476/* Implement la_sniff_from_mangled_name for Ada. */
1477
1478static int
1479ada_sniff_from_mangled_name (const char *mangled, char **out)
1480{
1481 const char *demangled = ada_decode (mangled);
1482
1483 *out = NULL;
1484
1485 if (demangled != mangled && demangled != NULL && demangled[0] != '<')
1486 {
1487 /* Set the gsymbol language to Ada, but still return 0.
1488 Two reasons for that:
1489
1490 1. For Ada, we prefer computing the symbol's decoded name
1491 on the fly rather than pre-compute it, in order to save
1492 memory (Ada projects are typically very large).
1493
1494 2. There are some areas in the definition of the GNAT
1495 encoding where, with a bit of bad luck, we might be able
1496 to decode a non-Ada symbol, generating an incorrect
1497 demangled name (Eg: names ending with "TB" for instance
1498 are identified as task bodies and so stripped from
1499 the decoded name returned).
1500
1501 Returning 1, here, but not setting *DEMANGLED, helps us get a
1502 little bit of the best of both worlds. Because we're last,
1503 we should not affect any of the other languages that were
1504 able to demangle the symbol before us; we get to correctly
1505 tag Ada symbols as such; and even if we incorrectly tagged a
1506 non-Ada symbol, which should be rare, any routing through the
1507 Ada language should be transparent (Ada tries to behave much
1508 like C/C++ with non-Ada symbols). */
1509 return 1;
1510 }
1511
1512 return 0;
1513}
1514
14f9c5c9 1515\f
d2e4a39e 1516
4c4b4cd2 1517 /* Arrays */
14f9c5c9 1518
28c85d6c
JB
1519/* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1520 generated by the GNAT compiler to describe the index type used
1521 for each dimension of an array, check whether it follows the latest
1522 known encoding. If not, fix it up to conform to the latest encoding.
1523 Otherwise, do nothing. This function also does nothing if
1524 INDEX_DESC_TYPE is NULL.
1525
1526 The GNAT encoding used to describle the array index type evolved a bit.
1527 Initially, the information would be provided through the name of each
1528 field of the structure type only, while the type of these fields was
1529 described as unspecified and irrelevant. The debugger was then expected
1530 to perform a global type lookup using the name of that field in order
1531 to get access to the full index type description. Because these global
1532 lookups can be very expensive, the encoding was later enhanced to make
1533 the global lookup unnecessary by defining the field type as being
1534 the full index type description.
1535
1536 The purpose of this routine is to allow us to support older versions
1537 of the compiler by detecting the use of the older encoding, and by
1538 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1539 we essentially replace each field's meaningless type by the associated
1540 index subtype). */
1541
1542void
1543ada_fixup_array_indexes_type (struct type *index_desc_type)
1544{
1545 int i;
1546
1547 if (index_desc_type == NULL)
1548 return;
1549 gdb_assert (TYPE_NFIELDS (index_desc_type) > 0);
1550
1551 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1552 to check one field only, no need to check them all). If not, return
1553 now.
1554
1555 If our INDEX_DESC_TYPE was generated using the older encoding,
1556 the field type should be a meaningless integer type whose name
1557 is not equal to the field name. */
1558 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL
1559 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)),
1560 TYPE_FIELD_NAME (index_desc_type, 0)) == 0)
1561 return;
1562
1563 /* Fixup each field of INDEX_DESC_TYPE. */
1564 for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++)
1565 {
0d5cff50 1566 const char *name = TYPE_FIELD_NAME (index_desc_type, i);
28c85d6c
JB
1567 struct type *raw_type = ada_check_typedef (ada_find_any_type (name));
1568
1569 if (raw_type)
1570 TYPE_FIELD_TYPE (index_desc_type, i) = raw_type;
1571 }
1572}
1573
4c4b4cd2 1574/* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
14f9c5c9 1575
a121b7c1 1576static const char *bound_name[] = {
d2e4a39e 1577 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
14f9c5c9
AS
1578 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1579};
1580
1581/* Maximum number of array dimensions we are prepared to handle. */
1582
4c4b4cd2 1583#define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
14f9c5c9 1584
14f9c5c9 1585
4c4b4cd2
PH
1586/* The desc_* routines return primitive portions of array descriptors
1587 (fat pointers). */
14f9c5c9
AS
1588
1589/* The descriptor or array type, if any, indicated by TYPE; removes
4c4b4cd2
PH
1590 level of indirection, if needed. */
1591
d2e4a39e
AS
1592static struct type *
1593desc_base_type (struct type *type)
14f9c5c9
AS
1594{
1595 if (type == NULL)
1596 return NULL;
61ee279c 1597 type = ada_check_typedef (type);
720d1a40
JB
1598 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
1599 type = ada_typedef_target_type (type);
1600
1265e4aa
JB
1601 if (type != NULL
1602 && (TYPE_CODE (type) == TYPE_CODE_PTR
1603 || TYPE_CODE (type) == TYPE_CODE_REF))
61ee279c 1604 return ada_check_typedef (TYPE_TARGET_TYPE (type));
14f9c5c9
AS
1605 else
1606 return type;
1607}
1608
4c4b4cd2
PH
1609/* True iff TYPE indicates a "thin" array pointer type. */
1610
14f9c5c9 1611static int
d2e4a39e 1612is_thin_pntr (struct type *type)
14f9c5c9 1613{
d2e4a39e 1614 return
14f9c5c9
AS
1615 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1616 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1617}
1618
4c4b4cd2
PH
1619/* The descriptor type for thin pointer type TYPE. */
1620
d2e4a39e
AS
1621static struct type *
1622thin_descriptor_type (struct type *type)
14f9c5c9 1623{
d2e4a39e 1624 struct type *base_type = desc_base_type (type);
5b4ee69b 1625
14f9c5c9
AS
1626 if (base_type == NULL)
1627 return NULL;
1628 if (is_suffix (ada_type_name (base_type), "___XVE"))
1629 return base_type;
d2e4a39e 1630 else
14f9c5c9 1631 {
d2e4a39e 1632 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
5b4ee69b 1633
14f9c5c9 1634 if (alt_type == NULL)
4c4b4cd2 1635 return base_type;
14f9c5c9 1636 else
4c4b4cd2 1637 return alt_type;
14f9c5c9
AS
1638 }
1639}
1640
4c4b4cd2
PH
1641/* A pointer to the array data for thin-pointer value VAL. */
1642
d2e4a39e
AS
1643static struct value *
1644thin_data_pntr (struct value *val)
14f9c5c9 1645{
828292f2 1646 struct type *type = ada_check_typedef (value_type (val));
556bdfd4 1647 struct type *data_type = desc_data_target_type (thin_descriptor_type (type));
5b4ee69b 1648
556bdfd4
UW
1649 data_type = lookup_pointer_type (data_type);
1650
14f9c5c9 1651 if (TYPE_CODE (type) == TYPE_CODE_PTR)
556bdfd4 1652 return value_cast (data_type, value_copy (val));
d2e4a39e 1653 else
42ae5230 1654 return value_from_longest (data_type, value_address (val));
14f9c5c9
AS
1655}
1656
4c4b4cd2
PH
1657/* True iff TYPE indicates a "thick" array pointer type. */
1658
14f9c5c9 1659static int
d2e4a39e 1660is_thick_pntr (struct type *type)
14f9c5c9
AS
1661{
1662 type = desc_base_type (type);
1663 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
4c4b4cd2 1664 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
14f9c5c9
AS
1665}
1666
4c4b4cd2
PH
1667/* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1668 pointer to one, the type of its bounds data; otherwise, NULL. */
76a01679 1669
d2e4a39e
AS
1670static struct type *
1671desc_bounds_type (struct type *type)
14f9c5c9 1672{
d2e4a39e 1673 struct type *r;
14f9c5c9
AS
1674
1675 type = desc_base_type (type);
1676
1677 if (type == NULL)
1678 return NULL;
1679 else if (is_thin_pntr (type))
1680 {
1681 type = thin_descriptor_type (type);
1682 if (type == NULL)
4c4b4cd2 1683 return NULL;
14f9c5c9
AS
1684 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1685 if (r != NULL)
61ee279c 1686 return ada_check_typedef (r);
14f9c5c9
AS
1687 }
1688 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1689 {
1690 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1691 if (r != NULL)
61ee279c 1692 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
14f9c5c9
AS
1693 }
1694 return NULL;
1695}
1696
1697/* If ARR is an array descriptor (fat or thin pointer), or pointer to
4c4b4cd2
PH
1698 one, a pointer to its bounds data. Otherwise NULL. */
1699
d2e4a39e
AS
1700static struct value *
1701desc_bounds (struct value *arr)
14f9c5c9 1702{
df407dfe 1703 struct type *type = ada_check_typedef (value_type (arr));
5b4ee69b 1704
d2e4a39e 1705 if (is_thin_pntr (type))
14f9c5c9 1706 {
d2e4a39e 1707 struct type *bounds_type =
4c4b4cd2 1708 desc_bounds_type (thin_descriptor_type (type));
14f9c5c9
AS
1709 LONGEST addr;
1710
4cdfadb1 1711 if (bounds_type == NULL)
323e0a4a 1712 error (_("Bad GNAT array descriptor"));
14f9c5c9
AS
1713
1714 /* NOTE: The following calculation is not really kosher, but
d2e4a39e 1715 since desc_type is an XVE-encoded type (and shouldn't be),
4c4b4cd2 1716 the correct calculation is a real pain. FIXME (and fix GCC). */
14f9c5c9 1717 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4c4b4cd2 1718 addr = value_as_long (arr);
d2e4a39e 1719 else
42ae5230 1720 addr = value_address (arr);
14f9c5c9 1721
d2e4a39e 1722 return
4c4b4cd2
PH
1723 value_from_longest (lookup_pointer_type (bounds_type),
1724 addr - TYPE_LENGTH (bounds_type));
14f9c5c9
AS
1725 }
1726
1727 else if (is_thick_pntr (type))
05e522ef
JB
1728 {
1729 struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
1730 _("Bad GNAT array descriptor"));
1731 struct type *p_bounds_type = value_type (p_bounds);
1732
1733 if (p_bounds_type
1734 && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR)
1735 {
1736 struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type);
1737
1738 if (TYPE_STUB (target_type))
1739 p_bounds = value_cast (lookup_pointer_type
1740 (ada_check_typedef (target_type)),
1741 p_bounds);
1742 }
1743 else
1744 error (_("Bad GNAT array descriptor"));
1745
1746 return p_bounds;
1747 }
14f9c5c9
AS
1748 else
1749 return NULL;
1750}
1751
4c4b4cd2
PH
1752/* If TYPE is the type of an array-descriptor (fat pointer), the bit
1753 position of the field containing the address of the bounds data. */
1754
14f9c5c9 1755static int
d2e4a39e 1756fat_pntr_bounds_bitpos (struct type *type)
14f9c5c9
AS
1757{
1758 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1759}
1760
1761/* If TYPE is the type of an array-descriptor (fat pointer), the bit
4c4b4cd2
PH
1762 size of the field containing the address of the bounds data. */
1763
14f9c5c9 1764static int
d2e4a39e 1765fat_pntr_bounds_bitsize (struct type *type)
14f9c5c9
AS
1766{
1767 type = desc_base_type (type);
1768
d2e4a39e 1769 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
14f9c5c9
AS
1770 return TYPE_FIELD_BITSIZE (type, 1);
1771 else
61ee279c 1772 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
14f9c5c9
AS
1773}
1774
4c4b4cd2 1775/* If TYPE is the type of an array descriptor (fat or thin pointer) or a
556bdfd4
UW
1776 pointer to one, the type of its array data (a array-with-no-bounds type);
1777 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1778 data. */
4c4b4cd2 1779
d2e4a39e 1780static struct type *
556bdfd4 1781desc_data_target_type (struct type *type)
14f9c5c9
AS
1782{
1783 type = desc_base_type (type);
1784
4c4b4cd2 1785 /* NOTE: The following is bogus; see comment in desc_bounds. */
14f9c5c9 1786 if (is_thin_pntr (type))
556bdfd4 1787 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1));
14f9c5c9 1788 else if (is_thick_pntr (type))
556bdfd4
UW
1789 {
1790 struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1);
1791
1792 if (data_type
1793 && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR)
05e522ef 1794 return ada_check_typedef (TYPE_TARGET_TYPE (data_type));
556bdfd4
UW
1795 }
1796
1797 return NULL;
14f9c5c9
AS
1798}
1799
1800/* If ARR is an array descriptor (fat or thin pointer), a pointer to
1801 its array data. */
4c4b4cd2 1802
d2e4a39e
AS
1803static struct value *
1804desc_data (struct value *arr)
14f9c5c9 1805{
df407dfe 1806 struct type *type = value_type (arr);
5b4ee69b 1807
14f9c5c9
AS
1808 if (is_thin_pntr (type))
1809 return thin_data_pntr (arr);
1810 else if (is_thick_pntr (type))
d2e4a39e 1811 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
323e0a4a 1812 _("Bad GNAT array descriptor"));
14f9c5c9
AS
1813 else
1814 return NULL;
1815}
1816
1817
1818/* If TYPE is the type of an array-descriptor (fat pointer), the bit
4c4b4cd2
PH
1819 position of the field containing the address of the data. */
1820
14f9c5c9 1821static int
d2e4a39e 1822fat_pntr_data_bitpos (struct type *type)
14f9c5c9
AS
1823{
1824 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1825}
1826
1827/* If TYPE is the type of an array-descriptor (fat pointer), the bit
4c4b4cd2
PH
1828 size of the field containing the address of the data. */
1829
14f9c5c9 1830static int
d2e4a39e 1831fat_pntr_data_bitsize (struct type *type)
14f9c5c9
AS
1832{
1833 type = desc_base_type (type);
1834
1835 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1836 return TYPE_FIELD_BITSIZE (type, 0);
d2e4a39e 1837 else
14f9c5c9
AS
1838 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1839}
1840
4c4b4cd2 1841/* If BOUNDS is an array-bounds structure (or pointer to one), return
14f9c5c9 1842 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
4c4b4cd2
PH
1843 bound, if WHICH is 1. The first bound is I=1. */
1844
d2e4a39e
AS
1845static struct value *
1846desc_one_bound (struct value *bounds, int i, int which)
14f9c5c9 1847{
d2e4a39e 1848 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
323e0a4a 1849 _("Bad GNAT array descriptor bounds"));
14f9c5c9
AS
1850}
1851
1852/* If BOUNDS is an array-bounds structure type, return the bit position
1853 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
4c4b4cd2
PH
1854 bound, if WHICH is 1. The first bound is I=1. */
1855
14f9c5c9 1856static int
d2e4a39e 1857desc_bound_bitpos (struct type *type, int i, int which)
14f9c5c9 1858{
d2e4a39e 1859 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
14f9c5c9
AS
1860}
1861
1862/* If BOUNDS is an array-bounds structure type, return the bit field size
1863 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
4c4b4cd2
PH
1864 bound, if WHICH is 1. The first bound is I=1. */
1865
76a01679 1866static int
d2e4a39e 1867desc_bound_bitsize (struct type *type, int i, int which)
14f9c5c9
AS
1868{
1869 type = desc_base_type (type);
1870
d2e4a39e
AS
1871 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1872 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1873 else
1874 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
14f9c5c9
AS
1875}
1876
1877/* If TYPE is the type of an array-bounds structure, the type of its
4c4b4cd2
PH
1878 Ith bound (numbering from 1). Otherwise, NULL. */
1879
d2e4a39e
AS
1880static struct type *
1881desc_index_type (struct type *type, int i)
14f9c5c9
AS
1882{
1883 type = desc_base_type (type);
1884
1885 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
d2e4a39e
AS
1886 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1887 else
14f9c5c9
AS
1888 return NULL;
1889}
1890
4c4b4cd2
PH
1891/* The number of index positions in the array-bounds type TYPE.
1892 Return 0 if TYPE is NULL. */
1893
14f9c5c9 1894static int
d2e4a39e 1895desc_arity (struct type *type)
14f9c5c9
AS
1896{
1897 type = desc_base_type (type);
1898
1899 if (type != NULL)
1900 return TYPE_NFIELDS (type) / 2;
1901 return 0;
1902}
1903
4c4b4cd2
PH
1904/* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1905 an array descriptor type (representing an unconstrained array
1906 type). */
1907
76a01679
JB
1908static int
1909ada_is_direct_array_type (struct type *type)
4c4b4cd2
PH
1910{
1911 if (type == NULL)
1912 return 0;
61ee279c 1913 type = ada_check_typedef (type);
4c4b4cd2 1914 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
76a01679 1915 || ada_is_array_descriptor_type (type));
4c4b4cd2
PH
1916}
1917
52ce6436 1918/* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
0963b4bd 1919 * to one. */
52ce6436 1920
2c0b251b 1921static int
52ce6436
PH
1922ada_is_array_type (struct type *type)
1923{
1924 while (type != NULL
1925 && (TYPE_CODE (type) == TYPE_CODE_PTR
1926 || TYPE_CODE (type) == TYPE_CODE_REF))
1927 type = TYPE_TARGET_TYPE (type);
1928 return ada_is_direct_array_type (type);
1929}
1930
4c4b4cd2 1931/* Non-zero iff TYPE is a simple array type or pointer to one. */
14f9c5c9 1932
14f9c5c9 1933int
4c4b4cd2 1934ada_is_simple_array_type (struct type *type)
14f9c5c9
AS
1935{
1936 if (type == NULL)
1937 return 0;
61ee279c 1938 type = ada_check_typedef (type);
14f9c5c9 1939 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
4c4b4cd2 1940 || (TYPE_CODE (type) == TYPE_CODE_PTR
b0dd7688
JB
1941 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type)))
1942 == TYPE_CODE_ARRAY));
14f9c5c9
AS
1943}
1944
4c4b4cd2
PH
1945/* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1946
14f9c5c9 1947int
4c4b4cd2 1948ada_is_array_descriptor_type (struct type *type)
14f9c5c9 1949{
556bdfd4 1950 struct type *data_type = desc_data_target_type (type);
14f9c5c9
AS
1951
1952 if (type == NULL)
1953 return 0;
61ee279c 1954 type = ada_check_typedef (type);
556bdfd4
UW
1955 return (data_type != NULL
1956 && TYPE_CODE (data_type) == TYPE_CODE_ARRAY
1957 && desc_arity (desc_bounds_type (type)) > 0);
14f9c5c9
AS
1958}
1959
1960/* Non-zero iff type is a partially mal-formed GNAT array
4c4b4cd2 1961 descriptor. FIXME: This is to compensate for some problems with
14f9c5c9 1962 debugging output from GNAT. Re-examine periodically to see if it
4c4b4cd2
PH
1963 is still needed. */
1964
14f9c5c9 1965int
ebf56fd3 1966ada_is_bogus_array_descriptor (struct type *type)
14f9c5c9 1967{
d2e4a39e 1968 return
14f9c5c9
AS
1969 type != NULL
1970 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1971 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
4c4b4cd2
PH
1972 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1973 && !ada_is_array_descriptor_type (type);
14f9c5c9
AS
1974}
1975
1976
4c4b4cd2 1977/* If ARR has a record type in the form of a standard GNAT array descriptor,
14f9c5c9 1978 (fat pointer) returns the type of the array data described---specifically,
4c4b4cd2 1979 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
14f9c5c9 1980 in from the descriptor; otherwise, they are left unspecified. If
4c4b4cd2
PH
1981 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1982 returns NULL. The result is simply the type of ARR if ARR is not
14f9c5c9 1983 a descriptor. */
d2e4a39e
AS
1984struct type *
1985ada_type_of_array (struct value *arr, int bounds)
14f9c5c9 1986{
ad82864c
JB
1987 if (ada_is_constrained_packed_array_type (value_type (arr)))
1988 return decode_constrained_packed_array_type (value_type (arr));
14f9c5c9 1989
df407dfe
AC
1990 if (!ada_is_array_descriptor_type (value_type (arr)))
1991 return value_type (arr);
d2e4a39e
AS
1992
1993 if (!bounds)
ad82864c
JB
1994 {
1995 struct type *array_type =
1996 ada_check_typedef (desc_data_target_type (value_type (arr)));
1997
1998 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
1999 TYPE_FIELD_BITSIZE (array_type, 0) =
2000 decode_packed_array_bitsize (value_type (arr));
2001
2002 return array_type;
2003 }
14f9c5c9
AS
2004 else
2005 {
d2e4a39e 2006 struct type *elt_type;
14f9c5c9 2007 int arity;
d2e4a39e 2008 struct value *descriptor;
14f9c5c9 2009
df407dfe
AC
2010 elt_type = ada_array_element_type (value_type (arr), -1);
2011 arity = ada_array_arity (value_type (arr));
14f9c5c9 2012
d2e4a39e 2013 if (elt_type == NULL || arity == 0)
df407dfe 2014 return ada_check_typedef (value_type (arr));
14f9c5c9
AS
2015
2016 descriptor = desc_bounds (arr);
d2e4a39e 2017 if (value_as_long (descriptor) == 0)
4c4b4cd2 2018 return NULL;
d2e4a39e 2019 while (arity > 0)
4c4b4cd2 2020 {
e9bb382b
UW
2021 struct type *range_type = alloc_type_copy (value_type (arr));
2022 struct type *array_type = alloc_type_copy (value_type (arr));
4c4b4cd2
PH
2023 struct value *low = desc_one_bound (descriptor, arity, 0);
2024 struct value *high = desc_one_bound (descriptor, arity, 1);
4c4b4cd2 2025
5b4ee69b 2026 arity -= 1;
0c9c3474
SA
2027 create_static_range_type (range_type, value_type (low),
2028 longest_to_int (value_as_long (low)),
2029 longest_to_int (value_as_long (high)));
4c4b4cd2 2030 elt_type = create_array_type (array_type, elt_type, range_type);
ad82864c
JB
2031
2032 if (ada_is_unconstrained_packed_array_type (value_type (arr)))
e67ad678
JB
2033 {
2034 /* We need to store the element packed bitsize, as well as
2035 recompute the array size, because it was previously
2036 computed based on the unpacked element size. */
2037 LONGEST lo = value_as_long (low);
2038 LONGEST hi = value_as_long (high);
2039
2040 TYPE_FIELD_BITSIZE (elt_type, 0) =
2041 decode_packed_array_bitsize (value_type (arr));
2042 /* If the array has no element, then the size is already
2043 zero, and does not need to be recomputed. */
2044 if (lo < hi)
2045 {
2046 int array_bitsize =
2047 (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0);
2048
2049 TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8;
2050 }
2051 }
4c4b4cd2 2052 }
14f9c5c9
AS
2053
2054 return lookup_pointer_type (elt_type);
2055 }
2056}
2057
2058/* If ARR does not represent an array, returns ARR unchanged.
4c4b4cd2
PH
2059 Otherwise, returns either a standard GDB array with bounds set
2060 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
2061 GDB array. Returns NULL if ARR is a null fat pointer. */
2062
d2e4a39e
AS
2063struct value *
2064ada_coerce_to_simple_array_ptr (struct value *arr)
14f9c5c9 2065{
df407dfe 2066 if (ada_is_array_descriptor_type (value_type (arr)))
14f9c5c9 2067 {
d2e4a39e 2068 struct type *arrType = ada_type_of_array (arr, 1);
5b4ee69b 2069
14f9c5c9 2070 if (arrType == NULL)
4c4b4cd2 2071 return NULL;
14f9c5c9
AS
2072 return value_cast (arrType, value_copy (desc_data (arr)));
2073 }
ad82864c
JB
2074 else if (ada_is_constrained_packed_array_type (value_type (arr)))
2075 return decode_constrained_packed_array (arr);
14f9c5c9
AS
2076 else
2077 return arr;
2078}
2079
2080/* If ARR does not represent an array, returns ARR unchanged.
2081 Otherwise, returns a standard GDB array describing ARR (which may
4c4b4cd2
PH
2082 be ARR itself if it already is in the proper form). */
2083
720d1a40 2084struct value *
d2e4a39e 2085ada_coerce_to_simple_array (struct value *arr)
14f9c5c9 2086{
df407dfe 2087 if (ada_is_array_descriptor_type (value_type (arr)))
14f9c5c9 2088 {
d2e4a39e 2089 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
5b4ee69b 2090
14f9c5c9 2091 if (arrVal == NULL)
323e0a4a 2092 error (_("Bounds unavailable for null array pointer."));
c1b5a1a6 2093 ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal)));
14f9c5c9
AS
2094 return value_ind (arrVal);
2095 }
ad82864c
JB
2096 else if (ada_is_constrained_packed_array_type (value_type (arr)))
2097 return decode_constrained_packed_array (arr);
d2e4a39e 2098 else
14f9c5c9
AS
2099 return arr;
2100}
2101
2102/* If TYPE represents a GNAT array type, return it translated to an
2103 ordinary GDB array type (possibly with BITSIZE fields indicating
4c4b4cd2
PH
2104 packing). For other types, is the identity. */
2105
d2e4a39e
AS
2106struct type *
2107ada_coerce_to_simple_array_type (struct type *type)
14f9c5c9 2108{
ad82864c
JB
2109 if (ada_is_constrained_packed_array_type (type))
2110 return decode_constrained_packed_array_type (type);
17280b9f
UW
2111
2112 if (ada_is_array_descriptor_type (type))
556bdfd4 2113 return ada_check_typedef (desc_data_target_type (type));
17280b9f
UW
2114
2115 return type;
14f9c5c9
AS
2116}
2117
4c4b4cd2
PH
2118/* Non-zero iff TYPE represents a standard GNAT packed-array type. */
2119
ad82864c
JB
2120static int
2121ada_is_packed_array_type (struct type *type)
14f9c5c9
AS
2122{
2123 if (type == NULL)
2124 return 0;
4c4b4cd2 2125 type = desc_base_type (type);
61ee279c 2126 type = ada_check_typedef (type);
d2e4a39e 2127 return
14f9c5c9
AS
2128 ada_type_name (type) != NULL
2129 && strstr (ada_type_name (type), "___XP") != NULL;
2130}
2131
ad82864c
JB
2132/* Non-zero iff TYPE represents a standard GNAT constrained
2133 packed-array type. */
2134
2135int
2136ada_is_constrained_packed_array_type (struct type *type)
2137{
2138 return ada_is_packed_array_type (type)
2139 && !ada_is_array_descriptor_type (type);
2140}
2141
2142/* Non-zero iff TYPE represents an array descriptor for a
2143 unconstrained packed-array type. */
2144
2145static int
2146ada_is_unconstrained_packed_array_type (struct type *type)
2147{
2148 return ada_is_packed_array_type (type)
2149 && ada_is_array_descriptor_type (type);
2150}
2151
2152/* Given that TYPE encodes a packed array type (constrained or unconstrained),
2153 return the size of its elements in bits. */
2154
2155static long
2156decode_packed_array_bitsize (struct type *type)
2157{
0d5cff50
DE
2158 const char *raw_name;
2159 const char *tail;
ad82864c
JB
2160 long bits;
2161
720d1a40
JB
2162 /* Access to arrays implemented as fat pointers are encoded as a typedef
2163 of the fat pointer type. We need the name of the fat pointer type
2164 to do the decoding, so strip the typedef layer. */
2165 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
2166 type = ada_typedef_target_type (type);
2167
2168 raw_name = ada_type_name (ada_check_typedef (type));
ad82864c
JB
2169 if (!raw_name)
2170 raw_name = ada_type_name (desc_base_type (type));
2171
2172 if (!raw_name)
2173 return 0;
2174
2175 tail = strstr (raw_name, "___XP");
720d1a40 2176 gdb_assert (tail != NULL);
ad82864c
JB
2177
2178 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
2179 {
2180 lim_warning
2181 (_("could not understand bit size information on packed array"));
2182 return 0;
2183 }
2184
2185 return bits;
2186}
2187
14f9c5c9
AS
2188/* Given that TYPE is a standard GDB array type with all bounds filled
2189 in, and that the element size of its ultimate scalar constituents
2190 (that is, either its elements, or, if it is an array of arrays, its
2191 elements' elements, etc.) is *ELT_BITS, return an identical type,
2192 but with the bit sizes of its elements (and those of any
2193 constituent arrays) recorded in the BITSIZE components of its
4c4b4cd2 2194 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
4a46959e
JB
2195 in bits.
2196
2197 Note that, for arrays whose index type has an XA encoding where
2198 a bound references a record discriminant, getting that discriminant,
2199 and therefore the actual value of that bound, is not possible
2200 because none of the given parameters gives us access to the record.
2201 This function assumes that it is OK in the context where it is being
2202 used to return an array whose bounds are still dynamic and where
2203 the length is arbitrary. */
4c4b4cd2 2204
d2e4a39e 2205static struct type *
ad82864c 2206constrained_packed_array_type (struct type *type, long *elt_bits)
14f9c5c9 2207{
d2e4a39e
AS
2208 struct type *new_elt_type;
2209 struct type *new_type;
99b1c762
JB
2210 struct type *index_type_desc;
2211 struct type *index_type;
14f9c5c9
AS
2212 LONGEST low_bound, high_bound;
2213
61ee279c 2214 type = ada_check_typedef (type);
14f9c5c9
AS
2215 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
2216 return type;
2217
99b1c762
JB
2218 index_type_desc = ada_find_parallel_type (type, "___XA");
2219 if (index_type_desc)
2220 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, 0),
2221 NULL);
2222 else
2223 index_type = TYPE_INDEX_TYPE (type);
2224
e9bb382b 2225 new_type = alloc_type_copy (type);
ad82864c
JB
2226 new_elt_type =
2227 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
2228 elt_bits);
99b1c762 2229 create_array_type (new_type, new_elt_type, index_type);
14f9c5c9
AS
2230 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
2231 TYPE_NAME (new_type) = ada_type_name (type);
2232
4a46959e
JB
2233 if ((TYPE_CODE (check_typedef (index_type)) == TYPE_CODE_RANGE
2234 && is_dynamic_type (check_typedef (index_type)))
2235 || get_discrete_bounds (index_type, &low_bound, &high_bound) < 0)
14f9c5c9
AS
2236 low_bound = high_bound = 0;
2237 if (high_bound < low_bound)
2238 *elt_bits = TYPE_LENGTH (new_type) = 0;
d2e4a39e 2239 else
14f9c5c9
AS
2240 {
2241 *elt_bits *= (high_bound - low_bound + 1);
d2e4a39e 2242 TYPE_LENGTH (new_type) =
4c4b4cd2 2243 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
14f9c5c9
AS
2244 }
2245
876cecd0 2246 TYPE_FIXED_INSTANCE (new_type) = 1;
14f9c5c9
AS
2247 return new_type;
2248}
2249
ad82864c
JB
2250/* The array type encoded by TYPE, where
2251 ada_is_constrained_packed_array_type (TYPE). */
4c4b4cd2 2252
d2e4a39e 2253static struct type *
ad82864c 2254decode_constrained_packed_array_type (struct type *type)
d2e4a39e 2255{
0d5cff50 2256 const char *raw_name = ada_type_name (ada_check_typedef (type));
727e3d2e 2257 char *name;
0d5cff50 2258 const char *tail;
d2e4a39e 2259 struct type *shadow_type;
14f9c5c9 2260 long bits;
14f9c5c9 2261
727e3d2e
JB
2262 if (!raw_name)
2263 raw_name = ada_type_name (desc_base_type (type));
2264
2265 if (!raw_name)
2266 return NULL;
2267
2268 name = (char *) alloca (strlen (raw_name) + 1);
2269 tail = strstr (raw_name, "___XP");
4c4b4cd2
PH
2270 type = desc_base_type (type);
2271
14f9c5c9
AS
2272 memcpy (name, raw_name, tail - raw_name);
2273 name[tail - raw_name] = '\000';
2274
b4ba55a1
JB
2275 shadow_type = ada_find_parallel_type_with_name (type, name);
2276
2277 if (shadow_type == NULL)
14f9c5c9 2278 {
323e0a4a 2279 lim_warning (_("could not find bounds information on packed array"));
14f9c5c9
AS
2280 return NULL;
2281 }
f168693b 2282 shadow_type = check_typedef (shadow_type);
14f9c5c9
AS
2283
2284 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
2285 {
0963b4bd
MS
2286 lim_warning (_("could not understand bounds "
2287 "information on packed array"));
14f9c5c9
AS
2288 return NULL;
2289 }
d2e4a39e 2290
ad82864c
JB
2291 bits = decode_packed_array_bitsize (type);
2292 return constrained_packed_array_type (shadow_type, &bits);
14f9c5c9
AS
2293}
2294
ad82864c
JB
2295/* Given that ARR is a struct value *indicating a GNAT constrained packed
2296 array, returns a simple array that denotes that array. Its type is a
14f9c5c9
AS
2297 standard GDB array type except that the BITSIZEs of the array
2298 target types are set to the number of bits in each element, and the
4c4b4cd2 2299 type length is set appropriately. */
14f9c5c9 2300
d2e4a39e 2301static struct value *
ad82864c 2302decode_constrained_packed_array (struct value *arr)
14f9c5c9 2303{
4c4b4cd2 2304 struct type *type;
14f9c5c9 2305
11aa919a
PMR
2306 /* If our value is a pointer, then dereference it. Likewise if
2307 the value is a reference. Make sure that this operation does not
2308 cause the target type to be fixed, as this would indirectly cause
2309 this array to be decoded. The rest of the routine assumes that
2310 the array hasn't been decoded yet, so we use the basic "coerce_ref"
2311 and "value_ind" routines to perform the dereferencing, as opposed
2312 to using "ada_coerce_ref" or "ada_value_ind". */
2313 arr = coerce_ref (arr);
828292f2 2314 if (TYPE_CODE (ada_check_typedef (value_type (arr))) == TYPE_CODE_PTR)
284614f0 2315 arr = value_ind (arr);
4c4b4cd2 2316
ad82864c 2317 type = decode_constrained_packed_array_type (value_type (arr));
14f9c5c9
AS
2318 if (type == NULL)
2319 {
323e0a4a 2320 error (_("can't unpack array"));
14f9c5c9
AS
2321 return NULL;
2322 }
61ee279c 2323
50810684 2324 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr)))
32c9a795 2325 && ada_is_modular_type (value_type (arr)))
61ee279c
PH
2326 {
2327 /* This is a (right-justified) modular type representing a packed
2328 array with no wrapper. In order to interpret the value through
2329 the (left-justified) packed array type we just built, we must
2330 first left-justify it. */
2331 int bit_size, bit_pos;
2332 ULONGEST mod;
2333
df407dfe 2334 mod = ada_modulus (value_type (arr)) - 1;
61ee279c
PH
2335 bit_size = 0;
2336 while (mod > 0)
2337 {
2338 bit_size += 1;
2339 mod >>= 1;
2340 }
df407dfe 2341 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
61ee279c
PH
2342 arr = ada_value_primitive_packed_val (arr, NULL,
2343 bit_pos / HOST_CHAR_BIT,
2344 bit_pos % HOST_CHAR_BIT,
2345 bit_size,
2346 type);
2347 }
2348
4c4b4cd2 2349 return coerce_unspec_val_to_type (arr, type);
14f9c5c9
AS
2350}
2351
2352
2353/* The value of the element of packed array ARR at the ARITY indices
4c4b4cd2 2354 given in IND. ARR must be a simple array. */
14f9c5c9 2355
d2e4a39e
AS
2356static struct value *
2357value_subscript_packed (struct value *arr, int arity, struct value **ind)
14f9c5c9
AS
2358{
2359 int i;
2360 int bits, elt_off, bit_off;
2361 long elt_total_bit_offset;
d2e4a39e
AS
2362 struct type *elt_type;
2363 struct value *v;
14f9c5c9
AS
2364
2365 bits = 0;
2366 elt_total_bit_offset = 0;
df407dfe 2367 elt_type = ada_check_typedef (value_type (arr));
d2e4a39e 2368 for (i = 0; i < arity; i += 1)
14f9c5c9 2369 {
d2e4a39e 2370 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
4c4b4cd2
PH
2371 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
2372 error
0963b4bd
MS
2373 (_("attempt to do packed indexing of "
2374 "something other than a packed array"));
14f9c5c9 2375 else
4c4b4cd2
PH
2376 {
2377 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
2378 LONGEST lowerbound, upperbound;
2379 LONGEST idx;
2380
2381 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
2382 {
323e0a4a 2383 lim_warning (_("don't know bounds of array"));
4c4b4cd2
PH
2384 lowerbound = upperbound = 0;
2385 }
2386
3cb382c9 2387 idx = pos_atr (ind[i]);
4c4b4cd2 2388 if (idx < lowerbound || idx > upperbound)
0963b4bd
MS
2389 lim_warning (_("packed array index %ld out of bounds"),
2390 (long) idx);
4c4b4cd2
PH
2391 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
2392 elt_total_bit_offset += (idx - lowerbound) * bits;
61ee279c 2393 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
4c4b4cd2 2394 }
14f9c5c9
AS
2395 }
2396 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
2397 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
d2e4a39e
AS
2398
2399 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
4c4b4cd2 2400 bits, elt_type);
14f9c5c9
AS
2401 return v;
2402}
2403
4c4b4cd2 2404/* Non-zero iff TYPE includes negative integer values. */
14f9c5c9
AS
2405
2406static int
d2e4a39e 2407has_negatives (struct type *type)
14f9c5c9 2408{
d2e4a39e
AS
2409 switch (TYPE_CODE (type))
2410 {
2411 default:
2412 return 0;
2413 case TYPE_CODE_INT:
2414 return !TYPE_UNSIGNED (type);
2415 case TYPE_CODE_RANGE:
2416 return TYPE_LOW_BOUND (type) < 0;
2417 }
14f9c5c9 2418}
d2e4a39e 2419
f93fca70 2420/* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET,
5b639dea 2421 unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of
f93fca70 2422 the unpacked buffer.
14f9c5c9 2423
5b639dea
JB
2424 The size of the unpacked buffer (UNPACKED_LEN) is expected to be large
2425 enough to contain at least BIT_OFFSET bits. If not, an error is raised.
2426
f93fca70
JB
2427 IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode,
2428 zero otherwise.
14f9c5c9 2429
f93fca70 2430 IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type.
a1c95e6b 2431
f93fca70
JB
2432 IS_SCALAR is nonzero if the data corresponds to a signed type. */
2433
2434static void
2435ada_unpack_from_contents (const gdb_byte *src, int bit_offset, int bit_size,
2436 gdb_byte *unpacked, int unpacked_len,
2437 int is_big_endian, int is_signed_type,
2438 int is_scalar)
2439{
a1c95e6b
JB
2440 int src_len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
2441 int src_idx; /* Index into the source area */
2442 int src_bytes_left; /* Number of source bytes left to process. */
2443 int srcBitsLeft; /* Number of source bits left to move */
2444 int unusedLS; /* Number of bits in next significant
2445 byte of source that are unused */
2446
a1c95e6b
JB
2447 int unpacked_idx; /* Index into the unpacked buffer */
2448 int unpacked_bytes_left; /* Number of bytes left to set in unpacked. */
2449
4c4b4cd2 2450 unsigned long accum; /* Staging area for bits being transferred */
a1c95e6b 2451 int accumSize; /* Number of meaningful bits in accum */
14f9c5c9 2452 unsigned char sign;
a1c95e6b 2453
4c4b4cd2
PH
2454 /* Transmit bytes from least to most significant; delta is the direction
2455 the indices move. */
f93fca70 2456 int delta = is_big_endian ? -1 : 1;
14f9c5c9 2457
5b639dea
JB
2458 /* Make sure that unpacked is large enough to receive the BIT_SIZE
2459 bits from SRC. .*/
2460 if ((bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT > unpacked_len)
2461 error (_("Cannot unpack %d bits into buffer of %d bytes"),
2462 bit_size, unpacked_len);
2463
14f9c5c9 2464 srcBitsLeft = bit_size;
086ca51f 2465 src_bytes_left = src_len;
f93fca70 2466 unpacked_bytes_left = unpacked_len;
14f9c5c9 2467 sign = 0;
f93fca70
JB
2468
2469 if (is_big_endian)
14f9c5c9 2470 {
086ca51f 2471 src_idx = src_len - 1;
f93fca70
JB
2472 if (is_signed_type
2473 && ((src[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
4c4b4cd2 2474 sign = ~0;
d2e4a39e
AS
2475
2476 unusedLS =
4c4b4cd2
PH
2477 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2478 % HOST_CHAR_BIT;
14f9c5c9 2479
f93fca70
JB
2480 if (is_scalar)
2481 {
2482 accumSize = 0;
2483 unpacked_idx = unpacked_len - 1;
2484 }
2485 else
2486 {
4c4b4cd2
PH
2487 /* Non-scalar values must be aligned at a byte boundary... */
2488 accumSize =
2489 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2490 /* ... And are placed at the beginning (most-significant) bytes
2491 of the target. */
086ca51f
JB
2492 unpacked_idx = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
2493 unpacked_bytes_left = unpacked_idx + 1;
f93fca70 2494 }
14f9c5c9 2495 }
d2e4a39e 2496 else
14f9c5c9
AS
2497 {
2498 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2499
086ca51f 2500 src_idx = unpacked_idx = 0;
14f9c5c9
AS
2501 unusedLS = bit_offset;
2502 accumSize = 0;
2503
f93fca70 2504 if (is_signed_type && (src[src_len - 1] & (1 << sign_bit_offset)))
4c4b4cd2 2505 sign = ~0;
14f9c5c9 2506 }
d2e4a39e 2507
14f9c5c9 2508 accum = 0;
086ca51f 2509 while (src_bytes_left > 0)
14f9c5c9
AS
2510 {
2511 /* Mask for removing bits of the next source byte that are not
4c4b4cd2 2512 part of the value. */
d2e4a39e 2513 unsigned int unusedMSMask =
4c4b4cd2
PH
2514 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2515 1;
2516 /* Sign-extend bits for this byte. */
14f9c5c9 2517 unsigned int signMask = sign & ~unusedMSMask;
5b4ee69b 2518
d2e4a39e 2519 accum |=
086ca51f 2520 (((src[src_idx] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
14f9c5c9 2521 accumSize += HOST_CHAR_BIT - unusedLS;
d2e4a39e 2522 if (accumSize >= HOST_CHAR_BIT)
4c4b4cd2 2523 {
db297a65 2524 unpacked[unpacked_idx] = accum & ~(~0UL << HOST_CHAR_BIT);
4c4b4cd2
PH
2525 accumSize -= HOST_CHAR_BIT;
2526 accum >>= HOST_CHAR_BIT;
086ca51f
JB
2527 unpacked_bytes_left -= 1;
2528 unpacked_idx += delta;
4c4b4cd2 2529 }
14f9c5c9
AS
2530 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2531 unusedLS = 0;
086ca51f
JB
2532 src_bytes_left -= 1;
2533 src_idx += delta;
14f9c5c9 2534 }
086ca51f 2535 while (unpacked_bytes_left > 0)
14f9c5c9
AS
2536 {
2537 accum |= sign << accumSize;
db297a65 2538 unpacked[unpacked_idx] = accum & ~(~0UL << HOST_CHAR_BIT);
14f9c5c9 2539 accumSize -= HOST_CHAR_BIT;
9cd4d857
JB
2540 if (accumSize < 0)
2541 accumSize = 0;
14f9c5c9 2542 accum >>= HOST_CHAR_BIT;
086ca51f
JB
2543 unpacked_bytes_left -= 1;
2544 unpacked_idx += delta;
14f9c5c9 2545 }
f93fca70
JB
2546}
2547
2548/* Create a new value of type TYPE from the contents of OBJ starting
2549 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2550 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2551 assigning through the result will set the field fetched from.
2552 VALADDR is ignored unless OBJ is NULL, in which case,
2553 VALADDR+OFFSET must address the start of storage containing the
2554 packed value. The value returned in this case is never an lval.
2555 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2556
2557struct value *
2558ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
2559 long offset, int bit_offset, int bit_size,
2560 struct type *type)
2561{
2562 struct value *v;
bfb1c796 2563 const gdb_byte *src; /* First byte containing data to unpack */
f93fca70 2564 gdb_byte *unpacked;
220475ed 2565 const int is_scalar = is_scalar_type (type);
d0a9e810 2566 const int is_big_endian = gdbarch_bits_big_endian (get_type_arch (type));
d5722aa2 2567 gdb::byte_vector staging;
f93fca70
JB
2568
2569 type = ada_check_typedef (type);
2570
d0a9e810 2571 if (obj == NULL)
bfb1c796 2572 src = valaddr + offset;
d0a9e810 2573 else
bfb1c796 2574 src = value_contents (obj) + offset;
d0a9e810
JB
2575
2576 if (is_dynamic_type (type))
2577 {
2578 /* The length of TYPE might by dynamic, so we need to resolve
2579 TYPE in order to know its actual size, which we then use
2580 to create the contents buffer of the value we return.
2581 The difficulty is that the data containing our object is
2582 packed, and therefore maybe not at a byte boundary. So, what
2583 we do, is unpack the data into a byte-aligned buffer, and then
2584 use that buffer as our object's value for resolving the type. */
d5722aa2
PA
2585 int staging_len = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
2586 staging.resize (staging_len);
d0a9e810
JB
2587
2588 ada_unpack_from_contents (src, bit_offset, bit_size,
d5722aa2 2589 staging.data (), staging.size (),
d0a9e810
JB
2590 is_big_endian, has_negatives (type),
2591 is_scalar);
d5722aa2 2592 type = resolve_dynamic_type (type, staging.data (), 0);
0cafa88c
JB
2593 if (TYPE_LENGTH (type) < (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT)
2594 {
2595 /* This happens when the length of the object is dynamic,
2596 and is actually smaller than the space reserved for it.
2597 For instance, in an array of variant records, the bit_size
2598 we're given is the array stride, which is constant and
2599 normally equal to the maximum size of its element.
2600 But, in reality, each element only actually spans a portion
2601 of that stride. */
2602 bit_size = TYPE_LENGTH (type) * HOST_CHAR_BIT;
2603 }
d0a9e810
JB
2604 }
2605
f93fca70
JB
2606 if (obj == NULL)
2607 {
2608 v = allocate_value (type);
bfb1c796 2609 src = valaddr + offset;
f93fca70
JB
2610 }
2611 else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj))
2612 {
0cafa88c 2613 int src_len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
bfb1c796 2614 gdb_byte *buf;
0cafa88c 2615
f93fca70 2616 v = value_at (type, value_address (obj) + offset);
bfb1c796
PA
2617 buf = (gdb_byte *) alloca (src_len);
2618 read_memory (value_address (v), buf, src_len);
2619 src = buf;
f93fca70
JB
2620 }
2621 else
2622 {
2623 v = allocate_value (type);
bfb1c796 2624 src = value_contents (obj) + offset;
f93fca70
JB
2625 }
2626
2627 if (obj != NULL)
2628 {
2629 long new_offset = offset;
2630
2631 set_value_component_location (v, obj);
2632 set_value_bitpos (v, bit_offset + value_bitpos (obj));
2633 set_value_bitsize (v, bit_size);
2634 if (value_bitpos (v) >= HOST_CHAR_BIT)
2635 {
2636 ++new_offset;
2637 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
2638 }
2639 set_value_offset (v, new_offset);
2640
2641 /* Also set the parent value. This is needed when trying to
2642 assign a new value (in inferior memory). */
2643 set_value_parent (v, obj);
2644 }
2645 else
2646 set_value_bitsize (v, bit_size);
bfb1c796 2647 unpacked = value_contents_writeable (v);
f93fca70
JB
2648
2649 if (bit_size == 0)
2650 {
2651 memset (unpacked, 0, TYPE_LENGTH (type));
2652 return v;
2653 }
2654
d5722aa2 2655 if (staging.size () == TYPE_LENGTH (type))
f93fca70 2656 {
d0a9e810
JB
2657 /* Small short-cut: If we've unpacked the data into a buffer
2658 of the same size as TYPE's length, then we can reuse that,
2659 instead of doing the unpacking again. */
d5722aa2 2660 memcpy (unpacked, staging.data (), staging.size ());
f93fca70 2661 }
d0a9e810
JB
2662 else
2663 ada_unpack_from_contents (src, bit_offset, bit_size,
2664 unpacked, TYPE_LENGTH (type),
2665 is_big_endian, has_negatives (type), is_scalar);
f93fca70 2666
14f9c5c9
AS
2667 return v;
2668}
d2e4a39e 2669
14f9c5c9
AS
2670/* Store the contents of FROMVAL into the location of TOVAL.
2671 Return a new value with the location of TOVAL and contents of
2672 FROMVAL. Handles assignment into packed fields that have
4c4b4cd2 2673 floating-point or non-scalar types. */
14f9c5c9 2674
d2e4a39e
AS
2675static struct value *
2676ada_value_assign (struct value *toval, struct value *fromval)
14f9c5c9 2677{
df407dfe
AC
2678 struct type *type = value_type (toval);
2679 int bits = value_bitsize (toval);
14f9c5c9 2680
52ce6436
PH
2681 toval = ada_coerce_ref (toval);
2682 fromval = ada_coerce_ref (fromval);
2683
2684 if (ada_is_direct_array_type (value_type (toval)))
2685 toval = ada_coerce_to_simple_array (toval);
2686 if (ada_is_direct_array_type (value_type (fromval)))
2687 fromval = ada_coerce_to_simple_array (fromval);
2688
88e3b34b 2689 if (!deprecated_value_modifiable (toval))
323e0a4a 2690 error (_("Left operand of assignment is not a modifiable lvalue."));
14f9c5c9 2691
d2e4a39e 2692 if (VALUE_LVAL (toval) == lval_memory
14f9c5c9 2693 && bits > 0
d2e4a39e 2694 && (TYPE_CODE (type) == TYPE_CODE_FLT
4c4b4cd2 2695 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
14f9c5c9 2696 {
df407dfe
AC
2697 int len = (value_bitpos (toval)
2698 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
aced2898 2699 int from_size;
224c3ddb 2700 gdb_byte *buffer = (gdb_byte *) alloca (len);
d2e4a39e 2701 struct value *val;
42ae5230 2702 CORE_ADDR to_addr = value_address (toval);
14f9c5c9
AS
2703
2704 if (TYPE_CODE (type) == TYPE_CODE_FLT)
4c4b4cd2 2705 fromval = value_cast (type, fromval);
14f9c5c9 2706
52ce6436 2707 read_memory (to_addr, buffer, len);
aced2898
PH
2708 from_size = value_bitsize (fromval);
2709 if (from_size == 0)
2710 from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT;
50810684 2711 if (gdbarch_bits_big_endian (get_type_arch (type)))
a99bc3d2
JB
2712 copy_bitwise (buffer, value_bitpos (toval),
2713 value_contents (fromval), from_size - bits, bits, 1);
14f9c5c9 2714 else
a99bc3d2
JB
2715 copy_bitwise (buffer, value_bitpos (toval),
2716 value_contents (fromval), 0, bits, 0);
972daa01 2717 write_memory_with_notification (to_addr, buffer, len);
8cebebb9 2718
14f9c5c9 2719 val = value_copy (toval);
0fd88904 2720 memcpy (value_contents_raw (val), value_contents (fromval),
4c4b4cd2 2721 TYPE_LENGTH (type));
04624583 2722 deprecated_set_value_type (val, type);
d2e4a39e 2723
14f9c5c9
AS
2724 return val;
2725 }
2726
2727 return value_assign (toval, fromval);
2728}
2729
2730
7c512744
JB
2731/* Given that COMPONENT is a memory lvalue that is part of the lvalue
2732 CONTAINER, assign the contents of VAL to COMPONENTS's place in
2733 CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2734 COMPONENT, and not the inferior's memory. The current contents
2735 of COMPONENT are ignored.
2736
2737 Although not part of the initial design, this function also works
2738 when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER
2739 had a null address, and COMPONENT had an address which is equal to
2740 its offset inside CONTAINER. */
2741
52ce6436
PH
2742static void
2743value_assign_to_component (struct value *container, struct value *component,
2744 struct value *val)
2745{
2746 LONGEST offset_in_container =
42ae5230 2747 (LONGEST) (value_address (component) - value_address (container));
7c512744 2748 int bit_offset_in_container =
52ce6436
PH
2749 value_bitpos (component) - value_bitpos (container);
2750 int bits;
7c512744 2751
52ce6436
PH
2752 val = value_cast (value_type (component), val);
2753
2754 if (value_bitsize (component) == 0)
2755 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2756 else
2757 bits = value_bitsize (component);
2758
50810684 2759 if (gdbarch_bits_big_endian (get_type_arch (value_type (container))))
2a62dfa9
JB
2760 {
2761 int src_offset;
2762
2763 if (is_scalar_type (check_typedef (value_type (component))))
2764 src_offset
2765 = TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits;
2766 else
2767 src_offset = 0;
a99bc3d2
JB
2768 copy_bitwise (value_contents_writeable (container) + offset_in_container,
2769 value_bitpos (container) + bit_offset_in_container,
2770 value_contents (val), src_offset, bits, 1);
2a62dfa9 2771 }
52ce6436 2772 else
a99bc3d2
JB
2773 copy_bitwise (value_contents_writeable (container) + offset_in_container,
2774 value_bitpos (container) + bit_offset_in_container,
2775 value_contents (val), 0, bits, 0);
7c512744
JB
2776}
2777
736ade86
XR
2778/* Determine if TYPE is an access to an unconstrained array. */
2779
d91e9ea8 2780bool
736ade86
XR
2781ada_is_access_to_unconstrained_array (struct type *type)
2782{
2783 return (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
2784 && is_thick_pntr (ada_typedef_target_type (type)));
2785}
2786
4c4b4cd2
PH
2787/* The value of the element of array ARR at the ARITY indices given in IND.
2788 ARR may be either a simple array, GNAT array descriptor, or pointer
14f9c5c9
AS
2789 thereto. */
2790
d2e4a39e
AS
2791struct value *
2792ada_value_subscript (struct value *arr, int arity, struct value **ind)
14f9c5c9
AS
2793{
2794 int k;
d2e4a39e
AS
2795 struct value *elt;
2796 struct type *elt_type;
14f9c5c9
AS
2797
2798 elt = ada_coerce_to_simple_array (arr);
2799
df407dfe 2800 elt_type = ada_check_typedef (value_type (elt));
d2e4a39e 2801 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
14f9c5c9
AS
2802 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2803 return value_subscript_packed (elt, arity, ind);
2804
2805 for (k = 0; k < arity; k += 1)
2806 {
b9c50e9a
XR
2807 struct type *saved_elt_type = TYPE_TARGET_TYPE (elt_type);
2808
14f9c5c9 2809 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
323e0a4a 2810 error (_("too many subscripts (%d expected)"), k);
b9c50e9a 2811
2497b498 2812 elt = value_subscript (elt, pos_atr (ind[k]));
b9c50e9a
XR
2813
2814 if (ada_is_access_to_unconstrained_array (saved_elt_type)
2815 && TYPE_CODE (value_type (elt)) != TYPE_CODE_TYPEDEF)
2816 {
2817 /* The element is a typedef to an unconstrained array,
2818 except that the value_subscript call stripped the
2819 typedef layer. The typedef layer is GNAT's way to
2820 specify that the element is, at the source level, an
2821 access to the unconstrained array, rather than the
2822 unconstrained array. So, we need to restore that
2823 typedef layer, which we can do by forcing the element's
2824 type back to its original type. Otherwise, the returned
2825 value is going to be printed as the array, rather
2826 than as an access. Another symptom of the same issue
2827 would be that an expression trying to dereference the
2828 element would also be improperly rejected. */
2829 deprecated_set_value_type (elt, saved_elt_type);
2830 }
2831
2832 elt_type = ada_check_typedef (value_type (elt));
14f9c5c9 2833 }
b9c50e9a 2834
14f9c5c9
AS
2835 return elt;
2836}
2837
deede10c
JB
2838/* Assuming ARR is a pointer to a GDB array, the value of the element
2839 of *ARR at the ARITY indices given in IND.
919e6dbe
PMR
2840 Does not read the entire array into memory.
2841
2842 Note: Unlike what one would expect, this function is used instead of
2843 ada_value_subscript for basically all non-packed array types. The reason
2844 for this is that a side effect of doing our own pointer arithmetics instead
2845 of relying on value_subscript is that there is no implicit typedef peeling.
2846 This is important for arrays of array accesses, where it allows us to
2847 preserve the fact that the array's element is an array access, where the
2848 access part os encoded in a typedef layer. */
14f9c5c9 2849
2c0b251b 2850static struct value *
deede10c 2851ada_value_ptr_subscript (struct value *arr, int arity, struct value **ind)
14f9c5c9
AS
2852{
2853 int k;
919e6dbe 2854 struct value *array_ind = ada_value_ind (arr);
deede10c 2855 struct type *type
919e6dbe
PMR
2856 = check_typedef (value_enclosing_type (array_ind));
2857
2858 if (TYPE_CODE (type) == TYPE_CODE_ARRAY
2859 && TYPE_FIELD_BITSIZE (type, 0) > 0)
2860 return value_subscript_packed (array_ind, arity, ind);
14f9c5c9
AS
2861
2862 for (k = 0; k < arity; k += 1)
2863 {
2864 LONGEST lwb, upb;
aa715135 2865 struct value *lwb_value;
14f9c5c9
AS
2866
2867 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
323e0a4a 2868 error (_("too many subscripts (%d expected)"), k);
d2e4a39e 2869 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
4c4b4cd2 2870 value_copy (arr));
14f9c5c9 2871 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
aa715135
JG
2872 lwb_value = value_from_longest (value_type(ind[k]), lwb);
2873 arr = value_ptradd (arr, pos_atr (ind[k]) - pos_atr (lwb_value));
14f9c5c9
AS
2874 type = TYPE_TARGET_TYPE (type);
2875 }
2876
2877 return value_ind (arr);
2878}
2879
0b5d8877 2880/* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
aa715135
JG
2881 actual type of ARRAY_PTR is ignored), returns the Ada slice of
2882 HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of
2883 this array is LOW, as per Ada rules. */
0b5d8877 2884static struct value *
f5938064
JG
2885ada_value_slice_from_ptr (struct value *array_ptr, struct type *type,
2886 int low, int high)
0b5d8877 2887{
b0dd7688 2888 struct type *type0 = ada_check_typedef (type);
aa715135 2889 struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0));
0c9c3474 2890 struct type *index_type
aa715135 2891 = create_static_range_type (NULL, base_index_type, low, high);
9fe561ab
JB
2892 struct type *slice_type = create_array_type_with_stride
2893 (NULL, TYPE_TARGET_TYPE (type0), index_type,
2894 get_dyn_prop (DYN_PROP_BYTE_STRIDE, type0),
2895 TYPE_FIELD_BITSIZE (type0, 0));
aa715135
JG
2896 int base_low = ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0));
2897 LONGEST base_low_pos, low_pos;
2898 CORE_ADDR base;
2899
2900 if (!discrete_position (base_index_type, low, &low_pos)
2901 || !discrete_position (base_index_type, base_low, &base_low_pos))
2902 {
2903 warning (_("unable to get positions in slice, use bounds instead"));
2904 low_pos = low;
2905 base_low_pos = base_low;
2906 }
5b4ee69b 2907
aa715135
JG
2908 base = value_as_address (array_ptr)
2909 + ((low_pos - base_low_pos)
2910 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0)));
f5938064 2911 return value_at_lazy (slice_type, base);
0b5d8877
PH
2912}
2913
2914
2915static struct value *
2916ada_value_slice (struct value *array, int low, int high)
2917{
b0dd7688 2918 struct type *type = ada_check_typedef (value_type (array));
aa715135 2919 struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
0c9c3474
SA
2920 struct type *index_type
2921 = create_static_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
9fe561ab
JB
2922 struct type *slice_type = create_array_type_with_stride
2923 (NULL, TYPE_TARGET_TYPE (type), index_type,
2924 get_dyn_prop (DYN_PROP_BYTE_STRIDE, type),
2925 TYPE_FIELD_BITSIZE (type, 0));
aa715135 2926 LONGEST low_pos, high_pos;
5b4ee69b 2927
aa715135
JG
2928 if (!discrete_position (base_index_type, low, &low_pos)
2929 || !discrete_position (base_index_type, high, &high_pos))
2930 {
2931 warning (_("unable to get positions in slice, use bounds instead"));
2932 low_pos = low;
2933 high_pos = high;
2934 }
2935
2936 return value_cast (slice_type,
2937 value_slice (array, low, high_pos - low_pos + 1));
0b5d8877
PH
2938}
2939
14f9c5c9
AS
2940/* If type is a record type in the form of a standard GNAT array
2941 descriptor, returns the number of dimensions for type. If arr is a
2942 simple array, returns the number of "array of"s that prefix its
4c4b4cd2 2943 type designation. Otherwise, returns 0. */
14f9c5c9
AS
2944
2945int
d2e4a39e 2946ada_array_arity (struct type *type)
14f9c5c9
AS
2947{
2948 int arity;
2949
2950 if (type == NULL)
2951 return 0;
2952
2953 type = desc_base_type (type);
2954
2955 arity = 0;
d2e4a39e 2956 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
14f9c5c9 2957 return desc_arity (desc_bounds_type (type));
d2e4a39e
AS
2958 else
2959 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
14f9c5c9 2960 {
4c4b4cd2 2961 arity += 1;
61ee279c 2962 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
14f9c5c9 2963 }
d2e4a39e 2964
14f9c5c9
AS
2965 return arity;
2966}
2967
2968/* If TYPE is a record type in the form of a standard GNAT array
2969 descriptor or a simple array type, returns the element type for
2970 TYPE after indexing by NINDICES indices, or by all indices if
4c4b4cd2 2971 NINDICES is -1. Otherwise, returns NULL. */
14f9c5c9 2972
d2e4a39e
AS
2973struct type *
2974ada_array_element_type (struct type *type, int nindices)
14f9c5c9
AS
2975{
2976 type = desc_base_type (type);
2977
d2e4a39e 2978 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
14f9c5c9
AS
2979 {
2980 int k;
d2e4a39e 2981 struct type *p_array_type;
14f9c5c9 2982
556bdfd4 2983 p_array_type = desc_data_target_type (type);
14f9c5c9
AS
2984
2985 k = ada_array_arity (type);
2986 if (k == 0)
4c4b4cd2 2987 return NULL;
d2e4a39e 2988
4c4b4cd2 2989 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
14f9c5c9 2990 if (nindices >= 0 && k > nindices)
4c4b4cd2 2991 k = nindices;
d2e4a39e 2992 while (k > 0 && p_array_type != NULL)
4c4b4cd2 2993 {
61ee279c 2994 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
4c4b4cd2
PH
2995 k -= 1;
2996 }
14f9c5c9
AS
2997 return p_array_type;
2998 }
2999 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
3000 {
3001 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
4c4b4cd2
PH
3002 {
3003 type = TYPE_TARGET_TYPE (type);
3004 nindices -= 1;
3005 }
14f9c5c9
AS
3006 return type;
3007 }
3008
3009 return NULL;
3010}
3011
4c4b4cd2 3012/* The type of nth index in arrays of given type (n numbering from 1).
dd19d49e
UW
3013 Does not examine memory. Throws an error if N is invalid or TYPE
3014 is not an array type. NAME is the name of the Ada attribute being
3015 evaluated ('range, 'first, 'last, or 'length); it is used in building
3016 the error message. */
14f9c5c9 3017
1eea4ebd
UW
3018static struct type *
3019ada_index_type (struct type *type, int n, const char *name)
14f9c5c9 3020{
4c4b4cd2
PH
3021 struct type *result_type;
3022
14f9c5c9
AS
3023 type = desc_base_type (type);
3024
1eea4ebd
UW
3025 if (n < 0 || n > ada_array_arity (type))
3026 error (_("invalid dimension number to '%s"), name);
14f9c5c9 3027
4c4b4cd2 3028 if (ada_is_simple_array_type (type))
14f9c5c9
AS
3029 {
3030 int i;
3031
3032 for (i = 1; i < n; i += 1)
4c4b4cd2 3033 type = TYPE_TARGET_TYPE (type);
262452ec 3034 result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type));
4c4b4cd2
PH
3035 /* FIXME: The stabs type r(0,0);bound;bound in an array type
3036 has a target type of TYPE_CODE_UNDEF. We compensate here, but
76a01679 3037 perhaps stabsread.c would make more sense. */
1eea4ebd
UW
3038 if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
3039 result_type = NULL;
14f9c5c9 3040 }
d2e4a39e 3041 else
1eea4ebd
UW
3042 {
3043 result_type = desc_index_type (desc_bounds_type (type), n);
3044 if (result_type == NULL)
3045 error (_("attempt to take bound of something that is not an array"));
3046 }
3047
3048 return result_type;
14f9c5c9
AS
3049}
3050
3051/* Given that arr is an array type, returns the lower bound of the
3052 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
4c4b4cd2 3053 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
1eea4ebd
UW
3054 array-descriptor type. It works for other arrays with bounds supplied
3055 by run-time quantities other than discriminants. */
14f9c5c9 3056
abb68b3e 3057static LONGEST
fb5e3d5c 3058ada_array_bound_from_type (struct type *arr_type, int n, int which)
14f9c5c9 3059{
8a48ac95 3060 struct type *type, *index_type_desc, *index_type;
1ce677a4 3061 int i;
262452ec
JK
3062
3063 gdb_assert (which == 0 || which == 1);
14f9c5c9 3064
ad82864c
JB
3065 if (ada_is_constrained_packed_array_type (arr_type))
3066 arr_type = decode_constrained_packed_array_type (arr_type);
14f9c5c9 3067
4c4b4cd2 3068 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
1eea4ebd 3069 return (LONGEST) - which;
14f9c5c9
AS
3070
3071 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
3072 type = TYPE_TARGET_TYPE (arr_type);
3073 else
3074 type = arr_type;
3075
bafffb51
JB
3076 if (TYPE_FIXED_INSTANCE (type))
3077 {
3078 /* The array has already been fixed, so we do not need to
3079 check the parallel ___XA type again. That encoding has
3080 already been applied, so ignore it now. */
3081 index_type_desc = NULL;
3082 }
3083 else
3084 {
3085 index_type_desc = ada_find_parallel_type (type, "___XA");
3086 ada_fixup_array_indexes_type (index_type_desc);
3087 }
3088
262452ec 3089 if (index_type_desc != NULL)
28c85d6c
JB
3090 index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1),
3091 NULL);
262452ec 3092 else
8a48ac95
JB
3093 {
3094 struct type *elt_type = check_typedef (type);
3095
3096 for (i = 1; i < n; i++)
3097 elt_type = check_typedef (TYPE_TARGET_TYPE (elt_type));
3098
3099 index_type = TYPE_INDEX_TYPE (elt_type);
3100 }
262452ec 3101
43bbcdc2
PH
3102 return
3103 (LONGEST) (which == 0
3104 ? ada_discrete_type_low_bound (index_type)
3105 : ada_discrete_type_high_bound (index_type));
14f9c5c9
AS
3106}
3107
3108/* Given that arr is an array value, returns the lower bound of the
abb68b3e
JB
3109 nth index (numbering from 1) if WHICH is 0, and the upper bound if
3110 WHICH is 1. This routine will also work for arrays with bounds
4c4b4cd2 3111 supplied by run-time quantities other than discriminants. */
14f9c5c9 3112
1eea4ebd 3113static LONGEST
4dc81987 3114ada_array_bound (struct value *arr, int n, int which)
14f9c5c9 3115{
eb479039
JB
3116 struct type *arr_type;
3117
3118 if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR)
3119 arr = value_ind (arr);
3120 arr_type = value_enclosing_type (arr);
14f9c5c9 3121
ad82864c
JB
3122 if (ada_is_constrained_packed_array_type (arr_type))
3123 return ada_array_bound (decode_constrained_packed_array (arr), n, which);
4c4b4cd2 3124 else if (ada_is_simple_array_type (arr_type))
1eea4ebd 3125 return ada_array_bound_from_type (arr_type, n, which);
14f9c5c9 3126 else
1eea4ebd 3127 return value_as_long (desc_one_bound (desc_bounds (arr), n, which));
14f9c5c9
AS
3128}
3129
3130/* Given that arr is an array value, returns the length of the
3131 nth index. This routine will also work for arrays with bounds
4c4b4cd2
PH
3132 supplied by run-time quantities other than discriminants.
3133 Does not work for arrays indexed by enumeration types with representation
3134 clauses at the moment. */
14f9c5c9 3135
1eea4ebd 3136static LONGEST
d2e4a39e 3137ada_array_length (struct value *arr, int n)
14f9c5c9 3138{
aa715135
JG
3139 struct type *arr_type, *index_type;
3140 int low, high;
eb479039
JB
3141
3142 if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR)
3143 arr = value_ind (arr);
3144 arr_type = value_enclosing_type (arr);
14f9c5c9 3145
ad82864c
JB
3146 if (ada_is_constrained_packed_array_type (arr_type))
3147 return ada_array_length (decode_constrained_packed_array (arr), n);
14f9c5c9 3148
4c4b4cd2 3149 if (ada_is_simple_array_type (arr_type))
aa715135
JG
3150 {
3151 low = ada_array_bound_from_type (arr_type, n, 0);
3152 high = ada_array_bound_from_type (arr_type, n, 1);
3153 }
14f9c5c9 3154 else
aa715135
JG
3155 {
3156 low = value_as_long (desc_one_bound (desc_bounds (arr), n, 0));
3157 high = value_as_long (desc_one_bound (desc_bounds (arr), n, 1));
3158 }
3159
f168693b 3160 arr_type = check_typedef (arr_type);
7150d33c 3161 index_type = ada_index_type (arr_type, n, "length");
aa715135
JG
3162 if (index_type != NULL)
3163 {
3164 struct type *base_type;
3165 if (TYPE_CODE (index_type) == TYPE_CODE_RANGE)
3166 base_type = TYPE_TARGET_TYPE (index_type);
3167 else
3168 base_type = index_type;
3169
3170 low = pos_atr (value_from_longest (base_type, low));
3171 high = pos_atr (value_from_longest (base_type, high));
3172 }
3173 return high - low + 1;
4c4b4cd2
PH
3174}
3175
bff8c71f
TT
3176/* An array whose type is that of ARR_TYPE (an array type), with
3177 bounds LOW to HIGH, but whose contents are unimportant. If HIGH is
3178 less than LOW, then LOW-1 is used. */
4c4b4cd2
PH
3179
3180static struct value *
bff8c71f 3181empty_array (struct type *arr_type, int low, int high)
4c4b4cd2 3182{
b0dd7688 3183 struct type *arr_type0 = ada_check_typedef (arr_type);
0c9c3474
SA
3184 struct type *index_type
3185 = create_static_range_type
bff8c71f
TT
3186 (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)), low,
3187 high < low ? low - 1 : high);
b0dd7688 3188 struct type *elt_type = ada_array_element_type (arr_type0, 1);
5b4ee69b 3189
0b5d8877 3190 return allocate_value (create_array_type (NULL, elt_type, index_type));
14f9c5c9 3191}
14f9c5c9 3192\f
d2e4a39e 3193
4c4b4cd2 3194 /* Name resolution */
14f9c5c9 3195
4c4b4cd2
PH
3196/* The "decoded" name for the user-definable Ada operator corresponding
3197 to OP. */
14f9c5c9 3198
d2e4a39e 3199static const char *
4c4b4cd2 3200ada_decoded_op_name (enum exp_opcode op)
14f9c5c9
AS
3201{
3202 int i;
3203
4c4b4cd2 3204 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
14f9c5c9
AS
3205 {
3206 if (ada_opname_table[i].op == op)
4c4b4cd2 3207 return ada_opname_table[i].decoded;
14f9c5c9 3208 }
323e0a4a 3209 error (_("Could not find operator name for opcode"));
14f9c5c9
AS
3210}
3211
3212
4c4b4cd2
PH
3213/* Same as evaluate_type (*EXP), but resolves ambiguous symbol
3214 references (marked by OP_VAR_VALUE nodes in which the symbol has an
3215 undefined namespace) and converts operators that are
3216 user-defined into appropriate function calls. If CONTEXT_TYPE is
14f9c5c9
AS
3217 non-null, it provides a preferred result type [at the moment, only
3218 type void has any effect---causing procedures to be preferred over
3219 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
4c4b4cd2 3220 return type is preferred. May change (expand) *EXP. */
14f9c5c9 3221
4c4b4cd2 3222static void
2a612529 3223resolve (expression_up *expp, int void_context_p, int parse_completion)
14f9c5c9 3224{
30b15541
UW
3225 struct type *context_type = NULL;
3226 int pc = 0;
3227
3228 if (void_context_p)
3229 context_type = builtin_type ((*expp)->gdbarch)->builtin_void;
3230
2a612529 3231 resolve_subexp (expp, &pc, 1, context_type, parse_completion);
14f9c5c9
AS
3232}
3233
4c4b4cd2
PH
3234/* Resolve the operator of the subexpression beginning at
3235 position *POS of *EXPP. "Resolving" consists of replacing
3236 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
3237 with their resolutions, replacing built-in operators with
3238 function calls to user-defined operators, where appropriate, and,
3239 when DEPROCEDURE_P is non-zero, converting function-valued variables
3240 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
3241 are as in ada_resolve, above. */
14f9c5c9 3242
d2e4a39e 3243static struct value *
e9d9f57e 3244resolve_subexp (expression_up *expp, int *pos, int deprocedure_p,
2a612529 3245 struct type *context_type, int parse_completion)
14f9c5c9
AS
3246{
3247 int pc = *pos;
3248 int i;
4c4b4cd2 3249 struct expression *exp; /* Convenience: == *expp. */
14f9c5c9 3250 enum exp_opcode op = (*expp)->elts[pc].opcode;
4c4b4cd2
PH
3251 struct value **argvec; /* Vector of operand types (alloca'ed). */
3252 int nargs; /* Number of operands. */
52ce6436 3253 int oplen;
14f9c5c9
AS
3254
3255 argvec = NULL;
3256 nargs = 0;
e9d9f57e 3257 exp = expp->get ();
14f9c5c9 3258
52ce6436
PH
3259 /* Pass one: resolve operands, saving their types and updating *pos,
3260 if needed. */
14f9c5c9
AS
3261 switch (op)
3262 {
4c4b4cd2
PH
3263 case OP_FUNCALL:
3264 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
76a01679
JB
3265 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
3266 *pos += 7;
4c4b4cd2
PH
3267 else
3268 {
3269 *pos += 3;
2a612529 3270 resolve_subexp (expp, pos, 0, NULL, parse_completion);
4c4b4cd2
PH
3271 }
3272 nargs = longest_to_int (exp->elts[pc + 1].longconst);
14f9c5c9
AS
3273 break;
3274
14f9c5c9 3275 case UNOP_ADDR:
4c4b4cd2 3276 *pos += 1;
2a612529 3277 resolve_subexp (expp, pos, 0, NULL, parse_completion);
4c4b4cd2
PH
3278 break;
3279
52ce6436
PH
3280 case UNOP_QUAL:
3281 *pos += 3;
2a612529
TT
3282 resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type),
3283 parse_completion);
4c4b4cd2
PH
3284 break;
3285
52ce6436 3286 case OP_ATR_MODULUS:
4c4b4cd2
PH
3287 case OP_ATR_SIZE:
3288 case OP_ATR_TAG:
4c4b4cd2
PH
3289 case OP_ATR_FIRST:
3290 case OP_ATR_LAST:
3291 case OP_ATR_LENGTH:
3292 case OP_ATR_POS:
3293 case OP_ATR_VAL:
4c4b4cd2
PH
3294 case OP_ATR_MIN:
3295 case OP_ATR_MAX:
52ce6436
PH
3296 case TERNOP_IN_RANGE:
3297 case BINOP_IN_BOUNDS:
3298 case UNOP_IN_RANGE:
3299 case OP_AGGREGATE:
3300 case OP_OTHERS:
3301 case OP_CHOICES:
3302 case OP_POSITIONAL:
3303 case OP_DISCRETE_RANGE:
3304 case OP_NAME:
3305 ada_forward_operator_length (exp, pc, &oplen, &nargs);
3306 *pos += oplen;
14f9c5c9
AS
3307 break;
3308
3309 case BINOP_ASSIGN:
3310 {
4c4b4cd2
PH
3311 struct value *arg1;
3312
3313 *pos += 1;
2a612529 3314 arg1 = resolve_subexp (expp, pos, 0, NULL, parse_completion);
4c4b4cd2 3315 if (arg1 == NULL)
2a612529 3316 resolve_subexp (expp, pos, 1, NULL, parse_completion);
4c4b4cd2 3317 else
2a612529 3318 resolve_subexp (expp, pos, 1, value_type (arg1), parse_completion);
4c4b4cd2 3319 break;
14f9c5c9
AS
3320 }
3321
4c4b4cd2 3322 case UNOP_CAST:
4c4b4cd2
PH
3323 *pos += 3;
3324 nargs = 1;
3325 break;
14f9c5c9 3326
4c4b4cd2
PH
3327 case BINOP_ADD:
3328 case BINOP_SUB:
3329 case BINOP_MUL:
3330 case BINOP_DIV:
3331 case BINOP_REM:
3332 case BINOP_MOD:
3333 case BINOP_EXP:
3334 case BINOP_CONCAT:
3335 case BINOP_LOGICAL_AND:
3336 case BINOP_LOGICAL_OR:
3337 case BINOP_BITWISE_AND:
3338 case BINOP_BITWISE_IOR:
3339 case BINOP_BITWISE_XOR:
14f9c5c9 3340
4c4b4cd2
PH
3341 case BINOP_EQUAL:
3342 case BINOP_NOTEQUAL:
3343 case BINOP_LESS:
3344 case BINOP_GTR:
3345 case BINOP_LEQ:
3346 case BINOP_GEQ:
14f9c5c9 3347
4c4b4cd2
PH
3348 case BINOP_REPEAT:
3349 case BINOP_SUBSCRIPT:
3350 case BINOP_COMMA:
40c8aaa9
JB
3351 *pos += 1;
3352 nargs = 2;
3353 break;
14f9c5c9 3354
4c4b4cd2
PH
3355 case UNOP_NEG:
3356 case UNOP_PLUS:
3357 case UNOP_LOGICAL_NOT:
3358 case UNOP_ABS:
3359 case UNOP_IND:
3360 *pos += 1;
3361 nargs = 1;
3362 break;
14f9c5c9 3363
4c4b4cd2 3364 case OP_LONG:
edd079d9 3365 case OP_FLOAT:
4c4b4cd2 3366 case OP_VAR_VALUE:
74ea4be4 3367 case OP_VAR_MSYM_VALUE:
4c4b4cd2
PH
3368 *pos += 4;
3369 break;
14f9c5c9 3370
4c4b4cd2
PH
3371 case OP_TYPE:
3372 case OP_BOOL:
3373 case OP_LAST:
4c4b4cd2
PH
3374 case OP_INTERNALVAR:
3375 *pos += 3;
3376 break;
14f9c5c9 3377
4c4b4cd2
PH
3378 case UNOP_MEMVAL:
3379 *pos += 3;
3380 nargs = 1;
3381 break;
3382
67f3407f
DJ
3383 case OP_REGISTER:
3384 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3385 break;
3386
4c4b4cd2
PH
3387 case STRUCTOP_STRUCT:
3388 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
3389 nargs = 1;
3390 break;
3391
4c4b4cd2 3392 case TERNOP_SLICE:
4c4b4cd2
PH
3393 *pos += 1;
3394 nargs = 3;
3395 break;
3396
52ce6436 3397 case OP_STRING:
14f9c5c9 3398 break;
4c4b4cd2
PH
3399
3400 default:
323e0a4a 3401 error (_("Unexpected operator during name resolution"));
14f9c5c9
AS
3402 }
3403
8d749320 3404 argvec = XALLOCAVEC (struct value *, nargs + 1);
4c4b4cd2 3405 for (i = 0; i < nargs; i += 1)
2a612529 3406 argvec[i] = resolve_subexp (expp, pos, 1, NULL, parse_completion);
4c4b4cd2 3407 argvec[i] = NULL;
e9d9f57e 3408 exp = expp->get ();
4c4b4cd2
PH
3409
3410 /* Pass two: perform any resolution on principal operator. */
14f9c5c9
AS
3411 switch (op)
3412 {
3413 default:
3414 break;
3415
14f9c5c9 3416 case OP_VAR_VALUE:
4c4b4cd2 3417 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
76a01679 3418 {
54d343a2 3419 std::vector<struct block_symbol> candidates;
76a01679
JB
3420 int n_candidates;
3421
3422 n_candidates =
3423 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3424 (exp->elts[pc + 2].symbol),
3425 exp->elts[pc + 1].block, VAR_DOMAIN,
4eeaa230 3426 &candidates);
76a01679
JB
3427
3428 if (n_candidates > 1)
3429 {
3430 /* Types tend to get re-introduced locally, so if there
3431 are any local symbols that are not types, first filter
3432 out all types. */
3433 int j;
3434 for (j = 0; j < n_candidates; j += 1)
d12307c1 3435 switch (SYMBOL_CLASS (candidates[j].symbol))
76a01679
JB
3436 {
3437 case LOC_REGISTER:
3438 case LOC_ARG:
3439 case LOC_REF_ARG:
76a01679
JB
3440 case LOC_REGPARM_ADDR:
3441 case LOC_LOCAL:
76a01679 3442 case LOC_COMPUTED:
76a01679
JB
3443 goto FoundNonType;
3444 default:
3445 break;
3446 }
3447 FoundNonType:
3448 if (j < n_candidates)
3449 {
3450 j = 0;
3451 while (j < n_candidates)
3452 {
d12307c1 3453 if (SYMBOL_CLASS (candidates[j].symbol) == LOC_TYPEDEF)
76a01679
JB
3454 {
3455 candidates[j] = candidates[n_candidates - 1];
3456 n_candidates -= 1;
3457 }
3458 else
3459 j += 1;
3460 }
3461 }
3462 }
3463
3464 if (n_candidates == 0)
323e0a4a 3465 error (_("No definition found for %s"),
76a01679
JB
3466 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3467 else if (n_candidates == 1)
3468 i = 0;
3469 else if (deprocedure_p
54d343a2 3470 && !is_nonfunction (candidates.data (), n_candidates))
76a01679 3471 {
06d5cf63 3472 i = ada_resolve_function
54d343a2 3473 (candidates.data (), n_candidates, NULL, 0,
06d5cf63 3474 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
2a612529 3475 context_type, parse_completion);
76a01679 3476 if (i < 0)
323e0a4a 3477 error (_("Could not find a match for %s"),
76a01679
JB
3478 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
3479 }
3480 else
3481 {
323e0a4a 3482 printf_filtered (_("Multiple matches for %s\n"),
76a01679 3483 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
54d343a2 3484 user_select_syms (candidates.data (), n_candidates, 1);
76a01679
JB
3485 i = 0;
3486 }
3487
3488 exp->elts[pc + 1].block = candidates[i].block;
d12307c1 3489 exp->elts[pc + 2].symbol = candidates[i].symbol;
aee1fcdf 3490 innermost_block.update (candidates[i]);
76a01679
JB
3491 }
3492
3493 if (deprocedure_p
3494 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
3495 == TYPE_CODE_FUNC))
3496 {
424da6cf 3497 replace_operator_with_call (expp, pc, 0, 4,
76a01679
JB
3498 exp->elts[pc + 2].symbol,
3499 exp->elts[pc + 1].block);
e9d9f57e 3500 exp = expp->get ();
76a01679 3501 }
14f9c5c9
AS
3502 break;
3503
3504 case OP_FUNCALL:
3505 {
4c4b4cd2 3506 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
76a01679 3507 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
4c4b4cd2 3508 {
54d343a2 3509 std::vector<struct block_symbol> candidates;
4c4b4cd2
PH
3510 int n_candidates;
3511
3512 n_candidates =
76a01679
JB
3513 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3514 (exp->elts[pc + 5].symbol),
3515 exp->elts[pc + 4].block, VAR_DOMAIN,
4eeaa230 3516 &candidates);
ec6a20c2 3517
4c4b4cd2
PH
3518 if (n_candidates == 1)
3519 i = 0;
3520 else
3521 {
06d5cf63 3522 i = ada_resolve_function
54d343a2 3523 (candidates.data (), n_candidates,
06d5cf63
JB
3524 argvec, nargs,
3525 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
2a612529 3526 context_type, parse_completion);
4c4b4cd2 3527 if (i < 0)
323e0a4a 3528 error (_("Could not find a match for %s"),
4c4b4cd2
PH
3529 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
3530 }
3531
3532 exp->elts[pc + 4].block = candidates[i].block;
d12307c1 3533 exp->elts[pc + 5].symbol = candidates[i].symbol;
aee1fcdf 3534 innermost_block.update (candidates[i]);
4c4b4cd2 3535 }
14f9c5c9
AS
3536 }
3537 break;
3538 case BINOP_ADD:
3539 case BINOP_SUB:
3540 case BINOP_MUL:
3541 case BINOP_DIV:
3542 case BINOP_REM:
3543 case BINOP_MOD:
3544 case BINOP_CONCAT:
3545 case BINOP_BITWISE_AND:
3546 case BINOP_BITWISE_IOR:
3547 case BINOP_BITWISE_XOR:
3548 case BINOP_EQUAL:
3549 case BINOP_NOTEQUAL:
3550 case BINOP_LESS:
3551 case BINOP_GTR:
3552 case BINOP_LEQ:
3553 case BINOP_GEQ:
3554 case BINOP_EXP:
3555 case UNOP_NEG:
3556 case UNOP_PLUS:
3557 case UNOP_LOGICAL_NOT:
3558 case UNOP_ABS:
3559 if (possible_user_operator_p (op, argvec))
4c4b4cd2 3560 {
54d343a2 3561 std::vector<struct block_symbol> candidates;
4c4b4cd2
PH
3562 int n_candidates;
3563
3564 n_candidates =
b5ec771e 3565 ada_lookup_symbol_list (ada_decoded_op_name (op),
582942f4 3566 NULL, VAR_DOMAIN,
4eeaa230 3567 &candidates);
ec6a20c2 3568
54d343a2 3569 i = ada_resolve_function (candidates.data (), n_candidates, argvec,
2a612529
TT
3570 nargs, ada_decoded_op_name (op), NULL,
3571 parse_completion);
4c4b4cd2
PH
3572 if (i < 0)
3573 break;
3574
d12307c1
PMR
3575 replace_operator_with_call (expp, pc, nargs, 1,
3576 candidates[i].symbol,
3577 candidates[i].block);
e9d9f57e 3578 exp = expp->get ();
4c4b4cd2 3579 }
14f9c5c9 3580 break;
4c4b4cd2
PH
3581
3582 case OP_TYPE:
b3dbf008 3583 case OP_REGISTER:
4c4b4cd2 3584 return NULL;
14f9c5c9
AS
3585 }
3586
3587 *pos = pc;
ced9779b
JB
3588 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE)
3589 return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS,
3590 exp->elts[pc + 1].objfile,
3591 exp->elts[pc + 2].msymbol);
3592 else
3593 return evaluate_subexp_type (exp, pos);
14f9c5c9
AS
3594}
3595
3596/* Return non-zero if formal type FTYPE matches actual type ATYPE. If
4c4b4cd2 3597 MAY_DEREF is non-zero, the formal may be a pointer and the actual
5b3d5b7d 3598 a non-pointer. */
14f9c5c9 3599/* The term "match" here is rather loose. The match is heuristic and
5b3d5b7d 3600 liberal. */
14f9c5c9
AS
3601
3602static int
4dc81987 3603ada_type_match (struct type *ftype, struct type *atype, int may_deref)
14f9c5c9 3604{
61ee279c
PH
3605 ftype = ada_check_typedef (ftype);
3606 atype = ada_check_typedef (atype);
14f9c5c9
AS
3607
3608 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
3609 ftype = TYPE_TARGET_TYPE (ftype);
3610 if (TYPE_CODE (atype) == TYPE_CODE_REF)
3611 atype = TYPE_TARGET_TYPE (atype);
3612
d2e4a39e 3613 switch (TYPE_CODE (ftype))
14f9c5c9
AS
3614 {
3615 default:
5b3d5b7d 3616 return TYPE_CODE (ftype) == TYPE_CODE (atype);
14f9c5c9
AS
3617 case TYPE_CODE_PTR:
3618 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
4c4b4cd2
PH
3619 return ada_type_match (TYPE_TARGET_TYPE (ftype),
3620 TYPE_TARGET_TYPE (atype), 0);
d2e4a39e 3621 else
1265e4aa
JB
3622 return (may_deref
3623 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
14f9c5c9
AS
3624 case TYPE_CODE_INT:
3625 case TYPE_CODE_ENUM:
3626 case TYPE_CODE_RANGE:
3627 switch (TYPE_CODE (atype))
4c4b4cd2
PH
3628 {
3629 case TYPE_CODE_INT:
3630 case TYPE_CODE_ENUM:
3631 case TYPE_CODE_RANGE:
3632 return 1;
3633 default:
3634 return 0;
3635 }
14f9c5c9
AS
3636
3637 case TYPE_CODE_ARRAY:
d2e4a39e 3638 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
4c4b4cd2 3639 || ada_is_array_descriptor_type (atype));
14f9c5c9
AS
3640
3641 case TYPE_CODE_STRUCT:
4c4b4cd2
PH
3642 if (ada_is_array_descriptor_type (ftype))
3643 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3644 || ada_is_array_descriptor_type (atype));
14f9c5c9 3645 else
4c4b4cd2
PH
3646 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3647 && !ada_is_array_descriptor_type (atype));
14f9c5c9
AS
3648
3649 case TYPE_CODE_UNION:
3650 case TYPE_CODE_FLT:
3651 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3652 }
3653}
3654
3655/* Return non-zero if the formals of FUNC "sufficiently match" the
3656 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3657 may also be an enumeral, in which case it is treated as a 0-
4c4b4cd2 3658 argument function. */
14f9c5c9
AS
3659
3660static int
d2e4a39e 3661ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
14f9c5c9
AS
3662{
3663 int i;
d2e4a39e 3664 struct type *func_type = SYMBOL_TYPE (func);
14f9c5c9 3665
1265e4aa
JB
3666 if (SYMBOL_CLASS (func) == LOC_CONST
3667 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
14f9c5c9
AS
3668 return (n_actuals == 0);
3669 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3670 return 0;
3671
3672 if (TYPE_NFIELDS (func_type) != n_actuals)
3673 return 0;
3674
3675 for (i = 0; i < n_actuals; i += 1)
3676 {
4c4b4cd2 3677 if (actuals[i] == NULL)
76a01679
JB
3678 return 0;
3679 else
3680 {
5b4ee69b
MS
3681 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type,
3682 i));
df407dfe 3683 struct type *atype = ada_check_typedef (value_type (actuals[i]));
4c4b4cd2 3684
76a01679
JB
3685 if (!ada_type_match (ftype, atype, 1))
3686 return 0;
3687 }
14f9c5c9
AS
3688 }
3689 return 1;
3690}
3691
3692/* False iff function type FUNC_TYPE definitely does not produce a value
3693 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3694 FUNC_TYPE is not a valid function type with a non-null return type
3695 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3696
3697static int
d2e4a39e 3698return_match (struct type *func_type, struct type *context_type)
14f9c5c9 3699{
d2e4a39e 3700 struct type *return_type;
14f9c5c9
AS
3701
3702 if (func_type == NULL)
3703 return 1;
3704
4c4b4cd2 3705 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
18af8284 3706 return_type = get_base_type (TYPE_TARGET_TYPE (func_type));
4c4b4cd2 3707 else
18af8284 3708 return_type = get_base_type (func_type);
14f9c5c9
AS
3709 if (return_type == NULL)
3710 return 1;
3711
18af8284 3712 context_type = get_base_type (context_type);
14f9c5c9
AS
3713
3714 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3715 return context_type == NULL || return_type == context_type;
3716 else if (context_type == NULL)
3717 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3718 else
3719 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3720}
3721
3722
4c4b4cd2 3723/* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
14f9c5c9 3724 function (if any) that matches the types of the NARGS arguments in
4c4b4cd2
PH
3725 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3726 that returns that type, then eliminate matches that don't. If
3727 CONTEXT_TYPE is void and there is at least one match that does not
3728 return void, eliminate all matches that do.
3729
14f9c5c9
AS
3730 Asks the user if there is more than one match remaining. Returns -1
3731 if there is no such symbol or none is selected. NAME is used
4c4b4cd2
PH
3732 solely for messages. May re-arrange and modify SYMS in
3733 the process; the index returned is for the modified vector. */
14f9c5c9 3734
4c4b4cd2 3735static int
d12307c1 3736ada_resolve_function (struct block_symbol syms[],
4c4b4cd2 3737 int nsyms, struct value **args, int nargs,
2a612529
TT
3738 const char *name, struct type *context_type,
3739 int parse_completion)
14f9c5c9 3740{
30b15541 3741 int fallback;
14f9c5c9 3742 int k;
4c4b4cd2 3743 int m; /* Number of hits */
14f9c5c9 3744
d2e4a39e 3745 m = 0;
30b15541
UW
3746 /* In the first pass of the loop, we only accept functions matching
3747 context_type. If none are found, we add a second pass of the loop
3748 where every function is accepted. */
3749 for (fallback = 0; m == 0 && fallback < 2; fallback++)
14f9c5c9
AS
3750 {
3751 for (k = 0; k < nsyms; k += 1)
4c4b4cd2 3752 {
d12307c1 3753 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].symbol));
4c4b4cd2 3754
d12307c1 3755 if (ada_args_match (syms[k].symbol, args, nargs)
30b15541 3756 && (fallback || return_match (type, context_type)))
4c4b4cd2
PH
3757 {
3758 syms[m] = syms[k];
3759 m += 1;
3760 }
3761 }
14f9c5c9
AS
3762 }
3763
dc5c8746
PMR
3764 /* If we got multiple matches, ask the user which one to use. Don't do this
3765 interactive thing during completion, though, as the purpose of the
3766 completion is providing a list of all possible matches. Prompting the
3767 user to filter it down would be completely unexpected in this case. */
14f9c5c9
AS
3768 if (m == 0)
3769 return -1;
dc5c8746 3770 else if (m > 1 && !parse_completion)
14f9c5c9 3771 {
323e0a4a 3772 printf_filtered (_("Multiple matches for %s\n"), name);
4c4b4cd2 3773 user_select_syms (syms, m, 1);
14f9c5c9
AS
3774 return 0;
3775 }
3776 return 0;
3777}
3778
4c4b4cd2
PH
3779/* Returns true (non-zero) iff decoded name N0 should appear before N1
3780 in a listing of choices during disambiguation (see sort_choices, below).
3781 The idea is that overloadings of a subprogram name from the
3782 same package should sort in their source order. We settle for ordering
3783 such symbols by their trailing number (__N or $N). */
3784
14f9c5c9 3785static int
0d5cff50 3786encoded_ordered_before (const char *N0, const char *N1)
14f9c5c9
AS
3787{
3788 if (N1 == NULL)
3789 return 0;
3790 else if (N0 == NULL)
3791 return 1;
3792 else
3793 {
3794 int k0, k1;
5b4ee69b 3795
d2e4a39e 3796 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
4c4b4cd2 3797 ;
d2e4a39e 3798 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
4c4b4cd2 3799 ;
d2e4a39e 3800 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
4c4b4cd2
PH
3801 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3802 {
3803 int n0, n1;
5b4ee69b 3804
4c4b4cd2
PH
3805 n0 = k0;
3806 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3807 n0 -= 1;
3808 n1 = k1;
3809 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3810 n1 -= 1;
3811 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3812 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3813 }
14f9c5c9
AS
3814 return (strcmp (N0, N1) < 0);
3815 }
3816}
d2e4a39e 3817
4c4b4cd2
PH
3818/* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3819 encoded names. */
3820
d2e4a39e 3821static void
d12307c1 3822sort_choices (struct block_symbol syms[], int nsyms)
14f9c5c9 3823{
4c4b4cd2 3824 int i;
5b4ee69b 3825
d2e4a39e 3826 for (i = 1; i < nsyms; i += 1)
14f9c5c9 3827 {
d12307c1 3828 struct block_symbol sym = syms[i];
14f9c5c9
AS
3829 int j;
3830
d2e4a39e 3831 for (j = i - 1; j >= 0; j -= 1)
4c4b4cd2 3832 {
d12307c1
PMR
3833 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].symbol),
3834 SYMBOL_LINKAGE_NAME (sym.symbol)))
4c4b4cd2
PH
3835 break;
3836 syms[j + 1] = syms[j];
3837 }
d2e4a39e 3838 syms[j + 1] = sym;
14f9c5c9
AS
3839 }
3840}
3841
d72413e6
PMR
3842/* Whether GDB should display formals and return types for functions in the
3843 overloads selection menu. */
3844static int print_signatures = 1;
3845
3846/* Print the signature for SYM on STREAM according to the FLAGS options. For
3847 all but functions, the signature is just the name of the symbol. For
3848 functions, this is the name of the function, the list of types for formals
3849 and the return type (if any). */
3850
3851static void
3852ada_print_symbol_signature (struct ui_file *stream, struct symbol *sym,
3853 const struct type_print_options *flags)
3854{
3855 struct type *type = SYMBOL_TYPE (sym);
3856
3857 fprintf_filtered (stream, "%s", SYMBOL_PRINT_NAME (sym));
3858 if (!print_signatures
3859 || type == NULL
3860 || TYPE_CODE (type) != TYPE_CODE_FUNC)
3861 return;
3862
3863 if (TYPE_NFIELDS (type) > 0)
3864 {
3865 int i;
3866
3867 fprintf_filtered (stream, " (");
3868 for (i = 0; i < TYPE_NFIELDS (type); ++i)
3869 {
3870 if (i > 0)
3871 fprintf_filtered (stream, "; ");
3872 ada_print_type (TYPE_FIELD_TYPE (type, i), NULL, stream, -1, 0,
3873 flags);
3874 }
3875 fprintf_filtered (stream, ")");
3876 }
3877 if (TYPE_TARGET_TYPE (type) != NULL
3878 && TYPE_CODE (TYPE_TARGET_TYPE (type)) != TYPE_CODE_VOID)
3879 {
3880 fprintf_filtered (stream, " return ");
3881 ada_print_type (TYPE_TARGET_TYPE (type), NULL, stream, -1, 0, flags);
3882 }
3883}
3884
4c4b4cd2
PH
3885/* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3886 by asking the user (if necessary), returning the number selected,
3887 and setting the first elements of SYMS items. Error if no symbols
3888 selected. */
14f9c5c9
AS
3889
3890/* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
4c4b4cd2 3891 to be re-integrated one of these days. */
14f9c5c9
AS
3892
3893int
d12307c1 3894user_select_syms (struct block_symbol *syms, int nsyms, int max_results)
14f9c5c9
AS
3895{
3896 int i;
8d749320 3897 int *chosen = XALLOCAVEC (int , nsyms);
14f9c5c9
AS
3898 int n_chosen;
3899 int first_choice = (max_results == 1) ? 1 : 2;
717d2f5a 3900 const char *select_mode = multiple_symbols_select_mode ();
14f9c5c9
AS
3901
3902 if (max_results < 1)
323e0a4a 3903 error (_("Request to select 0 symbols!"));
14f9c5c9
AS
3904 if (nsyms <= 1)
3905 return nsyms;
3906
717d2f5a
JB
3907 if (select_mode == multiple_symbols_cancel)
3908 error (_("\
3909canceled because the command is ambiguous\n\
3910See set/show multiple-symbol."));
a0087920 3911
717d2f5a
JB
3912 /* If select_mode is "all", then return all possible symbols.
3913 Only do that if more than one symbol can be selected, of course.
3914 Otherwise, display the menu as usual. */
3915 if (select_mode == multiple_symbols_all && max_results > 1)
3916 return nsyms;
3917
a0087920 3918 printf_filtered (_("[0] cancel\n"));
14f9c5c9 3919 if (max_results > 1)
a0087920 3920 printf_filtered (_("[1] all\n"));
14f9c5c9 3921
4c4b4cd2 3922 sort_choices (syms, nsyms);
14f9c5c9
AS
3923
3924 for (i = 0; i < nsyms; i += 1)
3925 {
d12307c1 3926 if (syms[i].symbol == NULL)
4c4b4cd2
PH
3927 continue;
3928
d12307c1 3929 if (SYMBOL_CLASS (syms[i].symbol) == LOC_BLOCK)
4c4b4cd2 3930 {
76a01679 3931 struct symtab_and_line sal =
d12307c1 3932 find_function_start_sal (syms[i].symbol, 1);
5b4ee69b 3933
a0087920 3934 printf_filtered ("[%d] ", i + first_choice);
d72413e6
PMR
3935 ada_print_symbol_signature (gdb_stdout, syms[i].symbol,
3936 &type_print_raw_options);
323e0a4a 3937 if (sal.symtab == NULL)
a0087920
TT
3938 printf_filtered (_(" at <no source file available>:%d\n"),
3939 sal.line);
323e0a4a 3940 else
a0087920
TT
3941 printf_filtered (_(" at %s:%d\n"),
3942 symtab_to_filename_for_display (sal.symtab),
3943 sal.line);
4c4b4cd2
PH
3944 continue;
3945 }
d2e4a39e 3946 else
4c4b4cd2
PH
3947 {
3948 int is_enumeral =
d12307c1
PMR
3949 (SYMBOL_CLASS (syms[i].symbol) == LOC_CONST
3950 && SYMBOL_TYPE (syms[i].symbol) != NULL
3951 && TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) == TYPE_CODE_ENUM);
1994afbf
DE
3952 struct symtab *symtab = NULL;
3953
d12307c1
PMR
3954 if (SYMBOL_OBJFILE_OWNED (syms[i].symbol))
3955 symtab = symbol_symtab (syms[i].symbol);
4c4b4cd2 3956
d12307c1 3957 if (SYMBOL_LINE (syms[i].symbol) != 0 && symtab != NULL)
d72413e6 3958 {
a0087920 3959 printf_filtered ("[%d] ", i + first_choice);
d72413e6
PMR
3960 ada_print_symbol_signature (gdb_stdout, syms[i].symbol,
3961 &type_print_raw_options);
a0087920
TT
3962 printf_filtered (_(" at %s:%d\n"),
3963 symtab_to_filename_for_display (symtab),
3964 SYMBOL_LINE (syms[i].symbol));
d72413e6 3965 }
76a01679 3966 else if (is_enumeral
d12307c1 3967 && TYPE_NAME (SYMBOL_TYPE (syms[i].symbol)) != NULL)
4c4b4cd2 3968 {
a0087920 3969 printf_filtered (("[%d] "), i + first_choice);
d12307c1 3970 ada_print_type (SYMBOL_TYPE (syms[i].symbol), NULL,
79d43c61 3971 gdb_stdout, -1, 0, &type_print_raw_options);
a0087920
TT
3972 printf_filtered (_("'(%s) (enumeral)\n"),
3973 SYMBOL_PRINT_NAME (syms[i].symbol));
4c4b4cd2 3974 }
d72413e6
PMR
3975 else
3976 {
a0087920 3977 printf_filtered ("[%d] ", i + first_choice);
d72413e6
PMR
3978 ada_print_symbol_signature (gdb_stdout, syms[i].symbol,
3979 &type_print_raw_options);
3980
3981 if (symtab != NULL)
a0087920
TT
3982 printf_filtered (is_enumeral
3983 ? _(" in %s (enumeral)\n")
3984 : _(" at %s:?\n"),
3985 symtab_to_filename_for_display (symtab));
d72413e6 3986 else
a0087920
TT
3987 printf_filtered (is_enumeral
3988 ? _(" (enumeral)\n")
3989 : _(" at ?\n"));
d72413e6 3990 }
4c4b4cd2 3991 }
14f9c5c9 3992 }
d2e4a39e 3993
14f9c5c9 3994 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
4c4b4cd2 3995 "overload-choice");
14f9c5c9
AS
3996
3997 for (i = 0; i < n_chosen; i += 1)
4c4b4cd2 3998 syms[i] = syms[chosen[i]];
14f9c5c9
AS
3999
4000 return n_chosen;
4001}
4002
4003/* Read and validate a set of numeric choices from the user in the
4c4b4cd2 4004 range 0 .. N_CHOICES-1. Place the results in increasing
14f9c5c9
AS
4005 order in CHOICES[0 .. N-1], and return N.
4006
4007 The user types choices as a sequence of numbers on one line
4008 separated by blanks, encoding them as follows:
4009
4c4b4cd2 4010 + A choice of 0 means to cancel the selection, throwing an error.
14f9c5c9
AS
4011 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
4012 + The user chooses k by typing k+IS_ALL_CHOICE+1.
4013
4c4b4cd2 4014 The user is not allowed to choose more than MAX_RESULTS values.
14f9c5c9
AS
4015
4016 ANNOTATION_SUFFIX, if present, is used to annotate the input
4c4b4cd2 4017 prompts (for use with the -f switch). */
14f9c5c9
AS
4018
4019int
d2e4a39e 4020get_selections (int *choices, int n_choices, int max_results,
a121b7c1 4021 int is_all_choice, const char *annotation_suffix)
14f9c5c9 4022{
d2e4a39e 4023 char *args;
a121b7c1 4024 const char *prompt;
14f9c5c9
AS
4025 int n_chosen;
4026 int first_choice = is_all_choice ? 2 : 1;
d2e4a39e 4027
14f9c5c9
AS
4028 prompt = getenv ("PS2");
4029 if (prompt == NULL)
0bcd0149 4030 prompt = "> ";
14f9c5c9 4031
89fbedf3 4032 args = command_line_input (prompt, annotation_suffix);
d2e4a39e 4033
14f9c5c9 4034 if (args == NULL)
323e0a4a 4035 error_no_arg (_("one or more choice numbers"));
14f9c5c9
AS
4036
4037 n_chosen = 0;
76a01679 4038
4c4b4cd2
PH
4039 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
4040 order, as given in args. Choices are validated. */
14f9c5c9
AS
4041 while (1)
4042 {
d2e4a39e 4043 char *args2;
14f9c5c9
AS
4044 int choice, j;
4045
0fcd72ba 4046 args = skip_spaces (args);
14f9c5c9 4047 if (*args == '\0' && n_chosen == 0)
323e0a4a 4048 error_no_arg (_("one or more choice numbers"));
14f9c5c9 4049 else if (*args == '\0')
4c4b4cd2 4050 break;
14f9c5c9
AS
4051
4052 choice = strtol (args, &args2, 10);
d2e4a39e 4053 if (args == args2 || choice < 0
4c4b4cd2 4054 || choice > n_choices + first_choice - 1)
323e0a4a 4055 error (_("Argument must be choice number"));
14f9c5c9
AS
4056 args = args2;
4057
d2e4a39e 4058 if (choice == 0)
323e0a4a 4059 error (_("cancelled"));
14f9c5c9
AS
4060
4061 if (choice < first_choice)
4c4b4cd2
PH
4062 {
4063 n_chosen = n_choices;
4064 for (j = 0; j < n_choices; j += 1)
4065 choices[j] = j;
4066 break;
4067 }
14f9c5c9
AS
4068 choice -= first_choice;
4069
d2e4a39e 4070 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
4c4b4cd2
PH
4071 {
4072 }
14f9c5c9
AS
4073
4074 if (j < 0 || choice != choices[j])
4c4b4cd2
PH
4075 {
4076 int k;
5b4ee69b 4077
4c4b4cd2
PH
4078 for (k = n_chosen - 1; k > j; k -= 1)
4079 choices[k + 1] = choices[k];
4080 choices[j + 1] = choice;
4081 n_chosen += 1;
4082 }
14f9c5c9
AS
4083 }
4084
4085 if (n_chosen > max_results)
323e0a4a 4086 error (_("Select no more than %d of the above"), max_results);
d2e4a39e 4087
14f9c5c9
AS
4088 return n_chosen;
4089}
4090
4c4b4cd2
PH
4091/* Replace the operator of length OPLEN at position PC in *EXPP with a call
4092 on the function identified by SYM and BLOCK, and taking NARGS
4093 arguments. Update *EXPP as needed to hold more space. */
14f9c5c9
AS
4094
4095static void
e9d9f57e 4096replace_operator_with_call (expression_up *expp, int pc, int nargs,
4c4b4cd2 4097 int oplen, struct symbol *sym,
270140bd 4098 const struct block *block)
14f9c5c9
AS
4099{
4100 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4c4b4cd2 4101 symbol, -oplen for operator being replaced). */
d2e4a39e 4102 struct expression *newexp = (struct expression *)
8c1a34e7 4103 xzalloc (sizeof (struct expression)
4c4b4cd2 4104 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
e9d9f57e 4105 struct expression *exp = expp->get ();
14f9c5c9
AS
4106
4107 newexp->nelts = exp->nelts + 7 - oplen;
4108 newexp->language_defn = exp->language_defn;
3489610d 4109 newexp->gdbarch = exp->gdbarch;
14f9c5c9 4110 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
d2e4a39e 4111 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
4c4b4cd2 4112 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
14f9c5c9
AS
4113
4114 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
4115 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
4116
4117 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
4118 newexp->elts[pc + 4].block = block;
4119 newexp->elts[pc + 5].symbol = sym;
4120
e9d9f57e 4121 expp->reset (newexp);
d2e4a39e 4122}
14f9c5c9
AS
4123
4124/* Type-class predicates */
4125
4c4b4cd2
PH
4126/* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
4127 or FLOAT). */
14f9c5c9
AS
4128
4129static int
d2e4a39e 4130numeric_type_p (struct type *type)
14f9c5c9
AS
4131{
4132 if (type == NULL)
4133 return 0;
d2e4a39e
AS
4134 else
4135 {
4136 switch (TYPE_CODE (type))
4c4b4cd2
PH
4137 {
4138 case TYPE_CODE_INT:
4139 case TYPE_CODE_FLT:
4140 return 1;
4141 case TYPE_CODE_RANGE:
4142 return (type == TYPE_TARGET_TYPE (type)
4143 || numeric_type_p (TYPE_TARGET_TYPE (type)));
4144 default:
4145 return 0;
4146 }
d2e4a39e 4147 }
14f9c5c9
AS
4148}
4149
4c4b4cd2 4150/* True iff TYPE is integral (an INT or RANGE of INTs). */
14f9c5c9
AS
4151
4152static int
d2e4a39e 4153integer_type_p (struct type *type)
14f9c5c9
AS
4154{
4155 if (type == NULL)
4156 return 0;
d2e4a39e
AS
4157 else
4158 {
4159 switch (TYPE_CODE (type))
4c4b4cd2
PH
4160 {
4161 case TYPE_CODE_INT:
4162 return 1;
4163 case TYPE_CODE_RANGE:
4164 return (type == TYPE_TARGET_TYPE (type)
4165 || integer_type_p (TYPE_TARGET_TYPE (type)));
4166 default:
4167 return 0;
4168 }
d2e4a39e 4169 }
14f9c5c9
AS
4170}
4171
4c4b4cd2 4172/* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
14f9c5c9
AS
4173
4174static int
d2e4a39e 4175scalar_type_p (struct type *type)
14f9c5c9
AS
4176{
4177 if (type == NULL)
4178 return 0;
d2e4a39e
AS
4179 else
4180 {
4181 switch (TYPE_CODE (type))
4c4b4cd2
PH
4182 {
4183 case TYPE_CODE_INT:
4184 case TYPE_CODE_RANGE:
4185 case TYPE_CODE_ENUM:
4186 case TYPE_CODE_FLT:
4187 return 1;
4188 default:
4189 return 0;
4190 }
d2e4a39e 4191 }
14f9c5c9
AS
4192}
4193
4c4b4cd2 4194/* True iff TYPE is discrete (INT, RANGE, ENUM). */
14f9c5c9
AS
4195
4196static int
d2e4a39e 4197discrete_type_p (struct type *type)
14f9c5c9
AS
4198{
4199 if (type == NULL)
4200 return 0;
d2e4a39e
AS
4201 else
4202 {
4203 switch (TYPE_CODE (type))
4c4b4cd2
PH
4204 {
4205 case TYPE_CODE_INT:
4206 case TYPE_CODE_RANGE:
4207 case TYPE_CODE_ENUM:
872f0337 4208 case TYPE_CODE_BOOL:
4c4b4cd2
PH
4209 return 1;
4210 default:
4211 return 0;
4212 }
d2e4a39e 4213 }
14f9c5c9
AS
4214}
4215
4c4b4cd2
PH
4216/* Returns non-zero if OP with operands in the vector ARGS could be
4217 a user-defined function. Errs on the side of pre-defined operators
4218 (i.e., result 0). */
14f9c5c9
AS
4219
4220static int
d2e4a39e 4221possible_user_operator_p (enum exp_opcode op, struct value *args[])
14f9c5c9 4222{
76a01679 4223 struct type *type0 =
df407dfe 4224 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
d2e4a39e 4225 struct type *type1 =
df407dfe 4226 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
d2e4a39e 4227
4c4b4cd2
PH
4228 if (type0 == NULL)
4229 return 0;
4230
14f9c5c9
AS
4231 switch (op)
4232 {
4233 default:
4234 return 0;
4235
4236 case BINOP_ADD:
4237 case BINOP_SUB:
4238 case BINOP_MUL:
4239 case BINOP_DIV:
d2e4a39e 4240 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
14f9c5c9
AS
4241
4242 case BINOP_REM:
4243 case BINOP_MOD:
4244 case BINOP_BITWISE_AND:
4245 case BINOP_BITWISE_IOR:
4246 case BINOP_BITWISE_XOR:
d2e4a39e 4247 return (!(integer_type_p (type0) && integer_type_p (type1)));
14f9c5c9
AS
4248
4249 case BINOP_EQUAL:
4250 case BINOP_NOTEQUAL:
4251 case BINOP_LESS:
4252 case BINOP_GTR:
4253 case BINOP_LEQ:
4254 case BINOP_GEQ:
d2e4a39e 4255 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
14f9c5c9
AS
4256
4257 case BINOP_CONCAT:
ee90b9ab 4258 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
14f9c5c9
AS
4259
4260 case BINOP_EXP:
d2e4a39e 4261 return (!(numeric_type_p (type0) && integer_type_p (type1)));
14f9c5c9
AS
4262
4263 case UNOP_NEG:
4264 case UNOP_PLUS:
4265 case UNOP_LOGICAL_NOT:
d2e4a39e
AS
4266 case UNOP_ABS:
4267 return (!numeric_type_p (type0));
14f9c5c9
AS
4268
4269 }
4270}
4271\f
4c4b4cd2 4272 /* Renaming */
14f9c5c9 4273
aeb5907d
JB
4274/* NOTES:
4275
4276 1. In the following, we assume that a renaming type's name may
4277 have an ___XD suffix. It would be nice if this went away at some
4278 point.
4279 2. We handle both the (old) purely type-based representation of
4280 renamings and the (new) variable-based encoding. At some point,
4281 it is devoutly to be hoped that the former goes away
4282 (FIXME: hilfinger-2007-07-09).
4283 3. Subprogram renamings are not implemented, although the XRS
4284 suffix is recognized (FIXME: hilfinger-2007-07-09). */
4285
4286/* If SYM encodes a renaming,
4287
4288 <renaming> renames <renamed entity>,
4289
4290 sets *LEN to the length of the renamed entity's name,
4291 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
4292 the string describing the subcomponent selected from the renamed
0963b4bd 4293 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
aeb5907d
JB
4294 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
4295 are undefined). Otherwise, returns a value indicating the category
4296 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
4297 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
4298 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
4299 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
4300 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
4301 may be NULL, in which case they are not assigned.
4302
4303 [Currently, however, GCC does not generate subprogram renamings.] */
4304
4305enum ada_renaming_category
4306ada_parse_renaming (struct symbol *sym,
4307 const char **renamed_entity, int *len,
4308 const char **renaming_expr)
4309{
4310 enum ada_renaming_category kind;
4311 const char *info;
4312 const char *suffix;
4313
4314 if (sym == NULL)
4315 return ADA_NOT_RENAMING;
4316 switch (SYMBOL_CLASS (sym))
14f9c5c9 4317 {
aeb5907d
JB
4318 default:
4319 return ADA_NOT_RENAMING;
4320 case LOC_TYPEDEF:
4321 return parse_old_style_renaming (SYMBOL_TYPE (sym),
4322 renamed_entity, len, renaming_expr);
4323 case LOC_LOCAL:
4324 case LOC_STATIC:
4325 case LOC_COMPUTED:
4326 case LOC_OPTIMIZED_OUT:
4327 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
4328 if (info == NULL)
4329 return ADA_NOT_RENAMING;
4330 switch (info[5])
4331 {
4332 case '_':
4333 kind = ADA_OBJECT_RENAMING;
4334 info += 6;
4335 break;
4336 case 'E':
4337 kind = ADA_EXCEPTION_RENAMING;
4338 info += 7;
4339 break;
4340 case 'P':
4341 kind = ADA_PACKAGE_RENAMING;
4342 info += 7;
4343 break;
4344 case 'S':
4345 kind = ADA_SUBPROGRAM_RENAMING;
4346 info += 7;
4347 break;
4348 default:
4349 return ADA_NOT_RENAMING;
4350 }
14f9c5c9 4351 }
4c4b4cd2 4352
aeb5907d
JB
4353 if (renamed_entity != NULL)
4354 *renamed_entity = info;
4355 suffix = strstr (info, "___XE");
4356 if (suffix == NULL || suffix == info)
4357 return ADA_NOT_RENAMING;
4358 if (len != NULL)
4359 *len = strlen (info) - strlen (suffix);
4360 suffix += 5;
4361 if (renaming_expr != NULL)
4362 *renaming_expr = suffix;
4363 return kind;
4364}
4365
4366/* Assuming TYPE encodes a renaming according to the old encoding in
4367 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
4368 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
4369 ADA_NOT_RENAMING otherwise. */
4370static enum ada_renaming_category
4371parse_old_style_renaming (struct type *type,
4372 const char **renamed_entity, int *len,
4373 const char **renaming_expr)
4374{
4375 enum ada_renaming_category kind;
4376 const char *name;
4377 const char *info;
4378 const char *suffix;
14f9c5c9 4379
aeb5907d
JB
4380 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
4381 || TYPE_NFIELDS (type) != 1)
4382 return ADA_NOT_RENAMING;
14f9c5c9 4383
a737d952 4384 name = TYPE_NAME (type);
aeb5907d
JB
4385 if (name == NULL)
4386 return ADA_NOT_RENAMING;
4387
4388 name = strstr (name, "___XR");
4389 if (name == NULL)
4390 return ADA_NOT_RENAMING;
4391 switch (name[5])
4392 {
4393 case '\0':
4394 case '_':
4395 kind = ADA_OBJECT_RENAMING;
4396 break;
4397 case 'E':
4398 kind = ADA_EXCEPTION_RENAMING;
4399 break;
4400 case 'P':
4401 kind = ADA_PACKAGE_RENAMING;
4402 break;
4403 case 'S':
4404 kind = ADA_SUBPROGRAM_RENAMING;
4405 break;
4406 default:
4407 return ADA_NOT_RENAMING;
4408 }
14f9c5c9 4409
aeb5907d
JB
4410 info = TYPE_FIELD_NAME (type, 0);
4411 if (info == NULL)
4412 return ADA_NOT_RENAMING;
4413 if (renamed_entity != NULL)
4414 *renamed_entity = info;
4415 suffix = strstr (info, "___XE");
4416 if (renaming_expr != NULL)
4417 *renaming_expr = suffix + 5;
4418 if (suffix == NULL || suffix == info)
4419 return ADA_NOT_RENAMING;
4420 if (len != NULL)
4421 *len = suffix - info;
4422 return kind;
a5ee536b
JB
4423}
4424
4425/* Compute the value of the given RENAMING_SYM, which is expected to
4426 be a symbol encoding a renaming expression. BLOCK is the block
4427 used to evaluate the renaming. */
52ce6436 4428
a5ee536b
JB
4429static struct value *
4430ada_read_renaming_var_value (struct symbol *renaming_sym,
3977b71f 4431 const struct block *block)
a5ee536b 4432{
bbc13ae3 4433 const char *sym_name;
a5ee536b 4434
bbc13ae3 4435 sym_name = SYMBOL_LINKAGE_NAME (renaming_sym);
4d01a485
PA
4436 expression_up expr = parse_exp_1 (&sym_name, 0, block, 0);
4437 return evaluate_expression (expr.get ());
a5ee536b 4438}
14f9c5c9 4439\f
d2e4a39e 4440
4c4b4cd2 4441 /* Evaluation: Function Calls */
14f9c5c9 4442
4c4b4cd2 4443/* Return an lvalue containing the value VAL. This is the identity on
40bc484c
JB
4444 lvalues, and otherwise has the side-effect of allocating memory
4445 in the inferior where a copy of the value contents is copied. */
14f9c5c9 4446
d2e4a39e 4447static struct value *
40bc484c 4448ensure_lval (struct value *val)
14f9c5c9 4449{
40bc484c
JB
4450 if (VALUE_LVAL (val) == not_lval
4451 || VALUE_LVAL (val) == lval_internalvar)
c3e5cd34 4452 {
df407dfe 4453 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
40bc484c
JB
4454 const CORE_ADDR addr =
4455 value_as_long (value_allocate_space_in_inferior (len));
c3e5cd34 4456
a84a8a0d 4457 VALUE_LVAL (val) = lval_memory;
1a088441 4458 set_value_address (val, addr);
40bc484c 4459 write_memory (addr, value_contents (val), len);
c3e5cd34 4460 }
14f9c5c9
AS
4461
4462 return val;
4463}
4464
4465/* Return the value ACTUAL, converted to be an appropriate value for a
4466 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4467 allocating any necessary descriptors (fat pointers), or copies of
4c4b4cd2 4468 values not residing in memory, updating it as needed. */
14f9c5c9 4469
a93c0eb6 4470struct value *
40bc484c 4471ada_convert_actual (struct value *actual, struct type *formal_type0)
14f9c5c9 4472{
df407dfe 4473 struct type *actual_type = ada_check_typedef (value_type (actual));
61ee279c 4474 struct type *formal_type = ada_check_typedef (formal_type0);
d2e4a39e
AS
4475 struct type *formal_target =
4476 TYPE_CODE (formal_type) == TYPE_CODE_PTR
61ee279c 4477 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
d2e4a39e
AS
4478 struct type *actual_target =
4479 TYPE_CODE (actual_type) == TYPE_CODE_PTR
61ee279c 4480 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
14f9c5c9 4481
4c4b4cd2 4482 if (ada_is_array_descriptor_type (formal_target)
14f9c5c9 4483 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
40bc484c 4484 return make_array_descriptor (formal_type, actual);
a84a8a0d
JB
4485 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
4486 || TYPE_CODE (formal_type) == TYPE_CODE_REF)
14f9c5c9 4487 {
a84a8a0d 4488 struct value *result;
5b4ee69b 4489
14f9c5c9 4490 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
4c4b4cd2 4491 && ada_is_array_descriptor_type (actual_target))
a84a8a0d 4492 result = desc_data (actual);
cb923fcc 4493 else if (TYPE_CODE (formal_type) != TYPE_CODE_PTR)
4c4b4cd2
PH
4494 {
4495 if (VALUE_LVAL (actual) != lval_memory)
4496 {
4497 struct value *val;
5b4ee69b 4498
df407dfe 4499 actual_type = ada_check_typedef (value_type (actual));
4c4b4cd2 4500 val = allocate_value (actual_type);
990a07ab 4501 memcpy ((char *) value_contents_raw (val),
0fd88904 4502 (char *) value_contents (actual),
4c4b4cd2 4503 TYPE_LENGTH (actual_type));
40bc484c 4504 actual = ensure_lval (val);
4c4b4cd2 4505 }
a84a8a0d 4506 result = value_addr (actual);
4c4b4cd2 4507 }
a84a8a0d
JB
4508 else
4509 return actual;
b1af9e97 4510 return value_cast_pointers (formal_type, result, 0);
14f9c5c9
AS
4511 }
4512 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
4513 return ada_value_ind (actual);
8344af1e
JB
4514 else if (ada_is_aligner_type (formal_type))
4515 {
4516 /* We need to turn this parameter into an aligner type
4517 as well. */
4518 struct value *aligner = allocate_value (formal_type);
4519 struct value *component = ada_value_struct_elt (aligner, "F", 0);
4520
4521 value_assign_to_component (aligner, component, actual);
4522 return aligner;
4523 }
14f9c5c9
AS
4524
4525 return actual;
4526}
4527
438c98a1
JB
4528/* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4529 type TYPE. This is usually an inefficient no-op except on some targets
4530 (such as AVR) where the representation of a pointer and an address
4531 differs. */
4532
4533static CORE_ADDR
4534value_pointer (struct value *value, struct type *type)
4535{
4536 struct gdbarch *gdbarch = get_type_arch (type);
4537 unsigned len = TYPE_LENGTH (type);
224c3ddb 4538 gdb_byte *buf = (gdb_byte *) alloca (len);
438c98a1
JB
4539 CORE_ADDR addr;
4540
4541 addr = value_address (value);
4542 gdbarch_address_to_pointer (gdbarch, type, buf, addr);
4543 addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch));
4544 return addr;
4545}
4546
14f9c5c9 4547
4c4b4cd2
PH
4548/* Push a descriptor of type TYPE for array value ARR on the stack at
4549 *SP, updating *SP to reflect the new descriptor. Return either
14f9c5c9 4550 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4c4b4cd2
PH
4551 to-descriptor type rather than a descriptor type), a struct value *
4552 representing a pointer to this descriptor. */
14f9c5c9 4553
d2e4a39e 4554static struct value *
40bc484c 4555make_array_descriptor (struct type *type, struct value *arr)
14f9c5c9 4556{
d2e4a39e
AS
4557 struct type *bounds_type = desc_bounds_type (type);
4558 struct type *desc_type = desc_base_type (type);
4559 struct value *descriptor = allocate_value (desc_type);
4560 struct value *bounds = allocate_value (bounds_type);
14f9c5c9 4561 int i;
d2e4a39e 4562
0963b4bd
MS
4563 for (i = ada_array_arity (ada_check_typedef (value_type (arr)));
4564 i > 0; i -= 1)
14f9c5c9 4565 {
19f220c3
JK
4566 modify_field (value_type (bounds), value_contents_writeable (bounds),
4567 ada_array_bound (arr, i, 0),
4568 desc_bound_bitpos (bounds_type, i, 0),
4569 desc_bound_bitsize (bounds_type, i, 0));
4570 modify_field (value_type (bounds), value_contents_writeable (bounds),
4571 ada_array_bound (arr, i, 1),
4572 desc_bound_bitpos (bounds_type, i, 1),
4573 desc_bound_bitsize (bounds_type, i, 1));
14f9c5c9 4574 }
d2e4a39e 4575
40bc484c 4576 bounds = ensure_lval (bounds);
d2e4a39e 4577
19f220c3
JK
4578 modify_field (value_type (descriptor),
4579 value_contents_writeable (descriptor),
4580 value_pointer (ensure_lval (arr),
4581 TYPE_FIELD_TYPE (desc_type, 0)),
4582 fat_pntr_data_bitpos (desc_type),
4583 fat_pntr_data_bitsize (desc_type));
4584
4585 modify_field (value_type (descriptor),
4586 value_contents_writeable (descriptor),
4587 value_pointer (bounds,
4588 TYPE_FIELD_TYPE (desc_type, 1)),
4589 fat_pntr_bounds_bitpos (desc_type),
4590 fat_pntr_bounds_bitsize (desc_type));
14f9c5c9 4591
40bc484c 4592 descriptor = ensure_lval (descriptor);
14f9c5c9
AS
4593
4594 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4595 return value_addr (descriptor);
4596 else
4597 return descriptor;
4598}
14f9c5c9 4599\f
3d9434b5
JB
4600 /* Symbol Cache Module */
4601
3d9434b5 4602/* Performance measurements made as of 2010-01-15 indicate that
ee01b665 4603 this cache does bring some noticeable improvements. Depending
3d9434b5
JB
4604 on the type of entity being printed, the cache can make it as much
4605 as an order of magnitude faster than without it.
4606
4607 The descriptive type DWARF extension has significantly reduced
4608 the need for this cache, at least when DWARF is being used. However,
4609 even in this case, some expensive name-based symbol searches are still
4610 sometimes necessary - to find an XVZ variable, mostly. */
4611
ee01b665 4612/* Initialize the contents of SYM_CACHE. */
3d9434b5 4613
ee01b665
JB
4614static void
4615ada_init_symbol_cache (struct ada_symbol_cache *sym_cache)
4616{
4617 obstack_init (&sym_cache->cache_space);
4618 memset (sym_cache->root, '\000', sizeof (sym_cache->root));
4619}
3d9434b5 4620
ee01b665
JB
4621/* Free the memory used by SYM_CACHE. */
4622
4623static void
4624ada_free_symbol_cache (struct ada_symbol_cache *sym_cache)
3d9434b5 4625{
ee01b665
JB
4626 obstack_free (&sym_cache->cache_space, NULL);
4627 xfree (sym_cache);
4628}
3d9434b5 4629
ee01b665
JB
4630/* Return the symbol cache associated to the given program space PSPACE.
4631 If not allocated for this PSPACE yet, allocate and initialize one. */
3d9434b5 4632
ee01b665
JB
4633static struct ada_symbol_cache *
4634ada_get_symbol_cache (struct program_space *pspace)
4635{
4636 struct ada_pspace_data *pspace_data = get_ada_pspace_data (pspace);
ee01b665 4637
66c168ae 4638 if (pspace_data->sym_cache == NULL)
ee01b665 4639 {
66c168ae
JB
4640 pspace_data->sym_cache = XCNEW (struct ada_symbol_cache);
4641 ada_init_symbol_cache (pspace_data->sym_cache);
ee01b665
JB
4642 }
4643
66c168ae 4644 return pspace_data->sym_cache;
ee01b665 4645}
3d9434b5
JB
4646
4647/* Clear all entries from the symbol cache. */
4648
4649static void
4650ada_clear_symbol_cache (void)
4651{
ee01b665
JB
4652 struct ada_symbol_cache *sym_cache
4653 = ada_get_symbol_cache (current_program_space);
4654
4655 obstack_free (&sym_cache->cache_space, NULL);
4656 ada_init_symbol_cache (sym_cache);
3d9434b5
JB
4657}
4658
fe978cb0 4659/* Search our cache for an entry matching NAME and DOMAIN.
3d9434b5
JB
4660 Return it if found, or NULL otherwise. */
4661
4662static struct cache_entry **
fe978cb0 4663find_entry (const char *name, domain_enum domain)
3d9434b5 4664{
ee01b665
JB
4665 struct ada_symbol_cache *sym_cache
4666 = ada_get_symbol_cache (current_program_space);
3d9434b5
JB
4667 int h = msymbol_hash (name) % HASH_SIZE;
4668 struct cache_entry **e;
4669
ee01b665 4670 for (e = &sym_cache->root[h]; *e != NULL; e = &(*e)->next)
3d9434b5 4671 {
fe978cb0 4672 if (domain == (*e)->domain && strcmp (name, (*e)->name) == 0)
3d9434b5
JB
4673 return e;
4674 }
4675 return NULL;
4676}
4677
fe978cb0 4678/* Search the symbol cache for an entry matching NAME and DOMAIN.
3d9434b5
JB
4679 Return 1 if found, 0 otherwise.
4680
4681 If an entry was found and SYM is not NULL, set *SYM to the entry's
4682 SYM. Same principle for BLOCK if not NULL. */
96d887e8 4683
96d887e8 4684static int
fe978cb0 4685lookup_cached_symbol (const char *name, domain_enum domain,
f0c5f9b2 4686 struct symbol **sym, const struct block **block)
96d887e8 4687{
fe978cb0 4688 struct cache_entry **e = find_entry (name, domain);
3d9434b5
JB
4689
4690 if (e == NULL)
4691 return 0;
4692 if (sym != NULL)
4693 *sym = (*e)->sym;
4694 if (block != NULL)
4695 *block = (*e)->block;
4696 return 1;
96d887e8
PH
4697}
4698
3d9434b5 4699/* Assuming that (SYM, BLOCK) is the result of the lookup of NAME
fe978cb0 4700 in domain DOMAIN, save this result in our symbol cache. */
3d9434b5 4701
96d887e8 4702static void
fe978cb0 4703cache_symbol (const char *name, domain_enum domain, struct symbol *sym,
270140bd 4704 const struct block *block)
96d887e8 4705{
ee01b665
JB
4706 struct ada_symbol_cache *sym_cache
4707 = ada_get_symbol_cache (current_program_space);
3d9434b5
JB
4708 int h;
4709 char *copy;
4710 struct cache_entry *e;
4711
1994afbf
DE
4712 /* Symbols for builtin types don't have a block.
4713 For now don't cache such symbols. */
4714 if (sym != NULL && !SYMBOL_OBJFILE_OWNED (sym))
4715 return;
4716
3d9434b5
JB
4717 /* If the symbol is a local symbol, then do not cache it, as a search
4718 for that symbol depends on the context. To determine whether
4719 the symbol is local or not, we check the block where we found it
4720 against the global and static blocks of its associated symtab. */
4721 if (sym
08be3fe3 4722 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)),
439247b6 4723 GLOBAL_BLOCK) != block
08be3fe3 4724 && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)),
439247b6 4725 STATIC_BLOCK) != block)
3d9434b5
JB
4726 return;
4727
4728 h = msymbol_hash (name) % HASH_SIZE;
e39db4db 4729 e = XOBNEW (&sym_cache->cache_space, cache_entry);
ee01b665
JB
4730 e->next = sym_cache->root[h];
4731 sym_cache->root[h] = e;
224c3ddb
SM
4732 e->name = copy
4733 = (char *) obstack_alloc (&sym_cache->cache_space, strlen (name) + 1);
3d9434b5
JB
4734 strcpy (copy, name);
4735 e->sym = sym;
fe978cb0 4736 e->domain = domain;
3d9434b5 4737 e->block = block;
96d887e8 4738}
4c4b4cd2
PH
4739\f
4740 /* Symbol Lookup */
4741
b5ec771e
PA
4742/* Return the symbol name match type that should be used used when
4743 searching for all symbols matching LOOKUP_NAME.
c0431670
JB
4744
4745 LOOKUP_NAME is expected to be a symbol name after transformation
f98b2e33 4746 for Ada lookups. */
c0431670 4747
b5ec771e
PA
4748static symbol_name_match_type
4749name_match_type_from_name (const char *lookup_name)
c0431670 4750{
b5ec771e
PA
4751 return (strstr (lookup_name, "__") == NULL
4752 ? symbol_name_match_type::WILD
4753 : symbol_name_match_type::FULL);
c0431670
JB
4754}
4755
4c4b4cd2
PH
4756/* Return the result of a standard (literal, C-like) lookup of NAME in
4757 given DOMAIN, visible from lexical block BLOCK. */
4758
4759static struct symbol *
4760standard_lookup (const char *name, const struct block *block,
4761 domain_enum domain)
4762{
acbd605d 4763 /* Initialize it just to avoid a GCC false warning. */
6640a367 4764 struct block_symbol sym = {};
4c4b4cd2 4765
d12307c1
PMR
4766 if (lookup_cached_symbol (name, domain, &sym.symbol, NULL))
4767 return sym.symbol;
a2cd4f14 4768 ada_lookup_encoded_symbol (name, block, domain, &sym);
d12307c1
PMR
4769 cache_symbol (name, domain, sym.symbol, sym.block);
4770 return sym.symbol;
4c4b4cd2
PH
4771}
4772
4773
4774/* Non-zero iff there is at least one non-function/non-enumeral symbol
4775 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4776 since they contend in overloading in the same way. */
4777static int
d12307c1 4778is_nonfunction (struct block_symbol syms[], int n)
4c4b4cd2
PH
4779{
4780 int i;
4781
4782 for (i = 0; i < n; i += 1)
d12307c1
PMR
4783 if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_FUNC
4784 && (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM
4785 || SYMBOL_CLASS (syms[i].symbol) != LOC_CONST))
14f9c5c9
AS
4786 return 1;
4787
4788 return 0;
4789}
4790
4791/* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4c4b4cd2 4792 struct types. Otherwise, they may not. */
14f9c5c9
AS
4793
4794static int
d2e4a39e 4795equiv_types (struct type *type0, struct type *type1)
14f9c5c9 4796{
d2e4a39e 4797 if (type0 == type1)
14f9c5c9 4798 return 1;
d2e4a39e 4799 if (type0 == NULL || type1 == NULL
14f9c5c9
AS
4800 || TYPE_CODE (type0) != TYPE_CODE (type1))
4801 return 0;
d2e4a39e 4802 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
14f9c5c9
AS
4803 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
4804 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
4c4b4cd2 4805 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
14f9c5c9 4806 return 1;
d2e4a39e 4807
14f9c5c9
AS
4808 return 0;
4809}
4810
4811/* True iff SYM0 represents the same entity as SYM1, or one that is
4c4b4cd2 4812 no more defined than that of SYM1. */
14f9c5c9
AS
4813
4814static int
d2e4a39e 4815lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
14f9c5c9
AS
4816{
4817 if (sym0 == sym1)
4818 return 1;
176620f1 4819 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
14f9c5c9
AS
4820 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
4821 return 0;
4822
d2e4a39e 4823 switch (SYMBOL_CLASS (sym0))
14f9c5c9
AS
4824 {
4825 case LOC_UNDEF:
4826 return 1;
4827 case LOC_TYPEDEF:
4828 {
4c4b4cd2
PH
4829 struct type *type0 = SYMBOL_TYPE (sym0);
4830 struct type *type1 = SYMBOL_TYPE (sym1);
0d5cff50
DE
4831 const char *name0 = SYMBOL_LINKAGE_NAME (sym0);
4832 const char *name1 = SYMBOL_LINKAGE_NAME (sym1);
4c4b4cd2 4833 int len0 = strlen (name0);
5b4ee69b 4834
4c4b4cd2
PH
4835 return
4836 TYPE_CODE (type0) == TYPE_CODE (type1)
4837 && (equiv_types (type0, type1)
4838 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
61012eef 4839 && startswith (name1 + len0, "___XV")));
14f9c5c9
AS
4840 }
4841 case LOC_CONST:
4842 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
4c4b4cd2 4843 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
d2e4a39e
AS
4844 default:
4845 return 0;
14f9c5c9
AS
4846 }
4847}
4848
d12307c1 4849/* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol
4c4b4cd2 4850 records in OBSTACKP. Do nothing if SYM is a duplicate. */
14f9c5c9
AS
4851
4852static void
76a01679
JB
4853add_defn_to_vec (struct obstack *obstackp,
4854 struct symbol *sym,
f0c5f9b2 4855 const struct block *block)
14f9c5c9
AS
4856{
4857 int i;
d12307c1 4858 struct block_symbol *prevDefns = defns_collected (obstackp, 0);
14f9c5c9 4859
529cad9c
PH
4860 /* Do not try to complete stub types, as the debugger is probably
4861 already scanning all symbols matching a certain name at the
4862 time when this function is called. Trying to replace the stub
4863 type by its associated full type will cause us to restart a scan
4864 which may lead to an infinite recursion. Instead, the client
4865 collecting the matching symbols will end up collecting several
4866 matches, with at least one of them complete. It can then filter
4867 out the stub ones if needed. */
4868
4c4b4cd2
PH
4869 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4870 {
d12307c1 4871 if (lesseq_defined_than (sym, prevDefns[i].symbol))
4c4b4cd2 4872 return;
d12307c1 4873 else if (lesseq_defined_than (prevDefns[i].symbol, sym))
4c4b4cd2 4874 {
d12307c1 4875 prevDefns[i].symbol = sym;
4c4b4cd2 4876 prevDefns[i].block = block;
4c4b4cd2 4877 return;
76a01679 4878 }
4c4b4cd2
PH
4879 }
4880
4881 {
d12307c1 4882 struct block_symbol info;
4c4b4cd2 4883
d12307c1 4884 info.symbol = sym;
4c4b4cd2 4885 info.block = block;
d12307c1 4886 obstack_grow (obstackp, &info, sizeof (struct block_symbol));
4c4b4cd2
PH
4887 }
4888}
4889
d12307c1
PMR
4890/* Number of block_symbol structures currently collected in current vector in
4891 OBSTACKP. */
4c4b4cd2 4892
76a01679
JB
4893static int
4894num_defns_collected (struct obstack *obstackp)
4c4b4cd2 4895{
d12307c1 4896 return obstack_object_size (obstackp) / sizeof (struct block_symbol);
4c4b4cd2
PH
4897}
4898
d12307c1
PMR
4899/* Vector of block_symbol structures currently collected in current vector in
4900 OBSTACKP. If FINISH, close off the vector and return its final address. */
4c4b4cd2 4901
d12307c1 4902static struct block_symbol *
4c4b4cd2
PH
4903defns_collected (struct obstack *obstackp, int finish)
4904{
4905 if (finish)
224c3ddb 4906 return (struct block_symbol *) obstack_finish (obstackp);
4c4b4cd2 4907 else
d12307c1 4908 return (struct block_symbol *) obstack_base (obstackp);
4c4b4cd2
PH
4909}
4910
7c7b6655
TT
4911/* Return a bound minimal symbol matching NAME according to Ada
4912 decoding rules. Returns an invalid symbol if there is no such
4913 minimal symbol. Names prefixed with "standard__" are handled
4914 specially: "standard__" is first stripped off, and only static and
4915 global symbols are searched. */
4c4b4cd2 4916
7c7b6655 4917struct bound_minimal_symbol
96d887e8 4918ada_lookup_simple_minsym (const char *name)
4c4b4cd2 4919{
7c7b6655 4920 struct bound_minimal_symbol result;
4c4b4cd2 4921
7c7b6655
TT
4922 memset (&result, 0, sizeof (result));
4923
b5ec771e
PA
4924 symbol_name_match_type match_type = name_match_type_from_name (name);
4925 lookup_name_info lookup_name (name, match_type);
4926
4927 symbol_name_matcher_ftype *match_name
4928 = ada_get_symbol_name_matcher (lookup_name);
4c4b4cd2 4929
2030c079 4930 for (objfile *objfile : current_program_space->objfiles ())
5325b9bf 4931 {
7932255d 4932 for (minimal_symbol *msymbol : objfile->msymbols ())
5325b9bf
TT
4933 {
4934 if (match_name (MSYMBOL_LINKAGE_NAME (msymbol), lookup_name, NULL)
4935 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4936 {
4937 result.minsym = msymbol;
4938 result.objfile = objfile;
4939 break;
4940 }
4941 }
4942 }
4c4b4cd2 4943
7c7b6655 4944 return result;
96d887e8 4945}
4c4b4cd2 4946
96d887e8
PH
4947/* For all subprograms that statically enclose the subprogram of the
4948 selected frame, add symbols matching identifier NAME in DOMAIN
4949 and their blocks to the list of data in OBSTACKP, as for
48b78332
JB
4950 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4951 with a wildcard prefix. */
4c4b4cd2 4952
96d887e8
PH
4953static void
4954add_symbols_from_enclosing_procs (struct obstack *obstackp,
b5ec771e
PA
4955 const lookup_name_info &lookup_name,
4956 domain_enum domain)
96d887e8 4957{
96d887e8 4958}
14f9c5c9 4959
96d887e8
PH
4960/* True if TYPE is definitely an artificial type supplied to a symbol
4961 for which no debugging information was given in the symbol file. */
14f9c5c9 4962
96d887e8
PH
4963static int
4964is_nondebugging_type (struct type *type)
4965{
0d5cff50 4966 const char *name = ada_type_name (type);
5b4ee69b 4967
96d887e8
PH
4968 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4969}
4c4b4cd2 4970
8f17729f
JB
4971/* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4972 that are deemed "identical" for practical purposes.
4973
4974 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4975 types and that their number of enumerals is identical (in other
4976 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4977
4978static int
4979ada_identical_enum_types_p (struct type *type1, struct type *type2)
4980{
4981 int i;
4982
4983 /* The heuristic we use here is fairly conservative. We consider
4984 that 2 enumerate types are identical if they have the same
4985 number of enumerals and that all enumerals have the same
4986 underlying value and name. */
4987
4988 /* All enums in the type should have an identical underlying value. */
4989 for (i = 0; i < TYPE_NFIELDS (type1); i++)
14e75d8e 4990 if (TYPE_FIELD_ENUMVAL (type1, i) != TYPE_FIELD_ENUMVAL (type2, i))
8f17729f
JB
4991 return 0;
4992
4993 /* All enumerals should also have the same name (modulo any numerical
4994 suffix). */
4995 for (i = 0; i < TYPE_NFIELDS (type1); i++)
4996 {
0d5cff50
DE
4997 const char *name_1 = TYPE_FIELD_NAME (type1, i);
4998 const char *name_2 = TYPE_FIELD_NAME (type2, i);
8f17729f
JB
4999 int len_1 = strlen (name_1);
5000 int len_2 = strlen (name_2);
5001
5002 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1);
5003 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2);
5004 if (len_1 != len_2
5005 || strncmp (TYPE_FIELD_NAME (type1, i),
5006 TYPE_FIELD_NAME (type2, i),
5007 len_1) != 0)
5008 return 0;
5009 }
5010
5011 return 1;
5012}
5013
5014/* Return nonzero if all the symbols in SYMS are all enumeral symbols
5015 that are deemed "identical" for practical purposes. Sometimes,
5016 enumerals are not strictly identical, but their types are so similar
5017 that they can be considered identical.
5018
5019 For instance, consider the following code:
5020
5021 type Color is (Black, Red, Green, Blue, White);
5022 type RGB_Color is new Color range Red .. Blue;
5023
5024 Type RGB_Color is a subrange of an implicit type which is a copy
5025 of type Color. If we call that implicit type RGB_ColorB ("B" is
5026 for "Base Type"), then type RGB_ColorB is a copy of type Color.
5027 As a result, when an expression references any of the enumeral
5028 by name (Eg. "print green"), the expression is technically
5029 ambiguous and the user should be asked to disambiguate. But
5030 doing so would only hinder the user, since it wouldn't matter
5031 what choice he makes, the outcome would always be the same.
5032 So, for practical purposes, we consider them as the same. */
5033
5034static int
54d343a2 5035symbols_are_identical_enums (const std::vector<struct block_symbol> &syms)
8f17729f
JB
5036{
5037 int i;
5038
5039 /* Before performing a thorough comparison check of each type,
5040 we perform a series of inexpensive checks. We expect that these
5041 checks will quickly fail in the vast majority of cases, and thus
5042 help prevent the unnecessary use of a more expensive comparison.
5043 Said comparison also expects us to make some of these checks
5044 (see ada_identical_enum_types_p). */
5045
5046 /* Quick check: All symbols should have an enum type. */
54d343a2 5047 for (i = 0; i < syms.size (); i++)
d12307c1 5048 if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM)
8f17729f
JB
5049 return 0;
5050
5051 /* Quick check: They should all have the same value. */
54d343a2 5052 for (i = 1; i < syms.size (); i++)
d12307c1 5053 if (SYMBOL_VALUE (syms[i].symbol) != SYMBOL_VALUE (syms[0].symbol))
8f17729f
JB
5054 return 0;
5055
5056 /* Quick check: They should all have the same number of enumerals. */
54d343a2 5057 for (i = 1; i < syms.size (); i++)
d12307c1
PMR
5058 if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].symbol))
5059 != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].symbol)))
8f17729f
JB
5060 return 0;
5061
5062 /* All the sanity checks passed, so we might have a set of
5063 identical enumeration types. Perform a more complete
5064 comparison of the type of each symbol. */
54d343a2 5065 for (i = 1; i < syms.size (); i++)
d12307c1
PMR
5066 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].symbol),
5067 SYMBOL_TYPE (syms[0].symbol)))
8f17729f
JB
5068 return 0;
5069
5070 return 1;
5071}
5072
54d343a2 5073/* Remove any non-debugging symbols in SYMS that definitely
96d887e8
PH
5074 duplicate other symbols in the list (The only case I know of where
5075 this happens is when object files containing stabs-in-ecoff are
5076 linked with files containing ordinary ecoff debugging symbols (or no
5077 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
5078 Returns the number of items in the modified list. */
4c4b4cd2 5079
96d887e8 5080static int
54d343a2 5081remove_extra_symbols (std::vector<struct block_symbol> *syms)
96d887e8
PH
5082{
5083 int i, j;
4c4b4cd2 5084
8f17729f
JB
5085 /* We should never be called with less than 2 symbols, as there
5086 cannot be any extra symbol in that case. But it's easy to
5087 handle, since we have nothing to do in that case. */
54d343a2
TT
5088 if (syms->size () < 2)
5089 return syms->size ();
8f17729f 5090
96d887e8 5091 i = 0;
54d343a2 5092 while (i < syms->size ())
96d887e8 5093 {
a35ddb44 5094 int remove_p = 0;
339c13b6
JB
5095
5096 /* If two symbols have the same name and one of them is a stub type,
5097 the get rid of the stub. */
5098
54d343a2
TT
5099 if (TYPE_STUB (SYMBOL_TYPE ((*syms)[i].symbol))
5100 && SYMBOL_LINKAGE_NAME ((*syms)[i].symbol) != NULL)
339c13b6 5101 {
54d343a2 5102 for (j = 0; j < syms->size (); j++)
339c13b6
JB
5103 {
5104 if (j != i
54d343a2
TT
5105 && !TYPE_STUB (SYMBOL_TYPE ((*syms)[j].symbol))
5106 && SYMBOL_LINKAGE_NAME ((*syms)[j].symbol) != NULL
5107 && strcmp (SYMBOL_LINKAGE_NAME ((*syms)[i].symbol),
5108 SYMBOL_LINKAGE_NAME ((*syms)[j].symbol)) == 0)
a35ddb44 5109 remove_p = 1;
339c13b6
JB
5110 }
5111 }
5112
5113 /* Two symbols with the same name, same class and same address
5114 should be identical. */
5115
54d343a2
TT
5116 else if (SYMBOL_LINKAGE_NAME ((*syms)[i].symbol) != NULL
5117 && SYMBOL_CLASS ((*syms)[i].symbol) == LOC_STATIC
5118 && is_nondebugging_type (SYMBOL_TYPE ((*syms)[i].symbol)))
96d887e8 5119 {
54d343a2 5120 for (j = 0; j < syms->size (); j += 1)
96d887e8
PH
5121 {
5122 if (i != j
54d343a2
TT
5123 && SYMBOL_LINKAGE_NAME ((*syms)[j].symbol) != NULL
5124 && strcmp (SYMBOL_LINKAGE_NAME ((*syms)[i].symbol),
5125 SYMBOL_LINKAGE_NAME ((*syms)[j].symbol)) == 0
5126 && SYMBOL_CLASS ((*syms)[i].symbol)
5127 == SYMBOL_CLASS ((*syms)[j].symbol)
5128 && SYMBOL_VALUE_ADDRESS ((*syms)[i].symbol)
5129 == SYMBOL_VALUE_ADDRESS ((*syms)[j].symbol))
a35ddb44 5130 remove_p = 1;
4c4b4cd2 5131 }
4c4b4cd2 5132 }
339c13b6 5133
a35ddb44 5134 if (remove_p)
54d343a2 5135 syms->erase (syms->begin () + i);
339c13b6 5136
96d887e8 5137 i += 1;
14f9c5c9 5138 }
8f17729f
JB
5139
5140 /* If all the remaining symbols are identical enumerals, then
5141 just keep the first one and discard the rest.
5142
5143 Unlike what we did previously, we do not discard any entry
5144 unless they are ALL identical. This is because the symbol
5145 comparison is not a strict comparison, but rather a practical
5146 comparison. If all symbols are considered identical, then
5147 we can just go ahead and use the first one and discard the rest.
5148 But if we cannot reduce the list to a single element, we have
5149 to ask the user to disambiguate anyways. And if we have to
5150 present a multiple-choice menu, it's less confusing if the list
5151 isn't missing some choices that were identical and yet distinct. */
54d343a2
TT
5152 if (symbols_are_identical_enums (*syms))
5153 syms->resize (1);
8f17729f 5154
54d343a2 5155 return syms->size ();
14f9c5c9
AS
5156}
5157
96d887e8
PH
5158/* Given a type that corresponds to a renaming entity, use the type name
5159 to extract the scope (package name or function name, fully qualified,
5160 and following the GNAT encoding convention) where this renaming has been
49d83361 5161 defined. */
4c4b4cd2 5162
49d83361 5163static std::string
96d887e8 5164xget_renaming_scope (struct type *renaming_type)
14f9c5c9 5165{
96d887e8 5166 /* The renaming types adhere to the following convention:
0963b4bd 5167 <scope>__<rename>___<XR extension>.
96d887e8
PH
5168 So, to extract the scope, we search for the "___XR" extension,
5169 and then backtrack until we find the first "__". */
76a01679 5170
a737d952 5171 const char *name = TYPE_NAME (renaming_type);
108d56a4
SM
5172 const char *suffix = strstr (name, "___XR");
5173 const char *last;
14f9c5c9 5174
96d887e8
PH
5175 /* Now, backtrack a bit until we find the first "__". Start looking
5176 at suffix - 3, as the <rename> part is at least one character long. */
14f9c5c9 5177
96d887e8
PH
5178 for (last = suffix - 3; last > name; last--)
5179 if (last[0] == '_' && last[1] == '_')
5180 break;
76a01679 5181
96d887e8 5182 /* Make a copy of scope and return it. */
49d83361 5183 return std::string (name, last);
4c4b4cd2
PH
5184}
5185
96d887e8 5186/* Return nonzero if NAME corresponds to a package name. */
4c4b4cd2 5187
96d887e8
PH
5188static int
5189is_package_name (const char *name)
4c4b4cd2 5190{
96d887e8
PH
5191 /* Here, We take advantage of the fact that no symbols are generated
5192 for packages, while symbols are generated for each function.
5193 So the condition for NAME represent a package becomes equivalent
5194 to NAME not existing in our list of symbols. There is only one
5195 small complication with library-level functions (see below). */
4c4b4cd2 5196
96d887e8
PH
5197 /* If it is a function that has not been defined at library level,
5198 then we should be able to look it up in the symbols. */
5199 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
5200 return 0;
14f9c5c9 5201
96d887e8
PH
5202 /* Library-level function names start with "_ada_". See if function
5203 "_ada_" followed by NAME can be found. */
14f9c5c9 5204
96d887e8 5205 /* Do a quick check that NAME does not contain "__", since library-level
e1d5a0d2 5206 functions names cannot contain "__" in them. */
96d887e8
PH
5207 if (strstr (name, "__") != NULL)
5208 return 0;
4c4b4cd2 5209
528e1572 5210 std::string fun_name = string_printf ("_ada_%s", name);
14f9c5c9 5211
528e1572 5212 return (standard_lookup (fun_name.c_str (), NULL, VAR_DOMAIN) == NULL);
96d887e8 5213}
14f9c5c9 5214
96d887e8 5215/* Return nonzero if SYM corresponds to a renaming entity that is
aeb5907d 5216 not visible from FUNCTION_NAME. */
14f9c5c9 5217
96d887e8 5218static int
0d5cff50 5219old_renaming_is_invisible (const struct symbol *sym, const char *function_name)
96d887e8 5220{
aeb5907d
JB
5221 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
5222 return 0;
5223
49d83361 5224 std::string scope = xget_renaming_scope (SYMBOL_TYPE (sym));
14f9c5c9 5225
96d887e8 5226 /* If the rename has been defined in a package, then it is visible. */
49d83361
TT
5227 if (is_package_name (scope.c_str ()))
5228 return 0;
14f9c5c9 5229
96d887e8
PH
5230 /* Check that the rename is in the current function scope by checking
5231 that its name starts with SCOPE. */
76a01679 5232
96d887e8
PH
5233 /* If the function name starts with "_ada_", it means that it is
5234 a library-level function. Strip this prefix before doing the
5235 comparison, as the encoding for the renaming does not contain
5236 this prefix. */
61012eef 5237 if (startswith (function_name, "_ada_"))
96d887e8 5238 function_name += 5;
f26caa11 5239
49d83361 5240 return !startswith (function_name, scope.c_str ());
f26caa11
PH
5241}
5242
aeb5907d
JB
5243/* Remove entries from SYMS that corresponds to a renaming entity that
5244 is not visible from the function associated with CURRENT_BLOCK or
5245 that is superfluous due to the presence of more specific renaming
5246 information. Places surviving symbols in the initial entries of
5247 SYMS and returns the number of surviving symbols.
96d887e8
PH
5248
5249 Rationale:
aeb5907d
JB
5250 First, in cases where an object renaming is implemented as a
5251 reference variable, GNAT may produce both the actual reference
5252 variable and the renaming encoding. In this case, we discard the
5253 latter.
5254
5255 Second, GNAT emits a type following a specified encoding for each renaming
96d887e8
PH
5256 entity. Unfortunately, STABS currently does not support the definition
5257 of types that are local to a given lexical block, so all renamings types
5258 are emitted at library level. As a consequence, if an application
5259 contains two renaming entities using the same name, and a user tries to
5260 print the value of one of these entities, the result of the ada symbol
5261 lookup will also contain the wrong renaming type.
f26caa11 5262
96d887e8
PH
5263 This function partially covers for this limitation by attempting to
5264 remove from the SYMS list renaming symbols that should be visible
5265 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
5266 method with the current information available. The implementation
5267 below has a couple of limitations (FIXME: brobecker-2003-05-12):
5268
5269 - When the user tries to print a rename in a function while there
5270 is another rename entity defined in a package: Normally, the
5271 rename in the function has precedence over the rename in the
5272 package, so the latter should be removed from the list. This is
5273 currently not the case.
5274
5275 - This function will incorrectly remove valid renames if
5276 the CURRENT_BLOCK corresponds to a function which symbol name
5277 has been changed by an "Export" pragma. As a consequence,
5278 the user will be unable to print such rename entities. */
4c4b4cd2 5279
14f9c5c9 5280static int
54d343a2
TT
5281remove_irrelevant_renamings (std::vector<struct block_symbol> *syms,
5282 const struct block *current_block)
4c4b4cd2
PH
5283{
5284 struct symbol *current_function;
0d5cff50 5285 const char *current_function_name;
4c4b4cd2 5286 int i;
aeb5907d
JB
5287 int is_new_style_renaming;
5288
5289 /* If there is both a renaming foo___XR... encoded as a variable and
5290 a simple variable foo in the same block, discard the latter.
0963b4bd 5291 First, zero out such symbols, then compress. */
aeb5907d 5292 is_new_style_renaming = 0;
54d343a2 5293 for (i = 0; i < syms->size (); i += 1)
aeb5907d 5294 {
54d343a2
TT
5295 struct symbol *sym = (*syms)[i].symbol;
5296 const struct block *block = (*syms)[i].block;
aeb5907d
JB
5297 const char *name;
5298 const char *suffix;
5299
5300 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
5301 continue;
5302 name = SYMBOL_LINKAGE_NAME (sym);
5303 suffix = strstr (name, "___XR");
5304
5305 if (suffix != NULL)
5306 {
5307 int name_len = suffix - name;
5308 int j;
5b4ee69b 5309
aeb5907d 5310 is_new_style_renaming = 1;
54d343a2
TT
5311 for (j = 0; j < syms->size (); j += 1)
5312 if (i != j && (*syms)[j].symbol != NULL
5313 && strncmp (name, SYMBOL_LINKAGE_NAME ((*syms)[j].symbol),
aeb5907d 5314 name_len) == 0
54d343a2
TT
5315 && block == (*syms)[j].block)
5316 (*syms)[j].symbol = NULL;
aeb5907d
JB
5317 }
5318 }
5319 if (is_new_style_renaming)
5320 {
5321 int j, k;
5322
54d343a2
TT
5323 for (j = k = 0; j < syms->size (); j += 1)
5324 if ((*syms)[j].symbol != NULL)
aeb5907d 5325 {
54d343a2 5326 (*syms)[k] = (*syms)[j];
aeb5907d
JB
5327 k += 1;
5328 }
5329 return k;
5330 }
4c4b4cd2
PH
5331
5332 /* Extract the function name associated to CURRENT_BLOCK.
5333 Abort if unable to do so. */
76a01679 5334
4c4b4cd2 5335 if (current_block == NULL)
54d343a2 5336 return syms->size ();
76a01679 5337
7f0df278 5338 current_function = block_linkage_function (current_block);
4c4b4cd2 5339 if (current_function == NULL)
54d343a2 5340 return syms->size ();
4c4b4cd2
PH
5341
5342 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
5343 if (current_function_name == NULL)
54d343a2 5344 return syms->size ();
4c4b4cd2
PH
5345
5346 /* Check each of the symbols, and remove it from the list if it is
5347 a type corresponding to a renaming that is out of the scope of
5348 the current block. */
5349
5350 i = 0;
54d343a2 5351 while (i < syms->size ())
4c4b4cd2 5352 {
54d343a2 5353 if (ada_parse_renaming ((*syms)[i].symbol, NULL, NULL, NULL)
aeb5907d 5354 == ADA_OBJECT_RENAMING
54d343a2
TT
5355 && old_renaming_is_invisible ((*syms)[i].symbol,
5356 current_function_name))
5357 syms->erase (syms->begin () + i);
4c4b4cd2
PH
5358 else
5359 i += 1;
5360 }
5361
54d343a2 5362 return syms->size ();
4c4b4cd2
PH
5363}
5364
339c13b6
JB
5365/* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
5366 whose name and domain match NAME and DOMAIN respectively.
5367 If no match was found, then extend the search to "enclosing"
5368 routines (in other words, if we're inside a nested function,
5369 search the symbols defined inside the enclosing functions).
d0a8ab18
JB
5370 If WILD_MATCH_P is nonzero, perform the naming matching in
5371 "wild" mode (see function "wild_match" for more info).
339c13b6
JB
5372
5373 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
5374
5375static void
b5ec771e
PA
5376ada_add_local_symbols (struct obstack *obstackp,
5377 const lookup_name_info &lookup_name,
5378 const struct block *block, domain_enum domain)
339c13b6
JB
5379{
5380 int block_depth = 0;
5381
5382 while (block != NULL)
5383 {
5384 block_depth += 1;
b5ec771e 5385 ada_add_block_symbols (obstackp, block, lookup_name, domain, NULL);
339c13b6
JB
5386
5387 /* If we found a non-function match, assume that's the one. */
5388 if (is_nonfunction (defns_collected (obstackp, 0),
5389 num_defns_collected (obstackp)))
5390 return;
5391
5392 block = BLOCK_SUPERBLOCK (block);
5393 }
5394
5395 /* If no luck so far, try to find NAME as a local symbol in some lexically
5396 enclosing subprogram. */
5397 if (num_defns_collected (obstackp) == 0 && block_depth > 2)
b5ec771e 5398 add_symbols_from_enclosing_procs (obstackp, lookup_name, domain);
339c13b6
JB
5399}
5400
ccefe4c4 5401/* An object of this type is used as the user_data argument when
40658b94 5402 calling the map_matching_symbols method. */
ccefe4c4 5403
40658b94 5404struct match_data
ccefe4c4 5405{
40658b94 5406 struct objfile *objfile;
ccefe4c4 5407 struct obstack *obstackp;
40658b94
PH
5408 struct symbol *arg_sym;
5409 int found_sym;
ccefe4c4
TT
5410};
5411
22cee43f 5412/* A callback for add_nonlocal_symbols that adds SYM, found in BLOCK,
40658b94
PH
5413 to a list of symbols. DATA0 is a pointer to a struct match_data *
5414 containing the obstack that collects the symbol list, the file that SYM
5415 must come from, a flag indicating whether a non-argument symbol has
5416 been found in the current block, and the last argument symbol
5417 passed in SYM within the current block (if any). When SYM is null,
5418 marking the end of a block, the argument symbol is added if no
5419 other has been found. */
ccefe4c4 5420
40658b94 5421static int
582942f4
TT
5422aux_add_nonlocal_symbols (const struct block *block, struct symbol *sym,
5423 void *data0)
ccefe4c4 5424{
40658b94
PH
5425 struct match_data *data = (struct match_data *) data0;
5426
5427 if (sym == NULL)
5428 {
5429 if (!data->found_sym && data->arg_sym != NULL)
5430 add_defn_to_vec (data->obstackp,
5431 fixup_symbol_section (data->arg_sym, data->objfile),
5432 block);
5433 data->found_sym = 0;
5434 data->arg_sym = NULL;
5435 }
5436 else
5437 {
5438 if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED)
5439 return 0;
5440 else if (SYMBOL_IS_ARGUMENT (sym))
5441 data->arg_sym = sym;
5442 else
5443 {
5444 data->found_sym = 1;
5445 add_defn_to_vec (data->obstackp,
5446 fixup_symbol_section (sym, data->objfile),
5447 block);
5448 }
5449 }
5450 return 0;
5451}
5452
b5ec771e
PA
5453/* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are
5454 targeted by renamings matching LOOKUP_NAME in BLOCK. Add these
5455 symbols to OBSTACKP. Return whether we found such symbols. */
22cee43f
PMR
5456
5457static int
5458ada_add_block_renamings (struct obstack *obstackp,
5459 const struct block *block,
b5ec771e
PA
5460 const lookup_name_info &lookup_name,
5461 domain_enum domain)
22cee43f
PMR
5462{
5463 struct using_direct *renaming;
5464 int defns_mark = num_defns_collected (obstackp);
5465
b5ec771e
PA
5466 symbol_name_matcher_ftype *name_match
5467 = ada_get_symbol_name_matcher (lookup_name);
5468
22cee43f
PMR
5469 for (renaming = block_using (block);
5470 renaming != NULL;
5471 renaming = renaming->next)
5472 {
5473 const char *r_name;
22cee43f
PMR
5474
5475 /* Avoid infinite recursions: skip this renaming if we are actually
5476 already traversing it.
5477
5478 Currently, symbol lookup in Ada don't use the namespace machinery from
5479 C++/Fortran support: skip namespace imports that use them. */
5480 if (renaming->searched
5481 || (renaming->import_src != NULL
5482 && renaming->import_src[0] != '\0')
5483 || (renaming->import_dest != NULL
5484 && renaming->import_dest[0] != '\0'))
5485 continue;
5486 renaming->searched = 1;
5487
5488 /* TODO: here, we perform another name-based symbol lookup, which can
5489 pull its own multiple overloads. In theory, we should be able to do
5490 better in this case since, in DWARF, DW_AT_import is a DIE reference,
5491 not a simple name. But in order to do this, we would need to enhance
5492 the DWARF reader to associate a symbol to this renaming, instead of a
5493 name. So, for now, we do something simpler: re-use the C++/Fortran
5494 namespace machinery. */
5495 r_name = (renaming->alias != NULL
5496 ? renaming->alias
5497 : renaming->declaration);
b5ec771e
PA
5498 if (name_match (r_name, lookup_name, NULL))
5499 {
5500 lookup_name_info decl_lookup_name (renaming->declaration,
5501 lookup_name.match_type ());
5502 ada_add_all_symbols (obstackp, block, decl_lookup_name, domain,
5503 1, NULL);
5504 }
22cee43f
PMR
5505 renaming->searched = 0;
5506 }
5507 return num_defns_collected (obstackp) != defns_mark;
5508}
5509
db230ce3
JB
5510/* Implements compare_names, but only applying the comparision using
5511 the given CASING. */
5b4ee69b 5512
40658b94 5513static int
db230ce3
JB
5514compare_names_with_case (const char *string1, const char *string2,
5515 enum case_sensitivity casing)
40658b94
PH
5516{
5517 while (*string1 != '\0' && *string2 != '\0')
5518 {
db230ce3
JB
5519 char c1, c2;
5520
40658b94
PH
5521 if (isspace (*string1) || isspace (*string2))
5522 return strcmp_iw_ordered (string1, string2);
db230ce3
JB
5523
5524 if (casing == case_sensitive_off)
5525 {
5526 c1 = tolower (*string1);
5527 c2 = tolower (*string2);
5528 }
5529 else
5530 {
5531 c1 = *string1;
5532 c2 = *string2;
5533 }
5534 if (c1 != c2)
40658b94 5535 break;
db230ce3 5536
40658b94
PH
5537 string1 += 1;
5538 string2 += 1;
5539 }
db230ce3 5540
40658b94
PH
5541 switch (*string1)
5542 {
5543 case '(':
5544 return strcmp_iw_ordered (string1, string2);
5545 case '_':
5546 if (*string2 == '\0')
5547 {
052874e8 5548 if (is_name_suffix (string1))
40658b94
PH
5549 return 0;
5550 else
1a1d5513 5551 return 1;
40658b94 5552 }
dbb8534f 5553 /* FALLTHROUGH */
40658b94
PH
5554 default:
5555 if (*string2 == '(')
5556 return strcmp_iw_ordered (string1, string2);
5557 else
db230ce3
JB
5558 {
5559 if (casing == case_sensitive_off)
5560 return tolower (*string1) - tolower (*string2);
5561 else
5562 return *string1 - *string2;
5563 }
40658b94 5564 }
ccefe4c4
TT
5565}
5566
db230ce3
JB
5567/* Compare STRING1 to STRING2, with results as for strcmp.
5568 Compatible with strcmp_iw_ordered in that...
5569
5570 strcmp_iw_ordered (STRING1, STRING2) <= 0
5571
5572 ... implies...
5573
5574 compare_names (STRING1, STRING2) <= 0
5575
5576 (they may differ as to what symbols compare equal). */
5577
5578static int
5579compare_names (const char *string1, const char *string2)
5580{
5581 int result;
5582
5583 /* Similar to what strcmp_iw_ordered does, we need to perform
5584 a case-insensitive comparison first, and only resort to
5585 a second, case-sensitive, comparison if the first one was
5586 not sufficient to differentiate the two strings. */
5587
5588 result = compare_names_with_case (string1, string2, case_sensitive_off);
5589 if (result == 0)
5590 result = compare_names_with_case (string1, string2, case_sensitive_on);
5591
5592 return result;
5593}
5594
b5ec771e
PA
5595/* Convenience function to get at the Ada encoded lookup name for
5596 LOOKUP_NAME, as a C string. */
5597
5598static const char *
5599ada_lookup_name (const lookup_name_info &lookup_name)
5600{
5601 return lookup_name.ada ().lookup_name ().c_str ();
5602}
5603
339c13b6 5604/* Add to OBSTACKP all non-local symbols whose name and domain match
b5ec771e
PA
5605 LOOKUP_NAME and DOMAIN respectively. The search is performed on
5606 GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK
5607 symbols otherwise. */
339c13b6
JB
5608
5609static void
b5ec771e
PA
5610add_nonlocal_symbols (struct obstack *obstackp,
5611 const lookup_name_info &lookup_name,
5612 domain_enum domain, int global)
339c13b6 5613{
40658b94 5614 struct match_data data;
339c13b6 5615
6475f2fe 5616 memset (&data, 0, sizeof data);
ccefe4c4 5617 data.obstackp = obstackp;
339c13b6 5618
b5ec771e
PA
5619 bool is_wild_match = lookup_name.ada ().wild_match_p ();
5620
2030c079 5621 for (objfile *objfile : current_program_space->objfiles ())
40658b94
PH
5622 {
5623 data.objfile = objfile;
5624
5625 if (is_wild_match)
b5ec771e
PA
5626 objfile->sf->qf->map_matching_symbols (objfile, lookup_name.name ().c_str (),
5627 domain, global,
4186eb54 5628 aux_add_nonlocal_symbols, &data,
b5ec771e
PA
5629 symbol_name_match_type::WILD,
5630 NULL);
40658b94 5631 else
b5ec771e
PA
5632 objfile->sf->qf->map_matching_symbols (objfile, lookup_name.name ().c_str (),
5633 domain, global,
4186eb54 5634 aux_add_nonlocal_symbols, &data,
b5ec771e
PA
5635 symbol_name_match_type::FULL,
5636 compare_names);
22cee43f 5637
b669c953 5638 for (compunit_symtab *cu : objfile->compunits ())
22cee43f
PMR
5639 {
5640 const struct block *global_block
5641 = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu), GLOBAL_BLOCK);
5642
b5ec771e
PA
5643 if (ada_add_block_renamings (obstackp, global_block, lookup_name,
5644 domain))
22cee43f
PMR
5645 data.found_sym = 1;
5646 }
40658b94
PH
5647 }
5648
5649 if (num_defns_collected (obstackp) == 0 && global && !is_wild_match)
5650 {
b5ec771e
PA
5651 const char *name = ada_lookup_name (lookup_name);
5652 std::string name1 = std::string ("<_ada_") + name + '>';
5653
2030c079 5654 for (objfile *objfile : current_program_space->objfiles ())
40658b94 5655 {
40658b94 5656 data.objfile = objfile;
b5ec771e
PA
5657 objfile->sf->qf->map_matching_symbols (objfile, name1.c_str (),
5658 domain, global,
0963b4bd
MS
5659 aux_add_nonlocal_symbols,
5660 &data,
b5ec771e
PA
5661 symbol_name_match_type::FULL,
5662 compare_names);
40658b94
PH
5663 }
5664 }
339c13b6
JB
5665}
5666
b5ec771e
PA
5667/* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if
5668 FULL_SEARCH is non-zero, enclosing scope and in global scopes,
5669 returning the number of matches. Add these to OBSTACKP.
4eeaa230 5670
22cee43f
PMR
5671 When FULL_SEARCH is non-zero, any non-function/non-enumeral
5672 symbol match within the nest of blocks whose innermost member is BLOCK,
4c4b4cd2 5673 is the one match returned (no other matches in that or
d9680e73 5674 enclosing blocks is returned). If there are any matches in or
22cee43f 5675 surrounding BLOCK, then these alone are returned.
4eeaa230 5676
b5ec771e
PA
5677 Names prefixed with "standard__" are handled specially:
5678 "standard__" is first stripped off (by the lookup_name
5679 constructor), and only static and global symbols are searched.
14f9c5c9 5680
22cee43f
PMR
5681 If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had
5682 to lookup global symbols. */
5683
5684static void
5685ada_add_all_symbols (struct obstack *obstackp,
5686 const struct block *block,
b5ec771e 5687 const lookup_name_info &lookup_name,
22cee43f
PMR
5688 domain_enum domain,
5689 int full_search,
5690 int *made_global_lookup_p)
14f9c5c9
AS
5691{
5692 struct symbol *sym;
14f9c5c9 5693
22cee43f
PMR
5694 if (made_global_lookup_p)
5695 *made_global_lookup_p = 0;
339c13b6
JB
5696
5697 /* Special case: If the user specifies a symbol name inside package
5698 Standard, do a non-wild matching of the symbol name without
5699 the "standard__" prefix. This was primarily introduced in order
5700 to allow the user to specifically access the standard exceptions
5701 using, for instance, Standard.Constraint_Error when Constraint_Error
5702 is ambiguous (due to the user defining its own Constraint_Error
5703 entity inside its program). */
b5ec771e
PA
5704 if (lookup_name.ada ().standard_p ())
5705 block = NULL;
4c4b4cd2 5706
339c13b6 5707 /* Check the non-global symbols. If we have ANY match, then we're done. */
14f9c5c9 5708
4eeaa230
DE
5709 if (block != NULL)
5710 {
5711 if (full_search)
b5ec771e 5712 ada_add_local_symbols (obstackp, lookup_name, block, domain);
4eeaa230
DE
5713 else
5714 {
5715 /* In the !full_search case we're are being called by
5716 ada_iterate_over_symbols, and we don't want to search
5717 superblocks. */
b5ec771e 5718 ada_add_block_symbols (obstackp, block, lookup_name, domain, NULL);
4eeaa230 5719 }
22cee43f
PMR
5720 if (num_defns_collected (obstackp) > 0 || !full_search)
5721 return;
4eeaa230 5722 }
d2e4a39e 5723
339c13b6
JB
5724 /* No non-global symbols found. Check our cache to see if we have
5725 already performed this search before. If we have, then return
5726 the same result. */
5727
b5ec771e
PA
5728 if (lookup_cached_symbol (ada_lookup_name (lookup_name),
5729 domain, &sym, &block))
4c4b4cd2
PH
5730 {
5731 if (sym != NULL)
b5ec771e 5732 add_defn_to_vec (obstackp, sym, block);
22cee43f 5733 return;
4c4b4cd2 5734 }
14f9c5c9 5735
22cee43f
PMR
5736 if (made_global_lookup_p)
5737 *made_global_lookup_p = 1;
b1eedac9 5738
339c13b6
JB
5739 /* Search symbols from all global blocks. */
5740
b5ec771e 5741 add_nonlocal_symbols (obstackp, lookup_name, domain, 1);
d2e4a39e 5742
4c4b4cd2 5743 /* Now add symbols from all per-file blocks if we've gotten no hits
339c13b6 5744 (not strictly correct, but perhaps better than an error). */
d2e4a39e 5745
22cee43f 5746 if (num_defns_collected (obstackp) == 0)
b5ec771e 5747 add_nonlocal_symbols (obstackp, lookup_name, domain, 0);
22cee43f
PMR
5748}
5749
b5ec771e
PA
5750/* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH
5751 is non-zero, enclosing scope and in global scopes, returning the number of
22cee43f 5752 matches.
54d343a2
TT
5753 Fills *RESULTS with (SYM,BLOCK) tuples, indicating the symbols
5754 found and the blocks and symbol tables (if any) in which they were
5755 found.
22cee43f
PMR
5756
5757 When full_search is non-zero, any non-function/non-enumeral
5758 symbol match within the nest of blocks whose innermost member is BLOCK,
5759 is the one match returned (no other matches in that or
5760 enclosing blocks is returned). If there are any matches in or
5761 surrounding BLOCK, then these alone are returned.
5762
5763 Names prefixed with "standard__" are handled specially: "standard__"
5764 is first stripped off, and only static and global symbols are searched. */
5765
5766static int
b5ec771e
PA
5767ada_lookup_symbol_list_worker (const lookup_name_info &lookup_name,
5768 const struct block *block,
22cee43f 5769 domain_enum domain,
54d343a2 5770 std::vector<struct block_symbol> *results,
22cee43f
PMR
5771 int full_search)
5772{
22cee43f
PMR
5773 int syms_from_global_search;
5774 int ndefns;
ec6a20c2 5775 auto_obstack obstack;
22cee43f 5776
ec6a20c2 5777 ada_add_all_symbols (&obstack, block, lookup_name,
b5ec771e 5778 domain, full_search, &syms_from_global_search);
14f9c5c9 5779
ec6a20c2
JB
5780 ndefns = num_defns_collected (&obstack);
5781
54d343a2
TT
5782 struct block_symbol *base = defns_collected (&obstack, 1);
5783 for (int i = 0; i < ndefns; ++i)
5784 results->push_back (base[i]);
4c4b4cd2 5785
54d343a2 5786 ndefns = remove_extra_symbols (results);
4c4b4cd2 5787
b1eedac9 5788 if (ndefns == 0 && full_search && syms_from_global_search)
b5ec771e 5789 cache_symbol (ada_lookup_name (lookup_name), domain, NULL, NULL);
14f9c5c9 5790
b1eedac9 5791 if (ndefns == 1 && full_search && syms_from_global_search)
b5ec771e
PA
5792 cache_symbol (ada_lookup_name (lookup_name), domain,
5793 (*results)[0].symbol, (*results)[0].block);
14f9c5c9 5794
54d343a2 5795 ndefns = remove_irrelevant_renamings (results, block);
ec6a20c2 5796
14f9c5c9
AS
5797 return ndefns;
5798}
5799
b5ec771e 5800/* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and
54d343a2
TT
5801 in global scopes, returning the number of matches, and filling *RESULTS
5802 with (SYM,BLOCK) tuples.
ec6a20c2 5803
4eeaa230
DE
5804 See ada_lookup_symbol_list_worker for further details. */
5805
5806int
b5ec771e 5807ada_lookup_symbol_list (const char *name, const struct block *block,
54d343a2
TT
5808 domain_enum domain,
5809 std::vector<struct block_symbol> *results)
4eeaa230 5810{
b5ec771e
PA
5811 symbol_name_match_type name_match_type = name_match_type_from_name (name);
5812 lookup_name_info lookup_name (name, name_match_type);
5813
5814 return ada_lookup_symbol_list_worker (lookup_name, block, domain, results, 1);
4eeaa230
DE
5815}
5816
5817/* Implementation of the la_iterate_over_symbols method. */
5818
5819static void
14bc53a8 5820ada_iterate_over_symbols
b5ec771e
PA
5821 (const struct block *block, const lookup_name_info &name,
5822 domain_enum domain,
14bc53a8 5823 gdb::function_view<symbol_found_callback_ftype> callback)
4eeaa230
DE
5824{
5825 int ndefs, i;
54d343a2 5826 std::vector<struct block_symbol> results;
4eeaa230
DE
5827
5828 ndefs = ada_lookup_symbol_list_worker (name, block, domain, &results, 0);
ec6a20c2 5829
4eeaa230
DE
5830 for (i = 0; i < ndefs; ++i)
5831 {
7e41c8db 5832 if (!callback (&results[i]))
4eeaa230
DE
5833 break;
5834 }
5835}
5836
4e5c77fe
JB
5837/* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5838 to 1, but choosing the first symbol found if there are multiple
5839 choices.
5840
5e2336be
JB
5841 The result is stored in *INFO, which must be non-NULL.
5842 If no match is found, INFO->SYM is set to NULL. */
4e5c77fe
JB
5843
5844void
5845ada_lookup_encoded_symbol (const char *name, const struct block *block,
fe978cb0 5846 domain_enum domain,
d12307c1 5847 struct block_symbol *info)
14f9c5c9 5848{
b5ec771e
PA
5849 /* Since we already have an encoded name, wrap it in '<>' to force a
5850 verbatim match. Otherwise, if the name happens to not look like
5851 an encoded name (because it doesn't include a "__"),
5852 ada_lookup_name_info would re-encode/fold it again, and that
5853 would e.g., incorrectly lowercase object renaming names like
5854 "R28b" -> "r28b". */
5855 std::string verbatim = std::string ("<") + name + '>';
5856
5e2336be 5857 gdb_assert (info != NULL);
f98fc17b 5858 *info = ada_lookup_symbol (verbatim.c_str (), block, domain, NULL);
4e5c77fe 5859}
aeb5907d
JB
5860
5861/* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5862 scope and in global scopes, or NULL if none. NAME is folded and
5863 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
0963b4bd 5864 choosing the first symbol if there are multiple choices.
4e5c77fe
JB
5865 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5866
d12307c1 5867struct block_symbol
aeb5907d 5868ada_lookup_symbol (const char *name, const struct block *block0,
fe978cb0 5869 domain_enum domain, int *is_a_field_of_this)
aeb5907d
JB
5870{
5871 if (is_a_field_of_this != NULL)
5872 *is_a_field_of_this = 0;
5873
54d343a2 5874 std::vector<struct block_symbol> candidates;
f98fc17b 5875 int n_candidates;
f98fc17b
PA
5876
5877 n_candidates = ada_lookup_symbol_list (name, block0, domain, &candidates);
f98fc17b
PA
5878
5879 if (n_candidates == 0)
54d343a2 5880 return {};
f98fc17b
PA
5881
5882 block_symbol info = candidates[0];
5883 info.symbol = fixup_symbol_section (info.symbol, NULL);
d12307c1 5884 return info;
4c4b4cd2 5885}
14f9c5c9 5886
d12307c1 5887static struct block_symbol
f606139a
DE
5888ada_lookup_symbol_nonlocal (const struct language_defn *langdef,
5889 const char *name,
76a01679 5890 const struct block *block,
21b556f4 5891 const domain_enum domain)
4c4b4cd2 5892{
d12307c1 5893 struct block_symbol sym;
04dccad0
JB
5894
5895 sym = ada_lookup_symbol (name, block_static_block (block), domain, NULL);
d12307c1 5896 if (sym.symbol != NULL)
04dccad0
JB
5897 return sym;
5898
5899 /* If we haven't found a match at this point, try the primitive
5900 types. In other languages, this search is performed before
5901 searching for global symbols in order to short-circuit that
5902 global-symbol search if it happens that the name corresponds
5903 to a primitive type. But we cannot do the same in Ada, because
5904 it is perfectly legitimate for a program to declare a type which
5905 has the same name as a standard type. If looking up a type in
5906 that situation, we have traditionally ignored the primitive type
5907 in favor of user-defined types. This is why, unlike most other
5908 languages, we search the primitive types this late and only after
5909 having searched the global symbols without success. */
5910
5911 if (domain == VAR_DOMAIN)
5912 {
5913 struct gdbarch *gdbarch;
5914
5915 if (block == NULL)
5916 gdbarch = target_gdbarch ();
5917 else
5918 gdbarch = block_gdbarch (block);
d12307c1
PMR
5919 sym.symbol = language_lookup_primitive_type_as_symbol (langdef, gdbarch, name);
5920 if (sym.symbol != NULL)
04dccad0
JB
5921 return sym;
5922 }
5923
6640a367 5924 return {};
14f9c5c9
AS
5925}
5926
5927
4c4b4cd2
PH
5928/* True iff STR is a possible encoded suffix of a normal Ada name
5929 that is to be ignored for matching purposes. Suffixes of parallel
5930 names (e.g., XVE) are not included here. Currently, the possible suffixes
5823c3ef 5931 are given by any of the regular expressions:
4c4b4cd2 5932
babe1480
JB
5933 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5934 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
9ac7f98e 5935 TKB [subprogram suffix for task bodies]
babe1480 5936 _E[0-9]+[bs]$ [protected object entry suffixes]
61ee279c 5937 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
babe1480
JB
5938
5939 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5940 match is performed. This sequence is used to differentiate homonyms,
5941 is an optional part of a valid name suffix. */
4c4b4cd2 5942
14f9c5c9 5943static int
d2e4a39e 5944is_name_suffix (const char *str)
14f9c5c9
AS
5945{
5946 int k;
4c4b4cd2
PH
5947 const char *matching;
5948 const int len = strlen (str);
5949
babe1480
JB
5950 /* Skip optional leading __[0-9]+. */
5951
4c4b4cd2
PH
5952 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
5953 {
babe1480
JB
5954 str += 3;
5955 while (isdigit (str[0]))
5956 str += 1;
4c4b4cd2 5957 }
babe1480
JB
5958
5959 /* [.$][0-9]+ */
4c4b4cd2 5960
babe1480 5961 if (str[0] == '.' || str[0] == '$')
4c4b4cd2 5962 {
babe1480 5963 matching = str + 1;
4c4b4cd2
PH
5964 while (isdigit (matching[0]))
5965 matching += 1;
5966 if (matching[0] == '\0')
5967 return 1;
5968 }
5969
5970 /* ___[0-9]+ */
babe1480 5971
4c4b4cd2
PH
5972 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
5973 {
5974 matching = str + 3;
5975 while (isdigit (matching[0]))
5976 matching += 1;
5977 if (matching[0] == '\0')
5978 return 1;
5979 }
5980
9ac7f98e
JB
5981 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5982
5983 if (strcmp (str, "TKB") == 0)
5984 return 1;
5985
529cad9c
PH
5986#if 0
5987 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
0963b4bd
MS
5988 with a N at the end. Unfortunately, the compiler uses the same
5989 convention for other internal types it creates. So treating
529cad9c 5990 all entity names that end with an "N" as a name suffix causes
0963b4bd
MS
5991 some regressions. For instance, consider the case of an enumerated
5992 type. To support the 'Image attribute, it creates an array whose
529cad9c
PH
5993 name ends with N.
5994 Having a single character like this as a suffix carrying some
0963b4bd 5995 information is a bit risky. Perhaps we should change the encoding
529cad9c
PH
5996 to be something like "_N" instead. In the meantime, do not do
5997 the following check. */
5998 /* Protected Object Subprograms */
5999 if (len == 1 && str [0] == 'N')
6000 return 1;
6001#endif
6002
6003 /* _E[0-9]+[bs]$ */
6004 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
6005 {
6006 matching = str + 3;
6007 while (isdigit (matching[0]))
6008 matching += 1;
6009 if ((matching[0] == 'b' || matching[0] == 's')
6010 && matching [1] == '\0')
6011 return 1;
6012 }
6013
4c4b4cd2
PH
6014 /* ??? We should not modify STR directly, as we are doing below. This
6015 is fine in this case, but may become problematic later if we find
6016 that this alternative did not work, and want to try matching
6017 another one from the begining of STR. Since we modified it, we
6018 won't be able to find the begining of the string anymore! */
14f9c5c9
AS
6019 if (str[0] == 'X')
6020 {
6021 str += 1;
d2e4a39e 6022 while (str[0] != '_' && str[0] != '\0')
4c4b4cd2
PH
6023 {
6024 if (str[0] != 'n' && str[0] != 'b')
6025 return 0;
6026 str += 1;
6027 }
14f9c5c9 6028 }
babe1480 6029
14f9c5c9
AS
6030 if (str[0] == '\000')
6031 return 1;
babe1480 6032
d2e4a39e 6033 if (str[0] == '_')
14f9c5c9
AS
6034 {
6035 if (str[1] != '_' || str[2] == '\000')
4c4b4cd2 6036 return 0;
d2e4a39e 6037 if (str[2] == '_')
4c4b4cd2 6038 {
61ee279c
PH
6039 if (strcmp (str + 3, "JM") == 0)
6040 return 1;
6041 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
6042 the LJM suffix in favor of the JM one. But we will
6043 still accept LJM as a valid suffix for a reasonable
6044 amount of time, just to allow ourselves to debug programs
6045 compiled using an older version of GNAT. */
4c4b4cd2
PH
6046 if (strcmp (str + 3, "LJM") == 0)
6047 return 1;
6048 if (str[3] != 'X')
6049 return 0;
1265e4aa
JB
6050 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
6051 || str[4] == 'U' || str[4] == 'P')
4c4b4cd2
PH
6052 return 1;
6053 if (str[4] == 'R' && str[5] != 'T')
6054 return 1;
6055 return 0;
6056 }
6057 if (!isdigit (str[2]))
6058 return 0;
6059 for (k = 3; str[k] != '\0'; k += 1)
6060 if (!isdigit (str[k]) && str[k] != '_')
6061 return 0;
14f9c5c9
AS
6062 return 1;
6063 }
4c4b4cd2 6064 if (str[0] == '$' && isdigit (str[1]))
14f9c5c9 6065 {
4c4b4cd2
PH
6066 for (k = 2; str[k] != '\0'; k += 1)
6067 if (!isdigit (str[k]) && str[k] != '_')
6068 return 0;
14f9c5c9
AS
6069 return 1;
6070 }
6071 return 0;
6072}
d2e4a39e 6073
aeb5907d
JB
6074/* Return non-zero if the string starting at NAME and ending before
6075 NAME_END contains no capital letters. */
529cad9c
PH
6076
6077static int
6078is_valid_name_for_wild_match (const char *name0)
6079{
6080 const char *decoded_name = ada_decode (name0);
6081 int i;
6082
5823c3ef
JB
6083 /* If the decoded name starts with an angle bracket, it means that
6084 NAME0 does not follow the GNAT encoding format. It should then
6085 not be allowed as a possible wild match. */
6086 if (decoded_name[0] == '<')
6087 return 0;
6088
529cad9c
PH
6089 for (i=0; decoded_name[i] != '\0'; i++)
6090 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
6091 return 0;
6092
6093 return 1;
6094}
6095
73589123
PH
6096/* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
6097 that could start a simple name. Assumes that *NAMEP points into
6098 the string beginning at NAME0. */
4c4b4cd2 6099
14f9c5c9 6100static int
73589123 6101advance_wild_match (const char **namep, const char *name0, int target0)
14f9c5c9 6102{
73589123 6103 const char *name = *namep;
5b4ee69b 6104
5823c3ef 6105 while (1)
14f9c5c9 6106 {
aa27d0b3 6107 int t0, t1;
73589123
PH
6108
6109 t0 = *name;
6110 if (t0 == '_')
6111 {
6112 t1 = name[1];
6113 if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9'))
6114 {
6115 name += 1;
61012eef 6116 if (name == name0 + 5 && startswith (name0, "_ada"))
73589123
PH
6117 break;
6118 else
6119 name += 1;
6120 }
aa27d0b3
JB
6121 else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z')
6122 || name[2] == target0))
73589123
PH
6123 {
6124 name += 2;
6125 break;
6126 }
6127 else
6128 return 0;
6129 }
6130 else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9'))
6131 name += 1;
6132 else
5823c3ef 6133 return 0;
73589123
PH
6134 }
6135
6136 *namep = name;
6137 return 1;
6138}
6139
b5ec771e
PA
6140/* Return true iff NAME encodes a name of the form prefix.PATN.
6141 Ignores any informational suffixes of NAME (i.e., for which
6142 is_name_suffix is true). Assumes that PATN is a lower-cased Ada
6143 simple name. */
73589123 6144
b5ec771e 6145static bool
73589123
PH
6146wild_match (const char *name, const char *patn)
6147{
22e048c9 6148 const char *p;
73589123
PH
6149 const char *name0 = name;
6150
6151 while (1)
6152 {
6153 const char *match = name;
6154
6155 if (*name == *patn)
6156 {
6157 for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1)
6158 if (*p != *name)
6159 break;
6160 if (*p == '\0' && is_name_suffix (name))
b5ec771e 6161 return match == name0 || is_valid_name_for_wild_match (name0);
73589123
PH
6162
6163 if (name[-1] == '_')
6164 name -= 1;
6165 }
6166 if (!advance_wild_match (&name, name0, *patn))
b5ec771e 6167 return false;
96d887e8 6168 }
96d887e8
PH
6169}
6170
b5ec771e
PA
6171/* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring
6172 any trailing suffixes that encode debugging information or leading
6173 _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging
6174 information that is ignored). */
40658b94 6175
b5ec771e 6176static bool
c4d840bd
PH
6177full_match (const char *sym_name, const char *search_name)
6178{
b5ec771e
PA
6179 size_t search_name_len = strlen (search_name);
6180
6181 if (strncmp (sym_name, search_name, search_name_len) == 0
6182 && is_name_suffix (sym_name + search_name_len))
6183 return true;
6184
6185 if (startswith (sym_name, "_ada_")
6186 && strncmp (sym_name + 5, search_name, search_name_len) == 0
6187 && is_name_suffix (sym_name + search_name_len + 5))
6188 return true;
c4d840bd 6189
b5ec771e
PA
6190 return false;
6191}
c4d840bd 6192
b5ec771e
PA
6193/* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector
6194 *defn_symbols, updating the list of symbols in OBSTACKP (if
6195 necessary). OBJFILE is the section containing BLOCK. */
96d887e8
PH
6196
6197static void
6198ada_add_block_symbols (struct obstack *obstackp,
b5ec771e
PA
6199 const struct block *block,
6200 const lookup_name_info &lookup_name,
6201 domain_enum domain, struct objfile *objfile)
96d887e8 6202{
8157b174 6203 struct block_iterator iter;
96d887e8
PH
6204 /* A matching argument symbol, if any. */
6205 struct symbol *arg_sym;
6206 /* Set true when we find a matching non-argument symbol. */
6207 int found_sym;
6208 struct symbol *sym;
6209
6210 arg_sym = NULL;
6211 found_sym = 0;
b5ec771e
PA
6212 for (sym = block_iter_match_first (block, lookup_name, &iter);
6213 sym != NULL;
6214 sym = block_iter_match_next (lookup_name, &iter))
96d887e8 6215 {
b5ec771e
PA
6216 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
6217 SYMBOL_DOMAIN (sym), domain))
6218 {
6219 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
6220 {
6221 if (SYMBOL_IS_ARGUMENT (sym))
6222 arg_sym = sym;
6223 else
6224 {
6225 found_sym = 1;
6226 add_defn_to_vec (obstackp,
6227 fixup_symbol_section (sym, objfile),
6228 block);
6229 }
6230 }
6231 }
96d887e8
PH
6232 }
6233
22cee43f
PMR
6234 /* Handle renamings. */
6235
b5ec771e 6236 if (ada_add_block_renamings (obstackp, block, lookup_name, domain))
22cee43f
PMR
6237 found_sym = 1;
6238
96d887e8
PH
6239 if (!found_sym && arg_sym != NULL)
6240 {
76a01679
JB
6241 add_defn_to_vec (obstackp,
6242 fixup_symbol_section (arg_sym, objfile),
2570f2b7 6243 block);
96d887e8
PH
6244 }
6245
b5ec771e 6246 if (!lookup_name.ada ().wild_match_p ())
96d887e8
PH
6247 {
6248 arg_sym = NULL;
6249 found_sym = 0;
b5ec771e
PA
6250 const std::string &ada_lookup_name = lookup_name.ada ().lookup_name ();
6251 const char *name = ada_lookup_name.c_str ();
6252 size_t name_len = ada_lookup_name.size ();
96d887e8
PH
6253
6254 ALL_BLOCK_SYMBOLS (block, iter, sym)
76a01679 6255 {
4186eb54
KS
6256 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym),
6257 SYMBOL_DOMAIN (sym), domain))
76a01679
JB
6258 {
6259 int cmp;
6260
6261 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
6262 if (cmp == 0)
6263 {
61012eef 6264 cmp = !startswith (SYMBOL_LINKAGE_NAME (sym), "_ada_");
76a01679
JB
6265 if (cmp == 0)
6266 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
6267 name_len);
6268 }
6269
6270 if (cmp == 0
6271 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
6272 {
2a2d4dc3
AS
6273 if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED)
6274 {
6275 if (SYMBOL_IS_ARGUMENT (sym))
6276 arg_sym = sym;
6277 else
6278 {
6279 found_sym = 1;
6280 add_defn_to_vec (obstackp,
6281 fixup_symbol_section (sym, objfile),
6282 block);
6283 }
6284 }
76a01679
JB
6285 }
6286 }
76a01679 6287 }
96d887e8
PH
6288
6289 /* NOTE: This really shouldn't be needed for _ada_ symbols.
6290 They aren't parameters, right? */
6291 if (!found_sym && arg_sym != NULL)
6292 {
6293 add_defn_to_vec (obstackp,
76a01679 6294 fixup_symbol_section (arg_sym, objfile),
2570f2b7 6295 block);
96d887e8
PH
6296 }
6297 }
6298}
6299\f
41d27058
JB
6300
6301 /* Symbol Completion */
6302
b5ec771e 6303/* See symtab.h. */
41d27058 6304
b5ec771e
PA
6305bool
6306ada_lookup_name_info::matches
6307 (const char *sym_name,
6308 symbol_name_match_type match_type,
a207cff2 6309 completion_match_result *comp_match_res) const
41d27058 6310{
b5ec771e
PA
6311 bool match = false;
6312 const char *text = m_encoded_name.c_str ();
6313 size_t text_len = m_encoded_name.size ();
41d27058
JB
6314
6315 /* First, test against the fully qualified name of the symbol. */
6316
6317 if (strncmp (sym_name, text, text_len) == 0)
b5ec771e 6318 match = true;
41d27058 6319
b5ec771e 6320 if (match && !m_encoded_p)
41d27058
JB
6321 {
6322 /* One needed check before declaring a positive match is to verify
6323 that iff we are doing a verbatim match, the decoded version
6324 of the symbol name starts with '<'. Otherwise, this symbol name
6325 is not a suitable completion. */
6326 const char *sym_name_copy = sym_name;
b5ec771e 6327 bool has_angle_bracket;
41d27058
JB
6328
6329 sym_name = ada_decode (sym_name);
6330 has_angle_bracket = (sym_name[0] == '<');
b5ec771e 6331 match = (has_angle_bracket == m_verbatim_p);
41d27058
JB
6332 sym_name = sym_name_copy;
6333 }
6334
b5ec771e 6335 if (match && !m_verbatim_p)
41d27058
JB
6336 {
6337 /* When doing non-verbatim match, another check that needs to
6338 be done is to verify that the potentially matching symbol name
6339 does not include capital letters, because the ada-mode would
6340 not be able to understand these symbol names without the
6341 angle bracket notation. */
6342 const char *tmp;
6343
6344 for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
6345 if (*tmp != '\0')
b5ec771e 6346 match = false;
41d27058
JB
6347 }
6348
6349 /* Second: Try wild matching... */
6350
b5ec771e 6351 if (!match && m_wild_match_p)
41d27058
JB
6352 {
6353 /* Since we are doing wild matching, this means that TEXT
6354 may represent an unqualified symbol name. We therefore must
6355 also compare TEXT against the unqualified name of the symbol. */
6356 sym_name = ada_unqualified_name (ada_decode (sym_name));
6357
6358 if (strncmp (sym_name, text, text_len) == 0)
b5ec771e 6359 match = true;
41d27058
JB
6360 }
6361
b5ec771e 6362 /* Finally: If we found a match, prepare the result to return. */
41d27058
JB
6363
6364 if (!match)
b5ec771e 6365 return false;
41d27058 6366
a207cff2 6367 if (comp_match_res != NULL)
b5ec771e 6368 {
a207cff2 6369 std::string &match_str = comp_match_res->match.storage ();
41d27058 6370
b5ec771e 6371 if (!m_encoded_p)
a207cff2 6372 match_str = ada_decode (sym_name);
b5ec771e
PA
6373 else
6374 {
6375 if (m_verbatim_p)
6376 match_str = add_angle_brackets (sym_name);
6377 else
6378 match_str = sym_name;
41d27058 6379
b5ec771e 6380 }
a207cff2
PA
6381
6382 comp_match_res->set_match (match_str.c_str ());
41d27058
JB
6383 }
6384
b5ec771e 6385 return true;
41d27058
JB
6386}
6387
b5ec771e 6388/* Add the list of possible symbol names completing TEXT to TRACKER.
eb3ff9a5 6389 WORD is the entire command on which completion is made. */
41d27058 6390
eb3ff9a5
PA
6391static void
6392ada_collect_symbol_completion_matches (completion_tracker &tracker,
c6756f62 6393 complete_symbol_mode mode,
b5ec771e
PA
6394 symbol_name_match_type name_match_type,
6395 const char *text, const char *word,
eb3ff9a5 6396 enum type_code code)
41d27058 6397{
41d27058 6398 struct symbol *sym;
3977b71f 6399 const struct block *b, *surrounding_static_block = 0;
8157b174 6400 struct block_iterator iter;
41d27058 6401
2f68a895
TT
6402 gdb_assert (code == TYPE_CODE_UNDEF);
6403
1b026119 6404 lookup_name_info lookup_name (text, name_match_type, true);
41d27058
JB
6405
6406 /* First, look at the partial symtab symbols. */
14bc53a8 6407 expand_symtabs_matching (NULL,
b5ec771e
PA
6408 lookup_name,
6409 NULL,
14bc53a8
PA
6410 NULL,
6411 ALL_DOMAIN);
41d27058
JB
6412
6413 /* At this point scan through the misc symbol vectors and add each
6414 symbol you find to the list. Eventually we want to ignore
6415 anything that isn't a text symbol (everything else will be
6416 handled by the psymtab code above). */
6417
2030c079 6418 for (objfile *objfile : current_program_space->objfiles ())
5325b9bf 6419 {
7932255d 6420 for (minimal_symbol *msymbol : objfile->msymbols ())
5325b9bf
TT
6421 {
6422 QUIT;
6423
6424 if (completion_skip_symbol (mode, msymbol))
6425 continue;
6426
6427 language symbol_language = MSYMBOL_LANGUAGE (msymbol);
6428
6429 /* Ada minimal symbols won't have their language set to Ada. If
6430 we let completion_list_add_name compare using the
6431 default/C-like matcher, then when completing e.g., symbols in a
6432 package named "pck", we'd match internal Ada symbols like
6433 "pckS", which are invalid in an Ada expression, unless you wrap
6434 them in '<' '>' to request a verbatim match.
6435
6436 Unfortunately, some Ada encoded names successfully demangle as
6437 C++ symbols (using an old mangling scheme), such as "name__2Xn"
6438 -> "Xn::name(void)" and thus some Ada minimal symbols end up
6439 with the wrong language set. Paper over that issue here. */
6440 if (symbol_language == language_auto
6441 || symbol_language == language_cplus)
6442 symbol_language = language_ada;
6443
6444 completion_list_add_name (tracker,
6445 symbol_language,
6446 MSYMBOL_LINKAGE_NAME (msymbol),
6447 lookup_name, text, word);
6448 }
6449 }
41d27058
JB
6450
6451 /* Search upwards from currently selected frame (so that we can
6452 complete on local vars. */
6453
6454 for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
6455 {
6456 if (!BLOCK_SUPERBLOCK (b))
6457 surrounding_static_block = b; /* For elmin of dups */
6458
6459 ALL_BLOCK_SYMBOLS (b, iter, sym)
6460 {
f9d67a22
PA
6461 if (completion_skip_symbol (mode, sym))
6462 continue;
6463
b5ec771e
PA
6464 completion_list_add_name (tracker,
6465 SYMBOL_LANGUAGE (sym),
6466 SYMBOL_LINKAGE_NAME (sym),
1b026119 6467 lookup_name, text, word);
41d27058
JB
6468 }
6469 }
6470
6471 /* Go through the symtabs and check the externs and statics for
43f3e411 6472 symbols which match. */
41d27058 6473
2030c079 6474 for (objfile *objfile : current_program_space->objfiles ())
41d27058 6475 {
b669c953 6476 for (compunit_symtab *s : objfile->compunits ())
d8aeb77f
TT
6477 {
6478 QUIT;
6479 b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), GLOBAL_BLOCK);
6480 ALL_BLOCK_SYMBOLS (b, iter, sym)
6481 {
6482 if (completion_skip_symbol (mode, sym))
6483 continue;
f9d67a22 6484
d8aeb77f
TT
6485 completion_list_add_name (tracker,
6486 SYMBOL_LANGUAGE (sym),
6487 SYMBOL_LINKAGE_NAME (sym),
6488 lookup_name, text, word);
6489 }
6490 }
41d27058 6491 }
41d27058 6492
2030c079 6493 for (objfile *objfile : current_program_space->objfiles ())
d8aeb77f 6494 {
b669c953 6495 for (compunit_symtab *s : objfile->compunits ())
d8aeb77f
TT
6496 {
6497 QUIT;
6498 b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), STATIC_BLOCK);
6499 /* Don't do this block twice. */
6500 if (b == surrounding_static_block)
6501 continue;
6502 ALL_BLOCK_SYMBOLS (b, iter, sym)
6503 {
6504 if (completion_skip_symbol (mode, sym))
6505 continue;
f9d67a22 6506
d8aeb77f
TT
6507 completion_list_add_name (tracker,
6508 SYMBOL_LANGUAGE (sym),
6509 SYMBOL_LINKAGE_NAME (sym),
6510 lookup_name, text, word);
6511 }
6512 }
41d27058 6513 }
41d27058
JB
6514}
6515
963a6417 6516 /* Field Access */
96d887e8 6517
73fb9985
JB
6518/* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
6519 for tagged types. */
6520
6521static int
6522ada_is_dispatch_table_ptr_type (struct type *type)
6523{
0d5cff50 6524 const char *name;
73fb9985
JB
6525
6526 if (TYPE_CODE (type) != TYPE_CODE_PTR)
6527 return 0;
6528
6529 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
6530 if (name == NULL)
6531 return 0;
6532
6533 return (strcmp (name, "ada__tags__dispatch_table") == 0);
6534}
6535
ac4a2da4
JG
6536/* Return non-zero if TYPE is an interface tag. */
6537
6538static int
6539ada_is_interface_tag (struct type *type)
6540{
6541 const char *name = TYPE_NAME (type);
6542
6543 if (name == NULL)
6544 return 0;
6545
6546 return (strcmp (name, "ada__tags__interface_tag") == 0);
6547}
6548
963a6417
PH
6549/* True if field number FIELD_NUM in struct or union type TYPE is supposed
6550 to be invisible to users. */
96d887e8 6551
963a6417
PH
6552int
6553ada_is_ignored_field (struct type *type, int field_num)
96d887e8 6554{
963a6417
PH
6555 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
6556 return 1;
ffde82bf 6557
73fb9985
JB
6558 /* Check the name of that field. */
6559 {
6560 const char *name = TYPE_FIELD_NAME (type, field_num);
6561
6562 /* Anonymous field names should not be printed.
6563 brobecker/2007-02-20: I don't think this can actually happen
6564 but we don't want to print the value of annonymous fields anyway. */
6565 if (name == NULL)
6566 return 1;
6567
ffde82bf
JB
6568 /* Normally, fields whose name start with an underscore ("_")
6569 are fields that have been internally generated by the compiler,
6570 and thus should not be printed. The "_parent" field is special,
6571 however: This is a field internally generated by the compiler
6572 for tagged types, and it contains the components inherited from
6573 the parent type. This field should not be printed as is, but
6574 should not be ignored either. */
61012eef 6575 if (name[0] == '_' && !startswith (name, "_parent"))
73fb9985
JB
6576 return 1;
6577 }
6578
ac4a2da4
JG
6579 /* If this is the dispatch table of a tagged type or an interface tag,
6580 then ignore. */
73fb9985 6581 if (ada_is_tagged_type (type, 1)
ac4a2da4
JG
6582 && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num))
6583 || ada_is_interface_tag (TYPE_FIELD_TYPE (type, field_num))))
73fb9985
JB
6584 return 1;
6585
6586 /* Not a special field, so it should not be ignored. */
6587 return 0;
963a6417 6588}
96d887e8 6589
963a6417 6590/* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
0963b4bd 6591 pointer or reference type whose ultimate target has a tag field. */
96d887e8 6592
963a6417
PH
6593int
6594ada_is_tagged_type (struct type *type, int refok)
6595{
988f6b3d 6596 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1) != NULL);
963a6417 6597}
96d887e8 6598
963a6417 6599/* True iff TYPE represents the type of X'Tag */
96d887e8 6600
963a6417
PH
6601int
6602ada_is_tag_type (struct type *type)
6603{
460efde1
JB
6604 type = ada_check_typedef (type);
6605
963a6417
PH
6606 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
6607 return 0;
6608 else
96d887e8 6609 {
963a6417 6610 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
5b4ee69b 6611
963a6417
PH
6612 return (name != NULL
6613 && strcmp (name, "ada__tags__dispatch_table") == 0);
96d887e8 6614 }
96d887e8
PH
6615}
6616
963a6417 6617/* The type of the tag on VAL. */
76a01679 6618
963a6417
PH
6619struct type *
6620ada_tag_type (struct value *val)
96d887e8 6621{
988f6b3d 6622 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0);
963a6417 6623}
96d887e8 6624
b50d69b5
JG
6625/* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95,
6626 retired at Ada 05). */
6627
6628static int
6629is_ada95_tag (struct value *tag)
6630{
6631 return ada_value_struct_elt (tag, "tsd", 1) != NULL;
6632}
6633
963a6417 6634/* The value of the tag on VAL. */
96d887e8 6635
963a6417
PH
6636struct value *
6637ada_value_tag (struct value *val)
6638{
03ee6b2e 6639 return ada_value_struct_elt (val, "_tag", 0);
96d887e8
PH
6640}
6641
963a6417
PH
6642/* The value of the tag on the object of type TYPE whose contents are
6643 saved at VALADDR, if it is non-null, or is at memory address
0963b4bd 6644 ADDRESS. */
96d887e8 6645
963a6417 6646static struct value *
10a2c479 6647value_tag_from_contents_and_address (struct type *type,
fc1a4b47 6648 const gdb_byte *valaddr,
963a6417 6649 CORE_ADDR address)
96d887e8 6650{
b5385fc0 6651 int tag_byte_offset;
963a6417 6652 struct type *tag_type;
5b4ee69b 6653
963a6417 6654 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
52ce6436 6655 NULL, NULL, NULL))
96d887e8 6656 {
fc1a4b47 6657 const gdb_byte *valaddr1 = ((valaddr == NULL)
10a2c479
AC
6658 ? NULL
6659 : valaddr + tag_byte_offset);
963a6417 6660 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
96d887e8 6661
963a6417 6662 return value_from_contents_and_address (tag_type, valaddr1, address1);
96d887e8 6663 }
963a6417
PH
6664 return NULL;
6665}
96d887e8 6666
963a6417
PH
6667static struct type *
6668type_from_tag (struct value *tag)
6669{
6670 const char *type_name = ada_tag_name (tag);
5b4ee69b 6671
963a6417
PH
6672 if (type_name != NULL)
6673 return ada_find_any_type (ada_encode (type_name));
6674 return NULL;
6675}
96d887e8 6676
b50d69b5
JG
6677/* Given a value OBJ of a tagged type, return a value of this
6678 type at the base address of the object. The base address, as
6679 defined in Ada.Tags, it is the address of the primary tag of
6680 the object, and therefore where the field values of its full
6681 view can be fetched. */
6682
6683struct value *
6684ada_tag_value_at_base_address (struct value *obj)
6685{
b50d69b5
JG
6686 struct value *val;
6687 LONGEST offset_to_top = 0;
6688 struct type *ptr_type, *obj_type;
6689 struct value *tag;
6690 CORE_ADDR base_address;
6691
6692 obj_type = value_type (obj);
6693
6694 /* It is the responsability of the caller to deref pointers. */
6695
6696 if (TYPE_CODE (obj_type) == TYPE_CODE_PTR
6697 || TYPE_CODE (obj_type) == TYPE_CODE_REF)
6698 return obj;
6699
6700 tag = ada_value_tag (obj);
6701 if (!tag)
6702 return obj;
6703
6704 /* Base addresses only appeared with Ada 05 and multiple inheritance. */
6705
6706 if (is_ada95_tag (tag))
6707 return obj;
6708
08f49010
XR
6709 ptr_type = language_lookup_primitive_type
6710 (language_def (language_ada), target_gdbarch(), "storage_offset");
b50d69b5
JG
6711 ptr_type = lookup_pointer_type (ptr_type);
6712 val = value_cast (ptr_type, tag);
6713 if (!val)
6714 return obj;
6715
6716 /* It is perfectly possible that an exception be raised while
6717 trying to determine the base address, just like for the tag;
6718 see ada_tag_name for more details. We do not print the error
6719 message for the same reason. */
6720
492d29ea 6721 TRY
b50d69b5
JG
6722 {
6723 offset_to_top = value_as_long (value_ind (value_ptradd (val, -2)));
6724 }
6725
492d29ea
PA
6726 CATCH (e, RETURN_MASK_ERROR)
6727 {
6728 return obj;
6729 }
6730 END_CATCH
b50d69b5
JG
6731
6732 /* If offset is null, nothing to do. */
6733
6734 if (offset_to_top == 0)
6735 return obj;
6736
6737 /* -1 is a special case in Ada.Tags; however, what should be done
6738 is not quite clear from the documentation. So do nothing for
6739 now. */
6740
6741 if (offset_to_top == -1)
6742 return obj;
6743
08f49010
XR
6744 /* OFFSET_TO_TOP used to be a positive value to be subtracted
6745 from the base address. This was however incompatible with
6746 C++ dispatch table: C++ uses a *negative* value to *add*
6747 to the base address. Ada's convention has therefore been
6748 changed in GNAT 19.0w 20171023: since then, C++ and Ada
6749 use the same convention. Here, we support both cases by
6750 checking the sign of OFFSET_TO_TOP. */
6751
6752 if (offset_to_top > 0)
6753 offset_to_top = -offset_to_top;
6754
6755 base_address = value_address (obj) + offset_to_top;
b50d69b5
JG
6756 tag = value_tag_from_contents_and_address (obj_type, NULL, base_address);
6757
6758 /* Make sure that we have a proper tag at the new address.
6759 Otherwise, offset_to_top is bogus (which can happen when
6760 the object is not initialized yet). */
6761
6762 if (!tag)
6763 return obj;
6764
6765 obj_type = type_from_tag (tag);
6766
6767 if (!obj_type)
6768 return obj;
6769
6770 return value_from_contents_and_address (obj_type, NULL, base_address);
6771}
6772
1b611343
JB
6773/* Return the "ada__tags__type_specific_data" type. */
6774
6775static struct type *
6776ada_get_tsd_type (struct inferior *inf)
963a6417 6777{
1b611343 6778 struct ada_inferior_data *data = get_ada_inferior_data (inf);
4c4b4cd2 6779
1b611343
JB
6780 if (data->tsd_type == 0)
6781 data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data");
6782 return data->tsd_type;
6783}
529cad9c 6784
1b611343
JB
6785/* Return the TSD (type-specific data) associated to the given TAG.
6786 TAG is assumed to be the tag of a tagged-type entity.
529cad9c 6787
1b611343 6788 May return NULL if we are unable to get the TSD. */
4c4b4cd2 6789
1b611343
JB
6790static struct value *
6791ada_get_tsd_from_tag (struct value *tag)
4c4b4cd2 6792{
4c4b4cd2 6793 struct value *val;
1b611343 6794 struct type *type;
5b4ee69b 6795
1b611343
JB
6796 /* First option: The TSD is simply stored as a field of our TAG.
6797 Only older versions of GNAT would use this format, but we have
6798 to test it first, because there are no visible markers for
6799 the current approach except the absence of that field. */
529cad9c 6800
1b611343
JB
6801 val = ada_value_struct_elt (tag, "tsd", 1);
6802 if (val)
6803 return val;
e802dbe0 6804
1b611343
JB
6805 /* Try the second representation for the dispatch table (in which
6806 there is no explicit 'tsd' field in the referent of the tag pointer,
6807 and instead the tsd pointer is stored just before the dispatch
6808 table. */
e802dbe0 6809
1b611343
JB
6810 type = ada_get_tsd_type (current_inferior());
6811 if (type == NULL)
6812 return NULL;
6813 type = lookup_pointer_type (lookup_pointer_type (type));
6814 val = value_cast (type, tag);
6815 if (val == NULL)
6816 return NULL;
6817 return value_ind (value_ptradd (val, -1));
e802dbe0
JB
6818}
6819
1b611343
JB
6820/* Given the TSD of a tag (type-specific data), return a string
6821 containing the name of the associated type.
6822
6823 The returned value is good until the next call. May return NULL
6824 if we are unable to determine the tag name. */
6825
6826static char *
6827ada_tag_name_from_tsd (struct value *tsd)
529cad9c 6828{
529cad9c
PH
6829 static char name[1024];
6830 char *p;
1b611343 6831 struct value *val;
529cad9c 6832
1b611343 6833 val = ada_value_struct_elt (tsd, "expanded_name", 1);
4c4b4cd2 6834 if (val == NULL)
1b611343 6835 return NULL;
4c4b4cd2
PH
6836 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
6837 for (p = name; *p != '\0'; p += 1)
6838 if (isalpha (*p))
6839 *p = tolower (*p);
1b611343 6840 return name;
4c4b4cd2
PH
6841}
6842
6843/* The type name of the dynamic type denoted by the 'tag value TAG, as
1b611343
JB
6844 a C string.
6845
6846 Return NULL if the TAG is not an Ada tag, or if we were unable to
6847 determine the name of that tag. The result is good until the next
6848 call. */
4c4b4cd2
PH
6849
6850const char *
6851ada_tag_name (struct value *tag)
6852{
1b611343 6853 char *name = NULL;
5b4ee69b 6854
df407dfe 6855 if (!ada_is_tag_type (value_type (tag)))
4c4b4cd2 6856 return NULL;
1b611343
JB
6857
6858 /* It is perfectly possible that an exception be raised while trying
6859 to determine the TAG's name, even under normal circumstances:
6860 The associated variable may be uninitialized or corrupted, for
6861 instance. We do not let any exception propagate past this point.
6862 instead we return NULL.
6863
6864 We also do not print the error message either (which often is very
6865 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6866 the caller print a more meaningful message if necessary. */
492d29ea 6867 TRY
1b611343
JB
6868 {
6869 struct value *tsd = ada_get_tsd_from_tag (tag);
6870
6871 if (tsd != NULL)
6872 name = ada_tag_name_from_tsd (tsd);
6873 }
492d29ea
PA
6874 CATCH (e, RETURN_MASK_ERROR)
6875 {
6876 }
6877 END_CATCH
1b611343
JB
6878
6879 return name;
4c4b4cd2
PH
6880}
6881
6882/* The parent type of TYPE, or NULL if none. */
14f9c5c9 6883
d2e4a39e 6884struct type *
ebf56fd3 6885ada_parent_type (struct type *type)
14f9c5c9
AS
6886{
6887 int i;
6888
61ee279c 6889 type = ada_check_typedef (type);
14f9c5c9
AS
6890
6891 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6892 return NULL;
6893
6894 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6895 if (ada_is_parent_field (type, i))
0c1f74cf
JB
6896 {
6897 struct type *parent_type = TYPE_FIELD_TYPE (type, i);
6898
6899 /* If the _parent field is a pointer, then dereference it. */
6900 if (TYPE_CODE (parent_type) == TYPE_CODE_PTR)
6901 parent_type = TYPE_TARGET_TYPE (parent_type);
6902 /* If there is a parallel XVS type, get the actual base type. */
6903 parent_type = ada_get_base_type (parent_type);
6904
6905 return ada_check_typedef (parent_type);
6906 }
14f9c5c9
AS
6907
6908 return NULL;
6909}
6910
4c4b4cd2
PH
6911/* True iff field number FIELD_NUM of structure type TYPE contains the
6912 parent-type (inherited) fields of a derived type. Assumes TYPE is
6913 a structure type with at least FIELD_NUM+1 fields. */
14f9c5c9
AS
6914
6915int
ebf56fd3 6916ada_is_parent_field (struct type *type, int field_num)
14f9c5c9 6917{
61ee279c 6918 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
5b4ee69b 6919
4c4b4cd2 6920 return (name != NULL
61012eef
GB
6921 && (startswith (name, "PARENT")
6922 || startswith (name, "_parent")));
14f9c5c9
AS
6923}
6924
4c4b4cd2 6925/* True iff field number FIELD_NUM of structure type TYPE is a
14f9c5c9 6926 transparent wrapper field (which should be silently traversed when doing
4c4b4cd2 6927 field selection and flattened when printing). Assumes TYPE is a
14f9c5c9 6928 structure type with at least FIELD_NUM+1 fields. Such fields are always
4c4b4cd2 6929 structures. */
14f9c5c9
AS
6930
6931int
ebf56fd3 6932ada_is_wrapper_field (struct type *type, int field_num)
14f9c5c9 6933{
d2e4a39e 6934 const char *name = TYPE_FIELD_NAME (type, field_num);
5b4ee69b 6935
dddc0e16
JB
6936 if (name != NULL && strcmp (name, "RETVAL") == 0)
6937 {
6938 /* This happens in functions with "out" or "in out" parameters
6939 which are passed by copy. For such functions, GNAT describes
6940 the function's return type as being a struct where the return
6941 value is in a field called RETVAL, and where the other "out"
6942 or "in out" parameters are fields of that struct. This is not
6943 a wrapper. */
6944 return 0;
6945 }
6946
d2e4a39e 6947 return (name != NULL
61012eef 6948 && (startswith (name, "PARENT")
4c4b4cd2 6949 || strcmp (name, "REP") == 0
61012eef 6950 || startswith (name, "_parent")
4c4b4cd2 6951 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
14f9c5c9
AS
6952}
6953
4c4b4cd2
PH
6954/* True iff field number FIELD_NUM of structure or union type TYPE
6955 is a variant wrapper. Assumes TYPE is a structure type with at least
6956 FIELD_NUM+1 fields. */
14f9c5c9
AS
6957
6958int
ebf56fd3 6959ada_is_variant_part (struct type *type, int field_num)
14f9c5c9 6960{
d2e4a39e 6961 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
5b4ee69b 6962
14f9c5c9 6963 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
4c4b4cd2 6964 || (is_dynamic_field (type, field_num)
c3e5cd34
PH
6965 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
6966 == TYPE_CODE_UNION)));
14f9c5c9
AS
6967}
6968
6969/* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
4c4b4cd2 6970 whose discriminants are contained in the record type OUTER_TYPE,
7c964f07
UW
6971 returns the type of the controlling discriminant for the variant.
6972 May return NULL if the type could not be found. */
14f9c5c9 6973
d2e4a39e 6974struct type *
ebf56fd3 6975ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
14f9c5c9 6976{
a121b7c1 6977 const char *name = ada_variant_discrim_name (var_type);
5b4ee69b 6978
988f6b3d 6979 return ada_lookup_struct_elt_type (outer_type, name, 1, 1);
14f9c5c9
AS
6980}
6981
4c4b4cd2 6982/* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
14f9c5c9 6983 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
4c4b4cd2 6984 represents a 'when others' clause; otherwise 0. */
14f9c5c9
AS
6985
6986int
ebf56fd3 6987ada_is_others_clause (struct type *type, int field_num)
14f9c5c9 6988{
d2e4a39e 6989 const char *name = TYPE_FIELD_NAME (type, field_num);
5b4ee69b 6990
14f9c5c9
AS
6991 return (name != NULL && name[0] == 'O');
6992}
6993
6994/* Assuming that TYPE0 is the type of the variant part of a record,
4c4b4cd2
PH
6995 returns the name of the discriminant controlling the variant.
6996 The value is valid until the next call to ada_variant_discrim_name. */
14f9c5c9 6997
a121b7c1 6998const char *
ebf56fd3 6999ada_variant_discrim_name (struct type *type0)
14f9c5c9 7000{
d2e4a39e 7001 static char *result = NULL;
14f9c5c9 7002 static size_t result_len = 0;
d2e4a39e
AS
7003 struct type *type;
7004 const char *name;
7005 const char *discrim_end;
7006 const char *discrim_start;
14f9c5c9
AS
7007
7008 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
7009 type = TYPE_TARGET_TYPE (type0);
7010 else
7011 type = type0;
7012
7013 name = ada_type_name (type);
7014
7015 if (name == NULL || name[0] == '\000')
7016 return "";
7017
7018 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
7019 discrim_end -= 1)
7020 {
61012eef 7021 if (startswith (discrim_end, "___XVN"))
4c4b4cd2 7022 break;
14f9c5c9
AS
7023 }
7024 if (discrim_end == name)
7025 return "";
7026
d2e4a39e 7027 for (discrim_start = discrim_end; discrim_start != name + 3;
14f9c5c9
AS
7028 discrim_start -= 1)
7029 {
d2e4a39e 7030 if (discrim_start == name + 1)
4c4b4cd2 7031 return "";
76a01679 7032 if ((discrim_start > name + 3
61012eef 7033 && startswith (discrim_start - 3, "___"))
4c4b4cd2
PH
7034 || discrim_start[-1] == '.')
7035 break;
14f9c5c9
AS
7036 }
7037
7038 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
7039 strncpy (result, discrim_start, discrim_end - discrim_start);
d2e4a39e 7040 result[discrim_end - discrim_start] = '\0';
14f9c5c9
AS
7041 return result;
7042}
7043
4c4b4cd2
PH
7044/* Scan STR for a subtype-encoded number, beginning at position K.
7045 Put the position of the character just past the number scanned in
7046 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
7047 Return 1 if there was a valid number at the given position, and 0
7048 otherwise. A "subtype-encoded" number consists of the absolute value
7049 in decimal, followed by the letter 'm' to indicate a negative number.
7050 Assumes 0m does not occur. */
14f9c5c9
AS
7051
7052int
d2e4a39e 7053ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
14f9c5c9
AS
7054{
7055 ULONGEST RU;
7056
d2e4a39e 7057 if (!isdigit (str[k]))
14f9c5c9
AS
7058 return 0;
7059
4c4b4cd2 7060 /* Do it the hard way so as not to make any assumption about
14f9c5c9 7061 the relationship of unsigned long (%lu scan format code) and
4c4b4cd2 7062 LONGEST. */
14f9c5c9
AS
7063 RU = 0;
7064 while (isdigit (str[k]))
7065 {
d2e4a39e 7066 RU = RU * 10 + (str[k] - '0');
14f9c5c9
AS
7067 k += 1;
7068 }
7069
d2e4a39e 7070 if (str[k] == 'm')
14f9c5c9
AS
7071 {
7072 if (R != NULL)
4c4b4cd2 7073 *R = (-(LONGEST) (RU - 1)) - 1;
14f9c5c9
AS
7074 k += 1;
7075 }
7076 else if (R != NULL)
7077 *R = (LONGEST) RU;
7078
4c4b4cd2 7079 /* NOTE on the above: Technically, C does not say what the results of
14f9c5c9
AS
7080 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
7081 number representable as a LONGEST (although either would probably work
7082 in most implementations). When RU>0, the locution in the then branch
4c4b4cd2 7083 above is always equivalent to the negative of RU. */
14f9c5c9
AS
7084
7085 if (new_k != NULL)
7086 *new_k = k;
7087 return 1;
7088}
7089
4c4b4cd2
PH
7090/* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
7091 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
7092 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
14f9c5c9 7093
d2e4a39e 7094int
ebf56fd3 7095ada_in_variant (LONGEST val, struct type *type, int field_num)
14f9c5c9 7096{
d2e4a39e 7097 const char *name = TYPE_FIELD_NAME (type, field_num);
14f9c5c9
AS
7098 int p;
7099
7100 p = 0;
7101 while (1)
7102 {
d2e4a39e 7103 switch (name[p])
4c4b4cd2
PH
7104 {
7105 case '\0':
7106 return 0;
7107 case 'S':
7108 {
7109 LONGEST W;
5b4ee69b 7110
4c4b4cd2
PH
7111 if (!ada_scan_number (name, p + 1, &W, &p))
7112 return 0;
7113 if (val == W)
7114 return 1;
7115 break;
7116 }
7117 case 'R':
7118 {
7119 LONGEST L, U;
5b4ee69b 7120
4c4b4cd2
PH
7121 if (!ada_scan_number (name, p + 1, &L, &p)
7122 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
7123 return 0;
7124 if (val >= L && val <= U)
7125 return 1;
7126 break;
7127 }
7128 case 'O':
7129 return 1;
7130 default:
7131 return 0;
7132 }
7133 }
7134}
7135
0963b4bd 7136/* FIXME: Lots of redundancy below. Try to consolidate. */
4c4b4cd2
PH
7137
7138/* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
7139 ARG_TYPE, extract and return the value of one of its (non-static)
7140 fields. FIELDNO says which field. Differs from value_primitive_field
7141 only in that it can handle packed values of arbitrary type. */
14f9c5c9 7142
4c4b4cd2 7143static struct value *
d2e4a39e 7144ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
4c4b4cd2 7145 struct type *arg_type)
14f9c5c9 7146{
14f9c5c9
AS
7147 struct type *type;
7148
61ee279c 7149 arg_type = ada_check_typedef (arg_type);
14f9c5c9
AS
7150 type = TYPE_FIELD_TYPE (arg_type, fieldno);
7151
4c4b4cd2 7152 /* Handle packed fields. */
14f9c5c9
AS
7153
7154 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
7155 {
7156 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
7157 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
d2e4a39e 7158
0fd88904 7159 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
4c4b4cd2
PH
7160 offset + bit_pos / 8,
7161 bit_pos % 8, bit_size, type);
14f9c5c9
AS
7162 }
7163 else
7164 return value_primitive_field (arg1, offset, fieldno, arg_type);
7165}
7166
52ce6436
PH
7167/* Find field with name NAME in object of type TYPE. If found,
7168 set the following for each argument that is non-null:
7169 - *FIELD_TYPE_P to the field's type;
7170 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
7171 an object of that type;
7172 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
7173 - *BIT_SIZE_P to its size in bits if the field is packed, and
7174 0 otherwise;
7175 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
7176 fields up to but not including the desired field, or by the total
7177 number of fields if not found. A NULL value of NAME never
7178 matches; the function just counts visible fields in this case.
7179
828d5846
XR
7180 Notice that we need to handle when a tagged record hierarchy
7181 has some components with the same name, like in this scenario:
7182
7183 type Top_T is tagged record
7184 N : Integer := 1;
7185 U : Integer := 974;
7186 A : Integer := 48;
7187 end record;
7188
7189 type Middle_T is new Top.Top_T with record
7190 N : Character := 'a';
7191 C : Integer := 3;
7192 end record;
7193
7194 type Bottom_T is new Middle.Middle_T with record
7195 N : Float := 4.0;
7196 C : Character := '5';
7197 X : Integer := 6;
7198 A : Character := 'J';
7199 end record;
7200
7201 Let's say we now have a variable declared and initialized as follow:
7202
7203 TC : Top_A := new Bottom_T;
7204
7205 And then we use this variable to call this function
7206
7207 procedure Assign (Obj: in out Top_T; TV : Integer);
7208
7209 as follow:
7210
7211 Assign (Top_T (B), 12);
7212
7213 Now, we're in the debugger, and we're inside that procedure
7214 then and we want to print the value of obj.c:
7215
7216 Usually, the tagged record or one of the parent type owns the
7217 component to print and there's no issue but in this particular
7218 case, what does it mean to ask for Obj.C? Since the actual
7219 type for object is type Bottom_T, it could mean two things: type
7220 component C from the Middle_T view, but also component C from
7221 Bottom_T. So in that "undefined" case, when the component is
7222 not found in the non-resolved type (which includes all the
7223 components of the parent type), then resolve it and see if we
7224 get better luck once expanded.
7225
7226 In the case of homonyms in the derived tagged type, we don't
7227 guaranty anything, and pick the one that's easiest for us
7228 to program.
7229
0963b4bd 7230 Returns 1 if found, 0 otherwise. */
52ce6436 7231
4c4b4cd2 7232static int
0d5cff50 7233find_struct_field (const char *name, struct type *type, int offset,
76a01679 7234 struct type **field_type_p,
52ce6436
PH
7235 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
7236 int *index_p)
4c4b4cd2
PH
7237{
7238 int i;
828d5846 7239 int parent_offset = -1;
4c4b4cd2 7240
61ee279c 7241 type = ada_check_typedef (type);
76a01679 7242
52ce6436
PH
7243 if (field_type_p != NULL)
7244 *field_type_p = NULL;
7245 if (byte_offset_p != NULL)
d5d6fca5 7246 *byte_offset_p = 0;
52ce6436
PH
7247 if (bit_offset_p != NULL)
7248 *bit_offset_p = 0;
7249 if (bit_size_p != NULL)
7250 *bit_size_p = 0;
7251
7252 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
4c4b4cd2
PH
7253 {
7254 int bit_pos = TYPE_FIELD_BITPOS (type, i);
7255 int fld_offset = offset + bit_pos / 8;
0d5cff50 7256 const char *t_field_name = TYPE_FIELD_NAME (type, i);
76a01679 7257
4c4b4cd2
PH
7258 if (t_field_name == NULL)
7259 continue;
7260
828d5846
XR
7261 else if (ada_is_parent_field (type, i))
7262 {
7263 /* This is a field pointing us to the parent type of a tagged
7264 type. As hinted in this function's documentation, we give
7265 preference to fields in the current record first, so what
7266 we do here is just record the index of this field before
7267 we skip it. If it turns out we couldn't find our field
7268 in the current record, then we'll get back to it and search
7269 inside it whether the field might exist in the parent. */
7270
7271 parent_offset = i;
7272 continue;
7273 }
7274
52ce6436 7275 else if (name != NULL && field_name_match (t_field_name, name))
76a01679
JB
7276 {
7277 int bit_size = TYPE_FIELD_BITSIZE (type, i);
5b4ee69b 7278
52ce6436
PH
7279 if (field_type_p != NULL)
7280 *field_type_p = TYPE_FIELD_TYPE (type, i);
7281 if (byte_offset_p != NULL)
7282 *byte_offset_p = fld_offset;
7283 if (bit_offset_p != NULL)
7284 *bit_offset_p = bit_pos % 8;
7285 if (bit_size_p != NULL)
7286 *bit_size_p = bit_size;
76a01679
JB
7287 return 1;
7288 }
4c4b4cd2
PH
7289 else if (ada_is_wrapper_field (type, i))
7290 {
52ce6436
PH
7291 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
7292 field_type_p, byte_offset_p, bit_offset_p,
7293 bit_size_p, index_p))
76a01679
JB
7294 return 1;
7295 }
4c4b4cd2
PH
7296 else if (ada_is_variant_part (type, i))
7297 {
52ce6436
PH
7298 /* PNH: Wait. Do we ever execute this section, or is ARG always of
7299 fixed type?? */
4c4b4cd2 7300 int j;
52ce6436
PH
7301 struct type *field_type
7302 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
4c4b4cd2 7303
52ce6436 7304 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
4c4b4cd2 7305 {
76a01679
JB
7306 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
7307 fld_offset
7308 + TYPE_FIELD_BITPOS (field_type, j) / 8,
7309 field_type_p, byte_offset_p,
52ce6436 7310 bit_offset_p, bit_size_p, index_p))
76a01679 7311 return 1;
4c4b4cd2
PH
7312 }
7313 }
52ce6436
PH
7314 else if (index_p != NULL)
7315 *index_p += 1;
4c4b4cd2 7316 }
828d5846
XR
7317
7318 /* Field not found so far. If this is a tagged type which
7319 has a parent, try finding that field in the parent now. */
7320
7321 if (parent_offset != -1)
7322 {
7323 int bit_pos = TYPE_FIELD_BITPOS (type, parent_offset);
7324 int fld_offset = offset + bit_pos / 8;
7325
7326 if (find_struct_field (name, TYPE_FIELD_TYPE (type, parent_offset),
7327 fld_offset, field_type_p, byte_offset_p,
7328 bit_offset_p, bit_size_p, index_p))
7329 return 1;
7330 }
7331
4c4b4cd2
PH
7332 return 0;
7333}
7334
0963b4bd 7335/* Number of user-visible fields in record type TYPE. */
4c4b4cd2 7336
52ce6436
PH
7337static int
7338num_visible_fields (struct type *type)
7339{
7340 int n;
5b4ee69b 7341
52ce6436
PH
7342 n = 0;
7343 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
7344 return n;
7345}
14f9c5c9 7346
4c4b4cd2 7347/* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
14f9c5c9
AS
7348 and search in it assuming it has (class) type TYPE.
7349 If found, return value, else return NULL.
7350
828d5846
XR
7351 Searches recursively through wrapper fields (e.g., '_parent').
7352
7353 In the case of homonyms in the tagged types, please refer to the
7354 long explanation in find_struct_field's function documentation. */
14f9c5c9 7355
4c4b4cd2 7356static struct value *
108d56a4 7357ada_search_struct_field (const char *name, struct value *arg, int offset,
4c4b4cd2 7358 struct type *type)
14f9c5c9
AS
7359{
7360 int i;
828d5846 7361 int parent_offset = -1;
14f9c5c9 7362
5b4ee69b 7363 type = ada_check_typedef (type);
52ce6436 7364 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
14f9c5c9 7365 {
0d5cff50 7366 const char *t_field_name = TYPE_FIELD_NAME (type, i);
14f9c5c9
AS
7367
7368 if (t_field_name == NULL)
4c4b4cd2 7369 continue;
14f9c5c9 7370
828d5846
XR
7371 else if (ada_is_parent_field (type, i))
7372 {
7373 /* This is a field pointing us to the parent type of a tagged
7374 type. As hinted in this function's documentation, we give
7375 preference to fields in the current record first, so what
7376 we do here is just record the index of this field before
7377 we skip it. If it turns out we couldn't find our field
7378 in the current record, then we'll get back to it and search
7379 inside it whether the field might exist in the parent. */
7380
7381 parent_offset = i;
7382 continue;
7383 }
7384
14f9c5c9 7385 else if (field_name_match (t_field_name, name))
4c4b4cd2 7386 return ada_value_primitive_field (arg, offset, i, type);
14f9c5c9
AS
7387
7388 else if (ada_is_wrapper_field (type, i))
4c4b4cd2 7389 {
0963b4bd 7390 struct value *v = /* Do not let indent join lines here. */
06d5cf63
JB
7391 ada_search_struct_field (name, arg,
7392 offset + TYPE_FIELD_BITPOS (type, i) / 8,
7393 TYPE_FIELD_TYPE (type, i));
5b4ee69b 7394
4c4b4cd2
PH
7395 if (v != NULL)
7396 return v;
7397 }
14f9c5c9
AS
7398
7399 else if (ada_is_variant_part (type, i))
4c4b4cd2 7400 {
0963b4bd 7401 /* PNH: Do we ever get here? See find_struct_field. */
4c4b4cd2 7402 int j;
5b4ee69b
MS
7403 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
7404 i));
4c4b4cd2
PH
7405 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
7406
52ce6436 7407 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
4c4b4cd2 7408 {
0963b4bd
MS
7409 struct value *v = ada_search_struct_field /* Force line
7410 break. */
06d5cf63
JB
7411 (name, arg,
7412 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
7413 TYPE_FIELD_TYPE (field_type, j));
5b4ee69b 7414
4c4b4cd2
PH
7415 if (v != NULL)
7416 return v;
7417 }
7418 }
14f9c5c9 7419 }
828d5846
XR
7420
7421 /* Field not found so far. If this is a tagged type which
7422 has a parent, try finding that field in the parent now. */
7423
7424 if (parent_offset != -1)
7425 {
7426 struct value *v = ada_search_struct_field (
7427 name, arg, offset + TYPE_FIELD_BITPOS (type, parent_offset) / 8,
7428 TYPE_FIELD_TYPE (type, parent_offset));
7429
7430 if (v != NULL)
7431 return v;
7432 }
7433
14f9c5c9
AS
7434 return NULL;
7435}
d2e4a39e 7436
52ce6436
PH
7437static struct value *ada_index_struct_field_1 (int *, struct value *,
7438 int, struct type *);
7439
7440
7441/* Return field #INDEX in ARG, where the index is that returned by
7442 * find_struct_field through its INDEX_P argument. Adjust the address
7443 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
0963b4bd 7444 * If found, return value, else return NULL. */
52ce6436
PH
7445
7446static struct value *
7447ada_index_struct_field (int index, struct value *arg, int offset,
7448 struct type *type)
7449{
7450 return ada_index_struct_field_1 (&index, arg, offset, type);
7451}
7452
7453
7454/* Auxiliary function for ada_index_struct_field. Like
7455 * ada_index_struct_field, but takes index from *INDEX_P and modifies
0963b4bd 7456 * *INDEX_P. */
52ce6436
PH
7457
7458static struct value *
7459ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
7460 struct type *type)
7461{
7462 int i;
7463 type = ada_check_typedef (type);
7464
7465 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7466 {
7467 if (TYPE_FIELD_NAME (type, i) == NULL)
7468 continue;
7469 else if (ada_is_wrapper_field (type, i))
7470 {
0963b4bd 7471 struct value *v = /* Do not let indent join lines here. */
52ce6436
PH
7472 ada_index_struct_field_1 (index_p, arg,
7473 offset + TYPE_FIELD_BITPOS (type, i) / 8,
7474 TYPE_FIELD_TYPE (type, i));
5b4ee69b 7475
52ce6436
PH
7476 if (v != NULL)
7477 return v;
7478 }
7479
7480 else if (ada_is_variant_part (type, i))
7481 {
7482 /* PNH: Do we ever get here? See ada_search_struct_field,
0963b4bd 7483 find_struct_field. */
52ce6436
PH
7484 error (_("Cannot assign this kind of variant record"));
7485 }
7486 else if (*index_p == 0)
7487 return ada_value_primitive_field (arg, offset, i, type);
7488 else
7489 *index_p -= 1;
7490 }
7491 return NULL;
7492}
7493
4c4b4cd2
PH
7494/* Given ARG, a value of type (pointer or reference to a)*
7495 structure/union, extract the component named NAME from the ultimate
7496 target structure/union and return it as a value with its
f5938064 7497 appropriate type.
14f9c5c9 7498
4c4b4cd2
PH
7499 The routine searches for NAME among all members of the structure itself
7500 and (recursively) among all members of any wrapper members
14f9c5c9
AS
7501 (e.g., '_parent').
7502
03ee6b2e
PH
7503 If NO_ERR, then simply return NULL in case of error, rather than
7504 calling error. */
14f9c5c9 7505
d2e4a39e 7506struct value *
a121b7c1 7507ada_value_struct_elt (struct value *arg, const char *name, int no_err)
14f9c5c9 7508{
4c4b4cd2 7509 struct type *t, *t1;
d2e4a39e 7510 struct value *v;
1f5d1570 7511 int check_tag;
14f9c5c9 7512
4c4b4cd2 7513 v = NULL;
df407dfe 7514 t1 = t = ada_check_typedef (value_type (arg));
4c4b4cd2
PH
7515 if (TYPE_CODE (t) == TYPE_CODE_REF)
7516 {
7517 t1 = TYPE_TARGET_TYPE (t);
7518 if (t1 == NULL)
03ee6b2e 7519 goto BadValue;
61ee279c 7520 t1 = ada_check_typedef (t1);
4c4b4cd2 7521 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
76a01679 7522 {
994b9211 7523 arg = coerce_ref (arg);
76a01679
JB
7524 t = t1;
7525 }
4c4b4cd2 7526 }
14f9c5c9 7527
4c4b4cd2
PH
7528 while (TYPE_CODE (t) == TYPE_CODE_PTR)
7529 {
7530 t1 = TYPE_TARGET_TYPE (t);
7531 if (t1 == NULL)
03ee6b2e 7532 goto BadValue;
61ee279c 7533 t1 = ada_check_typedef (t1);
4c4b4cd2 7534 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
76a01679
JB
7535 {
7536 arg = value_ind (arg);
7537 t = t1;
7538 }
4c4b4cd2 7539 else
76a01679 7540 break;
4c4b4cd2 7541 }
14f9c5c9 7542
4c4b4cd2 7543 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
03ee6b2e 7544 goto BadValue;
14f9c5c9 7545
4c4b4cd2
PH
7546 if (t1 == t)
7547 v = ada_search_struct_field (name, arg, 0, t);
7548 else
7549 {
7550 int bit_offset, bit_size, byte_offset;
7551 struct type *field_type;
7552 CORE_ADDR address;
7553
76a01679 7554 if (TYPE_CODE (t) == TYPE_CODE_PTR)
b50d69b5 7555 address = value_address (ada_value_ind (arg));
4c4b4cd2 7556 else
b50d69b5 7557 address = value_address (ada_coerce_ref (arg));
14f9c5c9 7558
828d5846
XR
7559 /* Check to see if this is a tagged type. We also need to handle
7560 the case where the type is a reference to a tagged type, but
7561 we have to be careful to exclude pointers to tagged types.
7562 The latter should be shown as usual (as a pointer), whereas
7563 a reference should mostly be transparent to the user. */
7564
7565 if (ada_is_tagged_type (t1, 0)
7566 || (TYPE_CODE (t1) == TYPE_CODE_REF
7567 && ada_is_tagged_type (TYPE_TARGET_TYPE (t1), 0)))
7568 {
7569 /* We first try to find the searched field in the current type.
7570 If not found then let's look in the fixed type. */
7571
7572 if (!find_struct_field (name, t1, 0,
7573 &field_type, &byte_offset, &bit_offset,
7574 &bit_size, NULL))
1f5d1570
JG
7575 check_tag = 1;
7576 else
7577 check_tag = 0;
828d5846
XR
7578 }
7579 else
1f5d1570
JG
7580 check_tag = 0;
7581
7582 /* Convert to fixed type in all cases, so that we have proper
7583 offsets to each field in unconstrained record types. */
7584 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL,
7585 address, NULL, check_tag);
828d5846 7586
76a01679
JB
7587 if (find_struct_field (name, t1, 0,
7588 &field_type, &byte_offset, &bit_offset,
52ce6436 7589 &bit_size, NULL))
76a01679
JB
7590 {
7591 if (bit_size != 0)
7592 {
714e53ab
PH
7593 if (TYPE_CODE (t) == TYPE_CODE_REF)
7594 arg = ada_coerce_ref (arg);
7595 else
7596 arg = ada_value_ind (arg);
76a01679
JB
7597 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
7598 bit_offset, bit_size,
7599 field_type);
7600 }
7601 else
f5938064 7602 v = value_at_lazy (field_type, address + byte_offset);
76a01679
JB
7603 }
7604 }
7605
03ee6b2e
PH
7606 if (v != NULL || no_err)
7607 return v;
7608 else
323e0a4a 7609 error (_("There is no member named %s."), name);
14f9c5c9 7610
03ee6b2e
PH
7611 BadValue:
7612 if (no_err)
7613 return NULL;
7614 else
0963b4bd
MS
7615 error (_("Attempt to extract a component of "
7616 "a value that is not a record."));
14f9c5c9
AS
7617}
7618
3b4de39c 7619/* Return a string representation of type TYPE. */
99bbb428 7620
3b4de39c 7621static std::string
99bbb428
PA
7622type_as_string (struct type *type)
7623{
d7e74731 7624 string_file tmp_stream;
99bbb428 7625
d7e74731 7626 type_print (type, "", &tmp_stream, -1);
99bbb428 7627
d7e74731 7628 return std::move (tmp_stream.string ());
99bbb428
PA
7629}
7630
14f9c5c9 7631/* Given a type TYPE, look up the type of the component of type named NAME.
4c4b4cd2
PH
7632 If DISPP is non-null, add its byte displacement from the beginning of a
7633 structure (pointed to by a value) of type TYPE to *DISPP (does not
14f9c5c9
AS
7634 work for packed fields).
7635
7636 Matches any field whose name has NAME as a prefix, possibly
4c4b4cd2 7637 followed by "___".
14f9c5c9 7638
0963b4bd 7639 TYPE can be either a struct or union. If REFOK, TYPE may also
4c4b4cd2
PH
7640 be a (pointer or reference)+ to a struct or union, and the
7641 ultimate target type will be searched.
14f9c5c9
AS
7642
7643 Looks recursively into variant clauses and parent types.
7644
828d5846
XR
7645 In the case of homonyms in the tagged types, please refer to the
7646 long explanation in find_struct_field's function documentation.
7647
4c4b4cd2
PH
7648 If NOERR is nonzero, return NULL if NAME is not suitably defined or
7649 TYPE is not a type of the right kind. */
14f9c5c9 7650
4c4b4cd2 7651static struct type *
a121b7c1 7652ada_lookup_struct_elt_type (struct type *type, const char *name, int refok,
988f6b3d 7653 int noerr)
14f9c5c9
AS
7654{
7655 int i;
828d5846 7656 int parent_offset = -1;
14f9c5c9
AS
7657
7658 if (name == NULL)
7659 goto BadName;
7660
76a01679 7661 if (refok && type != NULL)
4c4b4cd2
PH
7662 while (1)
7663 {
61ee279c 7664 type = ada_check_typedef (type);
76a01679
JB
7665 if (TYPE_CODE (type) != TYPE_CODE_PTR
7666 && TYPE_CODE (type) != TYPE_CODE_REF)
7667 break;
7668 type = TYPE_TARGET_TYPE (type);
4c4b4cd2 7669 }
14f9c5c9 7670
76a01679 7671 if (type == NULL
1265e4aa
JB
7672 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
7673 && TYPE_CODE (type) != TYPE_CODE_UNION))
14f9c5c9 7674 {
4c4b4cd2 7675 if (noerr)
76a01679 7676 return NULL;
99bbb428 7677
3b4de39c
PA
7678 error (_("Type %s is not a structure or union type"),
7679 type != NULL ? type_as_string (type).c_str () : _("(null)"));
14f9c5c9
AS
7680 }
7681
7682 type = to_static_fixed_type (type);
7683
7684 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
7685 {
0d5cff50 7686 const char *t_field_name = TYPE_FIELD_NAME (type, i);
14f9c5c9 7687 struct type *t;
d2e4a39e 7688
14f9c5c9 7689 if (t_field_name == NULL)
4c4b4cd2 7690 continue;
14f9c5c9 7691
828d5846
XR
7692 else if (ada_is_parent_field (type, i))
7693 {
7694 /* This is a field pointing us to the parent type of a tagged
7695 type. As hinted in this function's documentation, we give
7696 preference to fields in the current record first, so what
7697 we do here is just record the index of this field before
7698 we skip it. If it turns out we couldn't find our field
7699 in the current record, then we'll get back to it and search
7700 inside it whether the field might exist in the parent. */
7701
7702 parent_offset = i;
7703 continue;
7704 }
7705
14f9c5c9 7706 else if (field_name_match (t_field_name, name))
988f6b3d 7707 return TYPE_FIELD_TYPE (type, i);
14f9c5c9
AS
7708
7709 else if (ada_is_wrapper_field (type, i))
4c4b4cd2 7710 {
4c4b4cd2 7711 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
988f6b3d 7712 0, 1);
4c4b4cd2 7713 if (t != NULL)
988f6b3d 7714 return t;
4c4b4cd2 7715 }
14f9c5c9
AS
7716
7717 else if (ada_is_variant_part (type, i))
4c4b4cd2
PH
7718 {
7719 int j;
5b4ee69b
MS
7720 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type,
7721 i));
4c4b4cd2
PH
7722
7723 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
7724 {
b1f33ddd
JB
7725 /* FIXME pnh 2008/01/26: We check for a field that is
7726 NOT wrapped in a struct, since the compiler sometimes
7727 generates these for unchecked variant types. Revisit
0963b4bd 7728 if the compiler changes this practice. */
0d5cff50 7729 const char *v_field_name = TYPE_FIELD_NAME (field_type, j);
988f6b3d 7730
b1f33ddd
JB
7731 if (v_field_name != NULL
7732 && field_name_match (v_field_name, name))
460efde1 7733 t = TYPE_FIELD_TYPE (field_type, j);
b1f33ddd 7734 else
0963b4bd
MS
7735 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type,
7736 j),
988f6b3d 7737 name, 0, 1);
b1f33ddd 7738
4c4b4cd2 7739 if (t != NULL)
988f6b3d 7740 return t;
4c4b4cd2
PH
7741 }
7742 }
14f9c5c9
AS
7743
7744 }
7745
828d5846
XR
7746 /* Field not found so far. If this is a tagged type which
7747 has a parent, try finding that field in the parent now. */
7748
7749 if (parent_offset != -1)
7750 {
7751 struct type *t;
7752
7753 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, parent_offset),
7754 name, 0, 1);
7755 if (t != NULL)
7756 return t;
7757 }
7758
14f9c5c9 7759BadName:
d2e4a39e 7760 if (!noerr)
14f9c5c9 7761 {
2b2798cc 7762 const char *name_str = name != NULL ? name : _("<null>");
99bbb428
PA
7763
7764 error (_("Type %s has no component named %s"),
3b4de39c 7765 type_as_string (type).c_str (), name_str);
14f9c5c9
AS
7766 }
7767
7768 return NULL;
7769}
7770
b1f33ddd
JB
7771/* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7772 within a value of type OUTER_TYPE, return true iff VAR_TYPE
7773 represents an unchecked union (that is, the variant part of a
0963b4bd 7774 record that is named in an Unchecked_Union pragma). */
b1f33ddd
JB
7775
7776static int
7777is_unchecked_variant (struct type *var_type, struct type *outer_type)
7778{
a121b7c1 7779 const char *discrim_name = ada_variant_discrim_name (var_type);
5b4ee69b 7780
988f6b3d 7781 return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1) == NULL);
b1f33ddd
JB
7782}
7783
7784
14f9c5c9
AS
7785/* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
7786 within a value of type OUTER_TYPE that is stored in GDB at
4c4b4cd2
PH
7787 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
7788 numbering from 0) is applicable. Returns -1 if none are. */
14f9c5c9 7789
d2e4a39e 7790int
ebf56fd3 7791ada_which_variant_applies (struct type *var_type, struct type *outer_type,
fc1a4b47 7792 const gdb_byte *outer_valaddr)
14f9c5c9
AS
7793{
7794 int others_clause;
7795 int i;
a121b7c1 7796 const char *discrim_name = ada_variant_discrim_name (var_type);
0c281816
JB
7797 struct value *outer;
7798 struct value *discrim;
14f9c5c9
AS
7799 LONGEST discrim_val;
7800
012370f6
TT
7801 /* Using plain value_from_contents_and_address here causes problems
7802 because we will end up trying to resolve a type that is currently
7803 being constructed. */
7804 outer = value_from_contents_and_address_unresolved (outer_type,
7805 outer_valaddr, 0);
0c281816
JB
7806 discrim = ada_value_struct_elt (outer, discrim_name, 1);
7807 if (discrim == NULL)
14f9c5c9 7808 return -1;
0c281816 7809 discrim_val = value_as_long (discrim);
14f9c5c9
AS
7810
7811 others_clause = -1;
7812 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
7813 {
7814 if (ada_is_others_clause (var_type, i))
4c4b4cd2 7815 others_clause = i;
14f9c5c9 7816 else if (ada_in_variant (discrim_val, var_type, i))
4c4b4cd2 7817 return i;
14f9c5c9
AS
7818 }
7819
7820 return others_clause;
7821}
d2e4a39e 7822\f
14f9c5c9
AS
7823
7824
4c4b4cd2 7825 /* Dynamic-Sized Records */
14f9c5c9
AS
7826
7827/* Strategy: The type ostensibly attached to a value with dynamic size
7828 (i.e., a size that is not statically recorded in the debugging
7829 data) does not accurately reflect the size or layout of the value.
7830 Our strategy is to convert these values to values with accurate,
4c4b4cd2 7831 conventional types that are constructed on the fly. */
14f9c5c9
AS
7832
7833/* There is a subtle and tricky problem here. In general, we cannot
7834 determine the size of dynamic records without its data. However,
7835 the 'struct value' data structure, which GDB uses to represent
7836 quantities in the inferior process (the target), requires the size
7837 of the type at the time of its allocation in order to reserve space
7838 for GDB's internal copy of the data. That's why the
7839 'to_fixed_xxx_type' routines take (target) addresses as parameters,
4c4b4cd2 7840 rather than struct value*s.
14f9c5c9
AS
7841
7842 However, GDB's internal history variables ($1, $2, etc.) are
7843 struct value*s containing internal copies of the data that are not, in
7844 general, the same as the data at their corresponding addresses in
7845 the target. Fortunately, the types we give to these values are all
7846 conventional, fixed-size types (as per the strategy described
7847 above), so that we don't usually have to perform the
7848 'to_fixed_xxx_type' conversions to look at their values.
7849 Unfortunately, there is one exception: if one of the internal
7850 history variables is an array whose elements are unconstrained
7851 records, then we will need to create distinct fixed types for each
7852 element selected. */
7853
7854/* The upshot of all of this is that many routines take a (type, host
7855 address, target address) triple as arguments to represent a value.
7856 The host address, if non-null, is supposed to contain an internal
7857 copy of the relevant data; otherwise, the program is to consult the
4c4b4cd2 7858 target at the target address. */
14f9c5c9
AS
7859
7860/* Assuming that VAL0 represents a pointer value, the result of
7861 dereferencing it. Differs from value_ind in its treatment of
4c4b4cd2 7862 dynamic-sized types. */
14f9c5c9 7863
d2e4a39e
AS
7864struct value *
7865ada_value_ind (struct value *val0)
14f9c5c9 7866{
c48db5ca 7867 struct value *val = value_ind (val0);
5b4ee69b 7868
b50d69b5
JG
7869 if (ada_is_tagged_type (value_type (val), 0))
7870 val = ada_tag_value_at_base_address (val);
7871
4c4b4cd2 7872 return ada_to_fixed_value (val);
14f9c5c9
AS
7873}
7874
7875/* The value resulting from dereferencing any "reference to"
4c4b4cd2
PH
7876 qualifiers on VAL0. */
7877
d2e4a39e
AS
7878static struct value *
7879ada_coerce_ref (struct value *val0)
7880{
df407dfe 7881 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
d2e4a39e
AS
7882 {
7883 struct value *val = val0;
5b4ee69b 7884
994b9211 7885 val = coerce_ref (val);
b50d69b5
JG
7886
7887 if (ada_is_tagged_type (value_type (val), 0))
7888 val = ada_tag_value_at_base_address (val);
7889
4c4b4cd2 7890 return ada_to_fixed_value (val);
d2e4a39e
AS
7891 }
7892 else
14f9c5c9
AS
7893 return val0;
7894}
7895
7896/* Return OFF rounded upward if necessary to a multiple of
4c4b4cd2 7897 ALIGNMENT (a power of 2). */
14f9c5c9
AS
7898
7899static unsigned int
ebf56fd3 7900align_value (unsigned int off, unsigned int alignment)
14f9c5c9
AS
7901{
7902 return (off + alignment - 1) & ~(alignment - 1);
7903}
7904
4c4b4cd2 7905/* Return the bit alignment required for field #F of template type TYPE. */
14f9c5c9
AS
7906
7907static unsigned int
ebf56fd3 7908field_alignment (struct type *type, int f)
14f9c5c9 7909{
d2e4a39e 7910 const char *name = TYPE_FIELD_NAME (type, f);
64a1bf19 7911 int len;
14f9c5c9
AS
7912 int align_offset;
7913
64a1bf19
JB
7914 /* The field name should never be null, unless the debugging information
7915 is somehow malformed. In this case, we assume the field does not
7916 require any alignment. */
7917 if (name == NULL)
7918 return 1;
7919
7920 len = strlen (name);
7921
4c4b4cd2
PH
7922 if (!isdigit (name[len - 1]))
7923 return 1;
14f9c5c9 7924
d2e4a39e 7925 if (isdigit (name[len - 2]))
14f9c5c9
AS
7926 align_offset = len - 2;
7927 else
7928 align_offset = len - 1;
7929
61012eef 7930 if (align_offset < 7 || !startswith (name + align_offset - 6, "___XV"))
14f9c5c9
AS
7931 return TARGET_CHAR_BIT;
7932
4c4b4cd2
PH
7933 return atoi (name + align_offset) * TARGET_CHAR_BIT;
7934}
7935
852dff6c 7936/* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
4c4b4cd2 7937
852dff6c
JB
7938static struct symbol *
7939ada_find_any_type_symbol (const char *name)
4c4b4cd2
PH
7940{
7941 struct symbol *sym;
7942
7943 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
4186eb54 7944 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
4c4b4cd2
PH
7945 return sym;
7946
4186eb54
KS
7947 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
7948 return sym;
14f9c5c9
AS
7949}
7950
dddfab26
UW
7951/* Find a type named NAME. Ignores ambiguity. This routine will look
7952 solely for types defined by debug info, it will not search the GDB
7953 primitive types. */
4c4b4cd2 7954
852dff6c 7955static struct type *
ebf56fd3 7956ada_find_any_type (const char *name)
14f9c5c9 7957{
852dff6c 7958 struct symbol *sym = ada_find_any_type_symbol (name);
14f9c5c9 7959
14f9c5c9 7960 if (sym != NULL)
dddfab26 7961 return SYMBOL_TYPE (sym);
14f9c5c9 7962
dddfab26 7963 return NULL;
14f9c5c9
AS
7964}
7965
739593e0
JB
7966/* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7967 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7968 symbol, in which case it is returned. Otherwise, this looks for
7969 symbols whose name is that of NAME_SYM suffixed with "___XR".
7970 Return symbol if found, and NULL otherwise. */
4c4b4cd2
PH
7971
7972struct symbol *
270140bd 7973ada_find_renaming_symbol (struct symbol *name_sym, const struct block *block)
aeb5907d 7974{
739593e0 7975 const char *name = SYMBOL_LINKAGE_NAME (name_sym);
aeb5907d
JB
7976 struct symbol *sym;
7977
739593e0
JB
7978 if (strstr (name, "___XR") != NULL)
7979 return name_sym;
7980
aeb5907d
JB
7981 sym = find_old_style_renaming_symbol (name, block);
7982
7983 if (sym != NULL)
7984 return sym;
7985
0963b4bd 7986 /* Not right yet. FIXME pnh 7/20/2007. */
852dff6c 7987 sym = ada_find_any_type_symbol (name);
aeb5907d
JB
7988 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
7989 return sym;
7990 else
7991 return NULL;
7992}
7993
7994static struct symbol *
270140bd 7995find_old_style_renaming_symbol (const char *name, const struct block *block)
4c4b4cd2 7996{
7f0df278 7997 const struct symbol *function_sym = block_linkage_function (block);
4c4b4cd2
PH
7998 char *rename;
7999
8000 if (function_sym != NULL)
8001 {
8002 /* If the symbol is defined inside a function, NAME is not fully
8003 qualified. This means we need to prepend the function name
8004 as well as adding the ``___XR'' suffix to build the name of
8005 the associated renaming symbol. */
0d5cff50 8006 const char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
529cad9c
PH
8007 /* Function names sometimes contain suffixes used
8008 for instance to qualify nested subprograms. When building
8009 the XR type name, we need to make sure that this suffix is
8010 not included. So do not include any suffix in the function
8011 name length below. */
69fadcdf 8012 int function_name_len = ada_name_prefix_len (function_name);
76a01679
JB
8013 const int rename_len = function_name_len + 2 /* "__" */
8014 + strlen (name) + 6 /* "___XR\0" */ ;
4c4b4cd2 8015
529cad9c 8016 /* Strip the suffix if necessary. */
69fadcdf
JB
8017 ada_remove_trailing_digits (function_name, &function_name_len);
8018 ada_remove_po_subprogram_suffix (function_name, &function_name_len);
8019 ada_remove_Xbn_suffix (function_name, &function_name_len);
529cad9c 8020
4c4b4cd2
PH
8021 /* Library-level functions are a special case, as GNAT adds
8022 a ``_ada_'' prefix to the function name to avoid namespace
aeb5907d 8023 pollution. However, the renaming symbols themselves do not
4c4b4cd2
PH
8024 have this prefix, so we need to skip this prefix if present. */
8025 if (function_name_len > 5 /* "_ada_" */
8026 && strstr (function_name, "_ada_") == function_name)
69fadcdf
JB
8027 {
8028 function_name += 5;
8029 function_name_len -= 5;
8030 }
4c4b4cd2
PH
8031
8032 rename = (char *) alloca (rename_len * sizeof (char));
69fadcdf
JB
8033 strncpy (rename, function_name, function_name_len);
8034 xsnprintf (rename + function_name_len, rename_len - function_name_len,
8035 "__%s___XR", name);
4c4b4cd2
PH
8036 }
8037 else
8038 {
8039 const int rename_len = strlen (name) + 6;
5b4ee69b 8040
4c4b4cd2 8041 rename = (char *) alloca (rename_len * sizeof (char));
88c15c34 8042 xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name);
4c4b4cd2
PH
8043 }
8044
852dff6c 8045 return ada_find_any_type_symbol (rename);
4c4b4cd2
PH
8046}
8047
14f9c5c9 8048/* Because of GNAT encoding conventions, several GDB symbols may match a
4c4b4cd2 8049 given type name. If the type denoted by TYPE0 is to be preferred to
14f9c5c9 8050 that of TYPE1 for purposes of type printing, return non-zero;
4c4b4cd2
PH
8051 otherwise return 0. */
8052
14f9c5c9 8053int
d2e4a39e 8054ada_prefer_type (struct type *type0, struct type *type1)
14f9c5c9
AS
8055{
8056 if (type1 == NULL)
8057 return 1;
8058 else if (type0 == NULL)
8059 return 0;
8060 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
8061 return 1;
8062 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
8063 return 0;
4c4b4cd2
PH
8064 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
8065 return 1;
ad82864c 8066 else if (ada_is_constrained_packed_array_type (type0))
14f9c5c9 8067 return 1;
4c4b4cd2
PH
8068 else if (ada_is_array_descriptor_type (type0)
8069 && !ada_is_array_descriptor_type (type1))
14f9c5c9 8070 return 1;
aeb5907d
JB
8071 else
8072 {
a737d952
TT
8073 const char *type0_name = TYPE_NAME (type0);
8074 const char *type1_name = TYPE_NAME (type1);
aeb5907d
JB
8075
8076 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
8077 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
8078 return 1;
8079 }
14f9c5c9
AS
8080 return 0;
8081}
8082
e86ca25f
TT
8083/* The name of TYPE, which is its TYPE_NAME. Null if TYPE is
8084 null. */
4c4b4cd2 8085
0d5cff50 8086const char *
d2e4a39e 8087ada_type_name (struct type *type)
14f9c5c9 8088{
d2e4a39e 8089 if (type == NULL)
14f9c5c9 8090 return NULL;
e86ca25f 8091 return TYPE_NAME (type);
14f9c5c9
AS
8092}
8093
b4ba55a1
JB
8094/* Search the list of "descriptive" types associated to TYPE for a type
8095 whose name is NAME. */
8096
8097static struct type *
8098find_parallel_type_by_descriptive_type (struct type *type, const char *name)
8099{
931e5bc3 8100 struct type *result, *tmp;
b4ba55a1 8101
c6044dd1
JB
8102 if (ada_ignore_descriptive_types_p)
8103 return NULL;
8104
b4ba55a1
JB
8105 /* If there no descriptive-type info, then there is no parallel type
8106 to be found. */
8107 if (!HAVE_GNAT_AUX_INFO (type))
8108 return NULL;
8109
8110 result = TYPE_DESCRIPTIVE_TYPE (type);
8111 while (result != NULL)
8112 {
0d5cff50 8113 const char *result_name = ada_type_name (result);
b4ba55a1
JB
8114
8115 if (result_name == NULL)
8116 {
8117 warning (_("unexpected null name on descriptive type"));
8118 return NULL;
8119 }
8120
8121 /* If the names match, stop. */
8122 if (strcmp (result_name, name) == 0)
8123 break;
8124
8125 /* Otherwise, look at the next item on the list, if any. */
8126 if (HAVE_GNAT_AUX_INFO (result))
931e5bc3
JG
8127 tmp = TYPE_DESCRIPTIVE_TYPE (result);
8128 else
8129 tmp = NULL;
8130
8131 /* If not found either, try after having resolved the typedef. */
8132 if (tmp != NULL)
8133 result = tmp;
b4ba55a1 8134 else
931e5bc3 8135 {
f168693b 8136 result = check_typedef (result);
931e5bc3
JG
8137 if (HAVE_GNAT_AUX_INFO (result))
8138 result = TYPE_DESCRIPTIVE_TYPE (result);
8139 else
8140 result = NULL;
8141 }
b4ba55a1
JB
8142 }
8143
8144 /* If we didn't find a match, see whether this is a packed array. With
8145 older compilers, the descriptive type information is either absent or
8146 irrelevant when it comes to packed arrays so the above lookup fails.
8147 Fall back to using a parallel lookup by name in this case. */
12ab9e09 8148 if (result == NULL && ada_is_constrained_packed_array_type (type))
b4ba55a1
JB
8149 return ada_find_any_type (name);
8150
8151 return result;
8152}
8153
8154/* Find a parallel type to TYPE with the specified NAME, using the
8155 descriptive type taken from the debugging information, if available,
8156 and otherwise using the (slower) name-based method. */
8157
8158static struct type *
8159ada_find_parallel_type_with_name (struct type *type, const char *name)
8160{
8161 struct type *result = NULL;
8162
8163 if (HAVE_GNAT_AUX_INFO (type))
8164 result = find_parallel_type_by_descriptive_type (type, name);
8165 else
8166 result = ada_find_any_type (name);
8167
8168 return result;
8169}
8170
8171/* Same as above, but specify the name of the parallel type by appending
4c4b4cd2 8172 SUFFIX to the name of TYPE. */
14f9c5c9 8173
d2e4a39e 8174struct type *
ebf56fd3 8175ada_find_parallel_type (struct type *type, const char *suffix)
14f9c5c9 8176{
0d5cff50 8177 char *name;
fe978cb0 8178 const char *type_name = ada_type_name (type);
14f9c5c9 8179 int len;
d2e4a39e 8180
fe978cb0 8181 if (type_name == NULL)
14f9c5c9
AS
8182 return NULL;
8183
fe978cb0 8184 len = strlen (type_name);
14f9c5c9 8185
b4ba55a1 8186 name = (char *) alloca (len + strlen (suffix) + 1);
14f9c5c9 8187
fe978cb0 8188 strcpy (name, type_name);
14f9c5c9
AS
8189 strcpy (name + len, suffix);
8190
b4ba55a1 8191 return ada_find_parallel_type_with_name (type, name);
14f9c5c9
AS
8192}
8193
14f9c5c9 8194/* If TYPE is a variable-size record type, return the corresponding template
4c4b4cd2 8195 type describing its fields. Otherwise, return NULL. */
14f9c5c9 8196
d2e4a39e
AS
8197static struct type *
8198dynamic_template_type (struct type *type)
14f9c5c9 8199{
61ee279c 8200 type = ada_check_typedef (type);
14f9c5c9
AS
8201
8202 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
d2e4a39e 8203 || ada_type_name (type) == NULL)
14f9c5c9 8204 return NULL;
d2e4a39e 8205 else
14f9c5c9
AS
8206 {
8207 int len = strlen (ada_type_name (type));
5b4ee69b 8208
4c4b4cd2
PH
8209 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
8210 return type;
14f9c5c9 8211 else
4c4b4cd2 8212 return ada_find_parallel_type (type, "___XVE");
14f9c5c9
AS
8213 }
8214}
8215
8216/* Assuming that TEMPL_TYPE is a union or struct type, returns
4c4b4cd2 8217 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
14f9c5c9 8218
d2e4a39e
AS
8219static int
8220is_dynamic_field (struct type *templ_type, int field_num)
14f9c5c9
AS
8221{
8222 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
5b4ee69b 8223
d2e4a39e 8224 return name != NULL
14f9c5c9
AS
8225 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
8226 && strstr (name, "___XVL") != NULL;
8227}
8228
4c4b4cd2
PH
8229/* The index of the variant field of TYPE, or -1 if TYPE does not
8230 represent a variant record type. */
14f9c5c9 8231
d2e4a39e 8232static int
4c4b4cd2 8233variant_field_index (struct type *type)
14f9c5c9
AS
8234{
8235 int f;
8236
4c4b4cd2
PH
8237 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
8238 return -1;
8239
8240 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
8241 {
8242 if (ada_is_variant_part (type, f))
8243 return f;
8244 }
8245 return -1;
14f9c5c9
AS
8246}
8247
4c4b4cd2
PH
8248/* A record type with no fields. */
8249
d2e4a39e 8250static struct type *
fe978cb0 8251empty_record (struct type *templ)
14f9c5c9 8252{
fe978cb0 8253 struct type *type = alloc_type_copy (templ);
5b4ee69b 8254
14f9c5c9
AS
8255 TYPE_CODE (type) = TYPE_CODE_STRUCT;
8256 TYPE_NFIELDS (type) = 0;
8257 TYPE_FIELDS (type) = NULL;
b1f33ddd 8258 INIT_CPLUS_SPECIFIC (type);
14f9c5c9 8259 TYPE_NAME (type) = "<empty>";
14f9c5c9
AS
8260 TYPE_LENGTH (type) = 0;
8261 return type;
8262}
8263
8264/* An ordinary record type (with fixed-length fields) that describes
4c4b4cd2
PH
8265 the value of type TYPE at VALADDR or ADDRESS (see comments at
8266 the beginning of this section) VAL according to GNAT conventions.
8267 DVAL0 should describe the (portion of a) record that contains any
df407dfe 8268 necessary discriminants. It should be NULL if value_type (VAL) is
14f9c5c9
AS
8269 an outer-level type (i.e., as opposed to a branch of a variant.) A
8270 variant field (unless unchecked) is replaced by a particular branch
4c4b4cd2 8271 of the variant.
14f9c5c9 8272
4c4b4cd2
PH
8273 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
8274 length are not statically known are discarded. As a consequence,
8275 VALADDR, ADDRESS and DVAL0 are ignored.
8276
8277 NOTE: Limitations: For now, we assume that dynamic fields and
8278 variants occupy whole numbers of bytes. However, they need not be
8279 byte-aligned. */
8280
8281struct type *
10a2c479 8282ada_template_to_fixed_record_type_1 (struct type *type,
fc1a4b47 8283 const gdb_byte *valaddr,
4c4b4cd2
PH
8284 CORE_ADDR address, struct value *dval0,
8285 int keep_dynamic_fields)
14f9c5c9 8286{
d2e4a39e
AS
8287 struct value *mark = value_mark ();
8288 struct value *dval;
8289 struct type *rtype;
14f9c5c9 8290 int nfields, bit_len;
4c4b4cd2 8291 int variant_field;
14f9c5c9 8292 long off;
d94e4f4f 8293 int fld_bit_len;
14f9c5c9
AS
8294 int f;
8295
4c4b4cd2
PH
8296 /* Compute the number of fields in this record type that are going
8297 to be processed: unless keep_dynamic_fields, this includes only
8298 fields whose position and length are static will be processed. */
8299 if (keep_dynamic_fields)
8300 nfields = TYPE_NFIELDS (type);
8301 else
8302 {
8303 nfields = 0;
76a01679 8304 while (nfields < TYPE_NFIELDS (type)
4c4b4cd2
PH
8305 && !ada_is_variant_part (type, nfields)
8306 && !is_dynamic_field (type, nfields))
8307 nfields++;
8308 }
8309
e9bb382b 8310 rtype = alloc_type_copy (type);
14f9c5c9
AS
8311 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
8312 INIT_CPLUS_SPECIFIC (rtype);
8313 TYPE_NFIELDS (rtype) = nfields;
d2e4a39e 8314 TYPE_FIELDS (rtype) = (struct field *)
14f9c5c9
AS
8315 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
8316 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
8317 TYPE_NAME (rtype) = ada_type_name (type);
876cecd0 8318 TYPE_FIXED_INSTANCE (rtype) = 1;
14f9c5c9 8319
d2e4a39e
AS
8320 off = 0;
8321 bit_len = 0;
4c4b4cd2
PH
8322 variant_field = -1;
8323
14f9c5c9
AS
8324 for (f = 0; f < nfields; f += 1)
8325 {
6c038f32
PH
8326 off = align_value (off, field_alignment (type, f))
8327 + TYPE_FIELD_BITPOS (type, f);
945b3a32 8328 SET_FIELD_BITPOS (TYPE_FIELD (rtype, f), off);
d2e4a39e 8329 TYPE_FIELD_BITSIZE (rtype, f) = 0;
14f9c5c9 8330
d2e4a39e 8331 if (ada_is_variant_part (type, f))
4c4b4cd2
PH
8332 {
8333 variant_field = f;
d94e4f4f 8334 fld_bit_len = 0;
4c4b4cd2 8335 }
14f9c5c9 8336 else if (is_dynamic_field (type, f))
4c4b4cd2 8337 {
284614f0
JB
8338 const gdb_byte *field_valaddr = valaddr;
8339 CORE_ADDR field_address = address;
8340 struct type *field_type =
8341 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f));
8342
4c4b4cd2 8343 if (dval0 == NULL)
b5304971
JG
8344 {
8345 /* rtype's length is computed based on the run-time
8346 value of discriminants. If the discriminants are not
8347 initialized, the type size may be completely bogus and
0963b4bd 8348 GDB may fail to allocate a value for it. So check the
b5304971 8349 size first before creating the value. */
c1b5a1a6 8350 ada_ensure_varsize_limit (rtype);
012370f6
TT
8351 /* Using plain value_from_contents_and_address here
8352 causes problems because we will end up trying to
8353 resolve a type that is currently being
8354 constructed. */
8355 dval = value_from_contents_and_address_unresolved (rtype,
8356 valaddr,
8357 address);
9f1f738a 8358 rtype = value_type (dval);
b5304971 8359 }
4c4b4cd2
PH
8360 else
8361 dval = dval0;
8362
284614f0
JB
8363 /* If the type referenced by this field is an aligner type, we need
8364 to unwrap that aligner type, because its size might not be set.
8365 Keeping the aligner type would cause us to compute the wrong
8366 size for this field, impacting the offset of the all the fields
8367 that follow this one. */
8368 if (ada_is_aligner_type (field_type))
8369 {
8370 long field_offset = TYPE_FIELD_BITPOS (field_type, f);
8371
8372 field_valaddr = cond_offset_host (field_valaddr, field_offset);
8373 field_address = cond_offset_target (field_address, field_offset);
8374 field_type = ada_aligned_type (field_type);
8375 }
8376
8377 field_valaddr = cond_offset_host (field_valaddr,
8378 off / TARGET_CHAR_BIT);
8379 field_address = cond_offset_target (field_address,
8380 off / TARGET_CHAR_BIT);
8381
8382 /* Get the fixed type of the field. Note that, in this case,
8383 we do not want to get the real type out of the tag: if
8384 the current field is the parent part of a tagged record,
8385 we will get the tag of the object. Clearly wrong: the real
8386 type of the parent is not the real type of the child. We
8387 would end up in an infinite loop. */
8388 field_type = ada_get_base_type (field_type);
8389 field_type = ada_to_fixed_type (field_type, field_valaddr,
8390 field_address, dval, 0);
27f2a97b
JB
8391 /* If the field size is already larger than the maximum
8392 object size, then the record itself will necessarily
8393 be larger than the maximum object size. We need to make
8394 this check now, because the size might be so ridiculously
8395 large (due to an uninitialized variable in the inferior)
8396 that it would cause an overflow when adding it to the
8397 record size. */
c1b5a1a6 8398 ada_ensure_varsize_limit (field_type);
284614f0
JB
8399
8400 TYPE_FIELD_TYPE (rtype, f) = field_type;
4c4b4cd2 8401 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
27f2a97b
JB
8402 /* The multiplication can potentially overflow. But because
8403 the field length has been size-checked just above, and
8404 assuming that the maximum size is a reasonable value,
8405 an overflow should not happen in practice. So rather than
8406 adding overflow recovery code to this already complex code,
8407 we just assume that it's not going to happen. */
d94e4f4f 8408 fld_bit_len =
4c4b4cd2
PH
8409 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
8410 }
14f9c5c9 8411 else
4c4b4cd2 8412 {
5ded5331
JB
8413 /* Note: If this field's type is a typedef, it is important
8414 to preserve the typedef layer.
8415
8416 Otherwise, we might be transforming a typedef to a fat
8417 pointer (encoding a pointer to an unconstrained array),
8418 into a basic fat pointer (encoding an unconstrained
8419 array). As both types are implemented using the same
8420 structure, the typedef is the only clue which allows us
8421 to distinguish between the two options. Stripping it
8422 would prevent us from printing this field appropriately. */
8423 TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
4c4b4cd2
PH
8424 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
8425 if (TYPE_FIELD_BITSIZE (type, f) > 0)
d94e4f4f 8426 fld_bit_len =
4c4b4cd2
PH
8427 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
8428 else
5ded5331
JB
8429 {
8430 struct type *field_type = TYPE_FIELD_TYPE (type, f);
8431
8432 /* We need to be careful of typedefs when computing
8433 the length of our field. If this is a typedef,
8434 get the length of the target type, not the length
8435 of the typedef. */
8436 if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF)
8437 field_type = ada_typedef_target_type (field_type);
8438
8439 fld_bit_len =
8440 TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT;
8441 }
4c4b4cd2 8442 }
14f9c5c9 8443 if (off + fld_bit_len > bit_len)
4c4b4cd2 8444 bit_len = off + fld_bit_len;
d94e4f4f 8445 off += fld_bit_len;
4c4b4cd2
PH
8446 TYPE_LENGTH (rtype) =
8447 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
14f9c5c9 8448 }
4c4b4cd2
PH
8449
8450 /* We handle the variant part, if any, at the end because of certain
b1f33ddd 8451 odd cases in which it is re-ordered so as NOT to be the last field of
4c4b4cd2
PH
8452 the record. This can happen in the presence of representation
8453 clauses. */
8454 if (variant_field >= 0)
8455 {
8456 struct type *branch_type;
8457
8458 off = TYPE_FIELD_BITPOS (rtype, variant_field);
8459
8460 if (dval0 == NULL)
9f1f738a 8461 {
012370f6
TT
8462 /* Using plain value_from_contents_and_address here causes
8463 problems because we will end up trying to resolve a type
8464 that is currently being constructed. */
8465 dval = value_from_contents_and_address_unresolved (rtype, valaddr,
8466 address);
9f1f738a
SA
8467 rtype = value_type (dval);
8468 }
4c4b4cd2
PH
8469 else
8470 dval = dval0;
8471
8472 branch_type =
8473 to_fixed_variant_branch_type
8474 (TYPE_FIELD_TYPE (type, variant_field),
8475 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
8476 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
8477 if (branch_type == NULL)
8478 {
8479 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
8480 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
8481 TYPE_NFIELDS (rtype) -= 1;
8482 }
8483 else
8484 {
8485 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
8486 TYPE_FIELD_NAME (rtype, variant_field) = "S";
8487 fld_bit_len =
8488 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
8489 TARGET_CHAR_BIT;
8490 if (off + fld_bit_len > bit_len)
8491 bit_len = off + fld_bit_len;
8492 TYPE_LENGTH (rtype) =
8493 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
8494 }
8495 }
8496
714e53ab
PH
8497 /* According to exp_dbug.ads, the size of TYPE for variable-size records
8498 should contain the alignment of that record, which should be a strictly
8499 positive value. If null or negative, then something is wrong, most
8500 probably in the debug info. In that case, we don't round up the size
0963b4bd 8501 of the resulting type. If this record is not part of another structure,
714e53ab
PH
8502 the current RTYPE length might be good enough for our purposes. */
8503 if (TYPE_LENGTH (type) <= 0)
8504 {
323e0a4a 8505 if (TYPE_NAME (rtype))
cc1defb1
KS
8506 warning (_("Invalid type size for `%s' detected: %s."),
8507 TYPE_NAME (rtype), pulongest (TYPE_LENGTH (type)));
323e0a4a 8508 else
cc1defb1
KS
8509 warning (_("Invalid type size for <unnamed> detected: %s."),
8510 pulongest (TYPE_LENGTH (type)));
714e53ab
PH
8511 }
8512 else
8513 {
8514 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
8515 TYPE_LENGTH (type));
8516 }
14f9c5c9
AS
8517
8518 value_free_to_mark (mark);
d2e4a39e 8519 if (TYPE_LENGTH (rtype) > varsize_limit)
323e0a4a 8520 error (_("record type with dynamic size is larger than varsize-limit"));
14f9c5c9
AS
8521 return rtype;
8522}
8523
4c4b4cd2
PH
8524/* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
8525 of 1. */
14f9c5c9 8526
d2e4a39e 8527static struct type *
fc1a4b47 8528template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
4c4b4cd2
PH
8529 CORE_ADDR address, struct value *dval0)
8530{
8531 return ada_template_to_fixed_record_type_1 (type, valaddr,
8532 address, dval0, 1);
8533}
8534
8535/* An ordinary record type in which ___XVL-convention fields and
8536 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
8537 static approximations, containing all possible fields. Uses
8538 no runtime values. Useless for use in values, but that's OK,
8539 since the results are used only for type determinations. Works on both
8540 structs and unions. Representation note: to save space, we memorize
8541 the result of this function in the TYPE_TARGET_TYPE of the
8542 template type. */
8543
8544static struct type *
8545template_to_static_fixed_type (struct type *type0)
14f9c5c9
AS
8546{
8547 struct type *type;
8548 int nfields;
8549 int f;
8550
9e195661
PMR
8551 /* No need no do anything if the input type is already fixed. */
8552 if (TYPE_FIXED_INSTANCE (type0))
8553 return type0;
8554
8555 /* Likewise if we already have computed the static approximation. */
4c4b4cd2
PH
8556 if (TYPE_TARGET_TYPE (type0) != NULL)
8557 return TYPE_TARGET_TYPE (type0);
8558
9e195661 8559 /* Don't clone TYPE0 until we are sure we are going to need a copy. */
4c4b4cd2 8560 type = type0;
9e195661
PMR
8561 nfields = TYPE_NFIELDS (type0);
8562
8563 /* Whether or not we cloned TYPE0, cache the result so that we don't do
8564 recompute all over next time. */
8565 TYPE_TARGET_TYPE (type0) = type;
14f9c5c9
AS
8566
8567 for (f = 0; f < nfields; f += 1)
8568 {
460efde1 8569 struct type *field_type = TYPE_FIELD_TYPE (type0, f);
4c4b4cd2 8570 struct type *new_type;
14f9c5c9 8571
4c4b4cd2 8572 if (is_dynamic_field (type0, f))
460efde1
JB
8573 {
8574 field_type = ada_check_typedef (field_type);
8575 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
8576 }
14f9c5c9 8577 else
f192137b 8578 new_type = static_unwrap_type (field_type);
9e195661
PMR
8579
8580 if (new_type != field_type)
8581 {
8582 /* Clone TYPE0 only the first time we get a new field type. */
8583 if (type == type0)
8584 {
8585 TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0);
8586 TYPE_CODE (type) = TYPE_CODE (type0);
8587 INIT_CPLUS_SPECIFIC (type);
8588 TYPE_NFIELDS (type) = nfields;
8589 TYPE_FIELDS (type) = (struct field *)
8590 TYPE_ALLOC (type, nfields * sizeof (struct field));
8591 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
8592 sizeof (struct field) * nfields);
8593 TYPE_NAME (type) = ada_type_name (type0);
9e195661
PMR
8594 TYPE_FIXED_INSTANCE (type) = 1;
8595 TYPE_LENGTH (type) = 0;
8596 }
8597 TYPE_FIELD_TYPE (type, f) = new_type;
8598 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
8599 }
14f9c5c9 8600 }
9e195661 8601
14f9c5c9
AS
8602 return type;
8603}
8604
4c4b4cd2 8605/* Given an object of type TYPE whose contents are at VALADDR and
5823c3ef
JB
8606 whose address in memory is ADDRESS, returns a revision of TYPE,
8607 which should be a non-dynamic-sized record, in which the variant
8608 part, if any, is replaced with the appropriate branch. Looks
4c4b4cd2
PH
8609 for discriminant values in DVAL0, which can be NULL if the record
8610 contains the necessary discriminant values. */
8611
d2e4a39e 8612static struct type *
fc1a4b47 8613to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
4c4b4cd2 8614 CORE_ADDR address, struct value *dval0)
14f9c5c9 8615{
d2e4a39e 8616 struct value *mark = value_mark ();
4c4b4cd2 8617 struct value *dval;
d2e4a39e 8618 struct type *rtype;
14f9c5c9
AS
8619 struct type *branch_type;
8620 int nfields = TYPE_NFIELDS (type);
4c4b4cd2 8621 int variant_field = variant_field_index (type);
14f9c5c9 8622
4c4b4cd2 8623 if (variant_field == -1)
14f9c5c9
AS
8624 return type;
8625
4c4b4cd2 8626 if (dval0 == NULL)
9f1f738a
SA
8627 {
8628 dval = value_from_contents_and_address (type, valaddr, address);
8629 type = value_type (dval);
8630 }
4c4b4cd2
PH
8631 else
8632 dval = dval0;
8633
e9bb382b 8634 rtype = alloc_type_copy (type);
14f9c5c9 8635 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
4c4b4cd2
PH
8636 INIT_CPLUS_SPECIFIC (rtype);
8637 TYPE_NFIELDS (rtype) = nfields;
d2e4a39e
AS
8638 TYPE_FIELDS (rtype) =
8639 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
8640 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
4c4b4cd2 8641 sizeof (struct field) * nfields);
14f9c5c9 8642 TYPE_NAME (rtype) = ada_type_name (type);
876cecd0 8643 TYPE_FIXED_INSTANCE (rtype) = 1;
14f9c5c9
AS
8644 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
8645
4c4b4cd2
PH
8646 branch_type = to_fixed_variant_branch_type
8647 (TYPE_FIELD_TYPE (type, variant_field),
d2e4a39e 8648 cond_offset_host (valaddr,
4c4b4cd2
PH
8649 TYPE_FIELD_BITPOS (type, variant_field)
8650 / TARGET_CHAR_BIT),
d2e4a39e 8651 cond_offset_target (address,
4c4b4cd2
PH
8652 TYPE_FIELD_BITPOS (type, variant_field)
8653 / TARGET_CHAR_BIT), dval);
d2e4a39e 8654 if (branch_type == NULL)
14f9c5c9 8655 {
4c4b4cd2 8656 int f;
5b4ee69b 8657
4c4b4cd2
PH
8658 for (f = variant_field + 1; f < nfields; f += 1)
8659 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
14f9c5c9 8660 TYPE_NFIELDS (rtype) -= 1;
14f9c5c9
AS
8661 }
8662 else
8663 {
4c4b4cd2
PH
8664 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
8665 TYPE_FIELD_NAME (rtype, variant_field) = "S";
8666 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
14f9c5c9 8667 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
14f9c5c9 8668 }
4c4b4cd2 8669 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
d2e4a39e 8670
4c4b4cd2 8671 value_free_to_mark (mark);
14f9c5c9
AS
8672 return rtype;
8673}
8674
8675/* An ordinary record type (with fixed-length fields) that describes
8676 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
8677 beginning of this section]. Any necessary discriminants' values
4c4b4cd2
PH
8678 should be in DVAL, a record value; it may be NULL if the object
8679 at ADDR itself contains any necessary discriminant values.
8680 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
8681 values from the record are needed. Except in the case that DVAL,
8682 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
8683 unchecked) is replaced by a particular branch of the variant.
8684
8685 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
8686 is questionable and may be removed. It can arise during the
8687 processing of an unconstrained-array-of-record type where all the
8688 variant branches have exactly the same size. This is because in
8689 such cases, the compiler does not bother to use the XVS convention
8690 when encoding the record. I am currently dubious of this
8691 shortcut and suspect the compiler should be altered. FIXME. */
14f9c5c9 8692
d2e4a39e 8693static struct type *
fc1a4b47 8694to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
4c4b4cd2 8695 CORE_ADDR address, struct value *dval)
14f9c5c9 8696{
d2e4a39e 8697 struct type *templ_type;
14f9c5c9 8698
876cecd0 8699 if (TYPE_FIXED_INSTANCE (type0))
4c4b4cd2
PH
8700 return type0;
8701
d2e4a39e 8702 templ_type = dynamic_template_type (type0);
14f9c5c9
AS
8703
8704 if (templ_type != NULL)
8705 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
4c4b4cd2
PH
8706 else if (variant_field_index (type0) >= 0)
8707 {
8708 if (dval == NULL && valaddr == NULL && address == 0)
8709 return type0;
8710 return to_record_with_fixed_variant_part (type0, valaddr, address,
8711 dval);
8712 }
14f9c5c9
AS
8713 else
8714 {
876cecd0 8715 TYPE_FIXED_INSTANCE (type0) = 1;
14f9c5c9
AS
8716 return type0;
8717 }
8718
8719}
8720
8721/* An ordinary record type (with fixed-length fields) that describes
8722 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
8723 union type. Any necessary discriminants' values should be in DVAL,
8724 a record value. That is, this routine selects the appropriate
8725 branch of the union at ADDR according to the discriminant value
b1f33ddd 8726 indicated in the union's type name. Returns VAR_TYPE0 itself if
0963b4bd 8727 it represents a variant subject to a pragma Unchecked_Union. */
14f9c5c9 8728
d2e4a39e 8729static struct type *
fc1a4b47 8730to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
4c4b4cd2 8731 CORE_ADDR address, struct value *dval)
14f9c5c9
AS
8732{
8733 int which;
d2e4a39e
AS
8734 struct type *templ_type;
8735 struct type *var_type;
14f9c5c9
AS
8736
8737 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
8738 var_type = TYPE_TARGET_TYPE (var_type0);
d2e4a39e 8739 else
14f9c5c9
AS
8740 var_type = var_type0;
8741
8742 templ_type = ada_find_parallel_type (var_type, "___XVU");
8743
8744 if (templ_type != NULL)
8745 var_type = templ_type;
8746
b1f33ddd
JB
8747 if (is_unchecked_variant (var_type, value_type (dval)))
8748 return var_type0;
d2e4a39e
AS
8749 which =
8750 ada_which_variant_applies (var_type,
0fd88904 8751 value_type (dval), value_contents (dval));
14f9c5c9
AS
8752
8753 if (which < 0)
e9bb382b 8754 return empty_record (var_type);
14f9c5c9 8755 else if (is_dynamic_field (var_type, which))
4c4b4cd2 8756 return to_fixed_record_type
d2e4a39e
AS
8757 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
8758 valaddr, address, dval);
4c4b4cd2 8759 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
d2e4a39e
AS
8760 return
8761 to_fixed_record_type
8762 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
14f9c5c9
AS
8763 else
8764 return TYPE_FIELD_TYPE (var_type, which);
8765}
8766
8908fca5
JB
8767/* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if
8768 ENCODING_TYPE, a type following the GNAT conventions for discrete
8769 type encodings, only carries redundant information. */
8770
8771static int
8772ada_is_redundant_range_encoding (struct type *range_type,
8773 struct type *encoding_type)
8774{
108d56a4 8775 const char *bounds_str;
8908fca5
JB
8776 int n;
8777 LONGEST lo, hi;
8778
8779 gdb_assert (TYPE_CODE (range_type) == TYPE_CODE_RANGE);
8780
005e2509
JB
8781 if (TYPE_CODE (get_base_type (range_type))
8782 != TYPE_CODE (get_base_type (encoding_type)))
8783 {
8784 /* The compiler probably used a simple base type to describe
8785 the range type instead of the range's actual base type,
8786 expecting us to get the real base type from the encoding
8787 anyway. In this situation, the encoding cannot be ignored
8788 as redundant. */
8789 return 0;
8790 }
8791
8908fca5
JB
8792 if (is_dynamic_type (range_type))
8793 return 0;
8794
8795 if (TYPE_NAME (encoding_type) == NULL)
8796 return 0;
8797
8798 bounds_str = strstr (TYPE_NAME (encoding_type), "___XDLU_");
8799 if (bounds_str == NULL)
8800 return 0;
8801
8802 n = 8; /* Skip "___XDLU_". */
8803 if (!ada_scan_number (bounds_str, n, &lo, &n))
8804 return 0;
8805 if (TYPE_LOW_BOUND (range_type) != lo)
8806 return 0;
8807
8808 n += 2; /* Skip the "__" separator between the two bounds. */
8809 if (!ada_scan_number (bounds_str, n, &hi, &n))
8810 return 0;
8811 if (TYPE_HIGH_BOUND (range_type) != hi)
8812 return 0;
8813
8814 return 1;
8815}
8816
8817/* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE,
8818 a type following the GNAT encoding for describing array type
8819 indices, only carries redundant information. */
8820
8821static int
8822ada_is_redundant_index_type_desc (struct type *array_type,
8823 struct type *desc_type)
8824{
8825 struct type *this_layer = check_typedef (array_type);
8826 int i;
8827
8828 for (i = 0; i < TYPE_NFIELDS (desc_type); i++)
8829 {
8830 if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer),
8831 TYPE_FIELD_TYPE (desc_type, i)))
8832 return 0;
8833 this_layer = check_typedef (TYPE_TARGET_TYPE (this_layer));
8834 }
8835
8836 return 1;
8837}
8838
14f9c5c9
AS
8839/* Assuming that TYPE0 is an array type describing the type of a value
8840 at ADDR, and that DVAL describes a record containing any
8841 discriminants used in TYPE0, returns a type for the value that
8842 contains no dynamic components (that is, no components whose sizes
8843 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
8844 true, gives an error message if the resulting type's size is over
4c4b4cd2 8845 varsize_limit. */
14f9c5c9 8846
d2e4a39e
AS
8847static struct type *
8848to_fixed_array_type (struct type *type0, struct value *dval,
4c4b4cd2 8849 int ignore_too_big)
14f9c5c9 8850{
d2e4a39e
AS
8851 struct type *index_type_desc;
8852 struct type *result;
ad82864c 8853 int constrained_packed_array_p;
931e5bc3 8854 static const char *xa_suffix = "___XA";
14f9c5c9 8855
b0dd7688 8856 type0 = ada_check_typedef (type0);
284614f0 8857 if (TYPE_FIXED_INSTANCE (type0))
4c4b4cd2 8858 return type0;
14f9c5c9 8859
ad82864c
JB
8860 constrained_packed_array_p = ada_is_constrained_packed_array_type (type0);
8861 if (constrained_packed_array_p)
8862 type0 = decode_constrained_packed_array_type (type0);
284614f0 8863
931e5bc3
JG
8864 index_type_desc = ada_find_parallel_type (type0, xa_suffix);
8865
8866 /* As mentioned in exp_dbug.ads, for non bit-packed arrays an
8867 encoding suffixed with 'P' may still be generated. If so,
8868 it should be used to find the XA type. */
8869
8870 if (index_type_desc == NULL)
8871 {
1da0522e 8872 const char *type_name = ada_type_name (type0);
931e5bc3 8873
1da0522e 8874 if (type_name != NULL)
931e5bc3 8875 {
1da0522e 8876 const int len = strlen (type_name);
931e5bc3
JG
8877 char *name = (char *) alloca (len + strlen (xa_suffix));
8878
1da0522e 8879 if (type_name[len - 1] == 'P')
931e5bc3 8880 {
1da0522e 8881 strcpy (name, type_name);
931e5bc3
JG
8882 strcpy (name + len - 1, xa_suffix);
8883 index_type_desc = ada_find_parallel_type_with_name (type0, name);
8884 }
8885 }
8886 }
8887
28c85d6c 8888 ada_fixup_array_indexes_type (index_type_desc);
8908fca5
JB
8889 if (index_type_desc != NULL
8890 && ada_is_redundant_index_type_desc (type0, index_type_desc))
8891 {
8892 /* Ignore this ___XA parallel type, as it does not bring any
8893 useful information. This allows us to avoid creating fixed
8894 versions of the array's index types, which would be identical
8895 to the original ones. This, in turn, can also help avoid
8896 the creation of fixed versions of the array itself. */
8897 index_type_desc = NULL;
8898 }
8899
14f9c5c9
AS
8900 if (index_type_desc == NULL)
8901 {
61ee279c 8902 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
5b4ee69b 8903
14f9c5c9 8904 /* NOTE: elt_type---the fixed version of elt_type0---should never
4c4b4cd2
PH
8905 depend on the contents of the array in properly constructed
8906 debugging data. */
529cad9c
PH
8907 /* Create a fixed version of the array element type.
8908 We're not providing the address of an element here,
e1d5a0d2 8909 and thus the actual object value cannot be inspected to do
529cad9c
PH
8910 the conversion. This should not be a problem, since arrays of
8911 unconstrained objects are not allowed. In particular, all
8912 the elements of an array of a tagged type should all be of
8913 the same type specified in the debugging info. No need to
8914 consult the object tag. */
1ed6ede0 8915 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
14f9c5c9 8916
284614f0
JB
8917 /* Make sure we always create a new array type when dealing with
8918 packed array types, since we're going to fix-up the array
8919 type length and element bitsize a little further down. */
ad82864c 8920 if (elt_type0 == elt_type && !constrained_packed_array_p)
4c4b4cd2 8921 result = type0;
14f9c5c9 8922 else
e9bb382b 8923 result = create_array_type (alloc_type_copy (type0),
4c4b4cd2 8924 elt_type, TYPE_INDEX_TYPE (type0));
14f9c5c9
AS
8925 }
8926 else
8927 {
8928 int i;
8929 struct type *elt_type0;
8930
8931 elt_type0 = type0;
8932 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
4c4b4cd2 8933 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
14f9c5c9
AS
8934
8935 /* NOTE: result---the fixed version of elt_type0---should never
4c4b4cd2
PH
8936 depend on the contents of the array in properly constructed
8937 debugging data. */
529cad9c
PH
8938 /* Create a fixed version of the array element type.
8939 We're not providing the address of an element here,
e1d5a0d2 8940 and thus the actual object value cannot be inspected to do
529cad9c
PH
8941 the conversion. This should not be a problem, since arrays of
8942 unconstrained objects are not allowed. In particular, all
8943 the elements of an array of a tagged type should all be of
8944 the same type specified in the debugging info. No need to
8945 consult the object tag. */
1ed6ede0
JB
8946 result =
8947 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
1ce677a4
UW
8948
8949 elt_type0 = type0;
14f9c5c9 8950 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
4c4b4cd2
PH
8951 {
8952 struct type *range_type =
28c85d6c 8953 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval);
5b4ee69b 8954
e9bb382b 8955 result = create_array_type (alloc_type_copy (elt_type0),
4c4b4cd2 8956 result, range_type);
1ce677a4 8957 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
4c4b4cd2 8958 }
d2e4a39e 8959 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
323e0a4a 8960 error (_("array type with dynamic size is larger than varsize-limit"));
14f9c5c9
AS
8961 }
8962
2e6fda7d
JB
8963 /* We want to preserve the type name. This can be useful when
8964 trying to get the type name of a value that has already been
8965 printed (for instance, if the user did "print VAR; whatis $". */
8966 TYPE_NAME (result) = TYPE_NAME (type0);
8967
ad82864c 8968 if (constrained_packed_array_p)
284614f0
JB
8969 {
8970 /* So far, the resulting type has been created as if the original
8971 type was a regular (non-packed) array type. As a result, the
8972 bitsize of the array elements needs to be set again, and the array
8973 length needs to be recomputed based on that bitsize. */
8974 int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result));
8975 int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0);
8976
8977 TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0);
8978 TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT;
8979 if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize)
8980 TYPE_LENGTH (result)++;
8981 }
8982
876cecd0 8983 TYPE_FIXED_INSTANCE (result) = 1;
14f9c5c9 8984 return result;
d2e4a39e 8985}
14f9c5c9
AS
8986
8987
8988/* A standard type (containing no dynamically sized components)
8989 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
8990 DVAL describes a record containing any discriminants used in TYPE0,
4c4b4cd2 8991 and may be NULL if there are none, or if the object of type TYPE at
529cad9c
PH
8992 ADDRESS or in VALADDR contains these discriminants.
8993
1ed6ede0
JB
8994 If CHECK_TAG is not null, in the case of tagged types, this function
8995 attempts to locate the object's tag and use it to compute the actual
8996 type. However, when ADDRESS is null, we cannot use it to determine the
8997 location of the tag, and therefore compute the tagged type's actual type.
8998 So we return the tagged type without consulting the tag. */
529cad9c 8999
f192137b
JB
9000static struct type *
9001ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
1ed6ede0 9002 CORE_ADDR address, struct value *dval, int check_tag)
14f9c5c9 9003{
61ee279c 9004 type = ada_check_typedef (type);
d2e4a39e
AS
9005 switch (TYPE_CODE (type))
9006 {
9007 default:
14f9c5c9 9008 return type;
d2e4a39e 9009 case TYPE_CODE_STRUCT:
4c4b4cd2 9010 {
76a01679 9011 struct type *static_type = to_static_fixed_type (type);
1ed6ede0
JB
9012 struct type *fixed_record_type =
9013 to_fixed_record_type (type, valaddr, address, NULL);
5b4ee69b 9014
529cad9c
PH
9015 /* If STATIC_TYPE is a tagged type and we know the object's address,
9016 then we can determine its tag, and compute the object's actual
0963b4bd 9017 type from there. Note that we have to use the fixed record
1ed6ede0
JB
9018 type (the parent part of the record may have dynamic fields
9019 and the way the location of _tag is expressed may depend on
9020 them). */
529cad9c 9021
1ed6ede0 9022 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
76a01679 9023 {
b50d69b5
JG
9024 struct value *tag =
9025 value_tag_from_contents_and_address
9026 (fixed_record_type,
9027 valaddr,
9028 address);
9029 struct type *real_type = type_from_tag (tag);
9030 struct value *obj =
9031 value_from_contents_and_address (fixed_record_type,
9032 valaddr,
9033 address);
9f1f738a 9034 fixed_record_type = value_type (obj);
76a01679 9035 if (real_type != NULL)
b50d69b5
JG
9036 return to_fixed_record_type
9037 (real_type, NULL,
9038 value_address (ada_tag_value_at_base_address (obj)), NULL);
76a01679 9039 }
4af88198
JB
9040
9041 /* Check to see if there is a parallel ___XVZ variable.
9042 If there is, then it provides the actual size of our type. */
9043 else if (ada_type_name (fixed_record_type) != NULL)
9044 {
0d5cff50 9045 const char *name = ada_type_name (fixed_record_type);
224c3ddb
SM
9046 char *xvz_name
9047 = (char *) alloca (strlen (name) + 7 /* "___XVZ\0" */);
eccab96d 9048 bool xvz_found = false;
4af88198
JB
9049 LONGEST size;
9050
88c15c34 9051 xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name);
eccab96d
JB
9052 TRY
9053 {
9054 xvz_found = get_int_var_value (xvz_name, size);
9055 }
9056 CATCH (except, RETURN_MASK_ERROR)
9057 {
9058 /* We found the variable, but somehow failed to read
9059 its value. Rethrow the same error, but with a little
9060 bit more information, to help the user understand
9061 what went wrong (Eg: the variable might have been
9062 optimized out). */
9063 throw_error (except.error,
9064 _("unable to read value of %s (%s)"),
9065 xvz_name, except.message);
9066 }
9067 END_CATCH
9068
9069 if (xvz_found && TYPE_LENGTH (fixed_record_type) != size)
4af88198
JB
9070 {
9071 fixed_record_type = copy_type (fixed_record_type);
9072 TYPE_LENGTH (fixed_record_type) = size;
9073
9074 /* The FIXED_RECORD_TYPE may have be a stub. We have
9075 observed this when the debugging info is STABS, and
9076 apparently it is something that is hard to fix.
9077
9078 In practice, we don't need the actual type definition
9079 at all, because the presence of the XVZ variable allows us
9080 to assume that there must be a XVS type as well, which we
9081 should be able to use later, when we need the actual type
9082 definition.
9083
9084 In the meantime, pretend that the "fixed" type we are
9085 returning is NOT a stub, because this can cause trouble
9086 when using this type to create new types targeting it.
9087 Indeed, the associated creation routines often check
9088 whether the target type is a stub and will try to replace
0963b4bd 9089 it, thus using a type with the wrong size. This, in turn,
4af88198
JB
9090 might cause the new type to have the wrong size too.
9091 Consider the case of an array, for instance, where the size
9092 of the array is computed from the number of elements in
9093 our array multiplied by the size of its element. */
9094 TYPE_STUB (fixed_record_type) = 0;
9095 }
9096 }
1ed6ede0 9097 return fixed_record_type;
4c4b4cd2 9098 }
d2e4a39e 9099 case TYPE_CODE_ARRAY:
4c4b4cd2 9100 return to_fixed_array_type (type, dval, 1);
d2e4a39e
AS
9101 case TYPE_CODE_UNION:
9102 if (dval == NULL)
4c4b4cd2 9103 return type;
d2e4a39e 9104 else
4c4b4cd2 9105 return to_fixed_variant_branch_type (type, valaddr, address, dval);
d2e4a39e 9106 }
14f9c5c9
AS
9107}
9108
f192137b
JB
9109/* The same as ada_to_fixed_type_1, except that it preserves the type
9110 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
96dbd2c1
JB
9111
9112 The typedef layer needs be preserved in order to differentiate between
9113 arrays and array pointers when both types are implemented using the same
9114 fat pointer. In the array pointer case, the pointer is encoded as
9115 a typedef of the pointer type. For instance, considering:
9116
9117 type String_Access is access String;
9118 S1 : String_Access := null;
9119
9120 To the debugger, S1 is defined as a typedef of type String. But
9121 to the user, it is a pointer. So if the user tries to print S1,
9122 we should not dereference the array, but print the array address
9123 instead.
9124
9125 If we didn't preserve the typedef layer, we would lose the fact that
9126 the type is to be presented as a pointer (needs de-reference before
9127 being printed). And we would also use the source-level type name. */
f192137b
JB
9128
9129struct type *
9130ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
9131 CORE_ADDR address, struct value *dval, int check_tag)
9132
9133{
9134 struct type *fixed_type =
9135 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
9136
96dbd2c1
JB
9137 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
9138 then preserve the typedef layer.
9139
9140 Implementation note: We can only check the main-type portion of
9141 the TYPE and FIXED_TYPE, because eliminating the typedef layer
9142 from TYPE now returns a type that has the same instance flags
9143 as TYPE. For instance, if TYPE is a "typedef const", and its
9144 target type is a "struct", then the typedef elimination will return
9145 a "const" version of the target type. See check_typedef for more
9146 details about how the typedef layer elimination is done.
9147
9148 brobecker/2010-11-19: It seems to me that the only case where it is
9149 useful to preserve the typedef layer is when dealing with fat pointers.
9150 Perhaps, we could add a check for that and preserve the typedef layer
9151 only in that situation. But this seems unecessary so far, probably
9152 because we call check_typedef/ada_check_typedef pretty much everywhere.
9153 */
f192137b 9154 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
720d1a40 9155 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type))
96dbd2c1 9156 == TYPE_MAIN_TYPE (fixed_type)))
f192137b
JB
9157 return type;
9158
9159 return fixed_type;
9160}
9161
14f9c5c9 9162/* A standard (static-sized) type corresponding as well as possible to
4c4b4cd2 9163 TYPE0, but based on no runtime data. */
14f9c5c9 9164
d2e4a39e
AS
9165static struct type *
9166to_static_fixed_type (struct type *type0)
14f9c5c9 9167{
d2e4a39e 9168 struct type *type;
14f9c5c9
AS
9169
9170 if (type0 == NULL)
9171 return NULL;
9172
876cecd0 9173 if (TYPE_FIXED_INSTANCE (type0))
4c4b4cd2
PH
9174 return type0;
9175
61ee279c 9176 type0 = ada_check_typedef (type0);
d2e4a39e 9177
14f9c5c9
AS
9178 switch (TYPE_CODE (type0))
9179 {
9180 default:
9181 return type0;
9182 case TYPE_CODE_STRUCT:
9183 type = dynamic_template_type (type0);
d2e4a39e 9184 if (type != NULL)
4c4b4cd2
PH
9185 return template_to_static_fixed_type (type);
9186 else
9187 return template_to_static_fixed_type (type0);
14f9c5c9
AS
9188 case TYPE_CODE_UNION:
9189 type = ada_find_parallel_type (type0, "___XVU");
9190 if (type != NULL)
4c4b4cd2
PH
9191 return template_to_static_fixed_type (type);
9192 else
9193 return template_to_static_fixed_type (type0);
14f9c5c9
AS
9194 }
9195}
9196
4c4b4cd2
PH
9197/* A static approximation of TYPE with all type wrappers removed. */
9198
d2e4a39e
AS
9199static struct type *
9200static_unwrap_type (struct type *type)
14f9c5c9
AS
9201{
9202 if (ada_is_aligner_type (type))
9203 {
61ee279c 9204 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
14f9c5c9 9205 if (ada_type_name (type1) == NULL)
4c4b4cd2 9206 TYPE_NAME (type1) = ada_type_name (type);
14f9c5c9
AS
9207
9208 return static_unwrap_type (type1);
9209 }
d2e4a39e 9210 else
14f9c5c9 9211 {
d2e4a39e 9212 struct type *raw_real_type = ada_get_base_type (type);
5b4ee69b 9213
d2e4a39e 9214 if (raw_real_type == type)
4c4b4cd2 9215 return type;
14f9c5c9 9216 else
4c4b4cd2 9217 return to_static_fixed_type (raw_real_type);
14f9c5c9
AS
9218 }
9219}
9220
9221/* In some cases, incomplete and private types require
4c4b4cd2 9222 cross-references that are not resolved as records (for example,
14f9c5c9
AS
9223 type Foo;
9224 type FooP is access Foo;
9225 V: FooP;
9226 type Foo is array ...;
4c4b4cd2 9227 ). In these cases, since there is no mechanism for producing
14f9c5c9
AS
9228 cross-references to such types, we instead substitute for FooP a
9229 stub enumeration type that is nowhere resolved, and whose tag is
4c4b4cd2 9230 the name of the actual type. Call these types "non-record stubs". */
14f9c5c9
AS
9231
9232/* A type equivalent to TYPE that is not a non-record stub, if one
4c4b4cd2
PH
9233 exists, otherwise TYPE. */
9234
d2e4a39e 9235struct type *
61ee279c 9236ada_check_typedef (struct type *type)
14f9c5c9 9237{
727e3d2e
JB
9238 if (type == NULL)
9239 return NULL;
9240
736ade86
XR
9241 /* If our type is an access to an unconstrained array, which is encoded
9242 as a TYPE_CODE_TYPEDEF of a fat pointer, then we're done.
720d1a40
JB
9243 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
9244 what allows us to distinguish between fat pointers that represent
9245 array types, and fat pointers that represent array access types
9246 (in both cases, the compiler implements them as fat pointers). */
736ade86 9247 if (ada_is_access_to_unconstrained_array (type))
720d1a40
JB
9248 return type;
9249
f168693b 9250 type = check_typedef (type);
14f9c5c9 9251 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
529cad9c 9252 || !TYPE_STUB (type)
e86ca25f 9253 || TYPE_NAME (type) == NULL)
14f9c5c9 9254 return type;
d2e4a39e 9255 else
14f9c5c9 9256 {
e86ca25f 9257 const char *name = TYPE_NAME (type);
d2e4a39e 9258 struct type *type1 = ada_find_any_type (name);
5b4ee69b 9259
05e522ef
JB
9260 if (type1 == NULL)
9261 return type;
9262
9263 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
9264 stubs pointing to arrays, as we don't create symbols for array
3a867c22
JB
9265 types, only for the typedef-to-array types). If that's the case,
9266 strip the typedef layer. */
9267 if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF)
9268 type1 = ada_check_typedef (type1);
9269
9270 return type1;
14f9c5c9
AS
9271 }
9272}
9273
9274/* A value representing the data at VALADDR/ADDRESS as described by
9275 type TYPE0, but with a standard (static-sized) type that correctly
9276 describes it. If VAL0 is not NULL and TYPE0 already is a standard
9277 type, then return VAL0 [this feature is simply to avoid redundant
4c4b4cd2 9278 creation of struct values]. */
14f9c5c9 9279
4c4b4cd2
PH
9280static struct value *
9281ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
9282 struct value *val0)
14f9c5c9 9283{
1ed6ede0 9284 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
5b4ee69b 9285
14f9c5c9
AS
9286 if (type == type0 && val0 != NULL)
9287 return val0;
cc0e770c
JB
9288
9289 if (VALUE_LVAL (val0) != lval_memory)
9290 {
9291 /* Our value does not live in memory; it could be a convenience
9292 variable, for instance. Create a not_lval value using val0's
9293 contents. */
9294 return value_from_contents (type, value_contents (val0));
9295 }
9296
9297 return value_from_contents_and_address (type, 0, address);
4c4b4cd2
PH
9298}
9299
9300/* A value representing VAL, but with a standard (static-sized) type
9301 that correctly describes it. Does not necessarily create a new
9302 value. */
9303
0c3acc09 9304struct value *
4c4b4cd2
PH
9305ada_to_fixed_value (struct value *val)
9306{
c48db5ca 9307 val = unwrap_value (val);
d8ce9127 9308 val = ada_to_fixed_value_create (value_type (val), value_address (val), val);
c48db5ca 9309 return val;
14f9c5c9 9310}
d2e4a39e 9311\f
14f9c5c9 9312
14f9c5c9
AS
9313/* Attributes */
9314
4c4b4cd2
PH
9315/* Table mapping attribute numbers to names.
9316 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
14f9c5c9 9317
d2e4a39e 9318static const char *attribute_names[] = {
14f9c5c9
AS
9319 "<?>",
9320
d2e4a39e 9321 "first",
14f9c5c9
AS
9322 "last",
9323 "length",
9324 "image",
14f9c5c9
AS
9325 "max",
9326 "min",
4c4b4cd2
PH
9327 "modulus",
9328 "pos",
9329 "size",
9330 "tag",
14f9c5c9 9331 "val",
14f9c5c9
AS
9332 0
9333};
9334
d2e4a39e 9335const char *
4c4b4cd2 9336ada_attribute_name (enum exp_opcode n)
14f9c5c9 9337{
4c4b4cd2
PH
9338 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
9339 return attribute_names[n - OP_ATR_FIRST + 1];
14f9c5c9
AS
9340 else
9341 return attribute_names[0];
9342}
9343
4c4b4cd2 9344/* Evaluate the 'POS attribute applied to ARG. */
14f9c5c9 9345
4c4b4cd2
PH
9346static LONGEST
9347pos_atr (struct value *arg)
14f9c5c9 9348{
24209737
PH
9349 struct value *val = coerce_ref (arg);
9350 struct type *type = value_type (val);
aa715135 9351 LONGEST result;
14f9c5c9 9352
d2e4a39e 9353 if (!discrete_type_p (type))
323e0a4a 9354 error (_("'POS only defined on discrete types"));
14f9c5c9 9355
aa715135
JG
9356 if (!discrete_position (type, value_as_long (val), &result))
9357 error (_("enumeration value is invalid: can't find 'POS"));
14f9c5c9 9358
aa715135 9359 return result;
4c4b4cd2
PH
9360}
9361
9362static struct value *
3cb382c9 9363value_pos_atr (struct type *type, struct value *arg)
4c4b4cd2 9364{
3cb382c9 9365 return value_from_longest (type, pos_atr (arg));
14f9c5c9
AS
9366}
9367
4c4b4cd2 9368/* Evaluate the TYPE'VAL attribute applied to ARG. */
14f9c5c9 9369
d2e4a39e
AS
9370static struct value *
9371value_val_atr (struct type *type, struct value *arg)
14f9c5c9 9372{
d2e4a39e 9373 if (!discrete_type_p (type))
323e0a4a 9374 error (_("'VAL only defined on discrete types"));
df407dfe 9375 if (!integer_type_p (value_type (arg)))
323e0a4a 9376 error (_("'VAL requires integral argument"));
14f9c5c9
AS
9377
9378 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
9379 {
9380 long pos = value_as_long (arg);
5b4ee69b 9381
14f9c5c9 9382 if (pos < 0 || pos >= TYPE_NFIELDS (type))
323e0a4a 9383 error (_("argument to 'VAL out of range"));
14e75d8e 9384 return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, pos));
14f9c5c9
AS
9385 }
9386 else
9387 return value_from_longest (type, value_as_long (arg));
9388}
14f9c5c9 9389\f
d2e4a39e 9390
4c4b4cd2 9391 /* Evaluation */
14f9c5c9 9392
4c4b4cd2
PH
9393/* True if TYPE appears to be an Ada character type.
9394 [At the moment, this is true only for Character and Wide_Character;
9395 It is a heuristic test that could stand improvement]. */
14f9c5c9 9396
d2e4a39e
AS
9397int
9398ada_is_character_type (struct type *type)
14f9c5c9 9399{
7b9f71f2
JB
9400 const char *name;
9401
9402 /* If the type code says it's a character, then assume it really is,
9403 and don't check any further. */
9404 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
9405 return 1;
9406
9407 /* Otherwise, assume it's a character type iff it is a discrete type
9408 with a known character type name. */
9409 name = ada_type_name (type);
9410 return (name != NULL
9411 && (TYPE_CODE (type) == TYPE_CODE_INT
9412 || TYPE_CODE (type) == TYPE_CODE_RANGE)
9413 && (strcmp (name, "character") == 0
9414 || strcmp (name, "wide_character") == 0
5a517ebd 9415 || strcmp (name, "wide_wide_character") == 0
7b9f71f2 9416 || strcmp (name, "unsigned char") == 0));
14f9c5c9
AS
9417}
9418
4c4b4cd2 9419/* True if TYPE appears to be an Ada string type. */
14f9c5c9
AS
9420
9421int
ebf56fd3 9422ada_is_string_type (struct type *type)
14f9c5c9 9423{
61ee279c 9424 type = ada_check_typedef (type);
d2e4a39e 9425 if (type != NULL
14f9c5c9 9426 && TYPE_CODE (type) != TYPE_CODE_PTR
76a01679
JB
9427 && (ada_is_simple_array_type (type)
9428 || ada_is_array_descriptor_type (type))
14f9c5c9
AS
9429 && ada_array_arity (type) == 1)
9430 {
9431 struct type *elttype = ada_array_element_type (type, 1);
9432
9433 return ada_is_character_type (elttype);
9434 }
d2e4a39e 9435 else
14f9c5c9
AS
9436 return 0;
9437}
9438
5bf03f13
JB
9439/* The compiler sometimes provides a parallel XVS type for a given
9440 PAD type. Normally, it is safe to follow the PAD type directly,
9441 but older versions of the compiler have a bug that causes the offset
9442 of its "F" field to be wrong. Following that field in that case
9443 would lead to incorrect results, but this can be worked around
9444 by ignoring the PAD type and using the associated XVS type instead.
9445
9446 Set to True if the debugger should trust the contents of PAD types.
9447 Otherwise, ignore the PAD type if there is a parallel XVS type. */
9448static int trust_pad_over_xvs = 1;
14f9c5c9
AS
9449
9450/* True if TYPE is a struct type introduced by the compiler to force the
9451 alignment of a value. Such types have a single field with a
4c4b4cd2 9452 distinctive name. */
14f9c5c9
AS
9453
9454int
ebf56fd3 9455ada_is_aligner_type (struct type *type)
14f9c5c9 9456{
61ee279c 9457 type = ada_check_typedef (type);
714e53ab 9458
5bf03f13 9459 if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL)
714e53ab
PH
9460 return 0;
9461
14f9c5c9 9462 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
4c4b4cd2
PH
9463 && TYPE_NFIELDS (type) == 1
9464 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
14f9c5c9
AS
9465}
9466
9467/* If there is an ___XVS-convention type parallel to SUBTYPE, return
4c4b4cd2 9468 the parallel type. */
14f9c5c9 9469
d2e4a39e
AS
9470struct type *
9471ada_get_base_type (struct type *raw_type)
14f9c5c9 9472{
d2e4a39e
AS
9473 struct type *real_type_namer;
9474 struct type *raw_real_type;
14f9c5c9
AS
9475
9476 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
9477 return raw_type;
9478
284614f0
JB
9479 if (ada_is_aligner_type (raw_type))
9480 /* The encoding specifies that we should always use the aligner type.
9481 So, even if this aligner type has an associated XVS type, we should
9482 simply ignore it.
9483
9484 According to the compiler gurus, an XVS type parallel to an aligner
9485 type may exist because of a stabs limitation. In stabs, aligner
9486 types are empty because the field has a variable-sized type, and
9487 thus cannot actually be used as an aligner type. As a result,
9488 we need the associated parallel XVS type to decode the type.
9489 Since the policy in the compiler is to not change the internal
9490 representation based on the debugging info format, we sometimes
9491 end up having a redundant XVS type parallel to the aligner type. */
9492 return raw_type;
9493
14f9c5c9 9494 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
d2e4a39e 9495 if (real_type_namer == NULL
14f9c5c9
AS
9496 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
9497 || TYPE_NFIELDS (real_type_namer) != 1)
9498 return raw_type;
9499
f80d3ff2
JB
9500 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF)
9501 {
9502 /* This is an older encoding form where the base type needs to be
9503 looked up by name. We prefer the newer enconding because it is
9504 more efficient. */
9505 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
9506 if (raw_real_type == NULL)
9507 return raw_type;
9508 else
9509 return raw_real_type;
9510 }
9511
9512 /* The field in our XVS type is a reference to the base type. */
9513 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0));
d2e4a39e 9514}
14f9c5c9 9515
4c4b4cd2 9516/* The type of value designated by TYPE, with all aligners removed. */
14f9c5c9 9517
d2e4a39e
AS
9518struct type *
9519ada_aligned_type (struct type *type)
14f9c5c9
AS
9520{
9521 if (ada_is_aligner_type (type))
9522 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
9523 else
9524 return ada_get_base_type (type);
9525}
9526
9527
9528/* The address of the aligned value in an object at address VALADDR
4c4b4cd2 9529 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
14f9c5c9 9530
fc1a4b47
AC
9531const gdb_byte *
9532ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
14f9c5c9 9533{
d2e4a39e 9534 if (ada_is_aligner_type (type))
14f9c5c9 9535 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
4c4b4cd2
PH
9536 valaddr +
9537 TYPE_FIELD_BITPOS (type,
9538 0) / TARGET_CHAR_BIT);
14f9c5c9
AS
9539 else
9540 return valaddr;
9541}
9542
4c4b4cd2
PH
9543
9544
14f9c5c9 9545/* The printed representation of an enumeration literal with encoded
4c4b4cd2 9546 name NAME. The value is good to the next call of ada_enum_name. */
d2e4a39e
AS
9547const char *
9548ada_enum_name (const char *name)
14f9c5c9 9549{
4c4b4cd2
PH
9550 static char *result;
9551 static size_t result_len = 0;
e6a959d6 9552 const char *tmp;
14f9c5c9 9553
4c4b4cd2
PH
9554 /* First, unqualify the enumeration name:
9555 1. Search for the last '.' character. If we find one, then skip
177b42fe 9556 all the preceding characters, the unqualified name starts
76a01679 9557 right after that dot.
4c4b4cd2 9558 2. Otherwise, we may be debugging on a target where the compiler
76a01679
JB
9559 translates dots into "__". Search forward for double underscores,
9560 but stop searching when we hit an overloading suffix, which is
9561 of the form "__" followed by digits. */
4c4b4cd2 9562
c3e5cd34
PH
9563 tmp = strrchr (name, '.');
9564 if (tmp != NULL)
4c4b4cd2
PH
9565 name = tmp + 1;
9566 else
14f9c5c9 9567 {
4c4b4cd2
PH
9568 while ((tmp = strstr (name, "__")) != NULL)
9569 {
9570 if (isdigit (tmp[2]))
9571 break;
9572 else
9573 name = tmp + 2;
9574 }
14f9c5c9
AS
9575 }
9576
9577 if (name[0] == 'Q')
9578 {
14f9c5c9 9579 int v;
5b4ee69b 9580
14f9c5c9 9581 if (name[1] == 'U' || name[1] == 'W')
4c4b4cd2
PH
9582 {
9583 if (sscanf (name + 2, "%x", &v) != 1)
9584 return name;
9585 }
14f9c5c9 9586 else
4c4b4cd2 9587 return name;
14f9c5c9 9588
4c4b4cd2 9589 GROW_VECT (result, result_len, 16);
14f9c5c9 9590 if (isascii (v) && isprint (v))
88c15c34 9591 xsnprintf (result, result_len, "'%c'", v);
14f9c5c9 9592 else if (name[1] == 'U')
88c15c34 9593 xsnprintf (result, result_len, "[\"%02x\"]", v);
14f9c5c9 9594 else
88c15c34 9595 xsnprintf (result, result_len, "[\"%04x\"]", v);
14f9c5c9
AS
9596
9597 return result;
9598 }
d2e4a39e 9599 else
4c4b4cd2 9600 {
c3e5cd34
PH
9601 tmp = strstr (name, "__");
9602 if (tmp == NULL)
9603 tmp = strstr (name, "$");
9604 if (tmp != NULL)
4c4b4cd2
PH
9605 {
9606 GROW_VECT (result, result_len, tmp - name + 1);
9607 strncpy (result, name, tmp - name);
9608 result[tmp - name] = '\0';
9609 return result;
9610 }
9611
9612 return name;
9613 }
14f9c5c9
AS
9614}
9615
14f9c5c9
AS
9616/* Evaluate the subexpression of EXP starting at *POS as for
9617 evaluate_type, updating *POS to point just past the evaluated
4c4b4cd2 9618 expression. */
14f9c5c9 9619
d2e4a39e
AS
9620static struct value *
9621evaluate_subexp_type (struct expression *exp, int *pos)
14f9c5c9 9622{
4b27a620 9623 return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
14f9c5c9
AS
9624}
9625
9626/* If VAL is wrapped in an aligner or subtype wrapper, return the
4c4b4cd2 9627 value it wraps. */
14f9c5c9 9628
d2e4a39e
AS
9629static struct value *
9630unwrap_value (struct value *val)
14f9c5c9 9631{
df407dfe 9632 struct type *type = ada_check_typedef (value_type (val));
5b4ee69b 9633
14f9c5c9
AS
9634 if (ada_is_aligner_type (type))
9635 {
de4d072f 9636 struct value *v = ada_value_struct_elt (val, "F", 0);
df407dfe 9637 struct type *val_type = ada_check_typedef (value_type (v));
5b4ee69b 9638
14f9c5c9 9639 if (ada_type_name (val_type) == NULL)
4c4b4cd2 9640 TYPE_NAME (val_type) = ada_type_name (type);
14f9c5c9
AS
9641
9642 return unwrap_value (v);
9643 }
d2e4a39e 9644 else
14f9c5c9 9645 {
d2e4a39e 9646 struct type *raw_real_type =
61ee279c 9647 ada_check_typedef (ada_get_base_type (type));
d2e4a39e 9648
5bf03f13
JB
9649 /* If there is no parallel XVS or XVE type, then the value is
9650 already unwrapped. Return it without further modification. */
9651 if ((type == raw_real_type)
9652 && ada_find_parallel_type (type, "___XVE") == NULL)
9653 return val;
14f9c5c9 9654
d2e4a39e 9655 return
4c4b4cd2
PH
9656 coerce_unspec_val_to_type
9657 (val, ada_to_fixed_type (raw_real_type, 0,
42ae5230 9658 value_address (val),
1ed6ede0 9659 NULL, 1));
14f9c5c9
AS
9660 }
9661}
d2e4a39e
AS
9662
9663static struct value *
50eff16b 9664cast_from_fixed (struct type *type, struct value *arg)
14f9c5c9 9665{
50eff16b
UW
9666 struct value *scale = ada_scaling_factor (value_type (arg));
9667 arg = value_cast (value_type (scale), arg);
14f9c5c9 9668
50eff16b
UW
9669 arg = value_binop (arg, scale, BINOP_MUL);
9670 return value_cast (type, arg);
14f9c5c9
AS
9671}
9672
d2e4a39e 9673static struct value *
50eff16b 9674cast_to_fixed (struct type *type, struct value *arg)
14f9c5c9 9675{
50eff16b
UW
9676 if (type == value_type (arg))
9677 return arg;
5b4ee69b 9678
50eff16b
UW
9679 struct value *scale = ada_scaling_factor (type);
9680 if (ada_is_fixed_point_type (value_type (arg)))
9681 arg = cast_from_fixed (value_type (scale), arg);
9682 else
9683 arg = value_cast (value_type (scale), arg);
9684
9685 arg = value_binop (arg, scale, BINOP_DIV);
9686 return value_cast (type, arg);
14f9c5c9
AS
9687}
9688
d99dcf51
JB
9689/* Given two array types T1 and T2, return nonzero iff both arrays
9690 contain the same number of elements. */
9691
9692static int
9693ada_same_array_size_p (struct type *t1, struct type *t2)
9694{
9695 LONGEST lo1, hi1, lo2, hi2;
9696
9697 /* Get the array bounds in order to verify that the size of
9698 the two arrays match. */
9699 if (!get_array_bounds (t1, &lo1, &hi1)
9700 || !get_array_bounds (t2, &lo2, &hi2))
9701 error (_("unable to determine array bounds"));
9702
9703 /* To make things easier for size comparison, normalize a bit
9704 the case of empty arrays by making sure that the difference
9705 between upper bound and lower bound is always -1. */
9706 if (lo1 > hi1)
9707 hi1 = lo1 - 1;
9708 if (lo2 > hi2)
9709 hi2 = lo2 - 1;
9710
9711 return (hi1 - lo1 == hi2 - lo2);
9712}
9713
9714/* Assuming that VAL is an array of integrals, and TYPE represents
9715 an array with the same number of elements, but with wider integral
9716 elements, return an array "casted" to TYPE. In practice, this
9717 means that the returned array is built by casting each element
9718 of the original array into TYPE's (wider) element type. */
9719
9720static struct value *
9721ada_promote_array_of_integrals (struct type *type, struct value *val)
9722{
9723 struct type *elt_type = TYPE_TARGET_TYPE (type);
9724 LONGEST lo, hi;
9725 struct value *res;
9726 LONGEST i;
9727
9728 /* Verify that both val and type are arrays of scalars, and
9729 that the size of val's elements is smaller than the size
9730 of type's element. */
9731 gdb_assert (TYPE_CODE (type) == TYPE_CODE_ARRAY);
9732 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type)));
9733 gdb_assert (TYPE_CODE (value_type (val)) == TYPE_CODE_ARRAY);
9734 gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val))));
9735 gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type))
9736 > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val))));
9737
9738 if (!get_array_bounds (type, &lo, &hi))
9739 error (_("unable to determine array bounds"));
9740
9741 res = allocate_value (type);
9742
9743 /* Promote each array element. */
9744 for (i = 0; i < hi - lo + 1; i++)
9745 {
9746 struct value *elt = value_cast (elt_type, value_subscript (val, lo + i));
9747
9748 memcpy (value_contents_writeable (res) + (i * TYPE_LENGTH (elt_type)),
9749 value_contents_all (elt), TYPE_LENGTH (elt_type));
9750 }
9751
9752 return res;
9753}
9754
4c4b4cd2
PH
9755/* Coerce VAL as necessary for assignment to an lval of type TYPE, and
9756 return the converted value. */
9757
d2e4a39e
AS
9758static struct value *
9759coerce_for_assign (struct type *type, struct value *val)
14f9c5c9 9760{
df407dfe 9761 struct type *type2 = value_type (val);
5b4ee69b 9762
14f9c5c9
AS
9763 if (type == type2)
9764 return val;
9765
61ee279c
PH
9766 type2 = ada_check_typedef (type2);
9767 type = ada_check_typedef (type);
14f9c5c9 9768
d2e4a39e
AS
9769 if (TYPE_CODE (type2) == TYPE_CODE_PTR
9770 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
14f9c5c9
AS
9771 {
9772 val = ada_value_ind (val);
df407dfe 9773 type2 = value_type (val);
14f9c5c9
AS
9774 }
9775
d2e4a39e 9776 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
14f9c5c9
AS
9777 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
9778 {
d99dcf51
JB
9779 if (!ada_same_array_size_p (type, type2))
9780 error (_("cannot assign arrays of different length"));
9781
9782 if (is_integral_type (TYPE_TARGET_TYPE (type))
9783 && is_integral_type (TYPE_TARGET_TYPE (type2))
9784 && TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
9785 < TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
9786 {
9787 /* Allow implicit promotion of the array elements to
9788 a wider type. */
9789 return ada_promote_array_of_integrals (type, val);
9790 }
9791
9792 if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
9793 != TYPE_LENGTH (TYPE_TARGET_TYPE (type)))
323e0a4a 9794 error (_("Incompatible types in assignment"));
04624583 9795 deprecated_set_value_type (val, type);
14f9c5c9 9796 }
d2e4a39e 9797 return val;
14f9c5c9
AS
9798}
9799
4c4b4cd2
PH
9800static struct value *
9801ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
9802{
9803 struct value *val;
9804 struct type *type1, *type2;
9805 LONGEST v, v1, v2;
9806
994b9211
AC
9807 arg1 = coerce_ref (arg1);
9808 arg2 = coerce_ref (arg2);
18af8284
JB
9809 type1 = get_base_type (ada_check_typedef (value_type (arg1)));
9810 type2 = get_base_type (ada_check_typedef (value_type (arg2)));
4c4b4cd2 9811
76a01679
JB
9812 if (TYPE_CODE (type1) != TYPE_CODE_INT
9813 || TYPE_CODE (type2) != TYPE_CODE_INT)
4c4b4cd2
PH
9814 return value_binop (arg1, arg2, op);
9815
76a01679 9816 switch (op)
4c4b4cd2
PH
9817 {
9818 case BINOP_MOD:
9819 case BINOP_DIV:
9820 case BINOP_REM:
9821 break;
9822 default:
9823 return value_binop (arg1, arg2, op);
9824 }
9825
9826 v2 = value_as_long (arg2);
9827 if (v2 == 0)
323e0a4a 9828 error (_("second operand of %s must not be zero."), op_string (op));
4c4b4cd2
PH
9829
9830 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
9831 return value_binop (arg1, arg2, op);
9832
9833 v1 = value_as_long (arg1);
9834 switch (op)
9835 {
9836 case BINOP_DIV:
9837 v = v1 / v2;
76a01679
JB
9838 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
9839 v += v > 0 ? -1 : 1;
4c4b4cd2
PH
9840 break;
9841 case BINOP_REM:
9842 v = v1 % v2;
76a01679
JB
9843 if (v * v1 < 0)
9844 v -= v2;
4c4b4cd2
PH
9845 break;
9846 default:
9847 /* Should not reach this point. */
9848 v = 0;
9849 }
9850
9851 val = allocate_value (type1);
990a07ab 9852 store_unsigned_integer (value_contents_raw (val),
e17a4113
UW
9853 TYPE_LENGTH (value_type (val)),
9854 gdbarch_byte_order (get_type_arch (type1)), v);
4c4b4cd2
PH
9855 return val;
9856}
9857
9858static int
9859ada_value_equal (struct value *arg1, struct value *arg2)
9860{
df407dfe
AC
9861 if (ada_is_direct_array_type (value_type (arg1))
9862 || ada_is_direct_array_type (value_type (arg2)))
4c4b4cd2 9863 {
79e8fcaa
JB
9864 struct type *arg1_type, *arg2_type;
9865
f58b38bf
JB
9866 /* Automatically dereference any array reference before
9867 we attempt to perform the comparison. */
9868 arg1 = ada_coerce_ref (arg1);
9869 arg2 = ada_coerce_ref (arg2);
79e8fcaa 9870
4c4b4cd2
PH
9871 arg1 = ada_coerce_to_simple_array (arg1);
9872 arg2 = ada_coerce_to_simple_array (arg2);
79e8fcaa
JB
9873
9874 arg1_type = ada_check_typedef (value_type (arg1));
9875 arg2_type = ada_check_typedef (value_type (arg2));
9876
9877 if (TYPE_CODE (arg1_type) != TYPE_CODE_ARRAY
9878 || TYPE_CODE (arg2_type) != TYPE_CODE_ARRAY)
323e0a4a 9879 error (_("Attempt to compare array with non-array"));
4c4b4cd2 9880 /* FIXME: The following works only for types whose
76a01679
JB
9881 representations use all bits (no padding or undefined bits)
9882 and do not have user-defined equality. */
79e8fcaa
JB
9883 return (TYPE_LENGTH (arg1_type) == TYPE_LENGTH (arg2_type)
9884 && memcmp (value_contents (arg1), value_contents (arg2),
9885 TYPE_LENGTH (arg1_type)) == 0);
4c4b4cd2
PH
9886 }
9887 return value_equal (arg1, arg2);
9888}
9889
52ce6436
PH
9890/* Total number of component associations in the aggregate starting at
9891 index PC in EXP. Assumes that index PC is the start of an
0963b4bd 9892 OP_AGGREGATE. */
52ce6436
PH
9893
9894static int
9895num_component_specs (struct expression *exp, int pc)
9896{
9897 int n, m, i;
5b4ee69b 9898
52ce6436
PH
9899 m = exp->elts[pc + 1].longconst;
9900 pc += 3;
9901 n = 0;
9902 for (i = 0; i < m; i += 1)
9903 {
9904 switch (exp->elts[pc].opcode)
9905 {
9906 default:
9907 n += 1;
9908 break;
9909 case OP_CHOICES:
9910 n += exp->elts[pc + 1].longconst;
9911 break;
9912 }
9913 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
9914 }
9915 return n;
9916}
9917
9918/* Assign the result of evaluating EXP starting at *POS to the INDEXth
9919 component of LHS (a simple array or a record), updating *POS past
9920 the expression, assuming that LHS is contained in CONTAINER. Does
9921 not modify the inferior's memory, nor does it modify LHS (unless
9922 LHS == CONTAINER). */
9923
9924static void
9925assign_component (struct value *container, struct value *lhs, LONGEST index,
9926 struct expression *exp, int *pos)
9927{
9928 struct value *mark = value_mark ();
9929 struct value *elt;
0e2da9f0 9930 struct type *lhs_type = check_typedef (value_type (lhs));
5b4ee69b 9931
0e2da9f0 9932 if (TYPE_CODE (lhs_type) == TYPE_CODE_ARRAY)
52ce6436 9933 {
22601c15
UW
9934 struct type *index_type = builtin_type (exp->gdbarch)->builtin_int;
9935 struct value *index_val = value_from_longest (index_type, index);
5b4ee69b 9936
52ce6436
PH
9937 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
9938 }
9939 else
9940 {
9941 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
c48db5ca 9942 elt = ada_to_fixed_value (elt);
52ce6436
PH
9943 }
9944
9945 if (exp->elts[*pos].opcode == OP_AGGREGATE)
9946 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
9947 else
9948 value_assign_to_component (container, elt,
9949 ada_evaluate_subexp (NULL, exp, pos,
9950 EVAL_NORMAL));
9951
9952 value_free_to_mark (mark);
9953}
9954
9955/* Assuming that LHS represents an lvalue having a record or array
9956 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
9957 of that aggregate's value to LHS, advancing *POS past the
9958 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
9959 lvalue containing LHS (possibly LHS itself). Does not modify
9960 the inferior's memory, nor does it modify the contents of
0963b4bd 9961 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
52ce6436
PH
9962
9963static struct value *
9964assign_aggregate (struct value *container,
9965 struct value *lhs, struct expression *exp,
9966 int *pos, enum noside noside)
9967{
9968 struct type *lhs_type;
9969 int n = exp->elts[*pos+1].longconst;
9970 LONGEST low_index, high_index;
9971 int num_specs;
9972 LONGEST *indices;
9973 int max_indices, num_indices;
52ce6436 9974 int i;
52ce6436
PH
9975
9976 *pos += 3;
9977 if (noside != EVAL_NORMAL)
9978 {
52ce6436
PH
9979 for (i = 0; i < n; i += 1)
9980 ada_evaluate_subexp (NULL, exp, pos, noside);
9981 return container;
9982 }
9983
9984 container = ada_coerce_ref (container);
9985 if (ada_is_direct_array_type (value_type (container)))
9986 container = ada_coerce_to_simple_array (container);
9987 lhs = ada_coerce_ref (lhs);
9988 if (!deprecated_value_modifiable (lhs))
9989 error (_("Left operand of assignment is not a modifiable lvalue."));
9990
0e2da9f0 9991 lhs_type = check_typedef (value_type (lhs));
52ce6436
PH
9992 if (ada_is_direct_array_type (lhs_type))
9993 {
9994 lhs = ada_coerce_to_simple_array (lhs);
0e2da9f0 9995 lhs_type = check_typedef (value_type (lhs));
52ce6436
PH
9996 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
9997 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
52ce6436
PH
9998 }
9999 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
10000 {
10001 low_index = 0;
10002 high_index = num_visible_fields (lhs_type) - 1;
52ce6436
PH
10003 }
10004 else
10005 error (_("Left-hand side must be array or record."));
10006
10007 num_specs = num_component_specs (exp, *pos - 3);
10008 max_indices = 4 * num_specs + 4;
8d749320 10009 indices = XALLOCAVEC (LONGEST, max_indices);
52ce6436
PH
10010 indices[0] = indices[1] = low_index - 1;
10011 indices[2] = indices[3] = high_index + 1;
10012 num_indices = 4;
10013
10014 for (i = 0; i < n; i += 1)
10015 {
10016 switch (exp->elts[*pos].opcode)
10017 {
1fbf5ada
JB
10018 case OP_CHOICES:
10019 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
10020 &num_indices, max_indices,
10021 low_index, high_index);
10022 break;
10023 case OP_POSITIONAL:
10024 aggregate_assign_positional (container, lhs, exp, pos, indices,
52ce6436
PH
10025 &num_indices, max_indices,
10026 low_index, high_index);
1fbf5ada
JB
10027 break;
10028 case OP_OTHERS:
10029 if (i != n-1)
10030 error (_("Misplaced 'others' clause"));
10031 aggregate_assign_others (container, lhs, exp, pos, indices,
10032 num_indices, low_index, high_index);
10033 break;
10034 default:
10035 error (_("Internal error: bad aggregate clause"));
52ce6436
PH
10036 }
10037 }
10038
10039 return container;
10040}
10041
10042/* Assign into the component of LHS indexed by the OP_POSITIONAL
10043 construct at *POS, updating *POS past the construct, given that
10044 the positions are relative to lower bound LOW, where HIGH is the
10045 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
10046 updating *NUM_INDICES as needed. CONTAINER is as for
0963b4bd 10047 assign_aggregate. */
52ce6436
PH
10048static void
10049aggregate_assign_positional (struct value *container,
10050 struct value *lhs, struct expression *exp,
10051 int *pos, LONGEST *indices, int *num_indices,
10052 int max_indices, LONGEST low, LONGEST high)
10053{
10054 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
10055
10056 if (ind - 1 == high)
e1d5a0d2 10057 warning (_("Extra components in aggregate ignored."));
52ce6436
PH
10058 if (ind <= high)
10059 {
10060 add_component_interval (ind, ind, indices, num_indices, max_indices);
10061 *pos += 3;
10062 assign_component (container, lhs, ind, exp, pos);
10063 }
10064 else
10065 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10066}
10067
10068/* Assign into the components of LHS indexed by the OP_CHOICES
10069 construct at *POS, updating *POS past the construct, given that
10070 the allowable indices are LOW..HIGH. Record the indices assigned
10071 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
0963b4bd 10072 needed. CONTAINER is as for assign_aggregate. */
52ce6436
PH
10073static void
10074aggregate_assign_from_choices (struct value *container,
10075 struct value *lhs, struct expression *exp,
10076 int *pos, LONGEST *indices, int *num_indices,
10077 int max_indices, LONGEST low, LONGEST high)
10078{
10079 int j;
10080 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
10081 int choice_pos, expr_pc;
10082 int is_array = ada_is_direct_array_type (value_type (lhs));
10083
10084 choice_pos = *pos += 3;
10085
10086 for (j = 0; j < n_choices; j += 1)
10087 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10088 expr_pc = *pos;
10089 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10090
10091 for (j = 0; j < n_choices; j += 1)
10092 {
10093 LONGEST lower, upper;
10094 enum exp_opcode op = exp->elts[choice_pos].opcode;
5b4ee69b 10095
52ce6436
PH
10096 if (op == OP_DISCRETE_RANGE)
10097 {
10098 choice_pos += 1;
10099 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
10100 EVAL_NORMAL));
10101 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
10102 EVAL_NORMAL));
10103 }
10104 else if (is_array)
10105 {
10106 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
10107 EVAL_NORMAL));
10108 upper = lower;
10109 }
10110 else
10111 {
10112 int ind;
0d5cff50 10113 const char *name;
5b4ee69b 10114
52ce6436
PH
10115 switch (op)
10116 {
10117 case OP_NAME:
10118 name = &exp->elts[choice_pos + 2].string;
10119 break;
10120 case OP_VAR_VALUE:
10121 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
10122 break;
10123 default:
10124 error (_("Invalid record component association."));
10125 }
10126 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
10127 ind = 0;
10128 if (! find_struct_field (name, value_type (lhs), 0,
10129 NULL, NULL, NULL, NULL, &ind))
10130 error (_("Unknown component name: %s."), name);
10131 lower = upper = ind;
10132 }
10133
10134 if (lower <= upper && (lower < low || upper > high))
10135 error (_("Index in component association out of bounds."));
10136
10137 add_component_interval (lower, upper, indices, num_indices,
10138 max_indices);
10139 while (lower <= upper)
10140 {
10141 int pos1;
5b4ee69b 10142
52ce6436
PH
10143 pos1 = expr_pc;
10144 assign_component (container, lhs, lower, exp, &pos1);
10145 lower += 1;
10146 }
10147 }
10148}
10149
10150/* Assign the value of the expression in the OP_OTHERS construct in
10151 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
10152 have not been previously assigned. The index intervals already assigned
10153 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
0963b4bd 10154 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
52ce6436
PH
10155static void
10156aggregate_assign_others (struct value *container,
10157 struct value *lhs, struct expression *exp,
10158 int *pos, LONGEST *indices, int num_indices,
10159 LONGEST low, LONGEST high)
10160{
10161 int i;
5ce64950 10162 int expr_pc = *pos + 1;
52ce6436
PH
10163
10164 for (i = 0; i < num_indices - 2; i += 2)
10165 {
10166 LONGEST ind;
5b4ee69b 10167
52ce6436
PH
10168 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
10169 {
5ce64950 10170 int localpos;
5b4ee69b 10171
5ce64950
MS
10172 localpos = expr_pc;
10173 assign_component (container, lhs, ind, exp, &localpos);
52ce6436
PH
10174 }
10175 }
10176 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
10177}
10178
10179/* Add the interval [LOW .. HIGH] to the sorted set of intervals
10180 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
10181 modifying *SIZE as needed. It is an error if *SIZE exceeds
10182 MAX_SIZE. The resulting intervals do not overlap. */
10183static void
10184add_component_interval (LONGEST low, LONGEST high,
10185 LONGEST* indices, int *size, int max_size)
10186{
10187 int i, j;
5b4ee69b 10188
52ce6436
PH
10189 for (i = 0; i < *size; i += 2) {
10190 if (high >= indices[i] && low <= indices[i + 1])
10191 {
10192 int kh;
5b4ee69b 10193
52ce6436
PH
10194 for (kh = i + 2; kh < *size; kh += 2)
10195 if (high < indices[kh])
10196 break;
10197 if (low < indices[i])
10198 indices[i] = low;
10199 indices[i + 1] = indices[kh - 1];
10200 if (high > indices[i + 1])
10201 indices[i + 1] = high;
10202 memcpy (indices + i + 2, indices + kh, *size - kh);
10203 *size -= kh - i - 2;
10204 return;
10205 }
10206 else if (high < indices[i])
10207 break;
10208 }
10209
10210 if (*size == max_size)
10211 error (_("Internal error: miscounted aggregate components."));
10212 *size += 2;
10213 for (j = *size-1; j >= i+2; j -= 1)
10214 indices[j] = indices[j - 2];
10215 indices[i] = low;
10216 indices[i + 1] = high;
10217}
10218
6e48bd2c
JB
10219/* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
10220 is different. */
10221
10222static struct value *
b7e22850 10223ada_value_cast (struct type *type, struct value *arg2)
6e48bd2c
JB
10224{
10225 if (type == ada_check_typedef (value_type (arg2)))
10226 return arg2;
10227
10228 if (ada_is_fixed_point_type (type))
95f39a5b 10229 return cast_to_fixed (type, arg2);
6e48bd2c
JB
10230
10231 if (ada_is_fixed_point_type (value_type (arg2)))
a53b7a21 10232 return cast_from_fixed (type, arg2);
6e48bd2c
JB
10233
10234 return value_cast (type, arg2);
10235}
10236
284614f0
JB
10237/* Evaluating Ada expressions, and printing their result.
10238 ------------------------------------------------------
10239
21649b50
JB
10240 1. Introduction:
10241 ----------------
10242
284614f0
JB
10243 We usually evaluate an Ada expression in order to print its value.
10244 We also evaluate an expression in order to print its type, which
10245 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
10246 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
10247 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
10248 the evaluation compared to the EVAL_NORMAL, but is otherwise very
10249 similar.
10250
10251 Evaluating expressions is a little more complicated for Ada entities
10252 than it is for entities in languages such as C. The main reason for
10253 this is that Ada provides types whose definition might be dynamic.
10254 One example of such types is variant records. Or another example
10255 would be an array whose bounds can only be known at run time.
10256
10257 The following description is a general guide as to what should be
10258 done (and what should NOT be done) in order to evaluate an expression
10259 involving such types, and when. This does not cover how the semantic
10260 information is encoded by GNAT as this is covered separatly. For the
10261 document used as the reference for the GNAT encoding, see exp_dbug.ads
10262 in the GNAT sources.
10263
10264 Ideally, we should embed each part of this description next to its
10265 associated code. Unfortunately, the amount of code is so vast right
10266 now that it's hard to see whether the code handling a particular
10267 situation might be duplicated or not. One day, when the code is
10268 cleaned up, this guide might become redundant with the comments
10269 inserted in the code, and we might want to remove it.
10270
21649b50
JB
10271 2. ``Fixing'' an Entity, the Simple Case:
10272 -----------------------------------------
10273
284614f0
JB
10274 When evaluating Ada expressions, the tricky issue is that they may
10275 reference entities whose type contents and size are not statically
10276 known. Consider for instance a variant record:
10277
10278 type Rec (Empty : Boolean := True) is record
10279 case Empty is
10280 when True => null;
10281 when False => Value : Integer;
10282 end case;
10283 end record;
10284 Yes : Rec := (Empty => False, Value => 1);
10285 No : Rec := (empty => True);
10286
10287 The size and contents of that record depends on the value of the
10288 descriminant (Rec.Empty). At this point, neither the debugging
10289 information nor the associated type structure in GDB are able to
10290 express such dynamic types. So what the debugger does is to create
10291 "fixed" versions of the type that applies to the specific object.
10292 We also informally refer to this opperation as "fixing" an object,
10293 which means creating its associated fixed type.
10294
10295 Example: when printing the value of variable "Yes" above, its fixed
10296 type would look like this:
10297
10298 type Rec is record
10299 Empty : Boolean;
10300 Value : Integer;
10301 end record;
10302
10303 On the other hand, if we printed the value of "No", its fixed type
10304 would become:
10305
10306 type Rec is record
10307 Empty : Boolean;
10308 end record;
10309
10310 Things become a little more complicated when trying to fix an entity
10311 with a dynamic type that directly contains another dynamic type,
10312 such as an array of variant records, for instance. There are
10313 two possible cases: Arrays, and records.
10314
21649b50
JB
10315 3. ``Fixing'' Arrays:
10316 ---------------------
10317
10318 The type structure in GDB describes an array in terms of its bounds,
10319 and the type of its elements. By design, all elements in the array
10320 have the same type and we cannot represent an array of variant elements
10321 using the current type structure in GDB. When fixing an array,
10322 we cannot fix the array element, as we would potentially need one
10323 fixed type per element of the array. As a result, the best we can do
10324 when fixing an array is to produce an array whose bounds and size
10325 are correct (allowing us to read it from memory), but without having
10326 touched its element type. Fixing each element will be done later,
10327 when (if) necessary.
10328
10329 Arrays are a little simpler to handle than records, because the same
10330 amount of memory is allocated for each element of the array, even if
1b536f04 10331 the amount of space actually used by each element differs from element
21649b50 10332 to element. Consider for instance the following array of type Rec:
284614f0
JB
10333
10334 type Rec_Array is array (1 .. 2) of Rec;
10335
1b536f04
JB
10336 The actual amount of memory occupied by each element might be different
10337 from element to element, depending on the value of their discriminant.
21649b50 10338 But the amount of space reserved for each element in the array remains
1b536f04 10339 fixed regardless. So we simply need to compute that size using
21649b50
JB
10340 the debugging information available, from which we can then determine
10341 the array size (we multiply the number of elements of the array by
10342 the size of each element).
10343
10344 The simplest case is when we have an array of a constrained element
10345 type. For instance, consider the following type declarations:
10346
10347 type Bounded_String (Max_Size : Integer) is
10348 Length : Integer;
10349 Buffer : String (1 .. Max_Size);
10350 end record;
10351 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
10352
10353 In this case, the compiler describes the array as an array of
10354 variable-size elements (identified by its XVS suffix) for which
10355 the size can be read in the parallel XVZ variable.
10356
10357 In the case of an array of an unconstrained element type, the compiler
10358 wraps the array element inside a private PAD type. This type should not
10359 be shown to the user, and must be "unwrap"'ed before printing. Note
284614f0
JB
10360 that we also use the adjective "aligner" in our code to designate
10361 these wrapper types.
10362
1b536f04 10363 In some cases, the size allocated for each element is statically
21649b50
JB
10364 known. In that case, the PAD type already has the correct size,
10365 and the array element should remain unfixed.
10366
10367 But there are cases when this size is not statically known.
10368 For instance, assuming that "Five" is an integer variable:
284614f0
JB
10369
10370 type Dynamic is array (1 .. Five) of Integer;
10371 type Wrapper (Has_Length : Boolean := False) is record
10372 Data : Dynamic;
10373 case Has_Length is
10374 when True => Length : Integer;
10375 when False => null;
10376 end case;
10377 end record;
10378 type Wrapper_Array is array (1 .. 2) of Wrapper;
10379
10380 Hello : Wrapper_Array := (others => (Has_Length => True,
10381 Data => (others => 17),
10382 Length => 1));
10383
10384
10385 The debugging info would describe variable Hello as being an
10386 array of a PAD type. The size of that PAD type is not statically
10387 known, but can be determined using a parallel XVZ variable.
10388 In that case, a copy of the PAD type with the correct size should
10389 be used for the fixed array.
10390
21649b50
JB
10391 3. ``Fixing'' record type objects:
10392 ----------------------------------
10393
10394 Things are slightly different from arrays in the case of dynamic
284614f0
JB
10395 record types. In this case, in order to compute the associated
10396 fixed type, we need to determine the size and offset of each of
10397 its components. This, in turn, requires us to compute the fixed
10398 type of each of these components.
10399
10400 Consider for instance the example:
10401
10402 type Bounded_String (Max_Size : Natural) is record
10403 Str : String (1 .. Max_Size);
10404 Length : Natural;
10405 end record;
10406 My_String : Bounded_String (Max_Size => 10);
10407
10408 In that case, the position of field "Length" depends on the size
10409 of field Str, which itself depends on the value of the Max_Size
21649b50 10410 discriminant. In order to fix the type of variable My_String,
284614f0
JB
10411 we need to fix the type of field Str. Therefore, fixing a variant
10412 record requires us to fix each of its components.
10413
10414 However, if a component does not have a dynamic size, the component
10415 should not be fixed. In particular, fields that use a PAD type
10416 should not fixed. Here is an example where this might happen
10417 (assuming type Rec above):
10418
10419 type Container (Big : Boolean) is record
10420 First : Rec;
10421 After : Integer;
10422 case Big is
10423 when True => Another : Integer;
10424 when False => null;
10425 end case;
10426 end record;
10427 My_Container : Container := (Big => False,
10428 First => (Empty => True),
10429 After => 42);
10430
10431 In that example, the compiler creates a PAD type for component First,
10432 whose size is constant, and then positions the component After just
10433 right after it. The offset of component After is therefore constant
10434 in this case.
10435
10436 The debugger computes the position of each field based on an algorithm
10437 that uses, among other things, the actual position and size of the field
21649b50
JB
10438 preceding it. Let's now imagine that the user is trying to print
10439 the value of My_Container. If the type fixing was recursive, we would
284614f0
JB
10440 end up computing the offset of field After based on the size of the
10441 fixed version of field First. And since in our example First has
10442 only one actual field, the size of the fixed type is actually smaller
10443 than the amount of space allocated to that field, and thus we would
10444 compute the wrong offset of field After.
10445
21649b50
JB
10446 To make things more complicated, we need to watch out for dynamic
10447 components of variant records (identified by the ___XVL suffix in
10448 the component name). Even if the target type is a PAD type, the size
10449 of that type might not be statically known. So the PAD type needs
10450 to be unwrapped and the resulting type needs to be fixed. Otherwise,
10451 we might end up with the wrong size for our component. This can be
10452 observed with the following type declarations:
284614f0
JB
10453
10454 type Octal is new Integer range 0 .. 7;
10455 type Octal_Array is array (Positive range <>) of Octal;
10456 pragma Pack (Octal_Array);
10457
10458 type Octal_Buffer (Size : Positive) is record
10459 Buffer : Octal_Array (1 .. Size);
10460 Length : Integer;
10461 end record;
10462
10463 In that case, Buffer is a PAD type whose size is unset and needs
10464 to be computed by fixing the unwrapped type.
10465
21649b50
JB
10466 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
10467 ----------------------------------------------------------
10468
10469 Lastly, when should the sub-elements of an entity that remained unfixed
284614f0
JB
10470 thus far, be actually fixed?
10471
10472 The answer is: Only when referencing that element. For instance
10473 when selecting one component of a record, this specific component
10474 should be fixed at that point in time. Or when printing the value
10475 of a record, each component should be fixed before its value gets
10476 printed. Similarly for arrays, the element of the array should be
10477 fixed when printing each element of the array, or when extracting
10478 one element out of that array. On the other hand, fixing should
10479 not be performed on the elements when taking a slice of an array!
10480
31432a67 10481 Note that one of the side effects of miscomputing the offset and
284614f0
JB
10482 size of each field is that we end up also miscomputing the size
10483 of the containing type. This can have adverse results when computing
10484 the value of an entity. GDB fetches the value of an entity based
10485 on the size of its type, and thus a wrong size causes GDB to fetch
10486 the wrong amount of memory. In the case where the computed size is
10487 too small, GDB fetches too little data to print the value of our
31432a67 10488 entity. Results in this case are unpredictable, as we usually read
284614f0
JB
10489 past the buffer containing the data =:-o. */
10490
ced9779b
JB
10491/* Evaluate a subexpression of EXP, at index *POS, and return a value
10492 for that subexpression cast to TO_TYPE. Advance *POS over the
10493 subexpression. */
10494
10495static value *
10496ada_evaluate_subexp_for_cast (expression *exp, int *pos,
10497 enum noside noside, struct type *to_type)
10498{
10499 int pc = *pos;
10500
10501 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE
10502 || exp->elts[pc].opcode == OP_VAR_VALUE)
10503 {
10504 (*pos) += 4;
10505
10506 value *val;
10507 if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE)
10508 {
10509 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10510 return value_zero (to_type, not_lval);
10511
10512 val = evaluate_var_msym_value (noside,
10513 exp->elts[pc + 1].objfile,
10514 exp->elts[pc + 2].msymbol);
10515 }
10516 else
10517 val = evaluate_var_value (noside,
10518 exp->elts[pc + 1].block,
10519 exp->elts[pc + 2].symbol);
10520
10521 if (noside == EVAL_SKIP)
10522 return eval_skip_value (exp);
10523
10524 val = ada_value_cast (to_type, val);
10525
10526 /* Follow the Ada language semantics that do not allow taking
10527 an address of the result of a cast (view conversion in Ada). */
10528 if (VALUE_LVAL (val) == lval_memory)
10529 {
10530 if (value_lazy (val))
10531 value_fetch_lazy (val);
10532 VALUE_LVAL (val) = not_lval;
10533 }
10534 return val;
10535 }
10536
10537 value *val = evaluate_subexp (to_type, exp, pos, noside);
10538 if (noside == EVAL_SKIP)
10539 return eval_skip_value (exp);
10540 return ada_value_cast (to_type, val);
10541}
10542
284614f0
JB
10543/* Implement the evaluate_exp routine in the exp_descriptor structure
10544 for the Ada language. */
10545
52ce6436 10546static struct value *
ebf56fd3 10547ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
4c4b4cd2 10548 int *pos, enum noside noside)
14f9c5c9
AS
10549{
10550 enum exp_opcode op;
b5385fc0 10551 int tem;
14f9c5c9 10552 int pc;
5ec18f2b 10553 int preeval_pos;
14f9c5c9
AS
10554 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
10555 struct type *type;
52ce6436 10556 int nargs, oplen;
d2e4a39e 10557 struct value **argvec;
14f9c5c9 10558
d2e4a39e
AS
10559 pc = *pos;
10560 *pos += 1;
14f9c5c9
AS
10561 op = exp->elts[pc].opcode;
10562
d2e4a39e 10563 switch (op)
14f9c5c9
AS
10564 {
10565 default:
10566 *pos -= 1;
6e48bd2c 10567 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
ca1f964d
JG
10568
10569 if (noside == EVAL_NORMAL)
10570 arg1 = unwrap_value (arg1);
6e48bd2c 10571
edd079d9 10572 /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided,
6e48bd2c
JB
10573 then we need to perform the conversion manually, because
10574 evaluate_subexp_standard doesn't do it. This conversion is
10575 necessary in Ada because the different kinds of float/fixed
10576 types in Ada have different representations.
10577
10578 Similarly, we need to perform the conversion from OP_LONG
10579 ourselves. */
edd079d9 10580 if ((op == OP_FLOAT || op == OP_LONG) && expect_type != NULL)
b7e22850 10581 arg1 = ada_value_cast (expect_type, arg1);
6e48bd2c
JB
10582
10583 return arg1;
4c4b4cd2
PH
10584
10585 case OP_STRING:
10586 {
76a01679 10587 struct value *result;
5b4ee69b 10588
76a01679
JB
10589 *pos -= 1;
10590 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
10591 /* The result type will have code OP_STRING, bashed there from
10592 OP_ARRAY. Bash it back. */
df407dfe
AC
10593 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
10594 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
76a01679 10595 return result;
4c4b4cd2 10596 }
14f9c5c9
AS
10597
10598 case UNOP_CAST:
10599 (*pos) += 2;
10600 type = exp->elts[pc + 1].type;
ced9779b 10601 return ada_evaluate_subexp_for_cast (exp, pos, noside, type);
14f9c5c9 10602
4c4b4cd2
PH
10603 case UNOP_QUAL:
10604 (*pos) += 2;
10605 type = exp->elts[pc + 1].type;
10606 return ada_evaluate_subexp (type, exp, pos, noside);
10607
14f9c5c9
AS
10608 case BINOP_ASSIGN:
10609 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
52ce6436
PH
10610 if (exp->elts[*pos].opcode == OP_AGGREGATE)
10611 {
10612 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
10613 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
10614 return arg1;
10615 return ada_value_assign (arg1, arg1);
10616 }
003f3813
JB
10617 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
10618 except if the lhs of our assignment is a convenience variable.
10619 In the case of assigning to a convenience variable, the lhs
10620 should be exactly the result of the evaluation of the rhs. */
10621 type = value_type (arg1);
10622 if (VALUE_LVAL (arg1) == lval_internalvar)
10623 type = NULL;
10624 arg2 = evaluate_subexp (type, exp, pos, noside);
14f9c5c9 10625 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
4c4b4cd2 10626 return arg1;
df407dfe
AC
10627 if (ada_is_fixed_point_type (value_type (arg1)))
10628 arg2 = cast_to_fixed (value_type (arg1), arg2);
10629 else if (ada_is_fixed_point_type (value_type (arg2)))
76a01679 10630 error
323e0a4a 10631 (_("Fixed-point values must be assigned to fixed-point variables"));
d2e4a39e 10632 else
df407dfe 10633 arg2 = coerce_for_assign (value_type (arg1), arg2);
4c4b4cd2 10634 return ada_value_assign (arg1, arg2);
14f9c5c9
AS
10635
10636 case BINOP_ADD:
10637 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
10638 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
10639 if (noside == EVAL_SKIP)
4c4b4cd2 10640 goto nosideret;
2ac8a782
JB
10641 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
10642 return (value_from_longest
10643 (value_type (arg1),
10644 value_as_long (arg1) + value_as_long (arg2)));
c40cc657
JB
10645 if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR)
10646 return (value_from_longest
10647 (value_type (arg2),
10648 value_as_long (arg1) + value_as_long (arg2)));
df407dfe
AC
10649 if ((ada_is_fixed_point_type (value_type (arg1))
10650 || ada_is_fixed_point_type (value_type (arg2)))
10651 && value_type (arg1) != value_type (arg2))
323e0a4a 10652 error (_("Operands of fixed-point addition must have the same type"));
b7789565
JB
10653 /* Do the addition, and cast the result to the type of the first
10654 argument. We cannot cast the result to a reference type, so if
10655 ARG1 is a reference type, find its underlying type. */
10656 type = value_type (arg1);
10657 while (TYPE_CODE (type) == TYPE_CODE_REF)
10658 type = TYPE_TARGET_TYPE (type);
f44316fa 10659 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
89eef114 10660 return value_cast (type, value_binop (arg1, arg2, BINOP_ADD));
14f9c5c9
AS
10661
10662 case BINOP_SUB:
10663 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
10664 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
10665 if (noside == EVAL_SKIP)
4c4b4cd2 10666 goto nosideret;
2ac8a782
JB
10667 if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR)
10668 return (value_from_longest
10669 (value_type (arg1),
10670 value_as_long (arg1) - value_as_long (arg2)));
c40cc657
JB
10671 if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR)
10672 return (value_from_longest
10673 (value_type (arg2),
10674 value_as_long (arg1) - value_as_long (arg2)));
df407dfe
AC
10675 if ((ada_is_fixed_point_type (value_type (arg1))
10676 || ada_is_fixed_point_type (value_type (arg2)))
10677 && value_type (arg1) != value_type (arg2))
0963b4bd
MS
10678 error (_("Operands of fixed-point subtraction "
10679 "must have the same type"));
b7789565
JB
10680 /* Do the substraction, and cast the result to the type of the first
10681 argument. We cannot cast the result to a reference type, so if
10682 ARG1 is a reference type, find its underlying type. */
10683 type = value_type (arg1);
10684 while (TYPE_CODE (type) == TYPE_CODE_REF)
10685 type = TYPE_TARGET_TYPE (type);
f44316fa 10686 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
89eef114 10687 return value_cast (type, value_binop (arg1, arg2, BINOP_SUB));
14f9c5c9
AS
10688
10689 case BINOP_MUL:
10690 case BINOP_DIV:
e1578042
JB
10691 case BINOP_REM:
10692 case BINOP_MOD:
14f9c5c9
AS
10693 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10694 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10695 if (noside == EVAL_SKIP)
4c4b4cd2 10696 goto nosideret;
e1578042 10697 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
9c2be529
JB
10698 {
10699 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10700 return value_zero (value_type (arg1), not_lval);
10701 }
14f9c5c9 10702 else
4c4b4cd2 10703 {
a53b7a21 10704 type = builtin_type (exp->gdbarch)->builtin_double;
df407dfe 10705 if (ada_is_fixed_point_type (value_type (arg1)))
a53b7a21 10706 arg1 = cast_from_fixed (type, arg1);
df407dfe 10707 if (ada_is_fixed_point_type (value_type (arg2)))
a53b7a21 10708 arg2 = cast_from_fixed (type, arg2);
f44316fa 10709 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
4c4b4cd2
PH
10710 return ada_value_binop (arg1, arg2, op);
10711 }
10712
4c4b4cd2
PH
10713 case BINOP_EQUAL:
10714 case BINOP_NOTEQUAL:
14f9c5c9 10715 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
df407dfe 10716 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
14f9c5c9 10717 if (noside == EVAL_SKIP)
76a01679 10718 goto nosideret;
4c4b4cd2 10719 if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 10720 tem = 0;
4c4b4cd2 10721 else
f44316fa
UW
10722 {
10723 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
10724 tem = ada_value_equal (arg1, arg2);
10725 }
4c4b4cd2 10726 if (op == BINOP_NOTEQUAL)
76a01679 10727 tem = !tem;
fbb06eb1
UW
10728 type = language_bool_type (exp->language_defn, exp->gdbarch);
10729 return value_from_longest (type, (LONGEST) tem);
4c4b4cd2
PH
10730
10731 case UNOP_NEG:
10732 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10733 if (noside == EVAL_SKIP)
10734 goto nosideret;
df407dfe
AC
10735 else if (ada_is_fixed_point_type (value_type (arg1)))
10736 return value_cast (value_type (arg1), value_neg (arg1));
14f9c5c9 10737 else
f44316fa
UW
10738 {
10739 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
10740 return value_neg (arg1);
10741 }
4c4b4cd2 10742
2330c6c6
JB
10743 case BINOP_LOGICAL_AND:
10744 case BINOP_LOGICAL_OR:
10745 case UNOP_LOGICAL_NOT:
000d5124
JB
10746 {
10747 struct value *val;
10748
10749 *pos -= 1;
10750 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
fbb06eb1
UW
10751 type = language_bool_type (exp->language_defn, exp->gdbarch);
10752 return value_cast (type, val);
000d5124 10753 }
2330c6c6
JB
10754
10755 case BINOP_BITWISE_AND:
10756 case BINOP_BITWISE_IOR:
10757 case BINOP_BITWISE_XOR:
000d5124
JB
10758 {
10759 struct value *val;
10760
10761 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
10762 *pos = pc;
10763 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
10764
10765 return value_cast (value_type (arg1), val);
10766 }
2330c6c6 10767
14f9c5c9
AS
10768 case OP_VAR_VALUE:
10769 *pos -= 1;
6799def4 10770
14f9c5c9 10771 if (noside == EVAL_SKIP)
4c4b4cd2
PH
10772 {
10773 *pos += 4;
10774 goto nosideret;
10775 }
da5c522f
JB
10776
10777 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
76a01679
JB
10778 /* Only encountered when an unresolved symbol occurs in a
10779 context other than a function call, in which case, it is
52ce6436 10780 invalid. */
323e0a4a 10781 error (_("Unexpected unresolved symbol, %s, during evaluation"),
4c4b4cd2 10782 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
da5c522f
JB
10783
10784 if (noside == EVAL_AVOID_SIDE_EFFECTS)
4c4b4cd2 10785 {
0c1f74cf 10786 type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol));
31dbc1c5
JB
10787 /* Check to see if this is a tagged type. We also need to handle
10788 the case where the type is a reference to a tagged type, but
10789 we have to be careful to exclude pointers to tagged types.
10790 The latter should be shown as usual (as a pointer), whereas
10791 a reference should mostly be transparent to the user. */
10792 if (ada_is_tagged_type (type, 0)
023db19c 10793 || (TYPE_CODE (type) == TYPE_CODE_REF
31dbc1c5 10794 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)))
0d72a7c3
JB
10795 {
10796 /* Tagged types are a little special in the fact that the real
10797 type is dynamic and can only be determined by inspecting the
10798 object's tag. This means that we need to get the object's
10799 value first (EVAL_NORMAL) and then extract the actual object
10800 type from its tag.
10801
10802 Note that we cannot skip the final step where we extract
10803 the object type from its tag, because the EVAL_NORMAL phase
10804 results in dynamic components being resolved into fixed ones.
10805 This can cause problems when trying to print the type
10806 description of tagged types whose parent has a dynamic size:
10807 We use the type name of the "_parent" component in order
10808 to print the name of the ancestor type in the type description.
10809 If that component had a dynamic size, the resolution into
10810 a fixed type would result in the loss of that type name,
10811 thus preventing us from printing the name of the ancestor
10812 type in the type description. */
10813 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL);
10814
10815 if (TYPE_CODE (type) != TYPE_CODE_REF)
10816 {
10817 struct type *actual_type;
10818
10819 actual_type = type_from_tag (ada_value_tag (arg1));
10820 if (actual_type == NULL)
10821 /* If, for some reason, we were unable to determine
10822 the actual type from the tag, then use the static
10823 approximation that we just computed as a fallback.
10824 This can happen if the debugging information is
10825 incomplete, for instance. */
10826 actual_type = type;
10827 return value_zero (actual_type, not_lval);
10828 }
10829 else
10830 {
10831 /* In the case of a ref, ada_coerce_ref takes care
10832 of determining the actual type. But the evaluation
10833 should return a ref as it should be valid to ask
10834 for its address; so rebuild a ref after coerce. */
10835 arg1 = ada_coerce_ref (arg1);
a65cfae5 10836 return value_ref (arg1, TYPE_CODE_REF);
0d72a7c3
JB
10837 }
10838 }
0c1f74cf 10839
84754697
JB
10840 /* Records and unions for which GNAT encodings have been
10841 generated need to be statically fixed as well.
10842 Otherwise, non-static fixing produces a type where
10843 all dynamic properties are removed, which prevents "ptype"
10844 from being able to completely describe the type.
10845 For instance, a case statement in a variant record would be
10846 replaced by the relevant components based on the actual
10847 value of the discriminants. */
10848 if ((TYPE_CODE (type) == TYPE_CODE_STRUCT
10849 && dynamic_template_type (type) != NULL)
10850 || (TYPE_CODE (type) == TYPE_CODE_UNION
10851 && ada_find_parallel_type (type, "___XVU") != NULL))
10852 {
10853 *pos += 4;
10854 return value_zero (to_static_fixed_type (type), not_lval);
10855 }
4c4b4cd2 10856 }
da5c522f
JB
10857
10858 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
10859 return ada_to_fixed_value (arg1);
4c4b4cd2
PH
10860
10861 case OP_FUNCALL:
10862 (*pos) += 2;
10863
10864 /* Allocate arg vector, including space for the function to be
10865 called in argvec[0] and a terminating NULL. */
10866 nargs = longest_to_int (exp->elts[pc + 1].longconst);
8d749320 10867 argvec = XALLOCAVEC (struct value *, nargs + 2);
4c4b4cd2
PH
10868
10869 if (exp->elts[*pos].opcode == OP_VAR_VALUE
76a01679 10870 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
323e0a4a 10871 error (_("Unexpected unresolved symbol, %s, during evaluation"),
4c4b4cd2
PH
10872 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
10873 else
10874 {
10875 for (tem = 0; tem <= nargs; tem += 1)
10876 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
10877 argvec[tem] = 0;
10878
10879 if (noside == EVAL_SKIP)
10880 goto nosideret;
10881 }
10882
ad82864c
JB
10883 if (ada_is_constrained_packed_array_type
10884 (desc_base_type (value_type (argvec[0]))))
4c4b4cd2 10885 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
284614f0
JB
10886 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
10887 && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0)
10888 /* This is a packed array that has already been fixed, and
10889 therefore already coerced to a simple array. Nothing further
10890 to do. */
10891 ;
e6c2c623
PMR
10892 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF)
10893 {
10894 /* Make sure we dereference references so that all the code below
10895 feels like it's really handling the referenced value. Wrapping
10896 types (for alignment) may be there, so make sure we strip them as
10897 well. */
10898 argvec[0] = ada_to_fixed_value (coerce_ref (argvec[0]));
10899 }
10900 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
10901 && VALUE_LVAL (argvec[0]) == lval_memory)
10902 argvec[0] = value_addr (argvec[0]);
4c4b4cd2 10903
df407dfe 10904 type = ada_check_typedef (value_type (argvec[0]));
720d1a40
JB
10905
10906 /* Ada allows us to implicitly dereference arrays when subscripting
8f465ea7
JB
10907 them. So, if this is an array typedef (encoding use for array
10908 access types encoded as fat pointers), strip it now. */
720d1a40
JB
10909 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
10910 type = ada_typedef_target_type (type);
10911
4c4b4cd2
PH
10912 if (TYPE_CODE (type) == TYPE_CODE_PTR)
10913 {
61ee279c 10914 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
4c4b4cd2
PH
10915 {
10916 case TYPE_CODE_FUNC:
61ee279c 10917 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
4c4b4cd2
PH
10918 break;
10919 case TYPE_CODE_ARRAY:
10920 break;
10921 case TYPE_CODE_STRUCT:
10922 if (noside != EVAL_AVOID_SIDE_EFFECTS)
10923 argvec[0] = ada_value_ind (argvec[0]);
61ee279c 10924 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
4c4b4cd2
PH
10925 break;
10926 default:
323e0a4a 10927 error (_("cannot subscript or call something of type `%s'"),
df407dfe 10928 ada_type_name (value_type (argvec[0])));
4c4b4cd2
PH
10929 break;
10930 }
10931 }
10932
10933 switch (TYPE_CODE (type))
10934 {
10935 case TYPE_CODE_FUNC:
10936 if (noside == EVAL_AVOID_SIDE_EFFECTS)
c8ea1972 10937 {
7022349d
PA
10938 if (TYPE_TARGET_TYPE (type) == NULL)
10939 error_call_unknown_return_type (NULL);
10940 return allocate_value (TYPE_TARGET_TYPE (type));
c8ea1972 10941 }
e71585ff
PA
10942 return call_function_by_hand (argvec[0], NULL,
10943 gdb::make_array_view (argvec + 1,
10944 nargs));
c8ea1972
PH
10945 case TYPE_CODE_INTERNAL_FUNCTION:
10946 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10947 /* We don't know anything about what the internal
10948 function might return, but we have to return
10949 something. */
10950 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
10951 not_lval);
10952 else
10953 return call_internal_function (exp->gdbarch, exp->language_defn,
10954 argvec[0], nargs, argvec + 1);
10955
4c4b4cd2
PH
10956 case TYPE_CODE_STRUCT:
10957 {
10958 int arity;
10959
4c4b4cd2
PH
10960 arity = ada_array_arity (type);
10961 type = ada_array_element_type (type, nargs);
10962 if (type == NULL)
323e0a4a 10963 error (_("cannot subscript or call a record"));
4c4b4cd2 10964 if (arity != nargs)
323e0a4a 10965 error (_("wrong number of subscripts; expecting %d"), arity);
4c4b4cd2 10966 if (noside == EVAL_AVOID_SIDE_EFFECTS)
0a07e705 10967 return value_zero (ada_aligned_type (type), lval_memory);
4c4b4cd2
PH
10968 return
10969 unwrap_value (ada_value_subscript
10970 (argvec[0], nargs, argvec + 1));
10971 }
10972 case TYPE_CODE_ARRAY:
10973 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10974 {
10975 type = ada_array_element_type (type, nargs);
10976 if (type == NULL)
323e0a4a 10977 error (_("element type of array unknown"));
4c4b4cd2 10978 else
0a07e705 10979 return value_zero (ada_aligned_type (type), lval_memory);
4c4b4cd2
PH
10980 }
10981 return
10982 unwrap_value (ada_value_subscript
10983 (ada_coerce_to_simple_array (argvec[0]),
10984 nargs, argvec + 1));
10985 case TYPE_CODE_PTR: /* Pointer to array */
4c4b4cd2
PH
10986 if (noside == EVAL_AVOID_SIDE_EFFECTS)
10987 {
deede10c 10988 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
4c4b4cd2
PH
10989 type = ada_array_element_type (type, nargs);
10990 if (type == NULL)
323e0a4a 10991 error (_("element type of array unknown"));
4c4b4cd2 10992 else
0a07e705 10993 return value_zero (ada_aligned_type (type), lval_memory);
4c4b4cd2
PH
10994 }
10995 return
deede10c
JB
10996 unwrap_value (ada_value_ptr_subscript (argvec[0],
10997 nargs, argvec + 1));
4c4b4cd2
PH
10998
10999 default:
e1d5a0d2
PH
11000 error (_("Attempt to index or call something other than an "
11001 "array or function"));
4c4b4cd2
PH
11002 }
11003
11004 case TERNOP_SLICE:
11005 {
11006 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11007 struct value *low_bound_val =
11008 evaluate_subexp (NULL_TYPE, exp, pos, noside);
714e53ab
PH
11009 struct value *high_bound_val =
11010 evaluate_subexp (NULL_TYPE, exp, pos, noside);
11011 LONGEST low_bound;
11012 LONGEST high_bound;
5b4ee69b 11013
994b9211
AC
11014 low_bound_val = coerce_ref (low_bound_val);
11015 high_bound_val = coerce_ref (high_bound_val);
aa715135
JG
11016 low_bound = value_as_long (low_bound_val);
11017 high_bound = value_as_long (high_bound_val);
963a6417 11018
4c4b4cd2
PH
11019 if (noside == EVAL_SKIP)
11020 goto nosideret;
11021
4c4b4cd2
PH
11022 /* If this is a reference to an aligner type, then remove all
11023 the aligners. */
df407dfe
AC
11024 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
11025 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
11026 TYPE_TARGET_TYPE (value_type (array)) =
11027 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
4c4b4cd2 11028
ad82864c 11029 if (ada_is_constrained_packed_array_type (value_type (array)))
323e0a4a 11030 error (_("cannot slice a packed array"));
4c4b4cd2
PH
11031
11032 /* If this is a reference to an array or an array lvalue,
11033 convert to a pointer. */
df407dfe
AC
11034 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
11035 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
4c4b4cd2
PH
11036 && VALUE_LVAL (array) == lval_memory))
11037 array = value_addr (array);
11038
1265e4aa 11039 if (noside == EVAL_AVOID_SIDE_EFFECTS
61ee279c 11040 && ada_is_array_descriptor_type (ada_check_typedef
df407dfe 11041 (value_type (array))))
bff8c71f
TT
11042 return empty_array (ada_type_of_array (array, 0), low_bound,
11043 high_bound);
4c4b4cd2
PH
11044
11045 array = ada_coerce_to_simple_array_ptr (array);
11046
714e53ab
PH
11047 /* If we have more than one level of pointer indirection,
11048 dereference the value until we get only one level. */
df407dfe
AC
11049 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
11050 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
714e53ab
PH
11051 == TYPE_CODE_PTR))
11052 array = value_ind (array);
11053
11054 /* Make sure we really do have an array type before going further,
11055 to avoid a SEGV when trying to get the index type or the target
11056 type later down the road if the debug info generated by
11057 the compiler is incorrect or incomplete. */
df407dfe 11058 if (!ada_is_simple_array_type (value_type (array)))
323e0a4a 11059 error (_("cannot take slice of non-array"));
714e53ab 11060
828292f2
JB
11061 if (TYPE_CODE (ada_check_typedef (value_type (array)))
11062 == TYPE_CODE_PTR)
4c4b4cd2 11063 {
828292f2
JB
11064 struct type *type0 = ada_check_typedef (value_type (array));
11065
0b5d8877 11066 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
bff8c71f 11067 return empty_array (TYPE_TARGET_TYPE (type0), low_bound, high_bound);
4c4b4cd2
PH
11068 else
11069 {
11070 struct type *arr_type0 =
828292f2 11071 to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1);
5b4ee69b 11072
f5938064
JG
11073 return ada_value_slice_from_ptr (array, arr_type0,
11074 longest_to_int (low_bound),
11075 longest_to_int (high_bound));
4c4b4cd2
PH
11076 }
11077 }
11078 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
11079 return array;
11080 else if (high_bound < low_bound)
bff8c71f 11081 return empty_array (value_type (array), low_bound, high_bound);
4c4b4cd2 11082 else
529cad9c
PH
11083 return ada_value_slice (array, longest_to_int (low_bound),
11084 longest_to_int (high_bound));
4c4b4cd2 11085 }
14f9c5c9 11086
4c4b4cd2
PH
11087 case UNOP_IN_RANGE:
11088 (*pos) += 2;
11089 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8008e265 11090 type = check_typedef (exp->elts[pc + 1].type);
14f9c5c9 11091
14f9c5c9 11092 if (noside == EVAL_SKIP)
4c4b4cd2 11093 goto nosideret;
14f9c5c9 11094
4c4b4cd2
PH
11095 switch (TYPE_CODE (type))
11096 {
11097 default:
e1d5a0d2
PH
11098 lim_warning (_("Membership test incompletely implemented; "
11099 "always returns true"));
fbb06eb1
UW
11100 type = language_bool_type (exp->language_defn, exp->gdbarch);
11101 return value_from_longest (type, (LONGEST) 1);
4c4b4cd2
PH
11102
11103 case TYPE_CODE_RANGE:
030b4912
UW
11104 arg2 = value_from_longest (type, TYPE_LOW_BOUND (type));
11105 arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type));
f44316fa
UW
11106 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11107 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
fbb06eb1
UW
11108 type = language_bool_type (exp->language_defn, exp->gdbarch);
11109 return
11110 value_from_longest (type,
4c4b4cd2
PH
11111 (value_less (arg1, arg3)
11112 || value_equal (arg1, arg3))
11113 && (value_less (arg2, arg1)
11114 || value_equal (arg2, arg1)));
11115 }
11116
11117 case BINOP_IN_BOUNDS:
14f9c5c9 11118 (*pos) += 2;
4c4b4cd2
PH
11119 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11120 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
14f9c5c9 11121
4c4b4cd2
PH
11122 if (noside == EVAL_SKIP)
11123 goto nosideret;
14f9c5c9 11124
4c4b4cd2 11125 if (noside == EVAL_AVOID_SIDE_EFFECTS)
fbb06eb1
UW
11126 {
11127 type = language_bool_type (exp->language_defn, exp->gdbarch);
11128 return value_zero (type, not_lval);
11129 }
14f9c5c9 11130
4c4b4cd2 11131 tem = longest_to_int (exp->elts[pc + 1].longconst);
14f9c5c9 11132
1eea4ebd
UW
11133 type = ada_index_type (value_type (arg2), tem, "range");
11134 if (!type)
11135 type = value_type (arg1);
14f9c5c9 11136
1eea4ebd
UW
11137 arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1));
11138 arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0));
d2e4a39e 11139
f44316fa
UW
11140 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11141 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
fbb06eb1 11142 type = language_bool_type (exp->language_defn, exp->gdbarch);
4c4b4cd2 11143 return
fbb06eb1 11144 value_from_longest (type,
4c4b4cd2
PH
11145 (value_less (arg1, arg3)
11146 || value_equal (arg1, arg3))
11147 && (value_less (arg2, arg1)
11148 || value_equal (arg2, arg1)));
11149
11150 case TERNOP_IN_RANGE:
11151 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11152 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11153 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11154
11155 if (noside == EVAL_SKIP)
11156 goto nosideret;
11157
f44316fa
UW
11158 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11159 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3);
fbb06eb1 11160 type = language_bool_type (exp->language_defn, exp->gdbarch);
4c4b4cd2 11161 return
fbb06eb1 11162 value_from_longest (type,
4c4b4cd2
PH
11163 (value_less (arg1, arg3)
11164 || value_equal (arg1, arg3))
11165 && (value_less (arg2, arg1)
11166 || value_equal (arg2, arg1)));
11167
11168 case OP_ATR_FIRST:
11169 case OP_ATR_LAST:
11170 case OP_ATR_LENGTH:
11171 {
76a01679 11172 struct type *type_arg;
5b4ee69b 11173
76a01679
JB
11174 if (exp->elts[*pos].opcode == OP_TYPE)
11175 {
11176 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
11177 arg1 = NULL;
5bc23cb3 11178 type_arg = check_typedef (exp->elts[pc + 2].type);
76a01679
JB
11179 }
11180 else
11181 {
11182 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11183 type_arg = NULL;
11184 }
11185
11186 if (exp->elts[*pos].opcode != OP_LONG)
323e0a4a 11187 error (_("Invalid operand to '%s"), ada_attribute_name (op));
76a01679
JB
11188 tem = longest_to_int (exp->elts[*pos + 2].longconst);
11189 *pos += 4;
11190
11191 if (noside == EVAL_SKIP)
11192 goto nosideret;
11193
11194 if (type_arg == NULL)
11195 {
11196 arg1 = ada_coerce_ref (arg1);
11197
ad82864c 11198 if (ada_is_constrained_packed_array_type (value_type (arg1)))
76a01679
JB
11199 arg1 = ada_coerce_to_simple_array (arg1);
11200
aa4fb036 11201 if (op == OP_ATR_LENGTH)
1eea4ebd 11202 type = builtin_type (exp->gdbarch)->builtin_int;
aa4fb036
JB
11203 else
11204 {
11205 type = ada_index_type (value_type (arg1), tem,
11206 ada_attribute_name (op));
11207 if (type == NULL)
11208 type = builtin_type (exp->gdbarch)->builtin_int;
11209 }
76a01679
JB
11210
11211 if (noside == EVAL_AVOID_SIDE_EFFECTS)
1eea4ebd 11212 return allocate_value (type);
76a01679
JB
11213
11214 switch (op)
11215 {
11216 default: /* Should never happen. */
323e0a4a 11217 error (_("unexpected attribute encountered"));
76a01679 11218 case OP_ATR_FIRST:
1eea4ebd
UW
11219 return value_from_longest
11220 (type, ada_array_bound (arg1, tem, 0));
76a01679 11221 case OP_ATR_LAST:
1eea4ebd
UW
11222 return value_from_longest
11223 (type, ada_array_bound (arg1, tem, 1));
76a01679 11224 case OP_ATR_LENGTH:
1eea4ebd
UW
11225 return value_from_longest
11226 (type, ada_array_length (arg1, tem));
76a01679
JB
11227 }
11228 }
11229 else if (discrete_type_p (type_arg))
11230 {
11231 struct type *range_type;
0d5cff50 11232 const char *name = ada_type_name (type_arg);
5b4ee69b 11233
76a01679
JB
11234 range_type = NULL;
11235 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
28c85d6c 11236 range_type = to_fixed_range_type (type_arg, NULL);
76a01679
JB
11237 if (range_type == NULL)
11238 range_type = type_arg;
11239 switch (op)
11240 {
11241 default:
323e0a4a 11242 error (_("unexpected attribute encountered"));
76a01679 11243 case OP_ATR_FIRST:
690cc4eb 11244 return value_from_longest
43bbcdc2 11245 (range_type, ada_discrete_type_low_bound (range_type));
76a01679 11246 case OP_ATR_LAST:
690cc4eb 11247 return value_from_longest
43bbcdc2 11248 (range_type, ada_discrete_type_high_bound (range_type));
76a01679 11249 case OP_ATR_LENGTH:
323e0a4a 11250 error (_("the 'length attribute applies only to array types"));
76a01679
JB
11251 }
11252 }
11253 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
323e0a4a 11254 error (_("unimplemented type attribute"));
76a01679
JB
11255 else
11256 {
11257 LONGEST low, high;
11258
ad82864c
JB
11259 if (ada_is_constrained_packed_array_type (type_arg))
11260 type_arg = decode_constrained_packed_array_type (type_arg);
76a01679 11261
aa4fb036 11262 if (op == OP_ATR_LENGTH)
1eea4ebd 11263 type = builtin_type (exp->gdbarch)->builtin_int;
aa4fb036
JB
11264 else
11265 {
11266 type = ada_index_type (type_arg, tem, ada_attribute_name (op));
11267 if (type == NULL)
11268 type = builtin_type (exp->gdbarch)->builtin_int;
11269 }
1eea4ebd 11270
76a01679
JB
11271 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11272 return allocate_value (type);
11273
11274 switch (op)
11275 {
11276 default:
323e0a4a 11277 error (_("unexpected attribute encountered"));
76a01679 11278 case OP_ATR_FIRST:
1eea4ebd 11279 low = ada_array_bound_from_type (type_arg, tem, 0);
76a01679
JB
11280 return value_from_longest (type, low);
11281 case OP_ATR_LAST:
1eea4ebd 11282 high = ada_array_bound_from_type (type_arg, tem, 1);
76a01679
JB
11283 return value_from_longest (type, high);
11284 case OP_ATR_LENGTH:
1eea4ebd
UW
11285 low = ada_array_bound_from_type (type_arg, tem, 0);
11286 high = ada_array_bound_from_type (type_arg, tem, 1);
76a01679
JB
11287 return value_from_longest (type, high - low + 1);
11288 }
11289 }
14f9c5c9
AS
11290 }
11291
4c4b4cd2
PH
11292 case OP_ATR_TAG:
11293 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11294 if (noside == EVAL_SKIP)
76a01679 11295 goto nosideret;
4c4b4cd2
PH
11296
11297 if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 11298 return value_zero (ada_tag_type (arg1), not_lval);
4c4b4cd2
PH
11299
11300 return ada_value_tag (arg1);
11301
11302 case OP_ATR_MIN:
11303 case OP_ATR_MAX:
11304 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
14f9c5c9
AS
11305 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11306 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11307 if (noside == EVAL_SKIP)
76a01679 11308 goto nosideret;
d2e4a39e 11309 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
df407dfe 11310 return value_zero (value_type (arg1), not_lval);
14f9c5c9 11311 else
f44316fa
UW
11312 {
11313 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11314 return value_binop (arg1, arg2,
11315 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
11316 }
14f9c5c9 11317
4c4b4cd2
PH
11318 case OP_ATR_MODULUS:
11319 {
31dedfee 11320 struct type *type_arg = check_typedef (exp->elts[pc + 2].type);
4c4b4cd2 11321
5b4ee69b 11322 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
76a01679
JB
11323 if (noside == EVAL_SKIP)
11324 goto nosideret;
4c4b4cd2 11325
76a01679 11326 if (!ada_is_modular_type (type_arg))
323e0a4a 11327 error (_("'modulus must be applied to modular type"));
4c4b4cd2 11328
76a01679
JB
11329 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
11330 ada_modulus (type_arg));
4c4b4cd2
PH
11331 }
11332
11333
11334 case OP_ATR_POS:
11335 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
14f9c5c9
AS
11336 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11337 if (noside == EVAL_SKIP)
76a01679 11338 goto nosideret;
3cb382c9
UW
11339 type = builtin_type (exp->gdbarch)->builtin_int;
11340 if (noside == EVAL_AVOID_SIDE_EFFECTS)
11341 return value_zero (type, not_lval);
14f9c5c9 11342 else
3cb382c9 11343 return value_pos_atr (type, arg1);
14f9c5c9 11344
4c4b4cd2
PH
11345 case OP_ATR_SIZE:
11346 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8c1c099f
JB
11347 type = value_type (arg1);
11348
11349 /* If the argument is a reference, then dereference its type, since
11350 the user is really asking for the size of the actual object,
11351 not the size of the pointer. */
11352 if (TYPE_CODE (type) == TYPE_CODE_REF)
11353 type = TYPE_TARGET_TYPE (type);
11354
4c4b4cd2 11355 if (noside == EVAL_SKIP)
76a01679 11356 goto nosideret;
4c4b4cd2 11357 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
22601c15 11358 return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval);
4c4b4cd2 11359 else
22601c15 11360 return value_from_longest (builtin_type (exp->gdbarch)->builtin_int,
8c1c099f 11361 TARGET_CHAR_BIT * TYPE_LENGTH (type));
4c4b4cd2
PH
11362
11363 case OP_ATR_VAL:
11364 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
14f9c5c9 11365 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
4c4b4cd2 11366 type = exp->elts[pc + 2].type;
14f9c5c9 11367 if (noside == EVAL_SKIP)
76a01679 11368 goto nosideret;
4c4b4cd2 11369 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 11370 return value_zero (type, not_lval);
4c4b4cd2 11371 else
76a01679 11372 return value_val_atr (type, arg1);
4c4b4cd2
PH
11373
11374 case BINOP_EXP:
11375 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11376 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11377 if (noside == EVAL_SKIP)
11378 goto nosideret;
11379 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
df407dfe 11380 return value_zero (value_type (arg1), not_lval);
4c4b4cd2 11381 else
f44316fa
UW
11382 {
11383 /* For integer exponentiation operations,
11384 only promote the first argument. */
11385 if (is_integral_type (value_type (arg2)))
11386 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
11387 else
11388 binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2);
11389
11390 return value_binop (arg1, arg2, op);
11391 }
4c4b4cd2
PH
11392
11393 case UNOP_PLUS:
11394 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11395 if (noside == EVAL_SKIP)
11396 goto nosideret;
11397 else
11398 return arg1;
11399
11400 case UNOP_ABS:
11401 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11402 if (noside == EVAL_SKIP)
11403 goto nosideret;
f44316fa 11404 unop_promote (exp->language_defn, exp->gdbarch, &arg1);
df407dfe 11405 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
4c4b4cd2 11406 return value_neg (arg1);
14f9c5c9 11407 else
4c4b4cd2 11408 return arg1;
14f9c5c9
AS
11409
11410 case UNOP_IND:
5ec18f2b 11411 preeval_pos = *pos;
6b0d7253 11412 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
14f9c5c9 11413 if (noside == EVAL_SKIP)
4c4b4cd2 11414 goto nosideret;
df407dfe 11415 type = ada_check_typedef (value_type (arg1));
14f9c5c9 11416 if (noside == EVAL_AVOID_SIDE_EFFECTS)
4c4b4cd2
PH
11417 {
11418 if (ada_is_array_descriptor_type (type))
11419 /* GDB allows dereferencing GNAT array descriptors. */
11420 {
11421 struct type *arrType = ada_type_of_array (arg1, 0);
5b4ee69b 11422
4c4b4cd2 11423 if (arrType == NULL)
323e0a4a 11424 error (_("Attempt to dereference null array pointer."));
00a4c844 11425 return value_at_lazy (arrType, 0);
4c4b4cd2
PH
11426 }
11427 else if (TYPE_CODE (type) == TYPE_CODE_PTR
11428 || TYPE_CODE (type) == TYPE_CODE_REF
11429 /* In C you can dereference an array to get the 1st elt. */
11430 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
714e53ab 11431 {
5ec18f2b
JG
11432 /* As mentioned in the OP_VAR_VALUE case, tagged types can
11433 only be determined by inspecting the object's tag.
11434 This means that we need to evaluate completely the
11435 expression in order to get its type. */
11436
023db19c
JB
11437 if ((TYPE_CODE (type) == TYPE_CODE_REF
11438 || TYPE_CODE (type) == TYPE_CODE_PTR)
5ec18f2b
JG
11439 && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0))
11440 {
11441 arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos,
11442 EVAL_NORMAL);
11443 type = value_type (ada_value_ind (arg1));
11444 }
11445 else
11446 {
11447 type = to_static_fixed_type
11448 (ada_aligned_type
11449 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
11450 }
c1b5a1a6 11451 ada_ensure_varsize_limit (type);
714e53ab
PH
11452 return value_zero (type, lval_memory);
11453 }
4c4b4cd2 11454 else if (TYPE_CODE (type) == TYPE_CODE_INT)
6b0d7253
JB
11455 {
11456 /* GDB allows dereferencing an int. */
11457 if (expect_type == NULL)
11458 return value_zero (builtin_type (exp->gdbarch)->builtin_int,
11459 lval_memory);
11460 else
11461 {
11462 expect_type =
11463 to_static_fixed_type (ada_aligned_type (expect_type));
11464 return value_zero (expect_type, lval_memory);
11465 }
11466 }
4c4b4cd2 11467 else
323e0a4a 11468 error (_("Attempt to take contents of a non-pointer value."));
4c4b4cd2 11469 }
0963b4bd 11470 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
df407dfe 11471 type = ada_check_typedef (value_type (arg1));
d2e4a39e 11472
96967637
JB
11473 if (TYPE_CODE (type) == TYPE_CODE_INT)
11474 /* GDB allows dereferencing an int. If we were given
11475 the expect_type, then use that as the target type.
11476 Otherwise, assume that the target type is an int. */
11477 {
11478 if (expect_type != NULL)
11479 return ada_value_ind (value_cast (lookup_pointer_type (expect_type),
11480 arg1));
11481 else
11482 return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int,
11483 (CORE_ADDR) value_as_address (arg1));
11484 }
6b0d7253 11485
4c4b4cd2
PH
11486 if (ada_is_array_descriptor_type (type))
11487 /* GDB allows dereferencing GNAT array descriptors. */
11488 return ada_coerce_to_simple_array (arg1);
14f9c5c9 11489 else
4c4b4cd2 11490 return ada_value_ind (arg1);
14f9c5c9
AS
11491
11492 case STRUCTOP_STRUCT:
11493 tem = longest_to_int (exp->elts[pc + 1].longconst);
11494 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
5ec18f2b 11495 preeval_pos = *pos;
14f9c5c9
AS
11496 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
11497 if (noside == EVAL_SKIP)
4c4b4cd2 11498 goto nosideret;
14f9c5c9 11499 if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 11500 {
df407dfe 11501 struct type *type1 = value_type (arg1);
5b4ee69b 11502
76a01679
JB
11503 if (ada_is_tagged_type (type1, 1))
11504 {
11505 type = ada_lookup_struct_elt_type (type1,
11506 &exp->elts[pc + 2].string,
988f6b3d 11507 1, 1);
5ec18f2b
JG
11508
11509 /* If the field is not found, check if it exists in the
11510 extension of this object's type. This means that we
11511 need to evaluate completely the expression. */
11512
76a01679 11513 if (type == NULL)
5ec18f2b
JG
11514 {
11515 arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos,
11516 EVAL_NORMAL);
11517 arg1 = ada_value_struct_elt (arg1,
11518 &exp->elts[pc + 2].string,
11519 0);
11520 arg1 = unwrap_value (arg1);
11521 type = value_type (ada_to_fixed_value (arg1));
11522 }
76a01679
JB
11523 }
11524 else
11525 type =
11526 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
988f6b3d 11527 0);
76a01679
JB
11528
11529 return value_zero (ada_aligned_type (type), lval_memory);
11530 }
14f9c5c9 11531 else
a579cd9a
MW
11532 {
11533 arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0);
11534 arg1 = unwrap_value (arg1);
11535 return ada_to_fixed_value (arg1);
11536 }
284614f0 11537
14f9c5c9 11538 case OP_TYPE:
4c4b4cd2
PH
11539 /* The value is not supposed to be used. This is here to make it
11540 easier to accommodate expressions that contain types. */
14f9c5c9
AS
11541 (*pos) += 2;
11542 if (noside == EVAL_SKIP)
4c4b4cd2 11543 goto nosideret;
14f9c5c9 11544 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
a6cfbe68 11545 return allocate_value (exp->elts[pc + 1].type);
14f9c5c9 11546 else
323e0a4a 11547 error (_("Attempt to use a type name as an expression"));
52ce6436
PH
11548
11549 case OP_AGGREGATE:
11550 case OP_CHOICES:
11551 case OP_OTHERS:
11552 case OP_DISCRETE_RANGE:
11553 case OP_POSITIONAL:
11554 case OP_NAME:
11555 if (noside == EVAL_NORMAL)
11556 switch (op)
11557 {
11558 case OP_NAME:
11559 error (_("Undefined name, ambiguous name, or renaming used in "
e1d5a0d2 11560 "component association: %s."), &exp->elts[pc+2].string);
52ce6436
PH
11561 case OP_AGGREGATE:
11562 error (_("Aggregates only allowed on the right of an assignment"));
11563 default:
0963b4bd
MS
11564 internal_error (__FILE__, __LINE__,
11565 _("aggregate apparently mangled"));
52ce6436
PH
11566 }
11567
11568 ada_forward_operator_length (exp, pc, &oplen, &nargs);
11569 *pos += oplen - 1;
11570 for (tem = 0; tem < nargs; tem += 1)
11571 ada_evaluate_subexp (NULL, exp, pos, noside);
11572 goto nosideret;
14f9c5c9
AS
11573 }
11574
11575nosideret:
ced9779b 11576 return eval_skip_value (exp);
14f9c5c9 11577}
14f9c5c9 11578\f
d2e4a39e 11579
4c4b4cd2 11580 /* Fixed point */
14f9c5c9
AS
11581
11582/* If TYPE encodes an Ada fixed-point type, return the suffix of the
11583 type name that encodes the 'small and 'delta information.
4c4b4cd2 11584 Otherwise, return NULL. */
14f9c5c9 11585
d2e4a39e 11586static const char *
ebf56fd3 11587fixed_type_info (struct type *type)
14f9c5c9 11588{
d2e4a39e 11589 const char *name = ada_type_name (type);
14f9c5c9
AS
11590 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
11591
d2e4a39e
AS
11592 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
11593 {
14f9c5c9 11594 const char *tail = strstr (name, "___XF_");
5b4ee69b 11595
14f9c5c9 11596 if (tail == NULL)
4c4b4cd2 11597 return NULL;
d2e4a39e 11598 else
4c4b4cd2 11599 return tail + 5;
14f9c5c9
AS
11600 }
11601 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
11602 return fixed_type_info (TYPE_TARGET_TYPE (type));
11603 else
11604 return NULL;
11605}
11606
4c4b4cd2 11607/* Returns non-zero iff TYPE represents an Ada fixed-point type. */
14f9c5c9
AS
11608
11609int
ebf56fd3 11610ada_is_fixed_point_type (struct type *type)
14f9c5c9
AS
11611{
11612 return fixed_type_info (type) != NULL;
11613}
11614
4c4b4cd2
PH
11615/* Return non-zero iff TYPE represents a System.Address type. */
11616
11617int
11618ada_is_system_address_type (struct type *type)
11619{
11620 return (TYPE_NAME (type)
11621 && strcmp (TYPE_NAME (type), "system__address") == 0);
11622}
11623
14f9c5c9 11624/* Assuming that TYPE is the representation of an Ada fixed-point
50eff16b
UW
11625 type, return the target floating-point type to be used to represent
11626 of this type during internal computation. */
11627
11628static struct type *
11629ada_scaling_type (struct type *type)
11630{
11631 return builtin_type (get_type_arch (type))->builtin_long_double;
11632}
11633
11634/* Assuming that TYPE is the representation of an Ada fixed-point
11635 type, return its delta, or NULL if the type is malformed and the
4c4b4cd2 11636 delta cannot be determined. */
14f9c5c9 11637
50eff16b 11638struct value *
ebf56fd3 11639ada_delta (struct type *type)
14f9c5c9
AS
11640{
11641 const char *encoding = fixed_type_info (type);
50eff16b
UW
11642 struct type *scale_type = ada_scaling_type (type);
11643
11644 long long num, den;
11645
11646 if (sscanf (encoding, "_%lld_%lld", &num, &den) < 2)
11647 return nullptr;
d2e4a39e 11648 else
50eff16b
UW
11649 return value_binop (value_from_longest (scale_type, num),
11650 value_from_longest (scale_type, den), BINOP_DIV);
14f9c5c9
AS
11651}
11652
11653/* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
4c4b4cd2 11654 factor ('SMALL value) associated with the type. */
14f9c5c9 11655
50eff16b
UW
11656struct value *
11657ada_scaling_factor (struct type *type)
14f9c5c9
AS
11658{
11659 const char *encoding = fixed_type_info (type);
50eff16b
UW
11660 struct type *scale_type = ada_scaling_type (type);
11661
11662 long long num0, den0, num1, den1;
14f9c5c9 11663 int n;
d2e4a39e 11664
50eff16b 11665 n = sscanf (encoding, "_%lld_%lld_%lld_%lld",
facc390f 11666 &num0, &den0, &num1, &den1);
14f9c5c9
AS
11667
11668 if (n < 2)
50eff16b 11669 return value_from_longest (scale_type, 1);
14f9c5c9 11670 else if (n == 4)
50eff16b
UW
11671 return value_binop (value_from_longest (scale_type, num1),
11672 value_from_longest (scale_type, den1), BINOP_DIV);
d2e4a39e 11673 else
50eff16b
UW
11674 return value_binop (value_from_longest (scale_type, num0),
11675 value_from_longest (scale_type, den0), BINOP_DIV);
14f9c5c9
AS
11676}
11677
14f9c5c9 11678\f
d2e4a39e 11679
4c4b4cd2 11680 /* Range types */
14f9c5c9
AS
11681
11682/* Scan STR beginning at position K for a discriminant name, and
11683 return the value of that discriminant field of DVAL in *PX. If
11684 PNEW_K is not null, put the position of the character beyond the
11685 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
4c4b4cd2 11686 not alter *PX and *PNEW_K if unsuccessful. */
14f9c5c9
AS
11687
11688static int
108d56a4 11689scan_discrim_bound (const char *str, int k, struct value *dval, LONGEST * px,
76a01679 11690 int *pnew_k)
14f9c5c9
AS
11691{
11692 static char *bound_buffer = NULL;
11693 static size_t bound_buffer_len = 0;
5da1a4d3 11694 const char *pstart, *pend, *bound;
d2e4a39e 11695 struct value *bound_val;
14f9c5c9
AS
11696
11697 if (dval == NULL || str == NULL || str[k] == '\0')
11698 return 0;
11699
5da1a4d3
SM
11700 pstart = str + k;
11701 pend = strstr (pstart, "__");
14f9c5c9
AS
11702 if (pend == NULL)
11703 {
5da1a4d3 11704 bound = pstart;
14f9c5c9
AS
11705 k += strlen (bound);
11706 }
d2e4a39e 11707 else
14f9c5c9 11708 {
5da1a4d3
SM
11709 int len = pend - pstart;
11710
11711 /* Strip __ and beyond. */
11712 GROW_VECT (bound_buffer, bound_buffer_len, len + 1);
11713 strncpy (bound_buffer, pstart, len);
11714 bound_buffer[len] = '\0';
11715
14f9c5c9 11716 bound = bound_buffer;
d2e4a39e 11717 k = pend - str;
14f9c5c9 11718 }
d2e4a39e 11719
df407dfe 11720 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
14f9c5c9
AS
11721 if (bound_val == NULL)
11722 return 0;
11723
11724 *px = value_as_long (bound_val);
11725 if (pnew_k != NULL)
11726 *pnew_k = k;
11727 return 1;
11728}
11729
11730/* Value of variable named NAME in the current environment. If
11731 no such variable found, then if ERR_MSG is null, returns 0, and
4c4b4cd2
PH
11732 otherwise causes an error with message ERR_MSG. */
11733
d2e4a39e 11734static struct value *
edb0c9cb 11735get_var_value (const char *name, const char *err_msg)
14f9c5c9 11736{
b5ec771e 11737 lookup_name_info lookup_name (name, symbol_name_match_type::FULL);
14f9c5c9 11738
54d343a2 11739 std::vector<struct block_symbol> syms;
b5ec771e
PA
11740 int nsyms = ada_lookup_symbol_list_worker (lookup_name,
11741 get_selected_block (0),
11742 VAR_DOMAIN, &syms, 1);
14f9c5c9
AS
11743
11744 if (nsyms != 1)
11745 {
11746 if (err_msg == NULL)
4c4b4cd2 11747 return 0;
14f9c5c9 11748 else
8a3fe4f8 11749 error (("%s"), err_msg);
14f9c5c9
AS
11750 }
11751
54d343a2 11752 return value_of_variable (syms[0].symbol, syms[0].block);
14f9c5c9 11753}
d2e4a39e 11754
edb0c9cb
PA
11755/* Value of integer variable named NAME in the current environment.
11756 If no such variable is found, returns false. Otherwise, sets VALUE
11757 to the variable's value and returns true. */
4c4b4cd2 11758
edb0c9cb
PA
11759bool
11760get_int_var_value (const char *name, LONGEST &value)
14f9c5c9 11761{
4c4b4cd2 11762 struct value *var_val = get_var_value (name, 0);
d2e4a39e 11763
14f9c5c9 11764 if (var_val == 0)
edb0c9cb
PA
11765 return false;
11766
11767 value = value_as_long (var_val);
11768 return true;
14f9c5c9 11769}
d2e4a39e 11770
14f9c5c9
AS
11771
11772/* Return a range type whose base type is that of the range type named
11773 NAME in the current environment, and whose bounds are calculated
4c4b4cd2 11774 from NAME according to the GNAT range encoding conventions.
1ce677a4
UW
11775 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
11776 corresponding range type from debug information; fall back to using it
11777 if symbol lookup fails. If a new type must be created, allocate it
11778 like ORIG_TYPE was. The bounds information, in general, is encoded
11779 in NAME, the base type given in the named range type. */
14f9c5c9 11780
d2e4a39e 11781static struct type *
28c85d6c 11782to_fixed_range_type (struct type *raw_type, struct value *dval)
14f9c5c9 11783{
0d5cff50 11784 const char *name;
14f9c5c9 11785 struct type *base_type;
108d56a4 11786 const char *subtype_info;
14f9c5c9 11787
28c85d6c
JB
11788 gdb_assert (raw_type != NULL);
11789 gdb_assert (TYPE_NAME (raw_type) != NULL);
dddfab26 11790
1ce677a4 11791 if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
14f9c5c9
AS
11792 base_type = TYPE_TARGET_TYPE (raw_type);
11793 else
11794 base_type = raw_type;
11795
28c85d6c 11796 name = TYPE_NAME (raw_type);
14f9c5c9
AS
11797 subtype_info = strstr (name, "___XD");
11798 if (subtype_info == NULL)
690cc4eb 11799 {
43bbcdc2
PH
11800 LONGEST L = ada_discrete_type_low_bound (raw_type);
11801 LONGEST U = ada_discrete_type_high_bound (raw_type);
5b4ee69b 11802
690cc4eb
PH
11803 if (L < INT_MIN || U > INT_MAX)
11804 return raw_type;
11805 else
0c9c3474
SA
11806 return create_static_range_type (alloc_type_copy (raw_type), raw_type,
11807 L, U);
690cc4eb 11808 }
14f9c5c9
AS
11809 else
11810 {
11811 static char *name_buf = NULL;
11812 static size_t name_len = 0;
11813 int prefix_len = subtype_info - name;
11814 LONGEST L, U;
11815 struct type *type;
108d56a4 11816 const char *bounds_str;
14f9c5c9
AS
11817 int n;
11818
11819 GROW_VECT (name_buf, name_len, prefix_len + 5);
11820 strncpy (name_buf, name, prefix_len);
11821 name_buf[prefix_len] = '\0';
11822
11823 subtype_info += 5;
11824 bounds_str = strchr (subtype_info, '_');
11825 n = 1;
11826
d2e4a39e 11827 if (*subtype_info == 'L')
4c4b4cd2
PH
11828 {
11829 if (!ada_scan_number (bounds_str, n, &L, &n)
11830 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
11831 return raw_type;
11832 if (bounds_str[n] == '_')
11833 n += 2;
0963b4bd 11834 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
4c4b4cd2
PH
11835 n += 1;
11836 subtype_info += 1;
11837 }
d2e4a39e 11838 else
4c4b4cd2 11839 {
4c4b4cd2 11840 strcpy (name_buf + prefix_len, "___L");
edb0c9cb 11841 if (!get_int_var_value (name_buf, L))
4c4b4cd2 11842 {
323e0a4a 11843 lim_warning (_("Unknown lower bound, using 1."));
4c4b4cd2
PH
11844 L = 1;
11845 }
11846 }
14f9c5c9 11847
d2e4a39e 11848 if (*subtype_info == 'U')
4c4b4cd2
PH
11849 {
11850 if (!ada_scan_number (bounds_str, n, &U, &n)
11851 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
11852 return raw_type;
11853 }
d2e4a39e 11854 else
4c4b4cd2 11855 {
4c4b4cd2 11856 strcpy (name_buf + prefix_len, "___U");
edb0c9cb 11857 if (!get_int_var_value (name_buf, U))
4c4b4cd2 11858 {
323e0a4a 11859 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
4c4b4cd2
PH
11860 U = L;
11861 }
11862 }
14f9c5c9 11863
0c9c3474
SA
11864 type = create_static_range_type (alloc_type_copy (raw_type),
11865 base_type, L, U);
f5a91472
JB
11866 /* create_static_range_type alters the resulting type's length
11867 to match the size of the base_type, which is not what we want.
11868 Set it back to the original range type's length. */
11869 TYPE_LENGTH (type) = TYPE_LENGTH (raw_type);
d2e4a39e 11870 TYPE_NAME (type) = name;
14f9c5c9
AS
11871 return type;
11872 }
11873}
11874
4c4b4cd2
PH
11875/* True iff NAME is the name of a range type. */
11876
14f9c5c9 11877int
d2e4a39e 11878ada_is_range_type_name (const char *name)
14f9c5c9
AS
11879{
11880 return (name != NULL && strstr (name, "___XD"));
d2e4a39e 11881}
14f9c5c9 11882\f
d2e4a39e 11883
4c4b4cd2
PH
11884 /* Modular types */
11885
11886/* True iff TYPE is an Ada modular type. */
14f9c5c9 11887
14f9c5c9 11888int
d2e4a39e 11889ada_is_modular_type (struct type *type)
14f9c5c9 11890{
18af8284 11891 struct type *subranged_type = get_base_type (type);
14f9c5c9
AS
11892
11893 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
690cc4eb 11894 && TYPE_CODE (subranged_type) == TYPE_CODE_INT
4c4b4cd2 11895 && TYPE_UNSIGNED (subranged_type));
14f9c5c9
AS
11896}
11897
4c4b4cd2
PH
11898/* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
11899
61ee279c 11900ULONGEST
0056e4d5 11901ada_modulus (struct type *type)
14f9c5c9 11902{
43bbcdc2 11903 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
14f9c5c9 11904}
d2e4a39e 11905\f
f7f9143b
JB
11906
11907/* Ada exception catchpoint support:
11908 ---------------------------------
11909
11910 We support 3 kinds of exception catchpoints:
11911 . catchpoints on Ada exceptions
11912 . catchpoints on unhandled Ada exceptions
11913 . catchpoints on failed assertions
11914
11915 Exceptions raised during failed assertions, or unhandled exceptions
11916 could perfectly be caught with the general catchpoint on Ada exceptions.
11917 However, we can easily differentiate these two special cases, and having
11918 the option to distinguish these two cases from the rest can be useful
11919 to zero-in on certain situations.
11920
11921 Exception catchpoints are a specialized form of breakpoint,
11922 since they rely on inserting breakpoints inside known routines
11923 of the GNAT runtime. The implementation therefore uses a standard
11924 breakpoint structure of the BP_BREAKPOINT type, but with its own set
11925 of breakpoint_ops.
11926
0259addd
JB
11927 Support in the runtime for exception catchpoints have been changed
11928 a few times already, and these changes affect the implementation
11929 of these catchpoints. In order to be able to support several
11930 variants of the runtime, we use a sniffer that will determine
28010a5d 11931 the runtime variant used by the program being debugged. */
f7f9143b 11932
82eacd52
JB
11933/* Ada's standard exceptions.
11934
11935 The Ada 83 standard also defined Numeric_Error. But there so many
11936 situations where it was unclear from the Ada 83 Reference Manual
11937 (RM) whether Constraint_Error or Numeric_Error should be raised,
11938 that the ARG (Ada Rapporteur Group) eventually issued a Binding
11939 Interpretation saying that anytime the RM says that Numeric_Error
11940 should be raised, the implementation may raise Constraint_Error.
11941 Ada 95 went one step further and pretty much removed Numeric_Error
11942 from the list of standard exceptions (it made it a renaming of
11943 Constraint_Error, to help preserve compatibility when compiling
11944 an Ada83 compiler). As such, we do not include Numeric_Error from
11945 this list of standard exceptions. */
3d0b0fa3 11946
a121b7c1 11947static const char *standard_exc[] = {
3d0b0fa3
JB
11948 "constraint_error",
11949 "program_error",
11950 "storage_error",
11951 "tasking_error"
11952};
11953
0259addd
JB
11954typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
11955
11956/* A structure that describes how to support exception catchpoints
11957 for a given executable. */
11958
11959struct exception_support_info
11960{
11961 /* The name of the symbol to break on in order to insert
11962 a catchpoint on exceptions. */
11963 const char *catch_exception_sym;
11964
11965 /* The name of the symbol to break on in order to insert
11966 a catchpoint on unhandled exceptions. */
11967 const char *catch_exception_unhandled_sym;
11968
11969 /* The name of the symbol to break on in order to insert
11970 a catchpoint on failed assertions. */
11971 const char *catch_assert_sym;
11972
9f757bf7
XR
11973 /* The name of the symbol to break on in order to insert
11974 a catchpoint on exception handling. */
11975 const char *catch_handlers_sym;
11976
0259addd
JB
11977 /* Assuming that the inferior just triggered an unhandled exception
11978 catchpoint, this function is responsible for returning the address
11979 in inferior memory where the name of that exception is stored.
11980 Return zero if the address could not be computed. */
11981 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
11982};
11983
11984static CORE_ADDR ada_unhandled_exception_name_addr (void);
11985static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
11986
11987/* The following exception support info structure describes how to
11988 implement exception catchpoints with the latest version of the
11989 Ada runtime (as of 2007-03-06). */
11990
11991static const struct exception_support_info default_exception_support_info =
11992{
11993 "__gnat_debug_raise_exception", /* catch_exception_sym */
11994 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
11995 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9f757bf7 11996 "__gnat_begin_handler", /* catch_handlers_sym */
0259addd
JB
11997 ada_unhandled_exception_name_addr
11998};
11999
12000/* The following exception support info structure describes how to
12001 implement exception catchpoints with a slightly older version
12002 of the Ada runtime. */
12003
12004static const struct exception_support_info exception_support_info_fallback =
12005{
12006 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
12007 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
12008 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9f757bf7 12009 "__gnat_begin_handler", /* catch_handlers_sym */
0259addd
JB
12010 ada_unhandled_exception_name_addr_from_raise
12011};
12012
f17011e0
JB
12013/* Return nonzero if we can detect the exception support routines
12014 described in EINFO.
12015
12016 This function errors out if an abnormal situation is detected
12017 (for instance, if we find the exception support routines, but
12018 that support is found to be incomplete). */
12019
12020static int
12021ada_has_this_exception_support (const struct exception_support_info *einfo)
12022{
12023 struct symbol *sym;
12024
12025 /* The symbol we're looking up is provided by a unit in the GNAT runtime
12026 that should be compiled with debugging information. As a result, we
12027 expect to find that symbol in the symtabs. */
12028
12029 sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN);
12030 if (sym == NULL)
a6af7abe
JB
12031 {
12032 /* Perhaps we did not find our symbol because the Ada runtime was
12033 compiled without debugging info, or simply stripped of it.
12034 It happens on some GNU/Linux distributions for instance, where
12035 users have to install a separate debug package in order to get
12036 the runtime's debugging info. In that situation, let the user
12037 know why we cannot insert an Ada exception catchpoint.
12038
12039 Note: Just for the purpose of inserting our Ada exception
12040 catchpoint, we could rely purely on the associated minimal symbol.
12041 But we would be operating in degraded mode anyway, since we are
12042 still lacking the debugging info needed later on to extract
12043 the name of the exception being raised (this name is printed in
12044 the catchpoint message, and is also used when trying to catch
12045 a specific exception). We do not handle this case for now. */
3b7344d5 12046 struct bound_minimal_symbol msym
1c8e84b0
JB
12047 = lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL);
12048
3b7344d5 12049 if (msym.minsym && MSYMBOL_TYPE (msym.minsym) != mst_solib_trampoline)
a6af7abe
JB
12050 error (_("Your Ada runtime appears to be missing some debugging "
12051 "information.\nCannot insert Ada exception catchpoint "
12052 "in this configuration."));
12053
12054 return 0;
12055 }
f17011e0
JB
12056
12057 /* Make sure that the symbol we found corresponds to a function. */
12058
12059 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
12060 error (_("Symbol \"%s\" is not a function (class = %d)"),
12061 SYMBOL_LINKAGE_NAME (sym), SYMBOL_CLASS (sym));
12062
12063 return 1;
12064}
12065
0259addd
JB
12066/* Inspect the Ada runtime and determine which exception info structure
12067 should be used to provide support for exception catchpoints.
12068
3eecfa55
JB
12069 This function will always set the per-inferior exception_info,
12070 or raise an error. */
0259addd
JB
12071
12072static void
12073ada_exception_support_info_sniffer (void)
12074{
3eecfa55 12075 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
0259addd
JB
12076
12077 /* If the exception info is already known, then no need to recompute it. */
3eecfa55 12078 if (data->exception_info != NULL)
0259addd
JB
12079 return;
12080
12081 /* Check the latest (default) exception support info. */
f17011e0 12082 if (ada_has_this_exception_support (&default_exception_support_info))
0259addd 12083 {
3eecfa55 12084 data->exception_info = &default_exception_support_info;
0259addd
JB
12085 return;
12086 }
12087
12088 /* Try our fallback exception suport info. */
f17011e0 12089 if (ada_has_this_exception_support (&exception_support_info_fallback))
0259addd 12090 {
3eecfa55 12091 data->exception_info = &exception_support_info_fallback;
0259addd
JB
12092 return;
12093 }
12094
12095 /* Sometimes, it is normal for us to not be able to find the routine
12096 we are looking for. This happens when the program is linked with
12097 the shared version of the GNAT runtime, and the program has not been
12098 started yet. Inform the user of these two possible causes if
12099 applicable. */
12100
ccefe4c4 12101 if (ada_update_initial_language (language_unknown) != language_ada)
0259addd
JB
12102 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
12103
12104 /* If the symbol does not exist, then check that the program is
12105 already started, to make sure that shared libraries have been
12106 loaded. If it is not started, this may mean that the symbol is
12107 in a shared library. */
12108
e99b03dc 12109 if (inferior_ptid.pid () == 0)
0259addd
JB
12110 error (_("Unable to insert catchpoint. Try to start the program first."));
12111
12112 /* At this point, we know that we are debugging an Ada program and
12113 that the inferior has been started, but we still are not able to
0963b4bd 12114 find the run-time symbols. That can mean that we are in
0259addd
JB
12115 configurable run time mode, or that a-except as been optimized
12116 out by the linker... In any case, at this point it is not worth
12117 supporting this feature. */
12118
7dda8cff 12119 error (_("Cannot insert Ada exception catchpoints in this configuration."));
0259addd
JB
12120}
12121
f7f9143b
JB
12122/* True iff FRAME is very likely to be that of a function that is
12123 part of the runtime system. This is all very heuristic, but is
12124 intended to be used as advice as to what frames are uninteresting
12125 to most users. */
12126
12127static int
12128is_known_support_routine (struct frame_info *frame)
12129{
692465f1 12130 enum language func_lang;
f7f9143b 12131 int i;
f35a17b5 12132 const char *fullname;
f7f9143b 12133
4ed6b5be
JB
12134 /* If this code does not have any debugging information (no symtab),
12135 This cannot be any user code. */
f7f9143b 12136
51abb421 12137 symtab_and_line sal = find_frame_sal (frame);
f7f9143b
JB
12138 if (sal.symtab == NULL)
12139 return 1;
12140
4ed6b5be
JB
12141 /* If there is a symtab, but the associated source file cannot be
12142 located, then assume this is not user code: Selecting a frame
12143 for which we cannot display the code would not be very helpful
12144 for the user. This should also take care of case such as VxWorks
12145 where the kernel has some debugging info provided for a few units. */
f7f9143b 12146
f35a17b5
JK
12147 fullname = symtab_to_fullname (sal.symtab);
12148 if (access (fullname, R_OK) != 0)
f7f9143b
JB
12149 return 1;
12150
4ed6b5be
JB
12151 /* Check the unit filename againt the Ada runtime file naming.
12152 We also check the name of the objfile against the name of some
12153 known system libraries that sometimes come with debugging info
12154 too. */
12155
f7f9143b
JB
12156 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
12157 {
12158 re_comp (known_runtime_file_name_patterns[i]);
f69c91ad 12159 if (re_exec (lbasename (sal.symtab->filename)))
f7f9143b 12160 return 1;
eb822aa6
DE
12161 if (SYMTAB_OBJFILE (sal.symtab) != NULL
12162 && re_exec (objfile_name (SYMTAB_OBJFILE (sal.symtab))))
4ed6b5be 12163 return 1;
f7f9143b
JB
12164 }
12165
4ed6b5be 12166 /* Check whether the function is a GNAT-generated entity. */
f7f9143b 12167
c6dc63a1
TT
12168 gdb::unique_xmalloc_ptr<char> func_name
12169 = find_frame_funname (frame, &func_lang, NULL);
f7f9143b
JB
12170 if (func_name == NULL)
12171 return 1;
12172
12173 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
12174 {
12175 re_comp (known_auxiliary_function_name_patterns[i]);
c6dc63a1
TT
12176 if (re_exec (func_name.get ()))
12177 return 1;
f7f9143b
JB
12178 }
12179
12180 return 0;
12181}
12182
12183/* Find the first frame that contains debugging information and that is not
12184 part of the Ada run-time, starting from FI and moving upward. */
12185
0ef643c8 12186void
f7f9143b
JB
12187ada_find_printable_frame (struct frame_info *fi)
12188{
12189 for (; fi != NULL; fi = get_prev_frame (fi))
12190 {
12191 if (!is_known_support_routine (fi))
12192 {
12193 select_frame (fi);
12194 break;
12195 }
12196 }
12197
12198}
12199
12200/* Assuming that the inferior just triggered an unhandled exception
12201 catchpoint, return the address in inferior memory where the name
12202 of the exception is stored.
12203
12204 Return zero if the address could not be computed. */
12205
12206static CORE_ADDR
12207ada_unhandled_exception_name_addr (void)
0259addd
JB
12208{
12209 return parse_and_eval_address ("e.full_name");
12210}
12211
12212/* Same as ada_unhandled_exception_name_addr, except that this function
12213 should be used when the inferior uses an older version of the runtime,
12214 where the exception name needs to be extracted from a specific frame
12215 several frames up in the callstack. */
12216
12217static CORE_ADDR
12218ada_unhandled_exception_name_addr_from_raise (void)
f7f9143b
JB
12219{
12220 int frame_level;
12221 struct frame_info *fi;
3eecfa55 12222 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
f7f9143b
JB
12223
12224 /* To determine the name of this exception, we need to select
12225 the frame corresponding to RAISE_SYM_NAME. This frame is
12226 at least 3 levels up, so we simply skip the first 3 frames
12227 without checking the name of their associated function. */
12228 fi = get_current_frame ();
12229 for (frame_level = 0; frame_level < 3; frame_level += 1)
12230 if (fi != NULL)
12231 fi = get_prev_frame (fi);
12232
12233 while (fi != NULL)
12234 {
692465f1
JB
12235 enum language func_lang;
12236
c6dc63a1
TT
12237 gdb::unique_xmalloc_ptr<char> func_name
12238 = find_frame_funname (fi, &func_lang, NULL);
55b87a52
KS
12239 if (func_name != NULL)
12240 {
c6dc63a1 12241 if (strcmp (func_name.get (),
55b87a52
KS
12242 data->exception_info->catch_exception_sym) == 0)
12243 break; /* We found the frame we were looking for... */
55b87a52 12244 }
fb44b1a7 12245 fi = get_prev_frame (fi);
f7f9143b
JB
12246 }
12247
12248 if (fi == NULL)
12249 return 0;
12250
12251 select_frame (fi);
12252 return parse_and_eval_address ("id.full_name");
12253}
12254
12255/* Assuming the inferior just triggered an Ada exception catchpoint
12256 (of any type), return the address in inferior memory where the name
12257 of the exception is stored, if applicable.
12258
45db7c09
PA
12259 Assumes the selected frame is the current frame.
12260
f7f9143b
JB
12261 Return zero if the address could not be computed, or if not relevant. */
12262
12263static CORE_ADDR
761269c8 12264ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex,
f7f9143b
JB
12265 struct breakpoint *b)
12266{
3eecfa55
JB
12267 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
12268
f7f9143b
JB
12269 switch (ex)
12270 {
761269c8 12271 case ada_catch_exception:
f7f9143b
JB
12272 return (parse_and_eval_address ("e.full_name"));
12273 break;
12274
761269c8 12275 case ada_catch_exception_unhandled:
3eecfa55 12276 return data->exception_info->unhandled_exception_name_addr ();
f7f9143b 12277 break;
9f757bf7
XR
12278
12279 case ada_catch_handlers:
12280 return 0; /* The runtimes does not provide access to the exception
12281 name. */
12282 break;
12283
761269c8 12284 case ada_catch_assert:
f7f9143b
JB
12285 return 0; /* Exception name is not relevant in this case. */
12286 break;
12287
12288 default:
12289 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12290 break;
12291 }
12292
12293 return 0; /* Should never be reached. */
12294}
12295
e547c119
JB
12296/* Assuming the inferior is stopped at an exception catchpoint,
12297 return the message which was associated to the exception, if
12298 available. Return NULL if the message could not be retrieved.
12299
e547c119
JB
12300 Note: The exception message can be associated to an exception
12301 either through the use of the Raise_Exception function, or
12302 more simply (Ada 2005 and later), via:
12303
12304 raise Exception_Name with "exception message";
12305
12306 */
12307
6f46ac85 12308static gdb::unique_xmalloc_ptr<char>
e547c119
JB
12309ada_exception_message_1 (void)
12310{
12311 struct value *e_msg_val;
e547c119 12312 int e_msg_len;
e547c119
JB
12313
12314 /* For runtimes that support this feature, the exception message
12315 is passed as an unbounded string argument called "message". */
12316 e_msg_val = parse_and_eval ("message");
12317 if (e_msg_val == NULL)
12318 return NULL; /* Exception message not supported. */
12319
12320 e_msg_val = ada_coerce_to_simple_array (e_msg_val);
12321 gdb_assert (e_msg_val != NULL);
12322 e_msg_len = TYPE_LENGTH (value_type (e_msg_val));
12323
12324 /* If the message string is empty, then treat it as if there was
12325 no exception message. */
12326 if (e_msg_len <= 0)
12327 return NULL;
12328
6f46ac85
TT
12329 gdb::unique_xmalloc_ptr<char> e_msg ((char *) xmalloc (e_msg_len + 1));
12330 read_memory_string (value_address (e_msg_val), e_msg.get (), e_msg_len + 1);
12331 e_msg.get ()[e_msg_len] = '\0';
e547c119 12332
e547c119
JB
12333 return e_msg;
12334}
12335
12336/* Same as ada_exception_message_1, except that all exceptions are
12337 contained here (returning NULL instead). */
12338
6f46ac85 12339static gdb::unique_xmalloc_ptr<char>
e547c119
JB
12340ada_exception_message (void)
12341{
6f46ac85 12342 gdb::unique_xmalloc_ptr<char> e_msg;
e547c119
JB
12343
12344 TRY
12345 {
12346 e_msg = ada_exception_message_1 ();
12347 }
12348 CATCH (e, RETURN_MASK_ERROR)
12349 {
6f46ac85 12350 e_msg.reset (nullptr);
e547c119
JB
12351 }
12352 END_CATCH
12353
12354 return e_msg;
12355}
12356
f7f9143b
JB
12357/* Same as ada_exception_name_addr_1, except that it intercepts and contains
12358 any error that ada_exception_name_addr_1 might cause to be thrown.
12359 When an error is intercepted, a warning with the error message is printed,
12360 and zero is returned. */
12361
12362static CORE_ADDR
761269c8 12363ada_exception_name_addr (enum ada_exception_catchpoint_kind ex,
f7f9143b
JB
12364 struct breakpoint *b)
12365{
f7f9143b
JB
12366 CORE_ADDR result = 0;
12367
492d29ea 12368 TRY
f7f9143b
JB
12369 {
12370 result = ada_exception_name_addr_1 (ex, b);
12371 }
12372
492d29ea 12373 CATCH (e, RETURN_MASK_ERROR)
f7f9143b
JB
12374 {
12375 warning (_("failed to get exception name: %s"), e.message);
12376 return 0;
12377 }
492d29ea 12378 END_CATCH
f7f9143b
JB
12379
12380 return result;
12381}
12382
cb7de75e 12383static std::string ada_exception_catchpoint_cond_string
9f757bf7
XR
12384 (const char *excep_string,
12385 enum ada_exception_catchpoint_kind ex);
28010a5d
PA
12386
12387/* Ada catchpoints.
12388
12389 In the case of catchpoints on Ada exceptions, the catchpoint will
12390 stop the target on every exception the program throws. When a user
12391 specifies the name of a specific exception, we translate this
12392 request into a condition expression (in text form), and then parse
12393 it into an expression stored in each of the catchpoint's locations.
12394 We then use this condition to check whether the exception that was
12395 raised is the one the user is interested in. If not, then the
12396 target is resumed again. We store the name of the requested
12397 exception, in order to be able to re-set the condition expression
12398 when symbols change. */
12399
12400/* An instance of this type is used to represent an Ada catchpoint
5625a286 12401 breakpoint location. */
28010a5d 12402
5625a286 12403class ada_catchpoint_location : public bp_location
28010a5d 12404{
5625a286 12405public:
5f486660
TT
12406 ada_catchpoint_location (breakpoint *owner)
12407 : bp_location (owner)
5625a286 12408 {}
28010a5d
PA
12409
12410 /* The condition that checks whether the exception that was raised
12411 is the specific exception the user specified on catchpoint
12412 creation. */
4d01a485 12413 expression_up excep_cond_expr;
28010a5d
PA
12414};
12415
c1fc2657 12416/* An instance of this type is used to represent an Ada catchpoint. */
28010a5d 12417
c1fc2657 12418struct ada_catchpoint : public breakpoint
28010a5d 12419{
28010a5d 12420 /* The name of the specific exception the user specified. */
bc18fbb5 12421 std::string excep_string;
28010a5d
PA
12422};
12423
12424/* Parse the exception condition string in the context of each of the
12425 catchpoint's locations, and store them for later evaluation. */
12426
12427static void
9f757bf7
XR
12428create_excep_cond_exprs (struct ada_catchpoint *c,
12429 enum ada_exception_catchpoint_kind ex)
28010a5d 12430{
28010a5d 12431 struct bp_location *bl;
28010a5d
PA
12432
12433 /* Nothing to do if there's no specific exception to catch. */
bc18fbb5 12434 if (c->excep_string.empty ())
28010a5d
PA
12435 return;
12436
12437 /* Same if there are no locations... */
c1fc2657 12438 if (c->loc == NULL)
28010a5d
PA
12439 return;
12440
12441 /* Compute the condition expression in text form, from the specific
12442 expection we want to catch. */
cb7de75e 12443 std::string cond_string
bc18fbb5 12444 = ada_exception_catchpoint_cond_string (c->excep_string.c_str (), ex);
28010a5d
PA
12445
12446 /* Iterate over all the catchpoint's locations, and parse an
12447 expression for each. */
c1fc2657 12448 for (bl = c->loc; bl != NULL; bl = bl->next)
28010a5d
PA
12449 {
12450 struct ada_catchpoint_location *ada_loc
12451 = (struct ada_catchpoint_location *) bl;
4d01a485 12452 expression_up exp;
28010a5d
PA
12453
12454 if (!bl->shlib_disabled)
12455 {
bbc13ae3 12456 const char *s;
28010a5d 12457
cb7de75e 12458 s = cond_string.c_str ();
492d29ea 12459 TRY
28010a5d 12460 {
036e657b
JB
12461 exp = parse_exp_1 (&s, bl->address,
12462 block_for_pc (bl->address),
12463 0);
28010a5d 12464 }
492d29ea 12465 CATCH (e, RETURN_MASK_ERROR)
849f2b52
JB
12466 {
12467 warning (_("failed to reevaluate internal exception condition "
12468 "for catchpoint %d: %s"),
c1fc2657 12469 c->number, e.message);
849f2b52 12470 }
492d29ea 12471 END_CATCH
28010a5d
PA
12472 }
12473
b22e99fd 12474 ada_loc->excep_cond_expr = std::move (exp);
28010a5d 12475 }
28010a5d
PA
12476}
12477
28010a5d
PA
12478/* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
12479 structure for all exception catchpoint kinds. */
12480
12481static struct bp_location *
761269c8 12482allocate_location_exception (enum ada_exception_catchpoint_kind ex,
28010a5d
PA
12483 struct breakpoint *self)
12484{
5f486660 12485 return new ada_catchpoint_location (self);
28010a5d
PA
12486}
12487
12488/* Implement the RE_SET method in the breakpoint_ops structure for all
12489 exception catchpoint kinds. */
12490
12491static void
761269c8 12492re_set_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b)
28010a5d
PA
12493{
12494 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12495
12496 /* Call the base class's method. This updates the catchpoint's
12497 locations. */
2060206e 12498 bkpt_breakpoint_ops.re_set (b);
28010a5d
PA
12499
12500 /* Reparse the exception conditional expressions. One for each
12501 location. */
9f757bf7 12502 create_excep_cond_exprs (c, ex);
28010a5d
PA
12503}
12504
12505/* Returns true if we should stop for this breakpoint hit. If the
12506 user specified a specific exception, we only want to cause a stop
12507 if the program thrown that exception. */
12508
12509static int
12510should_stop_exception (const struct bp_location *bl)
12511{
12512 struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner;
12513 const struct ada_catchpoint_location *ada_loc
12514 = (const struct ada_catchpoint_location *) bl;
28010a5d
PA
12515 int stop;
12516
12517 /* With no specific exception, should always stop. */
bc18fbb5 12518 if (c->excep_string.empty ())
28010a5d
PA
12519 return 1;
12520
12521 if (ada_loc->excep_cond_expr == NULL)
12522 {
12523 /* We will have a NULL expression if back when we were creating
12524 the expressions, this location's had failed to parse. */
12525 return 1;
12526 }
12527
12528 stop = 1;
492d29ea 12529 TRY
28010a5d
PA
12530 {
12531 struct value *mark;
12532
12533 mark = value_mark ();
4d01a485 12534 stop = value_true (evaluate_expression (ada_loc->excep_cond_expr.get ()));
28010a5d
PA
12535 value_free_to_mark (mark);
12536 }
492d29ea
PA
12537 CATCH (ex, RETURN_MASK_ALL)
12538 {
12539 exception_fprintf (gdb_stderr, ex,
12540 _("Error in testing exception condition:\n"));
12541 }
12542 END_CATCH
12543
28010a5d
PA
12544 return stop;
12545}
12546
12547/* Implement the CHECK_STATUS method in the breakpoint_ops structure
12548 for all exception catchpoint kinds. */
12549
12550static void
761269c8 12551check_status_exception (enum ada_exception_catchpoint_kind ex, bpstat bs)
28010a5d
PA
12552{
12553 bs->stop = should_stop_exception (bs->bp_location_at);
12554}
12555
f7f9143b
JB
12556/* Implement the PRINT_IT method in the breakpoint_ops structure
12557 for all exception catchpoint kinds. */
12558
12559static enum print_stop_action
761269c8 12560print_it_exception (enum ada_exception_catchpoint_kind ex, bpstat bs)
f7f9143b 12561{
79a45e25 12562 struct ui_out *uiout = current_uiout;
348d480f
PA
12563 struct breakpoint *b = bs->breakpoint_at;
12564
956a9fb9 12565 annotate_catchpoint (b->number);
f7f9143b 12566
112e8700 12567 if (uiout->is_mi_like_p ())
f7f9143b 12568 {
112e8700 12569 uiout->field_string ("reason",
956a9fb9 12570 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT));
112e8700 12571 uiout->field_string ("disp", bpdisp_text (b->disposition));
f7f9143b
JB
12572 }
12573
112e8700
SM
12574 uiout->text (b->disposition == disp_del
12575 ? "\nTemporary catchpoint " : "\nCatchpoint ");
12576 uiout->field_int ("bkptno", b->number);
12577 uiout->text (", ");
f7f9143b 12578
45db7c09
PA
12579 /* ada_exception_name_addr relies on the selected frame being the
12580 current frame. Need to do this here because this function may be
12581 called more than once when printing a stop, and below, we'll
12582 select the first frame past the Ada run-time (see
12583 ada_find_printable_frame). */
12584 select_frame (get_current_frame ());
12585
f7f9143b
JB
12586 switch (ex)
12587 {
761269c8
JB
12588 case ada_catch_exception:
12589 case ada_catch_exception_unhandled:
9f757bf7 12590 case ada_catch_handlers:
956a9fb9
JB
12591 {
12592 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
12593 char exception_name[256];
12594
12595 if (addr != 0)
12596 {
c714b426
PA
12597 read_memory (addr, (gdb_byte *) exception_name,
12598 sizeof (exception_name) - 1);
956a9fb9
JB
12599 exception_name [sizeof (exception_name) - 1] = '\0';
12600 }
12601 else
12602 {
12603 /* For some reason, we were unable to read the exception
12604 name. This could happen if the Runtime was compiled
12605 without debugging info, for instance. In that case,
12606 just replace the exception name by the generic string
12607 "exception" - it will read as "an exception" in the
12608 notification we are about to print. */
967cff16 12609 memcpy (exception_name, "exception", sizeof ("exception"));
956a9fb9
JB
12610 }
12611 /* In the case of unhandled exception breakpoints, we print
12612 the exception name as "unhandled EXCEPTION_NAME", to make
12613 it clearer to the user which kind of catchpoint just got
12614 hit. We used ui_out_text to make sure that this extra
12615 info does not pollute the exception name in the MI case. */
761269c8 12616 if (ex == ada_catch_exception_unhandled)
112e8700
SM
12617 uiout->text ("unhandled ");
12618 uiout->field_string ("exception-name", exception_name);
956a9fb9
JB
12619 }
12620 break;
761269c8 12621 case ada_catch_assert:
956a9fb9
JB
12622 /* In this case, the name of the exception is not really
12623 important. Just print "failed assertion" to make it clearer
12624 that his program just hit an assertion-failure catchpoint.
12625 We used ui_out_text because this info does not belong in
12626 the MI output. */
112e8700 12627 uiout->text ("failed assertion");
956a9fb9 12628 break;
f7f9143b 12629 }
e547c119 12630
6f46ac85 12631 gdb::unique_xmalloc_ptr<char> exception_message = ada_exception_message ();
e547c119
JB
12632 if (exception_message != NULL)
12633 {
e547c119 12634 uiout->text (" (");
6f46ac85 12635 uiout->field_string ("exception-message", exception_message.get ());
e547c119 12636 uiout->text (")");
e547c119
JB
12637 }
12638
112e8700 12639 uiout->text (" at ");
956a9fb9 12640 ada_find_printable_frame (get_current_frame ());
f7f9143b
JB
12641
12642 return PRINT_SRC_AND_LOC;
12643}
12644
12645/* Implement the PRINT_ONE method in the breakpoint_ops structure
12646 for all exception catchpoint kinds. */
12647
12648static void
761269c8 12649print_one_exception (enum ada_exception_catchpoint_kind ex,
a6d9a66e 12650 struct breakpoint *b, struct bp_location **last_loc)
f7f9143b 12651{
79a45e25 12652 struct ui_out *uiout = current_uiout;
28010a5d 12653 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
79a45b7d
TT
12654 struct value_print_options opts;
12655
12656 get_user_print_options (&opts);
12657 if (opts.addressprint)
f7f9143b
JB
12658 {
12659 annotate_field (4);
112e8700 12660 uiout->field_core_addr ("addr", b->loc->gdbarch, b->loc->address);
f7f9143b
JB
12661 }
12662
12663 annotate_field (5);
a6d9a66e 12664 *last_loc = b->loc;
f7f9143b
JB
12665 switch (ex)
12666 {
761269c8 12667 case ada_catch_exception:
bc18fbb5 12668 if (!c->excep_string.empty ())
f7f9143b 12669 {
bc18fbb5
TT
12670 std::string msg = string_printf (_("`%s' Ada exception"),
12671 c->excep_string.c_str ());
28010a5d 12672
112e8700 12673 uiout->field_string ("what", msg);
f7f9143b
JB
12674 }
12675 else
112e8700 12676 uiout->field_string ("what", "all Ada exceptions");
f7f9143b
JB
12677
12678 break;
12679
761269c8 12680 case ada_catch_exception_unhandled:
112e8700 12681 uiout->field_string ("what", "unhandled Ada exceptions");
f7f9143b
JB
12682 break;
12683
9f757bf7 12684 case ada_catch_handlers:
bc18fbb5 12685 if (!c->excep_string.empty ())
9f757bf7
XR
12686 {
12687 uiout->field_fmt ("what",
12688 _("`%s' Ada exception handlers"),
bc18fbb5 12689 c->excep_string.c_str ());
9f757bf7
XR
12690 }
12691 else
12692 uiout->field_string ("what", "all Ada exceptions handlers");
12693 break;
12694
761269c8 12695 case ada_catch_assert:
112e8700 12696 uiout->field_string ("what", "failed Ada assertions");
f7f9143b
JB
12697 break;
12698
12699 default:
12700 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12701 break;
12702 }
12703}
12704
12705/* Implement the PRINT_MENTION method in the breakpoint_ops structure
12706 for all exception catchpoint kinds. */
12707
12708static void
761269c8 12709print_mention_exception (enum ada_exception_catchpoint_kind ex,
f7f9143b
JB
12710 struct breakpoint *b)
12711{
28010a5d 12712 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
79a45e25 12713 struct ui_out *uiout = current_uiout;
28010a5d 12714
112e8700 12715 uiout->text (b->disposition == disp_del ? _("Temporary catchpoint ")
00eb2c4a 12716 : _("Catchpoint "));
112e8700
SM
12717 uiout->field_int ("bkptno", b->number);
12718 uiout->text (": ");
00eb2c4a 12719
f7f9143b
JB
12720 switch (ex)
12721 {
761269c8 12722 case ada_catch_exception:
bc18fbb5 12723 if (!c->excep_string.empty ())
00eb2c4a 12724 {
862d101a 12725 std::string info = string_printf (_("`%s' Ada exception"),
bc18fbb5 12726 c->excep_string.c_str ());
862d101a 12727 uiout->text (info.c_str ());
00eb2c4a 12728 }
f7f9143b 12729 else
112e8700 12730 uiout->text (_("all Ada exceptions"));
f7f9143b
JB
12731 break;
12732
761269c8 12733 case ada_catch_exception_unhandled:
112e8700 12734 uiout->text (_("unhandled Ada exceptions"));
f7f9143b 12735 break;
9f757bf7
XR
12736
12737 case ada_catch_handlers:
bc18fbb5 12738 if (!c->excep_string.empty ())
9f757bf7
XR
12739 {
12740 std::string info
12741 = string_printf (_("`%s' Ada exception handlers"),
bc18fbb5 12742 c->excep_string.c_str ());
9f757bf7
XR
12743 uiout->text (info.c_str ());
12744 }
12745 else
12746 uiout->text (_("all Ada exceptions handlers"));
12747 break;
12748
761269c8 12749 case ada_catch_assert:
112e8700 12750 uiout->text (_("failed Ada assertions"));
f7f9143b
JB
12751 break;
12752
12753 default:
12754 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12755 break;
12756 }
12757}
12758
6149aea9
PA
12759/* Implement the PRINT_RECREATE method in the breakpoint_ops structure
12760 for all exception catchpoint kinds. */
12761
12762static void
761269c8 12763print_recreate_exception (enum ada_exception_catchpoint_kind ex,
6149aea9
PA
12764 struct breakpoint *b, struct ui_file *fp)
12765{
28010a5d
PA
12766 struct ada_catchpoint *c = (struct ada_catchpoint *) b;
12767
6149aea9
PA
12768 switch (ex)
12769 {
761269c8 12770 case ada_catch_exception:
6149aea9 12771 fprintf_filtered (fp, "catch exception");
bc18fbb5
TT
12772 if (!c->excep_string.empty ())
12773 fprintf_filtered (fp, " %s", c->excep_string.c_str ());
6149aea9
PA
12774 break;
12775
761269c8 12776 case ada_catch_exception_unhandled:
78076abc 12777 fprintf_filtered (fp, "catch exception unhandled");
6149aea9
PA
12778 break;
12779
9f757bf7
XR
12780 case ada_catch_handlers:
12781 fprintf_filtered (fp, "catch handlers");
12782 break;
12783
761269c8 12784 case ada_catch_assert:
6149aea9
PA
12785 fprintf_filtered (fp, "catch assert");
12786 break;
12787
12788 default:
12789 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
12790 }
d9b3f62e 12791 print_recreate_thread (b, fp);
6149aea9
PA
12792}
12793
f7f9143b
JB
12794/* Virtual table for "catch exception" breakpoints. */
12795
28010a5d
PA
12796static struct bp_location *
12797allocate_location_catch_exception (struct breakpoint *self)
12798{
761269c8 12799 return allocate_location_exception (ada_catch_exception, self);
28010a5d
PA
12800}
12801
12802static void
12803re_set_catch_exception (struct breakpoint *b)
12804{
761269c8 12805 re_set_exception (ada_catch_exception, b);
28010a5d
PA
12806}
12807
12808static void
12809check_status_catch_exception (bpstat bs)
12810{
761269c8 12811 check_status_exception (ada_catch_exception, bs);
28010a5d
PA
12812}
12813
f7f9143b 12814static enum print_stop_action
348d480f 12815print_it_catch_exception (bpstat bs)
f7f9143b 12816{
761269c8 12817 return print_it_exception (ada_catch_exception, bs);
f7f9143b
JB
12818}
12819
12820static void
a6d9a66e 12821print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc)
f7f9143b 12822{
761269c8 12823 print_one_exception (ada_catch_exception, b, last_loc);
f7f9143b
JB
12824}
12825
12826static void
12827print_mention_catch_exception (struct breakpoint *b)
12828{
761269c8 12829 print_mention_exception (ada_catch_exception, b);
f7f9143b
JB
12830}
12831
6149aea9
PA
12832static void
12833print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp)
12834{
761269c8 12835 print_recreate_exception (ada_catch_exception, b, fp);
6149aea9
PA
12836}
12837
2060206e 12838static struct breakpoint_ops catch_exception_breakpoint_ops;
f7f9143b
JB
12839
12840/* Virtual table for "catch exception unhandled" breakpoints. */
12841
28010a5d
PA
12842static struct bp_location *
12843allocate_location_catch_exception_unhandled (struct breakpoint *self)
12844{
761269c8 12845 return allocate_location_exception (ada_catch_exception_unhandled, self);
28010a5d
PA
12846}
12847
12848static void
12849re_set_catch_exception_unhandled (struct breakpoint *b)
12850{
761269c8 12851 re_set_exception (ada_catch_exception_unhandled, b);
28010a5d
PA
12852}
12853
12854static void
12855check_status_catch_exception_unhandled (bpstat bs)
12856{
761269c8 12857 check_status_exception (ada_catch_exception_unhandled, bs);
28010a5d
PA
12858}
12859
f7f9143b 12860static enum print_stop_action
348d480f 12861print_it_catch_exception_unhandled (bpstat bs)
f7f9143b 12862{
761269c8 12863 return print_it_exception (ada_catch_exception_unhandled, bs);
f7f9143b
JB
12864}
12865
12866static void
a6d9a66e
UW
12867print_one_catch_exception_unhandled (struct breakpoint *b,
12868 struct bp_location **last_loc)
f7f9143b 12869{
761269c8 12870 print_one_exception (ada_catch_exception_unhandled, b, last_loc);
f7f9143b
JB
12871}
12872
12873static void
12874print_mention_catch_exception_unhandled (struct breakpoint *b)
12875{
761269c8 12876 print_mention_exception (ada_catch_exception_unhandled, b);
f7f9143b
JB
12877}
12878
6149aea9
PA
12879static void
12880print_recreate_catch_exception_unhandled (struct breakpoint *b,
12881 struct ui_file *fp)
12882{
761269c8 12883 print_recreate_exception (ada_catch_exception_unhandled, b, fp);
6149aea9
PA
12884}
12885
2060206e 12886static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops;
f7f9143b
JB
12887
12888/* Virtual table for "catch assert" breakpoints. */
12889
28010a5d
PA
12890static struct bp_location *
12891allocate_location_catch_assert (struct breakpoint *self)
12892{
761269c8 12893 return allocate_location_exception (ada_catch_assert, self);
28010a5d
PA
12894}
12895
12896static void
12897re_set_catch_assert (struct breakpoint *b)
12898{
761269c8 12899 re_set_exception (ada_catch_assert, b);
28010a5d
PA
12900}
12901
12902static void
12903check_status_catch_assert (bpstat bs)
12904{
761269c8 12905 check_status_exception (ada_catch_assert, bs);
28010a5d
PA
12906}
12907
f7f9143b 12908static enum print_stop_action
348d480f 12909print_it_catch_assert (bpstat bs)
f7f9143b 12910{
761269c8 12911 return print_it_exception (ada_catch_assert, bs);
f7f9143b
JB
12912}
12913
12914static void
a6d9a66e 12915print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc)
f7f9143b 12916{
761269c8 12917 print_one_exception (ada_catch_assert, b, last_loc);
f7f9143b
JB
12918}
12919
12920static void
12921print_mention_catch_assert (struct breakpoint *b)
12922{
761269c8 12923 print_mention_exception (ada_catch_assert, b);
f7f9143b
JB
12924}
12925
6149aea9
PA
12926static void
12927print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp)
12928{
761269c8 12929 print_recreate_exception (ada_catch_assert, b, fp);
6149aea9
PA
12930}
12931
2060206e 12932static struct breakpoint_ops catch_assert_breakpoint_ops;
f7f9143b 12933
9f757bf7
XR
12934/* Virtual table for "catch handlers" breakpoints. */
12935
12936static struct bp_location *
12937allocate_location_catch_handlers (struct breakpoint *self)
12938{
12939 return allocate_location_exception (ada_catch_handlers, self);
12940}
12941
12942static void
12943re_set_catch_handlers (struct breakpoint *b)
12944{
12945 re_set_exception (ada_catch_handlers, b);
12946}
12947
12948static void
12949check_status_catch_handlers (bpstat bs)
12950{
12951 check_status_exception (ada_catch_handlers, bs);
12952}
12953
12954static enum print_stop_action
12955print_it_catch_handlers (bpstat bs)
12956{
12957 return print_it_exception (ada_catch_handlers, bs);
12958}
12959
12960static void
12961print_one_catch_handlers (struct breakpoint *b,
12962 struct bp_location **last_loc)
12963{
12964 print_one_exception (ada_catch_handlers, b, last_loc);
12965}
12966
12967static void
12968print_mention_catch_handlers (struct breakpoint *b)
12969{
12970 print_mention_exception (ada_catch_handlers, b);
12971}
12972
12973static void
12974print_recreate_catch_handlers (struct breakpoint *b,
12975 struct ui_file *fp)
12976{
12977 print_recreate_exception (ada_catch_handlers, b, fp);
12978}
12979
12980static struct breakpoint_ops catch_handlers_breakpoint_ops;
12981
f7f9143b
JB
12982/* Split the arguments specified in a "catch exception" command.
12983 Set EX to the appropriate catchpoint type.
28010a5d 12984 Set EXCEP_STRING to the name of the specific exception if
5845583d 12985 specified by the user.
9f757bf7
XR
12986 IS_CATCH_HANDLERS_CMD: True if the arguments are for a
12987 "catch handlers" command. False otherwise.
5845583d
JB
12988 If a condition is found at the end of the arguments, the condition
12989 expression is stored in COND_STRING (memory must be deallocated
12990 after use). Otherwise COND_STRING is set to NULL. */
f7f9143b
JB
12991
12992static void
a121b7c1 12993catch_ada_exception_command_split (const char *args,
9f757bf7 12994 bool is_catch_handlers_cmd,
761269c8 12995 enum ada_exception_catchpoint_kind *ex,
bc18fbb5
TT
12996 std::string *excep_string,
12997 std::string *cond_string)
f7f9143b 12998{
bc18fbb5 12999 std::string exception_name;
f7f9143b 13000
bc18fbb5
TT
13001 exception_name = extract_arg (&args);
13002 if (exception_name == "if")
5845583d
JB
13003 {
13004 /* This is not an exception name; this is the start of a condition
13005 expression for a catchpoint on all exceptions. So, "un-get"
13006 this token, and set exception_name to NULL. */
bc18fbb5 13007 exception_name.clear ();
5845583d
JB
13008 args -= 2;
13009 }
f7f9143b 13010
5845583d 13011 /* Check to see if we have a condition. */
f7f9143b 13012
f1735a53 13013 args = skip_spaces (args);
61012eef 13014 if (startswith (args, "if")
5845583d
JB
13015 && (isspace (args[2]) || args[2] == '\0'))
13016 {
13017 args += 2;
f1735a53 13018 args = skip_spaces (args);
5845583d
JB
13019
13020 if (args[0] == '\0')
13021 error (_("Condition missing after `if' keyword"));
bc18fbb5 13022 *cond_string = args;
5845583d
JB
13023
13024 args += strlen (args);
13025 }
13026
13027 /* Check that we do not have any more arguments. Anything else
13028 is unexpected. */
f7f9143b
JB
13029
13030 if (args[0] != '\0')
13031 error (_("Junk at end of expression"));
13032
9f757bf7
XR
13033 if (is_catch_handlers_cmd)
13034 {
13035 /* Catch handling of exceptions. */
13036 *ex = ada_catch_handlers;
13037 *excep_string = exception_name;
13038 }
bc18fbb5 13039 else if (exception_name.empty ())
f7f9143b
JB
13040 {
13041 /* Catch all exceptions. */
761269c8 13042 *ex = ada_catch_exception;
bc18fbb5 13043 excep_string->clear ();
f7f9143b 13044 }
bc18fbb5 13045 else if (exception_name == "unhandled")
f7f9143b
JB
13046 {
13047 /* Catch unhandled exceptions. */
761269c8 13048 *ex = ada_catch_exception_unhandled;
bc18fbb5 13049 excep_string->clear ();
f7f9143b
JB
13050 }
13051 else
13052 {
13053 /* Catch a specific exception. */
761269c8 13054 *ex = ada_catch_exception;
28010a5d 13055 *excep_string = exception_name;
f7f9143b
JB
13056 }
13057}
13058
13059/* Return the name of the symbol on which we should break in order to
13060 implement a catchpoint of the EX kind. */
13061
13062static const char *
761269c8 13063ada_exception_sym_name (enum ada_exception_catchpoint_kind ex)
f7f9143b 13064{
3eecfa55
JB
13065 struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ());
13066
13067 gdb_assert (data->exception_info != NULL);
0259addd 13068
f7f9143b
JB
13069 switch (ex)
13070 {
761269c8 13071 case ada_catch_exception:
3eecfa55 13072 return (data->exception_info->catch_exception_sym);
f7f9143b 13073 break;
761269c8 13074 case ada_catch_exception_unhandled:
3eecfa55 13075 return (data->exception_info->catch_exception_unhandled_sym);
f7f9143b 13076 break;
761269c8 13077 case ada_catch_assert:
3eecfa55 13078 return (data->exception_info->catch_assert_sym);
f7f9143b 13079 break;
9f757bf7
XR
13080 case ada_catch_handlers:
13081 return (data->exception_info->catch_handlers_sym);
13082 break;
f7f9143b
JB
13083 default:
13084 internal_error (__FILE__, __LINE__,
13085 _("unexpected catchpoint kind (%d)"), ex);
13086 }
13087}
13088
13089/* Return the breakpoint ops "virtual table" used for catchpoints
13090 of the EX kind. */
13091
c0a91b2b 13092static const struct breakpoint_ops *
761269c8 13093ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex)
f7f9143b
JB
13094{
13095 switch (ex)
13096 {
761269c8 13097 case ada_catch_exception:
f7f9143b
JB
13098 return (&catch_exception_breakpoint_ops);
13099 break;
761269c8 13100 case ada_catch_exception_unhandled:
f7f9143b
JB
13101 return (&catch_exception_unhandled_breakpoint_ops);
13102 break;
761269c8 13103 case ada_catch_assert:
f7f9143b
JB
13104 return (&catch_assert_breakpoint_ops);
13105 break;
9f757bf7
XR
13106 case ada_catch_handlers:
13107 return (&catch_handlers_breakpoint_ops);
13108 break;
f7f9143b
JB
13109 default:
13110 internal_error (__FILE__, __LINE__,
13111 _("unexpected catchpoint kind (%d)"), ex);
13112 }
13113}
13114
13115/* Return the condition that will be used to match the current exception
13116 being raised with the exception that the user wants to catch. This
13117 assumes that this condition is used when the inferior just triggered
13118 an exception catchpoint.
cb7de75e 13119 EX: the type of catchpoints used for catching Ada exceptions. */
f7f9143b 13120
cb7de75e 13121static std::string
9f757bf7
XR
13122ada_exception_catchpoint_cond_string (const char *excep_string,
13123 enum ada_exception_catchpoint_kind ex)
f7f9143b 13124{
3d0b0fa3 13125 int i;
9f757bf7 13126 bool is_standard_exc = false;
cb7de75e 13127 std::string result;
9f757bf7
XR
13128
13129 if (ex == ada_catch_handlers)
13130 {
13131 /* For exception handlers catchpoints, the condition string does
13132 not use the same parameter as for the other exceptions. */
cb7de75e
TT
13133 result = ("long_integer (GNAT_GCC_exception_Access"
13134 "(gcc_exception).all.occurrence.id)");
9f757bf7
XR
13135 }
13136 else
cb7de75e 13137 result = "long_integer (e)";
3d0b0fa3 13138
0963b4bd 13139 /* The standard exceptions are a special case. They are defined in
3d0b0fa3 13140 runtime units that have been compiled without debugging info; if
28010a5d 13141 EXCEP_STRING is the not-fully-qualified name of a standard
3d0b0fa3
JB
13142 exception (e.g. "constraint_error") then, during the evaluation
13143 of the condition expression, the symbol lookup on this name would
0963b4bd 13144 *not* return this standard exception. The catchpoint condition
3d0b0fa3
JB
13145 may then be set only on user-defined exceptions which have the
13146 same not-fully-qualified name (e.g. my_package.constraint_error).
13147
13148 To avoid this unexcepted behavior, these standard exceptions are
0963b4bd 13149 systematically prefixed by "standard". This means that "catch
3d0b0fa3
JB
13150 exception constraint_error" is rewritten into "catch exception
13151 standard.constraint_error".
13152
13153 If an exception named contraint_error is defined in another package of
13154 the inferior program, then the only way to specify this exception as a
13155 breakpoint condition is to use its fully-qualified named:
13156 e.g. my_package.constraint_error. */
13157
13158 for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++)
13159 {
28010a5d 13160 if (strcmp (standard_exc [i], excep_string) == 0)
3d0b0fa3 13161 {
9f757bf7
XR
13162 is_standard_exc = true;
13163 break;
3d0b0fa3
JB
13164 }
13165 }
9f757bf7 13166
cb7de75e
TT
13167 result += " = ";
13168
9f757bf7 13169 if (is_standard_exc)
cb7de75e 13170 string_appendf (result, "long_integer (&standard.%s)", excep_string);
9f757bf7 13171 else
cb7de75e 13172 string_appendf (result, "long_integer (&%s)", excep_string);
9f757bf7 13173
9f757bf7 13174 return result;
f7f9143b
JB
13175}
13176
13177/* Return the symtab_and_line that should be used to insert an exception
13178 catchpoint of the TYPE kind.
13179
28010a5d
PA
13180 ADDR_STRING returns the name of the function where the real
13181 breakpoint that implements the catchpoints is set, depending on the
13182 type of catchpoint we need to create. */
f7f9143b
JB
13183
13184static struct symtab_and_line
bc18fbb5 13185ada_exception_sal (enum ada_exception_catchpoint_kind ex,
cc12f4a8 13186 std::string *addr_string, const struct breakpoint_ops **ops)
f7f9143b
JB
13187{
13188 const char *sym_name;
13189 struct symbol *sym;
f7f9143b 13190
0259addd
JB
13191 /* First, find out which exception support info to use. */
13192 ada_exception_support_info_sniffer ();
13193
13194 /* Then lookup the function on which we will break in order to catch
f7f9143b 13195 the Ada exceptions requested by the user. */
f7f9143b
JB
13196 sym_name = ada_exception_sym_name (ex);
13197 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
13198
57aff202
JB
13199 if (sym == NULL)
13200 error (_("Catchpoint symbol not found: %s"), sym_name);
13201
13202 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
13203 error (_("Unable to insert catchpoint. %s is not a function."), sym_name);
f7f9143b
JB
13204
13205 /* Set ADDR_STRING. */
cc12f4a8 13206 *addr_string = sym_name;
f7f9143b 13207
f7f9143b 13208 /* Set OPS. */
4b9eee8c 13209 *ops = ada_exception_breakpoint_ops (ex);
f7f9143b 13210
f17011e0 13211 return find_function_start_sal (sym, 1);
f7f9143b
JB
13212}
13213
b4a5b78b 13214/* Create an Ada exception catchpoint.
f7f9143b 13215
b4a5b78b 13216 EX_KIND is the kind of exception catchpoint to be created.
5845583d 13217
bc18fbb5 13218 If EXCEPT_STRING is empty, this catchpoint is expected to trigger
2df4d1d5 13219 for all exceptions. Otherwise, EXCEPT_STRING indicates the name
bc18fbb5 13220 of the exception to which this catchpoint applies.
2df4d1d5 13221
bc18fbb5 13222 COND_STRING, if not empty, is the catchpoint condition.
f7f9143b 13223
b4a5b78b
JB
13224 TEMPFLAG, if nonzero, means that the underlying breakpoint
13225 should be temporary.
28010a5d 13226
b4a5b78b 13227 FROM_TTY is the usual argument passed to all commands implementations. */
28010a5d 13228
349774ef 13229void
28010a5d 13230create_ada_exception_catchpoint (struct gdbarch *gdbarch,
761269c8 13231 enum ada_exception_catchpoint_kind ex_kind,
bc18fbb5 13232 const std::string &excep_string,
56ecd069 13233 const std::string &cond_string,
28010a5d 13234 int tempflag,
349774ef 13235 int disabled,
28010a5d
PA
13236 int from_tty)
13237{
cc12f4a8 13238 std::string addr_string;
b4a5b78b 13239 const struct breakpoint_ops *ops = NULL;
bc18fbb5 13240 struct symtab_and_line sal = ada_exception_sal (ex_kind, &addr_string, &ops);
28010a5d 13241
b270e6f9 13242 std::unique_ptr<ada_catchpoint> c (new ada_catchpoint ());
cc12f4a8 13243 init_ada_exception_breakpoint (c.get (), gdbarch, sal, addr_string.c_str (),
349774ef 13244 ops, tempflag, disabled, from_tty);
28010a5d 13245 c->excep_string = excep_string;
9f757bf7 13246 create_excep_cond_exprs (c.get (), ex_kind);
56ecd069
XR
13247 if (!cond_string.empty ())
13248 set_breakpoint_condition (c.get (), cond_string.c_str (), from_tty);
b270e6f9 13249 install_breakpoint (0, std::move (c), 1);
f7f9143b
JB
13250}
13251
9ac4176b
PA
13252/* Implement the "catch exception" command. */
13253
13254static void
eb4c3f4a 13255catch_ada_exception_command (const char *arg_entry, int from_tty,
9ac4176b
PA
13256 struct cmd_list_element *command)
13257{
a121b7c1 13258 const char *arg = arg_entry;
9ac4176b
PA
13259 struct gdbarch *gdbarch = get_current_arch ();
13260 int tempflag;
761269c8 13261 enum ada_exception_catchpoint_kind ex_kind;
bc18fbb5 13262 std::string excep_string;
56ecd069 13263 std::string cond_string;
9ac4176b
PA
13264
13265 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
13266
13267 if (!arg)
13268 arg = "";
9f757bf7 13269 catch_ada_exception_command_split (arg, false, &ex_kind, &excep_string,
bc18fbb5 13270 &cond_string);
9f757bf7
XR
13271 create_ada_exception_catchpoint (gdbarch, ex_kind,
13272 excep_string, cond_string,
13273 tempflag, 1 /* enabled */,
13274 from_tty);
13275}
13276
13277/* Implement the "catch handlers" command. */
13278
13279static void
13280catch_ada_handlers_command (const char *arg_entry, int from_tty,
13281 struct cmd_list_element *command)
13282{
13283 const char *arg = arg_entry;
13284 struct gdbarch *gdbarch = get_current_arch ();
13285 int tempflag;
13286 enum ada_exception_catchpoint_kind ex_kind;
bc18fbb5 13287 std::string excep_string;
56ecd069 13288 std::string cond_string;
9f757bf7
XR
13289
13290 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
13291
13292 if (!arg)
13293 arg = "";
13294 catch_ada_exception_command_split (arg, true, &ex_kind, &excep_string,
bc18fbb5 13295 &cond_string);
b4a5b78b
JB
13296 create_ada_exception_catchpoint (gdbarch, ex_kind,
13297 excep_string, cond_string,
349774ef
JB
13298 tempflag, 1 /* enabled */,
13299 from_tty);
9ac4176b
PA
13300}
13301
b4a5b78b 13302/* Split the arguments specified in a "catch assert" command.
5845583d 13303
b4a5b78b
JB
13304 ARGS contains the command's arguments (or the empty string if
13305 no arguments were passed).
5845583d
JB
13306
13307 If ARGS contains a condition, set COND_STRING to that condition
b4a5b78b 13308 (the memory needs to be deallocated after use). */
5845583d 13309
b4a5b78b 13310static void
56ecd069 13311catch_ada_assert_command_split (const char *args, std::string &cond_string)
f7f9143b 13312{
f1735a53 13313 args = skip_spaces (args);
f7f9143b 13314
5845583d 13315 /* Check whether a condition was provided. */
61012eef 13316 if (startswith (args, "if")
5845583d 13317 && (isspace (args[2]) || args[2] == '\0'))
f7f9143b 13318 {
5845583d 13319 args += 2;
f1735a53 13320 args = skip_spaces (args);
5845583d
JB
13321 if (args[0] == '\0')
13322 error (_("condition missing after `if' keyword"));
56ecd069 13323 cond_string.assign (args);
f7f9143b
JB
13324 }
13325
5845583d
JB
13326 /* Otherwise, there should be no other argument at the end of
13327 the command. */
13328 else if (args[0] != '\0')
13329 error (_("Junk at end of arguments."));
f7f9143b
JB
13330}
13331
9ac4176b
PA
13332/* Implement the "catch assert" command. */
13333
13334static void
eb4c3f4a 13335catch_assert_command (const char *arg_entry, int from_tty,
9ac4176b
PA
13336 struct cmd_list_element *command)
13337{
a121b7c1 13338 const char *arg = arg_entry;
9ac4176b
PA
13339 struct gdbarch *gdbarch = get_current_arch ();
13340 int tempflag;
56ecd069 13341 std::string cond_string;
9ac4176b
PA
13342
13343 tempflag = get_cmd_context (command) == CATCH_TEMPORARY;
13344
13345 if (!arg)
13346 arg = "";
56ecd069 13347 catch_ada_assert_command_split (arg, cond_string);
761269c8 13348 create_ada_exception_catchpoint (gdbarch, ada_catch_assert,
241db429 13349 "", cond_string,
349774ef
JB
13350 tempflag, 1 /* enabled */,
13351 from_tty);
9ac4176b 13352}
778865d3
JB
13353
13354/* Return non-zero if the symbol SYM is an Ada exception object. */
13355
13356static int
13357ada_is_exception_sym (struct symbol *sym)
13358{
a737d952 13359 const char *type_name = TYPE_NAME (SYMBOL_TYPE (sym));
778865d3
JB
13360
13361 return (SYMBOL_CLASS (sym) != LOC_TYPEDEF
13362 && SYMBOL_CLASS (sym) != LOC_BLOCK
13363 && SYMBOL_CLASS (sym) != LOC_CONST
13364 && SYMBOL_CLASS (sym) != LOC_UNRESOLVED
13365 && type_name != NULL && strcmp (type_name, "exception") == 0);
13366}
13367
13368/* Given a global symbol SYM, return non-zero iff SYM is a non-standard
13369 Ada exception object. This matches all exceptions except the ones
13370 defined by the Ada language. */
13371
13372static int
13373ada_is_non_standard_exception_sym (struct symbol *sym)
13374{
13375 int i;
13376
13377 if (!ada_is_exception_sym (sym))
13378 return 0;
13379
13380 for (i = 0; i < ARRAY_SIZE (standard_exc); i++)
13381 if (strcmp (SYMBOL_LINKAGE_NAME (sym), standard_exc[i]) == 0)
13382 return 0; /* A standard exception. */
13383
13384 /* Numeric_Error is also a standard exception, so exclude it.
13385 See the STANDARD_EXC description for more details as to why
13386 this exception is not listed in that array. */
13387 if (strcmp (SYMBOL_LINKAGE_NAME (sym), "numeric_error") == 0)
13388 return 0;
13389
13390 return 1;
13391}
13392
ab816a27 13393/* A helper function for std::sort, comparing two struct ada_exc_info
778865d3
JB
13394 objects.
13395
13396 The comparison is determined first by exception name, and then
13397 by exception address. */
13398
ab816a27 13399bool
cc536b21 13400ada_exc_info::operator< (const ada_exc_info &other) const
778865d3 13401{
778865d3
JB
13402 int result;
13403
ab816a27
TT
13404 result = strcmp (name, other.name);
13405 if (result < 0)
13406 return true;
13407 if (result == 0 && addr < other.addr)
13408 return true;
13409 return false;
13410}
778865d3 13411
ab816a27 13412bool
cc536b21 13413ada_exc_info::operator== (const ada_exc_info &other) const
ab816a27
TT
13414{
13415 return addr == other.addr && strcmp (name, other.name) == 0;
778865d3
JB
13416}
13417
13418/* Sort EXCEPTIONS using compare_ada_exception_info as the comparison
13419 routine, but keeping the first SKIP elements untouched.
13420
13421 All duplicates are also removed. */
13422
13423static void
ab816a27 13424sort_remove_dups_ada_exceptions_list (std::vector<ada_exc_info> *exceptions,
778865d3
JB
13425 int skip)
13426{
ab816a27
TT
13427 std::sort (exceptions->begin () + skip, exceptions->end ());
13428 exceptions->erase (std::unique (exceptions->begin () + skip, exceptions->end ()),
13429 exceptions->end ());
778865d3
JB
13430}
13431
778865d3
JB
13432/* Add all exceptions defined by the Ada standard whose name match
13433 a regular expression.
13434
13435 If PREG is not NULL, then this regexp_t object is used to
13436 perform the symbol name matching. Otherwise, no name-based
13437 filtering is performed.
13438
13439 EXCEPTIONS is a vector of exceptions to which matching exceptions
13440 gets pushed. */
13441
13442static void
2d7cc5c7 13443ada_add_standard_exceptions (compiled_regex *preg,
ab816a27 13444 std::vector<ada_exc_info> *exceptions)
778865d3
JB
13445{
13446 int i;
13447
13448 for (i = 0; i < ARRAY_SIZE (standard_exc); i++)
13449 {
13450 if (preg == NULL
2d7cc5c7 13451 || preg->exec (standard_exc[i], 0, NULL, 0) == 0)
778865d3
JB
13452 {
13453 struct bound_minimal_symbol msymbol
13454 = ada_lookup_simple_minsym (standard_exc[i]);
13455
13456 if (msymbol.minsym != NULL)
13457 {
13458 struct ada_exc_info info
77e371c0 13459 = {standard_exc[i], BMSYMBOL_VALUE_ADDRESS (msymbol)};
778865d3 13460
ab816a27 13461 exceptions->push_back (info);
778865d3
JB
13462 }
13463 }
13464 }
13465}
13466
13467/* Add all Ada exceptions defined locally and accessible from the given
13468 FRAME.
13469
13470 If PREG is not NULL, then this regexp_t object is used to
13471 perform the symbol name matching. Otherwise, no name-based
13472 filtering is performed.
13473
13474 EXCEPTIONS is a vector of exceptions to which matching exceptions
13475 gets pushed. */
13476
13477static void
2d7cc5c7
PA
13478ada_add_exceptions_from_frame (compiled_regex *preg,
13479 struct frame_info *frame,
ab816a27 13480 std::vector<ada_exc_info> *exceptions)
778865d3 13481{
3977b71f 13482 const struct block *block = get_frame_block (frame, 0);
778865d3
JB
13483
13484 while (block != 0)
13485 {
13486 struct block_iterator iter;
13487 struct symbol *sym;
13488
13489 ALL_BLOCK_SYMBOLS (block, iter, sym)
13490 {
13491 switch (SYMBOL_CLASS (sym))
13492 {
13493 case LOC_TYPEDEF:
13494 case LOC_BLOCK:
13495 case LOC_CONST:
13496 break;
13497 default:
13498 if (ada_is_exception_sym (sym))
13499 {
13500 struct ada_exc_info info = {SYMBOL_PRINT_NAME (sym),
13501 SYMBOL_VALUE_ADDRESS (sym)};
13502
ab816a27 13503 exceptions->push_back (info);
778865d3
JB
13504 }
13505 }
13506 }
13507 if (BLOCK_FUNCTION (block) != NULL)
13508 break;
13509 block = BLOCK_SUPERBLOCK (block);
13510 }
13511}
13512
14bc53a8
PA
13513/* Return true if NAME matches PREG or if PREG is NULL. */
13514
13515static bool
2d7cc5c7 13516name_matches_regex (const char *name, compiled_regex *preg)
14bc53a8
PA
13517{
13518 return (preg == NULL
2d7cc5c7 13519 || preg->exec (ada_decode (name), 0, NULL, 0) == 0);
14bc53a8
PA
13520}
13521
778865d3
JB
13522/* Add all exceptions defined globally whose name name match
13523 a regular expression, excluding standard exceptions.
13524
13525 The reason we exclude standard exceptions is that they need
13526 to be handled separately: Standard exceptions are defined inside
13527 a runtime unit which is normally not compiled with debugging info,
13528 and thus usually do not show up in our symbol search. However,
13529 if the unit was in fact built with debugging info, we need to
13530 exclude them because they would duplicate the entry we found
13531 during the special loop that specifically searches for those
13532 standard exceptions.
13533
13534 If PREG is not NULL, then this regexp_t object is used to
13535 perform the symbol name matching. Otherwise, no name-based
13536 filtering is performed.
13537
13538 EXCEPTIONS is a vector of exceptions to which matching exceptions
13539 gets pushed. */
13540
13541static void
2d7cc5c7 13542ada_add_global_exceptions (compiled_regex *preg,
ab816a27 13543 std::vector<ada_exc_info> *exceptions)
778865d3 13544{
14bc53a8
PA
13545 /* In Ada, the symbol "search name" is a linkage name, whereas the
13546 regular expression used to do the matching refers to the natural
13547 name. So match against the decoded name. */
13548 expand_symtabs_matching (NULL,
b5ec771e 13549 lookup_name_info::match_any (),
14bc53a8
PA
13550 [&] (const char *search_name)
13551 {
13552 const char *decoded = ada_decode (search_name);
13553 return name_matches_regex (decoded, preg);
13554 },
13555 NULL,
13556 VARIABLES_DOMAIN);
778865d3 13557
2030c079 13558 for (objfile *objfile : current_program_space->objfiles ())
778865d3 13559 {
b669c953 13560 for (compunit_symtab *s : objfile->compunits ())
778865d3 13561 {
d8aeb77f
TT
13562 const struct blockvector *bv = COMPUNIT_BLOCKVECTOR (s);
13563 int i;
778865d3 13564
d8aeb77f
TT
13565 for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++)
13566 {
582942f4 13567 const struct block *b = BLOCKVECTOR_BLOCK (bv, i);
d8aeb77f
TT
13568 struct block_iterator iter;
13569 struct symbol *sym;
778865d3 13570
d8aeb77f
TT
13571 ALL_BLOCK_SYMBOLS (b, iter, sym)
13572 if (ada_is_non_standard_exception_sym (sym)
13573 && name_matches_regex (SYMBOL_NATURAL_NAME (sym), preg))
13574 {
13575 struct ada_exc_info info
13576 = {SYMBOL_PRINT_NAME (sym), SYMBOL_VALUE_ADDRESS (sym)};
13577
13578 exceptions->push_back (info);
13579 }
13580 }
778865d3
JB
13581 }
13582 }
13583}
13584
13585/* Implements ada_exceptions_list with the regular expression passed
13586 as a regex_t, rather than a string.
13587
13588 If not NULL, PREG is used to filter out exceptions whose names
13589 do not match. Otherwise, all exceptions are listed. */
13590
ab816a27 13591static std::vector<ada_exc_info>
2d7cc5c7 13592ada_exceptions_list_1 (compiled_regex *preg)
778865d3 13593{
ab816a27 13594 std::vector<ada_exc_info> result;
778865d3
JB
13595 int prev_len;
13596
13597 /* First, list the known standard exceptions. These exceptions
13598 need to be handled separately, as they are usually defined in
13599 runtime units that have been compiled without debugging info. */
13600
13601 ada_add_standard_exceptions (preg, &result);
13602
13603 /* Next, find all exceptions whose scope is local and accessible
13604 from the currently selected frame. */
13605
13606 if (has_stack_frames ())
13607 {
ab816a27 13608 prev_len = result.size ();
778865d3
JB
13609 ada_add_exceptions_from_frame (preg, get_selected_frame (NULL),
13610 &result);
ab816a27 13611 if (result.size () > prev_len)
778865d3
JB
13612 sort_remove_dups_ada_exceptions_list (&result, prev_len);
13613 }
13614
13615 /* Add all exceptions whose scope is global. */
13616
ab816a27 13617 prev_len = result.size ();
778865d3 13618 ada_add_global_exceptions (preg, &result);
ab816a27 13619 if (result.size () > prev_len)
778865d3
JB
13620 sort_remove_dups_ada_exceptions_list (&result, prev_len);
13621
778865d3
JB
13622 return result;
13623}
13624
13625/* Return a vector of ada_exc_info.
13626
13627 If REGEXP is NULL, all exceptions are included in the result.
13628 Otherwise, it should contain a valid regular expression,
13629 and only the exceptions whose names match that regular expression
13630 are included in the result.
13631
13632 The exceptions are sorted in the following order:
13633 - Standard exceptions (defined by the Ada language), in
13634 alphabetical order;
13635 - Exceptions only visible from the current frame, in
13636 alphabetical order;
13637 - Exceptions whose scope is global, in alphabetical order. */
13638
ab816a27 13639std::vector<ada_exc_info>
778865d3
JB
13640ada_exceptions_list (const char *regexp)
13641{
2d7cc5c7
PA
13642 if (regexp == NULL)
13643 return ada_exceptions_list_1 (NULL);
778865d3 13644
2d7cc5c7
PA
13645 compiled_regex reg (regexp, REG_NOSUB, _("invalid regular expression"));
13646 return ada_exceptions_list_1 (&reg);
778865d3
JB
13647}
13648
13649/* Implement the "info exceptions" command. */
13650
13651static void
1d12d88f 13652info_exceptions_command (const char *regexp, int from_tty)
778865d3 13653{
778865d3 13654 struct gdbarch *gdbarch = get_current_arch ();
778865d3 13655
ab816a27 13656 std::vector<ada_exc_info> exceptions = ada_exceptions_list (regexp);
778865d3
JB
13657
13658 if (regexp != NULL)
13659 printf_filtered
13660 (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp);
13661 else
13662 printf_filtered (_("All defined Ada exceptions:\n"));
13663
ab816a27
TT
13664 for (const ada_exc_info &info : exceptions)
13665 printf_filtered ("%s: %s\n", info.name, paddress (gdbarch, info.addr));
778865d3
JB
13666}
13667
4c4b4cd2
PH
13668 /* Operators */
13669/* Information about operators given special treatment in functions
13670 below. */
13671/* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
13672
13673#define ADA_OPERATORS \
13674 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
13675 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
13676 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
13677 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
13678 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
13679 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
13680 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
13681 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
13682 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
13683 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
13684 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
13685 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
13686 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
13687 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
13688 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
52ce6436
PH
13689 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
13690 OP_DEFN (OP_OTHERS, 1, 1, 0) \
13691 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
13692 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
4c4b4cd2
PH
13693
13694static void
554794dc
SDJ
13695ada_operator_length (const struct expression *exp, int pc, int *oplenp,
13696 int *argsp)
4c4b4cd2
PH
13697{
13698 switch (exp->elts[pc - 1].opcode)
13699 {
76a01679 13700 default:
4c4b4cd2
PH
13701 operator_length_standard (exp, pc, oplenp, argsp);
13702 break;
13703
13704#define OP_DEFN(op, len, args, binop) \
13705 case op: *oplenp = len; *argsp = args; break;
13706 ADA_OPERATORS;
13707#undef OP_DEFN
52ce6436
PH
13708
13709 case OP_AGGREGATE:
13710 *oplenp = 3;
13711 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
13712 break;
13713
13714 case OP_CHOICES:
13715 *oplenp = 3;
13716 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
13717 break;
4c4b4cd2
PH
13718 }
13719}
13720
c0201579
JK
13721/* Implementation of the exp_descriptor method operator_check. */
13722
13723static int
13724ada_operator_check (struct expression *exp, int pos,
13725 int (*objfile_func) (struct objfile *objfile, void *data),
13726 void *data)
13727{
13728 const union exp_element *const elts = exp->elts;
13729 struct type *type = NULL;
13730
13731 switch (elts[pos].opcode)
13732 {
13733 case UNOP_IN_RANGE:
13734 case UNOP_QUAL:
13735 type = elts[pos + 1].type;
13736 break;
13737
13738 default:
13739 return operator_check_standard (exp, pos, objfile_func, data);
13740 }
13741
13742 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
13743
13744 if (type && TYPE_OBJFILE (type)
13745 && (*objfile_func) (TYPE_OBJFILE (type), data))
13746 return 1;
13747
13748 return 0;
13749}
13750
a121b7c1 13751static const char *
4c4b4cd2
PH
13752ada_op_name (enum exp_opcode opcode)
13753{
13754 switch (opcode)
13755 {
76a01679 13756 default:
4c4b4cd2 13757 return op_name_standard (opcode);
52ce6436 13758
4c4b4cd2
PH
13759#define OP_DEFN(op, len, args, binop) case op: return #op;
13760 ADA_OPERATORS;
13761#undef OP_DEFN
52ce6436
PH
13762
13763 case OP_AGGREGATE:
13764 return "OP_AGGREGATE";
13765 case OP_CHOICES:
13766 return "OP_CHOICES";
13767 case OP_NAME:
13768 return "OP_NAME";
4c4b4cd2
PH
13769 }
13770}
13771
13772/* As for operator_length, but assumes PC is pointing at the first
13773 element of the operator, and gives meaningful results only for the
52ce6436 13774 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
4c4b4cd2
PH
13775
13776static void
76a01679
JB
13777ada_forward_operator_length (struct expression *exp, int pc,
13778 int *oplenp, int *argsp)
4c4b4cd2 13779{
76a01679 13780 switch (exp->elts[pc].opcode)
4c4b4cd2
PH
13781 {
13782 default:
13783 *oplenp = *argsp = 0;
13784 break;
52ce6436 13785
4c4b4cd2
PH
13786#define OP_DEFN(op, len, args, binop) \
13787 case op: *oplenp = len; *argsp = args; break;
13788 ADA_OPERATORS;
13789#undef OP_DEFN
52ce6436
PH
13790
13791 case OP_AGGREGATE:
13792 *oplenp = 3;
13793 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
13794 break;
13795
13796 case OP_CHOICES:
13797 *oplenp = 3;
13798 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
13799 break;
13800
13801 case OP_STRING:
13802 case OP_NAME:
13803 {
13804 int len = longest_to_int (exp->elts[pc + 1].longconst);
5b4ee69b 13805
52ce6436
PH
13806 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
13807 *argsp = 0;
13808 break;
13809 }
4c4b4cd2
PH
13810 }
13811}
13812
13813static int
13814ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
13815{
13816 enum exp_opcode op = exp->elts[elt].opcode;
13817 int oplen, nargs;
13818 int pc = elt;
13819 int i;
76a01679 13820
4c4b4cd2
PH
13821 ada_forward_operator_length (exp, elt, &oplen, &nargs);
13822
76a01679 13823 switch (op)
4c4b4cd2 13824 {
76a01679 13825 /* Ada attributes ('Foo). */
4c4b4cd2
PH
13826 case OP_ATR_FIRST:
13827 case OP_ATR_LAST:
13828 case OP_ATR_LENGTH:
13829 case OP_ATR_IMAGE:
13830 case OP_ATR_MAX:
13831 case OP_ATR_MIN:
13832 case OP_ATR_MODULUS:
13833 case OP_ATR_POS:
13834 case OP_ATR_SIZE:
13835 case OP_ATR_TAG:
13836 case OP_ATR_VAL:
13837 break;
13838
13839 case UNOP_IN_RANGE:
13840 case UNOP_QUAL:
323e0a4a
AC
13841 /* XXX: gdb_sprint_host_address, type_sprint */
13842 fprintf_filtered (stream, _("Type @"));
4c4b4cd2
PH
13843 gdb_print_host_address (exp->elts[pc + 1].type, stream);
13844 fprintf_filtered (stream, " (");
13845 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
13846 fprintf_filtered (stream, ")");
13847 break;
13848 case BINOP_IN_BOUNDS:
52ce6436
PH
13849 fprintf_filtered (stream, " (%d)",
13850 longest_to_int (exp->elts[pc + 2].longconst));
4c4b4cd2
PH
13851 break;
13852 case TERNOP_IN_RANGE:
13853 break;
13854
52ce6436
PH
13855 case OP_AGGREGATE:
13856 case OP_OTHERS:
13857 case OP_DISCRETE_RANGE:
13858 case OP_POSITIONAL:
13859 case OP_CHOICES:
13860 break;
13861
13862 case OP_NAME:
13863 case OP_STRING:
13864 {
13865 char *name = &exp->elts[elt + 2].string;
13866 int len = longest_to_int (exp->elts[elt + 1].longconst);
5b4ee69b 13867
52ce6436
PH
13868 fprintf_filtered (stream, "Text: `%.*s'", len, name);
13869 break;
13870 }
13871
4c4b4cd2
PH
13872 default:
13873 return dump_subexp_body_standard (exp, stream, elt);
13874 }
13875
13876 elt += oplen;
13877 for (i = 0; i < nargs; i += 1)
13878 elt = dump_subexp (exp, stream, elt);
13879
13880 return elt;
13881}
13882
13883/* The Ada extension of print_subexp (q.v.). */
13884
76a01679
JB
13885static void
13886ada_print_subexp (struct expression *exp, int *pos,
13887 struct ui_file *stream, enum precedence prec)
4c4b4cd2 13888{
52ce6436 13889 int oplen, nargs, i;
4c4b4cd2
PH
13890 int pc = *pos;
13891 enum exp_opcode op = exp->elts[pc].opcode;
13892
13893 ada_forward_operator_length (exp, pc, &oplen, &nargs);
13894
52ce6436 13895 *pos += oplen;
4c4b4cd2
PH
13896 switch (op)
13897 {
13898 default:
52ce6436 13899 *pos -= oplen;
4c4b4cd2
PH
13900 print_subexp_standard (exp, pos, stream, prec);
13901 return;
13902
13903 case OP_VAR_VALUE:
4c4b4cd2
PH
13904 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
13905 return;
13906
13907 case BINOP_IN_BOUNDS:
323e0a4a 13908 /* XXX: sprint_subexp */
4c4b4cd2 13909 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 13910 fputs_filtered (" in ", stream);
4c4b4cd2 13911 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 13912 fputs_filtered ("'range", stream);
4c4b4cd2 13913 if (exp->elts[pc + 1].longconst > 1)
76a01679
JB
13914 fprintf_filtered (stream, "(%ld)",
13915 (long) exp->elts[pc + 1].longconst);
4c4b4cd2
PH
13916 return;
13917
13918 case TERNOP_IN_RANGE:
4c4b4cd2 13919 if (prec >= PREC_EQUAL)
76a01679 13920 fputs_filtered ("(", stream);
323e0a4a 13921 /* XXX: sprint_subexp */
4c4b4cd2 13922 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 13923 fputs_filtered (" in ", stream);
4c4b4cd2
PH
13924 print_subexp (exp, pos, stream, PREC_EQUAL);
13925 fputs_filtered (" .. ", stream);
13926 print_subexp (exp, pos, stream, PREC_EQUAL);
13927 if (prec >= PREC_EQUAL)
76a01679
JB
13928 fputs_filtered (")", stream);
13929 return;
4c4b4cd2
PH
13930
13931 case OP_ATR_FIRST:
13932 case OP_ATR_LAST:
13933 case OP_ATR_LENGTH:
13934 case OP_ATR_IMAGE:
13935 case OP_ATR_MAX:
13936 case OP_ATR_MIN:
13937 case OP_ATR_MODULUS:
13938 case OP_ATR_POS:
13939 case OP_ATR_SIZE:
13940 case OP_ATR_TAG:
13941 case OP_ATR_VAL:
4c4b4cd2 13942 if (exp->elts[*pos].opcode == OP_TYPE)
76a01679
JB
13943 {
13944 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
79d43c61
TT
13945 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0,
13946 &type_print_raw_options);
76a01679
JB
13947 *pos += 3;
13948 }
4c4b4cd2 13949 else
76a01679 13950 print_subexp (exp, pos, stream, PREC_SUFFIX);
4c4b4cd2
PH
13951 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
13952 if (nargs > 1)
76a01679
JB
13953 {
13954 int tem;
5b4ee69b 13955
76a01679
JB
13956 for (tem = 1; tem < nargs; tem += 1)
13957 {
13958 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
13959 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
13960 }
13961 fputs_filtered (")", stream);
13962 }
4c4b4cd2 13963 return;
14f9c5c9 13964
4c4b4cd2 13965 case UNOP_QUAL:
4c4b4cd2
PH
13966 type_print (exp->elts[pc + 1].type, "", stream, 0);
13967 fputs_filtered ("'(", stream);
13968 print_subexp (exp, pos, stream, PREC_PREFIX);
13969 fputs_filtered (")", stream);
13970 return;
14f9c5c9 13971
4c4b4cd2 13972 case UNOP_IN_RANGE:
323e0a4a 13973 /* XXX: sprint_subexp */
4c4b4cd2 13974 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 13975 fputs_filtered (" in ", stream);
79d43c61
TT
13976 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0,
13977 &type_print_raw_options);
4c4b4cd2 13978 return;
52ce6436
PH
13979
13980 case OP_DISCRETE_RANGE:
13981 print_subexp (exp, pos, stream, PREC_SUFFIX);
13982 fputs_filtered ("..", stream);
13983 print_subexp (exp, pos, stream, PREC_SUFFIX);
13984 return;
13985
13986 case OP_OTHERS:
13987 fputs_filtered ("others => ", stream);
13988 print_subexp (exp, pos, stream, PREC_SUFFIX);
13989 return;
13990
13991 case OP_CHOICES:
13992 for (i = 0; i < nargs-1; i += 1)
13993 {
13994 if (i > 0)
13995 fputs_filtered ("|", stream);
13996 print_subexp (exp, pos, stream, PREC_SUFFIX);
13997 }
13998 fputs_filtered (" => ", stream);
13999 print_subexp (exp, pos, stream, PREC_SUFFIX);
14000 return;
14001
14002 case OP_POSITIONAL:
14003 print_subexp (exp, pos, stream, PREC_SUFFIX);
14004 return;
14005
14006 case OP_AGGREGATE:
14007 fputs_filtered ("(", stream);
14008 for (i = 0; i < nargs; i += 1)
14009 {
14010 if (i > 0)
14011 fputs_filtered (", ", stream);
14012 print_subexp (exp, pos, stream, PREC_SUFFIX);
14013 }
14014 fputs_filtered (")", stream);
14015 return;
4c4b4cd2
PH
14016 }
14017}
14f9c5c9
AS
14018
14019/* Table mapping opcodes into strings for printing operators
14020 and precedences of the operators. */
14021
d2e4a39e
AS
14022static const struct op_print ada_op_print_tab[] = {
14023 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
14024 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
14025 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
14026 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
14027 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
14028 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
14029 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
14030 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
14031 {"<=", BINOP_LEQ, PREC_ORDER, 0},
14032 {">=", BINOP_GEQ, PREC_ORDER, 0},
14033 {">", BINOP_GTR, PREC_ORDER, 0},
14034 {"<", BINOP_LESS, PREC_ORDER, 0},
14035 {">>", BINOP_RSH, PREC_SHIFT, 0},
14036 {"<<", BINOP_LSH, PREC_SHIFT, 0},
14037 {"+", BINOP_ADD, PREC_ADD, 0},
14038 {"-", BINOP_SUB, PREC_ADD, 0},
14039 {"&", BINOP_CONCAT, PREC_ADD, 0},
14040 {"*", BINOP_MUL, PREC_MUL, 0},
14041 {"/", BINOP_DIV, PREC_MUL, 0},
14042 {"rem", BINOP_REM, PREC_MUL, 0},
14043 {"mod", BINOP_MOD, PREC_MUL, 0},
14044 {"**", BINOP_EXP, PREC_REPEAT, 0},
14045 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
14046 {"-", UNOP_NEG, PREC_PREFIX, 0},
14047 {"+", UNOP_PLUS, PREC_PREFIX, 0},
14048 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
14049 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
14050 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
4c4b4cd2
PH
14051 {".all", UNOP_IND, PREC_SUFFIX, 1},
14052 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
14053 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
f486487f 14054 {NULL, OP_NULL, PREC_SUFFIX, 0}
14f9c5c9
AS
14055};
14056\f
72d5681a
PH
14057enum ada_primitive_types {
14058 ada_primitive_type_int,
14059 ada_primitive_type_long,
14060 ada_primitive_type_short,
14061 ada_primitive_type_char,
14062 ada_primitive_type_float,
14063 ada_primitive_type_double,
14064 ada_primitive_type_void,
14065 ada_primitive_type_long_long,
14066 ada_primitive_type_long_double,
14067 ada_primitive_type_natural,
14068 ada_primitive_type_positive,
14069 ada_primitive_type_system_address,
08f49010 14070 ada_primitive_type_storage_offset,
72d5681a
PH
14071 nr_ada_primitive_types
14072};
6c038f32
PH
14073
14074static void
d4a9a881 14075ada_language_arch_info (struct gdbarch *gdbarch,
72d5681a
PH
14076 struct language_arch_info *lai)
14077{
d4a9a881 14078 const struct builtin_type *builtin = builtin_type (gdbarch);
5b4ee69b 14079
72d5681a 14080 lai->primitive_type_vector
d4a9a881 14081 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
72d5681a 14082 struct type *);
e9bb382b
UW
14083
14084 lai->primitive_type_vector [ada_primitive_type_int]
14085 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
14086 0, "integer");
14087 lai->primitive_type_vector [ada_primitive_type_long]
14088 = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch),
14089 0, "long_integer");
14090 lai->primitive_type_vector [ada_primitive_type_short]
14091 = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch),
14092 0, "short_integer");
14093 lai->string_char_type
14094 = lai->primitive_type_vector [ada_primitive_type_char]
cd7c1778 14095 = arch_character_type (gdbarch, TARGET_CHAR_BIT, 0, "character");
e9bb382b
UW
14096 lai->primitive_type_vector [ada_primitive_type_float]
14097 = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch),
49f190bc 14098 "float", gdbarch_float_format (gdbarch));
e9bb382b
UW
14099 lai->primitive_type_vector [ada_primitive_type_double]
14100 = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch),
49f190bc 14101 "long_float", gdbarch_double_format (gdbarch));
e9bb382b
UW
14102 lai->primitive_type_vector [ada_primitive_type_long_long]
14103 = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch),
14104 0, "long_long_integer");
14105 lai->primitive_type_vector [ada_primitive_type_long_double]
5f3bceb6 14106 = arch_float_type (gdbarch, gdbarch_long_double_bit (gdbarch),
49f190bc 14107 "long_long_float", gdbarch_long_double_format (gdbarch));
e9bb382b
UW
14108 lai->primitive_type_vector [ada_primitive_type_natural]
14109 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
14110 0, "natural");
14111 lai->primitive_type_vector [ada_primitive_type_positive]
14112 = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch),
14113 0, "positive");
14114 lai->primitive_type_vector [ada_primitive_type_void]
14115 = builtin->builtin_void;
14116
14117 lai->primitive_type_vector [ada_primitive_type_system_address]
77b7c781
UW
14118 = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, TARGET_CHAR_BIT,
14119 "void"));
72d5681a
PH
14120 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
14121 = "system__address";
fbb06eb1 14122
08f49010
XR
14123 /* Create the equivalent of the System.Storage_Elements.Storage_Offset
14124 type. This is a signed integral type whose size is the same as
14125 the size of addresses. */
14126 {
14127 unsigned int addr_length = TYPE_LENGTH
14128 (lai->primitive_type_vector [ada_primitive_type_system_address]);
14129
14130 lai->primitive_type_vector [ada_primitive_type_storage_offset]
14131 = arch_integer_type (gdbarch, addr_length * HOST_CHAR_BIT, 0,
14132 "storage_offset");
14133 }
14134
47e729a8 14135 lai->bool_type_symbol = NULL;
fbb06eb1 14136 lai->bool_type_default = builtin->builtin_bool;
6c038f32 14137}
6c038f32
PH
14138\f
14139 /* Language vector */
14140
14141/* Not really used, but needed in the ada_language_defn. */
14142
14143static void
6c7a06a3 14144emit_char (int c, struct type *type, struct ui_file *stream, int quoter)
6c038f32 14145{
6c7a06a3 14146 ada_emit_char (c, type, stream, quoter, 1);
6c038f32
PH
14147}
14148
14149static int
410a0ff2 14150parse (struct parser_state *ps)
6c038f32
PH
14151{
14152 warnings_issued = 0;
410a0ff2 14153 return ada_parse (ps);
6c038f32
PH
14154}
14155
14156static const struct exp_descriptor ada_exp_descriptor = {
14157 ada_print_subexp,
14158 ada_operator_length,
c0201579 14159 ada_operator_check,
6c038f32
PH
14160 ada_op_name,
14161 ada_dump_subexp_body,
14162 ada_evaluate_subexp
14163};
14164
b5ec771e
PA
14165/* symbol_name_matcher_ftype adapter for wild_match. */
14166
14167static bool
14168do_wild_match (const char *symbol_search_name,
14169 const lookup_name_info &lookup_name,
a207cff2 14170 completion_match_result *comp_match_res)
b5ec771e
PA
14171{
14172 return wild_match (symbol_search_name, ada_lookup_name (lookup_name));
14173}
14174
14175/* symbol_name_matcher_ftype adapter for full_match. */
14176
14177static bool
14178do_full_match (const char *symbol_search_name,
14179 const lookup_name_info &lookup_name,
a207cff2 14180 completion_match_result *comp_match_res)
b5ec771e
PA
14181{
14182 return full_match (symbol_search_name, ada_lookup_name (lookup_name));
14183}
14184
a2cd4f14
JB
14185/* symbol_name_matcher_ftype for exact (verbatim) matches. */
14186
14187static bool
14188do_exact_match (const char *symbol_search_name,
14189 const lookup_name_info &lookup_name,
14190 completion_match_result *comp_match_res)
14191{
14192 return strcmp (symbol_search_name, ada_lookup_name (lookup_name)) == 0;
14193}
14194
b5ec771e
PA
14195/* Build the Ada lookup name for LOOKUP_NAME. */
14196
14197ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info &lookup_name)
14198{
14199 const std::string &user_name = lookup_name.name ();
14200
14201 if (user_name[0] == '<')
14202 {
14203 if (user_name.back () == '>')
14204 m_encoded_name = user_name.substr (1, user_name.size () - 2);
14205 else
14206 m_encoded_name = user_name.substr (1, user_name.size () - 1);
14207 m_encoded_p = true;
14208 m_verbatim_p = true;
14209 m_wild_match_p = false;
14210 m_standard_p = false;
14211 }
14212 else
14213 {
14214 m_verbatim_p = false;
14215
14216 m_encoded_p = user_name.find ("__") != std::string::npos;
14217
14218 if (!m_encoded_p)
14219 {
14220 const char *folded = ada_fold_name (user_name.c_str ());
14221 const char *encoded = ada_encode_1 (folded, false);
14222 if (encoded != NULL)
14223 m_encoded_name = encoded;
14224 else
14225 m_encoded_name = user_name;
14226 }
14227 else
14228 m_encoded_name = user_name;
14229
14230 /* Handle the 'package Standard' special case. See description
14231 of m_standard_p. */
14232 if (startswith (m_encoded_name.c_str (), "standard__"))
14233 {
14234 m_encoded_name = m_encoded_name.substr (sizeof ("standard__") - 1);
14235 m_standard_p = true;
14236 }
14237 else
14238 m_standard_p = false;
74ccd7f5 14239
b5ec771e
PA
14240 /* If the name contains a ".", then the user is entering a fully
14241 qualified entity name, and the match must not be done in wild
14242 mode. Similarly, if the user wants to complete what looks
14243 like an encoded name, the match must not be done in wild
14244 mode. Also, in the standard__ special case always do
14245 non-wild matching. */
14246 m_wild_match_p
14247 = (lookup_name.match_type () != symbol_name_match_type::FULL
14248 && !m_encoded_p
14249 && !m_standard_p
14250 && user_name.find ('.') == std::string::npos);
14251 }
14252}
14253
14254/* symbol_name_matcher_ftype method for Ada. This only handles
14255 completion mode. */
14256
14257static bool
14258ada_symbol_name_matches (const char *symbol_search_name,
14259 const lookup_name_info &lookup_name,
a207cff2 14260 completion_match_result *comp_match_res)
74ccd7f5 14261{
b5ec771e
PA
14262 return lookup_name.ada ().matches (symbol_search_name,
14263 lookup_name.match_type (),
a207cff2 14264 comp_match_res);
b5ec771e
PA
14265}
14266
de63c46b
PA
14267/* A name matcher that matches the symbol name exactly, with
14268 strcmp. */
14269
14270static bool
14271literal_symbol_name_matcher (const char *symbol_search_name,
14272 const lookup_name_info &lookup_name,
14273 completion_match_result *comp_match_res)
14274{
14275 const std::string &name = lookup_name.name ();
14276
14277 int cmp = (lookup_name.completion_mode ()
14278 ? strncmp (symbol_search_name, name.c_str (), name.size ())
14279 : strcmp (symbol_search_name, name.c_str ()));
14280 if (cmp == 0)
14281 {
14282 if (comp_match_res != NULL)
14283 comp_match_res->set_match (symbol_search_name);
14284 return true;
14285 }
14286 else
14287 return false;
14288}
14289
b5ec771e
PA
14290/* Implement the "la_get_symbol_name_matcher" language_defn method for
14291 Ada. */
14292
14293static symbol_name_matcher_ftype *
14294ada_get_symbol_name_matcher (const lookup_name_info &lookup_name)
14295{
de63c46b
PA
14296 if (lookup_name.match_type () == symbol_name_match_type::SEARCH_NAME)
14297 return literal_symbol_name_matcher;
14298
b5ec771e
PA
14299 if (lookup_name.completion_mode ())
14300 return ada_symbol_name_matches;
74ccd7f5 14301 else
b5ec771e
PA
14302 {
14303 if (lookup_name.ada ().wild_match_p ())
14304 return do_wild_match;
a2cd4f14
JB
14305 else if (lookup_name.ada ().verbatim_p ())
14306 return do_exact_match;
b5ec771e
PA
14307 else
14308 return do_full_match;
14309 }
74ccd7f5
JB
14310}
14311
a5ee536b
JB
14312/* Implement the "la_read_var_value" language_defn method for Ada. */
14313
14314static struct value *
63e43d3a
PMR
14315ada_read_var_value (struct symbol *var, const struct block *var_block,
14316 struct frame_info *frame)
a5ee536b 14317{
3977b71f 14318 const struct block *frame_block = NULL;
a5ee536b
JB
14319 struct symbol *renaming_sym = NULL;
14320
14321 /* The only case where default_read_var_value is not sufficient
14322 is when VAR is a renaming... */
14323 if (frame)
14324 frame_block = get_frame_block (frame, NULL);
14325 if (frame_block)
14326 renaming_sym = ada_find_renaming_symbol (var, frame_block);
14327 if (renaming_sym != NULL)
14328 return ada_read_renaming_var_value (renaming_sym, frame_block);
14329
14330 /* This is a typical case where we expect the default_read_var_value
14331 function to work. */
63e43d3a 14332 return default_read_var_value (var, var_block, frame);
a5ee536b
JB
14333}
14334
56618e20
TT
14335static const char *ada_extensions[] =
14336{
14337 ".adb", ".ads", ".a", ".ada", ".dg", NULL
14338};
14339
47e77640 14340extern const struct language_defn ada_language_defn = {
6c038f32 14341 "ada", /* Language name */
6abde28f 14342 "Ada",
6c038f32 14343 language_ada,
6c038f32 14344 range_check_off,
6c038f32
PH
14345 case_sensitive_on, /* Yes, Ada is case-insensitive, but
14346 that's not quite what this means. */
6c038f32 14347 array_row_major,
9a044a89 14348 macro_expansion_no,
56618e20 14349 ada_extensions,
6c038f32
PH
14350 &ada_exp_descriptor,
14351 parse,
6c038f32
PH
14352 resolve,
14353 ada_printchar, /* Print a character constant */
14354 ada_printstr, /* Function to print string constant */
14355 emit_char, /* Function to print single char (not used) */
6c038f32 14356 ada_print_type, /* Print a type using appropriate syntax */
be942545 14357 ada_print_typedef, /* Print a typedef using appropriate syntax */
6c038f32
PH
14358 ada_val_print, /* Print a value using appropriate syntax */
14359 ada_value_print, /* Print a top-level value */
a5ee536b 14360 ada_read_var_value, /* la_read_var_value */
6c038f32 14361 NULL, /* Language specific skip_trampoline */
2b2d9e11 14362 NULL, /* name_of_this */
59cc4834 14363 true, /* la_store_sym_names_in_linkage_form_p */
6c038f32
PH
14364 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
14365 basic_lookup_transparent_type, /* lookup_transparent_type */
14366 ada_la_decode, /* Language specific symbol demangler */
8b302db8 14367 ada_sniff_from_mangled_name,
0963b4bd
MS
14368 NULL, /* Language specific
14369 class_name_from_physname */
6c038f32
PH
14370 ada_op_print_tab, /* expression operators for printing */
14371 0, /* c-style arrays */
14372 1, /* String lower bound */
6c038f32 14373 ada_get_gdb_completer_word_break_characters,
eb3ff9a5 14374 ada_collect_symbol_completion_matches,
72d5681a 14375 ada_language_arch_info,
e79af960 14376 ada_print_array_index,
41f1b697 14377 default_pass_by_reference,
ae6a3a4c 14378 c_get_string,
e2b7af72 14379 ada_watch_location_expression,
b5ec771e 14380 ada_get_symbol_name_matcher, /* la_get_symbol_name_matcher */
f8eba3c6 14381 ada_iterate_over_symbols,
5ffa0793 14382 default_search_name_hash,
a53b64ea 14383 &ada_varobj_ops,
bb2ec1b3
TT
14384 NULL,
14385 NULL,
6c038f32
PH
14386 LANG_MAGIC
14387};
14388
5bf03f13
JB
14389/* Command-list for the "set/show ada" prefix command. */
14390static struct cmd_list_element *set_ada_list;
14391static struct cmd_list_element *show_ada_list;
14392
14393/* Implement the "set ada" prefix command. */
14394
14395static void
981a3fb3 14396set_ada_command (const char *arg, int from_tty)
5bf03f13
JB
14397{
14398 printf_unfiltered (_(\
14399"\"set ada\" must be followed by the name of a setting.\n"));
635c7e8a 14400 help_list (set_ada_list, "set ada ", all_commands, gdb_stdout);
5bf03f13
JB
14401}
14402
14403/* Implement the "show ada" prefix command. */
14404
14405static void
981a3fb3 14406show_ada_command (const char *args, int from_tty)
5bf03f13
JB
14407{
14408 cmd_show_list (show_ada_list, from_tty, "");
14409}
14410
2060206e
PA
14411static void
14412initialize_ada_catchpoint_ops (void)
14413{
14414 struct breakpoint_ops *ops;
14415
14416 initialize_breakpoint_ops ();
14417
14418 ops = &catch_exception_breakpoint_ops;
14419 *ops = bkpt_breakpoint_ops;
2060206e
PA
14420 ops->allocate_location = allocate_location_catch_exception;
14421 ops->re_set = re_set_catch_exception;
14422 ops->check_status = check_status_catch_exception;
14423 ops->print_it = print_it_catch_exception;
14424 ops->print_one = print_one_catch_exception;
14425 ops->print_mention = print_mention_catch_exception;
14426 ops->print_recreate = print_recreate_catch_exception;
14427
14428 ops = &catch_exception_unhandled_breakpoint_ops;
14429 *ops = bkpt_breakpoint_ops;
2060206e
PA
14430 ops->allocate_location = allocate_location_catch_exception_unhandled;
14431 ops->re_set = re_set_catch_exception_unhandled;
14432 ops->check_status = check_status_catch_exception_unhandled;
14433 ops->print_it = print_it_catch_exception_unhandled;
14434 ops->print_one = print_one_catch_exception_unhandled;
14435 ops->print_mention = print_mention_catch_exception_unhandled;
14436 ops->print_recreate = print_recreate_catch_exception_unhandled;
14437
14438 ops = &catch_assert_breakpoint_ops;
14439 *ops = bkpt_breakpoint_ops;
2060206e
PA
14440 ops->allocate_location = allocate_location_catch_assert;
14441 ops->re_set = re_set_catch_assert;
14442 ops->check_status = check_status_catch_assert;
14443 ops->print_it = print_it_catch_assert;
14444 ops->print_one = print_one_catch_assert;
14445 ops->print_mention = print_mention_catch_assert;
14446 ops->print_recreate = print_recreate_catch_assert;
9f757bf7
XR
14447
14448 ops = &catch_handlers_breakpoint_ops;
14449 *ops = bkpt_breakpoint_ops;
14450 ops->allocate_location = allocate_location_catch_handlers;
14451 ops->re_set = re_set_catch_handlers;
14452 ops->check_status = check_status_catch_handlers;
14453 ops->print_it = print_it_catch_handlers;
14454 ops->print_one = print_one_catch_handlers;
14455 ops->print_mention = print_mention_catch_handlers;
14456 ops->print_recreate = print_recreate_catch_handlers;
2060206e
PA
14457}
14458
3d9434b5
JB
14459/* This module's 'new_objfile' observer. */
14460
14461static void
14462ada_new_objfile_observer (struct objfile *objfile)
14463{
14464 ada_clear_symbol_cache ();
14465}
14466
14467/* This module's 'free_objfile' observer. */
14468
14469static void
14470ada_free_objfile_observer (struct objfile *objfile)
14471{
14472 ada_clear_symbol_cache ();
14473}
14474
d2e4a39e 14475void
6c038f32 14476_initialize_ada_language (void)
14f9c5c9 14477{
2060206e
PA
14478 initialize_ada_catchpoint_ops ();
14479
5bf03f13 14480 add_prefix_cmd ("ada", no_class, set_ada_command,
470678d7 14481 _("Prefix command for changing Ada-specific settings"),
5bf03f13
JB
14482 &set_ada_list, "set ada ", 0, &setlist);
14483
14484 add_prefix_cmd ("ada", no_class, show_ada_command,
14485 _("Generic command for showing Ada-specific settings."),
14486 &show_ada_list, "show ada ", 0, &showlist);
14487
14488 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure,
14489 &trust_pad_over_xvs, _("\
14490Enable or disable an optimization trusting PAD types over XVS types"), _("\
14491Show whether an optimization trusting PAD types over XVS types is activated"),
14492 _("\
14493This is related to the encoding used by the GNAT compiler. The debugger\n\
14494should normally trust the contents of PAD types, but certain older versions\n\
14495of GNAT have a bug that sometimes causes the information in the PAD type\n\
14496to be incorrect. Turning this setting \"off\" allows the debugger to\n\
14497work around this bug. It is always safe to turn this option \"off\", but\n\
14498this incurs a slight performance penalty, so it is recommended to NOT change\n\
14499this option to \"off\" unless necessary."),
14500 NULL, NULL, &set_ada_list, &show_ada_list);
14501
d72413e6
PMR
14502 add_setshow_boolean_cmd ("print-signatures", class_vars,
14503 &print_signatures, _("\
14504Enable or disable the output of formal and return types for functions in the \
14505overloads selection menu"), _("\
14506Show whether the output of formal and return types for functions in the \
14507overloads selection menu is activated"),
14508 NULL, NULL, NULL, &set_ada_list, &show_ada_list);
14509
9ac4176b
PA
14510 add_catch_command ("exception", _("\
14511Catch Ada exceptions, when raised.\n\
60a90376
JB
14512Usage: catch exception [ ARG ]\n\
14513\n\
14514Without any argument, stop when any Ada exception is raised.\n\
14515If ARG is \"unhandled\" (without the quotes), only stop when the exception\n\
14516being raised does not have a handler (and will therefore lead to the task's\n\
14517termination).\n\
14518Otherwise, the catchpoint only stops when the name of the exception being\n\
14519raised is the same as ARG."),
9ac4176b
PA
14520 catch_ada_exception_command,
14521 NULL,
14522 CATCH_PERMANENT,
14523 CATCH_TEMPORARY);
9f757bf7
XR
14524
14525 add_catch_command ("handlers", _("\
14526Catch Ada exceptions, when handled.\n\
14527With an argument, catch only exceptions with the given name."),
14528 catch_ada_handlers_command,
14529 NULL,
14530 CATCH_PERMANENT,
14531 CATCH_TEMPORARY);
9ac4176b
PA
14532 add_catch_command ("assert", _("\
14533Catch failed Ada assertions, when raised.\n\
14534With an argument, catch only exceptions with the given name."),
14535 catch_assert_command,
14536 NULL,
14537 CATCH_PERMANENT,
14538 CATCH_TEMPORARY);
14539
6c038f32 14540 varsize_limit = 65536;
3fcded8f
JB
14541 add_setshow_uinteger_cmd ("varsize-limit", class_support,
14542 &varsize_limit, _("\
14543Set the maximum number of bytes allowed in a variable-size object."), _("\
14544Show the maximum number of bytes allowed in a variable-size object."), _("\
14545Attempts to access an object whose size is not a compile-time constant\n\
14546and exceeds this limit will cause an error."),
14547 NULL, NULL, &setlist, &showlist);
6c038f32 14548
778865d3
JB
14549 add_info ("exceptions", info_exceptions_command,
14550 _("\
14551List all Ada exception names.\n\
14552If a regular expression is passed as an argument, only those matching\n\
14553the regular expression are listed."));
14554
c6044dd1
JB
14555 add_prefix_cmd ("ada", class_maintenance, maint_set_ada_cmd,
14556 _("Set Ada maintenance-related variables."),
14557 &maint_set_ada_cmdlist, "maintenance set ada ",
14558 0/*allow-unknown*/, &maintenance_set_cmdlist);
14559
14560 add_prefix_cmd ("ada", class_maintenance, maint_show_ada_cmd,
14561 _("Show Ada maintenance-related variables"),
14562 &maint_show_ada_cmdlist, "maintenance show ada ",
14563 0/*allow-unknown*/, &maintenance_show_cmdlist);
14564
14565 add_setshow_boolean_cmd
14566 ("ignore-descriptive-types", class_maintenance,
14567 &ada_ignore_descriptive_types_p,
14568 _("Set whether descriptive types generated by GNAT should be ignored."),
14569 _("Show whether descriptive types generated by GNAT should be ignored."),
14570 _("\
14571When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\
14572DWARF attribute."),
14573 NULL, NULL, &maint_set_ada_cmdlist, &maint_show_ada_cmdlist);
14574
459a2e4c
TT
14575 decoded_names_store = htab_create_alloc (256, htab_hash_string, streq_hash,
14576 NULL, xcalloc, xfree);
6b69afc4 14577
3d9434b5 14578 /* The ada-lang observers. */
76727919
TT
14579 gdb::observers::new_objfile.attach (ada_new_objfile_observer);
14580 gdb::observers::free_objfile.attach (ada_free_objfile_observer);
14581 gdb::observers::inferior_exit.attach (ada_inferior_exit);
ee01b665
JB
14582
14583 /* Setup various context-specific data. */
e802dbe0 14584 ada_inferior_data
8e260fc0 14585 = register_inferior_data_with_cleanup (NULL, ada_inferior_data_cleanup);
ee01b665
JB
14586 ada_pspace_data_handle
14587 = register_program_space_data_with_cleanup (NULL, ada_pspace_data_cleanup);
14f9c5c9 14588}