]> git.ipfire.org Git - thirdparty/binutils-gdb.git/blame - gdb/ada-lang.c
2008-01-04 H.J. Lu <hongjiu.lu@intel.com>
[thirdparty/binutils-gdb.git] / gdb / ada-lang.c
CommitLineData
197e01b6 1/* Ada language support routines for GDB, the GNU debugger. Copyright (C)
10a2c479 2
f7f9143b
JB
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007
4 Free Software Foundation, Inc.
14f9c5c9 5
a9762ec7 6 This file is part of GDB.
14f9c5c9 7
a9762ec7
JB
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
14f9c5c9 12
a9762ec7
JB
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
14f9c5c9 17
a9762ec7
JB
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
14f9c5c9 20
96d887e8 21
4c4b4cd2 22#include "defs.h"
14f9c5c9 23#include <stdio.h>
0c30c098 24#include "gdb_string.h"
14f9c5c9
AS
25#include <ctype.h>
26#include <stdarg.h>
27#include "demangle.h"
4c4b4cd2
PH
28#include "gdb_regex.h"
29#include "frame.h"
14f9c5c9
AS
30#include "symtab.h"
31#include "gdbtypes.h"
32#include "gdbcmd.h"
33#include "expression.h"
34#include "parser-defs.h"
35#include "language.h"
36#include "c-lang.h"
37#include "inferior.h"
38#include "symfile.h"
39#include "objfiles.h"
40#include "breakpoint.h"
41#include "gdbcore.h"
4c4b4cd2
PH
42#include "hashtab.h"
43#include "gdb_obstack.h"
14f9c5c9 44#include "ada-lang.h"
4c4b4cd2
PH
45#include "completer.h"
46#include "gdb_stat.h"
47#ifdef UI_OUT
14f9c5c9 48#include "ui-out.h"
4c4b4cd2 49#endif
fe898f56 50#include "block.h"
04714b91 51#include "infcall.h"
de4f826b 52#include "dictionary.h"
60250e8b 53#include "exceptions.h"
f7f9143b
JB
54#include "annotate.h"
55#include "valprint.h"
9bbc9174 56#include "source.h"
0259addd 57#include "observer.h"
14f9c5c9 58
4c4b4cd2
PH
59#ifndef ADA_RETAIN_DOTS
60#define ADA_RETAIN_DOTS 0
61#endif
62
63/* Define whether or not the C operator '/' truncates towards zero for
64 differently signed operands (truncation direction is undefined in C).
65 Copied from valarith.c. */
66
67#ifndef TRUNCATION_TOWARDS_ZERO
68#define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
69#endif
70
4c4b4cd2 71
4c4b4cd2 72static void extract_string (CORE_ADDR addr, char *buf);
14f9c5c9 73
14f9c5c9
AS
74static void modify_general_field (char *, LONGEST, int, int);
75
d2e4a39e 76static struct type *desc_base_type (struct type *);
14f9c5c9 77
d2e4a39e 78static struct type *desc_bounds_type (struct type *);
14f9c5c9 79
d2e4a39e 80static struct value *desc_bounds (struct value *);
14f9c5c9 81
d2e4a39e 82static int fat_pntr_bounds_bitpos (struct type *);
14f9c5c9 83
d2e4a39e 84static int fat_pntr_bounds_bitsize (struct type *);
14f9c5c9 85
d2e4a39e 86static struct type *desc_data_type (struct type *);
14f9c5c9 87
d2e4a39e 88static struct value *desc_data (struct value *);
14f9c5c9 89
d2e4a39e 90static int fat_pntr_data_bitpos (struct type *);
14f9c5c9 91
d2e4a39e 92static int fat_pntr_data_bitsize (struct type *);
14f9c5c9 93
d2e4a39e 94static struct value *desc_one_bound (struct value *, int, int);
14f9c5c9 95
d2e4a39e 96static int desc_bound_bitpos (struct type *, int, int);
14f9c5c9 97
d2e4a39e 98static int desc_bound_bitsize (struct type *, int, int);
14f9c5c9 99
d2e4a39e 100static struct type *desc_index_type (struct type *, int);
14f9c5c9 101
d2e4a39e 102static int desc_arity (struct type *);
14f9c5c9 103
d2e4a39e 104static int ada_type_match (struct type *, struct type *, int);
14f9c5c9 105
d2e4a39e 106static int ada_args_match (struct symbol *, struct value **, int);
14f9c5c9 107
4c4b4cd2 108static struct value *ensure_lval (struct value *, CORE_ADDR *);
14f9c5c9 109
d2e4a39e 110static struct value *convert_actual (struct value *, struct type *,
4c4b4cd2 111 CORE_ADDR *);
14f9c5c9 112
d2e4a39e 113static struct value *make_array_descriptor (struct type *, struct value *,
4c4b4cd2 114 CORE_ADDR *);
14f9c5c9 115
4c4b4cd2 116static void ada_add_block_symbols (struct obstack *,
76a01679 117 struct block *, const char *,
4c4b4cd2 118 domain_enum, struct objfile *,
76a01679 119 struct symtab *, int);
14f9c5c9 120
4c4b4cd2 121static int is_nonfunction (struct ada_symbol_info *, int);
14f9c5c9 122
76a01679
JB
123static void add_defn_to_vec (struct obstack *, struct symbol *,
124 struct block *, struct symtab *);
14f9c5c9 125
4c4b4cd2
PH
126static int num_defns_collected (struct obstack *);
127
128static struct ada_symbol_info *defns_collected (struct obstack *, int);
14f9c5c9 129
d2e4a39e 130static struct partial_symbol *ada_lookup_partial_symbol (struct partial_symtab
76a01679
JB
131 *, const char *, int,
132 domain_enum, int);
14f9c5c9 133
d2e4a39e 134static struct symtab *symtab_for_sym (struct symbol *);
14f9c5c9 135
4c4b4cd2 136static struct value *resolve_subexp (struct expression **, int *, int,
76a01679 137 struct type *);
14f9c5c9 138
d2e4a39e 139static void replace_operator_with_call (struct expression **, int, int, int,
4c4b4cd2 140 struct symbol *, struct block *);
14f9c5c9 141
d2e4a39e 142static int possible_user_operator_p (enum exp_opcode, struct value **);
14f9c5c9 143
4c4b4cd2
PH
144static char *ada_op_name (enum exp_opcode);
145
146static const char *ada_decoded_op_name (enum exp_opcode);
14f9c5c9 147
d2e4a39e 148static int numeric_type_p (struct type *);
14f9c5c9 149
d2e4a39e 150static int integer_type_p (struct type *);
14f9c5c9 151
d2e4a39e 152static int scalar_type_p (struct type *);
14f9c5c9 153
d2e4a39e 154static int discrete_type_p (struct type *);
14f9c5c9 155
aeb5907d
JB
156static enum ada_renaming_category parse_old_style_renaming (struct type *,
157 const char **,
158 int *,
159 const char **);
160
161static struct symbol *find_old_style_renaming_symbol (const char *,
162 struct block *);
163
4c4b4cd2 164static struct type *ada_lookup_struct_elt_type (struct type *, char *,
76a01679 165 int, int, int *);
4c4b4cd2 166
d2e4a39e 167static struct value *evaluate_subexp (struct type *, struct expression *,
4c4b4cd2 168 int *, enum noside);
14f9c5c9 169
d2e4a39e 170static struct value *evaluate_subexp_type (struct expression *, int *);
14f9c5c9 171
d2e4a39e 172static int is_dynamic_field (struct type *, int);
14f9c5c9 173
10a2c479 174static struct type *to_fixed_variant_branch_type (struct type *,
fc1a4b47 175 const gdb_byte *,
4c4b4cd2
PH
176 CORE_ADDR, struct value *);
177
178static struct type *to_fixed_array_type (struct type *, struct value *, int);
14f9c5c9 179
d2e4a39e 180static struct type *to_fixed_range_type (char *, struct value *,
4c4b4cd2 181 struct objfile *);
14f9c5c9 182
d2e4a39e 183static struct type *to_static_fixed_type (struct type *);
f192137b 184static struct type *static_unwrap_type (struct type *type);
14f9c5c9 185
d2e4a39e 186static struct value *unwrap_value (struct value *);
14f9c5c9 187
d2e4a39e 188static struct type *packed_array_type (struct type *, long *);
14f9c5c9 189
d2e4a39e 190static struct type *decode_packed_array_type (struct type *);
14f9c5c9 191
d2e4a39e 192static struct value *decode_packed_array (struct value *);
14f9c5c9 193
d2e4a39e 194static struct value *value_subscript_packed (struct value *, int,
4c4b4cd2 195 struct value **);
14f9c5c9 196
52ce6436
PH
197static void move_bits (gdb_byte *, int, const gdb_byte *, int, int);
198
4c4b4cd2
PH
199static struct value *coerce_unspec_val_to_type (struct value *,
200 struct type *);
14f9c5c9 201
d2e4a39e 202static struct value *get_var_value (char *, char *);
14f9c5c9 203
d2e4a39e 204static int lesseq_defined_than (struct symbol *, struct symbol *);
14f9c5c9 205
d2e4a39e 206static int equiv_types (struct type *, struct type *);
14f9c5c9 207
d2e4a39e 208static int is_name_suffix (const char *);
14f9c5c9 209
d2e4a39e 210static int wild_match (const char *, int, const char *);
14f9c5c9 211
d2e4a39e 212static struct value *ada_coerce_ref (struct value *);
14f9c5c9 213
4c4b4cd2
PH
214static LONGEST pos_atr (struct value *);
215
d2e4a39e 216static struct value *value_pos_atr (struct value *);
14f9c5c9 217
d2e4a39e 218static struct value *value_val_atr (struct type *, struct value *);
14f9c5c9 219
4c4b4cd2
PH
220static struct symbol *standard_lookup (const char *, const struct block *,
221 domain_enum);
14f9c5c9 222
4c4b4cd2
PH
223static struct value *ada_search_struct_field (char *, struct value *, int,
224 struct type *);
225
226static struct value *ada_value_primitive_field (struct value *, int, int,
227 struct type *);
228
76a01679 229static int find_struct_field (char *, struct type *, int,
52ce6436 230 struct type **, int *, int *, int *, int *);
4c4b4cd2
PH
231
232static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR,
233 struct value *);
234
235static struct value *ada_to_fixed_value (struct value *);
14f9c5c9 236
4c4b4cd2
PH
237static int ada_resolve_function (struct ada_symbol_info *, int,
238 struct value **, int, const char *,
239 struct type *);
240
241static struct value *ada_coerce_to_simple_array (struct value *);
242
243static int ada_is_direct_array_type (struct type *);
244
72d5681a
PH
245static void ada_language_arch_info (struct gdbarch *,
246 struct language_arch_info *);
714e53ab
PH
247
248static void check_size (const struct type *);
52ce6436
PH
249
250static struct value *ada_index_struct_field (int, struct value *, int,
251 struct type *);
252
253static struct value *assign_aggregate (struct value *, struct value *,
254 struct expression *, int *, enum noside);
255
256static void aggregate_assign_from_choices (struct value *, struct value *,
257 struct expression *,
258 int *, LONGEST *, int *,
259 int, LONGEST, LONGEST);
260
261static void aggregate_assign_positional (struct value *, struct value *,
262 struct expression *,
263 int *, LONGEST *, int *, int,
264 LONGEST, LONGEST);
265
266
267static void aggregate_assign_others (struct value *, struct value *,
268 struct expression *,
269 int *, LONGEST *, int, LONGEST, LONGEST);
270
271
272static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int);
273
274
275static struct value *ada_evaluate_subexp (struct type *, struct expression *,
276 int *, enum noside);
277
278static void ada_forward_operator_length (struct expression *, int, int *,
279 int *);
4c4b4cd2
PH
280\f
281
76a01679 282
4c4b4cd2 283/* Maximum-sized dynamic type. */
14f9c5c9
AS
284static unsigned int varsize_limit;
285
4c4b4cd2
PH
286/* FIXME: brobecker/2003-09-17: No longer a const because it is
287 returned by a function that does not return a const char *. */
288static char *ada_completer_word_break_characters =
289#ifdef VMS
290 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
291#else
14f9c5c9 292 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
4c4b4cd2 293#endif
14f9c5c9 294
4c4b4cd2 295/* The name of the symbol to use to get the name of the main subprogram. */
76a01679 296static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
4c4b4cd2 297 = "__gnat_ada_main_program_name";
14f9c5c9 298
4c4b4cd2
PH
299/* Limit on the number of warnings to raise per expression evaluation. */
300static int warning_limit = 2;
301
302/* Number of warning messages issued; reset to 0 by cleanups after
303 expression evaluation. */
304static int warnings_issued = 0;
305
306static const char *known_runtime_file_name_patterns[] = {
307 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
308};
309
310static const char *known_auxiliary_function_name_patterns[] = {
311 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
312};
313
314/* Space for allocating results of ada_lookup_symbol_list. */
315static struct obstack symbol_list_obstack;
316
317 /* Utilities */
318
96d887e8 319
4c4b4cd2
PH
320static char *
321ada_get_gdb_completer_word_break_characters (void)
322{
323 return ada_completer_word_break_characters;
324}
325
e79af960
JB
326/* Print an array element index using the Ada syntax. */
327
328static void
329ada_print_array_index (struct value *index_value, struct ui_file *stream,
330 int format, enum val_prettyprint pretty)
331{
332 LA_VALUE_PRINT (index_value, stream, format, pretty);
333 fprintf_filtered (stream, " => ");
334}
335
4c4b4cd2
PH
336/* Read the string located at ADDR from the inferior and store the
337 result into BUF. */
338
339static void
14f9c5c9
AS
340extract_string (CORE_ADDR addr, char *buf)
341{
d2e4a39e 342 int char_index = 0;
14f9c5c9 343
4c4b4cd2
PH
344 /* Loop, reading one byte at a time, until we reach the '\000'
345 end-of-string marker. */
d2e4a39e
AS
346 do
347 {
348 target_read_memory (addr + char_index * sizeof (char),
4c4b4cd2 349 buf + char_index * sizeof (char), sizeof (char));
d2e4a39e
AS
350 char_index++;
351 }
352 while (buf[char_index - 1] != '\000');
14f9c5c9
AS
353}
354
f27cf670 355/* Assuming VECT points to an array of *SIZE objects of size
14f9c5c9 356 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
f27cf670 357 updating *SIZE as necessary and returning the (new) array. */
14f9c5c9 358
f27cf670
AS
359void *
360grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
14f9c5c9 361{
d2e4a39e
AS
362 if (*size < min_size)
363 {
364 *size *= 2;
365 if (*size < min_size)
4c4b4cd2 366 *size = min_size;
f27cf670 367 vect = xrealloc (vect, *size * element_size);
d2e4a39e 368 }
f27cf670 369 return vect;
14f9c5c9
AS
370}
371
372/* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
4c4b4cd2 373 suffix of FIELD_NAME beginning "___". */
14f9c5c9
AS
374
375static int
ebf56fd3 376field_name_match (const char *field_name, const char *target)
14f9c5c9
AS
377{
378 int len = strlen (target);
d2e4a39e 379 return
4c4b4cd2
PH
380 (strncmp (field_name, target, len) == 0
381 && (field_name[len] == '\0'
382 || (strncmp (field_name + len, "___", 3) == 0
76a01679
JB
383 && strcmp (field_name + strlen (field_name) - 6,
384 "___XVN") != 0)));
14f9c5c9
AS
385}
386
387
4c4b4cd2
PH
388/* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
389 FIELD_NAME, and return its index. This function also handles fields
390 whose name have ___ suffixes because the compiler sometimes alters
391 their name by adding such a suffix to represent fields with certain
392 constraints. If the field could not be found, return a negative
393 number if MAYBE_MISSING is set. Otherwise raise an error. */
394
395int
396ada_get_field_index (const struct type *type, const char *field_name,
397 int maybe_missing)
398{
399 int fieldno;
400 for (fieldno = 0; fieldno < TYPE_NFIELDS (type); fieldno++)
401 if (field_name_match (TYPE_FIELD_NAME (type, fieldno), field_name))
402 return fieldno;
403
404 if (!maybe_missing)
323e0a4a 405 error (_("Unable to find field %s in struct %s. Aborting"),
4c4b4cd2
PH
406 field_name, TYPE_NAME (type));
407
408 return -1;
409}
410
411/* The length of the prefix of NAME prior to any "___" suffix. */
14f9c5c9
AS
412
413int
d2e4a39e 414ada_name_prefix_len (const char *name)
14f9c5c9
AS
415{
416 if (name == NULL)
417 return 0;
d2e4a39e 418 else
14f9c5c9 419 {
d2e4a39e 420 const char *p = strstr (name, "___");
14f9c5c9 421 if (p == NULL)
4c4b4cd2 422 return strlen (name);
14f9c5c9 423 else
4c4b4cd2 424 return p - name;
14f9c5c9
AS
425 }
426}
427
4c4b4cd2
PH
428/* Return non-zero if SUFFIX is a suffix of STR.
429 Return zero if STR is null. */
430
14f9c5c9 431static int
d2e4a39e 432is_suffix (const char *str, const char *suffix)
14f9c5c9
AS
433{
434 int len1, len2;
435 if (str == NULL)
436 return 0;
437 len1 = strlen (str);
438 len2 = strlen (suffix);
4c4b4cd2 439 return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
14f9c5c9
AS
440}
441
442/* Create a value of type TYPE whose contents come from VALADDR, if it
4c4b4cd2
PH
443 is non-null, and whose memory address (in the inferior) is
444 ADDRESS. */
445
d2e4a39e 446struct value *
10a2c479 447value_from_contents_and_address (struct type *type,
fc1a4b47 448 const gdb_byte *valaddr,
4c4b4cd2 449 CORE_ADDR address)
14f9c5c9 450{
d2e4a39e
AS
451 struct value *v = allocate_value (type);
452 if (valaddr == NULL)
dfa52d88 453 set_value_lazy (v, 1);
14f9c5c9 454 else
990a07ab 455 memcpy (value_contents_raw (v), valaddr, TYPE_LENGTH (type));
14f9c5c9
AS
456 VALUE_ADDRESS (v) = address;
457 if (address != 0)
458 VALUE_LVAL (v) = lval_memory;
459 return v;
460}
461
4c4b4cd2
PH
462/* The contents of value VAL, treated as a value of type TYPE. The
463 result is an lval in memory if VAL is. */
14f9c5c9 464
d2e4a39e 465static struct value *
4c4b4cd2 466coerce_unspec_val_to_type (struct value *val, struct type *type)
14f9c5c9 467{
61ee279c 468 type = ada_check_typedef (type);
df407dfe 469 if (value_type (val) == type)
4c4b4cd2 470 return val;
d2e4a39e 471 else
14f9c5c9 472 {
4c4b4cd2
PH
473 struct value *result;
474
475 /* Make sure that the object size is not unreasonable before
476 trying to allocate some memory for it. */
714e53ab 477 check_size (type);
4c4b4cd2
PH
478
479 result = allocate_value (type);
480 VALUE_LVAL (result) = VALUE_LVAL (val);
9bbda503
AC
481 set_value_bitsize (result, value_bitsize (val));
482 set_value_bitpos (result, value_bitpos (val));
df407dfe 483 VALUE_ADDRESS (result) = VALUE_ADDRESS (val) + value_offset (val);
d69fe07e 484 if (value_lazy (val)
df407dfe 485 || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
dfa52d88 486 set_value_lazy (result, 1);
d2e4a39e 487 else
0fd88904 488 memcpy (value_contents_raw (result), value_contents (val),
4c4b4cd2 489 TYPE_LENGTH (type));
14f9c5c9
AS
490 return result;
491 }
492}
493
fc1a4b47
AC
494static const gdb_byte *
495cond_offset_host (const gdb_byte *valaddr, long offset)
14f9c5c9
AS
496{
497 if (valaddr == NULL)
498 return NULL;
499 else
500 return valaddr + offset;
501}
502
503static CORE_ADDR
ebf56fd3 504cond_offset_target (CORE_ADDR address, long offset)
14f9c5c9
AS
505{
506 if (address == 0)
507 return 0;
d2e4a39e 508 else
14f9c5c9
AS
509 return address + offset;
510}
511
4c4b4cd2
PH
512/* Issue a warning (as for the definition of warning in utils.c, but
513 with exactly one argument rather than ...), unless the limit on the
514 number of warnings has passed during the evaluation of the current
515 expression. */
a2249542 516
77109804
AC
517/* FIXME: cagney/2004-10-10: This function is mimicking the behavior
518 provided by "complaint". */
519static void lim_warning (const char *format, ...) ATTR_FORMAT (printf, 1, 2);
520
14f9c5c9 521static void
a2249542 522lim_warning (const char *format, ...)
14f9c5c9 523{
a2249542
MK
524 va_list args;
525 va_start (args, format);
526
4c4b4cd2
PH
527 warnings_issued += 1;
528 if (warnings_issued <= warning_limit)
a2249542
MK
529 vwarning (format, args);
530
531 va_end (args);
4c4b4cd2
PH
532}
533
714e53ab
PH
534/* Issue an error if the size of an object of type T is unreasonable,
535 i.e. if it would be a bad idea to allocate a value of this type in
536 GDB. */
537
538static void
539check_size (const struct type *type)
540{
541 if (TYPE_LENGTH (type) > varsize_limit)
323e0a4a 542 error (_("object size is larger than varsize-limit"));
714e53ab
PH
543}
544
545
c3e5cd34
PH
546/* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
547 gdbtypes.h, but some of the necessary definitions in that file
548 seem to have gone missing. */
549
550/* Maximum value of a SIZE-byte signed integer type. */
4c4b4cd2 551static LONGEST
c3e5cd34 552max_of_size (int size)
4c4b4cd2 553{
76a01679
JB
554 LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
555 return top_bit | (top_bit - 1);
4c4b4cd2
PH
556}
557
c3e5cd34 558/* Minimum value of a SIZE-byte signed integer type. */
4c4b4cd2 559static LONGEST
c3e5cd34 560min_of_size (int size)
4c4b4cd2 561{
c3e5cd34 562 return -max_of_size (size) - 1;
4c4b4cd2
PH
563}
564
c3e5cd34 565/* Maximum value of a SIZE-byte unsigned integer type. */
4c4b4cd2 566static ULONGEST
c3e5cd34 567umax_of_size (int size)
4c4b4cd2 568{
76a01679
JB
569 ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
570 return top_bit | (top_bit - 1);
4c4b4cd2
PH
571}
572
c3e5cd34
PH
573/* Maximum value of integral type T, as a signed quantity. */
574static LONGEST
575max_of_type (struct type *t)
4c4b4cd2 576{
c3e5cd34
PH
577 if (TYPE_UNSIGNED (t))
578 return (LONGEST) umax_of_size (TYPE_LENGTH (t));
579 else
580 return max_of_size (TYPE_LENGTH (t));
581}
582
583/* Minimum value of integral type T, as a signed quantity. */
584static LONGEST
585min_of_type (struct type *t)
586{
587 if (TYPE_UNSIGNED (t))
588 return 0;
589 else
590 return min_of_size (TYPE_LENGTH (t));
4c4b4cd2
PH
591}
592
593/* The largest value in the domain of TYPE, a discrete type, as an integer. */
594static struct value *
595discrete_type_high_bound (struct type *type)
596{
76a01679 597 switch (TYPE_CODE (type))
4c4b4cd2
PH
598 {
599 case TYPE_CODE_RANGE:
600 return value_from_longest (TYPE_TARGET_TYPE (type),
76a01679 601 TYPE_HIGH_BOUND (type));
4c4b4cd2 602 case TYPE_CODE_ENUM:
76a01679
JB
603 return
604 value_from_longest (type,
605 TYPE_FIELD_BITPOS (type,
606 TYPE_NFIELDS (type) - 1));
607 case TYPE_CODE_INT:
c3e5cd34 608 return value_from_longest (type, max_of_type (type));
4c4b4cd2 609 default:
323e0a4a 610 error (_("Unexpected type in discrete_type_high_bound."));
4c4b4cd2
PH
611 }
612}
613
614/* The largest value in the domain of TYPE, a discrete type, as an integer. */
615static struct value *
616discrete_type_low_bound (struct type *type)
617{
76a01679 618 switch (TYPE_CODE (type))
4c4b4cd2
PH
619 {
620 case TYPE_CODE_RANGE:
621 return value_from_longest (TYPE_TARGET_TYPE (type),
76a01679 622 TYPE_LOW_BOUND (type));
4c4b4cd2 623 case TYPE_CODE_ENUM:
76a01679
JB
624 return value_from_longest (type, TYPE_FIELD_BITPOS (type, 0));
625 case TYPE_CODE_INT:
c3e5cd34 626 return value_from_longest (type, min_of_type (type));
4c4b4cd2 627 default:
323e0a4a 628 error (_("Unexpected type in discrete_type_low_bound."));
4c4b4cd2
PH
629 }
630}
631
632/* The identity on non-range types. For range types, the underlying
76a01679 633 non-range scalar type. */
4c4b4cd2
PH
634
635static struct type *
636base_type (struct type *type)
637{
638 while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
639 {
76a01679
JB
640 if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
641 return type;
4c4b4cd2
PH
642 type = TYPE_TARGET_TYPE (type);
643 }
644 return type;
14f9c5c9 645}
4c4b4cd2 646\f
76a01679 647
4c4b4cd2 648 /* Language Selection */
14f9c5c9
AS
649
650/* If the main program is in Ada, return language_ada, otherwise return LANG
651 (the main program is in Ada iif the adainit symbol is found).
652
4c4b4cd2 653 MAIN_PST is not used. */
d2e4a39e 654
14f9c5c9 655enum language
d2e4a39e 656ada_update_initial_language (enum language lang,
4c4b4cd2 657 struct partial_symtab *main_pst)
14f9c5c9 658{
d2e4a39e 659 if (lookup_minimal_symbol ("adainit", (const char *) NULL,
4c4b4cd2
PH
660 (struct objfile *) NULL) != NULL)
661 return language_ada;
14f9c5c9
AS
662
663 return lang;
664}
96d887e8
PH
665
666/* If the main procedure is written in Ada, then return its name.
667 The result is good until the next call. Return NULL if the main
668 procedure doesn't appear to be in Ada. */
669
670char *
671ada_main_name (void)
672{
673 struct minimal_symbol *msym;
674 CORE_ADDR main_program_name_addr;
675 static char main_program_name[1024];
6c038f32 676
96d887e8
PH
677 /* For Ada, the name of the main procedure is stored in a specific
678 string constant, generated by the binder. Look for that symbol,
679 extract its address, and then read that string. If we didn't find
680 that string, then most probably the main procedure is not written
681 in Ada. */
682 msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
683
684 if (msym != NULL)
685 {
686 main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
687 if (main_program_name_addr == 0)
323e0a4a 688 error (_("Invalid address for Ada main program name."));
96d887e8
PH
689
690 extract_string (main_program_name_addr, main_program_name);
691 return main_program_name;
692 }
693
694 /* The main procedure doesn't seem to be in Ada. */
695 return NULL;
696}
14f9c5c9 697\f
4c4b4cd2 698 /* Symbols */
d2e4a39e 699
4c4b4cd2
PH
700/* Table of Ada operators and their GNAT-encoded names. Last entry is pair
701 of NULLs. */
14f9c5c9 702
d2e4a39e
AS
703const struct ada_opname_map ada_opname_table[] = {
704 {"Oadd", "\"+\"", BINOP_ADD},
705 {"Osubtract", "\"-\"", BINOP_SUB},
706 {"Omultiply", "\"*\"", BINOP_MUL},
707 {"Odivide", "\"/\"", BINOP_DIV},
708 {"Omod", "\"mod\"", BINOP_MOD},
709 {"Orem", "\"rem\"", BINOP_REM},
710 {"Oexpon", "\"**\"", BINOP_EXP},
711 {"Olt", "\"<\"", BINOP_LESS},
712 {"Ole", "\"<=\"", BINOP_LEQ},
713 {"Ogt", "\">\"", BINOP_GTR},
714 {"Oge", "\">=\"", BINOP_GEQ},
715 {"Oeq", "\"=\"", BINOP_EQUAL},
716 {"One", "\"/=\"", BINOP_NOTEQUAL},
717 {"Oand", "\"and\"", BINOP_BITWISE_AND},
718 {"Oor", "\"or\"", BINOP_BITWISE_IOR},
719 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
720 {"Oconcat", "\"&\"", BINOP_CONCAT},
721 {"Oabs", "\"abs\"", UNOP_ABS},
722 {"Onot", "\"not\"", UNOP_LOGICAL_NOT},
723 {"Oadd", "\"+\"", UNOP_PLUS},
724 {"Osubtract", "\"-\"", UNOP_NEG},
725 {NULL, NULL}
14f9c5c9
AS
726};
727
4c4b4cd2
PH
728/* Return non-zero if STR should be suppressed in info listings. */
729
14f9c5c9 730static int
d2e4a39e 731is_suppressed_name (const char *str)
14f9c5c9 732{
4c4b4cd2 733 if (strncmp (str, "_ada_", 5) == 0)
14f9c5c9
AS
734 str += 5;
735 if (str[0] == '_' || str[0] == '\000')
736 return 1;
737 else
738 {
d2e4a39e
AS
739 const char *p;
740 const char *suffix = strstr (str, "___");
14f9c5c9 741 if (suffix != NULL && suffix[3] != 'X')
4c4b4cd2 742 return 1;
14f9c5c9 743 if (suffix == NULL)
4c4b4cd2 744 suffix = str + strlen (str);
d2e4a39e 745 for (p = suffix - 1; p != str; p -= 1)
4c4b4cd2
PH
746 if (isupper (*p))
747 {
748 int i;
749 if (p[0] == 'X' && p[-1] != '_')
750 goto OK;
751 if (*p != 'O')
752 return 1;
753 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
754 if (strncmp (ada_opname_table[i].encoded, p,
755 strlen (ada_opname_table[i].encoded)) == 0)
756 goto OK;
757 return 1;
758 OK:;
759 }
14f9c5c9
AS
760 return 0;
761 }
762}
763
4c4b4cd2
PH
764/* The "encoded" form of DECODED, according to GNAT conventions.
765 The result is valid until the next call to ada_encode. */
766
14f9c5c9 767char *
4c4b4cd2 768ada_encode (const char *decoded)
14f9c5c9 769{
4c4b4cd2
PH
770 static char *encoding_buffer = NULL;
771 static size_t encoding_buffer_size = 0;
d2e4a39e 772 const char *p;
14f9c5c9 773 int k;
d2e4a39e 774
4c4b4cd2 775 if (decoded == NULL)
14f9c5c9
AS
776 return NULL;
777
4c4b4cd2
PH
778 GROW_VECT (encoding_buffer, encoding_buffer_size,
779 2 * strlen (decoded) + 10);
14f9c5c9
AS
780
781 k = 0;
4c4b4cd2 782 for (p = decoded; *p != '\0'; p += 1)
14f9c5c9 783 {
4c4b4cd2
PH
784 if (!ADA_RETAIN_DOTS && *p == '.')
785 {
786 encoding_buffer[k] = encoding_buffer[k + 1] = '_';
787 k += 2;
788 }
14f9c5c9 789 else if (*p == '"')
4c4b4cd2
PH
790 {
791 const struct ada_opname_map *mapping;
792
793 for (mapping = ada_opname_table;
1265e4aa
JB
794 mapping->encoded != NULL
795 && strncmp (mapping->decoded, p,
796 strlen (mapping->decoded)) != 0; mapping += 1)
4c4b4cd2
PH
797 ;
798 if (mapping->encoded == NULL)
323e0a4a 799 error (_("invalid Ada operator name: %s"), p);
4c4b4cd2
PH
800 strcpy (encoding_buffer + k, mapping->encoded);
801 k += strlen (mapping->encoded);
802 break;
803 }
d2e4a39e 804 else
4c4b4cd2
PH
805 {
806 encoding_buffer[k] = *p;
807 k += 1;
808 }
14f9c5c9
AS
809 }
810
4c4b4cd2
PH
811 encoding_buffer[k] = '\0';
812 return encoding_buffer;
14f9c5c9
AS
813}
814
815/* Return NAME folded to lower case, or, if surrounded by single
4c4b4cd2
PH
816 quotes, unfolded, but with the quotes stripped away. Result good
817 to next call. */
818
d2e4a39e
AS
819char *
820ada_fold_name (const char *name)
14f9c5c9 821{
d2e4a39e 822 static char *fold_buffer = NULL;
14f9c5c9
AS
823 static size_t fold_buffer_size = 0;
824
825 int len = strlen (name);
d2e4a39e 826 GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
14f9c5c9
AS
827
828 if (name[0] == '\'')
829 {
d2e4a39e
AS
830 strncpy (fold_buffer, name + 1, len - 2);
831 fold_buffer[len - 2] = '\000';
14f9c5c9
AS
832 }
833 else
834 {
835 int i;
836 for (i = 0; i <= len; i += 1)
4c4b4cd2 837 fold_buffer[i] = tolower (name[i]);
14f9c5c9
AS
838 }
839
840 return fold_buffer;
841}
842
529cad9c
PH
843/* Return nonzero if C is either a digit or a lowercase alphabet character. */
844
845static int
846is_lower_alphanum (const char c)
847{
848 return (isdigit (c) || (isalpha (c) && islower (c)));
849}
850
29480c32
JB
851/* Remove either of these suffixes:
852 . .{DIGIT}+
853 . ${DIGIT}+
854 . ___{DIGIT}+
855 . __{DIGIT}+.
856 These are suffixes introduced by the compiler for entities such as
857 nested subprogram for instance, in order to avoid name clashes.
858 They do not serve any purpose for the debugger. */
859
860static void
861ada_remove_trailing_digits (const char *encoded, int *len)
862{
863 if (*len > 1 && isdigit (encoded[*len - 1]))
864 {
865 int i = *len - 2;
866 while (i > 0 && isdigit (encoded[i]))
867 i--;
868 if (i >= 0 && encoded[i] == '.')
869 *len = i;
870 else if (i >= 0 && encoded[i] == '$')
871 *len = i;
872 else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
873 *len = i - 2;
874 else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
875 *len = i - 1;
876 }
877}
878
879/* Remove the suffix introduced by the compiler for protected object
880 subprograms. */
881
882static void
883ada_remove_po_subprogram_suffix (const char *encoded, int *len)
884{
885 /* Remove trailing N. */
886
887 /* Protected entry subprograms are broken into two
888 separate subprograms: The first one is unprotected, and has
889 a 'N' suffix; the second is the protected version, and has
890 the 'P' suffix. The second calls the first one after handling
891 the protection. Since the P subprograms are internally generated,
892 we leave these names undecoded, giving the user a clue that this
893 entity is internal. */
894
895 if (*len > 1
896 && encoded[*len - 1] == 'N'
897 && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
898 *len = *len - 1;
899}
900
901/* If ENCODED follows the GNAT entity encoding conventions, then return
902 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
903 replaced by ENCODED.
14f9c5c9 904
4c4b4cd2 905 The resulting string is valid until the next call of ada_decode.
29480c32 906 If the string is unchanged by decoding, the original string pointer
4c4b4cd2
PH
907 is returned. */
908
909const char *
910ada_decode (const char *encoded)
14f9c5c9
AS
911{
912 int i, j;
913 int len0;
d2e4a39e 914 const char *p;
4c4b4cd2 915 char *decoded;
14f9c5c9 916 int at_start_name;
4c4b4cd2
PH
917 static char *decoding_buffer = NULL;
918 static size_t decoding_buffer_size = 0;
d2e4a39e 919
29480c32
JB
920 /* The name of the Ada main procedure starts with "_ada_".
921 This prefix is not part of the decoded name, so skip this part
922 if we see this prefix. */
4c4b4cd2
PH
923 if (strncmp (encoded, "_ada_", 5) == 0)
924 encoded += 5;
14f9c5c9 925
29480c32
JB
926 /* If the name starts with '_', then it is not a properly encoded
927 name, so do not attempt to decode it. Similarly, if the name
928 starts with '<', the name should not be decoded. */
4c4b4cd2 929 if (encoded[0] == '_' || encoded[0] == '<')
14f9c5c9
AS
930 goto Suppress;
931
4c4b4cd2 932 len0 = strlen (encoded);
4c4b4cd2 933
29480c32
JB
934 ada_remove_trailing_digits (encoded, &len0);
935 ada_remove_po_subprogram_suffix (encoded, &len0);
529cad9c 936
4c4b4cd2
PH
937 /* Remove the ___X.* suffix if present. Do not forget to verify that
938 the suffix is located before the current "end" of ENCODED. We want
939 to avoid re-matching parts of ENCODED that have previously been
940 marked as discarded (by decrementing LEN0). */
941 p = strstr (encoded, "___");
942 if (p != NULL && p - encoded < len0 - 3)
14f9c5c9
AS
943 {
944 if (p[3] == 'X')
4c4b4cd2 945 len0 = p - encoded;
14f9c5c9 946 else
4c4b4cd2 947 goto Suppress;
14f9c5c9 948 }
4c4b4cd2 949
29480c32
JB
950 /* Remove any trailing TKB suffix. It tells us that this symbol
951 is for the body of a task, but that information does not actually
952 appear in the decoded name. */
953
4c4b4cd2 954 if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
14f9c5c9 955 len0 -= 3;
76a01679 956
29480c32
JB
957 /* Remove trailing "B" suffixes. */
958 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
959
4c4b4cd2 960 if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
14f9c5c9
AS
961 len0 -= 1;
962
4c4b4cd2 963 /* Make decoded big enough for possible expansion by operator name. */
29480c32 964
4c4b4cd2
PH
965 GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
966 decoded = decoding_buffer;
14f9c5c9 967
29480c32
JB
968 /* Remove trailing __{digit}+ or trailing ${digit}+. */
969
4c4b4cd2 970 if (len0 > 1 && isdigit (encoded[len0 - 1]))
d2e4a39e 971 {
4c4b4cd2
PH
972 i = len0 - 2;
973 while ((i >= 0 && isdigit (encoded[i]))
974 || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
975 i -= 1;
976 if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
977 len0 = i - 1;
978 else if (encoded[i] == '$')
979 len0 = i;
d2e4a39e 980 }
14f9c5c9 981
29480c32
JB
982 /* The first few characters that are not alphabetic are not part
983 of any encoding we use, so we can copy them over verbatim. */
984
4c4b4cd2
PH
985 for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
986 decoded[j] = encoded[i];
14f9c5c9
AS
987
988 at_start_name = 1;
989 while (i < len0)
990 {
29480c32 991 /* Is this a symbol function? */
4c4b4cd2
PH
992 if (at_start_name && encoded[i] == 'O')
993 {
994 int k;
995 for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
996 {
997 int op_len = strlen (ada_opname_table[k].encoded);
06d5cf63
JB
998 if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
999 op_len - 1) == 0)
1000 && !isalnum (encoded[i + op_len]))
4c4b4cd2
PH
1001 {
1002 strcpy (decoded + j, ada_opname_table[k].decoded);
1003 at_start_name = 0;
1004 i += op_len;
1005 j += strlen (ada_opname_table[k].decoded);
1006 break;
1007 }
1008 }
1009 if (ada_opname_table[k].encoded != NULL)
1010 continue;
1011 }
14f9c5c9
AS
1012 at_start_name = 0;
1013
529cad9c
PH
1014 /* Replace "TK__" with "__", which will eventually be translated
1015 into "." (just below). */
1016
4c4b4cd2
PH
1017 if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
1018 i += 2;
529cad9c 1019
29480c32
JB
1020 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1021 be translated into "." (just below). These are internal names
1022 generated for anonymous blocks inside which our symbol is nested. */
1023
1024 if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
1025 && encoded [i+2] == 'B' && encoded [i+3] == '_'
1026 && isdigit (encoded [i+4]))
1027 {
1028 int k = i + 5;
1029
1030 while (k < len0 && isdigit (encoded[k]))
1031 k++; /* Skip any extra digit. */
1032
1033 /* Double-check that the "__B_{DIGITS}+" sequence we found
1034 is indeed followed by "__". */
1035 if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
1036 i = k;
1037 }
1038
529cad9c
PH
1039 /* Remove _E{DIGITS}+[sb] */
1040
1041 /* Just as for protected object subprograms, there are 2 categories
1042 of subprograms created by the compiler for each entry. The first
1043 one implements the actual entry code, and has a suffix following
1044 the convention above; the second one implements the barrier and
1045 uses the same convention as above, except that the 'E' is replaced
1046 by a 'B'.
1047
1048 Just as above, we do not decode the name of barrier functions
1049 to give the user a clue that the code he is debugging has been
1050 internally generated. */
1051
1052 if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
1053 && isdigit (encoded[i+2]))
1054 {
1055 int k = i + 3;
1056
1057 while (k < len0 && isdigit (encoded[k]))
1058 k++;
1059
1060 if (k < len0
1061 && (encoded[k] == 'b' || encoded[k] == 's'))
1062 {
1063 k++;
1064 /* Just as an extra precaution, make sure that if this
1065 suffix is followed by anything else, it is a '_'.
1066 Otherwise, we matched this sequence by accident. */
1067 if (k == len0
1068 || (k < len0 && encoded[k] == '_'))
1069 i = k;
1070 }
1071 }
1072
1073 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1074 the GNAT front-end in protected object subprograms. */
1075
1076 if (i < len0 + 3
1077 && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
1078 {
1079 /* Backtrack a bit up until we reach either the begining of
1080 the encoded name, or "__". Make sure that we only find
1081 digits or lowercase characters. */
1082 const char *ptr = encoded + i - 1;
1083
1084 while (ptr >= encoded && is_lower_alphanum (ptr[0]))
1085 ptr--;
1086 if (ptr < encoded
1087 || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
1088 i++;
1089 }
1090
4c4b4cd2
PH
1091 if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
1092 {
29480c32
JB
1093 /* This is a X[bn]* sequence not separated from the previous
1094 part of the name with a non-alpha-numeric character (in other
1095 words, immediately following an alpha-numeric character), then
1096 verify that it is placed at the end of the encoded name. If
1097 not, then the encoding is not valid and we should abort the
1098 decoding. Otherwise, just skip it, it is used in body-nested
1099 package names. */
4c4b4cd2
PH
1100 do
1101 i += 1;
1102 while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
1103 if (i < len0)
1104 goto Suppress;
1105 }
1106 else if (!ADA_RETAIN_DOTS
1107 && i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
1108 {
29480c32 1109 /* Replace '__' by '.'. */
4c4b4cd2
PH
1110 decoded[j] = '.';
1111 at_start_name = 1;
1112 i += 2;
1113 j += 1;
1114 }
14f9c5c9 1115 else
4c4b4cd2 1116 {
29480c32
JB
1117 /* It's a character part of the decoded name, so just copy it
1118 over. */
4c4b4cd2
PH
1119 decoded[j] = encoded[i];
1120 i += 1;
1121 j += 1;
1122 }
14f9c5c9 1123 }
4c4b4cd2 1124 decoded[j] = '\000';
14f9c5c9 1125
29480c32
JB
1126 /* Decoded names should never contain any uppercase character.
1127 Double-check this, and abort the decoding if we find one. */
1128
4c4b4cd2
PH
1129 for (i = 0; decoded[i] != '\0'; i += 1)
1130 if (isupper (decoded[i]) || decoded[i] == ' ')
14f9c5c9
AS
1131 goto Suppress;
1132
4c4b4cd2
PH
1133 if (strcmp (decoded, encoded) == 0)
1134 return encoded;
1135 else
1136 return decoded;
14f9c5c9
AS
1137
1138Suppress:
4c4b4cd2
PH
1139 GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
1140 decoded = decoding_buffer;
1141 if (encoded[0] == '<')
1142 strcpy (decoded, encoded);
14f9c5c9 1143 else
4c4b4cd2
PH
1144 sprintf (decoded, "<%s>", encoded);
1145 return decoded;
1146
1147}
1148
1149/* Table for keeping permanent unique copies of decoded names. Once
1150 allocated, names in this table are never released. While this is a
1151 storage leak, it should not be significant unless there are massive
1152 changes in the set of decoded names in successive versions of a
1153 symbol table loaded during a single session. */
1154static struct htab *decoded_names_store;
1155
1156/* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1157 in the language-specific part of GSYMBOL, if it has not been
1158 previously computed. Tries to save the decoded name in the same
1159 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1160 in any case, the decoded symbol has a lifetime at least that of
1161 GSYMBOL).
1162 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1163 const, but nevertheless modified to a semantically equivalent form
1164 when a decoded name is cached in it.
76a01679 1165*/
4c4b4cd2 1166
76a01679
JB
1167char *
1168ada_decode_symbol (const struct general_symbol_info *gsymbol)
4c4b4cd2 1169{
76a01679 1170 char **resultp =
4c4b4cd2
PH
1171 (char **) &gsymbol->language_specific.cplus_specific.demangled_name;
1172 if (*resultp == NULL)
1173 {
1174 const char *decoded = ada_decode (gsymbol->name);
1175 if (gsymbol->bfd_section != NULL)
76a01679
JB
1176 {
1177 bfd *obfd = gsymbol->bfd_section->owner;
1178 if (obfd != NULL)
1179 {
1180 struct objfile *objf;
1181 ALL_OBJFILES (objf)
1182 {
1183 if (obfd == objf->obfd)
1184 {
1185 *resultp = obsavestring (decoded, strlen (decoded),
1186 &objf->objfile_obstack);
1187 break;
1188 }
1189 }
1190 }
1191 }
4c4b4cd2 1192 /* Sometimes, we can't find a corresponding objfile, in which
76a01679
JB
1193 case, we put the result on the heap. Since we only decode
1194 when needed, we hope this usually does not cause a
1195 significant memory leak (FIXME). */
4c4b4cd2 1196 if (*resultp == NULL)
76a01679
JB
1197 {
1198 char **slot = (char **) htab_find_slot (decoded_names_store,
1199 decoded, INSERT);
1200 if (*slot == NULL)
1201 *slot = xstrdup (decoded);
1202 *resultp = *slot;
1203 }
4c4b4cd2 1204 }
14f9c5c9 1205
4c4b4cd2
PH
1206 return *resultp;
1207}
76a01679
JB
1208
1209char *
1210ada_la_decode (const char *encoded, int options)
4c4b4cd2
PH
1211{
1212 return xstrdup (ada_decode (encoded));
14f9c5c9
AS
1213}
1214
1215/* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
4c4b4cd2
PH
1216 suffixes that encode debugging information or leading _ada_ on
1217 SYM_NAME (see is_name_suffix commentary for the debugging
1218 information that is ignored). If WILD, then NAME need only match a
1219 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1220 either argument is NULL. */
14f9c5c9
AS
1221
1222int
d2e4a39e 1223ada_match_name (const char *sym_name, const char *name, int wild)
14f9c5c9
AS
1224{
1225 if (sym_name == NULL || name == NULL)
1226 return 0;
1227 else if (wild)
1228 return wild_match (name, strlen (name), sym_name);
d2e4a39e
AS
1229 else
1230 {
1231 int len_name = strlen (name);
4c4b4cd2
PH
1232 return (strncmp (sym_name, name, len_name) == 0
1233 && is_name_suffix (sym_name + len_name))
1234 || (strncmp (sym_name, "_ada_", 5) == 0
1235 && strncmp (sym_name + 5, name, len_name) == 0
1236 && is_name_suffix (sym_name + len_name + 5));
d2e4a39e 1237 }
14f9c5c9
AS
1238}
1239
4c4b4cd2
PH
1240/* True (non-zero) iff, in Ada mode, the symbol SYM should be
1241 suppressed in info listings. */
14f9c5c9
AS
1242
1243int
ebf56fd3 1244ada_suppress_symbol_printing (struct symbol *sym)
14f9c5c9 1245{
176620f1 1246 if (SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN)
14f9c5c9 1247 return 1;
d2e4a39e 1248 else
4c4b4cd2 1249 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym));
14f9c5c9 1250}
14f9c5c9 1251\f
d2e4a39e 1252
4c4b4cd2 1253 /* Arrays */
14f9c5c9 1254
4c4b4cd2 1255/* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
14f9c5c9 1256
d2e4a39e
AS
1257static char *bound_name[] = {
1258 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
14f9c5c9
AS
1259 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1260};
1261
1262/* Maximum number of array dimensions we are prepared to handle. */
1263
4c4b4cd2 1264#define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
14f9c5c9 1265
4c4b4cd2 1266/* Like modify_field, but allows bitpos > wordlength. */
14f9c5c9
AS
1267
1268static void
ebf56fd3 1269modify_general_field (char *addr, LONGEST fieldval, int bitpos, int bitsize)
14f9c5c9 1270{
4c4b4cd2 1271 modify_field (addr + bitpos / 8, fieldval, bitpos % 8, bitsize);
14f9c5c9
AS
1272}
1273
1274
4c4b4cd2
PH
1275/* The desc_* routines return primitive portions of array descriptors
1276 (fat pointers). */
14f9c5c9
AS
1277
1278/* The descriptor or array type, if any, indicated by TYPE; removes
4c4b4cd2
PH
1279 level of indirection, if needed. */
1280
d2e4a39e
AS
1281static struct type *
1282desc_base_type (struct type *type)
14f9c5c9
AS
1283{
1284 if (type == NULL)
1285 return NULL;
61ee279c 1286 type = ada_check_typedef (type);
1265e4aa
JB
1287 if (type != NULL
1288 && (TYPE_CODE (type) == TYPE_CODE_PTR
1289 || TYPE_CODE (type) == TYPE_CODE_REF))
61ee279c 1290 return ada_check_typedef (TYPE_TARGET_TYPE (type));
14f9c5c9
AS
1291 else
1292 return type;
1293}
1294
4c4b4cd2
PH
1295/* True iff TYPE indicates a "thin" array pointer type. */
1296
14f9c5c9 1297static int
d2e4a39e 1298is_thin_pntr (struct type *type)
14f9c5c9 1299{
d2e4a39e 1300 return
14f9c5c9
AS
1301 is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
1302 || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
1303}
1304
4c4b4cd2
PH
1305/* The descriptor type for thin pointer type TYPE. */
1306
d2e4a39e
AS
1307static struct type *
1308thin_descriptor_type (struct type *type)
14f9c5c9 1309{
d2e4a39e 1310 struct type *base_type = desc_base_type (type);
14f9c5c9
AS
1311 if (base_type == NULL)
1312 return NULL;
1313 if (is_suffix (ada_type_name (base_type), "___XVE"))
1314 return base_type;
d2e4a39e 1315 else
14f9c5c9 1316 {
d2e4a39e 1317 struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
14f9c5c9 1318 if (alt_type == NULL)
4c4b4cd2 1319 return base_type;
14f9c5c9 1320 else
4c4b4cd2 1321 return alt_type;
14f9c5c9
AS
1322 }
1323}
1324
4c4b4cd2
PH
1325/* A pointer to the array data for thin-pointer value VAL. */
1326
d2e4a39e
AS
1327static struct value *
1328thin_data_pntr (struct value *val)
14f9c5c9 1329{
df407dfe 1330 struct type *type = value_type (val);
14f9c5c9 1331 if (TYPE_CODE (type) == TYPE_CODE_PTR)
d2e4a39e 1332 return value_cast (desc_data_type (thin_descriptor_type (type)),
4c4b4cd2 1333 value_copy (val));
d2e4a39e 1334 else
14f9c5c9 1335 return value_from_longest (desc_data_type (thin_descriptor_type (type)),
df407dfe 1336 VALUE_ADDRESS (val) + value_offset (val));
14f9c5c9
AS
1337}
1338
4c4b4cd2
PH
1339/* True iff TYPE indicates a "thick" array pointer type. */
1340
14f9c5c9 1341static int
d2e4a39e 1342is_thick_pntr (struct type *type)
14f9c5c9
AS
1343{
1344 type = desc_base_type (type);
1345 return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
4c4b4cd2 1346 && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
14f9c5c9
AS
1347}
1348
4c4b4cd2
PH
1349/* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1350 pointer to one, the type of its bounds data; otherwise, NULL. */
76a01679 1351
d2e4a39e
AS
1352static struct type *
1353desc_bounds_type (struct type *type)
14f9c5c9 1354{
d2e4a39e 1355 struct type *r;
14f9c5c9
AS
1356
1357 type = desc_base_type (type);
1358
1359 if (type == NULL)
1360 return NULL;
1361 else if (is_thin_pntr (type))
1362 {
1363 type = thin_descriptor_type (type);
1364 if (type == NULL)
4c4b4cd2 1365 return NULL;
14f9c5c9
AS
1366 r = lookup_struct_elt_type (type, "BOUNDS", 1);
1367 if (r != NULL)
61ee279c 1368 return ada_check_typedef (r);
14f9c5c9
AS
1369 }
1370 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
1371 {
1372 r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
1373 if (r != NULL)
61ee279c 1374 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
14f9c5c9
AS
1375 }
1376 return NULL;
1377}
1378
1379/* If ARR is an array descriptor (fat or thin pointer), or pointer to
4c4b4cd2
PH
1380 one, a pointer to its bounds data. Otherwise NULL. */
1381
d2e4a39e
AS
1382static struct value *
1383desc_bounds (struct value *arr)
14f9c5c9 1384{
df407dfe 1385 struct type *type = ada_check_typedef (value_type (arr));
d2e4a39e 1386 if (is_thin_pntr (type))
14f9c5c9 1387 {
d2e4a39e 1388 struct type *bounds_type =
4c4b4cd2 1389 desc_bounds_type (thin_descriptor_type (type));
14f9c5c9
AS
1390 LONGEST addr;
1391
4cdfadb1 1392 if (bounds_type == NULL)
323e0a4a 1393 error (_("Bad GNAT array descriptor"));
14f9c5c9
AS
1394
1395 /* NOTE: The following calculation is not really kosher, but
d2e4a39e 1396 since desc_type is an XVE-encoded type (and shouldn't be),
4c4b4cd2 1397 the correct calculation is a real pain. FIXME (and fix GCC). */
14f9c5c9 1398 if (TYPE_CODE (type) == TYPE_CODE_PTR)
4c4b4cd2 1399 addr = value_as_long (arr);
d2e4a39e 1400 else
df407dfe 1401 addr = VALUE_ADDRESS (arr) + value_offset (arr);
14f9c5c9 1402
d2e4a39e 1403 return
4c4b4cd2
PH
1404 value_from_longest (lookup_pointer_type (bounds_type),
1405 addr - TYPE_LENGTH (bounds_type));
14f9c5c9
AS
1406 }
1407
1408 else if (is_thick_pntr (type))
d2e4a39e 1409 return value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
323e0a4a 1410 _("Bad GNAT array descriptor"));
14f9c5c9
AS
1411 else
1412 return NULL;
1413}
1414
4c4b4cd2
PH
1415/* If TYPE is the type of an array-descriptor (fat pointer), the bit
1416 position of the field containing the address of the bounds data. */
1417
14f9c5c9 1418static int
d2e4a39e 1419fat_pntr_bounds_bitpos (struct type *type)
14f9c5c9
AS
1420{
1421 return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
1422}
1423
1424/* If TYPE is the type of an array-descriptor (fat pointer), the bit
4c4b4cd2
PH
1425 size of the field containing the address of the bounds data. */
1426
14f9c5c9 1427static int
d2e4a39e 1428fat_pntr_bounds_bitsize (struct type *type)
14f9c5c9
AS
1429{
1430 type = desc_base_type (type);
1431
d2e4a39e 1432 if (TYPE_FIELD_BITSIZE (type, 1) > 0)
14f9c5c9
AS
1433 return TYPE_FIELD_BITSIZE (type, 1);
1434 else
61ee279c 1435 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
14f9c5c9
AS
1436}
1437
4c4b4cd2 1438/* If TYPE is the type of an array descriptor (fat or thin pointer) or a
14f9c5c9 1439 pointer to one, the type of its array data (a
4c4b4cd2
PH
1440 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1441 ada_type_of_array to get an array type with bounds data. */
1442
d2e4a39e
AS
1443static struct type *
1444desc_data_type (struct type *type)
14f9c5c9
AS
1445{
1446 type = desc_base_type (type);
1447
4c4b4cd2 1448 /* NOTE: The following is bogus; see comment in desc_bounds. */
14f9c5c9 1449 if (is_thin_pntr (type))
d2e4a39e
AS
1450 return lookup_pointer_type
1451 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1)));
14f9c5c9
AS
1452 else if (is_thick_pntr (type))
1453 return lookup_struct_elt_type (type, "P_ARRAY", 1);
1454 else
1455 return NULL;
1456}
1457
1458/* If ARR is an array descriptor (fat or thin pointer), a pointer to
1459 its array data. */
4c4b4cd2 1460
d2e4a39e
AS
1461static struct value *
1462desc_data (struct value *arr)
14f9c5c9 1463{
df407dfe 1464 struct type *type = value_type (arr);
14f9c5c9
AS
1465 if (is_thin_pntr (type))
1466 return thin_data_pntr (arr);
1467 else if (is_thick_pntr (type))
d2e4a39e 1468 return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
323e0a4a 1469 _("Bad GNAT array descriptor"));
14f9c5c9
AS
1470 else
1471 return NULL;
1472}
1473
1474
1475/* If TYPE is the type of an array-descriptor (fat pointer), the bit
4c4b4cd2
PH
1476 position of the field containing the address of the data. */
1477
14f9c5c9 1478static int
d2e4a39e 1479fat_pntr_data_bitpos (struct type *type)
14f9c5c9
AS
1480{
1481 return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
1482}
1483
1484/* If TYPE is the type of an array-descriptor (fat pointer), the bit
4c4b4cd2
PH
1485 size of the field containing the address of the data. */
1486
14f9c5c9 1487static int
d2e4a39e 1488fat_pntr_data_bitsize (struct type *type)
14f9c5c9
AS
1489{
1490 type = desc_base_type (type);
1491
1492 if (TYPE_FIELD_BITSIZE (type, 0) > 0)
1493 return TYPE_FIELD_BITSIZE (type, 0);
d2e4a39e 1494 else
14f9c5c9
AS
1495 return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
1496}
1497
4c4b4cd2 1498/* If BOUNDS is an array-bounds structure (or pointer to one), return
14f9c5c9 1499 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
4c4b4cd2
PH
1500 bound, if WHICH is 1. The first bound is I=1. */
1501
d2e4a39e
AS
1502static struct value *
1503desc_one_bound (struct value *bounds, int i, int which)
14f9c5c9 1504{
d2e4a39e 1505 return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
323e0a4a 1506 _("Bad GNAT array descriptor bounds"));
14f9c5c9
AS
1507}
1508
1509/* If BOUNDS is an array-bounds structure type, return the bit position
1510 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
4c4b4cd2
PH
1511 bound, if WHICH is 1. The first bound is I=1. */
1512
14f9c5c9 1513static int
d2e4a39e 1514desc_bound_bitpos (struct type *type, int i, int which)
14f9c5c9 1515{
d2e4a39e 1516 return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
14f9c5c9
AS
1517}
1518
1519/* If BOUNDS is an array-bounds structure type, return the bit field size
1520 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
4c4b4cd2
PH
1521 bound, if WHICH is 1. The first bound is I=1. */
1522
76a01679 1523static int
d2e4a39e 1524desc_bound_bitsize (struct type *type, int i, int which)
14f9c5c9
AS
1525{
1526 type = desc_base_type (type);
1527
d2e4a39e
AS
1528 if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
1529 return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
1530 else
1531 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
14f9c5c9
AS
1532}
1533
1534/* If TYPE is the type of an array-bounds structure, the type of its
4c4b4cd2
PH
1535 Ith bound (numbering from 1). Otherwise, NULL. */
1536
d2e4a39e
AS
1537static struct type *
1538desc_index_type (struct type *type, int i)
14f9c5c9
AS
1539{
1540 type = desc_base_type (type);
1541
1542 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
d2e4a39e
AS
1543 return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
1544 else
14f9c5c9
AS
1545 return NULL;
1546}
1547
4c4b4cd2
PH
1548/* The number of index positions in the array-bounds type TYPE.
1549 Return 0 if TYPE is NULL. */
1550
14f9c5c9 1551static int
d2e4a39e 1552desc_arity (struct type *type)
14f9c5c9
AS
1553{
1554 type = desc_base_type (type);
1555
1556 if (type != NULL)
1557 return TYPE_NFIELDS (type) / 2;
1558 return 0;
1559}
1560
4c4b4cd2
PH
1561/* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1562 an array descriptor type (representing an unconstrained array
1563 type). */
1564
76a01679
JB
1565static int
1566ada_is_direct_array_type (struct type *type)
4c4b4cd2
PH
1567{
1568 if (type == NULL)
1569 return 0;
61ee279c 1570 type = ada_check_typedef (type);
4c4b4cd2 1571 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
76a01679 1572 || ada_is_array_descriptor_type (type));
4c4b4cd2
PH
1573}
1574
52ce6436
PH
1575/* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1576 * to one. */
1577
1578int
1579ada_is_array_type (struct type *type)
1580{
1581 while (type != NULL
1582 && (TYPE_CODE (type) == TYPE_CODE_PTR
1583 || TYPE_CODE (type) == TYPE_CODE_REF))
1584 type = TYPE_TARGET_TYPE (type);
1585 return ada_is_direct_array_type (type);
1586}
1587
4c4b4cd2 1588/* Non-zero iff TYPE is a simple array type or pointer to one. */
14f9c5c9 1589
14f9c5c9 1590int
4c4b4cd2 1591ada_is_simple_array_type (struct type *type)
14f9c5c9
AS
1592{
1593 if (type == NULL)
1594 return 0;
61ee279c 1595 type = ada_check_typedef (type);
14f9c5c9 1596 return (TYPE_CODE (type) == TYPE_CODE_ARRAY
4c4b4cd2
PH
1597 || (TYPE_CODE (type) == TYPE_CODE_PTR
1598 && TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY));
14f9c5c9
AS
1599}
1600
4c4b4cd2
PH
1601/* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1602
14f9c5c9 1603int
4c4b4cd2 1604ada_is_array_descriptor_type (struct type *type)
14f9c5c9 1605{
d2e4a39e 1606 struct type *data_type = desc_data_type (type);
14f9c5c9
AS
1607
1608 if (type == NULL)
1609 return 0;
61ee279c 1610 type = ada_check_typedef (type);
d2e4a39e 1611 return
14f9c5c9
AS
1612 data_type != NULL
1613 && ((TYPE_CODE (data_type) == TYPE_CODE_PTR
4c4b4cd2
PH
1614 && TYPE_TARGET_TYPE (data_type) != NULL
1615 && TYPE_CODE (TYPE_TARGET_TYPE (data_type)) == TYPE_CODE_ARRAY)
1265e4aa 1616 || TYPE_CODE (data_type) == TYPE_CODE_ARRAY)
14f9c5c9
AS
1617 && desc_arity (desc_bounds_type (type)) > 0;
1618}
1619
1620/* Non-zero iff type is a partially mal-formed GNAT array
4c4b4cd2 1621 descriptor. FIXME: This is to compensate for some problems with
14f9c5c9 1622 debugging output from GNAT. Re-examine periodically to see if it
4c4b4cd2
PH
1623 is still needed. */
1624
14f9c5c9 1625int
ebf56fd3 1626ada_is_bogus_array_descriptor (struct type *type)
14f9c5c9 1627{
d2e4a39e 1628 return
14f9c5c9
AS
1629 type != NULL
1630 && TYPE_CODE (type) == TYPE_CODE_STRUCT
1631 && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
4c4b4cd2
PH
1632 || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
1633 && !ada_is_array_descriptor_type (type);
14f9c5c9
AS
1634}
1635
1636
4c4b4cd2 1637/* If ARR has a record type in the form of a standard GNAT array descriptor,
14f9c5c9 1638 (fat pointer) returns the type of the array data described---specifically,
4c4b4cd2 1639 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
14f9c5c9 1640 in from the descriptor; otherwise, they are left unspecified. If
4c4b4cd2
PH
1641 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1642 returns NULL. The result is simply the type of ARR if ARR is not
14f9c5c9 1643 a descriptor. */
d2e4a39e
AS
1644struct type *
1645ada_type_of_array (struct value *arr, int bounds)
14f9c5c9 1646{
df407dfe
AC
1647 if (ada_is_packed_array_type (value_type (arr)))
1648 return decode_packed_array_type (value_type (arr));
14f9c5c9 1649
df407dfe
AC
1650 if (!ada_is_array_descriptor_type (value_type (arr)))
1651 return value_type (arr);
d2e4a39e
AS
1652
1653 if (!bounds)
1654 return
df407dfe 1655 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr))));
14f9c5c9
AS
1656 else
1657 {
d2e4a39e 1658 struct type *elt_type;
14f9c5c9 1659 int arity;
d2e4a39e 1660 struct value *descriptor;
df407dfe 1661 struct objfile *objf = TYPE_OBJFILE (value_type (arr));
14f9c5c9 1662
df407dfe
AC
1663 elt_type = ada_array_element_type (value_type (arr), -1);
1664 arity = ada_array_arity (value_type (arr));
14f9c5c9 1665
d2e4a39e 1666 if (elt_type == NULL || arity == 0)
df407dfe 1667 return ada_check_typedef (value_type (arr));
14f9c5c9
AS
1668
1669 descriptor = desc_bounds (arr);
d2e4a39e 1670 if (value_as_long (descriptor) == 0)
4c4b4cd2 1671 return NULL;
d2e4a39e 1672 while (arity > 0)
4c4b4cd2
PH
1673 {
1674 struct type *range_type = alloc_type (objf);
1675 struct type *array_type = alloc_type (objf);
1676 struct value *low = desc_one_bound (descriptor, arity, 0);
1677 struct value *high = desc_one_bound (descriptor, arity, 1);
1678 arity -= 1;
1679
df407dfe 1680 create_range_type (range_type, value_type (low),
529cad9c
PH
1681 longest_to_int (value_as_long (low)),
1682 longest_to_int (value_as_long (high)));
4c4b4cd2
PH
1683 elt_type = create_array_type (array_type, elt_type, range_type);
1684 }
14f9c5c9
AS
1685
1686 return lookup_pointer_type (elt_type);
1687 }
1688}
1689
1690/* If ARR does not represent an array, returns ARR unchanged.
4c4b4cd2
PH
1691 Otherwise, returns either a standard GDB array with bounds set
1692 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1693 GDB array. Returns NULL if ARR is a null fat pointer. */
1694
d2e4a39e
AS
1695struct value *
1696ada_coerce_to_simple_array_ptr (struct value *arr)
14f9c5c9 1697{
df407dfe 1698 if (ada_is_array_descriptor_type (value_type (arr)))
14f9c5c9 1699 {
d2e4a39e 1700 struct type *arrType = ada_type_of_array (arr, 1);
14f9c5c9 1701 if (arrType == NULL)
4c4b4cd2 1702 return NULL;
14f9c5c9
AS
1703 return value_cast (arrType, value_copy (desc_data (arr)));
1704 }
df407dfe 1705 else if (ada_is_packed_array_type (value_type (arr)))
14f9c5c9
AS
1706 return decode_packed_array (arr);
1707 else
1708 return arr;
1709}
1710
1711/* If ARR does not represent an array, returns ARR unchanged.
1712 Otherwise, returns a standard GDB array describing ARR (which may
4c4b4cd2
PH
1713 be ARR itself if it already is in the proper form). */
1714
1715static struct value *
d2e4a39e 1716ada_coerce_to_simple_array (struct value *arr)
14f9c5c9 1717{
df407dfe 1718 if (ada_is_array_descriptor_type (value_type (arr)))
14f9c5c9 1719 {
d2e4a39e 1720 struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
14f9c5c9 1721 if (arrVal == NULL)
323e0a4a 1722 error (_("Bounds unavailable for null array pointer."));
529cad9c 1723 check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
14f9c5c9
AS
1724 return value_ind (arrVal);
1725 }
df407dfe 1726 else if (ada_is_packed_array_type (value_type (arr)))
14f9c5c9 1727 return decode_packed_array (arr);
d2e4a39e 1728 else
14f9c5c9
AS
1729 return arr;
1730}
1731
1732/* If TYPE represents a GNAT array type, return it translated to an
1733 ordinary GDB array type (possibly with BITSIZE fields indicating
4c4b4cd2
PH
1734 packing). For other types, is the identity. */
1735
d2e4a39e
AS
1736struct type *
1737ada_coerce_to_simple_array_type (struct type *type)
14f9c5c9 1738{
d2e4a39e
AS
1739 struct value *mark = value_mark ();
1740 struct value *dummy = value_from_longest (builtin_type_long, 0);
1741 struct type *result;
04624583 1742 deprecated_set_value_type (dummy, type);
14f9c5c9 1743 result = ada_type_of_array (dummy, 0);
4c4b4cd2 1744 value_free_to_mark (mark);
14f9c5c9
AS
1745 return result;
1746}
1747
4c4b4cd2
PH
1748/* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1749
14f9c5c9 1750int
d2e4a39e 1751ada_is_packed_array_type (struct type *type)
14f9c5c9
AS
1752{
1753 if (type == NULL)
1754 return 0;
4c4b4cd2 1755 type = desc_base_type (type);
61ee279c 1756 type = ada_check_typedef (type);
d2e4a39e 1757 return
14f9c5c9
AS
1758 ada_type_name (type) != NULL
1759 && strstr (ada_type_name (type), "___XP") != NULL;
1760}
1761
1762/* Given that TYPE is a standard GDB array type with all bounds filled
1763 in, and that the element size of its ultimate scalar constituents
1764 (that is, either its elements, or, if it is an array of arrays, its
1765 elements' elements, etc.) is *ELT_BITS, return an identical type,
1766 but with the bit sizes of its elements (and those of any
1767 constituent arrays) recorded in the BITSIZE components of its
4c4b4cd2
PH
1768 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1769 in bits. */
1770
d2e4a39e
AS
1771static struct type *
1772packed_array_type (struct type *type, long *elt_bits)
14f9c5c9 1773{
d2e4a39e
AS
1774 struct type *new_elt_type;
1775 struct type *new_type;
14f9c5c9
AS
1776 LONGEST low_bound, high_bound;
1777
61ee279c 1778 type = ada_check_typedef (type);
14f9c5c9
AS
1779 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
1780 return type;
1781
1782 new_type = alloc_type (TYPE_OBJFILE (type));
61ee279c 1783 new_elt_type = packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
4c4b4cd2 1784 elt_bits);
14f9c5c9
AS
1785 create_array_type (new_type, new_elt_type, TYPE_FIELD_TYPE (type, 0));
1786 TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
1787 TYPE_NAME (new_type) = ada_type_name (type);
1788
d2e4a39e 1789 if (get_discrete_bounds (TYPE_FIELD_TYPE (type, 0),
4c4b4cd2 1790 &low_bound, &high_bound) < 0)
14f9c5c9
AS
1791 low_bound = high_bound = 0;
1792 if (high_bound < low_bound)
1793 *elt_bits = TYPE_LENGTH (new_type) = 0;
d2e4a39e 1794 else
14f9c5c9
AS
1795 {
1796 *elt_bits *= (high_bound - low_bound + 1);
d2e4a39e 1797 TYPE_LENGTH (new_type) =
4c4b4cd2 1798 (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
14f9c5c9
AS
1799 }
1800
4c4b4cd2 1801 TYPE_FLAGS (new_type) |= TYPE_FLAG_FIXED_INSTANCE;
14f9c5c9
AS
1802 return new_type;
1803}
1804
4c4b4cd2
PH
1805/* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1806
d2e4a39e
AS
1807static struct type *
1808decode_packed_array_type (struct type *type)
1809{
4c4b4cd2 1810 struct symbol *sym;
d2e4a39e 1811 struct block **blocks;
61ee279c 1812 const char *raw_name = ada_type_name (ada_check_typedef (type));
d2e4a39e
AS
1813 char *name = (char *) alloca (strlen (raw_name) + 1);
1814 char *tail = strstr (raw_name, "___XP");
1815 struct type *shadow_type;
14f9c5c9
AS
1816 long bits;
1817 int i, n;
1818
4c4b4cd2
PH
1819 type = desc_base_type (type);
1820
14f9c5c9
AS
1821 memcpy (name, raw_name, tail - raw_name);
1822 name[tail - raw_name] = '\000';
1823
4c4b4cd2
PH
1824 sym = standard_lookup (name, get_selected_block (0), VAR_DOMAIN);
1825 if (sym == NULL || SYMBOL_TYPE (sym) == NULL)
14f9c5c9 1826 {
323e0a4a 1827 lim_warning (_("could not find bounds information on packed array"));
14f9c5c9
AS
1828 return NULL;
1829 }
4c4b4cd2 1830 shadow_type = SYMBOL_TYPE (sym);
14f9c5c9
AS
1831
1832 if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
1833 {
323e0a4a 1834 lim_warning (_("could not understand bounds information on packed array"));
14f9c5c9
AS
1835 return NULL;
1836 }
d2e4a39e 1837
14f9c5c9
AS
1838 if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
1839 {
4c4b4cd2 1840 lim_warning
323e0a4a 1841 (_("could not understand bit size information on packed array"));
14f9c5c9
AS
1842 return NULL;
1843 }
d2e4a39e 1844
14f9c5c9
AS
1845 return packed_array_type (shadow_type, &bits);
1846}
1847
4c4b4cd2 1848/* Given that ARR is a struct value *indicating a GNAT packed array,
14f9c5c9
AS
1849 returns a simple array that denotes that array. Its type is a
1850 standard GDB array type except that the BITSIZEs of the array
1851 target types are set to the number of bits in each element, and the
4c4b4cd2 1852 type length is set appropriately. */
14f9c5c9 1853
d2e4a39e
AS
1854static struct value *
1855decode_packed_array (struct value *arr)
14f9c5c9 1856{
4c4b4cd2 1857 struct type *type;
14f9c5c9 1858
4c4b4cd2 1859 arr = ada_coerce_ref (arr);
df407dfe 1860 if (TYPE_CODE (value_type (arr)) == TYPE_CODE_PTR)
4c4b4cd2
PH
1861 arr = ada_value_ind (arr);
1862
df407dfe 1863 type = decode_packed_array_type (value_type (arr));
14f9c5c9
AS
1864 if (type == NULL)
1865 {
323e0a4a 1866 error (_("can't unpack array"));
14f9c5c9
AS
1867 return NULL;
1868 }
61ee279c 1869
df407dfe 1870 if (BITS_BIG_ENDIAN && ada_is_modular_type (value_type (arr)))
61ee279c
PH
1871 {
1872 /* This is a (right-justified) modular type representing a packed
1873 array with no wrapper. In order to interpret the value through
1874 the (left-justified) packed array type we just built, we must
1875 first left-justify it. */
1876 int bit_size, bit_pos;
1877 ULONGEST mod;
1878
df407dfe 1879 mod = ada_modulus (value_type (arr)) - 1;
61ee279c
PH
1880 bit_size = 0;
1881 while (mod > 0)
1882 {
1883 bit_size += 1;
1884 mod >>= 1;
1885 }
df407dfe 1886 bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
61ee279c
PH
1887 arr = ada_value_primitive_packed_val (arr, NULL,
1888 bit_pos / HOST_CHAR_BIT,
1889 bit_pos % HOST_CHAR_BIT,
1890 bit_size,
1891 type);
1892 }
1893
4c4b4cd2 1894 return coerce_unspec_val_to_type (arr, type);
14f9c5c9
AS
1895}
1896
1897
1898/* The value of the element of packed array ARR at the ARITY indices
4c4b4cd2 1899 given in IND. ARR must be a simple array. */
14f9c5c9 1900
d2e4a39e
AS
1901static struct value *
1902value_subscript_packed (struct value *arr, int arity, struct value **ind)
14f9c5c9
AS
1903{
1904 int i;
1905 int bits, elt_off, bit_off;
1906 long elt_total_bit_offset;
d2e4a39e
AS
1907 struct type *elt_type;
1908 struct value *v;
14f9c5c9
AS
1909
1910 bits = 0;
1911 elt_total_bit_offset = 0;
df407dfe 1912 elt_type = ada_check_typedef (value_type (arr));
d2e4a39e 1913 for (i = 0; i < arity; i += 1)
14f9c5c9 1914 {
d2e4a39e 1915 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
4c4b4cd2
PH
1916 || TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
1917 error
323e0a4a 1918 (_("attempt to do packed indexing of something other than a packed array"));
14f9c5c9 1919 else
4c4b4cd2
PH
1920 {
1921 struct type *range_type = TYPE_INDEX_TYPE (elt_type);
1922 LONGEST lowerbound, upperbound;
1923 LONGEST idx;
1924
1925 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
1926 {
323e0a4a 1927 lim_warning (_("don't know bounds of array"));
4c4b4cd2
PH
1928 lowerbound = upperbound = 0;
1929 }
1930
1931 idx = value_as_long (value_pos_atr (ind[i]));
1932 if (idx < lowerbound || idx > upperbound)
323e0a4a 1933 lim_warning (_("packed array index %ld out of bounds"), (long) idx);
4c4b4cd2
PH
1934 bits = TYPE_FIELD_BITSIZE (elt_type, 0);
1935 elt_total_bit_offset += (idx - lowerbound) * bits;
61ee279c 1936 elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
4c4b4cd2 1937 }
14f9c5c9
AS
1938 }
1939 elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
1940 bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
d2e4a39e
AS
1941
1942 v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
4c4b4cd2 1943 bits, elt_type);
14f9c5c9
AS
1944 return v;
1945}
1946
4c4b4cd2 1947/* Non-zero iff TYPE includes negative integer values. */
14f9c5c9
AS
1948
1949static int
d2e4a39e 1950has_negatives (struct type *type)
14f9c5c9 1951{
d2e4a39e
AS
1952 switch (TYPE_CODE (type))
1953 {
1954 default:
1955 return 0;
1956 case TYPE_CODE_INT:
1957 return !TYPE_UNSIGNED (type);
1958 case TYPE_CODE_RANGE:
1959 return TYPE_LOW_BOUND (type) < 0;
1960 }
14f9c5c9 1961}
d2e4a39e 1962
14f9c5c9
AS
1963
1964/* Create a new value of type TYPE from the contents of OBJ starting
1965 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1966 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
4c4b4cd2
PH
1967 assigning through the result will set the field fetched from.
1968 VALADDR is ignored unless OBJ is NULL, in which case,
1969 VALADDR+OFFSET must address the start of storage containing the
1970 packed value. The value returned in this case is never an lval.
1971 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
14f9c5c9 1972
d2e4a39e 1973struct value *
fc1a4b47 1974ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
a2bd3dcd 1975 long offset, int bit_offset, int bit_size,
4c4b4cd2 1976 struct type *type)
14f9c5c9 1977{
d2e4a39e 1978 struct value *v;
4c4b4cd2
PH
1979 int src, /* Index into the source area */
1980 targ, /* Index into the target area */
1981 srcBitsLeft, /* Number of source bits left to move */
1982 nsrc, ntarg, /* Number of source and target bytes */
1983 unusedLS, /* Number of bits in next significant
1984 byte of source that are unused */
1985 accumSize; /* Number of meaningful bits in accum */
1986 unsigned char *bytes; /* First byte containing data to unpack */
d2e4a39e 1987 unsigned char *unpacked;
4c4b4cd2 1988 unsigned long accum; /* Staging area for bits being transferred */
14f9c5c9
AS
1989 unsigned char sign;
1990 int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
4c4b4cd2
PH
1991 /* Transmit bytes from least to most significant; delta is the direction
1992 the indices move. */
14f9c5c9
AS
1993 int delta = BITS_BIG_ENDIAN ? -1 : 1;
1994
61ee279c 1995 type = ada_check_typedef (type);
14f9c5c9
AS
1996
1997 if (obj == NULL)
1998 {
1999 v = allocate_value (type);
d2e4a39e 2000 bytes = (unsigned char *) (valaddr + offset);
14f9c5c9 2001 }
d69fe07e 2002 else if (value_lazy (obj))
14f9c5c9
AS
2003 {
2004 v = value_at (type,
df407dfe 2005 VALUE_ADDRESS (obj) + value_offset (obj) + offset);
d2e4a39e 2006 bytes = (unsigned char *) alloca (len);
14f9c5c9
AS
2007 read_memory (VALUE_ADDRESS (v), bytes, len);
2008 }
d2e4a39e 2009 else
14f9c5c9
AS
2010 {
2011 v = allocate_value (type);
0fd88904 2012 bytes = (unsigned char *) value_contents (obj) + offset;
14f9c5c9 2013 }
d2e4a39e
AS
2014
2015 if (obj != NULL)
14f9c5c9
AS
2016 {
2017 VALUE_LVAL (v) = VALUE_LVAL (obj);
2018 if (VALUE_LVAL (obj) == lval_internalvar)
4c4b4cd2 2019 VALUE_LVAL (v) = lval_internalvar_component;
df407dfe 2020 VALUE_ADDRESS (v) = VALUE_ADDRESS (obj) + value_offset (obj) + offset;
9bbda503
AC
2021 set_value_bitpos (v, bit_offset + value_bitpos (obj));
2022 set_value_bitsize (v, bit_size);
df407dfe 2023 if (value_bitpos (v) >= HOST_CHAR_BIT)
4c4b4cd2
PH
2024 {
2025 VALUE_ADDRESS (v) += 1;
9bbda503 2026 set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
4c4b4cd2 2027 }
14f9c5c9
AS
2028 }
2029 else
9bbda503 2030 set_value_bitsize (v, bit_size);
0fd88904 2031 unpacked = (unsigned char *) value_contents (v);
14f9c5c9
AS
2032
2033 srcBitsLeft = bit_size;
2034 nsrc = len;
2035 ntarg = TYPE_LENGTH (type);
2036 sign = 0;
2037 if (bit_size == 0)
2038 {
2039 memset (unpacked, 0, TYPE_LENGTH (type));
2040 return v;
2041 }
2042 else if (BITS_BIG_ENDIAN)
2043 {
d2e4a39e 2044 src = len - 1;
1265e4aa
JB
2045 if (has_negatives (type)
2046 && ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
4c4b4cd2 2047 sign = ~0;
d2e4a39e
AS
2048
2049 unusedLS =
4c4b4cd2
PH
2050 (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
2051 % HOST_CHAR_BIT;
14f9c5c9
AS
2052
2053 switch (TYPE_CODE (type))
4c4b4cd2
PH
2054 {
2055 case TYPE_CODE_ARRAY:
2056 case TYPE_CODE_UNION:
2057 case TYPE_CODE_STRUCT:
2058 /* Non-scalar values must be aligned at a byte boundary... */
2059 accumSize =
2060 (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
2061 /* ... And are placed at the beginning (most-significant) bytes
2062 of the target. */
529cad9c 2063 targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
4c4b4cd2
PH
2064 break;
2065 default:
2066 accumSize = 0;
2067 targ = TYPE_LENGTH (type) - 1;
2068 break;
2069 }
14f9c5c9 2070 }
d2e4a39e 2071 else
14f9c5c9
AS
2072 {
2073 int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
2074
2075 src = targ = 0;
2076 unusedLS = bit_offset;
2077 accumSize = 0;
2078
d2e4a39e 2079 if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
4c4b4cd2 2080 sign = ~0;
14f9c5c9 2081 }
d2e4a39e 2082
14f9c5c9
AS
2083 accum = 0;
2084 while (nsrc > 0)
2085 {
2086 /* Mask for removing bits of the next source byte that are not
4c4b4cd2 2087 part of the value. */
d2e4a39e 2088 unsigned int unusedMSMask =
4c4b4cd2
PH
2089 (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
2090 1;
2091 /* Sign-extend bits for this byte. */
14f9c5c9 2092 unsigned int signMask = sign & ~unusedMSMask;
d2e4a39e 2093 accum |=
4c4b4cd2 2094 (((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
14f9c5c9 2095 accumSize += HOST_CHAR_BIT - unusedLS;
d2e4a39e 2096 if (accumSize >= HOST_CHAR_BIT)
4c4b4cd2
PH
2097 {
2098 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2099 accumSize -= HOST_CHAR_BIT;
2100 accum >>= HOST_CHAR_BIT;
2101 ntarg -= 1;
2102 targ += delta;
2103 }
14f9c5c9
AS
2104 srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
2105 unusedLS = 0;
2106 nsrc -= 1;
2107 src += delta;
2108 }
2109 while (ntarg > 0)
2110 {
2111 accum |= sign << accumSize;
2112 unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
2113 accumSize -= HOST_CHAR_BIT;
2114 accum >>= HOST_CHAR_BIT;
2115 ntarg -= 1;
2116 targ += delta;
2117 }
2118
2119 return v;
2120}
d2e4a39e 2121
14f9c5c9
AS
2122/* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2123 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
4c4b4cd2 2124 not overlap. */
14f9c5c9 2125static void
fc1a4b47 2126move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
0fd88904 2127 int src_offset, int n)
14f9c5c9
AS
2128{
2129 unsigned int accum, mask;
2130 int accum_bits, chunk_size;
2131
2132 target += targ_offset / HOST_CHAR_BIT;
2133 targ_offset %= HOST_CHAR_BIT;
2134 source += src_offset / HOST_CHAR_BIT;
2135 src_offset %= HOST_CHAR_BIT;
d2e4a39e 2136 if (BITS_BIG_ENDIAN)
14f9c5c9
AS
2137 {
2138 accum = (unsigned char) *source;
2139 source += 1;
2140 accum_bits = HOST_CHAR_BIT - src_offset;
2141
d2e4a39e 2142 while (n > 0)
4c4b4cd2
PH
2143 {
2144 int unused_right;
2145 accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
2146 accum_bits += HOST_CHAR_BIT;
2147 source += 1;
2148 chunk_size = HOST_CHAR_BIT - targ_offset;
2149 if (chunk_size > n)
2150 chunk_size = n;
2151 unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
2152 mask = ((1 << chunk_size) - 1) << unused_right;
2153 *target =
2154 (*target & ~mask)
2155 | ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
2156 n -= chunk_size;
2157 accum_bits -= chunk_size;
2158 target += 1;
2159 targ_offset = 0;
2160 }
14f9c5c9
AS
2161 }
2162 else
2163 {
2164 accum = (unsigned char) *source >> src_offset;
2165 source += 1;
2166 accum_bits = HOST_CHAR_BIT - src_offset;
2167
d2e4a39e 2168 while (n > 0)
4c4b4cd2
PH
2169 {
2170 accum = accum + ((unsigned char) *source << accum_bits);
2171 accum_bits += HOST_CHAR_BIT;
2172 source += 1;
2173 chunk_size = HOST_CHAR_BIT - targ_offset;
2174 if (chunk_size > n)
2175 chunk_size = n;
2176 mask = ((1 << chunk_size) - 1) << targ_offset;
2177 *target = (*target & ~mask) | ((accum << targ_offset) & mask);
2178 n -= chunk_size;
2179 accum_bits -= chunk_size;
2180 accum >>= chunk_size;
2181 target += 1;
2182 targ_offset = 0;
2183 }
14f9c5c9
AS
2184 }
2185}
2186
14f9c5c9
AS
2187/* Store the contents of FROMVAL into the location of TOVAL.
2188 Return a new value with the location of TOVAL and contents of
2189 FROMVAL. Handles assignment into packed fields that have
4c4b4cd2 2190 floating-point or non-scalar types. */
14f9c5c9 2191
d2e4a39e
AS
2192static struct value *
2193ada_value_assign (struct value *toval, struct value *fromval)
14f9c5c9 2194{
df407dfe
AC
2195 struct type *type = value_type (toval);
2196 int bits = value_bitsize (toval);
14f9c5c9 2197
52ce6436
PH
2198 toval = ada_coerce_ref (toval);
2199 fromval = ada_coerce_ref (fromval);
2200
2201 if (ada_is_direct_array_type (value_type (toval)))
2202 toval = ada_coerce_to_simple_array (toval);
2203 if (ada_is_direct_array_type (value_type (fromval)))
2204 fromval = ada_coerce_to_simple_array (fromval);
2205
88e3b34b 2206 if (!deprecated_value_modifiable (toval))
323e0a4a 2207 error (_("Left operand of assignment is not a modifiable lvalue."));
14f9c5c9 2208
d2e4a39e 2209 if (VALUE_LVAL (toval) == lval_memory
14f9c5c9 2210 && bits > 0
d2e4a39e 2211 && (TYPE_CODE (type) == TYPE_CODE_FLT
4c4b4cd2 2212 || TYPE_CODE (type) == TYPE_CODE_STRUCT))
14f9c5c9 2213 {
df407dfe
AC
2214 int len = (value_bitpos (toval)
2215 + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
d2e4a39e
AS
2216 char *buffer = (char *) alloca (len);
2217 struct value *val;
52ce6436 2218 CORE_ADDR to_addr = VALUE_ADDRESS (toval) + value_offset (toval);
14f9c5c9
AS
2219
2220 if (TYPE_CODE (type) == TYPE_CODE_FLT)
4c4b4cd2 2221 fromval = value_cast (type, fromval);
14f9c5c9 2222
52ce6436 2223 read_memory (to_addr, buffer, len);
14f9c5c9 2224 if (BITS_BIG_ENDIAN)
df407dfe 2225 move_bits (buffer, value_bitpos (toval),
0fd88904 2226 value_contents (fromval),
df407dfe 2227 TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT -
4c4b4cd2 2228 bits, bits);
14f9c5c9 2229 else
0fd88904 2230 move_bits (buffer, value_bitpos (toval), value_contents (fromval),
4c4b4cd2 2231 0, bits);
52ce6436
PH
2232 write_memory (to_addr, buffer, len);
2233 if (deprecated_memory_changed_hook)
2234 deprecated_memory_changed_hook (to_addr, len);
2235
14f9c5c9 2236 val = value_copy (toval);
0fd88904 2237 memcpy (value_contents_raw (val), value_contents (fromval),
4c4b4cd2 2238 TYPE_LENGTH (type));
04624583 2239 deprecated_set_value_type (val, type);
d2e4a39e 2240
14f9c5c9
AS
2241 return val;
2242 }
2243
2244 return value_assign (toval, fromval);
2245}
2246
2247
52ce6436
PH
2248/* Given that COMPONENT is a memory lvalue that is part of the lvalue
2249 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2250 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2251 * COMPONENT, and not the inferior's memory. The current contents
2252 * of COMPONENT are ignored. */
2253static void
2254value_assign_to_component (struct value *container, struct value *component,
2255 struct value *val)
2256{
2257 LONGEST offset_in_container =
2258 (LONGEST) (VALUE_ADDRESS (component) + value_offset (component)
2259 - VALUE_ADDRESS (container) - value_offset (container));
2260 int bit_offset_in_container =
2261 value_bitpos (component) - value_bitpos (container);
2262 int bits;
2263
2264 val = value_cast (value_type (component), val);
2265
2266 if (value_bitsize (component) == 0)
2267 bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
2268 else
2269 bits = value_bitsize (component);
2270
2271 if (BITS_BIG_ENDIAN)
2272 move_bits (value_contents_writeable (container) + offset_in_container,
2273 value_bitpos (container) + bit_offset_in_container,
2274 value_contents (val),
2275 TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
2276 bits);
2277 else
2278 move_bits (value_contents_writeable (container) + offset_in_container,
2279 value_bitpos (container) + bit_offset_in_container,
2280 value_contents (val), 0, bits);
2281}
2282
4c4b4cd2
PH
2283/* The value of the element of array ARR at the ARITY indices given in IND.
2284 ARR may be either a simple array, GNAT array descriptor, or pointer
14f9c5c9
AS
2285 thereto. */
2286
d2e4a39e
AS
2287struct value *
2288ada_value_subscript (struct value *arr, int arity, struct value **ind)
14f9c5c9
AS
2289{
2290 int k;
d2e4a39e
AS
2291 struct value *elt;
2292 struct type *elt_type;
14f9c5c9
AS
2293
2294 elt = ada_coerce_to_simple_array (arr);
2295
df407dfe 2296 elt_type = ada_check_typedef (value_type (elt));
d2e4a39e 2297 if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
14f9c5c9
AS
2298 && TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
2299 return value_subscript_packed (elt, arity, ind);
2300
2301 for (k = 0; k < arity; k += 1)
2302 {
2303 if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
323e0a4a 2304 error (_("too many subscripts (%d expected)"), k);
14f9c5c9
AS
2305 elt = value_subscript (elt, value_pos_atr (ind[k]));
2306 }
2307 return elt;
2308}
2309
2310/* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2311 value of the element of *ARR at the ARITY indices given in
4c4b4cd2 2312 IND. Does not read the entire array into memory. */
14f9c5c9 2313
d2e4a39e
AS
2314struct value *
2315ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
4c4b4cd2 2316 struct value **ind)
14f9c5c9
AS
2317{
2318 int k;
2319
2320 for (k = 0; k < arity; k += 1)
2321 {
2322 LONGEST lwb, upb;
d2e4a39e 2323 struct value *idx;
14f9c5c9
AS
2324
2325 if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
323e0a4a 2326 error (_("too many subscripts (%d expected)"), k);
d2e4a39e 2327 arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
4c4b4cd2 2328 value_copy (arr));
14f9c5c9 2329 get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
4c4b4cd2
PH
2330 idx = value_pos_atr (ind[k]);
2331 if (lwb != 0)
2332 idx = value_sub (idx, value_from_longest (builtin_type_int, lwb));
14f9c5c9
AS
2333 arr = value_add (arr, idx);
2334 type = TYPE_TARGET_TYPE (type);
2335 }
2336
2337 return value_ind (arr);
2338}
2339
0b5d8877
PH
2340/* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2341 actual type of ARRAY_PTR is ignored), returns a reference to
2342 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2343 bound of this array is LOW, as per Ada rules. */
2344static struct value *
6c038f32 2345ada_value_slice_ptr (struct value *array_ptr, struct type *type,
0b5d8877
PH
2346 int low, int high)
2347{
6c038f32 2348 CORE_ADDR base = value_as_address (array_ptr)
0b5d8877
PH
2349 + ((low - TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type)))
2350 * TYPE_LENGTH (TYPE_TARGET_TYPE (type)));
6c038f32
PH
2351 struct type *index_type =
2352 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)),
0b5d8877 2353 low, high);
6c038f32 2354 struct type *slice_type =
0b5d8877
PH
2355 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
2356 return value_from_pointer (lookup_reference_type (slice_type), base);
2357}
2358
2359
2360static struct value *
2361ada_value_slice (struct value *array, int low, int high)
2362{
df407dfe 2363 struct type *type = value_type (array);
6c038f32 2364 struct type *index_type =
0b5d8877 2365 create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
6c038f32 2366 struct type *slice_type =
0b5d8877 2367 create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
6c038f32 2368 return value_cast (slice_type, value_slice (array, low, high - low + 1));
0b5d8877
PH
2369}
2370
14f9c5c9
AS
2371/* If type is a record type in the form of a standard GNAT array
2372 descriptor, returns the number of dimensions for type. If arr is a
2373 simple array, returns the number of "array of"s that prefix its
4c4b4cd2 2374 type designation. Otherwise, returns 0. */
14f9c5c9
AS
2375
2376int
d2e4a39e 2377ada_array_arity (struct type *type)
14f9c5c9
AS
2378{
2379 int arity;
2380
2381 if (type == NULL)
2382 return 0;
2383
2384 type = desc_base_type (type);
2385
2386 arity = 0;
d2e4a39e 2387 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
14f9c5c9 2388 return desc_arity (desc_bounds_type (type));
d2e4a39e
AS
2389 else
2390 while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
14f9c5c9 2391 {
4c4b4cd2 2392 arity += 1;
61ee279c 2393 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
14f9c5c9 2394 }
d2e4a39e 2395
14f9c5c9
AS
2396 return arity;
2397}
2398
2399/* If TYPE is a record type in the form of a standard GNAT array
2400 descriptor or a simple array type, returns the element type for
2401 TYPE after indexing by NINDICES indices, or by all indices if
4c4b4cd2 2402 NINDICES is -1. Otherwise, returns NULL. */
14f9c5c9 2403
d2e4a39e
AS
2404struct type *
2405ada_array_element_type (struct type *type, int nindices)
14f9c5c9
AS
2406{
2407 type = desc_base_type (type);
2408
d2e4a39e 2409 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
14f9c5c9
AS
2410 {
2411 int k;
d2e4a39e 2412 struct type *p_array_type;
14f9c5c9
AS
2413
2414 p_array_type = desc_data_type (type);
2415
2416 k = ada_array_arity (type);
2417 if (k == 0)
4c4b4cd2 2418 return NULL;
d2e4a39e 2419
4c4b4cd2 2420 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
14f9c5c9 2421 if (nindices >= 0 && k > nindices)
4c4b4cd2 2422 k = nindices;
14f9c5c9 2423 p_array_type = TYPE_TARGET_TYPE (p_array_type);
d2e4a39e 2424 while (k > 0 && p_array_type != NULL)
4c4b4cd2 2425 {
61ee279c 2426 p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
4c4b4cd2
PH
2427 k -= 1;
2428 }
14f9c5c9
AS
2429 return p_array_type;
2430 }
2431 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
2432 {
2433 while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
4c4b4cd2
PH
2434 {
2435 type = TYPE_TARGET_TYPE (type);
2436 nindices -= 1;
2437 }
14f9c5c9
AS
2438 return type;
2439 }
2440
2441 return NULL;
2442}
2443
4c4b4cd2
PH
2444/* The type of nth index in arrays of given type (n numbering from 1).
2445 Does not examine memory. */
14f9c5c9 2446
d2e4a39e
AS
2447struct type *
2448ada_index_type (struct type *type, int n)
14f9c5c9 2449{
4c4b4cd2
PH
2450 struct type *result_type;
2451
14f9c5c9
AS
2452 type = desc_base_type (type);
2453
2454 if (n > ada_array_arity (type))
2455 return NULL;
2456
4c4b4cd2 2457 if (ada_is_simple_array_type (type))
14f9c5c9
AS
2458 {
2459 int i;
2460
2461 for (i = 1; i < n; i += 1)
4c4b4cd2
PH
2462 type = TYPE_TARGET_TYPE (type);
2463 result_type = TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 0));
2464 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2465 has a target type of TYPE_CODE_UNDEF. We compensate here, but
76a01679
JB
2466 perhaps stabsread.c would make more sense. */
2467 if (result_type == NULL || TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
2468 result_type = builtin_type_int;
14f9c5c9 2469
4c4b4cd2 2470 return result_type;
14f9c5c9 2471 }
d2e4a39e 2472 else
14f9c5c9
AS
2473 return desc_index_type (desc_bounds_type (type), n);
2474}
2475
2476/* Given that arr is an array type, returns the lower bound of the
2477 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
4c4b4cd2
PH
2478 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2479 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2480 bounds type. It works for other arrays with bounds supplied by
2481 run-time quantities other than discriminants. */
14f9c5c9 2482
abb68b3e 2483static LONGEST
d2e4a39e 2484ada_array_bound_from_type (struct type * arr_type, int n, int which,
4c4b4cd2 2485 struct type ** typep)
14f9c5c9 2486{
d2e4a39e
AS
2487 struct type *type;
2488 struct type *index_type_desc;
14f9c5c9
AS
2489
2490 if (ada_is_packed_array_type (arr_type))
2491 arr_type = decode_packed_array_type (arr_type);
2492
4c4b4cd2 2493 if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
14f9c5c9
AS
2494 {
2495 if (typep != NULL)
4c4b4cd2 2496 *typep = builtin_type_int;
d2e4a39e 2497 return (LONGEST) - which;
14f9c5c9
AS
2498 }
2499
2500 if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
2501 type = TYPE_TARGET_TYPE (arr_type);
2502 else
2503 type = arr_type;
2504
2505 index_type_desc = ada_find_parallel_type (type, "___XA");
d2e4a39e 2506 if (index_type_desc == NULL)
14f9c5c9 2507 {
d2e4a39e 2508 struct type *index_type;
14f9c5c9 2509
d2e4a39e 2510 while (n > 1)
4c4b4cd2
PH
2511 {
2512 type = TYPE_TARGET_TYPE (type);
2513 n -= 1;
2514 }
14f9c5c9 2515
abb68b3e 2516 index_type = TYPE_INDEX_TYPE (type);
14f9c5c9 2517 if (typep != NULL)
4c4b4cd2 2518 *typep = index_type;
abb68b3e
JB
2519
2520 /* The index type is either a range type or an enumerated type.
2521 For the range type, we have some macros that allow us to
2522 extract the value of the low and high bounds. But they
2523 do now work for enumerated types. The expressions used
2524 below work for both range and enum types. */
d2e4a39e 2525 return
4c4b4cd2 2526 (LONGEST) (which == 0
abb68b3e
JB
2527 ? TYPE_FIELD_BITPOS (index_type, 0)
2528 : TYPE_FIELD_BITPOS (index_type,
2529 TYPE_NFIELDS (index_type) - 1));
14f9c5c9 2530 }
d2e4a39e 2531 else
14f9c5c9 2532 {
d2e4a39e 2533 struct type *index_type =
4c4b4cd2
PH
2534 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, n - 1),
2535 NULL, TYPE_OBJFILE (arr_type));
abb68b3e 2536
14f9c5c9 2537 if (typep != NULL)
abb68b3e
JB
2538 *typep = index_type;
2539
d2e4a39e 2540 return
4c4b4cd2
PH
2541 (LONGEST) (which == 0
2542 ? TYPE_LOW_BOUND (index_type)
2543 : TYPE_HIGH_BOUND (index_type));
14f9c5c9
AS
2544 }
2545}
2546
2547/* Given that arr is an array value, returns the lower bound of the
abb68b3e
JB
2548 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2549 WHICH is 1. This routine will also work for arrays with bounds
4c4b4cd2 2550 supplied by run-time quantities other than discriminants. */
14f9c5c9 2551
d2e4a39e 2552struct value *
4dc81987 2553ada_array_bound (struct value *arr, int n, int which)
14f9c5c9 2554{
df407dfe 2555 struct type *arr_type = value_type (arr);
14f9c5c9
AS
2556
2557 if (ada_is_packed_array_type (arr_type))
2558 return ada_array_bound (decode_packed_array (arr), n, which);
4c4b4cd2 2559 else if (ada_is_simple_array_type (arr_type))
14f9c5c9 2560 {
d2e4a39e 2561 struct type *type;
14f9c5c9
AS
2562 LONGEST v = ada_array_bound_from_type (arr_type, n, which, &type);
2563 return value_from_longest (type, v);
2564 }
2565 else
2566 return desc_one_bound (desc_bounds (arr), n, which);
2567}
2568
2569/* Given that arr is an array value, returns the length of the
2570 nth index. This routine will also work for arrays with bounds
4c4b4cd2
PH
2571 supplied by run-time quantities other than discriminants.
2572 Does not work for arrays indexed by enumeration types with representation
2573 clauses at the moment. */
14f9c5c9 2574
d2e4a39e
AS
2575struct value *
2576ada_array_length (struct value *arr, int n)
14f9c5c9 2577{
df407dfe 2578 struct type *arr_type = ada_check_typedef (value_type (arr));
14f9c5c9
AS
2579
2580 if (ada_is_packed_array_type (arr_type))
2581 return ada_array_length (decode_packed_array (arr), n);
2582
4c4b4cd2 2583 if (ada_is_simple_array_type (arr_type))
14f9c5c9 2584 {
d2e4a39e 2585 struct type *type;
14f9c5c9 2586 LONGEST v =
4c4b4cd2
PH
2587 ada_array_bound_from_type (arr_type, n, 1, &type) -
2588 ada_array_bound_from_type (arr_type, n, 0, NULL) + 1;
14f9c5c9
AS
2589 return value_from_longest (type, v);
2590 }
2591 else
d2e4a39e 2592 return
72d5681a 2593 value_from_longest (builtin_type_int,
4c4b4cd2
PH
2594 value_as_long (desc_one_bound (desc_bounds (arr),
2595 n, 1))
2596 - value_as_long (desc_one_bound (desc_bounds (arr),
2597 n, 0)) + 1);
2598}
2599
2600/* An empty array whose type is that of ARR_TYPE (an array type),
2601 with bounds LOW to LOW-1. */
2602
2603static struct value *
2604empty_array (struct type *arr_type, int low)
2605{
6c038f32 2606 struct type *index_type =
0b5d8877
PH
2607 create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type)),
2608 low, low - 1);
2609 struct type *elt_type = ada_array_element_type (arr_type, 1);
2610 return allocate_value (create_array_type (NULL, elt_type, index_type));
14f9c5c9 2611}
14f9c5c9 2612\f
d2e4a39e 2613
4c4b4cd2 2614 /* Name resolution */
14f9c5c9 2615
4c4b4cd2
PH
2616/* The "decoded" name for the user-definable Ada operator corresponding
2617 to OP. */
14f9c5c9 2618
d2e4a39e 2619static const char *
4c4b4cd2 2620ada_decoded_op_name (enum exp_opcode op)
14f9c5c9
AS
2621{
2622 int i;
2623
4c4b4cd2 2624 for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
14f9c5c9
AS
2625 {
2626 if (ada_opname_table[i].op == op)
4c4b4cd2 2627 return ada_opname_table[i].decoded;
14f9c5c9 2628 }
323e0a4a 2629 error (_("Could not find operator name for opcode"));
14f9c5c9
AS
2630}
2631
2632
4c4b4cd2
PH
2633/* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2634 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2635 undefined namespace) and converts operators that are
2636 user-defined into appropriate function calls. If CONTEXT_TYPE is
14f9c5c9
AS
2637 non-null, it provides a preferred result type [at the moment, only
2638 type void has any effect---causing procedures to be preferred over
2639 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
4c4b4cd2 2640 return type is preferred. May change (expand) *EXP. */
14f9c5c9 2641
4c4b4cd2
PH
2642static void
2643resolve (struct expression **expp, int void_context_p)
14f9c5c9
AS
2644{
2645 int pc;
2646 pc = 0;
4c4b4cd2 2647 resolve_subexp (expp, &pc, 1, void_context_p ? builtin_type_void : NULL);
14f9c5c9
AS
2648}
2649
4c4b4cd2
PH
2650/* Resolve the operator of the subexpression beginning at
2651 position *POS of *EXPP. "Resolving" consists of replacing
2652 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2653 with their resolutions, replacing built-in operators with
2654 function calls to user-defined operators, where appropriate, and,
2655 when DEPROCEDURE_P is non-zero, converting function-valued variables
2656 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2657 are as in ada_resolve, above. */
14f9c5c9 2658
d2e4a39e 2659static struct value *
4c4b4cd2 2660resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
76a01679 2661 struct type *context_type)
14f9c5c9
AS
2662{
2663 int pc = *pos;
2664 int i;
4c4b4cd2 2665 struct expression *exp; /* Convenience: == *expp. */
14f9c5c9 2666 enum exp_opcode op = (*expp)->elts[pc].opcode;
4c4b4cd2
PH
2667 struct value **argvec; /* Vector of operand types (alloca'ed). */
2668 int nargs; /* Number of operands. */
52ce6436 2669 int oplen;
14f9c5c9
AS
2670
2671 argvec = NULL;
2672 nargs = 0;
2673 exp = *expp;
2674
52ce6436
PH
2675 /* Pass one: resolve operands, saving their types and updating *pos,
2676 if needed. */
14f9c5c9
AS
2677 switch (op)
2678 {
4c4b4cd2
PH
2679 case OP_FUNCALL:
2680 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
76a01679
JB
2681 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
2682 *pos += 7;
4c4b4cd2
PH
2683 else
2684 {
2685 *pos += 3;
2686 resolve_subexp (expp, pos, 0, NULL);
2687 }
2688 nargs = longest_to_int (exp->elts[pc + 1].longconst);
14f9c5c9
AS
2689 break;
2690
14f9c5c9 2691 case UNOP_ADDR:
4c4b4cd2
PH
2692 *pos += 1;
2693 resolve_subexp (expp, pos, 0, NULL);
2694 break;
2695
52ce6436
PH
2696 case UNOP_QUAL:
2697 *pos += 3;
2698 resolve_subexp (expp, pos, 1, exp->elts[pc + 1].type);
4c4b4cd2
PH
2699 break;
2700
52ce6436 2701 case OP_ATR_MODULUS:
4c4b4cd2
PH
2702 case OP_ATR_SIZE:
2703 case OP_ATR_TAG:
4c4b4cd2
PH
2704 case OP_ATR_FIRST:
2705 case OP_ATR_LAST:
2706 case OP_ATR_LENGTH:
2707 case OP_ATR_POS:
2708 case OP_ATR_VAL:
4c4b4cd2
PH
2709 case OP_ATR_MIN:
2710 case OP_ATR_MAX:
52ce6436
PH
2711 case TERNOP_IN_RANGE:
2712 case BINOP_IN_BOUNDS:
2713 case UNOP_IN_RANGE:
2714 case OP_AGGREGATE:
2715 case OP_OTHERS:
2716 case OP_CHOICES:
2717 case OP_POSITIONAL:
2718 case OP_DISCRETE_RANGE:
2719 case OP_NAME:
2720 ada_forward_operator_length (exp, pc, &oplen, &nargs);
2721 *pos += oplen;
14f9c5c9
AS
2722 break;
2723
2724 case BINOP_ASSIGN:
2725 {
4c4b4cd2
PH
2726 struct value *arg1;
2727
2728 *pos += 1;
2729 arg1 = resolve_subexp (expp, pos, 0, NULL);
2730 if (arg1 == NULL)
2731 resolve_subexp (expp, pos, 1, NULL);
2732 else
df407dfe 2733 resolve_subexp (expp, pos, 1, value_type (arg1));
4c4b4cd2 2734 break;
14f9c5c9
AS
2735 }
2736
4c4b4cd2 2737 case UNOP_CAST:
4c4b4cd2
PH
2738 *pos += 3;
2739 nargs = 1;
2740 break;
14f9c5c9 2741
4c4b4cd2
PH
2742 case BINOP_ADD:
2743 case BINOP_SUB:
2744 case BINOP_MUL:
2745 case BINOP_DIV:
2746 case BINOP_REM:
2747 case BINOP_MOD:
2748 case BINOP_EXP:
2749 case BINOP_CONCAT:
2750 case BINOP_LOGICAL_AND:
2751 case BINOP_LOGICAL_OR:
2752 case BINOP_BITWISE_AND:
2753 case BINOP_BITWISE_IOR:
2754 case BINOP_BITWISE_XOR:
14f9c5c9 2755
4c4b4cd2
PH
2756 case BINOP_EQUAL:
2757 case BINOP_NOTEQUAL:
2758 case BINOP_LESS:
2759 case BINOP_GTR:
2760 case BINOP_LEQ:
2761 case BINOP_GEQ:
14f9c5c9 2762
4c4b4cd2
PH
2763 case BINOP_REPEAT:
2764 case BINOP_SUBSCRIPT:
2765 case BINOP_COMMA:
40c8aaa9
JB
2766 *pos += 1;
2767 nargs = 2;
2768 break;
14f9c5c9 2769
4c4b4cd2
PH
2770 case UNOP_NEG:
2771 case UNOP_PLUS:
2772 case UNOP_LOGICAL_NOT:
2773 case UNOP_ABS:
2774 case UNOP_IND:
2775 *pos += 1;
2776 nargs = 1;
2777 break;
14f9c5c9 2778
4c4b4cd2
PH
2779 case OP_LONG:
2780 case OP_DOUBLE:
2781 case OP_VAR_VALUE:
2782 *pos += 4;
2783 break;
14f9c5c9 2784
4c4b4cd2
PH
2785 case OP_TYPE:
2786 case OP_BOOL:
2787 case OP_LAST:
4c4b4cd2
PH
2788 case OP_INTERNALVAR:
2789 *pos += 3;
2790 break;
14f9c5c9 2791
4c4b4cd2
PH
2792 case UNOP_MEMVAL:
2793 *pos += 3;
2794 nargs = 1;
2795 break;
2796
67f3407f
DJ
2797 case OP_REGISTER:
2798 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
2799 break;
2800
4c4b4cd2
PH
2801 case STRUCTOP_STRUCT:
2802 *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
2803 nargs = 1;
2804 break;
2805
4c4b4cd2 2806 case TERNOP_SLICE:
4c4b4cd2
PH
2807 *pos += 1;
2808 nargs = 3;
2809 break;
2810
52ce6436 2811 case OP_STRING:
14f9c5c9 2812 break;
4c4b4cd2
PH
2813
2814 default:
323e0a4a 2815 error (_("Unexpected operator during name resolution"));
14f9c5c9
AS
2816 }
2817
76a01679 2818 argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
4c4b4cd2
PH
2819 for (i = 0; i < nargs; i += 1)
2820 argvec[i] = resolve_subexp (expp, pos, 1, NULL);
2821 argvec[i] = NULL;
2822 exp = *expp;
2823
2824 /* Pass two: perform any resolution on principal operator. */
14f9c5c9
AS
2825 switch (op)
2826 {
2827 default:
2828 break;
2829
14f9c5c9 2830 case OP_VAR_VALUE:
4c4b4cd2 2831 if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
76a01679
JB
2832 {
2833 struct ada_symbol_info *candidates;
2834 int n_candidates;
2835
2836 n_candidates =
2837 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2838 (exp->elts[pc + 2].symbol),
2839 exp->elts[pc + 1].block, VAR_DOMAIN,
2840 &candidates);
2841
2842 if (n_candidates > 1)
2843 {
2844 /* Types tend to get re-introduced locally, so if there
2845 are any local symbols that are not types, first filter
2846 out all types. */
2847 int j;
2848 for (j = 0; j < n_candidates; j += 1)
2849 switch (SYMBOL_CLASS (candidates[j].sym))
2850 {
2851 case LOC_REGISTER:
2852 case LOC_ARG:
2853 case LOC_REF_ARG:
2854 case LOC_REGPARM:
2855 case LOC_REGPARM_ADDR:
2856 case LOC_LOCAL:
2857 case LOC_LOCAL_ARG:
2858 case LOC_BASEREG:
2859 case LOC_BASEREG_ARG:
2860 case LOC_COMPUTED:
2861 case LOC_COMPUTED_ARG:
2862 goto FoundNonType;
2863 default:
2864 break;
2865 }
2866 FoundNonType:
2867 if (j < n_candidates)
2868 {
2869 j = 0;
2870 while (j < n_candidates)
2871 {
2872 if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
2873 {
2874 candidates[j] = candidates[n_candidates - 1];
2875 n_candidates -= 1;
2876 }
2877 else
2878 j += 1;
2879 }
2880 }
2881 }
2882
2883 if (n_candidates == 0)
323e0a4a 2884 error (_("No definition found for %s"),
76a01679
JB
2885 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2886 else if (n_candidates == 1)
2887 i = 0;
2888 else if (deprocedure_p
2889 && !is_nonfunction (candidates, n_candidates))
2890 {
06d5cf63
JB
2891 i = ada_resolve_function
2892 (candidates, n_candidates, NULL, 0,
2893 SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
2894 context_type);
76a01679 2895 if (i < 0)
323e0a4a 2896 error (_("Could not find a match for %s"),
76a01679
JB
2897 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2898 }
2899 else
2900 {
323e0a4a 2901 printf_filtered (_("Multiple matches for %s\n"),
76a01679
JB
2902 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
2903 user_select_syms (candidates, n_candidates, 1);
2904 i = 0;
2905 }
2906
2907 exp->elts[pc + 1].block = candidates[i].block;
2908 exp->elts[pc + 2].symbol = candidates[i].sym;
1265e4aa
JB
2909 if (innermost_block == NULL
2910 || contained_in (candidates[i].block, innermost_block))
76a01679
JB
2911 innermost_block = candidates[i].block;
2912 }
2913
2914 if (deprocedure_p
2915 && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
2916 == TYPE_CODE_FUNC))
2917 {
2918 replace_operator_with_call (expp, pc, 0, 0,
2919 exp->elts[pc + 2].symbol,
2920 exp->elts[pc + 1].block);
2921 exp = *expp;
2922 }
14f9c5c9
AS
2923 break;
2924
2925 case OP_FUNCALL:
2926 {
4c4b4cd2 2927 if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
76a01679 2928 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
4c4b4cd2
PH
2929 {
2930 struct ada_symbol_info *candidates;
2931 int n_candidates;
2932
2933 n_candidates =
76a01679
JB
2934 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2935 (exp->elts[pc + 5].symbol),
2936 exp->elts[pc + 4].block, VAR_DOMAIN,
2937 &candidates);
4c4b4cd2
PH
2938 if (n_candidates == 1)
2939 i = 0;
2940 else
2941 {
06d5cf63
JB
2942 i = ada_resolve_function
2943 (candidates, n_candidates,
2944 argvec, nargs,
2945 SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
2946 context_type);
4c4b4cd2 2947 if (i < 0)
323e0a4a 2948 error (_("Could not find a match for %s"),
4c4b4cd2
PH
2949 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
2950 }
2951
2952 exp->elts[pc + 4].block = candidates[i].block;
2953 exp->elts[pc + 5].symbol = candidates[i].sym;
1265e4aa
JB
2954 if (innermost_block == NULL
2955 || contained_in (candidates[i].block, innermost_block))
4c4b4cd2
PH
2956 innermost_block = candidates[i].block;
2957 }
14f9c5c9
AS
2958 }
2959 break;
2960 case BINOP_ADD:
2961 case BINOP_SUB:
2962 case BINOP_MUL:
2963 case BINOP_DIV:
2964 case BINOP_REM:
2965 case BINOP_MOD:
2966 case BINOP_CONCAT:
2967 case BINOP_BITWISE_AND:
2968 case BINOP_BITWISE_IOR:
2969 case BINOP_BITWISE_XOR:
2970 case BINOP_EQUAL:
2971 case BINOP_NOTEQUAL:
2972 case BINOP_LESS:
2973 case BINOP_GTR:
2974 case BINOP_LEQ:
2975 case BINOP_GEQ:
2976 case BINOP_EXP:
2977 case UNOP_NEG:
2978 case UNOP_PLUS:
2979 case UNOP_LOGICAL_NOT:
2980 case UNOP_ABS:
2981 if (possible_user_operator_p (op, argvec))
4c4b4cd2
PH
2982 {
2983 struct ada_symbol_info *candidates;
2984 int n_candidates;
2985
2986 n_candidates =
2987 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
2988 (struct block *) NULL, VAR_DOMAIN,
2989 &candidates);
2990 i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
76a01679 2991 ada_decoded_op_name (op), NULL);
4c4b4cd2
PH
2992 if (i < 0)
2993 break;
2994
76a01679
JB
2995 replace_operator_with_call (expp, pc, nargs, 1,
2996 candidates[i].sym, candidates[i].block);
4c4b4cd2
PH
2997 exp = *expp;
2998 }
14f9c5c9 2999 break;
4c4b4cd2
PH
3000
3001 case OP_TYPE:
b3dbf008 3002 case OP_REGISTER:
4c4b4cd2 3003 return NULL;
14f9c5c9
AS
3004 }
3005
3006 *pos = pc;
3007 return evaluate_subexp_type (exp, pos);
3008}
3009
3010/* Return non-zero if formal type FTYPE matches actual type ATYPE. If
4c4b4cd2
PH
3011 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3012 a non-pointer. A type of 'void' (which is never a valid expression type)
3013 by convention matches anything. */
14f9c5c9 3014/* The term "match" here is rather loose. The match is heuristic and
4c4b4cd2 3015 liberal. FIXME: TOO liberal, in fact. */
14f9c5c9
AS
3016
3017static int
4dc81987 3018ada_type_match (struct type *ftype, struct type *atype, int may_deref)
14f9c5c9 3019{
61ee279c
PH
3020 ftype = ada_check_typedef (ftype);
3021 atype = ada_check_typedef (atype);
14f9c5c9
AS
3022
3023 if (TYPE_CODE (ftype) == TYPE_CODE_REF)
3024 ftype = TYPE_TARGET_TYPE (ftype);
3025 if (TYPE_CODE (atype) == TYPE_CODE_REF)
3026 atype = TYPE_TARGET_TYPE (atype);
3027
d2e4a39e 3028 if (TYPE_CODE (ftype) == TYPE_CODE_VOID
14f9c5c9
AS
3029 || TYPE_CODE (atype) == TYPE_CODE_VOID)
3030 return 1;
3031
d2e4a39e 3032 switch (TYPE_CODE (ftype))
14f9c5c9
AS
3033 {
3034 default:
3035 return 1;
3036 case TYPE_CODE_PTR:
3037 if (TYPE_CODE (atype) == TYPE_CODE_PTR)
4c4b4cd2
PH
3038 return ada_type_match (TYPE_TARGET_TYPE (ftype),
3039 TYPE_TARGET_TYPE (atype), 0);
d2e4a39e 3040 else
1265e4aa
JB
3041 return (may_deref
3042 && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
14f9c5c9
AS
3043 case TYPE_CODE_INT:
3044 case TYPE_CODE_ENUM:
3045 case TYPE_CODE_RANGE:
3046 switch (TYPE_CODE (atype))
4c4b4cd2
PH
3047 {
3048 case TYPE_CODE_INT:
3049 case TYPE_CODE_ENUM:
3050 case TYPE_CODE_RANGE:
3051 return 1;
3052 default:
3053 return 0;
3054 }
14f9c5c9
AS
3055
3056 case TYPE_CODE_ARRAY:
d2e4a39e 3057 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
4c4b4cd2 3058 || ada_is_array_descriptor_type (atype));
14f9c5c9
AS
3059
3060 case TYPE_CODE_STRUCT:
4c4b4cd2
PH
3061 if (ada_is_array_descriptor_type (ftype))
3062 return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
3063 || ada_is_array_descriptor_type (atype));
14f9c5c9 3064 else
4c4b4cd2
PH
3065 return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
3066 && !ada_is_array_descriptor_type (atype));
14f9c5c9
AS
3067
3068 case TYPE_CODE_UNION:
3069 case TYPE_CODE_FLT:
3070 return (TYPE_CODE (atype) == TYPE_CODE (ftype));
3071 }
3072}
3073
3074/* Return non-zero if the formals of FUNC "sufficiently match" the
3075 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3076 may also be an enumeral, in which case it is treated as a 0-
4c4b4cd2 3077 argument function. */
14f9c5c9
AS
3078
3079static int
d2e4a39e 3080ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
14f9c5c9
AS
3081{
3082 int i;
d2e4a39e 3083 struct type *func_type = SYMBOL_TYPE (func);
14f9c5c9 3084
1265e4aa
JB
3085 if (SYMBOL_CLASS (func) == LOC_CONST
3086 && TYPE_CODE (func_type) == TYPE_CODE_ENUM)
14f9c5c9
AS
3087 return (n_actuals == 0);
3088 else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
3089 return 0;
3090
3091 if (TYPE_NFIELDS (func_type) != n_actuals)
3092 return 0;
3093
3094 for (i = 0; i < n_actuals; i += 1)
3095 {
4c4b4cd2 3096 if (actuals[i] == NULL)
76a01679
JB
3097 return 0;
3098 else
3099 {
61ee279c 3100 struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type, i));
df407dfe 3101 struct type *atype = ada_check_typedef (value_type (actuals[i]));
4c4b4cd2 3102
76a01679
JB
3103 if (!ada_type_match (ftype, atype, 1))
3104 return 0;
3105 }
14f9c5c9
AS
3106 }
3107 return 1;
3108}
3109
3110/* False iff function type FUNC_TYPE definitely does not produce a value
3111 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3112 FUNC_TYPE is not a valid function type with a non-null return type
3113 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3114
3115static int
d2e4a39e 3116return_match (struct type *func_type, struct type *context_type)
14f9c5c9 3117{
d2e4a39e 3118 struct type *return_type;
14f9c5c9
AS
3119
3120 if (func_type == NULL)
3121 return 1;
3122
4c4b4cd2
PH
3123 if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
3124 return_type = base_type (TYPE_TARGET_TYPE (func_type));
3125 else
3126 return_type = base_type (func_type);
14f9c5c9
AS
3127 if (return_type == NULL)
3128 return 1;
3129
4c4b4cd2 3130 context_type = base_type (context_type);
14f9c5c9
AS
3131
3132 if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
3133 return context_type == NULL || return_type == context_type;
3134 else if (context_type == NULL)
3135 return TYPE_CODE (return_type) != TYPE_CODE_VOID;
3136 else
3137 return TYPE_CODE (return_type) == TYPE_CODE (context_type);
3138}
3139
3140
4c4b4cd2 3141/* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
14f9c5c9 3142 function (if any) that matches the types of the NARGS arguments in
4c4b4cd2
PH
3143 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3144 that returns that type, then eliminate matches that don't. If
3145 CONTEXT_TYPE is void and there is at least one match that does not
3146 return void, eliminate all matches that do.
3147
14f9c5c9
AS
3148 Asks the user if there is more than one match remaining. Returns -1
3149 if there is no such symbol or none is selected. NAME is used
4c4b4cd2
PH
3150 solely for messages. May re-arrange and modify SYMS in
3151 the process; the index returned is for the modified vector. */
14f9c5c9 3152
4c4b4cd2
PH
3153static int
3154ada_resolve_function (struct ada_symbol_info syms[],
3155 int nsyms, struct value **args, int nargs,
3156 const char *name, struct type *context_type)
14f9c5c9
AS
3157{
3158 int k;
4c4b4cd2 3159 int m; /* Number of hits */
d2e4a39e
AS
3160 struct type *fallback;
3161 struct type *return_type;
14f9c5c9
AS
3162
3163 return_type = context_type;
3164 if (context_type == NULL)
3165 fallback = builtin_type_void;
3166 else
3167 fallback = NULL;
3168
d2e4a39e 3169 m = 0;
14f9c5c9
AS
3170 while (1)
3171 {
3172 for (k = 0; k < nsyms; k += 1)
4c4b4cd2 3173 {
61ee279c 3174 struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
4c4b4cd2
PH
3175
3176 if (ada_args_match (syms[k].sym, args, nargs)
3177 && return_match (type, return_type))
3178 {
3179 syms[m] = syms[k];
3180 m += 1;
3181 }
3182 }
14f9c5c9 3183 if (m > 0 || return_type == fallback)
4c4b4cd2 3184 break;
14f9c5c9 3185 else
4c4b4cd2 3186 return_type = fallback;
14f9c5c9
AS
3187 }
3188
3189 if (m == 0)
3190 return -1;
3191 else if (m > 1)
3192 {
323e0a4a 3193 printf_filtered (_("Multiple matches for %s\n"), name);
4c4b4cd2 3194 user_select_syms (syms, m, 1);
14f9c5c9
AS
3195 return 0;
3196 }
3197 return 0;
3198}
3199
4c4b4cd2
PH
3200/* Returns true (non-zero) iff decoded name N0 should appear before N1
3201 in a listing of choices during disambiguation (see sort_choices, below).
3202 The idea is that overloadings of a subprogram name from the
3203 same package should sort in their source order. We settle for ordering
3204 such symbols by their trailing number (__N or $N). */
3205
14f9c5c9 3206static int
4c4b4cd2 3207encoded_ordered_before (char *N0, char *N1)
14f9c5c9
AS
3208{
3209 if (N1 == NULL)
3210 return 0;
3211 else if (N0 == NULL)
3212 return 1;
3213 else
3214 {
3215 int k0, k1;
d2e4a39e 3216 for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
4c4b4cd2 3217 ;
d2e4a39e 3218 for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
4c4b4cd2 3219 ;
d2e4a39e 3220 if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
4c4b4cd2
PH
3221 && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
3222 {
3223 int n0, n1;
3224 n0 = k0;
3225 while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
3226 n0 -= 1;
3227 n1 = k1;
3228 while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
3229 n1 -= 1;
3230 if (n0 == n1 && strncmp (N0, N1, n0) == 0)
3231 return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
3232 }
14f9c5c9
AS
3233 return (strcmp (N0, N1) < 0);
3234 }
3235}
d2e4a39e 3236
4c4b4cd2
PH
3237/* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3238 encoded names. */
3239
d2e4a39e 3240static void
4c4b4cd2 3241sort_choices (struct ada_symbol_info syms[], int nsyms)
14f9c5c9 3242{
4c4b4cd2 3243 int i;
d2e4a39e 3244 for (i = 1; i < nsyms; i += 1)
14f9c5c9 3245 {
4c4b4cd2 3246 struct ada_symbol_info sym = syms[i];
14f9c5c9
AS
3247 int j;
3248
d2e4a39e 3249 for (j = i - 1; j >= 0; j -= 1)
4c4b4cd2
PH
3250 {
3251 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
3252 SYMBOL_LINKAGE_NAME (sym.sym)))
3253 break;
3254 syms[j + 1] = syms[j];
3255 }
d2e4a39e 3256 syms[j + 1] = sym;
14f9c5c9
AS
3257 }
3258}
3259
4c4b4cd2
PH
3260/* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3261 by asking the user (if necessary), returning the number selected,
3262 and setting the first elements of SYMS items. Error if no symbols
3263 selected. */
14f9c5c9
AS
3264
3265/* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
4c4b4cd2 3266 to be re-integrated one of these days. */
14f9c5c9
AS
3267
3268int
4c4b4cd2 3269user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
14f9c5c9
AS
3270{
3271 int i;
d2e4a39e 3272 int *chosen = (int *) alloca (sizeof (int) * nsyms);
14f9c5c9
AS
3273 int n_chosen;
3274 int first_choice = (max_results == 1) ? 1 : 2;
3275
3276 if (max_results < 1)
323e0a4a 3277 error (_("Request to select 0 symbols!"));
14f9c5c9
AS
3278 if (nsyms <= 1)
3279 return nsyms;
3280
323e0a4a 3281 printf_unfiltered (_("[0] cancel\n"));
14f9c5c9 3282 if (max_results > 1)
323e0a4a 3283 printf_unfiltered (_("[1] all\n"));
14f9c5c9 3284
4c4b4cd2 3285 sort_choices (syms, nsyms);
14f9c5c9
AS
3286
3287 for (i = 0; i < nsyms; i += 1)
3288 {
4c4b4cd2
PH
3289 if (syms[i].sym == NULL)
3290 continue;
3291
3292 if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
3293 {
76a01679
JB
3294 struct symtab_and_line sal =
3295 find_function_start_sal (syms[i].sym, 1);
323e0a4a
AC
3296 if (sal.symtab == NULL)
3297 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3298 i + first_choice,
3299 SYMBOL_PRINT_NAME (syms[i].sym),
3300 sal.line);
3301 else
3302 printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
3303 SYMBOL_PRINT_NAME (syms[i].sym),
3304 sal.symtab->filename, sal.line);
4c4b4cd2
PH
3305 continue;
3306 }
d2e4a39e 3307 else
4c4b4cd2
PH
3308 {
3309 int is_enumeral =
3310 (SYMBOL_CLASS (syms[i].sym) == LOC_CONST
3311 && SYMBOL_TYPE (syms[i].sym) != NULL
3312 && TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
3313 struct symtab *symtab = symtab_for_sym (syms[i].sym);
3314
3315 if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
323e0a4a 3316 printf_unfiltered (_("[%d] %s at %s:%d\n"),
4c4b4cd2
PH
3317 i + first_choice,
3318 SYMBOL_PRINT_NAME (syms[i].sym),
3319 symtab->filename, SYMBOL_LINE (syms[i].sym));
76a01679
JB
3320 else if (is_enumeral
3321 && TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
4c4b4cd2 3322 {
a3f17187 3323 printf_unfiltered (("[%d] "), i + first_choice);
76a01679
JB
3324 ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
3325 gdb_stdout, -1, 0);
323e0a4a 3326 printf_unfiltered (_("'(%s) (enumeral)\n"),
4c4b4cd2
PH
3327 SYMBOL_PRINT_NAME (syms[i].sym));
3328 }
3329 else if (symtab != NULL)
3330 printf_unfiltered (is_enumeral
323e0a4a
AC
3331 ? _("[%d] %s in %s (enumeral)\n")
3332 : _("[%d] %s at %s:?\n"),
4c4b4cd2
PH
3333 i + first_choice,
3334 SYMBOL_PRINT_NAME (syms[i].sym),
3335 symtab->filename);
3336 else
3337 printf_unfiltered (is_enumeral
323e0a4a
AC
3338 ? _("[%d] %s (enumeral)\n")
3339 : _("[%d] %s at ?\n"),
4c4b4cd2
PH
3340 i + first_choice,
3341 SYMBOL_PRINT_NAME (syms[i].sym));
3342 }
14f9c5c9 3343 }
d2e4a39e 3344
14f9c5c9 3345 n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
4c4b4cd2 3346 "overload-choice");
14f9c5c9
AS
3347
3348 for (i = 0; i < n_chosen; i += 1)
4c4b4cd2 3349 syms[i] = syms[chosen[i]];
14f9c5c9
AS
3350
3351 return n_chosen;
3352}
3353
3354/* Read and validate a set of numeric choices from the user in the
4c4b4cd2 3355 range 0 .. N_CHOICES-1. Place the results in increasing
14f9c5c9
AS
3356 order in CHOICES[0 .. N-1], and return N.
3357
3358 The user types choices as a sequence of numbers on one line
3359 separated by blanks, encoding them as follows:
3360
4c4b4cd2 3361 + A choice of 0 means to cancel the selection, throwing an error.
14f9c5c9
AS
3362 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3363 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3364
4c4b4cd2 3365 The user is not allowed to choose more than MAX_RESULTS values.
14f9c5c9
AS
3366
3367 ANNOTATION_SUFFIX, if present, is used to annotate the input
4c4b4cd2 3368 prompts (for use with the -f switch). */
14f9c5c9
AS
3369
3370int
d2e4a39e 3371get_selections (int *choices, int n_choices, int max_results,
4c4b4cd2 3372 int is_all_choice, char *annotation_suffix)
14f9c5c9 3373{
d2e4a39e
AS
3374 char *args;
3375 const char *prompt;
14f9c5c9
AS
3376 int n_chosen;
3377 int first_choice = is_all_choice ? 2 : 1;
d2e4a39e 3378
14f9c5c9
AS
3379 prompt = getenv ("PS2");
3380 if (prompt == NULL)
3381 prompt = ">";
3382
a3f17187 3383 printf_unfiltered (("%s "), prompt);
14f9c5c9
AS
3384 gdb_flush (gdb_stdout);
3385
3386 args = command_line_input ((char *) NULL, 0, annotation_suffix);
d2e4a39e 3387
14f9c5c9 3388 if (args == NULL)
323e0a4a 3389 error_no_arg (_("one or more choice numbers"));
14f9c5c9
AS
3390
3391 n_chosen = 0;
76a01679 3392
4c4b4cd2
PH
3393 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3394 order, as given in args. Choices are validated. */
14f9c5c9
AS
3395 while (1)
3396 {
d2e4a39e 3397 char *args2;
14f9c5c9
AS
3398 int choice, j;
3399
3400 while (isspace (*args))
4c4b4cd2 3401 args += 1;
14f9c5c9 3402 if (*args == '\0' && n_chosen == 0)
323e0a4a 3403 error_no_arg (_("one or more choice numbers"));
14f9c5c9 3404 else if (*args == '\0')
4c4b4cd2 3405 break;
14f9c5c9
AS
3406
3407 choice = strtol (args, &args2, 10);
d2e4a39e 3408 if (args == args2 || choice < 0
4c4b4cd2 3409 || choice > n_choices + first_choice - 1)
323e0a4a 3410 error (_("Argument must be choice number"));
14f9c5c9
AS
3411 args = args2;
3412
d2e4a39e 3413 if (choice == 0)
323e0a4a 3414 error (_("cancelled"));
14f9c5c9
AS
3415
3416 if (choice < first_choice)
4c4b4cd2
PH
3417 {
3418 n_chosen = n_choices;
3419 for (j = 0; j < n_choices; j += 1)
3420 choices[j] = j;
3421 break;
3422 }
14f9c5c9
AS
3423 choice -= first_choice;
3424
d2e4a39e 3425 for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
4c4b4cd2
PH
3426 {
3427 }
14f9c5c9
AS
3428
3429 if (j < 0 || choice != choices[j])
4c4b4cd2
PH
3430 {
3431 int k;
3432 for (k = n_chosen - 1; k > j; k -= 1)
3433 choices[k + 1] = choices[k];
3434 choices[j + 1] = choice;
3435 n_chosen += 1;
3436 }
14f9c5c9
AS
3437 }
3438
3439 if (n_chosen > max_results)
323e0a4a 3440 error (_("Select no more than %d of the above"), max_results);
d2e4a39e 3441
14f9c5c9
AS
3442 return n_chosen;
3443}
3444
4c4b4cd2
PH
3445/* Replace the operator of length OPLEN at position PC in *EXPP with a call
3446 on the function identified by SYM and BLOCK, and taking NARGS
3447 arguments. Update *EXPP as needed to hold more space. */
14f9c5c9
AS
3448
3449static void
d2e4a39e 3450replace_operator_with_call (struct expression **expp, int pc, int nargs,
4c4b4cd2
PH
3451 int oplen, struct symbol *sym,
3452 struct block *block)
14f9c5c9
AS
3453{
3454 /* A new expression, with 6 more elements (3 for funcall, 4 for function
4c4b4cd2 3455 symbol, -oplen for operator being replaced). */
d2e4a39e 3456 struct expression *newexp = (struct expression *)
14f9c5c9 3457 xmalloc (sizeof (struct expression)
4c4b4cd2 3458 + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
d2e4a39e 3459 struct expression *exp = *expp;
14f9c5c9
AS
3460
3461 newexp->nelts = exp->nelts + 7 - oplen;
3462 newexp->language_defn = exp->language_defn;
3463 memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
d2e4a39e 3464 memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
4c4b4cd2 3465 EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
14f9c5c9
AS
3466
3467 newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
3468 newexp->elts[pc + 1].longconst = (LONGEST) nargs;
3469
3470 newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
3471 newexp->elts[pc + 4].block = block;
3472 newexp->elts[pc + 5].symbol = sym;
3473
3474 *expp = newexp;
aacb1f0a 3475 xfree (exp);
d2e4a39e 3476}
14f9c5c9
AS
3477
3478/* Type-class predicates */
3479
4c4b4cd2
PH
3480/* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3481 or FLOAT). */
14f9c5c9
AS
3482
3483static int
d2e4a39e 3484numeric_type_p (struct type *type)
14f9c5c9
AS
3485{
3486 if (type == NULL)
3487 return 0;
d2e4a39e
AS
3488 else
3489 {
3490 switch (TYPE_CODE (type))
4c4b4cd2
PH
3491 {
3492 case TYPE_CODE_INT:
3493 case TYPE_CODE_FLT:
3494 return 1;
3495 case TYPE_CODE_RANGE:
3496 return (type == TYPE_TARGET_TYPE (type)
3497 || numeric_type_p (TYPE_TARGET_TYPE (type)));
3498 default:
3499 return 0;
3500 }
d2e4a39e 3501 }
14f9c5c9
AS
3502}
3503
4c4b4cd2 3504/* True iff TYPE is integral (an INT or RANGE of INTs). */
14f9c5c9
AS
3505
3506static int
d2e4a39e 3507integer_type_p (struct type *type)
14f9c5c9
AS
3508{
3509 if (type == NULL)
3510 return 0;
d2e4a39e
AS
3511 else
3512 {
3513 switch (TYPE_CODE (type))
4c4b4cd2
PH
3514 {
3515 case TYPE_CODE_INT:
3516 return 1;
3517 case TYPE_CODE_RANGE:
3518 return (type == TYPE_TARGET_TYPE (type)
3519 || integer_type_p (TYPE_TARGET_TYPE (type)));
3520 default:
3521 return 0;
3522 }
d2e4a39e 3523 }
14f9c5c9
AS
3524}
3525
4c4b4cd2 3526/* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
14f9c5c9
AS
3527
3528static int
d2e4a39e 3529scalar_type_p (struct type *type)
14f9c5c9
AS
3530{
3531 if (type == NULL)
3532 return 0;
d2e4a39e
AS
3533 else
3534 {
3535 switch (TYPE_CODE (type))
4c4b4cd2
PH
3536 {
3537 case TYPE_CODE_INT:
3538 case TYPE_CODE_RANGE:
3539 case TYPE_CODE_ENUM:
3540 case TYPE_CODE_FLT:
3541 return 1;
3542 default:
3543 return 0;
3544 }
d2e4a39e 3545 }
14f9c5c9
AS
3546}
3547
4c4b4cd2 3548/* True iff TYPE is discrete (INT, RANGE, ENUM). */
14f9c5c9
AS
3549
3550static int
d2e4a39e 3551discrete_type_p (struct type *type)
14f9c5c9
AS
3552{
3553 if (type == NULL)
3554 return 0;
d2e4a39e
AS
3555 else
3556 {
3557 switch (TYPE_CODE (type))
4c4b4cd2
PH
3558 {
3559 case TYPE_CODE_INT:
3560 case TYPE_CODE_RANGE:
3561 case TYPE_CODE_ENUM:
3562 return 1;
3563 default:
3564 return 0;
3565 }
d2e4a39e 3566 }
14f9c5c9
AS
3567}
3568
4c4b4cd2
PH
3569/* Returns non-zero if OP with operands in the vector ARGS could be
3570 a user-defined function. Errs on the side of pre-defined operators
3571 (i.e., result 0). */
14f9c5c9
AS
3572
3573static int
d2e4a39e 3574possible_user_operator_p (enum exp_opcode op, struct value *args[])
14f9c5c9 3575{
76a01679 3576 struct type *type0 =
df407dfe 3577 (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
d2e4a39e 3578 struct type *type1 =
df407dfe 3579 (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
d2e4a39e 3580
4c4b4cd2
PH
3581 if (type0 == NULL)
3582 return 0;
3583
14f9c5c9
AS
3584 switch (op)
3585 {
3586 default:
3587 return 0;
3588
3589 case BINOP_ADD:
3590 case BINOP_SUB:
3591 case BINOP_MUL:
3592 case BINOP_DIV:
d2e4a39e 3593 return (!(numeric_type_p (type0) && numeric_type_p (type1)));
14f9c5c9
AS
3594
3595 case BINOP_REM:
3596 case BINOP_MOD:
3597 case BINOP_BITWISE_AND:
3598 case BINOP_BITWISE_IOR:
3599 case BINOP_BITWISE_XOR:
d2e4a39e 3600 return (!(integer_type_p (type0) && integer_type_p (type1)));
14f9c5c9
AS
3601
3602 case BINOP_EQUAL:
3603 case BINOP_NOTEQUAL:
3604 case BINOP_LESS:
3605 case BINOP_GTR:
3606 case BINOP_LEQ:
3607 case BINOP_GEQ:
d2e4a39e 3608 return (!(scalar_type_p (type0) && scalar_type_p (type1)));
14f9c5c9
AS
3609
3610 case BINOP_CONCAT:
ee90b9ab 3611 return !ada_is_array_type (type0) || !ada_is_array_type (type1);
14f9c5c9
AS
3612
3613 case BINOP_EXP:
d2e4a39e 3614 return (!(numeric_type_p (type0) && integer_type_p (type1)));
14f9c5c9
AS
3615
3616 case UNOP_NEG:
3617 case UNOP_PLUS:
3618 case UNOP_LOGICAL_NOT:
d2e4a39e
AS
3619 case UNOP_ABS:
3620 return (!numeric_type_p (type0));
14f9c5c9
AS
3621
3622 }
3623}
3624\f
4c4b4cd2 3625 /* Renaming */
14f9c5c9 3626
aeb5907d
JB
3627/* NOTES:
3628
3629 1. In the following, we assume that a renaming type's name may
3630 have an ___XD suffix. It would be nice if this went away at some
3631 point.
3632 2. We handle both the (old) purely type-based representation of
3633 renamings and the (new) variable-based encoding. At some point,
3634 it is devoutly to be hoped that the former goes away
3635 (FIXME: hilfinger-2007-07-09).
3636 3. Subprogram renamings are not implemented, although the XRS
3637 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3638
3639/* If SYM encodes a renaming,
3640
3641 <renaming> renames <renamed entity>,
3642
3643 sets *LEN to the length of the renamed entity's name,
3644 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3645 the string describing the subcomponent selected from the renamed
3646 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3647 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3648 are undefined). Otherwise, returns a value indicating the category
3649 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3650 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3651 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3652 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3653 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3654 may be NULL, in which case they are not assigned.
3655
3656 [Currently, however, GCC does not generate subprogram renamings.] */
3657
3658enum ada_renaming_category
3659ada_parse_renaming (struct symbol *sym,
3660 const char **renamed_entity, int *len,
3661 const char **renaming_expr)
3662{
3663 enum ada_renaming_category kind;
3664 const char *info;
3665 const char *suffix;
3666
3667 if (sym == NULL)
3668 return ADA_NOT_RENAMING;
3669 switch (SYMBOL_CLASS (sym))
14f9c5c9 3670 {
aeb5907d
JB
3671 default:
3672 return ADA_NOT_RENAMING;
3673 case LOC_TYPEDEF:
3674 return parse_old_style_renaming (SYMBOL_TYPE (sym),
3675 renamed_entity, len, renaming_expr);
3676 case LOC_LOCAL:
3677 case LOC_STATIC:
3678 case LOC_COMPUTED:
3679 case LOC_OPTIMIZED_OUT:
3680 info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
3681 if (info == NULL)
3682 return ADA_NOT_RENAMING;
3683 switch (info[5])
3684 {
3685 case '_':
3686 kind = ADA_OBJECT_RENAMING;
3687 info += 6;
3688 break;
3689 case 'E':
3690 kind = ADA_EXCEPTION_RENAMING;
3691 info += 7;
3692 break;
3693 case 'P':
3694 kind = ADA_PACKAGE_RENAMING;
3695 info += 7;
3696 break;
3697 case 'S':
3698 kind = ADA_SUBPROGRAM_RENAMING;
3699 info += 7;
3700 break;
3701 default:
3702 return ADA_NOT_RENAMING;
3703 }
14f9c5c9 3704 }
4c4b4cd2 3705
aeb5907d
JB
3706 if (renamed_entity != NULL)
3707 *renamed_entity = info;
3708 suffix = strstr (info, "___XE");
3709 if (suffix == NULL || suffix == info)
3710 return ADA_NOT_RENAMING;
3711 if (len != NULL)
3712 *len = strlen (info) - strlen (suffix);
3713 suffix += 5;
3714 if (renaming_expr != NULL)
3715 *renaming_expr = suffix;
3716 return kind;
3717}
3718
3719/* Assuming TYPE encodes a renaming according to the old encoding in
3720 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3721 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3722 ADA_NOT_RENAMING otherwise. */
3723static enum ada_renaming_category
3724parse_old_style_renaming (struct type *type,
3725 const char **renamed_entity, int *len,
3726 const char **renaming_expr)
3727{
3728 enum ada_renaming_category kind;
3729 const char *name;
3730 const char *info;
3731 const char *suffix;
14f9c5c9 3732
aeb5907d
JB
3733 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
3734 || TYPE_NFIELDS (type) != 1)
3735 return ADA_NOT_RENAMING;
14f9c5c9 3736
aeb5907d
JB
3737 name = type_name_no_tag (type);
3738 if (name == NULL)
3739 return ADA_NOT_RENAMING;
3740
3741 name = strstr (name, "___XR");
3742 if (name == NULL)
3743 return ADA_NOT_RENAMING;
3744 switch (name[5])
3745 {
3746 case '\0':
3747 case '_':
3748 kind = ADA_OBJECT_RENAMING;
3749 break;
3750 case 'E':
3751 kind = ADA_EXCEPTION_RENAMING;
3752 break;
3753 case 'P':
3754 kind = ADA_PACKAGE_RENAMING;
3755 break;
3756 case 'S':
3757 kind = ADA_SUBPROGRAM_RENAMING;
3758 break;
3759 default:
3760 return ADA_NOT_RENAMING;
3761 }
14f9c5c9 3762
aeb5907d
JB
3763 info = TYPE_FIELD_NAME (type, 0);
3764 if (info == NULL)
3765 return ADA_NOT_RENAMING;
3766 if (renamed_entity != NULL)
3767 *renamed_entity = info;
3768 suffix = strstr (info, "___XE");
3769 if (renaming_expr != NULL)
3770 *renaming_expr = suffix + 5;
3771 if (suffix == NULL || suffix == info)
3772 return ADA_NOT_RENAMING;
3773 if (len != NULL)
3774 *len = suffix - info;
3775 return kind;
3776}
52ce6436 3777
14f9c5c9 3778\f
d2e4a39e 3779
4c4b4cd2 3780 /* Evaluation: Function Calls */
14f9c5c9 3781
4c4b4cd2
PH
3782/* Return an lvalue containing the value VAL. This is the identity on
3783 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3784 on the stack, using and updating *SP as the stack pointer, and
3785 returning an lvalue whose VALUE_ADDRESS points to the copy. */
14f9c5c9 3786
d2e4a39e 3787static struct value *
4c4b4cd2 3788ensure_lval (struct value *val, CORE_ADDR *sp)
14f9c5c9 3789{
c3e5cd34
PH
3790 if (! VALUE_LVAL (val))
3791 {
df407dfe 3792 int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
c3e5cd34
PH
3793
3794 /* The following is taken from the structure-return code in
3795 call_function_by_hand. FIXME: Therefore, some refactoring seems
3796 indicated. */
4d1e7dd1 3797 if (gdbarch_inner_than (current_gdbarch, 1, 2))
c3e5cd34
PH
3798 {
3799 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3800 reserving sufficient space. */
3801 *sp -= len;
3802 if (gdbarch_frame_align_p (current_gdbarch))
3803 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3804 VALUE_ADDRESS (val) = *sp;
3805 }
3806 else
3807 {
3808 /* Stack grows upward. Align the frame, allocate space, and
3809 then again, re-align the frame. */
3810 if (gdbarch_frame_align_p (current_gdbarch))
3811 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3812 VALUE_ADDRESS (val) = *sp;
3813 *sp += len;
3814 if (gdbarch_frame_align_p (current_gdbarch))
3815 *sp = gdbarch_frame_align (current_gdbarch, *sp);
3816 }
14f9c5c9 3817
990a07ab 3818 write_memory (VALUE_ADDRESS (val), value_contents_raw (val), len);
c3e5cd34 3819 }
14f9c5c9
AS
3820
3821 return val;
3822}
3823
3824/* Return the value ACTUAL, converted to be an appropriate value for a
3825 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3826 allocating any necessary descriptors (fat pointers), or copies of
4c4b4cd2 3827 values not residing in memory, updating it as needed. */
14f9c5c9 3828
d2e4a39e
AS
3829static struct value *
3830convert_actual (struct value *actual, struct type *formal_type0,
4c4b4cd2 3831 CORE_ADDR *sp)
14f9c5c9 3832{
df407dfe 3833 struct type *actual_type = ada_check_typedef (value_type (actual));
61ee279c 3834 struct type *formal_type = ada_check_typedef (formal_type0);
d2e4a39e
AS
3835 struct type *formal_target =
3836 TYPE_CODE (formal_type) == TYPE_CODE_PTR
61ee279c 3837 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
d2e4a39e
AS
3838 struct type *actual_target =
3839 TYPE_CODE (actual_type) == TYPE_CODE_PTR
61ee279c 3840 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
14f9c5c9 3841
4c4b4cd2 3842 if (ada_is_array_descriptor_type (formal_target)
14f9c5c9
AS
3843 && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
3844 return make_array_descriptor (formal_type, actual, sp);
3845 else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR)
3846 {
3847 if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
4c4b4cd2
PH
3848 && ada_is_array_descriptor_type (actual_target))
3849 return desc_data (actual);
14f9c5c9 3850 else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
4c4b4cd2
PH
3851 {
3852 if (VALUE_LVAL (actual) != lval_memory)
3853 {
3854 struct value *val;
df407dfe 3855 actual_type = ada_check_typedef (value_type (actual));
4c4b4cd2 3856 val = allocate_value (actual_type);
990a07ab 3857 memcpy ((char *) value_contents_raw (val),
0fd88904 3858 (char *) value_contents (actual),
4c4b4cd2
PH
3859 TYPE_LENGTH (actual_type));
3860 actual = ensure_lval (val, sp);
3861 }
3862 return value_addr (actual);
3863 }
14f9c5c9
AS
3864 }
3865 else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
3866 return ada_value_ind (actual);
3867
3868 return actual;
3869}
3870
3871
4c4b4cd2
PH
3872/* Push a descriptor of type TYPE for array value ARR on the stack at
3873 *SP, updating *SP to reflect the new descriptor. Return either
14f9c5c9 3874 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4c4b4cd2
PH
3875 to-descriptor type rather than a descriptor type), a struct value *
3876 representing a pointer to this descriptor. */
14f9c5c9 3877
d2e4a39e
AS
3878static struct value *
3879make_array_descriptor (struct type *type, struct value *arr, CORE_ADDR *sp)
14f9c5c9 3880{
d2e4a39e
AS
3881 struct type *bounds_type = desc_bounds_type (type);
3882 struct type *desc_type = desc_base_type (type);
3883 struct value *descriptor = allocate_value (desc_type);
3884 struct value *bounds = allocate_value (bounds_type);
14f9c5c9 3885 int i;
d2e4a39e 3886
df407dfe 3887 for (i = ada_array_arity (ada_check_typedef (value_type (arr))); i > 0; i -= 1)
14f9c5c9 3888 {
0fd88904 3889 modify_general_field (value_contents_writeable (bounds),
4c4b4cd2
PH
3890 value_as_long (ada_array_bound (arr, i, 0)),
3891 desc_bound_bitpos (bounds_type, i, 0),
3892 desc_bound_bitsize (bounds_type, i, 0));
0fd88904 3893 modify_general_field (value_contents_writeable (bounds),
4c4b4cd2
PH
3894 value_as_long (ada_array_bound (arr, i, 1)),
3895 desc_bound_bitpos (bounds_type, i, 1),
3896 desc_bound_bitsize (bounds_type, i, 1));
14f9c5c9 3897 }
d2e4a39e 3898
4c4b4cd2 3899 bounds = ensure_lval (bounds, sp);
d2e4a39e 3900
0fd88904 3901 modify_general_field (value_contents_writeable (descriptor),
76a01679
JB
3902 VALUE_ADDRESS (ensure_lval (arr, sp)),
3903 fat_pntr_data_bitpos (desc_type),
3904 fat_pntr_data_bitsize (desc_type));
4c4b4cd2 3905
0fd88904 3906 modify_general_field (value_contents_writeable (descriptor),
4c4b4cd2
PH
3907 VALUE_ADDRESS (bounds),
3908 fat_pntr_bounds_bitpos (desc_type),
3909 fat_pntr_bounds_bitsize (desc_type));
14f9c5c9 3910
4c4b4cd2 3911 descriptor = ensure_lval (descriptor, sp);
14f9c5c9
AS
3912
3913 if (TYPE_CODE (type) == TYPE_CODE_PTR)
3914 return value_addr (descriptor);
3915 else
3916 return descriptor;
3917}
3918
3919
4c4b4cd2 3920/* Assuming a dummy frame has been established on the target, perform any
14f9c5c9 3921 conversions needed for calling function FUNC on the NARGS actual
4c4b4cd2 3922 parameters in ARGS, other than standard C conversions. Does
14f9c5c9 3923 nothing if FUNC does not have Ada-style prototype data, or if NARGS
4c4b4cd2 3924 does not match the number of arguments expected. Use *SP as a
14f9c5c9 3925 stack pointer for additional data that must be pushed, updating its
4c4b4cd2 3926 value as needed. */
14f9c5c9
AS
3927
3928void
d2e4a39e 3929ada_convert_actuals (struct value *func, int nargs, struct value *args[],
4c4b4cd2 3930 CORE_ADDR *sp)
14f9c5c9
AS
3931{
3932 int i;
3933
df407dfe
AC
3934 if (TYPE_NFIELDS (value_type (func)) == 0
3935 || nargs != TYPE_NFIELDS (value_type (func)))
14f9c5c9
AS
3936 return;
3937
3938 for (i = 0; i < nargs; i += 1)
d2e4a39e 3939 args[i] =
df407dfe 3940 convert_actual (args[i], TYPE_FIELD_TYPE (value_type (func), i), sp);
14f9c5c9 3941}
14f9c5c9 3942\f
963a6417
PH
3943/* Dummy definitions for an experimental caching module that is not
3944 * used in the public sources. */
96d887e8 3945
96d887e8
PH
3946static int
3947lookup_cached_symbol (const char *name, domain_enum namespace,
76a01679
JB
3948 struct symbol **sym, struct block **block,
3949 struct symtab **symtab)
96d887e8
PH
3950{
3951 return 0;
3952}
3953
3954static void
3955cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
76a01679 3956 struct block *block, struct symtab *symtab)
96d887e8
PH
3957{
3958}
4c4b4cd2
PH
3959\f
3960 /* Symbol Lookup */
3961
3962/* Return the result of a standard (literal, C-like) lookup of NAME in
3963 given DOMAIN, visible from lexical block BLOCK. */
3964
3965static struct symbol *
3966standard_lookup (const char *name, const struct block *block,
3967 domain_enum domain)
3968{
3969 struct symbol *sym;
3970 struct symtab *symtab;
3971
3972 if (lookup_cached_symbol (name, domain, &sym, NULL, NULL))
3973 return sym;
76a01679
JB
3974 sym =
3975 lookup_symbol_in_language (name, block, domain, language_c, 0, &symtab);
4c4b4cd2
PH
3976 cache_symbol (name, domain, sym, block_found, symtab);
3977 return sym;
3978}
3979
3980
3981/* Non-zero iff there is at least one non-function/non-enumeral symbol
3982 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3983 since they contend in overloading in the same way. */
3984static int
3985is_nonfunction (struct ada_symbol_info syms[], int n)
3986{
3987 int i;
3988
3989 for (i = 0; i < n; i += 1)
3990 if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
3991 && (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
3992 || SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
14f9c5c9
AS
3993 return 1;
3994
3995 return 0;
3996}
3997
3998/* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4c4b4cd2 3999 struct types. Otherwise, they may not. */
14f9c5c9
AS
4000
4001static int
d2e4a39e 4002equiv_types (struct type *type0, struct type *type1)
14f9c5c9 4003{
d2e4a39e 4004 if (type0 == type1)
14f9c5c9 4005 return 1;
d2e4a39e 4006 if (type0 == NULL || type1 == NULL
14f9c5c9
AS
4007 || TYPE_CODE (type0) != TYPE_CODE (type1))
4008 return 0;
d2e4a39e 4009 if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
14f9c5c9
AS
4010 || TYPE_CODE (type0) == TYPE_CODE_ENUM)
4011 && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
4c4b4cd2 4012 && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
14f9c5c9 4013 return 1;
d2e4a39e 4014
14f9c5c9
AS
4015 return 0;
4016}
4017
4018/* True iff SYM0 represents the same entity as SYM1, or one that is
4c4b4cd2 4019 no more defined than that of SYM1. */
14f9c5c9
AS
4020
4021static int
d2e4a39e 4022lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
14f9c5c9
AS
4023{
4024 if (sym0 == sym1)
4025 return 1;
176620f1 4026 if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
14f9c5c9
AS
4027 || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
4028 return 0;
4029
d2e4a39e 4030 switch (SYMBOL_CLASS (sym0))
14f9c5c9
AS
4031 {
4032 case LOC_UNDEF:
4033 return 1;
4034 case LOC_TYPEDEF:
4035 {
4c4b4cd2
PH
4036 struct type *type0 = SYMBOL_TYPE (sym0);
4037 struct type *type1 = SYMBOL_TYPE (sym1);
4038 char *name0 = SYMBOL_LINKAGE_NAME (sym0);
4039 char *name1 = SYMBOL_LINKAGE_NAME (sym1);
4040 int len0 = strlen (name0);
4041 return
4042 TYPE_CODE (type0) == TYPE_CODE (type1)
4043 && (equiv_types (type0, type1)
4044 || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
4045 && strncmp (name1 + len0, "___XV", 5) == 0));
14f9c5c9
AS
4046 }
4047 case LOC_CONST:
4048 return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
4c4b4cd2 4049 && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
d2e4a39e
AS
4050 default:
4051 return 0;
14f9c5c9
AS
4052 }
4053}
4054
4c4b4cd2
PH
4055/* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4056 records in OBSTACKP. Do nothing if SYM is a duplicate. */
14f9c5c9
AS
4057
4058static void
76a01679
JB
4059add_defn_to_vec (struct obstack *obstackp,
4060 struct symbol *sym,
4061 struct block *block, struct symtab *symtab)
14f9c5c9
AS
4062{
4063 int i;
4064 size_t tmp;
4c4b4cd2 4065 struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
14f9c5c9 4066
529cad9c
PH
4067 /* Do not try to complete stub types, as the debugger is probably
4068 already scanning all symbols matching a certain name at the
4069 time when this function is called. Trying to replace the stub
4070 type by its associated full type will cause us to restart a scan
4071 which may lead to an infinite recursion. Instead, the client
4072 collecting the matching symbols will end up collecting several
4073 matches, with at least one of them complete. It can then filter
4074 out the stub ones if needed. */
4075
4c4b4cd2
PH
4076 for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
4077 {
4078 if (lesseq_defined_than (sym, prevDefns[i].sym))
4079 return;
4080 else if (lesseq_defined_than (prevDefns[i].sym, sym))
4081 {
4082 prevDefns[i].sym = sym;
4083 prevDefns[i].block = block;
76a01679 4084 prevDefns[i].symtab = symtab;
4c4b4cd2 4085 return;
76a01679 4086 }
4c4b4cd2
PH
4087 }
4088
4089 {
4090 struct ada_symbol_info info;
4091
4092 info.sym = sym;
4093 info.block = block;
4094 info.symtab = symtab;
4095 obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
4096 }
4097}
4098
4099/* Number of ada_symbol_info structures currently collected in
4100 current vector in *OBSTACKP. */
4101
76a01679
JB
4102static int
4103num_defns_collected (struct obstack *obstackp)
4c4b4cd2
PH
4104{
4105 return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
4106}
4107
4108/* Vector of ada_symbol_info structures currently collected in current
4109 vector in *OBSTACKP. If FINISH, close off the vector and return
4110 its final address. */
4111
76a01679 4112static struct ada_symbol_info *
4c4b4cd2
PH
4113defns_collected (struct obstack *obstackp, int finish)
4114{
4115 if (finish)
4116 return obstack_finish (obstackp);
4117 else
4118 return (struct ada_symbol_info *) obstack_base (obstackp);
4119}
4120
96d887e8
PH
4121/* Look, in partial_symtab PST, for symbol NAME in given namespace.
4122 Check the global symbols if GLOBAL, the static symbols if not.
4123 Do wild-card match if WILD. */
4c4b4cd2 4124
96d887e8
PH
4125static struct partial_symbol *
4126ada_lookup_partial_symbol (struct partial_symtab *pst, const char *name,
4127 int global, domain_enum namespace, int wild)
4c4b4cd2 4128{
96d887e8
PH
4129 struct partial_symbol **start;
4130 int name_len = strlen (name);
4131 int length = (global ? pst->n_global_syms : pst->n_static_syms);
4132 int i;
4c4b4cd2 4133
96d887e8 4134 if (length == 0)
4c4b4cd2 4135 {
96d887e8 4136 return (NULL);
4c4b4cd2
PH
4137 }
4138
96d887e8
PH
4139 start = (global ?
4140 pst->objfile->global_psymbols.list + pst->globals_offset :
4141 pst->objfile->static_psymbols.list + pst->statics_offset);
4c4b4cd2 4142
96d887e8 4143 if (wild)
4c4b4cd2 4144 {
96d887e8
PH
4145 for (i = 0; i < length; i += 1)
4146 {
4147 struct partial_symbol *psym = start[i];
4c4b4cd2 4148
1265e4aa
JB
4149 if (SYMBOL_DOMAIN (psym) == namespace
4150 && wild_match (name, name_len, SYMBOL_LINKAGE_NAME (psym)))
96d887e8
PH
4151 return psym;
4152 }
4153 return NULL;
4c4b4cd2 4154 }
96d887e8
PH
4155 else
4156 {
4157 if (global)
4158 {
4159 int U;
4160 i = 0;
4161 U = length - 1;
4162 while (U - i > 4)
4163 {
4164 int M = (U + i) >> 1;
4165 struct partial_symbol *psym = start[M];
4166 if (SYMBOL_LINKAGE_NAME (psym)[0] < name[0])
4167 i = M + 1;
4168 else if (SYMBOL_LINKAGE_NAME (psym)[0] > name[0])
4169 U = M - 1;
4170 else if (strcmp (SYMBOL_LINKAGE_NAME (psym), name) < 0)
4171 i = M + 1;
4172 else
4173 U = M;
4174 }
4175 }
4176 else
4177 i = 0;
4c4b4cd2 4178
96d887e8
PH
4179 while (i < length)
4180 {
4181 struct partial_symbol *psym = start[i];
4c4b4cd2 4182
96d887e8
PH
4183 if (SYMBOL_DOMAIN (psym) == namespace)
4184 {
4185 int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym), name_len);
4c4b4cd2 4186
96d887e8
PH
4187 if (cmp < 0)
4188 {
4189 if (global)
4190 break;
4191 }
4192 else if (cmp == 0
4193 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
76a01679 4194 + name_len))
96d887e8
PH
4195 return psym;
4196 }
4197 i += 1;
4198 }
4c4b4cd2 4199
96d887e8
PH
4200 if (global)
4201 {
4202 int U;
4203 i = 0;
4204 U = length - 1;
4205 while (U - i > 4)
4206 {
4207 int M = (U + i) >> 1;
4208 struct partial_symbol *psym = start[M];
4209 if (SYMBOL_LINKAGE_NAME (psym)[0] < '_')
4210 i = M + 1;
4211 else if (SYMBOL_LINKAGE_NAME (psym)[0] > '_')
4212 U = M - 1;
4213 else if (strcmp (SYMBOL_LINKAGE_NAME (psym), "_ada_") < 0)
4214 i = M + 1;
4215 else
4216 U = M;
4217 }
4218 }
4219 else
4220 i = 0;
4c4b4cd2 4221
96d887e8
PH
4222 while (i < length)
4223 {
4224 struct partial_symbol *psym = start[i];
4c4b4cd2 4225
96d887e8
PH
4226 if (SYMBOL_DOMAIN (psym) == namespace)
4227 {
4228 int cmp;
4c4b4cd2 4229
96d887e8
PH
4230 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym)[0];
4231 if (cmp == 0)
4232 {
4233 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym), 5);
4234 if (cmp == 0)
4235 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym) + 5,
76a01679 4236 name_len);
96d887e8 4237 }
4c4b4cd2 4238
96d887e8
PH
4239 if (cmp < 0)
4240 {
4241 if (global)
4242 break;
4243 }
4244 else if (cmp == 0
4245 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
76a01679 4246 + name_len + 5))
96d887e8
PH
4247 return psym;
4248 }
4249 i += 1;
4250 }
4251 }
4252 return NULL;
4c4b4cd2
PH
4253}
4254
96d887e8 4255/* Find a symbol table containing symbol SYM or NULL if none. */
4c4b4cd2 4256
96d887e8
PH
4257static struct symtab *
4258symtab_for_sym (struct symbol *sym)
4c4b4cd2 4259{
96d887e8
PH
4260 struct symtab *s;
4261 struct objfile *objfile;
4262 struct block *b;
4263 struct symbol *tmp_sym;
4264 struct dict_iterator iter;
4265 int j;
4c4b4cd2 4266
11309657 4267 ALL_PRIMARY_SYMTABS (objfile, s)
96d887e8
PH
4268 {
4269 switch (SYMBOL_CLASS (sym))
4270 {
4271 case LOC_CONST:
4272 case LOC_STATIC:
4273 case LOC_TYPEDEF:
4274 case LOC_REGISTER:
4275 case LOC_LABEL:
4276 case LOC_BLOCK:
4277 case LOC_CONST_BYTES:
76a01679
JB
4278 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
4279 ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
4280 return s;
4281 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
4282 ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
4283 return s;
96d887e8
PH
4284 break;
4285 default:
4286 break;
4287 }
4288 switch (SYMBOL_CLASS (sym))
4289 {
4290 case LOC_REGISTER:
4291 case LOC_ARG:
4292 case LOC_REF_ARG:
4293 case LOC_REGPARM:
4294 case LOC_REGPARM_ADDR:
4295 case LOC_LOCAL:
4296 case LOC_TYPEDEF:
4297 case LOC_LOCAL_ARG:
4298 case LOC_BASEREG:
4299 case LOC_BASEREG_ARG:
4300 case LOC_COMPUTED:
4301 case LOC_COMPUTED_ARG:
76a01679
JB
4302 for (j = FIRST_LOCAL_BLOCK;
4303 j < BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s)); j += 1)
4304 {
4305 b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), j);
4306 ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
4307 return s;
4308 }
4309 break;
96d887e8
PH
4310 default:
4311 break;
4312 }
4313 }
4314 return NULL;
4c4b4cd2
PH
4315}
4316
96d887e8
PH
4317/* Return a minimal symbol matching NAME according to Ada decoding
4318 rules. Returns NULL if there is no such minimal symbol. Names
4319 prefixed with "standard__" are handled specially: "standard__" is
4320 first stripped off, and only static and global symbols are searched. */
4c4b4cd2 4321
96d887e8
PH
4322struct minimal_symbol *
4323ada_lookup_simple_minsym (const char *name)
4c4b4cd2 4324{
4c4b4cd2 4325 struct objfile *objfile;
96d887e8
PH
4326 struct minimal_symbol *msymbol;
4327 int wild_match;
4c4b4cd2 4328
96d887e8 4329 if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
4c4b4cd2 4330 {
96d887e8 4331 name += sizeof ("standard__") - 1;
4c4b4cd2 4332 wild_match = 0;
4c4b4cd2
PH
4333 }
4334 else
96d887e8 4335 wild_match = (strstr (name, "__") == NULL);
4c4b4cd2 4336
96d887e8
PH
4337 ALL_MSYMBOLS (objfile, msymbol)
4338 {
4339 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match)
4340 && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
4341 return msymbol;
4342 }
4c4b4cd2 4343
96d887e8
PH
4344 return NULL;
4345}
4c4b4cd2 4346
96d887e8
PH
4347/* For all subprograms that statically enclose the subprogram of the
4348 selected frame, add symbols matching identifier NAME in DOMAIN
4349 and their blocks to the list of data in OBSTACKP, as for
4350 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4351 wildcard prefix. */
4c4b4cd2 4352
96d887e8
PH
4353static void
4354add_symbols_from_enclosing_procs (struct obstack *obstackp,
76a01679 4355 const char *name, domain_enum namespace,
96d887e8
PH
4356 int wild_match)
4357{
96d887e8 4358}
14f9c5c9 4359
96d887e8
PH
4360/* True if TYPE is definitely an artificial type supplied to a symbol
4361 for which no debugging information was given in the symbol file. */
14f9c5c9 4362
96d887e8
PH
4363static int
4364is_nondebugging_type (struct type *type)
4365{
4366 char *name = ada_type_name (type);
4367 return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
4368}
4c4b4cd2 4369
96d887e8
PH
4370/* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4371 duplicate other symbols in the list (The only case I know of where
4372 this happens is when object files containing stabs-in-ecoff are
4373 linked with files containing ordinary ecoff debugging symbols (or no
4374 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4375 Returns the number of items in the modified list. */
4c4b4cd2 4376
96d887e8
PH
4377static int
4378remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
4379{
4380 int i, j;
4c4b4cd2 4381
96d887e8
PH
4382 i = 0;
4383 while (i < nsyms)
4384 {
4385 if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
4386 && SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
4387 && is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
4388 {
4389 for (j = 0; j < nsyms; j += 1)
4390 {
4391 if (i != j
4392 && SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
4393 && strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
76a01679 4394 SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
96d887e8
PH
4395 && SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
4396 && SYMBOL_VALUE_ADDRESS (syms[i].sym)
4397 == SYMBOL_VALUE_ADDRESS (syms[j].sym))
4c4b4cd2 4398 {
96d887e8
PH
4399 int k;
4400 for (k = i + 1; k < nsyms; k += 1)
76a01679 4401 syms[k - 1] = syms[k];
96d887e8
PH
4402 nsyms -= 1;
4403 goto NextSymbol;
4c4b4cd2 4404 }
4c4b4cd2 4405 }
4c4b4cd2 4406 }
96d887e8
PH
4407 i += 1;
4408 NextSymbol:
4409 ;
14f9c5c9 4410 }
96d887e8 4411 return nsyms;
14f9c5c9
AS
4412}
4413
96d887e8
PH
4414/* Given a type that corresponds to a renaming entity, use the type name
4415 to extract the scope (package name or function name, fully qualified,
4416 and following the GNAT encoding convention) where this renaming has been
4417 defined. The string returned needs to be deallocated after use. */
4c4b4cd2 4418
96d887e8
PH
4419static char *
4420xget_renaming_scope (struct type *renaming_type)
14f9c5c9 4421{
96d887e8
PH
4422 /* The renaming types adhere to the following convention:
4423 <scope>__<rename>___<XR extension>.
4424 So, to extract the scope, we search for the "___XR" extension,
4425 and then backtrack until we find the first "__". */
76a01679 4426
96d887e8
PH
4427 const char *name = type_name_no_tag (renaming_type);
4428 char *suffix = strstr (name, "___XR");
4429 char *last;
4430 int scope_len;
4431 char *scope;
14f9c5c9 4432
96d887e8
PH
4433 /* Now, backtrack a bit until we find the first "__". Start looking
4434 at suffix - 3, as the <rename> part is at least one character long. */
14f9c5c9 4435
96d887e8
PH
4436 for (last = suffix - 3; last > name; last--)
4437 if (last[0] == '_' && last[1] == '_')
4438 break;
76a01679 4439
96d887e8 4440 /* Make a copy of scope and return it. */
14f9c5c9 4441
96d887e8
PH
4442 scope_len = last - name;
4443 scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
14f9c5c9 4444
96d887e8
PH
4445 strncpy (scope, name, scope_len);
4446 scope[scope_len] = '\0';
4c4b4cd2 4447
96d887e8 4448 return scope;
4c4b4cd2
PH
4449}
4450
96d887e8 4451/* Return nonzero if NAME corresponds to a package name. */
4c4b4cd2 4452
96d887e8
PH
4453static int
4454is_package_name (const char *name)
4c4b4cd2 4455{
96d887e8
PH
4456 /* Here, We take advantage of the fact that no symbols are generated
4457 for packages, while symbols are generated for each function.
4458 So the condition for NAME represent a package becomes equivalent
4459 to NAME not existing in our list of symbols. There is only one
4460 small complication with library-level functions (see below). */
4c4b4cd2 4461
96d887e8 4462 char *fun_name;
76a01679 4463
96d887e8
PH
4464 /* If it is a function that has not been defined at library level,
4465 then we should be able to look it up in the symbols. */
4466 if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
4467 return 0;
14f9c5c9 4468
96d887e8
PH
4469 /* Library-level function names start with "_ada_". See if function
4470 "_ada_" followed by NAME can be found. */
14f9c5c9 4471
96d887e8 4472 /* Do a quick check that NAME does not contain "__", since library-level
e1d5a0d2 4473 functions names cannot contain "__" in them. */
96d887e8
PH
4474 if (strstr (name, "__") != NULL)
4475 return 0;
4c4b4cd2 4476
b435e160 4477 fun_name = xstrprintf ("_ada_%s", name);
14f9c5c9 4478
96d887e8
PH
4479 return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
4480}
14f9c5c9 4481
96d887e8 4482/* Return nonzero if SYM corresponds to a renaming entity that is
aeb5907d 4483 not visible from FUNCTION_NAME. */
14f9c5c9 4484
96d887e8 4485static int
aeb5907d 4486old_renaming_is_invisible (const struct symbol *sym, char *function_name)
96d887e8 4487{
aeb5907d
JB
4488 char *scope;
4489
4490 if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
4491 return 0;
4492
4493 scope = xget_renaming_scope (SYMBOL_TYPE (sym));
d2e4a39e 4494
96d887e8 4495 make_cleanup (xfree, scope);
14f9c5c9 4496
96d887e8
PH
4497 /* If the rename has been defined in a package, then it is visible. */
4498 if (is_package_name (scope))
aeb5907d 4499 return 0;
14f9c5c9 4500
96d887e8
PH
4501 /* Check that the rename is in the current function scope by checking
4502 that its name starts with SCOPE. */
76a01679 4503
96d887e8
PH
4504 /* If the function name starts with "_ada_", it means that it is
4505 a library-level function. Strip this prefix before doing the
4506 comparison, as the encoding for the renaming does not contain
4507 this prefix. */
4508 if (strncmp (function_name, "_ada_", 5) == 0)
4509 function_name += 5;
f26caa11 4510
aeb5907d 4511 return (strncmp (function_name, scope, strlen (scope)) != 0);
f26caa11
PH
4512}
4513
aeb5907d
JB
4514/* Remove entries from SYMS that corresponds to a renaming entity that
4515 is not visible from the function associated with CURRENT_BLOCK or
4516 that is superfluous due to the presence of more specific renaming
4517 information. Places surviving symbols in the initial entries of
4518 SYMS and returns the number of surviving symbols.
96d887e8
PH
4519
4520 Rationale:
aeb5907d
JB
4521 First, in cases where an object renaming is implemented as a
4522 reference variable, GNAT may produce both the actual reference
4523 variable and the renaming encoding. In this case, we discard the
4524 latter.
4525
4526 Second, GNAT emits a type following a specified encoding for each renaming
96d887e8
PH
4527 entity. Unfortunately, STABS currently does not support the definition
4528 of types that are local to a given lexical block, so all renamings types
4529 are emitted at library level. As a consequence, if an application
4530 contains two renaming entities using the same name, and a user tries to
4531 print the value of one of these entities, the result of the ada symbol
4532 lookup will also contain the wrong renaming type.
f26caa11 4533
96d887e8
PH
4534 This function partially covers for this limitation by attempting to
4535 remove from the SYMS list renaming symbols that should be visible
4536 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4537 method with the current information available. The implementation
4538 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4539
4540 - When the user tries to print a rename in a function while there
4541 is another rename entity defined in a package: Normally, the
4542 rename in the function has precedence over the rename in the
4543 package, so the latter should be removed from the list. This is
4544 currently not the case.
4545
4546 - This function will incorrectly remove valid renames if
4547 the CURRENT_BLOCK corresponds to a function which symbol name
4548 has been changed by an "Export" pragma. As a consequence,
4549 the user will be unable to print such rename entities. */
4c4b4cd2 4550
14f9c5c9 4551static int
aeb5907d
JB
4552remove_irrelevant_renamings (struct ada_symbol_info *syms,
4553 int nsyms, const struct block *current_block)
4c4b4cd2
PH
4554{
4555 struct symbol *current_function;
4556 char *current_function_name;
4557 int i;
aeb5907d
JB
4558 int is_new_style_renaming;
4559
4560 /* If there is both a renaming foo___XR... encoded as a variable and
4561 a simple variable foo in the same block, discard the latter.
4562 First, zero out such symbols, then compress. */
4563 is_new_style_renaming = 0;
4564 for (i = 0; i < nsyms; i += 1)
4565 {
4566 struct symbol *sym = syms[i].sym;
4567 struct block *block = syms[i].block;
4568 const char *name;
4569 const char *suffix;
4570
4571 if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
4572 continue;
4573 name = SYMBOL_LINKAGE_NAME (sym);
4574 suffix = strstr (name, "___XR");
4575
4576 if (suffix != NULL)
4577 {
4578 int name_len = suffix - name;
4579 int j;
4580 is_new_style_renaming = 1;
4581 for (j = 0; j < nsyms; j += 1)
4582 if (i != j && syms[j].sym != NULL
4583 && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
4584 name_len) == 0
4585 && block == syms[j].block)
4586 syms[j].sym = NULL;
4587 }
4588 }
4589 if (is_new_style_renaming)
4590 {
4591 int j, k;
4592
4593 for (j = k = 0; j < nsyms; j += 1)
4594 if (syms[j].sym != NULL)
4595 {
4596 syms[k] = syms[j];
4597 k += 1;
4598 }
4599 return k;
4600 }
4c4b4cd2
PH
4601
4602 /* Extract the function name associated to CURRENT_BLOCK.
4603 Abort if unable to do so. */
76a01679 4604
4c4b4cd2
PH
4605 if (current_block == NULL)
4606 return nsyms;
76a01679 4607
4c4b4cd2
PH
4608 current_function = block_function (current_block);
4609 if (current_function == NULL)
4610 return nsyms;
4611
4612 current_function_name = SYMBOL_LINKAGE_NAME (current_function);
4613 if (current_function_name == NULL)
4614 return nsyms;
4615
4616 /* Check each of the symbols, and remove it from the list if it is
4617 a type corresponding to a renaming that is out of the scope of
4618 the current block. */
4619
4620 i = 0;
4621 while (i < nsyms)
4622 {
aeb5907d
JB
4623 if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
4624 == ADA_OBJECT_RENAMING
4625 && old_renaming_is_invisible (syms[i].sym, current_function_name))
4c4b4cd2
PH
4626 {
4627 int j;
aeb5907d 4628 for (j = i + 1; j < nsyms; j += 1)
76a01679 4629 syms[j - 1] = syms[j];
4c4b4cd2
PH
4630 nsyms -= 1;
4631 }
4632 else
4633 i += 1;
4634 }
4635
4636 return nsyms;
4637}
4638
4639/* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4640 scope and in global scopes, returning the number of matches. Sets
4641 *RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
4642 indicating the symbols found and the blocks and symbol tables (if
4643 any) in which they were found. This vector are transient---good only to
4644 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4645 symbol match within the nest of blocks whose innermost member is BLOCK0,
4646 is the one match returned (no other matches in that or
4647 enclosing blocks is returned). If there are any matches in or
4648 surrounding BLOCK0, then these alone are returned. Otherwise, the
4649 search extends to global and file-scope (static) symbol tables.
4650 Names prefixed with "standard__" are handled specially: "standard__"
4651 is first stripped off, and only static and global symbols are searched. */
14f9c5c9
AS
4652
4653int
4c4b4cd2 4654ada_lookup_symbol_list (const char *name0, const struct block *block0,
76a01679
JB
4655 domain_enum namespace,
4656 struct ada_symbol_info **results)
14f9c5c9
AS
4657{
4658 struct symbol *sym;
4659 struct symtab *s;
4660 struct partial_symtab *ps;
4661 struct blockvector *bv;
4662 struct objfile *objfile;
14f9c5c9 4663 struct block *block;
4c4b4cd2 4664 const char *name;
14f9c5c9 4665 struct minimal_symbol *msymbol;
4c4b4cd2 4666 int wild_match;
14f9c5c9 4667 int cacheIfUnique;
4c4b4cd2
PH
4668 int block_depth;
4669 int ndefns;
14f9c5c9 4670
4c4b4cd2
PH
4671 obstack_free (&symbol_list_obstack, NULL);
4672 obstack_init (&symbol_list_obstack);
14f9c5c9 4673
14f9c5c9
AS
4674 cacheIfUnique = 0;
4675
4676 /* Search specified block and its superiors. */
4677
4c4b4cd2
PH
4678 wild_match = (strstr (name0, "__") == NULL);
4679 name = name0;
76a01679
JB
4680 block = (struct block *) block0; /* FIXME: No cast ought to be
4681 needed, but adding const will
4682 have a cascade effect. */
4c4b4cd2
PH
4683 if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
4684 {
4685 wild_match = 0;
4686 block = NULL;
4687 name = name0 + sizeof ("standard__") - 1;
4688 }
4689
4690 block_depth = 0;
14f9c5c9
AS
4691 while (block != NULL)
4692 {
4c4b4cd2 4693 block_depth += 1;
76a01679
JB
4694 ada_add_block_symbols (&symbol_list_obstack, block, name,
4695 namespace, NULL, NULL, wild_match);
14f9c5c9 4696
4c4b4cd2
PH
4697 /* If we found a non-function match, assume that's the one. */
4698 if (is_nonfunction (defns_collected (&symbol_list_obstack, 0),
76a01679 4699 num_defns_collected (&symbol_list_obstack)))
4c4b4cd2 4700 goto done;
14f9c5c9
AS
4701
4702 block = BLOCK_SUPERBLOCK (block);
4703 }
4704
4c4b4cd2
PH
4705 /* If no luck so far, try to find NAME as a local symbol in some lexically
4706 enclosing subprogram. */
4707 if (num_defns_collected (&symbol_list_obstack) == 0 && block_depth > 2)
4708 add_symbols_from_enclosing_procs (&symbol_list_obstack,
76a01679 4709 name, namespace, wild_match);
4c4b4cd2
PH
4710
4711 /* If we found ANY matches among non-global symbols, we're done. */
14f9c5c9 4712
4c4b4cd2 4713 if (num_defns_collected (&symbol_list_obstack) > 0)
14f9c5c9 4714 goto done;
d2e4a39e 4715
14f9c5c9 4716 cacheIfUnique = 1;
4c4b4cd2
PH
4717 if (lookup_cached_symbol (name0, namespace, &sym, &block, &s))
4718 {
4719 if (sym != NULL)
4720 add_defn_to_vec (&symbol_list_obstack, sym, block, s);
4721 goto done;
4722 }
14f9c5c9
AS
4723
4724 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4c4b4cd2 4725 tables, and psymtab's. */
14f9c5c9 4726
11309657 4727 ALL_PRIMARY_SYMTABS (objfile, s)
d2e4a39e
AS
4728 {
4729 QUIT;
d2e4a39e
AS
4730 bv = BLOCKVECTOR (s);
4731 block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
76a01679
JB
4732 ada_add_block_symbols (&symbol_list_obstack, block, name, namespace,
4733 objfile, s, wild_match);
d2e4a39e 4734 }
14f9c5c9 4735
4c4b4cd2 4736 if (namespace == VAR_DOMAIN)
14f9c5c9
AS
4737 {
4738 ALL_MSYMBOLS (objfile, msymbol)
d2e4a39e 4739 {
4c4b4cd2
PH
4740 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match))
4741 {
4742 switch (MSYMBOL_TYPE (msymbol))
4743 {
4744 case mst_solib_trampoline:
4745 break;
4746 default:
4747 s = find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol));
4748 if (s != NULL)
4749 {
4750 int ndefns0 = num_defns_collected (&symbol_list_obstack);
4751 QUIT;
4752 bv = BLOCKVECTOR (s);
4753 block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
4754 ada_add_block_symbols (&symbol_list_obstack, block,
4755 SYMBOL_LINKAGE_NAME (msymbol),
4756 namespace, objfile, s, wild_match);
76a01679 4757
4c4b4cd2
PH
4758 if (num_defns_collected (&symbol_list_obstack) == ndefns0)
4759 {
4760 block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
4761 ada_add_block_symbols (&symbol_list_obstack, block,
4762 SYMBOL_LINKAGE_NAME (msymbol),
4763 namespace, objfile, s,
4764 wild_match);
4765 }
4766 }
4767 }
4768 }
d2e4a39e 4769 }
14f9c5c9 4770 }
d2e4a39e 4771
14f9c5c9 4772 ALL_PSYMTABS (objfile, ps)
d2e4a39e
AS
4773 {
4774 QUIT;
4775 if (!ps->readin
4c4b4cd2 4776 && ada_lookup_partial_symbol (ps, name, 1, namespace, wild_match))
d2e4a39e 4777 {
4c4b4cd2
PH
4778 s = PSYMTAB_TO_SYMTAB (ps);
4779 if (!s->primary)
4780 continue;
4781 bv = BLOCKVECTOR (s);
4782 block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
4783 ada_add_block_symbols (&symbol_list_obstack, block, name,
76a01679 4784 namespace, objfile, s, wild_match);
d2e4a39e
AS
4785 }
4786 }
4787
4c4b4cd2 4788 /* Now add symbols from all per-file blocks if we've gotten no hits
14f9c5c9 4789 (Not strictly correct, but perhaps better than an error).
4c4b4cd2 4790 Do the symtabs first, then check the psymtabs. */
d2e4a39e 4791
4c4b4cd2 4792 if (num_defns_collected (&symbol_list_obstack) == 0)
14f9c5c9
AS
4793 {
4794
11309657 4795 ALL_PRIMARY_SYMTABS (objfile, s)
d2e4a39e 4796 {
4c4b4cd2 4797 QUIT;
4c4b4cd2
PH
4798 bv = BLOCKVECTOR (s);
4799 block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
76a01679
JB
4800 ada_add_block_symbols (&symbol_list_obstack, block, name, namespace,
4801 objfile, s, wild_match);
d2e4a39e
AS
4802 }
4803
14f9c5c9 4804 ALL_PSYMTABS (objfile, ps)
d2e4a39e 4805 {
4c4b4cd2
PH
4806 QUIT;
4807 if (!ps->readin
4808 && ada_lookup_partial_symbol (ps, name, 0, namespace, wild_match))
4809 {
4810 s = PSYMTAB_TO_SYMTAB (ps);
4811 bv = BLOCKVECTOR (s);
4812 if (!s->primary)
4813 continue;
4814 block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
76a01679
JB
4815 ada_add_block_symbols (&symbol_list_obstack, block, name,
4816 namespace, objfile, s, wild_match);
4c4b4cd2 4817 }
d2e4a39e
AS
4818 }
4819 }
14f9c5c9 4820
4c4b4cd2
PH
4821done:
4822 ndefns = num_defns_collected (&symbol_list_obstack);
4823 *results = defns_collected (&symbol_list_obstack, 1);
4824
4825 ndefns = remove_extra_symbols (*results, ndefns);
4826
d2e4a39e 4827 if (ndefns == 0)
4c4b4cd2 4828 cache_symbol (name0, namespace, NULL, NULL, NULL);
14f9c5c9 4829
4c4b4cd2 4830 if (ndefns == 1 && cacheIfUnique)
76a01679
JB
4831 cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block,
4832 (*results)[0].symtab);
14f9c5c9 4833
aeb5907d 4834 ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
14f9c5c9 4835
14f9c5c9
AS
4836 return ndefns;
4837}
4838
d2e4a39e 4839struct symbol *
aeb5907d
JB
4840ada_lookup_encoded_symbol (const char *name, const struct block *block0,
4841 domain_enum namespace,
4842 struct block **block_found, struct symtab **symtab)
14f9c5c9 4843{
4c4b4cd2 4844 struct ada_symbol_info *candidates;
14f9c5c9
AS
4845 int n_candidates;
4846
aeb5907d 4847 n_candidates = ada_lookup_symbol_list (name, block0, namespace, &candidates);
14f9c5c9
AS
4848
4849 if (n_candidates == 0)
4850 return NULL;
4c4b4cd2 4851
aeb5907d
JB
4852 if (block_found != NULL)
4853 *block_found = candidates[0].block;
4c4b4cd2 4854
76a01679 4855 if (symtab != NULL)
4c4b4cd2
PH
4856 {
4857 *symtab = candidates[0].symtab;
76a01679
JB
4858 if (*symtab == NULL && candidates[0].block != NULL)
4859 {
4860 struct objfile *objfile;
4861 struct symtab *s;
4862 struct block *b;
4863 struct blockvector *bv;
4864
4865 /* Search the list of symtabs for one which contains the
4866 address of the start of this block. */
11309657 4867 ALL_PRIMARY_SYMTABS (objfile, s)
76a01679
JB
4868 {
4869 bv = BLOCKVECTOR (s);
4870 b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
4871 if (BLOCK_START (b) <= BLOCK_START (candidates[0].block)
4872 && BLOCK_END (b) > BLOCK_START (candidates[0].block))
4873 {
4874 *symtab = s;
4875 return fixup_symbol_section (candidates[0].sym, objfile);
4876 }
76a01679 4877 }
529cad9c
PH
4878 /* FIXME: brobecker/2004-11-12: I think that we should never
4879 reach this point. I don't see a reason why we would not
4880 find a symtab for a given block, so I suggest raising an
4881 internal_error exception here. Otherwise, we end up
4882 returning a symbol but no symtab, which certain parts of
4883 the code that rely (indirectly) on this function do not
4884 expect, eventually causing a SEGV. */
4885 return fixup_symbol_section (candidates[0].sym, NULL);
76a01679
JB
4886 }
4887 }
4c4b4cd2 4888 return candidates[0].sym;
aeb5907d
JB
4889}
4890
4891/* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4892 scope and in global scopes, or NULL if none. NAME is folded and
4893 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4894 choosing the first symbol if there are multiple choices.
4895 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4896 table in which the symbol was found (in both cases, these
4897 assignments occur only if the pointers are non-null). */
4898struct symbol *
4899ada_lookup_symbol (const char *name, const struct block *block0,
4900 domain_enum namespace, int *is_a_field_of_this,
4901 struct symtab **symtab)
4902{
4903 if (is_a_field_of_this != NULL)
4904 *is_a_field_of_this = 0;
4905
4906 return
4907 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
4908 block0, namespace, NULL, symtab);
4c4b4cd2 4909}
14f9c5c9 4910
4c4b4cd2
PH
4911static struct symbol *
4912ada_lookup_symbol_nonlocal (const char *name,
76a01679
JB
4913 const char *linkage_name,
4914 const struct block *block,
4915 const domain_enum domain, struct symtab **symtab)
4c4b4cd2
PH
4916{
4917 if (linkage_name == NULL)
4918 linkage_name = name;
76a01679
JB
4919 return ada_lookup_symbol (linkage_name, block_static_block (block), domain,
4920 NULL, symtab);
14f9c5c9
AS
4921}
4922
4923
4c4b4cd2
PH
4924/* True iff STR is a possible encoded suffix of a normal Ada name
4925 that is to be ignored for matching purposes. Suffixes of parallel
4926 names (e.g., XVE) are not included here. Currently, the possible suffixes
4927 are given by either of the regular expression:
4928
529cad9c
PH
4929 (__[0-9]+)?[.$][0-9]+ [nested subprogram suffix, on platforms such
4930 as GNU/Linux]
4c4b4cd2 4931 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
529cad9c 4932 _E[0-9]+[bs]$ [protected object entry suffixes]
61ee279c 4933 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
14f9c5c9 4934 */
4c4b4cd2 4935
14f9c5c9 4936static int
d2e4a39e 4937is_name_suffix (const char *str)
14f9c5c9
AS
4938{
4939 int k;
4c4b4cd2
PH
4940 const char *matching;
4941 const int len = strlen (str);
4942
4943 /* (__[0-9]+)?\.[0-9]+ */
4944 matching = str;
4945 if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
4946 {
4947 matching += 3;
4948 while (isdigit (matching[0]))
4949 matching += 1;
4950 if (matching[0] == '\0')
4951 return 1;
4952 }
4953
529cad9c 4954 if (matching[0] == '.' || matching[0] == '$')
4c4b4cd2
PH
4955 {
4956 matching += 1;
4957 while (isdigit (matching[0]))
4958 matching += 1;
4959 if (matching[0] == '\0')
4960 return 1;
4961 }
4962
4963 /* ___[0-9]+ */
4964 if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
4965 {
4966 matching = str + 3;
4967 while (isdigit (matching[0]))
4968 matching += 1;
4969 if (matching[0] == '\0')
4970 return 1;
4971 }
4972
529cad9c
PH
4973#if 0
4974 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4975 with a N at the end. Unfortunately, the compiler uses the same
4976 convention for other internal types it creates. So treating
4977 all entity names that end with an "N" as a name suffix causes
4978 some regressions. For instance, consider the case of an enumerated
4979 type. To support the 'Image attribute, it creates an array whose
4980 name ends with N.
4981 Having a single character like this as a suffix carrying some
4982 information is a bit risky. Perhaps we should change the encoding
4983 to be something like "_N" instead. In the meantime, do not do
4984 the following check. */
4985 /* Protected Object Subprograms */
4986 if (len == 1 && str [0] == 'N')
4987 return 1;
4988#endif
4989
4990 /* _E[0-9]+[bs]$ */
4991 if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
4992 {
4993 matching = str + 3;
4994 while (isdigit (matching[0]))
4995 matching += 1;
4996 if ((matching[0] == 'b' || matching[0] == 's')
4997 && matching [1] == '\0')
4998 return 1;
4999 }
5000
4c4b4cd2
PH
5001 /* ??? We should not modify STR directly, as we are doing below. This
5002 is fine in this case, but may become problematic later if we find
5003 that this alternative did not work, and want to try matching
5004 another one from the begining of STR. Since we modified it, we
5005 won't be able to find the begining of the string anymore! */
14f9c5c9
AS
5006 if (str[0] == 'X')
5007 {
5008 str += 1;
d2e4a39e 5009 while (str[0] != '_' && str[0] != '\0')
4c4b4cd2
PH
5010 {
5011 if (str[0] != 'n' && str[0] != 'b')
5012 return 0;
5013 str += 1;
5014 }
14f9c5c9
AS
5015 }
5016 if (str[0] == '\000')
5017 return 1;
d2e4a39e 5018 if (str[0] == '_')
14f9c5c9
AS
5019 {
5020 if (str[1] != '_' || str[2] == '\000')
4c4b4cd2 5021 return 0;
d2e4a39e 5022 if (str[2] == '_')
4c4b4cd2 5023 {
61ee279c
PH
5024 if (strcmp (str + 3, "JM") == 0)
5025 return 1;
5026 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5027 the LJM suffix in favor of the JM one. But we will
5028 still accept LJM as a valid suffix for a reasonable
5029 amount of time, just to allow ourselves to debug programs
5030 compiled using an older version of GNAT. */
4c4b4cd2
PH
5031 if (strcmp (str + 3, "LJM") == 0)
5032 return 1;
5033 if (str[3] != 'X')
5034 return 0;
1265e4aa
JB
5035 if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
5036 || str[4] == 'U' || str[4] == 'P')
4c4b4cd2
PH
5037 return 1;
5038 if (str[4] == 'R' && str[5] != 'T')
5039 return 1;
5040 return 0;
5041 }
5042 if (!isdigit (str[2]))
5043 return 0;
5044 for (k = 3; str[k] != '\0'; k += 1)
5045 if (!isdigit (str[k]) && str[k] != '_')
5046 return 0;
14f9c5c9
AS
5047 return 1;
5048 }
4c4b4cd2 5049 if (str[0] == '$' && isdigit (str[1]))
14f9c5c9 5050 {
4c4b4cd2
PH
5051 for (k = 2; str[k] != '\0'; k += 1)
5052 if (!isdigit (str[k]) && str[k] != '_')
5053 return 0;
14f9c5c9
AS
5054 return 1;
5055 }
5056 return 0;
5057}
d2e4a39e 5058
4c4b4cd2
PH
5059/* Return nonzero if the given string starts with a dot ('.')
5060 followed by zero or more digits.
5061
5062 Note: brobecker/2003-11-10: A forward declaration has not been
5063 added at the begining of this file yet, because this function
5064 is only used to work around a problem found during wild matching
5065 when trying to match minimal symbol names against symbol names
5066 obtained from dwarf-2 data. This function is therefore currently
5067 only used in wild_match() and is likely to be deleted when the
5068 problem in dwarf-2 is fixed. */
5069
5070static int
5071is_dot_digits_suffix (const char *str)
5072{
5073 if (str[0] != '.')
5074 return 0;
5075
5076 str++;
5077 while (isdigit (str[0]))
5078 str++;
5079 return (str[0] == '\0');
5080}
5081
aeb5907d
JB
5082/* Return non-zero if the string starting at NAME and ending before
5083 NAME_END contains no capital letters. */
529cad9c
PH
5084
5085static int
5086is_valid_name_for_wild_match (const char *name0)
5087{
5088 const char *decoded_name = ada_decode (name0);
5089 int i;
5090
5091 for (i=0; decoded_name[i] != '\0'; i++)
5092 if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
5093 return 0;
5094
5095 return 1;
5096}
5097
4c4b4cd2
PH
5098/* True if NAME represents a name of the form A1.A2....An, n>=1 and
5099 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5100 informational suffixes of NAME (i.e., for which is_name_suffix is
5101 true). */
5102
14f9c5c9 5103static int
4c4b4cd2 5104wild_match (const char *patn0, int patn_len, const char *name0)
14f9c5c9
AS
5105{
5106 int name_len;
4c4b4cd2 5107 char *name;
aeb5907d 5108 char *name_start;
4c4b4cd2
PH
5109 char *patn;
5110
5111 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
5112 stored in the symbol table for nested function names is sometimes
5113 different from the name of the associated entity stored in
5114 the dwarf-2 data: This is the case for nested subprograms, where
5115 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
5116 while the symbol name from the dwarf-2 data does not.
5117
5118 Although the DWARF-2 standard documents that entity names stored
5119 in the dwarf-2 data should be identical to the name as seen in
5120 the source code, GNAT takes a different approach as we already use
5121 a special encoding mechanism to convey the information so that
5122 a C debugger can still use the information generated to debug
5123 Ada programs. A corollary is that the symbol names in the dwarf-2
5124 data should match the names found in the symbol table. I therefore
5125 consider this issue as a compiler defect.
76a01679 5126
4c4b4cd2
PH
5127 Until the compiler is properly fixed, we work-around the problem
5128 by ignoring such suffixes during the match. We do so by making
5129 a copy of PATN0 and NAME0, and then by stripping such a suffix
5130 if present. We then perform the match on the resulting strings. */
5131 {
5132 char *dot;
5133 name_len = strlen (name0);
5134
aeb5907d 5135 name = name_start = (char *) alloca ((name_len + 1) * sizeof (char));
4c4b4cd2
PH
5136 strcpy (name, name0);
5137 dot = strrchr (name, '.');
5138 if (dot != NULL && is_dot_digits_suffix (dot))
5139 *dot = '\0';
5140
5141 patn = (char *) alloca ((patn_len + 1) * sizeof (char));
5142 strncpy (patn, patn0, patn_len);
5143 patn[patn_len] = '\0';
5144 dot = strrchr (patn, '.');
5145 if (dot != NULL && is_dot_digits_suffix (dot))
5146 {
5147 *dot = '\0';
5148 patn_len = dot - patn;
5149 }
5150 }
5151
5152 /* Now perform the wild match. */
14f9c5c9
AS
5153
5154 name_len = strlen (name);
4c4b4cd2
PH
5155 if (name_len >= patn_len + 5 && strncmp (name, "_ada_", 5) == 0
5156 && strncmp (patn, name + 5, patn_len) == 0
d2e4a39e 5157 && is_name_suffix (name + patn_len + 5))
14f9c5c9
AS
5158 return 1;
5159
d2e4a39e 5160 while (name_len >= patn_len)
14f9c5c9 5161 {
4c4b4cd2
PH
5162 if (strncmp (patn, name, patn_len) == 0
5163 && is_name_suffix (name + patn_len))
aeb5907d 5164 return (name == name_start || is_valid_name_for_wild_match (name0));
4c4b4cd2
PH
5165 do
5166 {
5167 name += 1;
5168 name_len -= 1;
5169 }
d2e4a39e 5170 while (name_len > 0
4c4b4cd2 5171 && name[0] != '.' && (name[0] != '_' || name[1] != '_'));
14f9c5c9 5172 if (name_len <= 0)
4c4b4cd2 5173 return 0;
14f9c5c9 5174 if (name[0] == '_')
4c4b4cd2
PH
5175 {
5176 if (!islower (name[2]))
5177 return 0;
5178 name += 2;
5179 name_len -= 2;
5180 }
14f9c5c9 5181 else
4c4b4cd2
PH
5182 {
5183 if (!islower (name[1]))
5184 return 0;
5185 name += 1;
5186 name_len -= 1;
5187 }
96d887e8
PH
5188 }
5189
5190 return 0;
5191}
5192
5193
5194/* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5195 vector *defn_symbols, updating the list of symbols in OBSTACKP
5196 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5197 OBJFILE is the section containing BLOCK.
5198 SYMTAB is recorded with each symbol added. */
5199
5200static void
5201ada_add_block_symbols (struct obstack *obstackp,
76a01679 5202 struct block *block, const char *name,
96d887e8
PH
5203 domain_enum domain, struct objfile *objfile,
5204 struct symtab *symtab, int wild)
5205{
5206 struct dict_iterator iter;
5207 int name_len = strlen (name);
5208 /* A matching argument symbol, if any. */
5209 struct symbol *arg_sym;
5210 /* Set true when we find a matching non-argument symbol. */
5211 int found_sym;
5212 struct symbol *sym;
5213
5214 arg_sym = NULL;
5215 found_sym = 0;
5216 if (wild)
5217 {
5218 struct symbol *sym;
5219 ALL_BLOCK_SYMBOLS (block, iter, sym)
76a01679 5220 {
1265e4aa
JB
5221 if (SYMBOL_DOMAIN (sym) == domain
5222 && wild_match (name, name_len, SYMBOL_LINKAGE_NAME (sym)))
76a01679
JB
5223 {
5224 switch (SYMBOL_CLASS (sym))
5225 {
5226 case LOC_ARG:
5227 case LOC_LOCAL_ARG:
5228 case LOC_REF_ARG:
5229 case LOC_REGPARM:
5230 case LOC_REGPARM_ADDR:
5231 case LOC_BASEREG_ARG:
5232 case LOC_COMPUTED_ARG:
5233 arg_sym = sym;
5234 break;
5235 case LOC_UNRESOLVED:
5236 continue;
5237 default:
5238 found_sym = 1;
5239 add_defn_to_vec (obstackp,
5240 fixup_symbol_section (sym, objfile),
5241 block, symtab);
5242 break;
5243 }
5244 }
5245 }
96d887e8
PH
5246 }
5247 else
5248 {
5249 ALL_BLOCK_SYMBOLS (block, iter, sym)
76a01679
JB
5250 {
5251 if (SYMBOL_DOMAIN (sym) == domain)
5252 {
5253 int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym), name_len);
5254 if (cmp == 0
5255 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len))
5256 {
5257 switch (SYMBOL_CLASS (sym))
5258 {
5259 case LOC_ARG:
5260 case LOC_LOCAL_ARG:
5261 case LOC_REF_ARG:
5262 case LOC_REGPARM:
5263 case LOC_REGPARM_ADDR:
5264 case LOC_BASEREG_ARG:
5265 case LOC_COMPUTED_ARG:
5266 arg_sym = sym;
5267 break;
5268 case LOC_UNRESOLVED:
5269 break;
5270 default:
5271 found_sym = 1;
5272 add_defn_to_vec (obstackp,
5273 fixup_symbol_section (sym, objfile),
5274 block, symtab);
5275 break;
5276 }
5277 }
5278 }
5279 }
96d887e8
PH
5280 }
5281
5282 if (!found_sym && arg_sym != NULL)
5283 {
76a01679
JB
5284 add_defn_to_vec (obstackp,
5285 fixup_symbol_section (arg_sym, objfile),
5286 block, symtab);
96d887e8
PH
5287 }
5288
5289 if (!wild)
5290 {
5291 arg_sym = NULL;
5292 found_sym = 0;
5293
5294 ALL_BLOCK_SYMBOLS (block, iter, sym)
76a01679
JB
5295 {
5296 if (SYMBOL_DOMAIN (sym) == domain)
5297 {
5298 int cmp;
5299
5300 cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
5301 if (cmp == 0)
5302 {
5303 cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
5304 if (cmp == 0)
5305 cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
5306 name_len);
5307 }
5308
5309 if (cmp == 0
5310 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
5311 {
5312 switch (SYMBOL_CLASS (sym))
5313 {
5314 case LOC_ARG:
5315 case LOC_LOCAL_ARG:
5316 case LOC_REF_ARG:
5317 case LOC_REGPARM:
5318 case LOC_REGPARM_ADDR:
5319 case LOC_BASEREG_ARG:
5320 case LOC_COMPUTED_ARG:
5321 arg_sym = sym;
5322 break;
5323 case LOC_UNRESOLVED:
5324 break;
5325 default:
5326 found_sym = 1;
5327 add_defn_to_vec (obstackp,
5328 fixup_symbol_section (sym, objfile),
5329 block, symtab);
5330 break;
5331 }
5332 }
5333 }
76a01679 5334 }
96d887e8
PH
5335
5336 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5337 They aren't parameters, right? */
5338 if (!found_sym && arg_sym != NULL)
5339 {
5340 add_defn_to_vec (obstackp,
76a01679
JB
5341 fixup_symbol_section (arg_sym, objfile),
5342 block, symtab);
96d887e8
PH
5343 }
5344 }
5345}
5346\f
963a6417 5347 /* Field Access */
96d887e8 5348
73fb9985
JB
5349/* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5350 for tagged types. */
5351
5352static int
5353ada_is_dispatch_table_ptr_type (struct type *type)
5354{
5355 char *name;
5356
5357 if (TYPE_CODE (type) != TYPE_CODE_PTR)
5358 return 0;
5359
5360 name = TYPE_NAME (TYPE_TARGET_TYPE (type));
5361 if (name == NULL)
5362 return 0;
5363
5364 return (strcmp (name, "ada__tags__dispatch_table") == 0);
5365}
5366
963a6417
PH
5367/* True if field number FIELD_NUM in struct or union type TYPE is supposed
5368 to be invisible to users. */
96d887e8 5369
963a6417
PH
5370int
5371ada_is_ignored_field (struct type *type, int field_num)
96d887e8 5372{
963a6417
PH
5373 if (field_num < 0 || field_num > TYPE_NFIELDS (type))
5374 return 1;
73fb9985
JB
5375
5376 /* Check the name of that field. */
5377 {
5378 const char *name = TYPE_FIELD_NAME (type, field_num);
5379
5380 /* Anonymous field names should not be printed.
5381 brobecker/2007-02-20: I don't think this can actually happen
5382 but we don't want to print the value of annonymous fields anyway. */
5383 if (name == NULL)
5384 return 1;
5385
5386 /* A field named "_parent" is internally generated by GNAT for
5387 tagged types, and should not be printed either. */
5388 if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
5389 return 1;
5390 }
5391
5392 /* If this is the dispatch table of a tagged type, then ignore. */
5393 if (ada_is_tagged_type (type, 1)
5394 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)))
5395 return 1;
5396
5397 /* Not a special field, so it should not be ignored. */
5398 return 0;
963a6417 5399}
96d887e8 5400
963a6417
PH
5401/* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5402 pointer or reference type whose ultimate target has a tag field. */
96d887e8 5403
963a6417
PH
5404int
5405ada_is_tagged_type (struct type *type, int refok)
5406{
5407 return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
5408}
96d887e8 5409
963a6417 5410/* True iff TYPE represents the type of X'Tag */
96d887e8 5411
963a6417
PH
5412int
5413ada_is_tag_type (struct type *type)
5414{
5415 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
5416 return 0;
5417 else
96d887e8 5418 {
963a6417
PH
5419 const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
5420 return (name != NULL
5421 && strcmp (name, "ada__tags__dispatch_table") == 0);
96d887e8 5422 }
96d887e8
PH
5423}
5424
963a6417 5425/* The type of the tag on VAL. */
76a01679 5426
963a6417
PH
5427struct type *
5428ada_tag_type (struct value *val)
96d887e8 5429{
df407dfe 5430 return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
963a6417 5431}
96d887e8 5432
963a6417 5433/* The value of the tag on VAL. */
96d887e8 5434
963a6417
PH
5435struct value *
5436ada_value_tag (struct value *val)
5437{
03ee6b2e 5438 return ada_value_struct_elt (val, "_tag", 0);
96d887e8
PH
5439}
5440
963a6417
PH
5441/* The value of the tag on the object of type TYPE whose contents are
5442 saved at VALADDR, if it is non-null, or is at memory address
5443 ADDRESS. */
96d887e8 5444
963a6417 5445static struct value *
10a2c479 5446value_tag_from_contents_and_address (struct type *type,
fc1a4b47 5447 const gdb_byte *valaddr,
963a6417 5448 CORE_ADDR address)
96d887e8 5449{
963a6417
PH
5450 int tag_byte_offset, dummy1, dummy2;
5451 struct type *tag_type;
5452 if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
52ce6436 5453 NULL, NULL, NULL))
96d887e8 5454 {
fc1a4b47 5455 const gdb_byte *valaddr1 = ((valaddr == NULL)
10a2c479
AC
5456 ? NULL
5457 : valaddr + tag_byte_offset);
963a6417 5458 CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
96d887e8 5459
963a6417 5460 return value_from_contents_and_address (tag_type, valaddr1, address1);
96d887e8 5461 }
963a6417
PH
5462 return NULL;
5463}
96d887e8 5464
963a6417
PH
5465static struct type *
5466type_from_tag (struct value *tag)
5467{
5468 const char *type_name = ada_tag_name (tag);
5469 if (type_name != NULL)
5470 return ada_find_any_type (ada_encode (type_name));
5471 return NULL;
5472}
96d887e8 5473
963a6417
PH
5474struct tag_args
5475{
5476 struct value *tag;
5477 char *name;
5478};
4c4b4cd2 5479
529cad9c
PH
5480
5481static int ada_tag_name_1 (void *);
5482static int ada_tag_name_2 (struct tag_args *);
5483
4c4b4cd2
PH
5484/* Wrapper function used by ada_tag_name. Given a struct tag_args*
5485 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5486 The value stored in ARGS->name is valid until the next call to
5487 ada_tag_name_1. */
5488
5489static int
5490ada_tag_name_1 (void *args0)
5491{
5492 struct tag_args *args = (struct tag_args *) args0;
5493 static char name[1024];
76a01679 5494 char *p;
4c4b4cd2
PH
5495 struct value *val;
5496 args->name = NULL;
03ee6b2e 5497 val = ada_value_struct_elt (args->tag, "tsd", 1);
529cad9c
PH
5498 if (val == NULL)
5499 return ada_tag_name_2 (args);
03ee6b2e 5500 val = ada_value_struct_elt (val, "expanded_name", 1);
529cad9c
PH
5501 if (val == NULL)
5502 return 0;
5503 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5504 for (p = name; *p != '\0'; p += 1)
5505 if (isalpha (*p))
5506 *p = tolower (*p);
5507 args->name = name;
5508 return 0;
5509}
5510
5511/* Utility function for ada_tag_name_1 that tries the second
5512 representation for the dispatch table (in which there is no
5513 explicit 'tsd' field in the referent of the tag pointer, and instead
5514 the tsd pointer is stored just before the dispatch table. */
5515
5516static int
5517ada_tag_name_2 (struct tag_args *args)
5518{
5519 struct type *info_type;
5520 static char name[1024];
5521 char *p;
5522 struct value *val, *valp;
5523
5524 args->name = NULL;
5525 info_type = ada_find_any_type ("ada__tags__type_specific_data");
5526 if (info_type == NULL)
5527 return 0;
5528 info_type = lookup_pointer_type (lookup_pointer_type (info_type));
5529 valp = value_cast (info_type, args->tag);
5530 if (valp == NULL)
5531 return 0;
5532 val = value_ind (value_add (valp, value_from_longest (builtin_type_int, -1)));
4c4b4cd2
PH
5533 if (val == NULL)
5534 return 0;
03ee6b2e 5535 val = ada_value_struct_elt (val, "expanded_name", 1);
4c4b4cd2
PH
5536 if (val == NULL)
5537 return 0;
5538 read_memory_string (value_as_address (val), name, sizeof (name) - 1);
5539 for (p = name; *p != '\0'; p += 1)
5540 if (isalpha (*p))
5541 *p = tolower (*p);
5542 args->name = name;
5543 return 0;
5544}
5545
5546/* The type name of the dynamic type denoted by the 'tag value TAG, as
5547 * a C string. */
5548
5549const char *
5550ada_tag_name (struct value *tag)
5551{
5552 struct tag_args args;
df407dfe 5553 if (!ada_is_tag_type (value_type (tag)))
4c4b4cd2 5554 return NULL;
76a01679 5555 args.tag = tag;
4c4b4cd2
PH
5556 args.name = NULL;
5557 catch_errors (ada_tag_name_1, &args, NULL, RETURN_MASK_ALL);
5558 return args.name;
5559}
5560
5561/* The parent type of TYPE, or NULL if none. */
14f9c5c9 5562
d2e4a39e 5563struct type *
ebf56fd3 5564ada_parent_type (struct type *type)
14f9c5c9
AS
5565{
5566 int i;
5567
61ee279c 5568 type = ada_check_typedef (type);
14f9c5c9
AS
5569
5570 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
5571 return NULL;
5572
5573 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
5574 if (ada_is_parent_field (type, i))
61ee279c 5575 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
14f9c5c9
AS
5576
5577 return NULL;
5578}
5579
4c4b4cd2
PH
5580/* True iff field number FIELD_NUM of structure type TYPE contains the
5581 parent-type (inherited) fields of a derived type. Assumes TYPE is
5582 a structure type with at least FIELD_NUM+1 fields. */
14f9c5c9
AS
5583
5584int
ebf56fd3 5585ada_is_parent_field (struct type *type, int field_num)
14f9c5c9 5586{
61ee279c 5587 const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
4c4b4cd2
PH
5588 return (name != NULL
5589 && (strncmp (name, "PARENT", 6) == 0
5590 || strncmp (name, "_parent", 7) == 0));
14f9c5c9
AS
5591}
5592
4c4b4cd2 5593/* True iff field number FIELD_NUM of structure type TYPE is a
14f9c5c9 5594 transparent wrapper field (which should be silently traversed when doing
4c4b4cd2 5595 field selection and flattened when printing). Assumes TYPE is a
14f9c5c9 5596 structure type with at least FIELD_NUM+1 fields. Such fields are always
4c4b4cd2 5597 structures. */
14f9c5c9
AS
5598
5599int
ebf56fd3 5600ada_is_wrapper_field (struct type *type, int field_num)
14f9c5c9 5601{
d2e4a39e
AS
5602 const char *name = TYPE_FIELD_NAME (type, field_num);
5603 return (name != NULL
4c4b4cd2
PH
5604 && (strncmp (name, "PARENT", 6) == 0
5605 || strcmp (name, "REP") == 0
5606 || strncmp (name, "_parent", 7) == 0
5607 || name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
14f9c5c9
AS
5608}
5609
4c4b4cd2
PH
5610/* True iff field number FIELD_NUM of structure or union type TYPE
5611 is a variant wrapper. Assumes TYPE is a structure type with at least
5612 FIELD_NUM+1 fields. */
14f9c5c9
AS
5613
5614int
ebf56fd3 5615ada_is_variant_part (struct type *type, int field_num)
14f9c5c9 5616{
d2e4a39e 5617 struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
14f9c5c9 5618 return (TYPE_CODE (field_type) == TYPE_CODE_UNION
4c4b4cd2 5619 || (is_dynamic_field (type, field_num)
c3e5cd34
PH
5620 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
5621 == TYPE_CODE_UNION)));
14f9c5c9
AS
5622}
5623
5624/* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
4c4b4cd2 5625 whose discriminants are contained in the record type OUTER_TYPE,
14f9c5c9
AS
5626 returns the type of the controlling discriminant for the variant. */
5627
d2e4a39e 5628struct type *
ebf56fd3 5629ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
14f9c5c9 5630{
d2e4a39e 5631 char *name = ada_variant_discrim_name (var_type);
76a01679 5632 struct type *type =
4c4b4cd2 5633 ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
14f9c5c9
AS
5634 if (type == NULL)
5635 return builtin_type_int;
5636 else
5637 return type;
5638}
5639
4c4b4cd2 5640/* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
14f9c5c9 5641 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
4c4b4cd2 5642 represents a 'when others' clause; otherwise 0. */
14f9c5c9
AS
5643
5644int
ebf56fd3 5645ada_is_others_clause (struct type *type, int field_num)
14f9c5c9 5646{
d2e4a39e 5647 const char *name = TYPE_FIELD_NAME (type, field_num);
14f9c5c9
AS
5648 return (name != NULL && name[0] == 'O');
5649}
5650
5651/* Assuming that TYPE0 is the type of the variant part of a record,
4c4b4cd2
PH
5652 returns the name of the discriminant controlling the variant.
5653 The value is valid until the next call to ada_variant_discrim_name. */
14f9c5c9 5654
d2e4a39e 5655char *
ebf56fd3 5656ada_variant_discrim_name (struct type *type0)
14f9c5c9 5657{
d2e4a39e 5658 static char *result = NULL;
14f9c5c9 5659 static size_t result_len = 0;
d2e4a39e
AS
5660 struct type *type;
5661 const char *name;
5662 const char *discrim_end;
5663 const char *discrim_start;
14f9c5c9
AS
5664
5665 if (TYPE_CODE (type0) == TYPE_CODE_PTR)
5666 type = TYPE_TARGET_TYPE (type0);
5667 else
5668 type = type0;
5669
5670 name = ada_type_name (type);
5671
5672 if (name == NULL || name[0] == '\000')
5673 return "";
5674
5675 for (discrim_end = name + strlen (name) - 6; discrim_end != name;
5676 discrim_end -= 1)
5677 {
4c4b4cd2
PH
5678 if (strncmp (discrim_end, "___XVN", 6) == 0)
5679 break;
14f9c5c9
AS
5680 }
5681 if (discrim_end == name)
5682 return "";
5683
d2e4a39e 5684 for (discrim_start = discrim_end; discrim_start != name + 3;
14f9c5c9
AS
5685 discrim_start -= 1)
5686 {
d2e4a39e 5687 if (discrim_start == name + 1)
4c4b4cd2 5688 return "";
76a01679 5689 if ((discrim_start > name + 3
4c4b4cd2
PH
5690 && strncmp (discrim_start - 3, "___", 3) == 0)
5691 || discrim_start[-1] == '.')
5692 break;
14f9c5c9
AS
5693 }
5694
5695 GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
5696 strncpy (result, discrim_start, discrim_end - discrim_start);
d2e4a39e 5697 result[discrim_end - discrim_start] = '\0';
14f9c5c9
AS
5698 return result;
5699}
5700
4c4b4cd2
PH
5701/* Scan STR for a subtype-encoded number, beginning at position K.
5702 Put the position of the character just past the number scanned in
5703 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5704 Return 1 if there was a valid number at the given position, and 0
5705 otherwise. A "subtype-encoded" number consists of the absolute value
5706 in decimal, followed by the letter 'm' to indicate a negative number.
5707 Assumes 0m does not occur. */
14f9c5c9
AS
5708
5709int
d2e4a39e 5710ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
14f9c5c9
AS
5711{
5712 ULONGEST RU;
5713
d2e4a39e 5714 if (!isdigit (str[k]))
14f9c5c9
AS
5715 return 0;
5716
4c4b4cd2 5717 /* Do it the hard way so as not to make any assumption about
14f9c5c9 5718 the relationship of unsigned long (%lu scan format code) and
4c4b4cd2 5719 LONGEST. */
14f9c5c9
AS
5720 RU = 0;
5721 while (isdigit (str[k]))
5722 {
d2e4a39e 5723 RU = RU * 10 + (str[k] - '0');
14f9c5c9
AS
5724 k += 1;
5725 }
5726
d2e4a39e 5727 if (str[k] == 'm')
14f9c5c9
AS
5728 {
5729 if (R != NULL)
4c4b4cd2 5730 *R = (-(LONGEST) (RU - 1)) - 1;
14f9c5c9
AS
5731 k += 1;
5732 }
5733 else if (R != NULL)
5734 *R = (LONGEST) RU;
5735
4c4b4cd2 5736 /* NOTE on the above: Technically, C does not say what the results of
14f9c5c9
AS
5737 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5738 number representable as a LONGEST (although either would probably work
5739 in most implementations). When RU>0, the locution in the then branch
4c4b4cd2 5740 above is always equivalent to the negative of RU. */
14f9c5c9
AS
5741
5742 if (new_k != NULL)
5743 *new_k = k;
5744 return 1;
5745}
5746
4c4b4cd2
PH
5747/* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5748 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5749 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
14f9c5c9 5750
d2e4a39e 5751int
ebf56fd3 5752ada_in_variant (LONGEST val, struct type *type, int field_num)
14f9c5c9 5753{
d2e4a39e 5754 const char *name = TYPE_FIELD_NAME (type, field_num);
14f9c5c9
AS
5755 int p;
5756
5757 p = 0;
5758 while (1)
5759 {
d2e4a39e 5760 switch (name[p])
4c4b4cd2
PH
5761 {
5762 case '\0':
5763 return 0;
5764 case 'S':
5765 {
5766 LONGEST W;
5767 if (!ada_scan_number (name, p + 1, &W, &p))
5768 return 0;
5769 if (val == W)
5770 return 1;
5771 break;
5772 }
5773 case 'R':
5774 {
5775 LONGEST L, U;
5776 if (!ada_scan_number (name, p + 1, &L, &p)
5777 || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
5778 return 0;
5779 if (val >= L && val <= U)
5780 return 1;
5781 break;
5782 }
5783 case 'O':
5784 return 1;
5785 default:
5786 return 0;
5787 }
5788 }
5789}
5790
5791/* FIXME: Lots of redundancy below. Try to consolidate. */
5792
5793/* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5794 ARG_TYPE, extract and return the value of one of its (non-static)
5795 fields. FIELDNO says which field. Differs from value_primitive_field
5796 only in that it can handle packed values of arbitrary type. */
14f9c5c9 5797
4c4b4cd2 5798static struct value *
d2e4a39e 5799ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
4c4b4cd2 5800 struct type *arg_type)
14f9c5c9 5801{
14f9c5c9
AS
5802 struct type *type;
5803
61ee279c 5804 arg_type = ada_check_typedef (arg_type);
14f9c5c9
AS
5805 type = TYPE_FIELD_TYPE (arg_type, fieldno);
5806
4c4b4cd2 5807 /* Handle packed fields. */
14f9c5c9
AS
5808
5809 if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
5810 {
5811 int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
5812 int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
d2e4a39e 5813
0fd88904 5814 return ada_value_primitive_packed_val (arg1, value_contents (arg1),
4c4b4cd2
PH
5815 offset + bit_pos / 8,
5816 bit_pos % 8, bit_size, type);
14f9c5c9
AS
5817 }
5818 else
5819 return value_primitive_field (arg1, offset, fieldno, arg_type);
5820}
5821
52ce6436
PH
5822/* Find field with name NAME in object of type TYPE. If found,
5823 set the following for each argument that is non-null:
5824 - *FIELD_TYPE_P to the field's type;
5825 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5826 an object of that type;
5827 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5828 - *BIT_SIZE_P to its size in bits if the field is packed, and
5829 0 otherwise;
5830 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5831 fields up to but not including the desired field, or by the total
5832 number of fields if not found. A NULL value of NAME never
5833 matches; the function just counts visible fields in this case.
5834
5835 Returns 1 if found, 0 otherwise. */
5836
4c4b4cd2 5837static int
76a01679
JB
5838find_struct_field (char *name, struct type *type, int offset,
5839 struct type **field_type_p,
52ce6436
PH
5840 int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
5841 int *index_p)
4c4b4cd2
PH
5842{
5843 int i;
5844
61ee279c 5845 type = ada_check_typedef (type);
76a01679 5846
52ce6436
PH
5847 if (field_type_p != NULL)
5848 *field_type_p = NULL;
5849 if (byte_offset_p != NULL)
d5d6fca5 5850 *byte_offset_p = 0;
52ce6436
PH
5851 if (bit_offset_p != NULL)
5852 *bit_offset_p = 0;
5853 if (bit_size_p != NULL)
5854 *bit_size_p = 0;
5855
5856 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
4c4b4cd2
PH
5857 {
5858 int bit_pos = TYPE_FIELD_BITPOS (type, i);
5859 int fld_offset = offset + bit_pos / 8;
5860 char *t_field_name = TYPE_FIELD_NAME (type, i);
76a01679 5861
4c4b4cd2
PH
5862 if (t_field_name == NULL)
5863 continue;
5864
52ce6436 5865 else if (name != NULL && field_name_match (t_field_name, name))
76a01679
JB
5866 {
5867 int bit_size = TYPE_FIELD_BITSIZE (type, i);
52ce6436
PH
5868 if (field_type_p != NULL)
5869 *field_type_p = TYPE_FIELD_TYPE (type, i);
5870 if (byte_offset_p != NULL)
5871 *byte_offset_p = fld_offset;
5872 if (bit_offset_p != NULL)
5873 *bit_offset_p = bit_pos % 8;
5874 if (bit_size_p != NULL)
5875 *bit_size_p = bit_size;
76a01679
JB
5876 return 1;
5877 }
4c4b4cd2
PH
5878 else if (ada_is_wrapper_field (type, i))
5879 {
52ce6436
PH
5880 if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
5881 field_type_p, byte_offset_p, bit_offset_p,
5882 bit_size_p, index_p))
76a01679
JB
5883 return 1;
5884 }
4c4b4cd2
PH
5885 else if (ada_is_variant_part (type, i))
5886 {
52ce6436
PH
5887 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5888 fixed type?? */
4c4b4cd2 5889 int j;
52ce6436
PH
5890 struct type *field_type
5891 = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
4c4b4cd2 5892
52ce6436 5893 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
4c4b4cd2 5894 {
76a01679
JB
5895 if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
5896 fld_offset
5897 + TYPE_FIELD_BITPOS (field_type, j) / 8,
5898 field_type_p, byte_offset_p,
52ce6436 5899 bit_offset_p, bit_size_p, index_p))
76a01679 5900 return 1;
4c4b4cd2
PH
5901 }
5902 }
52ce6436
PH
5903 else if (index_p != NULL)
5904 *index_p += 1;
4c4b4cd2
PH
5905 }
5906 return 0;
5907}
5908
52ce6436 5909/* Number of user-visible fields in record type TYPE. */
4c4b4cd2 5910
52ce6436
PH
5911static int
5912num_visible_fields (struct type *type)
5913{
5914 int n;
5915 n = 0;
5916 find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
5917 return n;
5918}
14f9c5c9 5919
4c4b4cd2 5920/* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
14f9c5c9
AS
5921 and search in it assuming it has (class) type TYPE.
5922 If found, return value, else return NULL.
5923
4c4b4cd2 5924 Searches recursively through wrapper fields (e.g., '_parent'). */
14f9c5c9 5925
4c4b4cd2 5926static struct value *
d2e4a39e 5927ada_search_struct_field (char *name, struct value *arg, int offset,
4c4b4cd2 5928 struct type *type)
14f9c5c9
AS
5929{
5930 int i;
61ee279c 5931 type = ada_check_typedef (type);
14f9c5c9 5932
52ce6436 5933 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
14f9c5c9
AS
5934 {
5935 char *t_field_name = TYPE_FIELD_NAME (type, i);
5936
5937 if (t_field_name == NULL)
4c4b4cd2 5938 continue;
14f9c5c9
AS
5939
5940 else if (field_name_match (t_field_name, name))
4c4b4cd2 5941 return ada_value_primitive_field (arg, offset, i, type);
14f9c5c9
AS
5942
5943 else if (ada_is_wrapper_field (type, i))
4c4b4cd2 5944 {
06d5cf63
JB
5945 struct value *v = /* Do not let indent join lines here. */
5946 ada_search_struct_field (name, arg,
5947 offset + TYPE_FIELD_BITPOS (type, i) / 8,
5948 TYPE_FIELD_TYPE (type, i));
4c4b4cd2
PH
5949 if (v != NULL)
5950 return v;
5951 }
14f9c5c9
AS
5952
5953 else if (ada_is_variant_part (type, i))
4c4b4cd2 5954 {
52ce6436 5955 /* PNH: Do we ever get here? See find_struct_field. */
4c4b4cd2 5956 int j;
61ee279c 5957 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
4c4b4cd2
PH
5958 int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
5959
52ce6436 5960 for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
4c4b4cd2 5961 {
06d5cf63
JB
5962 struct value *v = ada_search_struct_field /* Force line break. */
5963 (name, arg,
5964 var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
5965 TYPE_FIELD_TYPE (field_type, j));
4c4b4cd2
PH
5966 if (v != NULL)
5967 return v;
5968 }
5969 }
14f9c5c9
AS
5970 }
5971 return NULL;
5972}
d2e4a39e 5973
52ce6436
PH
5974static struct value *ada_index_struct_field_1 (int *, struct value *,
5975 int, struct type *);
5976
5977
5978/* Return field #INDEX in ARG, where the index is that returned by
5979 * find_struct_field through its INDEX_P argument. Adjust the address
5980 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
5981 * If found, return value, else return NULL. */
5982
5983static struct value *
5984ada_index_struct_field (int index, struct value *arg, int offset,
5985 struct type *type)
5986{
5987 return ada_index_struct_field_1 (&index, arg, offset, type);
5988}
5989
5990
5991/* Auxiliary function for ada_index_struct_field. Like
5992 * ada_index_struct_field, but takes index from *INDEX_P and modifies
5993 * *INDEX_P. */
5994
5995static struct value *
5996ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
5997 struct type *type)
5998{
5999 int i;
6000 type = ada_check_typedef (type);
6001
6002 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6003 {
6004 if (TYPE_FIELD_NAME (type, i) == NULL)
6005 continue;
6006 else if (ada_is_wrapper_field (type, i))
6007 {
6008 struct value *v = /* Do not let indent join lines here. */
6009 ada_index_struct_field_1 (index_p, arg,
6010 offset + TYPE_FIELD_BITPOS (type, i) / 8,
6011 TYPE_FIELD_TYPE (type, i));
6012 if (v != NULL)
6013 return v;
6014 }
6015
6016 else if (ada_is_variant_part (type, i))
6017 {
6018 /* PNH: Do we ever get here? See ada_search_struct_field,
6019 find_struct_field. */
6020 error (_("Cannot assign this kind of variant record"));
6021 }
6022 else if (*index_p == 0)
6023 return ada_value_primitive_field (arg, offset, i, type);
6024 else
6025 *index_p -= 1;
6026 }
6027 return NULL;
6028}
6029
4c4b4cd2
PH
6030/* Given ARG, a value of type (pointer or reference to a)*
6031 structure/union, extract the component named NAME from the ultimate
6032 target structure/union and return it as a value with its
6033 appropriate type. If ARG is a pointer or reference and the field
6034 is not packed, returns a reference to the field, otherwise the
6035 value of the field (an lvalue if ARG is an lvalue).
14f9c5c9 6036
4c4b4cd2
PH
6037 The routine searches for NAME among all members of the structure itself
6038 and (recursively) among all members of any wrapper members
14f9c5c9
AS
6039 (e.g., '_parent').
6040
03ee6b2e
PH
6041 If NO_ERR, then simply return NULL in case of error, rather than
6042 calling error. */
14f9c5c9 6043
d2e4a39e 6044struct value *
03ee6b2e 6045ada_value_struct_elt (struct value *arg, char *name, int no_err)
14f9c5c9 6046{
4c4b4cd2 6047 struct type *t, *t1;
d2e4a39e 6048 struct value *v;
14f9c5c9 6049
4c4b4cd2 6050 v = NULL;
df407dfe 6051 t1 = t = ada_check_typedef (value_type (arg));
4c4b4cd2
PH
6052 if (TYPE_CODE (t) == TYPE_CODE_REF)
6053 {
6054 t1 = TYPE_TARGET_TYPE (t);
6055 if (t1 == NULL)
03ee6b2e 6056 goto BadValue;
61ee279c 6057 t1 = ada_check_typedef (t1);
4c4b4cd2 6058 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
76a01679 6059 {
994b9211 6060 arg = coerce_ref (arg);
76a01679
JB
6061 t = t1;
6062 }
4c4b4cd2 6063 }
14f9c5c9 6064
4c4b4cd2
PH
6065 while (TYPE_CODE (t) == TYPE_CODE_PTR)
6066 {
6067 t1 = TYPE_TARGET_TYPE (t);
6068 if (t1 == NULL)
03ee6b2e 6069 goto BadValue;
61ee279c 6070 t1 = ada_check_typedef (t1);
4c4b4cd2 6071 if (TYPE_CODE (t1) == TYPE_CODE_PTR)
76a01679
JB
6072 {
6073 arg = value_ind (arg);
6074 t = t1;
6075 }
4c4b4cd2 6076 else
76a01679 6077 break;
4c4b4cd2 6078 }
14f9c5c9 6079
4c4b4cd2 6080 if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
03ee6b2e 6081 goto BadValue;
14f9c5c9 6082
4c4b4cd2
PH
6083 if (t1 == t)
6084 v = ada_search_struct_field (name, arg, 0, t);
6085 else
6086 {
6087 int bit_offset, bit_size, byte_offset;
6088 struct type *field_type;
6089 CORE_ADDR address;
6090
76a01679
JB
6091 if (TYPE_CODE (t) == TYPE_CODE_PTR)
6092 address = value_as_address (arg);
4c4b4cd2 6093 else
0fd88904 6094 address = unpack_pointer (t, value_contents (arg));
14f9c5c9 6095
1ed6ede0 6096 t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
76a01679
JB
6097 if (find_struct_field (name, t1, 0,
6098 &field_type, &byte_offset, &bit_offset,
52ce6436 6099 &bit_size, NULL))
76a01679
JB
6100 {
6101 if (bit_size != 0)
6102 {
714e53ab
PH
6103 if (TYPE_CODE (t) == TYPE_CODE_REF)
6104 arg = ada_coerce_ref (arg);
6105 else
6106 arg = ada_value_ind (arg);
76a01679
JB
6107 v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
6108 bit_offset, bit_size,
6109 field_type);
6110 }
6111 else
6112 v = value_from_pointer (lookup_reference_type (field_type),
6113 address + byte_offset);
6114 }
6115 }
6116
03ee6b2e
PH
6117 if (v != NULL || no_err)
6118 return v;
6119 else
323e0a4a 6120 error (_("There is no member named %s."), name);
14f9c5c9 6121
03ee6b2e
PH
6122 BadValue:
6123 if (no_err)
6124 return NULL;
6125 else
6126 error (_("Attempt to extract a component of a value that is not a record."));
14f9c5c9
AS
6127}
6128
6129/* Given a type TYPE, look up the type of the component of type named NAME.
4c4b4cd2
PH
6130 If DISPP is non-null, add its byte displacement from the beginning of a
6131 structure (pointed to by a value) of type TYPE to *DISPP (does not
14f9c5c9
AS
6132 work for packed fields).
6133
6134 Matches any field whose name has NAME as a prefix, possibly
4c4b4cd2 6135 followed by "___".
14f9c5c9 6136
4c4b4cd2
PH
6137 TYPE can be either a struct or union. If REFOK, TYPE may also
6138 be a (pointer or reference)+ to a struct or union, and the
6139 ultimate target type will be searched.
14f9c5c9
AS
6140
6141 Looks recursively into variant clauses and parent types.
6142
4c4b4cd2
PH
6143 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6144 TYPE is not a type of the right kind. */
14f9c5c9 6145
4c4b4cd2 6146static struct type *
76a01679
JB
6147ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
6148 int noerr, int *dispp)
14f9c5c9
AS
6149{
6150 int i;
6151
6152 if (name == NULL)
6153 goto BadName;
6154
76a01679 6155 if (refok && type != NULL)
4c4b4cd2
PH
6156 while (1)
6157 {
61ee279c 6158 type = ada_check_typedef (type);
76a01679
JB
6159 if (TYPE_CODE (type) != TYPE_CODE_PTR
6160 && TYPE_CODE (type) != TYPE_CODE_REF)
6161 break;
6162 type = TYPE_TARGET_TYPE (type);
4c4b4cd2 6163 }
14f9c5c9 6164
76a01679 6165 if (type == NULL
1265e4aa
JB
6166 || (TYPE_CODE (type) != TYPE_CODE_STRUCT
6167 && TYPE_CODE (type) != TYPE_CODE_UNION))
14f9c5c9 6168 {
4c4b4cd2 6169 if (noerr)
76a01679 6170 return NULL;
4c4b4cd2 6171 else
76a01679
JB
6172 {
6173 target_terminal_ours ();
6174 gdb_flush (gdb_stdout);
323e0a4a
AC
6175 if (type == NULL)
6176 error (_("Type (null) is not a structure or union type"));
6177 else
6178 {
6179 /* XXX: type_sprint */
6180 fprintf_unfiltered (gdb_stderr, _("Type "));
6181 type_print (type, "", gdb_stderr, -1);
6182 error (_(" is not a structure or union type"));
6183 }
76a01679 6184 }
14f9c5c9
AS
6185 }
6186
6187 type = to_static_fixed_type (type);
6188
6189 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
6190 {
6191 char *t_field_name = TYPE_FIELD_NAME (type, i);
6192 struct type *t;
6193 int disp;
d2e4a39e 6194
14f9c5c9 6195 if (t_field_name == NULL)
4c4b4cd2 6196 continue;
14f9c5c9
AS
6197
6198 else if (field_name_match (t_field_name, name))
4c4b4cd2
PH
6199 {
6200 if (dispp != NULL)
6201 *dispp += TYPE_FIELD_BITPOS (type, i) / 8;
61ee279c 6202 return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
4c4b4cd2 6203 }
14f9c5c9
AS
6204
6205 else if (ada_is_wrapper_field (type, i))
4c4b4cd2
PH
6206 {
6207 disp = 0;
6208 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
6209 0, 1, &disp);
6210 if (t != NULL)
6211 {
6212 if (dispp != NULL)
6213 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6214 return t;
6215 }
6216 }
14f9c5c9
AS
6217
6218 else if (ada_is_variant_part (type, i))
4c4b4cd2
PH
6219 {
6220 int j;
61ee279c 6221 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
4c4b4cd2
PH
6222
6223 for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
6224 {
6225 disp = 0;
6226 t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, j),
6227 name, 0, 1, &disp);
6228 if (t != NULL)
6229 {
6230 if (dispp != NULL)
6231 *dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
6232 return t;
6233 }
6234 }
6235 }
14f9c5c9
AS
6236
6237 }
6238
6239BadName:
d2e4a39e 6240 if (!noerr)
14f9c5c9
AS
6241 {
6242 target_terminal_ours ();
6243 gdb_flush (gdb_stdout);
323e0a4a
AC
6244 if (name == NULL)
6245 {
6246 /* XXX: type_sprint */
6247 fprintf_unfiltered (gdb_stderr, _("Type "));
6248 type_print (type, "", gdb_stderr, -1);
6249 error (_(" has no component named <null>"));
6250 }
6251 else
6252 {
6253 /* XXX: type_sprint */
6254 fprintf_unfiltered (gdb_stderr, _("Type "));
6255 type_print (type, "", gdb_stderr, -1);
6256 error (_(" has no component named %s"), name);
6257 }
14f9c5c9
AS
6258 }
6259
6260 return NULL;
6261}
6262
6263/* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6264 within a value of type OUTER_TYPE that is stored in GDB at
4c4b4cd2
PH
6265 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6266 numbering from 0) is applicable. Returns -1 if none are. */
14f9c5c9 6267
d2e4a39e 6268int
ebf56fd3 6269ada_which_variant_applies (struct type *var_type, struct type *outer_type,
fc1a4b47 6270 const gdb_byte *outer_valaddr)
14f9c5c9
AS
6271{
6272 int others_clause;
6273 int i;
6274 int disp;
d2e4a39e
AS
6275 struct type *discrim_type;
6276 char *discrim_name = ada_variant_discrim_name (var_type);
14f9c5c9
AS
6277 LONGEST discrim_val;
6278
6279 disp = 0;
d2e4a39e 6280 discrim_type =
4c4b4cd2 6281 ada_lookup_struct_elt_type (outer_type, discrim_name, 1, 1, &disp);
14f9c5c9
AS
6282 if (discrim_type == NULL)
6283 return -1;
6284 discrim_val = unpack_long (discrim_type, outer_valaddr + disp);
6285
6286 others_clause = -1;
6287 for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
6288 {
6289 if (ada_is_others_clause (var_type, i))
4c4b4cd2 6290 others_clause = i;
14f9c5c9 6291 else if (ada_in_variant (discrim_val, var_type, i))
4c4b4cd2 6292 return i;
14f9c5c9
AS
6293 }
6294
6295 return others_clause;
6296}
d2e4a39e 6297\f
14f9c5c9
AS
6298
6299
4c4b4cd2 6300 /* Dynamic-Sized Records */
14f9c5c9
AS
6301
6302/* Strategy: The type ostensibly attached to a value with dynamic size
6303 (i.e., a size that is not statically recorded in the debugging
6304 data) does not accurately reflect the size or layout of the value.
6305 Our strategy is to convert these values to values with accurate,
4c4b4cd2 6306 conventional types that are constructed on the fly. */
14f9c5c9
AS
6307
6308/* There is a subtle and tricky problem here. In general, we cannot
6309 determine the size of dynamic records without its data. However,
6310 the 'struct value' data structure, which GDB uses to represent
6311 quantities in the inferior process (the target), requires the size
6312 of the type at the time of its allocation in order to reserve space
6313 for GDB's internal copy of the data. That's why the
6314 'to_fixed_xxx_type' routines take (target) addresses as parameters,
4c4b4cd2 6315 rather than struct value*s.
14f9c5c9
AS
6316
6317 However, GDB's internal history variables ($1, $2, etc.) are
6318 struct value*s containing internal copies of the data that are not, in
6319 general, the same as the data at their corresponding addresses in
6320 the target. Fortunately, the types we give to these values are all
6321 conventional, fixed-size types (as per the strategy described
6322 above), so that we don't usually have to perform the
6323 'to_fixed_xxx_type' conversions to look at their values.
6324 Unfortunately, there is one exception: if one of the internal
6325 history variables is an array whose elements are unconstrained
6326 records, then we will need to create distinct fixed types for each
6327 element selected. */
6328
6329/* The upshot of all of this is that many routines take a (type, host
6330 address, target address) triple as arguments to represent a value.
6331 The host address, if non-null, is supposed to contain an internal
6332 copy of the relevant data; otherwise, the program is to consult the
4c4b4cd2 6333 target at the target address. */
14f9c5c9
AS
6334
6335/* Assuming that VAL0 represents a pointer value, the result of
6336 dereferencing it. Differs from value_ind in its treatment of
4c4b4cd2 6337 dynamic-sized types. */
14f9c5c9 6338
d2e4a39e
AS
6339struct value *
6340ada_value_ind (struct value *val0)
14f9c5c9 6341{
d2e4a39e 6342 struct value *val = unwrap_value (value_ind (val0));
4c4b4cd2 6343 return ada_to_fixed_value (val);
14f9c5c9
AS
6344}
6345
6346/* The value resulting from dereferencing any "reference to"
4c4b4cd2
PH
6347 qualifiers on VAL0. */
6348
d2e4a39e
AS
6349static struct value *
6350ada_coerce_ref (struct value *val0)
6351{
df407dfe 6352 if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
d2e4a39e
AS
6353 {
6354 struct value *val = val0;
994b9211 6355 val = coerce_ref (val);
d2e4a39e 6356 val = unwrap_value (val);
4c4b4cd2 6357 return ada_to_fixed_value (val);
d2e4a39e
AS
6358 }
6359 else
14f9c5c9
AS
6360 return val0;
6361}
6362
6363/* Return OFF rounded upward if necessary to a multiple of
4c4b4cd2 6364 ALIGNMENT (a power of 2). */
14f9c5c9
AS
6365
6366static unsigned int
ebf56fd3 6367align_value (unsigned int off, unsigned int alignment)
14f9c5c9
AS
6368{
6369 return (off + alignment - 1) & ~(alignment - 1);
6370}
6371
4c4b4cd2 6372/* Return the bit alignment required for field #F of template type TYPE. */
14f9c5c9
AS
6373
6374static unsigned int
ebf56fd3 6375field_alignment (struct type *type, int f)
14f9c5c9 6376{
d2e4a39e 6377 const char *name = TYPE_FIELD_NAME (type, f);
64a1bf19 6378 int len;
14f9c5c9
AS
6379 int align_offset;
6380
64a1bf19
JB
6381 /* The field name should never be null, unless the debugging information
6382 is somehow malformed. In this case, we assume the field does not
6383 require any alignment. */
6384 if (name == NULL)
6385 return 1;
6386
6387 len = strlen (name);
6388
4c4b4cd2
PH
6389 if (!isdigit (name[len - 1]))
6390 return 1;
14f9c5c9 6391
d2e4a39e 6392 if (isdigit (name[len - 2]))
14f9c5c9
AS
6393 align_offset = len - 2;
6394 else
6395 align_offset = len - 1;
6396
4c4b4cd2 6397 if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
14f9c5c9
AS
6398 return TARGET_CHAR_BIT;
6399
4c4b4cd2
PH
6400 return atoi (name + align_offset) * TARGET_CHAR_BIT;
6401}
6402
6403/* Find a symbol named NAME. Ignores ambiguity. */
6404
6405struct symbol *
6406ada_find_any_symbol (const char *name)
6407{
6408 struct symbol *sym;
6409
6410 sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
6411 if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
6412 return sym;
6413
6414 sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
6415 return sym;
14f9c5c9
AS
6416}
6417
6418/* Find a type named NAME. Ignores ambiguity. */
4c4b4cd2 6419
d2e4a39e 6420struct type *
ebf56fd3 6421ada_find_any_type (const char *name)
14f9c5c9 6422{
4c4b4cd2 6423 struct symbol *sym = ada_find_any_symbol (name);
14f9c5c9 6424
14f9c5c9
AS
6425 if (sym != NULL)
6426 return SYMBOL_TYPE (sym);
6427
6428 return NULL;
6429}
6430
aeb5907d
JB
6431/* Given NAME and an associated BLOCK, search all symbols for
6432 NAME suffixed with "___XR", which is the ``renaming'' symbol
4c4b4cd2
PH
6433 associated to NAME. Return this symbol if found, return
6434 NULL otherwise. */
6435
6436struct symbol *
6437ada_find_renaming_symbol (const char *name, struct block *block)
aeb5907d
JB
6438{
6439 struct symbol *sym;
6440
6441 sym = find_old_style_renaming_symbol (name, block);
6442
6443 if (sym != NULL)
6444 return sym;
6445
6446 /* Not right yet. FIXME pnh 7/20/2007. */
6447 sym = ada_find_any_symbol (name);
6448 if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
6449 return sym;
6450 else
6451 return NULL;
6452}
6453
6454static struct symbol *
6455find_old_style_renaming_symbol (const char *name, struct block *block)
4c4b4cd2
PH
6456{
6457 const struct symbol *function_sym = block_function (block);
6458 char *rename;
6459
6460 if (function_sym != NULL)
6461 {
6462 /* If the symbol is defined inside a function, NAME is not fully
6463 qualified. This means we need to prepend the function name
6464 as well as adding the ``___XR'' suffix to build the name of
6465 the associated renaming symbol. */
6466 char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
529cad9c
PH
6467 /* Function names sometimes contain suffixes used
6468 for instance to qualify nested subprograms. When building
6469 the XR type name, we need to make sure that this suffix is
6470 not included. So do not include any suffix in the function
6471 name length below. */
6472 const int function_name_len = ada_name_prefix_len (function_name);
76a01679
JB
6473 const int rename_len = function_name_len + 2 /* "__" */
6474 + strlen (name) + 6 /* "___XR\0" */ ;
4c4b4cd2 6475
529cad9c
PH
6476 /* Strip the suffix if necessary. */
6477 function_name[function_name_len] = '\0';
6478
4c4b4cd2
PH
6479 /* Library-level functions are a special case, as GNAT adds
6480 a ``_ada_'' prefix to the function name to avoid namespace
aeb5907d 6481 pollution. However, the renaming symbols themselves do not
4c4b4cd2
PH
6482 have this prefix, so we need to skip this prefix if present. */
6483 if (function_name_len > 5 /* "_ada_" */
6484 && strstr (function_name, "_ada_") == function_name)
6485 function_name = function_name + 5;
6486
6487 rename = (char *) alloca (rename_len * sizeof (char));
6488 sprintf (rename, "%s__%s___XR", function_name, name);
6489 }
6490 else
6491 {
6492 const int rename_len = strlen (name) + 6;
6493 rename = (char *) alloca (rename_len * sizeof (char));
6494 sprintf (rename, "%s___XR", name);
6495 }
6496
6497 return ada_find_any_symbol (rename);
6498}
6499
14f9c5c9 6500/* Because of GNAT encoding conventions, several GDB symbols may match a
4c4b4cd2 6501 given type name. If the type denoted by TYPE0 is to be preferred to
14f9c5c9 6502 that of TYPE1 for purposes of type printing, return non-zero;
4c4b4cd2
PH
6503 otherwise return 0. */
6504
14f9c5c9 6505int
d2e4a39e 6506ada_prefer_type (struct type *type0, struct type *type1)
14f9c5c9
AS
6507{
6508 if (type1 == NULL)
6509 return 1;
6510 else if (type0 == NULL)
6511 return 0;
6512 else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
6513 return 1;
6514 else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
6515 return 0;
4c4b4cd2
PH
6516 else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
6517 return 1;
14f9c5c9
AS
6518 else if (ada_is_packed_array_type (type0))
6519 return 1;
4c4b4cd2
PH
6520 else if (ada_is_array_descriptor_type (type0)
6521 && !ada_is_array_descriptor_type (type1))
14f9c5c9 6522 return 1;
aeb5907d
JB
6523 else
6524 {
6525 const char *type0_name = type_name_no_tag (type0);
6526 const char *type1_name = type_name_no_tag (type1);
6527
6528 if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
6529 && (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
6530 return 1;
6531 }
14f9c5c9
AS
6532 return 0;
6533}
6534
6535/* The name of TYPE, which is either its TYPE_NAME, or, if that is
4c4b4cd2
PH
6536 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6537
d2e4a39e
AS
6538char *
6539ada_type_name (struct type *type)
14f9c5c9 6540{
d2e4a39e 6541 if (type == NULL)
14f9c5c9
AS
6542 return NULL;
6543 else if (TYPE_NAME (type) != NULL)
6544 return TYPE_NAME (type);
6545 else
6546 return TYPE_TAG_NAME (type);
6547}
6548
6549/* Find a parallel type to TYPE whose name is formed by appending
4c4b4cd2 6550 SUFFIX to the name of TYPE. */
14f9c5c9 6551
d2e4a39e 6552struct type *
ebf56fd3 6553ada_find_parallel_type (struct type *type, const char *suffix)
14f9c5c9 6554{
d2e4a39e 6555 static char *name;
14f9c5c9 6556 static size_t name_len = 0;
14f9c5c9 6557 int len;
d2e4a39e
AS
6558 char *typename = ada_type_name (type);
6559
14f9c5c9
AS
6560 if (typename == NULL)
6561 return NULL;
6562
6563 len = strlen (typename);
6564
d2e4a39e 6565 GROW_VECT (name, name_len, len + strlen (suffix) + 1);
14f9c5c9
AS
6566
6567 strcpy (name, typename);
6568 strcpy (name + len, suffix);
6569
6570 return ada_find_any_type (name);
6571}
6572
6573
6574/* If TYPE is a variable-size record type, return the corresponding template
4c4b4cd2 6575 type describing its fields. Otherwise, return NULL. */
14f9c5c9 6576
d2e4a39e
AS
6577static struct type *
6578dynamic_template_type (struct type *type)
14f9c5c9 6579{
61ee279c 6580 type = ada_check_typedef (type);
14f9c5c9
AS
6581
6582 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
d2e4a39e 6583 || ada_type_name (type) == NULL)
14f9c5c9 6584 return NULL;
d2e4a39e 6585 else
14f9c5c9
AS
6586 {
6587 int len = strlen (ada_type_name (type));
4c4b4cd2
PH
6588 if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
6589 return type;
14f9c5c9 6590 else
4c4b4cd2 6591 return ada_find_parallel_type (type, "___XVE");
14f9c5c9
AS
6592 }
6593}
6594
6595/* Assuming that TEMPL_TYPE is a union or struct type, returns
4c4b4cd2 6596 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
14f9c5c9 6597
d2e4a39e
AS
6598static int
6599is_dynamic_field (struct type *templ_type, int field_num)
14f9c5c9
AS
6600{
6601 const char *name = TYPE_FIELD_NAME (templ_type, field_num);
d2e4a39e 6602 return name != NULL
14f9c5c9
AS
6603 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
6604 && strstr (name, "___XVL") != NULL;
6605}
6606
4c4b4cd2
PH
6607/* The index of the variant field of TYPE, or -1 if TYPE does not
6608 represent a variant record type. */
14f9c5c9 6609
d2e4a39e 6610static int
4c4b4cd2 6611variant_field_index (struct type *type)
14f9c5c9
AS
6612{
6613 int f;
6614
4c4b4cd2
PH
6615 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
6616 return -1;
6617
6618 for (f = 0; f < TYPE_NFIELDS (type); f += 1)
6619 {
6620 if (ada_is_variant_part (type, f))
6621 return f;
6622 }
6623 return -1;
14f9c5c9
AS
6624}
6625
4c4b4cd2
PH
6626/* A record type with no fields. */
6627
d2e4a39e
AS
6628static struct type *
6629empty_record (struct objfile *objfile)
14f9c5c9 6630{
d2e4a39e 6631 struct type *type = alloc_type (objfile);
14f9c5c9
AS
6632 TYPE_CODE (type) = TYPE_CODE_STRUCT;
6633 TYPE_NFIELDS (type) = 0;
6634 TYPE_FIELDS (type) = NULL;
6635 TYPE_NAME (type) = "<empty>";
6636 TYPE_TAG_NAME (type) = NULL;
6637 TYPE_FLAGS (type) = 0;
6638 TYPE_LENGTH (type) = 0;
6639 return type;
6640}
6641
6642/* An ordinary record type (with fixed-length fields) that describes
4c4b4cd2
PH
6643 the value of type TYPE at VALADDR or ADDRESS (see comments at
6644 the beginning of this section) VAL according to GNAT conventions.
6645 DVAL0 should describe the (portion of a) record that contains any
df407dfe 6646 necessary discriminants. It should be NULL if value_type (VAL) is
14f9c5c9
AS
6647 an outer-level type (i.e., as opposed to a branch of a variant.) A
6648 variant field (unless unchecked) is replaced by a particular branch
4c4b4cd2 6649 of the variant.
14f9c5c9 6650
4c4b4cd2
PH
6651 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6652 length are not statically known are discarded. As a consequence,
6653 VALADDR, ADDRESS and DVAL0 are ignored.
6654
6655 NOTE: Limitations: For now, we assume that dynamic fields and
6656 variants occupy whole numbers of bytes. However, they need not be
6657 byte-aligned. */
6658
6659struct type *
10a2c479 6660ada_template_to_fixed_record_type_1 (struct type *type,
fc1a4b47 6661 const gdb_byte *valaddr,
4c4b4cd2
PH
6662 CORE_ADDR address, struct value *dval0,
6663 int keep_dynamic_fields)
14f9c5c9 6664{
d2e4a39e
AS
6665 struct value *mark = value_mark ();
6666 struct value *dval;
6667 struct type *rtype;
14f9c5c9 6668 int nfields, bit_len;
4c4b4cd2 6669 int variant_field;
14f9c5c9 6670 long off;
4c4b4cd2 6671 int fld_bit_len, bit_incr;
14f9c5c9
AS
6672 int f;
6673
4c4b4cd2
PH
6674 /* Compute the number of fields in this record type that are going
6675 to be processed: unless keep_dynamic_fields, this includes only
6676 fields whose position and length are static will be processed. */
6677 if (keep_dynamic_fields)
6678 nfields = TYPE_NFIELDS (type);
6679 else
6680 {
6681 nfields = 0;
76a01679 6682 while (nfields < TYPE_NFIELDS (type)
4c4b4cd2
PH
6683 && !ada_is_variant_part (type, nfields)
6684 && !is_dynamic_field (type, nfields))
6685 nfields++;
6686 }
6687
14f9c5c9
AS
6688 rtype = alloc_type (TYPE_OBJFILE (type));
6689 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
6690 INIT_CPLUS_SPECIFIC (rtype);
6691 TYPE_NFIELDS (rtype) = nfields;
d2e4a39e 6692 TYPE_FIELDS (rtype) = (struct field *)
14f9c5c9
AS
6693 TYPE_ALLOC (rtype, nfields * sizeof (struct field));
6694 memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
6695 TYPE_NAME (rtype) = ada_type_name (type);
6696 TYPE_TAG_NAME (rtype) = NULL;
4c4b4cd2 6697 TYPE_FLAGS (rtype) |= TYPE_FLAG_FIXED_INSTANCE;
14f9c5c9 6698
d2e4a39e
AS
6699 off = 0;
6700 bit_len = 0;
4c4b4cd2
PH
6701 variant_field = -1;
6702
14f9c5c9
AS
6703 for (f = 0; f < nfields; f += 1)
6704 {
6c038f32
PH
6705 off = align_value (off, field_alignment (type, f))
6706 + TYPE_FIELD_BITPOS (type, f);
14f9c5c9 6707 TYPE_FIELD_BITPOS (rtype, f) = off;
d2e4a39e 6708 TYPE_FIELD_BITSIZE (rtype, f) = 0;
14f9c5c9 6709
d2e4a39e 6710 if (ada_is_variant_part (type, f))
4c4b4cd2
PH
6711 {
6712 variant_field = f;
6713 fld_bit_len = bit_incr = 0;
6714 }
14f9c5c9 6715 else if (is_dynamic_field (type, f))
4c4b4cd2
PH
6716 {
6717 if (dval0 == NULL)
6718 dval = value_from_contents_and_address (rtype, valaddr, address);
6719 else
6720 dval = dval0;
6721
1ed6ede0
JB
6722 /* Get the fixed type of the field. Note that, in this case, we
6723 do not want to get the real type out of the tag: if the current
6724 field is the parent part of a tagged record, we will get the
6725 tag of the object. Clearly wrong: the real type of the parent
6726 is not the real type of the child. We would end up in an infinite
6727 loop. */
4c4b4cd2
PH
6728 TYPE_FIELD_TYPE (rtype, f) =
6729 ada_to_fixed_type
6730 (ada_get_base_type
6731 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f))),
6732 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
1ed6ede0 6733 cond_offset_target (address, off / TARGET_CHAR_BIT), dval, 0);
4c4b4cd2
PH
6734 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
6735 bit_incr = fld_bit_len =
6736 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
6737 }
14f9c5c9 6738 else
4c4b4cd2
PH
6739 {
6740 TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
6741 TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
6742 if (TYPE_FIELD_BITSIZE (type, f) > 0)
6743 bit_incr = fld_bit_len =
6744 TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
6745 else
6746 bit_incr = fld_bit_len =
6747 TYPE_LENGTH (TYPE_FIELD_TYPE (type, f)) * TARGET_CHAR_BIT;
6748 }
14f9c5c9 6749 if (off + fld_bit_len > bit_len)
4c4b4cd2 6750 bit_len = off + fld_bit_len;
14f9c5c9 6751 off += bit_incr;
4c4b4cd2
PH
6752 TYPE_LENGTH (rtype) =
6753 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
14f9c5c9 6754 }
4c4b4cd2
PH
6755
6756 /* We handle the variant part, if any, at the end because of certain
6757 odd cases in which it is re-ordered so as NOT the last field of
6758 the record. This can happen in the presence of representation
6759 clauses. */
6760 if (variant_field >= 0)
6761 {
6762 struct type *branch_type;
6763
6764 off = TYPE_FIELD_BITPOS (rtype, variant_field);
6765
6766 if (dval0 == NULL)
6767 dval = value_from_contents_and_address (rtype, valaddr, address);
6768 else
6769 dval = dval0;
6770
6771 branch_type =
6772 to_fixed_variant_branch_type
6773 (TYPE_FIELD_TYPE (type, variant_field),
6774 cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
6775 cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
6776 if (branch_type == NULL)
6777 {
6778 for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
6779 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
6780 TYPE_NFIELDS (rtype) -= 1;
6781 }
6782 else
6783 {
6784 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
6785 TYPE_FIELD_NAME (rtype, variant_field) = "S";
6786 fld_bit_len =
6787 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
6788 TARGET_CHAR_BIT;
6789 if (off + fld_bit_len > bit_len)
6790 bit_len = off + fld_bit_len;
6791 TYPE_LENGTH (rtype) =
6792 align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
6793 }
6794 }
6795
714e53ab
PH
6796 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6797 should contain the alignment of that record, which should be a strictly
6798 positive value. If null or negative, then something is wrong, most
6799 probably in the debug info. In that case, we don't round up the size
6800 of the resulting type. If this record is not part of another structure,
6801 the current RTYPE length might be good enough for our purposes. */
6802 if (TYPE_LENGTH (type) <= 0)
6803 {
323e0a4a
AC
6804 if (TYPE_NAME (rtype))
6805 warning (_("Invalid type size for `%s' detected: %d."),
6806 TYPE_NAME (rtype), TYPE_LENGTH (type));
6807 else
6808 warning (_("Invalid type size for <unnamed> detected: %d."),
6809 TYPE_LENGTH (type));
714e53ab
PH
6810 }
6811 else
6812 {
6813 TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
6814 TYPE_LENGTH (type));
6815 }
14f9c5c9
AS
6816
6817 value_free_to_mark (mark);
d2e4a39e 6818 if (TYPE_LENGTH (rtype) > varsize_limit)
323e0a4a 6819 error (_("record type with dynamic size is larger than varsize-limit"));
14f9c5c9
AS
6820 return rtype;
6821}
6822
4c4b4cd2
PH
6823/* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6824 of 1. */
14f9c5c9 6825
d2e4a39e 6826static struct type *
fc1a4b47 6827template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
4c4b4cd2
PH
6828 CORE_ADDR address, struct value *dval0)
6829{
6830 return ada_template_to_fixed_record_type_1 (type, valaddr,
6831 address, dval0, 1);
6832}
6833
6834/* An ordinary record type in which ___XVL-convention fields and
6835 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6836 static approximations, containing all possible fields. Uses
6837 no runtime values. Useless for use in values, but that's OK,
6838 since the results are used only for type determinations. Works on both
6839 structs and unions. Representation note: to save space, we memorize
6840 the result of this function in the TYPE_TARGET_TYPE of the
6841 template type. */
6842
6843static struct type *
6844template_to_static_fixed_type (struct type *type0)
14f9c5c9
AS
6845{
6846 struct type *type;
6847 int nfields;
6848 int f;
6849
4c4b4cd2
PH
6850 if (TYPE_TARGET_TYPE (type0) != NULL)
6851 return TYPE_TARGET_TYPE (type0);
6852
6853 nfields = TYPE_NFIELDS (type0);
6854 type = type0;
14f9c5c9
AS
6855
6856 for (f = 0; f < nfields; f += 1)
6857 {
61ee279c 6858 struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
4c4b4cd2 6859 struct type *new_type;
14f9c5c9 6860
4c4b4cd2
PH
6861 if (is_dynamic_field (type0, f))
6862 new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
14f9c5c9 6863 else
f192137b 6864 new_type = static_unwrap_type (field_type);
4c4b4cd2
PH
6865 if (type == type0 && new_type != field_type)
6866 {
6867 TYPE_TARGET_TYPE (type0) = type = alloc_type (TYPE_OBJFILE (type0));
6868 TYPE_CODE (type) = TYPE_CODE (type0);
6869 INIT_CPLUS_SPECIFIC (type);
6870 TYPE_NFIELDS (type) = nfields;
6871 TYPE_FIELDS (type) = (struct field *)
6872 TYPE_ALLOC (type, nfields * sizeof (struct field));
6873 memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
6874 sizeof (struct field) * nfields);
6875 TYPE_NAME (type) = ada_type_name (type0);
6876 TYPE_TAG_NAME (type) = NULL;
6877 TYPE_FLAGS (type) |= TYPE_FLAG_FIXED_INSTANCE;
6878 TYPE_LENGTH (type) = 0;
6879 }
6880 TYPE_FIELD_TYPE (type, f) = new_type;
6881 TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
14f9c5c9 6882 }
14f9c5c9
AS
6883 return type;
6884}
6885
4c4b4cd2
PH
6886/* Given an object of type TYPE whose contents are at VALADDR and
6887 whose address in memory is ADDRESS, returns a revision of TYPE --
6888 a non-dynamic-sized record with a variant part -- in which
6889 the variant part is replaced with the appropriate branch. Looks
6890 for discriminant values in DVAL0, which can be NULL if the record
6891 contains the necessary discriminant values. */
6892
d2e4a39e 6893static struct type *
fc1a4b47 6894to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
4c4b4cd2 6895 CORE_ADDR address, struct value *dval0)
14f9c5c9 6896{
d2e4a39e 6897 struct value *mark = value_mark ();
4c4b4cd2 6898 struct value *dval;
d2e4a39e 6899 struct type *rtype;
14f9c5c9
AS
6900 struct type *branch_type;
6901 int nfields = TYPE_NFIELDS (type);
4c4b4cd2 6902 int variant_field = variant_field_index (type);
14f9c5c9 6903
4c4b4cd2 6904 if (variant_field == -1)
14f9c5c9
AS
6905 return type;
6906
4c4b4cd2
PH
6907 if (dval0 == NULL)
6908 dval = value_from_contents_and_address (type, valaddr, address);
6909 else
6910 dval = dval0;
6911
14f9c5c9
AS
6912 rtype = alloc_type (TYPE_OBJFILE (type));
6913 TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
4c4b4cd2
PH
6914 INIT_CPLUS_SPECIFIC (rtype);
6915 TYPE_NFIELDS (rtype) = nfields;
d2e4a39e
AS
6916 TYPE_FIELDS (rtype) =
6917 (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
6918 memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
4c4b4cd2 6919 sizeof (struct field) * nfields);
14f9c5c9
AS
6920 TYPE_NAME (rtype) = ada_type_name (type);
6921 TYPE_TAG_NAME (rtype) = NULL;
4c4b4cd2 6922 TYPE_FLAGS (rtype) |= TYPE_FLAG_FIXED_INSTANCE;
14f9c5c9
AS
6923 TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
6924
4c4b4cd2
PH
6925 branch_type = to_fixed_variant_branch_type
6926 (TYPE_FIELD_TYPE (type, variant_field),
d2e4a39e 6927 cond_offset_host (valaddr,
4c4b4cd2
PH
6928 TYPE_FIELD_BITPOS (type, variant_field)
6929 / TARGET_CHAR_BIT),
d2e4a39e 6930 cond_offset_target (address,
4c4b4cd2
PH
6931 TYPE_FIELD_BITPOS (type, variant_field)
6932 / TARGET_CHAR_BIT), dval);
d2e4a39e 6933 if (branch_type == NULL)
14f9c5c9 6934 {
4c4b4cd2
PH
6935 int f;
6936 for (f = variant_field + 1; f < nfields; f += 1)
6937 TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
14f9c5c9 6938 TYPE_NFIELDS (rtype) -= 1;
14f9c5c9
AS
6939 }
6940 else
6941 {
4c4b4cd2
PH
6942 TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
6943 TYPE_FIELD_NAME (rtype, variant_field) = "S";
6944 TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
14f9c5c9 6945 TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
14f9c5c9 6946 }
4c4b4cd2 6947 TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
d2e4a39e 6948
4c4b4cd2 6949 value_free_to_mark (mark);
14f9c5c9
AS
6950 return rtype;
6951}
6952
6953/* An ordinary record type (with fixed-length fields) that describes
6954 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
6955 beginning of this section]. Any necessary discriminants' values
4c4b4cd2
PH
6956 should be in DVAL, a record value; it may be NULL if the object
6957 at ADDR itself contains any necessary discriminant values.
6958 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
6959 values from the record are needed. Except in the case that DVAL,
6960 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
6961 unchecked) is replaced by a particular branch of the variant.
6962
6963 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
6964 is questionable and may be removed. It can arise during the
6965 processing of an unconstrained-array-of-record type where all the
6966 variant branches have exactly the same size. This is because in
6967 such cases, the compiler does not bother to use the XVS convention
6968 when encoding the record. I am currently dubious of this
6969 shortcut and suspect the compiler should be altered. FIXME. */
14f9c5c9 6970
d2e4a39e 6971static struct type *
fc1a4b47 6972to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
4c4b4cd2 6973 CORE_ADDR address, struct value *dval)
14f9c5c9 6974{
d2e4a39e 6975 struct type *templ_type;
14f9c5c9 6976
4c4b4cd2
PH
6977 if (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE)
6978 return type0;
6979
d2e4a39e 6980 templ_type = dynamic_template_type (type0);
14f9c5c9
AS
6981
6982 if (templ_type != NULL)
6983 return template_to_fixed_record_type (templ_type, valaddr, address, dval);
4c4b4cd2
PH
6984 else if (variant_field_index (type0) >= 0)
6985 {
6986 if (dval == NULL && valaddr == NULL && address == 0)
6987 return type0;
6988 return to_record_with_fixed_variant_part (type0, valaddr, address,
6989 dval);
6990 }
14f9c5c9
AS
6991 else
6992 {
4c4b4cd2 6993 TYPE_FLAGS (type0) |= TYPE_FLAG_FIXED_INSTANCE;
14f9c5c9
AS
6994 return type0;
6995 }
6996
6997}
6998
6999/* An ordinary record type (with fixed-length fields) that describes
7000 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7001 union type. Any necessary discriminants' values should be in DVAL,
7002 a record value. That is, this routine selects the appropriate
7003 branch of the union at ADDR according to the discriminant value
4c4b4cd2 7004 indicated in the union's type name. */
14f9c5c9 7005
d2e4a39e 7006static struct type *
fc1a4b47 7007to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
4c4b4cd2 7008 CORE_ADDR address, struct value *dval)
14f9c5c9
AS
7009{
7010 int which;
d2e4a39e
AS
7011 struct type *templ_type;
7012 struct type *var_type;
14f9c5c9
AS
7013
7014 if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
7015 var_type = TYPE_TARGET_TYPE (var_type0);
d2e4a39e 7016 else
14f9c5c9
AS
7017 var_type = var_type0;
7018
7019 templ_type = ada_find_parallel_type (var_type, "___XVU");
7020
7021 if (templ_type != NULL)
7022 var_type = templ_type;
7023
d2e4a39e
AS
7024 which =
7025 ada_which_variant_applies (var_type,
0fd88904 7026 value_type (dval), value_contents (dval));
14f9c5c9
AS
7027
7028 if (which < 0)
7029 return empty_record (TYPE_OBJFILE (var_type));
7030 else if (is_dynamic_field (var_type, which))
4c4b4cd2 7031 return to_fixed_record_type
d2e4a39e
AS
7032 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
7033 valaddr, address, dval);
4c4b4cd2 7034 else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
d2e4a39e
AS
7035 return
7036 to_fixed_record_type
7037 (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
14f9c5c9
AS
7038 else
7039 return TYPE_FIELD_TYPE (var_type, which);
7040}
7041
7042/* Assuming that TYPE0 is an array type describing the type of a value
7043 at ADDR, and that DVAL describes a record containing any
7044 discriminants used in TYPE0, returns a type for the value that
7045 contains no dynamic components (that is, no components whose sizes
7046 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7047 true, gives an error message if the resulting type's size is over
4c4b4cd2 7048 varsize_limit. */
14f9c5c9 7049
d2e4a39e
AS
7050static struct type *
7051to_fixed_array_type (struct type *type0, struct value *dval,
4c4b4cd2 7052 int ignore_too_big)
14f9c5c9 7053{
d2e4a39e
AS
7054 struct type *index_type_desc;
7055 struct type *result;
14f9c5c9 7056
4c4b4cd2
PH
7057 if (ada_is_packed_array_type (type0) /* revisit? */
7058 || (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE))
7059 return type0;
14f9c5c9
AS
7060
7061 index_type_desc = ada_find_parallel_type (type0, "___XA");
7062 if (index_type_desc == NULL)
7063 {
61ee279c 7064 struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
14f9c5c9 7065 /* NOTE: elt_type---the fixed version of elt_type0---should never
4c4b4cd2
PH
7066 depend on the contents of the array in properly constructed
7067 debugging data. */
529cad9c
PH
7068 /* Create a fixed version of the array element type.
7069 We're not providing the address of an element here,
e1d5a0d2 7070 and thus the actual object value cannot be inspected to do
529cad9c
PH
7071 the conversion. This should not be a problem, since arrays of
7072 unconstrained objects are not allowed. In particular, all
7073 the elements of an array of a tagged type should all be of
7074 the same type specified in the debugging info. No need to
7075 consult the object tag. */
1ed6ede0 7076 struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
14f9c5c9
AS
7077
7078 if (elt_type0 == elt_type)
4c4b4cd2 7079 result = type0;
14f9c5c9 7080 else
4c4b4cd2
PH
7081 result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
7082 elt_type, TYPE_INDEX_TYPE (type0));
14f9c5c9
AS
7083 }
7084 else
7085 {
7086 int i;
7087 struct type *elt_type0;
7088
7089 elt_type0 = type0;
7090 for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
4c4b4cd2 7091 elt_type0 = TYPE_TARGET_TYPE (elt_type0);
14f9c5c9
AS
7092
7093 /* NOTE: result---the fixed version of elt_type0---should never
4c4b4cd2
PH
7094 depend on the contents of the array in properly constructed
7095 debugging data. */
529cad9c
PH
7096 /* Create a fixed version of the array element type.
7097 We're not providing the address of an element here,
e1d5a0d2 7098 and thus the actual object value cannot be inspected to do
529cad9c
PH
7099 the conversion. This should not be a problem, since arrays of
7100 unconstrained objects are not allowed. In particular, all
7101 the elements of an array of a tagged type should all be of
7102 the same type specified in the debugging info. No need to
7103 consult the object tag. */
1ed6ede0
JB
7104 result =
7105 ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
14f9c5c9 7106 for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
4c4b4cd2
PH
7107 {
7108 struct type *range_type =
7109 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, i),
7110 dval, TYPE_OBJFILE (type0));
7111 result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
7112 result, range_type);
7113 }
d2e4a39e 7114 if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
323e0a4a 7115 error (_("array type with dynamic size is larger than varsize-limit"));
14f9c5c9
AS
7116 }
7117
4c4b4cd2 7118 TYPE_FLAGS (result) |= TYPE_FLAG_FIXED_INSTANCE;
14f9c5c9 7119 return result;
d2e4a39e 7120}
14f9c5c9
AS
7121
7122
7123/* A standard type (containing no dynamically sized components)
7124 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7125 DVAL describes a record containing any discriminants used in TYPE0,
4c4b4cd2 7126 and may be NULL if there are none, or if the object of type TYPE at
529cad9c
PH
7127 ADDRESS or in VALADDR contains these discriminants.
7128
1ed6ede0
JB
7129 If CHECK_TAG is not null, in the case of tagged types, this function
7130 attempts to locate the object's tag and use it to compute the actual
7131 type. However, when ADDRESS is null, we cannot use it to determine the
7132 location of the tag, and therefore compute the tagged type's actual type.
7133 So we return the tagged type without consulting the tag. */
529cad9c 7134
f192137b
JB
7135static struct type *
7136ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
1ed6ede0 7137 CORE_ADDR address, struct value *dval, int check_tag)
14f9c5c9 7138{
61ee279c 7139 type = ada_check_typedef (type);
d2e4a39e
AS
7140 switch (TYPE_CODE (type))
7141 {
7142 default:
14f9c5c9 7143 return type;
d2e4a39e 7144 case TYPE_CODE_STRUCT:
4c4b4cd2 7145 {
76a01679 7146 struct type *static_type = to_static_fixed_type (type);
1ed6ede0
JB
7147 struct type *fixed_record_type =
7148 to_fixed_record_type (type, valaddr, address, NULL);
529cad9c
PH
7149 /* If STATIC_TYPE is a tagged type and we know the object's address,
7150 then we can determine its tag, and compute the object's actual
1ed6ede0
JB
7151 type from there. Note that we have to use the fixed record
7152 type (the parent part of the record may have dynamic fields
7153 and the way the location of _tag is expressed may depend on
7154 them). */
529cad9c 7155
1ed6ede0 7156 if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
76a01679
JB
7157 {
7158 struct type *real_type =
1ed6ede0
JB
7159 type_from_tag (value_tag_from_contents_and_address
7160 (fixed_record_type,
7161 valaddr,
7162 address));
76a01679 7163 if (real_type != NULL)
1ed6ede0 7164 return to_fixed_record_type (real_type, valaddr, address, NULL);
76a01679 7165 }
1ed6ede0 7166 return fixed_record_type;
4c4b4cd2 7167 }
d2e4a39e 7168 case TYPE_CODE_ARRAY:
4c4b4cd2 7169 return to_fixed_array_type (type, dval, 1);
d2e4a39e
AS
7170 case TYPE_CODE_UNION:
7171 if (dval == NULL)
4c4b4cd2 7172 return type;
d2e4a39e 7173 else
4c4b4cd2 7174 return to_fixed_variant_branch_type (type, valaddr, address, dval);
d2e4a39e 7175 }
14f9c5c9
AS
7176}
7177
f192137b
JB
7178/* The same as ada_to_fixed_type_1, except that it preserves the type
7179 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7180 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7181
7182struct type *
7183ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
7184 CORE_ADDR address, struct value *dval, int check_tag)
7185
7186{
7187 struct type *fixed_type =
7188 ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
7189
7190 if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
7191 && TYPE_TARGET_TYPE (type) == fixed_type)
7192 return type;
7193
7194 return fixed_type;
7195}
7196
14f9c5c9 7197/* A standard (static-sized) type corresponding as well as possible to
4c4b4cd2 7198 TYPE0, but based on no runtime data. */
14f9c5c9 7199
d2e4a39e
AS
7200static struct type *
7201to_static_fixed_type (struct type *type0)
14f9c5c9 7202{
d2e4a39e 7203 struct type *type;
14f9c5c9
AS
7204
7205 if (type0 == NULL)
7206 return NULL;
7207
4c4b4cd2
PH
7208 if (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE)
7209 return type0;
7210
61ee279c 7211 type0 = ada_check_typedef (type0);
d2e4a39e 7212
14f9c5c9
AS
7213 switch (TYPE_CODE (type0))
7214 {
7215 default:
7216 return type0;
7217 case TYPE_CODE_STRUCT:
7218 type = dynamic_template_type (type0);
d2e4a39e 7219 if (type != NULL)
4c4b4cd2
PH
7220 return template_to_static_fixed_type (type);
7221 else
7222 return template_to_static_fixed_type (type0);
14f9c5c9
AS
7223 case TYPE_CODE_UNION:
7224 type = ada_find_parallel_type (type0, "___XVU");
7225 if (type != NULL)
4c4b4cd2
PH
7226 return template_to_static_fixed_type (type);
7227 else
7228 return template_to_static_fixed_type (type0);
14f9c5c9
AS
7229 }
7230}
7231
4c4b4cd2
PH
7232/* A static approximation of TYPE with all type wrappers removed. */
7233
d2e4a39e
AS
7234static struct type *
7235static_unwrap_type (struct type *type)
14f9c5c9
AS
7236{
7237 if (ada_is_aligner_type (type))
7238 {
61ee279c 7239 struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
14f9c5c9 7240 if (ada_type_name (type1) == NULL)
4c4b4cd2 7241 TYPE_NAME (type1) = ada_type_name (type);
14f9c5c9
AS
7242
7243 return static_unwrap_type (type1);
7244 }
d2e4a39e 7245 else
14f9c5c9 7246 {
d2e4a39e
AS
7247 struct type *raw_real_type = ada_get_base_type (type);
7248 if (raw_real_type == type)
4c4b4cd2 7249 return type;
14f9c5c9 7250 else
4c4b4cd2 7251 return to_static_fixed_type (raw_real_type);
14f9c5c9
AS
7252 }
7253}
7254
7255/* In some cases, incomplete and private types require
4c4b4cd2 7256 cross-references that are not resolved as records (for example,
14f9c5c9
AS
7257 type Foo;
7258 type FooP is access Foo;
7259 V: FooP;
7260 type Foo is array ...;
4c4b4cd2 7261 ). In these cases, since there is no mechanism for producing
14f9c5c9
AS
7262 cross-references to such types, we instead substitute for FooP a
7263 stub enumeration type that is nowhere resolved, and whose tag is
4c4b4cd2 7264 the name of the actual type. Call these types "non-record stubs". */
14f9c5c9
AS
7265
7266/* A type equivalent to TYPE that is not a non-record stub, if one
4c4b4cd2
PH
7267 exists, otherwise TYPE. */
7268
d2e4a39e 7269struct type *
61ee279c 7270ada_check_typedef (struct type *type)
14f9c5c9
AS
7271{
7272 CHECK_TYPEDEF (type);
7273 if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
529cad9c 7274 || !TYPE_STUB (type)
14f9c5c9
AS
7275 || TYPE_TAG_NAME (type) == NULL)
7276 return type;
d2e4a39e 7277 else
14f9c5c9 7278 {
d2e4a39e
AS
7279 char *name = TYPE_TAG_NAME (type);
7280 struct type *type1 = ada_find_any_type (name);
14f9c5c9
AS
7281 return (type1 == NULL) ? type : type1;
7282 }
7283}
7284
7285/* A value representing the data at VALADDR/ADDRESS as described by
7286 type TYPE0, but with a standard (static-sized) type that correctly
7287 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7288 type, then return VAL0 [this feature is simply to avoid redundant
4c4b4cd2 7289 creation of struct values]. */
14f9c5c9 7290
4c4b4cd2
PH
7291static struct value *
7292ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
7293 struct value *val0)
14f9c5c9 7294{
1ed6ede0 7295 struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
14f9c5c9
AS
7296 if (type == type0 && val0 != NULL)
7297 return val0;
d2e4a39e 7298 else
4c4b4cd2
PH
7299 return value_from_contents_and_address (type, 0, address);
7300}
7301
7302/* A value representing VAL, but with a standard (static-sized) type
7303 that correctly describes it. Does not necessarily create a new
7304 value. */
7305
7306static struct value *
7307ada_to_fixed_value (struct value *val)
7308{
df407dfe
AC
7309 return ada_to_fixed_value_create (value_type (val),
7310 VALUE_ADDRESS (val) + value_offset (val),
4c4b4cd2 7311 val);
14f9c5c9
AS
7312}
7313
4c4b4cd2 7314/* A value representing VAL, but with a standard (static-sized) type
14f9c5c9
AS
7315 chosen to approximate the real type of VAL as well as possible, but
7316 without consulting any runtime values. For Ada dynamic-sized
4c4b4cd2 7317 types, therefore, the type of the result is likely to be inaccurate. */
14f9c5c9 7318
d2e4a39e
AS
7319struct value *
7320ada_to_static_fixed_value (struct value *val)
14f9c5c9 7321{
d2e4a39e 7322 struct type *type =
df407dfe
AC
7323 to_static_fixed_type (static_unwrap_type (value_type (val)));
7324 if (type == value_type (val))
14f9c5c9
AS
7325 return val;
7326 else
4c4b4cd2 7327 return coerce_unspec_val_to_type (val, type);
14f9c5c9 7328}
d2e4a39e 7329\f
14f9c5c9 7330
14f9c5c9
AS
7331/* Attributes */
7332
4c4b4cd2
PH
7333/* Table mapping attribute numbers to names.
7334 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
14f9c5c9 7335
d2e4a39e 7336static const char *attribute_names[] = {
14f9c5c9
AS
7337 "<?>",
7338
d2e4a39e 7339 "first",
14f9c5c9
AS
7340 "last",
7341 "length",
7342 "image",
14f9c5c9
AS
7343 "max",
7344 "min",
4c4b4cd2
PH
7345 "modulus",
7346 "pos",
7347 "size",
7348 "tag",
14f9c5c9 7349 "val",
14f9c5c9
AS
7350 0
7351};
7352
d2e4a39e 7353const char *
4c4b4cd2 7354ada_attribute_name (enum exp_opcode n)
14f9c5c9 7355{
4c4b4cd2
PH
7356 if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
7357 return attribute_names[n - OP_ATR_FIRST + 1];
14f9c5c9
AS
7358 else
7359 return attribute_names[0];
7360}
7361
4c4b4cd2 7362/* Evaluate the 'POS attribute applied to ARG. */
14f9c5c9 7363
4c4b4cd2
PH
7364static LONGEST
7365pos_atr (struct value *arg)
14f9c5c9 7366{
df407dfe 7367 struct type *type = value_type (arg);
14f9c5c9 7368
d2e4a39e 7369 if (!discrete_type_p (type))
323e0a4a 7370 error (_("'POS only defined on discrete types"));
14f9c5c9
AS
7371
7372 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
7373 {
7374 int i;
7375 LONGEST v = value_as_long (arg);
7376
d2e4a39e 7377 for (i = 0; i < TYPE_NFIELDS (type); i += 1)
4c4b4cd2
PH
7378 {
7379 if (v == TYPE_FIELD_BITPOS (type, i))
7380 return i;
7381 }
323e0a4a 7382 error (_("enumeration value is invalid: can't find 'POS"));
14f9c5c9
AS
7383 }
7384 else
4c4b4cd2
PH
7385 return value_as_long (arg);
7386}
7387
7388static struct value *
7389value_pos_atr (struct value *arg)
7390{
72d5681a 7391 return value_from_longest (builtin_type_int, pos_atr (arg));
14f9c5c9
AS
7392}
7393
4c4b4cd2 7394/* Evaluate the TYPE'VAL attribute applied to ARG. */
14f9c5c9 7395
d2e4a39e
AS
7396static struct value *
7397value_val_atr (struct type *type, struct value *arg)
14f9c5c9 7398{
d2e4a39e 7399 if (!discrete_type_p (type))
323e0a4a 7400 error (_("'VAL only defined on discrete types"));
df407dfe 7401 if (!integer_type_p (value_type (arg)))
323e0a4a 7402 error (_("'VAL requires integral argument"));
14f9c5c9
AS
7403
7404 if (TYPE_CODE (type) == TYPE_CODE_ENUM)
7405 {
7406 long pos = value_as_long (arg);
7407 if (pos < 0 || pos >= TYPE_NFIELDS (type))
323e0a4a 7408 error (_("argument to 'VAL out of range"));
d2e4a39e 7409 return value_from_longest (type, TYPE_FIELD_BITPOS (type, pos));
14f9c5c9
AS
7410 }
7411 else
7412 return value_from_longest (type, value_as_long (arg));
7413}
14f9c5c9 7414\f
d2e4a39e 7415
4c4b4cd2 7416 /* Evaluation */
14f9c5c9 7417
4c4b4cd2
PH
7418/* True if TYPE appears to be an Ada character type.
7419 [At the moment, this is true only for Character and Wide_Character;
7420 It is a heuristic test that could stand improvement]. */
14f9c5c9 7421
d2e4a39e
AS
7422int
7423ada_is_character_type (struct type *type)
14f9c5c9 7424{
7b9f71f2
JB
7425 const char *name;
7426
7427 /* If the type code says it's a character, then assume it really is,
7428 and don't check any further. */
7429 if (TYPE_CODE (type) == TYPE_CODE_CHAR)
7430 return 1;
7431
7432 /* Otherwise, assume it's a character type iff it is a discrete type
7433 with a known character type name. */
7434 name = ada_type_name (type);
7435 return (name != NULL
7436 && (TYPE_CODE (type) == TYPE_CODE_INT
7437 || TYPE_CODE (type) == TYPE_CODE_RANGE)
7438 && (strcmp (name, "character") == 0
7439 || strcmp (name, "wide_character") == 0
5a517ebd 7440 || strcmp (name, "wide_wide_character") == 0
7b9f71f2 7441 || strcmp (name, "unsigned char") == 0));
14f9c5c9
AS
7442}
7443
4c4b4cd2 7444/* True if TYPE appears to be an Ada string type. */
14f9c5c9
AS
7445
7446int
ebf56fd3 7447ada_is_string_type (struct type *type)
14f9c5c9 7448{
61ee279c 7449 type = ada_check_typedef (type);
d2e4a39e 7450 if (type != NULL
14f9c5c9 7451 && TYPE_CODE (type) != TYPE_CODE_PTR
76a01679
JB
7452 && (ada_is_simple_array_type (type)
7453 || ada_is_array_descriptor_type (type))
14f9c5c9
AS
7454 && ada_array_arity (type) == 1)
7455 {
7456 struct type *elttype = ada_array_element_type (type, 1);
7457
7458 return ada_is_character_type (elttype);
7459 }
d2e4a39e 7460 else
14f9c5c9
AS
7461 return 0;
7462}
7463
7464
7465/* True if TYPE is a struct type introduced by the compiler to force the
7466 alignment of a value. Such types have a single field with a
4c4b4cd2 7467 distinctive name. */
14f9c5c9
AS
7468
7469int
ebf56fd3 7470ada_is_aligner_type (struct type *type)
14f9c5c9 7471{
61ee279c 7472 type = ada_check_typedef (type);
714e53ab
PH
7473
7474 /* If we can find a parallel XVS type, then the XVS type should
7475 be used instead of this type. And hence, this is not an aligner
7476 type. */
7477 if (ada_find_parallel_type (type, "___XVS") != NULL)
7478 return 0;
7479
14f9c5c9 7480 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
4c4b4cd2
PH
7481 && TYPE_NFIELDS (type) == 1
7482 && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
14f9c5c9
AS
7483}
7484
7485/* If there is an ___XVS-convention type parallel to SUBTYPE, return
4c4b4cd2 7486 the parallel type. */
14f9c5c9 7487
d2e4a39e
AS
7488struct type *
7489ada_get_base_type (struct type *raw_type)
14f9c5c9 7490{
d2e4a39e
AS
7491 struct type *real_type_namer;
7492 struct type *raw_real_type;
14f9c5c9
AS
7493
7494 if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
7495 return raw_type;
7496
7497 real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
d2e4a39e 7498 if (real_type_namer == NULL
14f9c5c9
AS
7499 || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
7500 || TYPE_NFIELDS (real_type_namer) != 1)
7501 return raw_type;
7502
7503 raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
d2e4a39e 7504 if (raw_real_type == NULL)
14f9c5c9
AS
7505 return raw_type;
7506 else
7507 return raw_real_type;
d2e4a39e 7508}
14f9c5c9 7509
4c4b4cd2 7510/* The type of value designated by TYPE, with all aligners removed. */
14f9c5c9 7511
d2e4a39e
AS
7512struct type *
7513ada_aligned_type (struct type *type)
14f9c5c9
AS
7514{
7515 if (ada_is_aligner_type (type))
7516 return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
7517 else
7518 return ada_get_base_type (type);
7519}
7520
7521
7522/* The address of the aligned value in an object at address VALADDR
4c4b4cd2 7523 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
14f9c5c9 7524
fc1a4b47
AC
7525const gdb_byte *
7526ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
14f9c5c9 7527{
d2e4a39e 7528 if (ada_is_aligner_type (type))
14f9c5c9 7529 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
4c4b4cd2
PH
7530 valaddr +
7531 TYPE_FIELD_BITPOS (type,
7532 0) / TARGET_CHAR_BIT);
14f9c5c9
AS
7533 else
7534 return valaddr;
7535}
7536
4c4b4cd2
PH
7537
7538
14f9c5c9 7539/* The printed representation of an enumeration literal with encoded
4c4b4cd2 7540 name NAME. The value is good to the next call of ada_enum_name. */
d2e4a39e
AS
7541const char *
7542ada_enum_name (const char *name)
14f9c5c9 7543{
4c4b4cd2
PH
7544 static char *result;
7545 static size_t result_len = 0;
d2e4a39e 7546 char *tmp;
14f9c5c9 7547
4c4b4cd2
PH
7548 /* First, unqualify the enumeration name:
7549 1. Search for the last '.' character. If we find one, then skip
76a01679
JB
7550 all the preceeding characters, the unqualified name starts
7551 right after that dot.
4c4b4cd2 7552 2. Otherwise, we may be debugging on a target where the compiler
76a01679
JB
7553 translates dots into "__". Search forward for double underscores,
7554 but stop searching when we hit an overloading suffix, which is
7555 of the form "__" followed by digits. */
4c4b4cd2 7556
c3e5cd34
PH
7557 tmp = strrchr (name, '.');
7558 if (tmp != NULL)
4c4b4cd2
PH
7559 name = tmp + 1;
7560 else
14f9c5c9 7561 {
4c4b4cd2
PH
7562 while ((tmp = strstr (name, "__")) != NULL)
7563 {
7564 if (isdigit (tmp[2]))
7565 break;
7566 else
7567 name = tmp + 2;
7568 }
14f9c5c9
AS
7569 }
7570
7571 if (name[0] == 'Q')
7572 {
14f9c5c9
AS
7573 int v;
7574 if (name[1] == 'U' || name[1] == 'W')
4c4b4cd2
PH
7575 {
7576 if (sscanf (name + 2, "%x", &v) != 1)
7577 return name;
7578 }
14f9c5c9 7579 else
4c4b4cd2 7580 return name;
14f9c5c9 7581
4c4b4cd2 7582 GROW_VECT (result, result_len, 16);
14f9c5c9 7583 if (isascii (v) && isprint (v))
4c4b4cd2 7584 sprintf (result, "'%c'", v);
14f9c5c9 7585 else if (name[1] == 'U')
4c4b4cd2 7586 sprintf (result, "[\"%02x\"]", v);
14f9c5c9 7587 else
4c4b4cd2 7588 sprintf (result, "[\"%04x\"]", v);
14f9c5c9
AS
7589
7590 return result;
7591 }
d2e4a39e 7592 else
4c4b4cd2 7593 {
c3e5cd34
PH
7594 tmp = strstr (name, "__");
7595 if (tmp == NULL)
7596 tmp = strstr (name, "$");
7597 if (tmp != NULL)
4c4b4cd2
PH
7598 {
7599 GROW_VECT (result, result_len, tmp - name + 1);
7600 strncpy (result, name, tmp - name);
7601 result[tmp - name] = '\0';
7602 return result;
7603 }
7604
7605 return name;
7606 }
14f9c5c9
AS
7607}
7608
d2e4a39e 7609static struct value *
ebf56fd3 7610evaluate_subexp (struct type *expect_type, struct expression *exp, int *pos,
4c4b4cd2 7611 enum noside noside)
14f9c5c9 7612{
76a01679 7613 return (*exp->language_defn->la_exp_desc->evaluate_exp)
4c4b4cd2 7614 (expect_type, exp, pos, noside);
14f9c5c9
AS
7615}
7616
7617/* Evaluate the subexpression of EXP starting at *POS as for
7618 evaluate_type, updating *POS to point just past the evaluated
4c4b4cd2 7619 expression. */
14f9c5c9 7620
d2e4a39e
AS
7621static struct value *
7622evaluate_subexp_type (struct expression *exp, int *pos)
14f9c5c9 7623{
4c4b4cd2 7624 return (*exp->language_defn->la_exp_desc->evaluate_exp)
14f9c5c9
AS
7625 (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
7626}
7627
7628/* If VAL is wrapped in an aligner or subtype wrapper, return the
4c4b4cd2 7629 value it wraps. */
14f9c5c9 7630
d2e4a39e
AS
7631static struct value *
7632unwrap_value (struct value *val)
14f9c5c9 7633{
df407dfe 7634 struct type *type = ada_check_typedef (value_type (val));
14f9c5c9
AS
7635 if (ada_is_aligner_type (type))
7636 {
d2e4a39e 7637 struct value *v = value_struct_elt (&val, NULL, "F",
4c4b4cd2 7638 NULL, "internal structure");
df407dfe 7639 struct type *val_type = ada_check_typedef (value_type (v));
14f9c5c9 7640 if (ada_type_name (val_type) == NULL)
4c4b4cd2 7641 TYPE_NAME (val_type) = ada_type_name (type);
14f9c5c9
AS
7642
7643 return unwrap_value (v);
7644 }
d2e4a39e 7645 else
14f9c5c9 7646 {
d2e4a39e 7647 struct type *raw_real_type =
61ee279c 7648 ada_check_typedef (ada_get_base_type (type));
d2e4a39e 7649
14f9c5c9 7650 if (type == raw_real_type)
4c4b4cd2 7651 return val;
14f9c5c9 7652
d2e4a39e 7653 return
4c4b4cd2
PH
7654 coerce_unspec_val_to_type
7655 (val, ada_to_fixed_type (raw_real_type, 0,
df407dfe 7656 VALUE_ADDRESS (val) + value_offset (val),
1ed6ede0 7657 NULL, 1));
14f9c5c9
AS
7658 }
7659}
d2e4a39e
AS
7660
7661static struct value *
7662cast_to_fixed (struct type *type, struct value *arg)
14f9c5c9
AS
7663{
7664 LONGEST val;
7665
df407dfe 7666 if (type == value_type (arg))
14f9c5c9 7667 return arg;
df407dfe 7668 else if (ada_is_fixed_point_type (value_type (arg)))
d2e4a39e 7669 val = ada_float_to_fixed (type,
df407dfe 7670 ada_fixed_to_float (value_type (arg),
4c4b4cd2 7671 value_as_long (arg)));
d2e4a39e 7672 else
14f9c5c9 7673 {
d2e4a39e 7674 DOUBLEST argd =
4c4b4cd2 7675 value_as_double (value_cast (builtin_type_double, value_copy (arg)));
14f9c5c9
AS
7676 val = ada_float_to_fixed (type, argd);
7677 }
7678
7679 return value_from_longest (type, val);
7680}
7681
d2e4a39e
AS
7682static struct value *
7683cast_from_fixed_to_double (struct value *arg)
14f9c5c9 7684{
df407dfe 7685 DOUBLEST val = ada_fixed_to_float (value_type (arg),
4c4b4cd2 7686 value_as_long (arg));
14f9c5c9
AS
7687 return value_from_double (builtin_type_double, val);
7688}
7689
4c4b4cd2
PH
7690/* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7691 return the converted value. */
7692
d2e4a39e
AS
7693static struct value *
7694coerce_for_assign (struct type *type, struct value *val)
14f9c5c9 7695{
df407dfe 7696 struct type *type2 = value_type (val);
14f9c5c9
AS
7697 if (type == type2)
7698 return val;
7699
61ee279c
PH
7700 type2 = ada_check_typedef (type2);
7701 type = ada_check_typedef (type);
14f9c5c9 7702
d2e4a39e
AS
7703 if (TYPE_CODE (type2) == TYPE_CODE_PTR
7704 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
14f9c5c9
AS
7705 {
7706 val = ada_value_ind (val);
df407dfe 7707 type2 = value_type (val);
14f9c5c9
AS
7708 }
7709
d2e4a39e 7710 if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
14f9c5c9
AS
7711 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
7712 {
7713 if (TYPE_LENGTH (type2) != TYPE_LENGTH (type)
4c4b4cd2
PH
7714 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
7715 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2)))
323e0a4a 7716 error (_("Incompatible types in assignment"));
04624583 7717 deprecated_set_value_type (val, type);
14f9c5c9 7718 }
d2e4a39e 7719 return val;
14f9c5c9
AS
7720}
7721
4c4b4cd2
PH
7722static struct value *
7723ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
7724{
7725 struct value *val;
7726 struct type *type1, *type2;
7727 LONGEST v, v1, v2;
7728
994b9211
AC
7729 arg1 = coerce_ref (arg1);
7730 arg2 = coerce_ref (arg2);
df407dfe
AC
7731 type1 = base_type (ada_check_typedef (value_type (arg1)));
7732 type2 = base_type (ada_check_typedef (value_type (arg2)));
4c4b4cd2 7733
76a01679
JB
7734 if (TYPE_CODE (type1) != TYPE_CODE_INT
7735 || TYPE_CODE (type2) != TYPE_CODE_INT)
4c4b4cd2
PH
7736 return value_binop (arg1, arg2, op);
7737
76a01679 7738 switch (op)
4c4b4cd2
PH
7739 {
7740 case BINOP_MOD:
7741 case BINOP_DIV:
7742 case BINOP_REM:
7743 break;
7744 default:
7745 return value_binop (arg1, arg2, op);
7746 }
7747
7748 v2 = value_as_long (arg2);
7749 if (v2 == 0)
323e0a4a 7750 error (_("second operand of %s must not be zero."), op_string (op));
4c4b4cd2
PH
7751
7752 if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
7753 return value_binop (arg1, arg2, op);
7754
7755 v1 = value_as_long (arg1);
7756 switch (op)
7757 {
7758 case BINOP_DIV:
7759 v = v1 / v2;
76a01679
JB
7760 if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
7761 v += v > 0 ? -1 : 1;
4c4b4cd2
PH
7762 break;
7763 case BINOP_REM:
7764 v = v1 % v2;
76a01679
JB
7765 if (v * v1 < 0)
7766 v -= v2;
4c4b4cd2
PH
7767 break;
7768 default:
7769 /* Should not reach this point. */
7770 v = 0;
7771 }
7772
7773 val = allocate_value (type1);
990a07ab 7774 store_unsigned_integer (value_contents_raw (val),
df407dfe 7775 TYPE_LENGTH (value_type (val)), v);
4c4b4cd2
PH
7776 return val;
7777}
7778
7779static int
7780ada_value_equal (struct value *arg1, struct value *arg2)
7781{
df407dfe
AC
7782 if (ada_is_direct_array_type (value_type (arg1))
7783 || ada_is_direct_array_type (value_type (arg2)))
4c4b4cd2 7784 {
f58b38bf
JB
7785 /* Automatically dereference any array reference before
7786 we attempt to perform the comparison. */
7787 arg1 = ada_coerce_ref (arg1);
7788 arg2 = ada_coerce_ref (arg2);
7789
4c4b4cd2
PH
7790 arg1 = ada_coerce_to_simple_array (arg1);
7791 arg2 = ada_coerce_to_simple_array (arg2);
df407dfe
AC
7792 if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
7793 || TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
323e0a4a 7794 error (_("Attempt to compare array with non-array"));
4c4b4cd2 7795 /* FIXME: The following works only for types whose
76a01679
JB
7796 representations use all bits (no padding or undefined bits)
7797 and do not have user-defined equality. */
7798 return
df407dfe 7799 TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
0fd88904 7800 && memcmp (value_contents (arg1), value_contents (arg2),
df407dfe 7801 TYPE_LENGTH (value_type (arg1))) == 0;
4c4b4cd2
PH
7802 }
7803 return value_equal (arg1, arg2);
7804}
7805
52ce6436
PH
7806/* Total number of component associations in the aggregate starting at
7807 index PC in EXP. Assumes that index PC is the start of an
7808 OP_AGGREGATE. */
7809
7810static int
7811num_component_specs (struct expression *exp, int pc)
7812{
7813 int n, m, i;
7814 m = exp->elts[pc + 1].longconst;
7815 pc += 3;
7816 n = 0;
7817 for (i = 0; i < m; i += 1)
7818 {
7819 switch (exp->elts[pc].opcode)
7820 {
7821 default:
7822 n += 1;
7823 break;
7824 case OP_CHOICES:
7825 n += exp->elts[pc + 1].longconst;
7826 break;
7827 }
7828 ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
7829 }
7830 return n;
7831}
7832
7833/* Assign the result of evaluating EXP starting at *POS to the INDEXth
7834 component of LHS (a simple array or a record), updating *POS past
7835 the expression, assuming that LHS is contained in CONTAINER. Does
7836 not modify the inferior's memory, nor does it modify LHS (unless
7837 LHS == CONTAINER). */
7838
7839static void
7840assign_component (struct value *container, struct value *lhs, LONGEST index,
7841 struct expression *exp, int *pos)
7842{
7843 struct value *mark = value_mark ();
7844 struct value *elt;
7845 if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
7846 {
7847 struct value *index_val = value_from_longest (builtin_type_int, index);
7848 elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
7849 }
7850 else
7851 {
7852 elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
7853 elt = ada_to_fixed_value (unwrap_value (elt));
7854 }
7855
7856 if (exp->elts[*pos].opcode == OP_AGGREGATE)
7857 assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
7858 else
7859 value_assign_to_component (container, elt,
7860 ada_evaluate_subexp (NULL, exp, pos,
7861 EVAL_NORMAL));
7862
7863 value_free_to_mark (mark);
7864}
7865
7866/* Assuming that LHS represents an lvalue having a record or array
7867 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7868 of that aggregate's value to LHS, advancing *POS past the
7869 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7870 lvalue containing LHS (possibly LHS itself). Does not modify
7871 the inferior's memory, nor does it modify the contents of
7872 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7873
7874static struct value *
7875assign_aggregate (struct value *container,
7876 struct value *lhs, struct expression *exp,
7877 int *pos, enum noside noside)
7878{
7879 struct type *lhs_type;
7880 int n = exp->elts[*pos+1].longconst;
7881 LONGEST low_index, high_index;
7882 int num_specs;
7883 LONGEST *indices;
7884 int max_indices, num_indices;
7885 int is_array_aggregate;
7886 int i;
7887 struct value *mark = value_mark ();
7888
7889 *pos += 3;
7890 if (noside != EVAL_NORMAL)
7891 {
7892 int i;
7893 for (i = 0; i < n; i += 1)
7894 ada_evaluate_subexp (NULL, exp, pos, noside);
7895 return container;
7896 }
7897
7898 container = ada_coerce_ref (container);
7899 if (ada_is_direct_array_type (value_type (container)))
7900 container = ada_coerce_to_simple_array (container);
7901 lhs = ada_coerce_ref (lhs);
7902 if (!deprecated_value_modifiable (lhs))
7903 error (_("Left operand of assignment is not a modifiable lvalue."));
7904
7905 lhs_type = value_type (lhs);
7906 if (ada_is_direct_array_type (lhs_type))
7907 {
7908 lhs = ada_coerce_to_simple_array (lhs);
7909 lhs_type = value_type (lhs);
7910 low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
7911 high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
7912 is_array_aggregate = 1;
7913 }
7914 else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
7915 {
7916 low_index = 0;
7917 high_index = num_visible_fields (lhs_type) - 1;
7918 is_array_aggregate = 0;
7919 }
7920 else
7921 error (_("Left-hand side must be array or record."));
7922
7923 num_specs = num_component_specs (exp, *pos - 3);
7924 max_indices = 4 * num_specs + 4;
7925 indices = alloca (max_indices * sizeof (indices[0]));
7926 indices[0] = indices[1] = low_index - 1;
7927 indices[2] = indices[3] = high_index + 1;
7928 num_indices = 4;
7929
7930 for (i = 0; i < n; i += 1)
7931 {
7932 switch (exp->elts[*pos].opcode)
7933 {
7934 case OP_CHOICES:
7935 aggregate_assign_from_choices (container, lhs, exp, pos, indices,
7936 &num_indices, max_indices,
7937 low_index, high_index);
7938 break;
7939 case OP_POSITIONAL:
7940 aggregate_assign_positional (container, lhs, exp, pos, indices,
7941 &num_indices, max_indices,
7942 low_index, high_index);
7943 break;
7944 case OP_OTHERS:
7945 if (i != n-1)
7946 error (_("Misplaced 'others' clause"));
7947 aggregate_assign_others (container, lhs, exp, pos, indices,
7948 num_indices, low_index, high_index);
7949 break;
7950 default:
7951 error (_("Internal error: bad aggregate clause"));
7952 }
7953 }
7954
7955 return container;
7956}
7957
7958/* Assign into the component of LHS indexed by the OP_POSITIONAL
7959 construct at *POS, updating *POS past the construct, given that
7960 the positions are relative to lower bound LOW, where HIGH is the
7961 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
7962 updating *NUM_INDICES as needed. CONTAINER is as for
7963 assign_aggregate. */
7964static void
7965aggregate_assign_positional (struct value *container,
7966 struct value *lhs, struct expression *exp,
7967 int *pos, LONGEST *indices, int *num_indices,
7968 int max_indices, LONGEST low, LONGEST high)
7969{
7970 LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
7971
7972 if (ind - 1 == high)
e1d5a0d2 7973 warning (_("Extra components in aggregate ignored."));
52ce6436
PH
7974 if (ind <= high)
7975 {
7976 add_component_interval (ind, ind, indices, num_indices, max_indices);
7977 *pos += 3;
7978 assign_component (container, lhs, ind, exp, pos);
7979 }
7980 else
7981 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
7982}
7983
7984/* Assign into the components of LHS indexed by the OP_CHOICES
7985 construct at *POS, updating *POS past the construct, given that
7986 the allowable indices are LOW..HIGH. Record the indices assigned
7987 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
7988 needed. CONTAINER is as for assign_aggregate. */
7989static void
7990aggregate_assign_from_choices (struct value *container,
7991 struct value *lhs, struct expression *exp,
7992 int *pos, LONGEST *indices, int *num_indices,
7993 int max_indices, LONGEST low, LONGEST high)
7994{
7995 int j;
7996 int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
7997 int choice_pos, expr_pc;
7998 int is_array = ada_is_direct_array_type (value_type (lhs));
7999
8000 choice_pos = *pos += 3;
8001
8002 for (j = 0; j < n_choices; j += 1)
8003 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8004 expr_pc = *pos;
8005 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8006
8007 for (j = 0; j < n_choices; j += 1)
8008 {
8009 LONGEST lower, upper;
8010 enum exp_opcode op = exp->elts[choice_pos].opcode;
8011 if (op == OP_DISCRETE_RANGE)
8012 {
8013 choice_pos += 1;
8014 lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8015 EVAL_NORMAL));
8016 upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
8017 EVAL_NORMAL));
8018 }
8019 else if (is_array)
8020 {
8021 lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
8022 EVAL_NORMAL));
8023 upper = lower;
8024 }
8025 else
8026 {
8027 int ind;
8028 char *name;
8029 switch (op)
8030 {
8031 case OP_NAME:
8032 name = &exp->elts[choice_pos + 2].string;
8033 break;
8034 case OP_VAR_VALUE:
8035 name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
8036 break;
8037 default:
8038 error (_("Invalid record component association."));
8039 }
8040 ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
8041 ind = 0;
8042 if (! find_struct_field (name, value_type (lhs), 0,
8043 NULL, NULL, NULL, NULL, &ind))
8044 error (_("Unknown component name: %s."), name);
8045 lower = upper = ind;
8046 }
8047
8048 if (lower <= upper && (lower < low || upper > high))
8049 error (_("Index in component association out of bounds."));
8050
8051 add_component_interval (lower, upper, indices, num_indices,
8052 max_indices);
8053 while (lower <= upper)
8054 {
8055 int pos1;
8056 pos1 = expr_pc;
8057 assign_component (container, lhs, lower, exp, &pos1);
8058 lower += 1;
8059 }
8060 }
8061}
8062
8063/* Assign the value of the expression in the OP_OTHERS construct in
8064 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8065 have not been previously assigned. The index intervals already assigned
8066 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8067 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8068static void
8069aggregate_assign_others (struct value *container,
8070 struct value *lhs, struct expression *exp,
8071 int *pos, LONGEST *indices, int num_indices,
8072 LONGEST low, LONGEST high)
8073{
8074 int i;
8075 int expr_pc = *pos+1;
8076
8077 for (i = 0; i < num_indices - 2; i += 2)
8078 {
8079 LONGEST ind;
8080 for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
8081 {
8082 int pos;
8083 pos = expr_pc;
8084 assign_component (container, lhs, ind, exp, &pos);
8085 }
8086 }
8087 ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
8088}
8089
8090/* Add the interval [LOW .. HIGH] to the sorted set of intervals
8091 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8092 modifying *SIZE as needed. It is an error if *SIZE exceeds
8093 MAX_SIZE. The resulting intervals do not overlap. */
8094static void
8095add_component_interval (LONGEST low, LONGEST high,
8096 LONGEST* indices, int *size, int max_size)
8097{
8098 int i, j;
8099 for (i = 0; i < *size; i += 2) {
8100 if (high >= indices[i] && low <= indices[i + 1])
8101 {
8102 int kh;
8103 for (kh = i + 2; kh < *size; kh += 2)
8104 if (high < indices[kh])
8105 break;
8106 if (low < indices[i])
8107 indices[i] = low;
8108 indices[i + 1] = indices[kh - 1];
8109 if (high > indices[i + 1])
8110 indices[i + 1] = high;
8111 memcpy (indices + i + 2, indices + kh, *size - kh);
8112 *size -= kh - i - 2;
8113 return;
8114 }
8115 else if (high < indices[i])
8116 break;
8117 }
8118
8119 if (*size == max_size)
8120 error (_("Internal error: miscounted aggregate components."));
8121 *size += 2;
8122 for (j = *size-1; j >= i+2; j -= 1)
8123 indices[j] = indices[j - 2];
8124 indices[i] = low;
8125 indices[i + 1] = high;
8126}
8127
6e48bd2c
JB
8128/* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8129 is different. */
8130
8131static struct value *
8132ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
8133{
8134 if (type == ada_check_typedef (value_type (arg2)))
8135 return arg2;
8136
8137 if (ada_is_fixed_point_type (type))
8138 return (cast_to_fixed (type, arg2));
8139
8140 if (ada_is_fixed_point_type (value_type (arg2)))
8141 return value_cast (type, cast_from_fixed_to_double (arg2));
8142
8143 return value_cast (type, arg2);
8144}
8145
52ce6436 8146static struct value *
ebf56fd3 8147ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
4c4b4cd2 8148 int *pos, enum noside noside)
14f9c5c9
AS
8149{
8150 enum exp_opcode op;
14f9c5c9
AS
8151 int tem, tem2, tem3;
8152 int pc;
8153 struct value *arg1 = NULL, *arg2 = NULL, *arg3;
8154 struct type *type;
52ce6436 8155 int nargs, oplen;
d2e4a39e 8156 struct value **argvec;
14f9c5c9 8157
d2e4a39e
AS
8158 pc = *pos;
8159 *pos += 1;
14f9c5c9
AS
8160 op = exp->elts[pc].opcode;
8161
d2e4a39e 8162 switch (op)
14f9c5c9
AS
8163 {
8164 default:
8165 *pos -= 1;
6e48bd2c
JB
8166 arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
8167 arg1 = unwrap_value (arg1);
8168
8169 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8170 then we need to perform the conversion manually, because
8171 evaluate_subexp_standard doesn't do it. This conversion is
8172 necessary in Ada because the different kinds of float/fixed
8173 types in Ada have different representations.
8174
8175 Similarly, we need to perform the conversion from OP_LONG
8176 ourselves. */
8177 if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
8178 arg1 = ada_value_cast (expect_type, arg1, noside);
8179
8180 return arg1;
4c4b4cd2
PH
8181
8182 case OP_STRING:
8183 {
76a01679
JB
8184 struct value *result;
8185 *pos -= 1;
8186 result = evaluate_subexp_standard (expect_type, exp, pos, noside);
8187 /* The result type will have code OP_STRING, bashed there from
8188 OP_ARRAY. Bash it back. */
df407dfe
AC
8189 if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
8190 TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
76a01679 8191 return result;
4c4b4cd2 8192 }
14f9c5c9
AS
8193
8194 case UNOP_CAST:
8195 (*pos) += 2;
8196 type = exp->elts[pc + 1].type;
8197 arg1 = evaluate_subexp (type, exp, pos, noside);
8198 if (noside == EVAL_SKIP)
4c4b4cd2 8199 goto nosideret;
6e48bd2c 8200 arg1 = ada_value_cast (type, arg1, noside);
14f9c5c9
AS
8201 return arg1;
8202
4c4b4cd2
PH
8203 case UNOP_QUAL:
8204 (*pos) += 2;
8205 type = exp->elts[pc + 1].type;
8206 return ada_evaluate_subexp (type, exp, pos, noside);
8207
14f9c5c9
AS
8208 case BINOP_ASSIGN:
8209 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
52ce6436
PH
8210 if (exp->elts[*pos].opcode == OP_AGGREGATE)
8211 {
8212 arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
8213 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
8214 return arg1;
8215 return ada_value_assign (arg1, arg1);
8216 }
df407dfe 8217 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
14f9c5c9 8218 if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
4c4b4cd2 8219 return arg1;
df407dfe
AC
8220 if (ada_is_fixed_point_type (value_type (arg1)))
8221 arg2 = cast_to_fixed (value_type (arg1), arg2);
8222 else if (ada_is_fixed_point_type (value_type (arg2)))
76a01679 8223 error
323e0a4a 8224 (_("Fixed-point values must be assigned to fixed-point variables"));
d2e4a39e 8225 else
df407dfe 8226 arg2 = coerce_for_assign (value_type (arg1), arg2);
4c4b4cd2 8227 return ada_value_assign (arg1, arg2);
14f9c5c9
AS
8228
8229 case BINOP_ADD:
8230 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
8231 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
8232 if (noside == EVAL_SKIP)
4c4b4cd2 8233 goto nosideret;
df407dfe
AC
8234 if ((ada_is_fixed_point_type (value_type (arg1))
8235 || ada_is_fixed_point_type (value_type (arg2)))
8236 && value_type (arg1) != value_type (arg2))
323e0a4a 8237 error (_("Operands of fixed-point addition must have the same type"));
b7789565
JB
8238 /* Do the addition, and cast the result to the type of the first
8239 argument. We cannot cast the result to a reference type, so if
8240 ARG1 is a reference type, find its underlying type. */
8241 type = value_type (arg1);
8242 while (TYPE_CODE (type) == TYPE_CODE_REF)
8243 type = TYPE_TARGET_TYPE (type);
8244 return value_cast (type, value_add (arg1, arg2));
14f9c5c9
AS
8245
8246 case BINOP_SUB:
8247 arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
8248 arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
8249 if (noside == EVAL_SKIP)
4c4b4cd2 8250 goto nosideret;
df407dfe
AC
8251 if ((ada_is_fixed_point_type (value_type (arg1))
8252 || ada_is_fixed_point_type (value_type (arg2)))
8253 && value_type (arg1) != value_type (arg2))
323e0a4a 8254 error (_("Operands of fixed-point subtraction must have the same type"));
b7789565
JB
8255 /* Do the substraction, and cast the result to the type of the first
8256 argument. We cannot cast the result to a reference type, so if
8257 ARG1 is a reference type, find its underlying type. */
8258 type = value_type (arg1);
8259 while (TYPE_CODE (type) == TYPE_CODE_REF)
8260 type = TYPE_TARGET_TYPE (type);
8261 return value_cast (type, value_sub (arg1, arg2));
14f9c5c9
AS
8262
8263 case BINOP_MUL:
8264 case BINOP_DIV:
8265 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8266 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8267 if (noside == EVAL_SKIP)
4c4b4cd2
PH
8268 goto nosideret;
8269 else if (noside == EVAL_AVOID_SIDE_EFFECTS
76a01679 8270 && (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD))
df407dfe 8271 return value_zero (value_type (arg1), not_lval);
14f9c5c9 8272 else
4c4b4cd2 8273 {
df407dfe 8274 if (ada_is_fixed_point_type (value_type (arg1)))
4c4b4cd2 8275 arg1 = cast_from_fixed_to_double (arg1);
df407dfe 8276 if (ada_is_fixed_point_type (value_type (arg2)))
4c4b4cd2
PH
8277 arg2 = cast_from_fixed_to_double (arg2);
8278 return ada_value_binop (arg1, arg2, op);
8279 }
8280
8281 case BINOP_REM:
8282 case BINOP_MOD:
8283 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8284 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8285 if (noside == EVAL_SKIP)
76a01679 8286 goto nosideret;
4c4b4cd2 8287 else if (noside == EVAL_AVOID_SIDE_EFFECTS
76a01679 8288 && (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD))
df407dfe 8289 return value_zero (value_type (arg1), not_lval);
14f9c5c9 8290 else
76a01679 8291 return ada_value_binop (arg1, arg2, op);
14f9c5c9 8292
4c4b4cd2
PH
8293 case BINOP_EQUAL:
8294 case BINOP_NOTEQUAL:
14f9c5c9 8295 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
df407dfe 8296 arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
14f9c5c9 8297 if (noside == EVAL_SKIP)
76a01679 8298 goto nosideret;
4c4b4cd2 8299 if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 8300 tem = 0;
4c4b4cd2 8301 else
76a01679 8302 tem = ada_value_equal (arg1, arg2);
4c4b4cd2 8303 if (op == BINOP_NOTEQUAL)
76a01679 8304 tem = !tem;
4c4b4cd2
PH
8305 return value_from_longest (LA_BOOL_TYPE, (LONGEST) tem);
8306
8307 case UNOP_NEG:
8308 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8309 if (noside == EVAL_SKIP)
8310 goto nosideret;
df407dfe
AC
8311 else if (ada_is_fixed_point_type (value_type (arg1)))
8312 return value_cast (value_type (arg1), value_neg (arg1));
14f9c5c9 8313 else
4c4b4cd2
PH
8314 return value_neg (arg1);
8315
2330c6c6
JB
8316 case BINOP_LOGICAL_AND:
8317 case BINOP_LOGICAL_OR:
8318 case UNOP_LOGICAL_NOT:
000d5124
JB
8319 {
8320 struct value *val;
8321
8322 *pos -= 1;
8323 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
8324 return value_cast (LA_BOOL_TYPE, val);
8325 }
2330c6c6
JB
8326
8327 case BINOP_BITWISE_AND:
8328 case BINOP_BITWISE_IOR:
8329 case BINOP_BITWISE_XOR:
000d5124
JB
8330 {
8331 struct value *val;
8332
8333 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
8334 *pos = pc;
8335 val = evaluate_subexp_standard (expect_type, exp, pos, noside);
8336
8337 return value_cast (value_type (arg1), val);
8338 }
2330c6c6 8339
14f9c5c9
AS
8340 case OP_VAR_VALUE:
8341 *pos -= 1;
8342 if (noside == EVAL_SKIP)
4c4b4cd2
PH
8343 {
8344 *pos += 4;
8345 goto nosideret;
8346 }
8347 else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
76a01679
JB
8348 /* Only encountered when an unresolved symbol occurs in a
8349 context other than a function call, in which case, it is
52ce6436 8350 invalid. */
323e0a4a 8351 error (_("Unexpected unresolved symbol, %s, during evaluation"),
4c4b4cd2 8352 SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
14f9c5c9 8353 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
4c4b4cd2
PH
8354 {
8355 *pos += 4;
8356 return value_zero
8357 (to_static_fixed_type
8358 (static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
8359 not_lval);
8360 }
d2e4a39e 8361 else
4c4b4cd2
PH
8362 {
8363 arg1 =
8364 unwrap_value (evaluate_subexp_standard
8365 (expect_type, exp, pos, noside));
8366 return ada_to_fixed_value (arg1);
8367 }
8368
8369 case OP_FUNCALL:
8370 (*pos) += 2;
8371
8372 /* Allocate arg vector, including space for the function to be
8373 called in argvec[0] and a terminating NULL. */
8374 nargs = longest_to_int (exp->elts[pc + 1].longconst);
8375 argvec =
8376 (struct value **) alloca (sizeof (struct value *) * (nargs + 2));
8377
8378 if (exp->elts[*pos].opcode == OP_VAR_VALUE
76a01679 8379 && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
323e0a4a 8380 error (_("Unexpected unresolved symbol, %s, during evaluation"),
4c4b4cd2
PH
8381 SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
8382 else
8383 {
8384 for (tem = 0; tem <= nargs; tem += 1)
8385 argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8386 argvec[tem] = 0;
8387
8388 if (noside == EVAL_SKIP)
8389 goto nosideret;
8390 }
8391
df407dfe 8392 if (ada_is_packed_array_type (desc_base_type (value_type (argvec[0]))))
4c4b4cd2 8393 argvec[0] = ada_coerce_to_simple_array (argvec[0]);
df407dfe
AC
8394 else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
8395 || (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
76a01679 8396 && VALUE_LVAL (argvec[0]) == lval_memory))
4c4b4cd2
PH
8397 argvec[0] = value_addr (argvec[0]);
8398
df407dfe 8399 type = ada_check_typedef (value_type (argvec[0]));
4c4b4cd2
PH
8400 if (TYPE_CODE (type) == TYPE_CODE_PTR)
8401 {
61ee279c 8402 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
4c4b4cd2
PH
8403 {
8404 case TYPE_CODE_FUNC:
61ee279c 8405 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
4c4b4cd2
PH
8406 break;
8407 case TYPE_CODE_ARRAY:
8408 break;
8409 case TYPE_CODE_STRUCT:
8410 if (noside != EVAL_AVOID_SIDE_EFFECTS)
8411 argvec[0] = ada_value_ind (argvec[0]);
61ee279c 8412 type = ada_check_typedef (TYPE_TARGET_TYPE (type));
4c4b4cd2
PH
8413 break;
8414 default:
323e0a4a 8415 error (_("cannot subscript or call something of type `%s'"),
df407dfe 8416 ada_type_name (value_type (argvec[0])));
4c4b4cd2
PH
8417 break;
8418 }
8419 }
8420
8421 switch (TYPE_CODE (type))
8422 {
8423 case TYPE_CODE_FUNC:
8424 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8425 return allocate_value (TYPE_TARGET_TYPE (type));
8426 return call_function_by_hand (argvec[0], nargs, argvec + 1);
8427 case TYPE_CODE_STRUCT:
8428 {
8429 int arity;
8430
4c4b4cd2
PH
8431 arity = ada_array_arity (type);
8432 type = ada_array_element_type (type, nargs);
8433 if (type == NULL)
323e0a4a 8434 error (_("cannot subscript or call a record"));
4c4b4cd2 8435 if (arity != nargs)
323e0a4a 8436 error (_("wrong number of subscripts; expecting %d"), arity);
4c4b4cd2 8437 if (noside == EVAL_AVOID_SIDE_EFFECTS)
0a07e705 8438 return value_zero (ada_aligned_type (type), lval_memory);
4c4b4cd2
PH
8439 return
8440 unwrap_value (ada_value_subscript
8441 (argvec[0], nargs, argvec + 1));
8442 }
8443 case TYPE_CODE_ARRAY:
8444 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8445 {
8446 type = ada_array_element_type (type, nargs);
8447 if (type == NULL)
323e0a4a 8448 error (_("element type of array unknown"));
4c4b4cd2 8449 else
0a07e705 8450 return value_zero (ada_aligned_type (type), lval_memory);
4c4b4cd2
PH
8451 }
8452 return
8453 unwrap_value (ada_value_subscript
8454 (ada_coerce_to_simple_array (argvec[0]),
8455 nargs, argvec + 1));
8456 case TYPE_CODE_PTR: /* Pointer to array */
8457 type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
8458 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8459 {
8460 type = ada_array_element_type (type, nargs);
8461 if (type == NULL)
323e0a4a 8462 error (_("element type of array unknown"));
4c4b4cd2 8463 else
0a07e705 8464 return value_zero (ada_aligned_type (type), lval_memory);
4c4b4cd2
PH
8465 }
8466 return
8467 unwrap_value (ada_value_ptr_subscript (argvec[0], type,
8468 nargs, argvec + 1));
8469
8470 default:
e1d5a0d2
PH
8471 error (_("Attempt to index or call something other than an "
8472 "array or function"));
4c4b4cd2
PH
8473 }
8474
8475 case TERNOP_SLICE:
8476 {
8477 struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8478 struct value *low_bound_val =
8479 evaluate_subexp (NULL_TYPE, exp, pos, noside);
714e53ab
PH
8480 struct value *high_bound_val =
8481 evaluate_subexp (NULL_TYPE, exp, pos, noside);
8482 LONGEST low_bound;
8483 LONGEST high_bound;
994b9211
AC
8484 low_bound_val = coerce_ref (low_bound_val);
8485 high_bound_val = coerce_ref (high_bound_val);
714e53ab
PH
8486 low_bound = pos_atr (low_bound_val);
8487 high_bound = pos_atr (high_bound_val);
963a6417 8488
4c4b4cd2
PH
8489 if (noside == EVAL_SKIP)
8490 goto nosideret;
8491
4c4b4cd2
PH
8492 /* If this is a reference to an aligner type, then remove all
8493 the aligners. */
df407dfe
AC
8494 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
8495 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
8496 TYPE_TARGET_TYPE (value_type (array)) =
8497 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
4c4b4cd2 8498
df407dfe 8499 if (ada_is_packed_array_type (value_type (array)))
323e0a4a 8500 error (_("cannot slice a packed array"));
4c4b4cd2
PH
8501
8502 /* If this is a reference to an array or an array lvalue,
8503 convert to a pointer. */
df407dfe
AC
8504 if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
8505 || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
4c4b4cd2
PH
8506 && VALUE_LVAL (array) == lval_memory))
8507 array = value_addr (array);
8508
1265e4aa 8509 if (noside == EVAL_AVOID_SIDE_EFFECTS
61ee279c 8510 && ada_is_array_descriptor_type (ada_check_typedef
df407dfe 8511 (value_type (array))))
0b5d8877 8512 return empty_array (ada_type_of_array (array, 0), low_bound);
4c4b4cd2
PH
8513
8514 array = ada_coerce_to_simple_array_ptr (array);
8515
714e53ab
PH
8516 /* If we have more than one level of pointer indirection,
8517 dereference the value until we get only one level. */
df407dfe
AC
8518 while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
8519 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
714e53ab
PH
8520 == TYPE_CODE_PTR))
8521 array = value_ind (array);
8522
8523 /* Make sure we really do have an array type before going further,
8524 to avoid a SEGV when trying to get the index type or the target
8525 type later down the road if the debug info generated by
8526 the compiler is incorrect or incomplete. */
df407dfe 8527 if (!ada_is_simple_array_type (value_type (array)))
323e0a4a 8528 error (_("cannot take slice of non-array"));
714e53ab 8529
df407dfe 8530 if (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR)
4c4b4cd2 8531 {
0b5d8877 8532 if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
df407dfe 8533 return empty_array (TYPE_TARGET_TYPE (value_type (array)),
4c4b4cd2
PH
8534 low_bound);
8535 else
8536 {
8537 struct type *arr_type0 =
df407dfe 8538 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array)),
4c4b4cd2 8539 NULL, 1);
0b5d8877 8540 return ada_value_slice_ptr (array, arr_type0,
529cad9c
PH
8541 longest_to_int (low_bound),
8542 longest_to_int (high_bound));
4c4b4cd2
PH
8543 }
8544 }
8545 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
8546 return array;
8547 else if (high_bound < low_bound)
df407dfe 8548 return empty_array (value_type (array), low_bound);
4c4b4cd2 8549 else
529cad9c
PH
8550 return ada_value_slice (array, longest_to_int (low_bound),
8551 longest_to_int (high_bound));
4c4b4cd2 8552 }
14f9c5c9 8553
4c4b4cd2
PH
8554 case UNOP_IN_RANGE:
8555 (*pos) += 2;
8556 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8557 type = exp->elts[pc + 1].type;
14f9c5c9 8558
14f9c5c9 8559 if (noside == EVAL_SKIP)
4c4b4cd2 8560 goto nosideret;
14f9c5c9 8561
4c4b4cd2
PH
8562 switch (TYPE_CODE (type))
8563 {
8564 default:
e1d5a0d2
PH
8565 lim_warning (_("Membership test incompletely implemented; "
8566 "always returns true"));
4c4b4cd2
PH
8567 return value_from_longest (builtin_type_int, (LONGEST) 1);
8568
8569 case TYPE_CODE_RANGE:
76a01679 8570 arg2 = value_from_longest (builtin_type_int, TYPE_LOW_BOUND (type));
4c4b4cd2
PH
8571 arg3 = value_from_longest (builtin_type_int,
8572 TYPE_HIGH_BOUND (type));
8573 return
8574 value_from_longest (builtin_type_int,
8575 (value_less (arg1, arg3)
8576 || value_equal (arg1, arg3))
8577 && (value_less (arg2, arg1)
8578 || value_equal (arg2, arg1)));
8579 }
8580
8581 case BINOP_IN_BOUNDS:
14f9c5c9 8582 (*pos) += 2;
4c4b4cd2
PH
8583 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8584 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
14f9c5c9 8585
4c4b4cd2
PH
8586 if (noside == EVAL_SKIP)
8587 goto nosideret;
14f9c5c9 8588
4c4b4cd2
PH
8589 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8590 return value_zero (builtin_type_int, not_lval);
14f9c5c9 8591
4c4b4cd2 8592 tem = longest_to_int (exp->elts[pc + 1].longconst);
14f9c5c9 8593
df407dfe 8594 if (tem < 1 || tem > ada_array_arity (value_type (arg2)))
323e0a4a 8595 error (_("invalid dimension number to 'range"));
14f9c5c9 8596
4c4b4cd2
PH
8597 arg3 = ada_array_bound (arg2, tem, 1);
8598 arg2 = ada_array_bound (arg2, tem, 0);
d2e4a39e 8599
4c4b4cd2
PH
8600 return
8601 value_from_longest (builtin_type_int,
8602 (value_less (arg1, arg3)
8603 || value_equal (arg1, arg3))
8604 && (value_less (arg2, arg1)
8605 || value_equal (arg2, arg1)));
8606
8607 case TERNOP_IN_RANGE:
8608 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8609 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8610 arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8611
8612 if (noside == EVAL_SKIP)
8613 goto nosideret;
8614
8615 return
8616 value_from_longest (builtin_type_int,
8617 (value_less (arg1, arg3)
8618 || value_equal (arg1, arg3))
8619 && (value_less (arg2, arg1)
8620 || value_equal (arg2, arg1)));
8621
8622 case OP_ATR_FIRST:
8623 case OP_ATR_LAST:
8624 case OP_ATR_LENGTH:
8625 {
76a01679
JB
8626 struct type *type_arg;
8627 if (exp->elts[*pos].opcode == OP_TYPE)
8628 {
8629 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
8630 arg1 = NULL;
8631 type_arg = exp->elts[pc + 2].type;
8632 }
8633 else
8634 {
8635 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8636 type_arg = NULL;
8637 }
8638
8639 if (exp->elts[*pos].opcode != OP_LONG)
323e0a4a 8640 error (_("Invalid operand to '%s"), ada_attribute_name (op));
76a01679
JB
8641 tem = longest_to_int (exp->elts[*pos + 2].longconst);
8642 *pos += 4;
8643
8644 if (noside == EVAL_SKIP)
8645 goto nosideret;
8646
8647 if (type_arg == NULL)
8648 {
8649 arg1 = ada_coerce_ref (arg1);
8650
df407dfe 8651 if (ada_is_packed_array_type (value_type (arg1)))
76a01679
JB
8652 arg1 = ada_coerce_to_simple_array (arg1);
8653
df407dfe 8654 if (tem < 1 || tem > ada_array_arity (value_type (arg1)))
323e0a4a 8655 error (_("invalid dimension number to '%s"),
76a01679
JB
8656 ada_attribute_name (op));
8657
8658 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8659 {
df407dfe 8660 type = ada_index_type (value_type (arg1), tem);
76a01679
JB
8661 if (type == NULL)
8662 error
323e0a4a 8663 (_("attempt to take bound of something that is not an array"));
76a01679
JB
8664 return allocate_value (type);
8665 }
8666
8667 switch (op)
8668 {
8669 default: /* Should never happen. */
323e0a4a 8670 error (_("unexpected attribute encountered"));
76a01679
JB
8671 case OP_ATR_FIRST:
8672 return ada_array_bound (arg1, tem, 0);
8673 case OP_ATR_LAST:
8674 return ada_array_bound (arg1, tem, 1);
8675 case OP_ATR_LENGTH:
8676 return ada_array_length (arg1, tem);
8677 }
8678 }
8679 else if (discrete_type_p (type_arg))
8680 {
8681 struct type *range_type;
8682 char *name = ada_type_name (type_arg);
8683 range_type = NULL;
8684 if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
8685 range_type =
8686 to_fixed_range_type (name, NULL, TYPE_OBJFILE (type_arg));
8687 if (range_type == NULL)
8688 range_type = type_arg;
8689 switch (op)
8690 {
8691 default:
323e0a4a 8692 error (_("unexpected attribute encountered"));
76a01679
JB
8693 case OP_ATR_FIRST:
8694 return discrete_type_low_bound (range_type);
8695 case OP_ATR_LAST:
8696 return discrete_type_high_bound (range_type);
8697 case OP_ATR_LENGTH:
323e0a4a 8698 error (_("the 'length attribute applies only to array types"));
76a01679
JB
8699 }
8700 }
8701 else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
323e0a4a 8702 error (_("unimplemented type attribute"));
76a01679
JB
8703 else
8704 {
8705 LONGEST low, high;
8706
8707 if (ada_is_packed_array_type (type_arg))
8708 type_arg = decode_packed_array_type (type_arg);
8709
8710 if (tem < 1 || tem > ada_array_arity (type_arg))
323e0a4a 8711 error (_("invalid dimension number to '%s"),
76a01679
JB
8712 ada_attribute_name (op));
8713
8714 type = ada_index_type (type_arg, tem);
8715 if (type == NULL)
8716 error
323e0a4a 8717 (_("attempt to take bound of something that is not an array"));
76a01679
JB
8718 if (noside == EVAL_AVOID_SIDE_EFFECTS)
8719 return allocate_value (type);
8720
8721 switch (op)
8722 {
8723 default:
323e0a4a 8724 error (_("unexpected attribute encountered"));
76a01679
JB
8725 case OP_ATR_FIRST:
8726 low = ada_array_bound_from_type (type_arg, tem, 0, &type);
8727 return value_from_longest (type, low);
8728 case OP_ATR_LAST:
8729 high = ada_array_bound_from_type (type_arg, tem, 1, &type);
8730 return value_from_longest (type, high);
8731 case OP_ATR_LENGTH:
8732 low = ada_array_bound_from_type (type_arg, tem, 0, &type);
8733 high = ada_array_bound_from_type (type_arg, tem, 1, NULL);
8734 return value_from_longest (type, high - low + 1);
8735 }
8736 }
14f9c5c9
AS
8737 }
8738
4c4b4cd2
PH
8739 case OP_ATR_TAG:
8740 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8741 if (noside == EVAL_SKIP)
76a01679 8742 goto nosideret;
4c4b4cd2
PH
8743
8744 if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 8745 return value_zero (ada_tag_type (arg1), not_lval);
4c4b4cd2
PH
8746
8747 return ada_value_tag (arg1);
8748
8749 case OP_ATR_MIN:
8750 case OP_ATR_MAX:
8751 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
14f9c5c9
AS
8752 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8753 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8754 if (noside == EVAL_SKIP)
76a01679 8755 goto nosideret;
d2e4a39e 8756 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
df407dfe 8757 return value_zero (value_type (arg1), not_lval);
14f9c5c9 8758 else
76a01679
JB
8759 return value_binop (arg1, arg2,
8760 op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
14f9c5c9 8761
4c4b4cd2
PH
8762 case OP_ATR_MODULUS:
8763 {
76a01679
JB
8764 struct type *type_arg = exp->elts[pc + 2].type;
8765 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
4c4b4cd2 8766
76a01679
JB
8767 if (noside == EVAL_SKIP)
8768 goto nosideret;
4c4b4cd2 8769
76a01679 8770 if (!ada_is_modular_type (type_arg))
323e0a4a 8771 error (_("'modulus must be applied to modular type"));
4c4b4cd2 8772
76a01679
JB
8773 return value_from_longest (TYPE_TARGET_TYPE (type_arg),
8774 ada_modulus (type_arg));
4c4b4cd2
PH
8775 }
8776
8777
8778 case OP_ATR_POS:
8779 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
14f9c5c9
AS
8780 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8781 if (noside == EVAL_SKIP)
76a01679 8782 goto nosideret;
4c4b4cd2 8783 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
72d5681a 8784 return value_zero (builtin_type_int, not_lval);
14f9c5c9 8785 else
76a01679 8786 return value_pos_atr (arg1);
14f9c5c9 8787
4c4b4cd2
PH
8788 case OP_ATR_SIZE:
8789 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8790 if (noside == EVAL_SKIP)
76a01679 8791 goto nosideret;
4c4b4cd2 8792 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
72d5681a 8793 return value_zero (builtin_type_int, not_lval);
4c4b4cd2 8794 else
72d5681a 8795 return value_from_longest (builtin_type_int,
76a01679 8796 TARGET_CHAR_BIT
df407dfe 8797 * TYPE_LENGTH (value_type (arg1)));
4c4b4cd2
PH
8798
8799 case OP_ATR_VAL:
8800 evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
14f9c5c9 8801 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
4c4b4cd2 8802 type = exp->elts[pc + 2].type;
14f9c5c9 8803 if (noside == EVAL_SKIP)
76a01679 8804 goto nosideret;
4c4b4cd2 8805 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 8806 return value_zero (type, not_lval);
4c4b4cd2 8807 else
76a01679 8808 return value_val_atr (type, arg1);
4c4b4cd2
PH
8809
8810 case BINOP_EXP:
8811 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8812 arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8813 if (noside == EVAL_SKIP)
8814 goto nosideret;
8815 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
df407dfe 8816 return value_zero (value_type (arg1), not_lval);
4c4b4cd2
PH
8817 else
8818 return value_binop (arg1, arg2, op);
8819
8820 case UNOP_PLUS:
8821 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8822 if (noside == EVAL_SKIP)
8823 goto nosideret;
8824 else
8825 return arg1;
8826
8827 case UNOP_ABS:
8828 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8829 if (noside == EVAL_SKIP)
8830 goto nosideret;
df407dfe 8831 if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
4c4b4cd2 8832 return value_neg (arg1);
14f9c5c9 8833 else
4c4b4cd2 8834 return arg1;
14f9c5c9
AS
8835
8836 case UNOP_IND:
8837 if (expect_type && TYPE_CODE (expect_type) == TYPE_CODE_PTR)
61ee279c 8838 expect_type = TYPE_TARGET_TYPE (ada_check_typedef (expect_type));
14f9c5c9
AS
8839 arg1 = evaluate_subexp (expect_type, exp, pos, noside);
8840 if (noside == EVAL_SKIP)
4c4b4cd2 8841 goto nosideret;
df407dfe 8842 type = ada_check_typedef (value_type (arg1));
14f9c5c9 8843 if (noside == EVAL_AVOID_SIDE_EFFECTS)
4c4b4cd2
PH
8844 {
8845 if (ada_is_array_descriptor_type (type))
8846 /* GDB allows dereferencing GNAT array descriptors. */
8847 {
8848 struct type *arrType = ada_type_of_array (arg1, 0);
8849 if (arrType == NULL)
323e0a4a 8850 error (_("Attempt to dereference null array pointer."));
00a4c844 8851 return value_at_lazy (arrType, 0);
4c4b4cd2
PH
8852 }
8853 else if (TYPE_CODE (type) == TYPE_CODE_PTR
8854 || TYPE_CODE (type) == TYPE_CODE_REF
8855 /* In C you can dereference an array to get the 1st elt. */
8856 || TYPE_CODE (type) == TYPE_CODE_ARRAY)
714e53ab
PH
8857 {
8858 type = to_static_fixed_type
8859 (ada_aligned_type
8860 (ada_check_typedef (TYPE_TARGET_TYPE (type))));
8861 check_size (type);
8862 return value_zero (type, lval_memory);
8863 }
4c4b4cd2
PH
8864 else if (TYPE_CODE (type) == TYPE_CODE_INT)
8865 /* GDB allows dereferencing an int. */
8866 return value_zero (builtin_type_int, lval_memory);
8867 else
323e0a4a 8868 error (_("Attempt to take contents of a non-pointer value."));
4c4b4cd2 8869 }
76a01679 8870 arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
df407dfe 8871 type = ada_check_typedef (value_type (arg1));
d2e4a39e 8872
4c4b4cd2
PH
8873 if (ada_is_array_descriptor_type (type))
8874 /* GDB allows dereferencing GNAT array descriptors. */
8875 return ada_coerce_to_simple_array (arg1);
14f9c5c9 8876 else
4c4b4cd2 8877 return ada_value_ind (arg1);
14f9c5c9
AS
8878
8879 case STRUCTOP_STRUCT:
8880 tem = longest_to_int (exp->elts[pc + 1].longconst);
8881 (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
8882 arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
8883 if (noside == EVAL_SKIP)
4c4b4cd2 8884 goto nosideret;
14f9c5c9 8885 if (noside == EVAL_AVOID_SIDE_EFFECTS)
76a01679 8886 {
df407dfe 8887 struct type *type1 = value_type (arg1);
76a01679
JB
8888 if (ada_is_tagged_type (type1, 1))
8889 {
8890 type = ada_lookup_struct_elt_type (type1,
8891 &exp->elts[pc + 2].string,
8892 1, 1, NULL);
8893 if (type == NULL)
8894 /* In this case, we assume that the field COULD exist
8895 in some extension of the type. Return an object of
8896 "type" void, which will match any formal
8897 (see ada_type_match). */
8898 return value_zero (builtin_type_void, lval_memory);
8899 }
8900 else
8901 type =
8902 ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
8903 0, NULL);
8904
8905 return value_zero (ada_aligned_type (type), lval_memory);
8906 }
14f9c5c9 8907 else
76a01679
JB
8908 return
8909 ada_to_fixed_value (unwrap_value
8910 (ada_value_struct_elt
03ee6b2e 8911 (arg1, &exp->elts[pc + 2].string, 0)));
14f9c5c9 8912 case OP_TYPE:
4c4b4cd2
PH
8913 /* The value is not supposed to be used. This is here to make it
8914 easier to accommodate expressions that contain types. */
14f9c5c9
AS
8915 (*pos) += 2;
8916 if (noside == EVAL_SKIP)
4c4b4cd2 8917 goto nosideret;
14f9c5c9 8918 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
a6cfbe68 8919 return allocate_value (exp->elts[pc + 1].type);
14f9c5c9 8920 else
323e0a4a 8921 error (_("Attempt to use a type name as an expression"));
52ce6436
PH
8922
8923 case OP_AGGREGATE:
8924 case OP_CHOICES:
8925 case OP_OTHERS:
8926 case OP_DISCRETE_RANGE:
8927 case OP_POSITIONAL:
8928 case OP_NAME:
8929 if (noside == EVAL_NORMAL)
8930 switch (op)
8931 {
8932 case OP_NAME:
8933 error (_("Undefined name, ambiguous name, or renaming used in "
e1d5a0d2 8934 "component association: %s."), &exp->elts[pc+2].string);
52ce6436
PH
8935 case OP_AGGREGATE:
8936 error (_("Aggregates only allowed on the right of an assignment"));
8937 default:
e1d5a0d2 8938 internal_error (__FILE__, __LINE__, _("aggregate apparently mangled"));
52ce6436
PH
8939 }
8940
8941 ada_forward_operator_length (exp, pc, &oplen, &nargs);
8942 *pos += oplen - 1;
8943 for (tem = 0; tem < nargs; tem += 1)
8944 ada_evaluate_subexp (NULL, exp, pos, noside);
8945 goto nosideret;
14f9c5c9
AS
8946 }
8947
8948nosideret:
8949 return value_from_longest (builtin_type_long, (LONGEST) 1);
8950}
14f9c5c9 8951\f
d2e4a39e 8952
4c4b4cd2 8953 /* Fixed point */
14f9c5c9
AS
8954
8955/* If TYPE encodes an Ada fixed-point type, return the suffix of the
8956 type name that encodes the 'small and 'delta information.
4c4b4cd2 8957 Otherwise, return NULL. */
14f9c5c9 8958
d2e4a39e 8959static const char *
ebf56fd3 8960fixed_type_info (struct type *type)
14f9c5c9 8961{
d2e4a39e 8962 const char *name = ada_type_name (type);
14f9c5c9
AS
8963 enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
8964
d2e4a39e
AS
8965 if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
8966 {
14f9c5c9
AS
8967 const char *tail = strstr (name, "___XF_");
8968 if (tail == NULL)
4c4b4cd2 8969 return NULL;
d2e4a39e 8970 else
4c4b4cd2 8971 return tail + 5;
14f9c5c9
AS
8972 }
8973 else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
8974 return fixed_type_info (TYPE_TARGET_TYPE (type));
8975 else
8976 return NULL;
8977}
8978
4c4b4cd2 8979/* Returns non-zero iff TYPE represents an Ada fixed-point type. */
14f9c5c9
AS
8980
8981int
ebf56fd3 8982ada_is_fixed_point_type (struct type *type)
14f9c5c9
AS
8983{
8984 return fixed_type_info (type) != NULL;
8985}
8986
4c4b4cd2
PH
8987/* Return non-zero iff TYPE represents a System.Address type. */
8988
8989int
8990ada_is_system_address_type (struct type *type)
8991{
8992 return (TYPE_NAME (type)
8993 && strcmp (TYPE_NAME (type), "system__address") == 0);
8994}
8995
14f9c5c9
AS
8996/* Assuming that TYPE is the representation of an Ada fixed-point
8997 type, return its delta, or -1 if the type is malformed and the
4c4b4cd2 8998 delta cannot be determined. */
14f9c5c9
AS
8999
9000DOUBLEST
ebf56fd3 9001ada_delta (struct type *type)
14f9c5c9
AS
9002{
9003 const char *encoding = fixed_type_info (type);
9004 long num, den;
9005
9006 if (sscanf (encoding, "_%ld_%ld", &num, &den) < 2)
9007 return -1.0;
d2e4a39e 9008 else
14f9c5c9
AS
9009 return (DOUBLEST) num / (DOUBLEST) den;
9010}
9011
9012/* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
4c4b4cd2 9013 factor ('SMALL value) associated with the type. */
14f9c5c9
AS
9014
9015static DOUBLEST
ebf56fd3 9016scaling_factor (struct type *type)
14f9c5c9
AS
9017{
9018 const char *encoding = fixed_type_info (type);
9019 unsigned long num0, den0, num1, den1;
9020 int n;
d2e4a39e 9021
14f9c5c9
AS
9022 n = sscanf (encoding, "_%lu_%lu_%lu_%lu", &num0, &den0, &num1, &den1);
9023
9024 if (n < 2)
9025 return 1.0;
9026 else if (n == 4)
9027 return (DOUBLEST) num1 / (DOUBLEST) den1;
d2e4a39e 9028 else
14f9c5c9
AS
9029 return (DOUBLEST) num0 / (DOUBLEST) den0;
9030}
9031
9032
9033/* Assuming that X is the representation of a value of fixed-point
4c4b4cd2 9034 type TYPE, return its floating-point equivalent. */
14f9c5c9
AS
9035
9036DOUBLEST
ebf56fd3 9037ada_fixed_to_float (struct type *type, LONGEST x)
14f9c5c9 9038{
d2e4a39e 9039 return (DOUBLEST) x *scaling_factor (type);
14f9c5c9
AS
9040}
9041
4c4b4cd2
PH
9042/* The representation of a fixed-point value of type TYPE
9043 corresponding to the value X. */
14f9c5c9
AS
9044
9045LONGEST
ebf56fd3 9046ada_float_to_fixed (struct type *type, DOUBLEST x)
14f9c5c9
AS
9047{
9048 return (LONGEST) (x / scaling_factor (type) + 0.5);
9049}
9050
9051
4c4b4cd2 9052 /* VAX floating formats */
14f9c5c9
AS
9053
9054/* Non-zero iff TYPE represents one of the special VAX floating-point
4c4b4cd2
PH
9055 types. */
9056
14f9c5c9 9057int
d2e4a39e 9058ada_is_vax_floating_type (struct type *type)
14f9c5c9 9059{
d2e4a39e 9060 int name_len =
14f9c5c9 9061 (ada_type_name (type) == NULL) ? 0 : strlen (ada_type_name (type));
d2e4a39e 9062 return
14f9c5c9 9063 name_len > 6
d2e4a39e 9064 && (TYPE_CODE (type) == TYPE_CODE_INT
4c4b4cd2
PH
9065 || TYPE_CODE (type) == TYPE_CODE_RANGE)
9066 && strncmp (ada_type_name (type) + name_len - 6, "___XF", 5) == 0;
14f9c5c9
AS
9067}
9068
9069/* The type of special VAX floating-point type this is, assuming
4c4b4cd2
PH
9070 ada_is_vax_floating_point. */
9071
14f9c5c9 9072int
d2e4a39e 9073ada_vax_float_type_suffix (struct type *type)
14f9c5c9 9074{
d2e4a39e 9075 return ada_type_name (type)[strlen (ada_type_name (type)) - 1];
14f9c5c9
AS
9076}
9077
4c4b4cd2 9078/* A value representing the special debugging function that outputs
14f9c5c9 9079 VAX floating-point values of the type represented by TYPE. Assumes
4c4b4cd2
PH
9080 ada_is_vax_floating_type (TYPE). */
9081
d2e4a39e
AS
9082struct value *
9083ada_vax_float_print_function (struct type *type)
9084{
9085 switch (ada_vax_float_type_suffix (type))
9086 {
9087 case 'F':
9088 return get_var_value ("DEBUG_STRING_F", 0);
9089 case 'D':
9090 return get_var_value ("DEBUG_STRING_D", 0);
9091 case 'G':
9092 return get_var_value ("DEBUG_STRING_G", 0);
9093 default:
323e0a4a 9094 error (_("invalid VAX floating-point type"));
d2e4a39e 9095 }
14f9c5c9 9096}
14f9c5c9 9097\f
d2e4a39e 9098
4c4b4cd2 9099 /* Range types */
14f9c5c9
AS
9100
9101/* Scan STR beginning at position K for a discriminant name, and
9102 return the value of that discriminant field of DVAL in *PX. If
9103 PNEW_K is not null, put the position of the character beyond the
9104 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
4c4b4cd2 9105 not alter *PX and *PNEW_K if unsuccessful. */
14f9c5c9
AS
9106
9107static int
07d8f827 9108scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
76a01679 9109 int *pnew_k)
14f9c5c9
AS
9110{
9111 static char *bound_buffer = NULL;
9112 static size_t bound_buffer_len = 0;
9113 char *bound;
9114 char *pend;
d2e4a39e 9115 struct value *bound_val;
14f9c5c9
AS
9116
9117 if (dval == NULL || str == NULL || str[k] == '\0')
9118 return 0;
9119
d2e4a39e 9120 pend = strstr (str + k, "__");
14f9c5c9
AS
9121 if (pend == NULL)
9122 {
d2e4a39e 9123 bound = str + k;
14f9c5c9
AS
9124 k += strlen (bound);
9125 }
d2e4a39e 9126 else
14f9c5c9 9127 {
d2e4a39e 9128 GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
14f9c5c9 9129 bound = bound_buffer;
d2e4a39e
AS
9130 strncpy (bound_buffer, str + k, pend - (str + k));
9131 bound[pend - (str + k)] = '\0';
9132 k = pend - str;
14f9c5c9 9133 }
d2e4a39e 9134
df407dfe 9135 bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
14f9c5c9
AS
9136 if (bound_val == NULL)
9137 return 0;
9138
9139 *px = value_as_long (bound_val);
9140 if (pnew_k != NULL)
9141 *pnew_k = k;
9142 return 1;
9143}
9144
9145/* Value of variable named NAME in the current environment. If
9146 no such variable found, then if ERR_MSG is null, returns 0, and
4c4b4cd2
PH
9147 otherwise causes an error with message ERR_MSG. */
9148
d2e4a39e
AS
9149static struct value *
9150get_var_value (char *name, char *err_msg)
14f9c5c9 9151{
4c4b4cd2 9152 struct ada_symbol_info *syms;
14f9c5c9
AS
9153 int nsyms;
9154
4c4b4cd2
PH
9155 nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
9156 &syms);
14f9c5c9
AS
9157
9158 if (nsyms != 1)
9159 {
9160 if (err_msg == NULL)
4c4b4cd2 9161 return 0;
14f9c5c9 9162 else
8a3fe4f8 9163 error (("%s"), err_msg);
14f9c5c9
AS
9164 }
9165
4c4b4cd2 9166 return value_of_variable (syms[0].sym, syms[0].block);
14f9c5c9 9167}
d2e4a39e 9168
14f9c5c9 9169/* Value of integer variable named NAME in the current environment. If
4c4b4cd2
PH
9170 no such variable found, returns 0, and sets *FLAG to 0. If
9171 successful, sets *FLAG to 1. */
9172
14f9c5c9 9173LONGEST
4c4b4cd2 9174get_int_var_value (char *name, int *flag)
14f9c5c9 9175{
4c4b4cd2 9176 struct value *var_val = get_var_value (name, 0);
d2e4a39e 9177
14f9c5c9
AS
9178 if (var_val == 0)
9179 {
9180 if (flag != NULL)
4c4b4cd2 9181 *flag = 0;
14f9c5c9
AS
9182 return 0;
9183 }
9184 else
9185 {
9186 if (flag != NULL)
4c4b4cd2 9187 *flag = 1;
14f9c5c9
AS
9188 return value_as_long (var_val);
9189 }
9190}
d2e4a39e 9191
14f9c5c9
AS
9192
9193/* Return a range type whose base type is that of the range type named
9194 NAME in the current environment, and whose bounds are calculated
4c4b4cd2 9195 from NAME according to the GNAT range encoding conventions.
14f9c5c9
AS
9196 Extract discriminant values, if needed, from DVAL. If a new type
9197 must be created, allocate in OBJFILE's space. The bounds
9198 information, in general, is encoded in NAME, the base type given in
4c4b4cd2 9199 the named range type. */
14f9c5c9 9200
d2e4a39e 9201static struct type *
ebf56fd3 9202to_fixed_range_type (char *name, struct value *dval, struct objfile *objfile)
14f9c5c9
AS
9203{
9204 struct type *raw_type = ada_find_any_type (name);
9205 struct type *base_type;
d2e4a39e 9206 char *subtype_info;
14f9c5c9
AS
9207
9208 if (raw_type == NULL)
9209 base_type = builtin_type_int;
9210 else if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
9211 base_type = TYPE_TARGET_TYPE (raw_type);
9212 else
9213 base_type = raw_type;
9214
9215 subtype_info = strstr (name, "___XD");
9216 if (subtype_info == NULL)
9217 return raw_type;
9218 else
9219 {
9220 static char *name_buf = NULL;
9221 static size_t name_len = 0;
9222 int prefix_len = subtype_info - name;
9223 LONGEST L, U;
9224 struct type *type;
9225 char *bounds_str;
9226 int n;
9227
9228 GROW_VECT (name_buf, name_len, prefix_len + 5);
9229 strncpy (name_buf, name, prefix_len);
9230 name_buf[prefix_len] = '\0';
9231
9232 subtype_info += 5;
9233 bounds_str = strchr (subtype_info, '_');
9234 n = 1;
9235
d2e4a39e 9236 if (*subtype_info == 'L')
4c4b4cd2
PH
9237 {
9238 if (!ada_scan_number (bounds_str, n, &L, &n)
9239 && !scan_discrim_bound (bounds_str, n, dval, &L, &n))
9240 return raw_type;
9241 if (bounds_str[n] == '_')
9242 n += 2;
9243 else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
9244 n += 1;
9245 subtype_info += 1;
9246 }
d2e4a39e 9247 else
4c4b4cd2
PH
9248 {
9249 int ok;
9250 strcpy (name_buf + prefix_len, "___L");
9251 L = get_int_var_value (name_buf, &ok);
9252 if (!ok)
9253 {
323e0a4a 9254 lim_warning (_("Unknown lower bound, using 1."));
4c4b4cd2
PH
9255 L = 1;
9256 }
9257 }
14f9c5c9 9258
d2e4a39e 9259 if (*subtype_info == 'U')
4c4b4cd2
PH
9260 {
9261 if (!ada_scan_number (bounds_str, n, &U, &n)
9262 && !scan_discrim_bound (bounds_str, n, dval, &U, &n))
9263 return raw_type;
9264 }
d2e4a39e 9265 else
4c4b4cd2
PH
9266 {
9267 int ok;
9268 strcpy (name_buf + prefix_len, "___U");
9269 U = get_int_var_value (name_buf, &ok);
9270 if (!ok)
9271 {
323e0a4a 9272 lim_warning (_("Unknown upper bound, using %ld."), (long) L);
4c4b4cd2
PH
9273 U = L;
9274 }
9275 }
14f9c5c9 9276
d2e4a39e 9277 if (objfile == NULL)
4c4b4cd2 9278 objfile = TYPE_OBJFILE (base_type);
14f9c5c9 9279 type = create_range_type (alloc_type (objfile), base_type, L, U);
d2e4a39e 9280 TYPE_NAME (type) = name;
14f9c5c9
AS
9281 return type;
9282 }
9283}
9284
4c4b4cd2
PH
9285/* True iff NAME is the name of a range type. */
9286
14f9c5c9 9287int
d2e4a39e 9288ada_is_range_type_name (const char *name)
14f9c5c9
AS
9289{
9290 return (name != NULL && strstr (name, "___XD"));
d2e4a39e 9291}
14f9c5c9 9292\f
d2e4a39e 9293
4c4b4cd2
PH
9294 /* Modular types */
9295
9296/* True iff TYPE is an Ada modular type. */
14f9c5c9 9297
14f9c5c9 9298int
d2e4a39e 9299ada_is_modular_type (struct type *type)
14f9c5c9 9300{
4c4b4cd2 9301 struct type *subranged_type = base_type (type);
14f9c5c9
AS
9302
9303 return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
4c4b4cd2
PH
9304 && TYPE_CODE (subranged_type) != TYPE_CODE_ENUM
9305 && TYPE_UNSIGNED (subranged_type));
14f9c5c9
AS
9306}
9307
4c4b4cd2
PH
9308/* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9309
61ee279c 9310ULONGEST
d2e4a39e 9311ada_modulus (struct type * type)
14f9c5c9 9312{
61ee279c 9313 return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
14f9c5c9 9314}
d2e4a39e 9315\f
f7f9143b
JB
9316
9317/* Ada exception catchpoint support:
9318 ---------------------------------
9319
9320 We support 3 kinds of exception catchpoints:
9321 . catchpoints on Ada exceptions
9322 . catchpoints on unhandled Ada exceptions
9323 . catchpoints on failed assertions
9324
9325 Exceptions raised during failed assertions, or unhandled exceptions
9326 could perfectly be caught with the general catchpoint on Ada exceptions.
9327 However, we can easily differentiate these two special cases, and having
9328 the option to distinguish these two cases from the rest can be useful
9329 to zero-in on certain situations.
9330
9331 Exception catchpoints are a specialized form of breakpoint,
9332 since they rely on inserting breakpoints inside known routines
9333 of the GNAT runtime. The implementation therefore uses a standard
9334 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9335 of breakpoint_ops.
9336
0259addd
JB
9337 Support in the runtime for exception catchpoints have been changed
9338 a few times already, and these changes affect the implementation
9339 of these catchpoints. In order to be able to support several
9340 variants of the runtime, we use a sniffer that will determine
9341 the runtime variant used by the program being debugged.
9342
f7f9143b
JB
9343 At this time, we do not support the use of conditions on Ada exception
9344 catchpoints. The COND and COND_STRING fields are therefore set
9345 to NULL (most of the time, see below).
9346
9347 Conditions where EXP_STRING, COND, and COND_STRING are used:
9348
9349 When a user specifies the name of a specific exception in the case
9350 of catchpoints on Ada exceptions, we store the name of that exception
9351 in the EXP_STRING. We then translate this request into an actual
9352 condition stored in COND_STRING, and then parse it into an expression
9353 stored in COND. */
9354
9355/* The different types of catchpoints that we introduced for catching
9356 Ada exceptions. */
9357
9358enum exception_catchpoint_kind
9359{
9360 ex_catch_exception,
9361 ex_catch_exception_unhandled,
9362 ex_catch_assert
9363};
9364
0259addd
JB
9365typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
9366
9367/* A structure that describes how to support exception catchpoints
9368 for a given executable. */
9369
9370struct exception_support_info
9371{
9372 /* The name of the symbol to break on in order to insert
9373 a catchpoint on exceptions. */
9374 const char *catch_exception_sym;
9375
9376 /* The name of the symbol to break on in order to insert
9377 a catchpoint on unhandled exceptions. */
9378 const char *catch_exception_unhandled_sym;
9379
9380 /* The name of the symbol to break on in order to insert
9381 a catchpoint on failed assertions. */
9382 const char *catch_assert_sym;
9383
9384 /* Assuming that the inferior just triggered an unhandled exception
9385 catchpoint, this function is responsible for returning the address
9386 in inferior memory where the name of that exception is stored.
9387 Return zero if the address could not be computed. */
9388 ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
9389};
9390
9391static CORE_ADDR ada_unhandled_exception_name_addr (void);
9392static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
9393
9394/* The following exception support info structure describes how to
9395 implement exception catchpoints with the latest version of the
9396 Ada runtime (as of 2007-03-06). */
9397
9398static const struct exception_support_info default_exception_support_info =
9399{
9400 "__gnat_debug_raise_exception", /* catch_exception_sym */
9401 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9402 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9403 ada_unhandled_exception_name_addr
9404};
9405
9406/* The following exception support info structure describes how to
9407 implement exception catchpoints with a slightly older version
9408 of the Ada runtime. */
9409
9410static const struct exception_support_info exception_support_info_fallback =
9411{
9412 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9413 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9414 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9415 ada_unhandled_exception_name_addr_from_raise
9416};
9417
9418/* For each executable, we sniff which exception info structure to use
9419 and cache it in the following global variable. */
9420
9421static const struct exception_support_info *exception_info = NULL;
9422
9423/* Inspect the Ada runtime and determine which exception info structure
9424 should be used to provide support for exception catchpoints.
9425
9426 This function will always set exception_info, or raise an error. */
9427
9428static void
9429ada_exception_support_info_sniffer (void)
9430{
9431 struct symbol *sym;
9432
9433 /* If the exception info is already known, then no need to recompute it. */
9434 if (exception_info != NULL)
9435 return;
9436
9437 /* Check the latest (default) exception support info. */
9438 sym = standard_lookup (default_exception_support_info.catch_exception_sym,
9439 NULL, VAR_DOMAIN);
9440 if (sym != NULL)
9441 {
9442 exception_info = &default_exception_support_info;
9443 return;
9444 }
9445
9446 /* Try our fallback exception suport info. */
9447 sym = standard_lookup (exception_support_info_fallback.catch_exception_sym,
9448 NULL, VAR_DOMAIN);
9449 if (sym != NULL)
9450 {
9451 exception_info = &exception_support_info_fallback;
9452 return;
9453 }
9454
9455 /* Sometimes, it is normal for us to not be able to find the routine
9456 we are looking for. This happens when the program is linked with
9457 the shared version of the GNAT runtime, and the program has not been
9458 started yet. Inform the user of these two possible causes if
9459 applicable. */
9460
9461 if (ada_update_initial_language (language_unknown, NULL) != language_ada)
9462 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9463
9464 /* If the symbol does not exist, then check that the program is
9465 already started, to make sure that shared libraries have been
9466 loaded. If it is not started, this may mean that the symbol is
9467 in a shared library. */
9468
9469 if (ptid_get_pid (inferior_ptid) == 0)
9470 error (_("Unable to insert catchpoint. Try to start the program first."));
9471
9472 /* At this point, we know that we are debugging an Ada program and
9473 that the inferior has been started, but we still are not able to
9474 find the run-time symbols. That can mean that we are in
9475 configurable run time mode, or that a-except as been optimized
9476 out by the linker... In any case, at this point it is not worth
9477 supporting this feature. */
9478
9479 error (_("Cannot insert catchpoints in this configuration."));
9480}
9481
9482/* An observer of "executable_changed" events.
9483 Its role is to clear certain cached values that need to be recomputed
9484 each time a new executable is loaded by GDB. */
9485
9486static void
9487ada_executable_changed_observer (void *unused)
9488{
9489 /* If the executable changed, then it is possible that the Ada runtime
9490 is different. So we need to invalidate the exception support info
9491 cache. */
9492 exception_info = NULL;
9493}
9494
f7f9143b
JB
9495/* Return the name of the function at PC, NULL if could not find it.
9496 This function only checks the debugging information, not the symbol
9497 table. */
9498
9499static char *
9500function_name_from_pc (CORE_ADDR pc)
9501{
9502 char *func_name;
9503
9504 if (!find_pc_partial_function (pc, &func_name, NULL, NULL))
9505 return NULL;
9506
9507 return func_name;
9508}
9509
9510/* True iff FRAME is very likely to be that of a function that is
9511 part of the runtime system. This is all very heuristic, but is
9512 intended to be used as advice as to what frames are uninteresting
9513 to most users. */
9514
9515static int
9516is_known_support_routine (struct frame_info *frame)
9517{
4ed6b5be 9518 struct symtab_and_line sal;
f7f9143b
JB
9519 char *func_name;
9520 int i;
f7f9143b 9521
4ed6b5be
JB
9522 /* If this code does not have any debugging information (no symtab),
9523 This cannot be any user code. */
f7f9143b 9524
4ed6b5be 9525 find_frame_sal (frame, &sal);
f7f9143b
JB
9526 if (sal.symtab == NULL)
9527 return 1;
9528
4ed6b5be
JB
9529 /* If there is a symtab, but the associated source file cannot be
9530 located, then assume this is not user code: Selecting a frame
9531 for which we cannot display the code would not be very helpful
9532 for the user. This should also take care of case such as VxWorks
9533 where the kernel has some debugging info provided for a few units. */
f7f9143b 9534
9bbc9174 9535 if (symtab_to_fullname (sal.symtab) == NULL)
f7f9143b
JB
9536 return 1;
9537
4ed6b5be
JB
9538 /* Check the unit filename againt the Ada runtime file naming.
9539 We also check the name of the objfile against the name of some
9540 known system libraries that sometimes come with debugging info
9541 too. */
9542
f7f9143b
JB
9543 for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
9544 {
9545 re_comp (known_runtime_file_name_patterns[i]);
9546 if (re_exec (sal.symtab->filename))
9547 return 1;
4ed6b5be
JB
9548 if (sal.symtab->objfile != NULL
9549 && re_exec (sal.symtab->objfile->name))
9550 return 1;
f7f9143b
JB
9551 }
9552
4ed6b5be 9553 /* Check whether the function is a GNAT-generated entity. */
f7f9143b 9554
4ed6b5be 9555 func_name = function_name_from_pc (get_frame_address_in_block (frame));
f7f9143b
JB
9556 if (func_name == NULL)
9557 return 1;
9558
9559 for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
9560 {
9561 re_comp (known_auxiliary_function_name_patterns[i]);
9562 if (re_exec (func_name))
9563 return 1;
9564 }
9565
9566 return 0;
9567}
9568
9569/* Find the first frame that contains debugging information and that is not
9570 part of the Ada run-time, starting from FI and moving upward. */
9571
9572static void
9573ada_find_printable_frame (struct frame_info *fi)
9574{
9575 for (; fi != NULL; fi = get_prev_frame (fi))
9576 {
9577 if (!is_known_support_routine (fi))
9578 {
9579 select_frame (fi);
9580 break;
9581 }
9582 }
9583
9584}
9585
9586/* Assuming that the inferior just triggered an unhandled exception
9587 catchpoint, return the address in inferior memory where the name
9588 of the exception is stored.
9589
9590 Return zero if the address could not be computed. */
9591
9592static CORE_ADDR
9593ada_unhandled_exception_name_addr (void)
0259addd
JB
9594{
9595 return parse_and_eval_address ("e.full_name");
9596}
9597
9598/* Same as ada_unhandled_exception_name_addr, except that this function
9599 should be used when the inferior uses an older version of the runtime,
9600 where the exception name needs to be extracted from a specific frame
9601 several frames up in the callstack. */
9602
9603static CORE_ADDR
9604ada_unhandled_exception_name_addr_from_raise (void)
f7f9143b
JB
9605{
9606 int frame_level;
9607 struct frame_info *fi;
9608
9609 /* To determine the name of this exception, we need to select
9610 the frame corresponding to RAISE_SYM_NAME. This frame is
9611 at least 3 levels up, so we simply skip the first 3 frames
9612 without checking the name of their associated function. */
9613 fi = get_current_frame ();
9614 for (frame_level = 0; frame_level < 3; frame_level += 1)
9615 if (fi != NULL)
9616 fi = get_prev_frame (fi);
9617
9618 while (fi != NULL)
9619 {
9620 const char *func_name =
9621 function_name_from_pc (get_frame_address_in_block (fi));
9622 if (func_name != NULL
0259addd 9623 && strcmp (func_name, exception_info->catch_exception_sym) == 0)
f7f9143b
JB
9624 break; /* We found the frame we were looking for... */
9625 fi = get_prev_frame (fi);
9626 }
9627
9628 if (fi == NULL)
9629 return 0;
9630
9631 select_frame (fi);
9632 return parse_and_eval_address ("id.full_name");
9633}
9634
9635/* Assuming the inferior just triggered an Ada exception catchpoint
9636 (of any type), return the address in inferior memory where the name
9637 of the exception is stored, if applicable.
9638
9639 Return zero if the address could not be computed, or if not relevant. */
9640
9641static CORE_ADDR
9642ada_exception_name_addr_1 (enum exception_catchpoint_kind ex,
9643 struct breakpoint *b)
9644{
9645 switch (ex)
9646 {
9647 case ex_catch_exception:
9648 return (parse_and_eval_address ("e.full_name"));
9649 break;
9650
9651 case ex_catch_exception_unhandled:
0259addd 9652 return exception_info->unhandled_exception_name_addr ();
f7f9143b
JB
9653 break;
9654
9655 case ex_catch_assert:
9656 return 0; /* Exception name is not relevant in this case. */
9657 break;
9658
9659 default:
9660 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
9661 break;
9662 }
9663
9664 return 0; /* Should never be reached. */
9665}
9666
9667/* Same as ada_exception_name_addr_1, except that it intercepts and contains
9668 any error that ada_exception_name_addr_1 might cause to be thrown.
9669 When an error is intercepted, a warning with the error message is printed,
9670 and zero is returned. */
9671
9672static CORE_ADDR
9673ada_exception_name_addr (enum exception_catchpoint_kind ex,
9674 struct breakpoint *b)
9675{
9676 struct gdb_exception e;
9677 CORE_ADDR result = 0;
9678
9679 TRY_CATCH (e, RETURN_MASK_ERROR)
9680 {
9681 result = ada_exception_name_addr_1 (ex, b);
9682 }
9683
9684 if (e.reason < 0)
9685 {
9686 warning (_("failed to get exception name: %s"), e.message);
9687 return 0;
9688 }
9689
9690 return result;
9691}
9692
9693/* Implement the PRINT_IT method in the breakpoint_ops structure
9694 for all exception catchpoint kinds. */
9695
9696static enum print_stop_action
9697print_it_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
9698{
9699 const CORE_ADDR addr = ada_exception_name_addr (ex, b);
9700 char exception_name[256];
9701
9702 if (addr != 0)
9703 {
9704 read_memory (addr, exception_name, sizeof (exception_name) - 1);
9705 exception_name [sizeof (exception_name) - 1] = '\0';
9706 }
9707
9708 ada_find_printable_frame (get_current_frame ());
9709
9710 annotate_catchpoint (b->number);
9711 switch (ex)
9712 {
9713 case ex_catch_exception:
9714 if (addr != 0)
9715 printf_filtered (_("\nCatchpoint %d, %s at "),
9716 b->number, exception_name);
9717 else
9718 printf_filtered (_("\nCatchpoint %d, exception at "), b->number);
9719 break;
9720 case ex_catch_exception_unhandled:
9721 if (addr != 0)
9722 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
9723 b->number, exception_name);
9724 else
9725 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
9726 b->number);
9727 break;
9728 case ex_catch_assert:
9729 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
9730 b->number);
9731 break;
9732 }
9733
9734 return PRINT_SRC_AND_LOC;
9735}
9736
9737/* Implement the PRINT_ONE method in the breakpoint_ops structure
9738 for all exception catchpoint kinds. */
9739
9740static void
9741print_one_exception (enum exception_catchpoint_kind ex,
9742 struct breakpoint *b, CORE_ADDR *last_addr)
9743{
9744 if (addressprint)
9745 {
9746 annotate_field (4);
9747 ui_out_field_core_addr (uiout, "addr", b->loc->address);
9748 }
9749
9750 annotate_field (5);
9751 *last_addr = b->loc->address;
9752 switch (ex)
9753 {
9754 case ex_catch_exception:
9755 if (b->exp_string != NULL)
9756 {
9757 char *msg = xstrprintf (_("`%s' Ada exception"), b->exp_string);
9758
9759 ui_out_field_string (uiout, "what", msg);
9760 xfree (msg);
9761 }
9762 else
9763 ui_out_field_string (uiout, "what", "all Ada exceptions");
9764
9765 break;
9766
9767 case ex_catch_exception_unhandled:
9768 ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
9769 break;
9770
9771 case ex_catch_assert:
9772 ui_out_field_string (uiout, "what", "failed Ada assertions");
9773 break;
9774
9775 default:
9776 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
9777 break;
9778 }
9779}
9780
9781/* Implement the PRINT_MENTION method in the breakpoint_ops structure
9782 for all exception catchpoint kinds. */
9783
9784static void
9785print_mention_exception (enum exception_catchpoint_kind ex,
9786 struct breakpoint *b)
9787{
9788 switch (ex)
9789 {
9790 case ex_catch_exception:
9791 if (b->exp_string != NULL)
9792 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
9793 b->number, b->exp_string);
9794 else
9795 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b->number);
9796
9797 break;
9798
9799 case ex_catch_exception_unhandled:
9800 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
9801 b->number);
9802 break;
9803
9804 case ex_catch_assert:
9805 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b->number);
9806 break;
9807
9808 default:
9809 internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
9810 break;
9811 }
9812}
9813
9814/* Virtual table for "catch exception" breakpoints. */
9815
9816static enum print_stop_action
9817print_it_catch_exception (struct breakpoint *b)
9818{
9819 return print_it_exception (ex_catch_exception, b);
9820}
9821
9822static void
9823print_one_catch_exception (struct breakpoint *b, CORE_ADDR *last_addr)
9824{
9825 print_one_exception (ex_catch_exception, b, last_addr);
9826}
9827
9828static void
9829print_mention_catch_exception (struct breakpoint *b)
9830{
9831 print_mention_exception (ex_catch_exception, b);
9832}
9833
9834static struct breakpoint_ops catch_exception_breakpoint_ops =
9835{
9836 print_it_catch_exception,
9837 print_one_catch_exception,
9838 print_mention_catch_exception
9839};
9840
9841/* Virtual table for "catch exception unhandled" breakpoints. */
9842
9843static enum print_stop_action
9844print_it_catch_exception_unhandled (struct breakpoint *b)
9845{
9846 return print_it_exception (ex_catch_exception_unhandled, b);
9847}
9848
9849static void
9850print_one_catch_exception_unhandled (struct breakpoint *b, CORE_ADDR *last_addr)
9851{
9852 print_one_exception (ex_catch_exception_unhandled, b, last_addr);
9853}
9854
9855static void
9856print_mention_catch_exception_unhandled (struct breakpoint *b)
9857{
9858 print_mention_exception (ex_catch_exception_unhandled, b);
9859}
9860
9861static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops = {
9862 print_it_catch_exception_unhandled,
9863 print_one_catch_exception_unhandled,
9864 print_mention_catch_exception_unhandled
9865};
9866
9867/* Virtual table for "catch assert" breakpoints. */
9868
9869static enum print_stop_action
9870print_it_catch_assert (struct breakpoint *b)
9871{
9872 return print_it_exception (ex_catch_assert, b);
9873}
9874
9875static void
9876print_one_catch_assert (struct breakpoint *b, CORE_ADDR *last_addr)
9877{
9878 print_one_exception (ex_catch_assert, b, last_addr);
9879}
9880
9881static void
9882print_mention_catch_assert (struct breakpoint *b)
9883{
9884 print_mention_exception (ex_catch_assert, b);
9885}
9886
9887static struct breakpoint_ops catch_assert_breakpoint_ops = {
9888 print_it_catch_assert,
9889 print_one_catch_assert,
9890 print_mention_catch_assert
9891};
9892
9893/* Return non-zero if B is an Ada exception catchpoint. */
9894
9895int
9896ada_exception_catchpoint_p (struct breakpoint *b)
9897{
9898 return (b->ops == &catch_exception_breakpoint_ops
9899 || b->ops == &catch_exception_unhandled_breakpoint_ops
9900 || b->ops == &catch_assert_breakpoint_ops);
9901}
9902
f7f9143b
JB
9903/* Return a newly allocated copy of the first space-separated token
9904 in ARGSP, and then adjust ARGSP to point immediately after that
9905 token.
9906
9907 Return NULL if ARGPS does not contain any more tokens. */
9908
9909static char *
9910ada_get_next_arg (char **argsp)
9911{
9912 char *args = *argsp;
9913 char *end;
9914 char *result;
9915
9916 /* Skip any leading white space. */
9917
9918 while (isspace (*args))
9919 args++;
9920
9921 if (args[0] == '\0')
9922 return NULL; /* No more arguments. */
9923
9924 /* Find the end of the current argument. */
9925
9926 end = args;
9927 while (*end != '\0' && !isspace (*end))
9928 end++;
9929
9930 /* Adjust ARGSP to point to the start of the next argument. */
9931
9932 *argsp = end;
9933
9934 /* Make a copy of the current argument and return it. */
9935
9936 result = xmalloc (end - args + 1);
9937 strncpy (result, args, end - args);
9938 result[end - args] = '\0';
9939
9940 return result;
9941}
9942
9943/* Split the arguments specified in a "catch exception" command.
9944 Set EX to the appropriate catchpoint type.
9945 Set EXP_STRING to the name of the specific exception if
9946 specified by the user. */
9947
9948static void
9949catch_ada_exception_command_split (char *args,
9950 enum exception_catchpoint_kind *ex,
9951 char **exp_string)
9952{
9953 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
9954 char *exception_name;
9955
9956 exception_name = ada_get_next_arg (&args);
9957 make_cleanup (xfree, exception_name);
9958
9959 /* Check that we do not have any more arguments. Anything else
9960 is unexpected. */
9961
9962 while (isspace (*args))
9963 args++;
9964
9965 if (args[0] != '\0')
9966 error (_("Junk at end of expression"));
9967
9968 discard_cleanups (old_chain);
9969
9970 if (exception_name == NULL)
9971 {
9972 /* Catch all exceptions. */
9973 *ex = ex_catch_exception;
9974 *exp_string = NULL;
9975 }
9976 else if (strcmp (exception_name, "unhandled") == 0)
9977 {
9978 /* Catch unhandled exceptions. */
9979 *ex = ex_catch_exception_unhandled;
9980 *exp_string = NULL;
9981 }
9982 else
9983 {
9984 /* Catch a specific exception. */
9985 *ex = ex_catch_exception;
9986 *exp_string = exception_name;
9987 }
9988}
9989
9990/* Return the name of the symbol on which we should break in order to
9991 implement a catchpoint of the EX kind. */
9992
9993static const char *
9994ada_exception_sym_name (enum exception_catchpoint_kind ex)
9995{
0259addd
JB
9996 gdb_assert (exception_info != NULL);
9997
f7f9143b
JB
9998 switch (ex)
9999 {
10000 case ex_catch_exception:
0259addd 10001 return (exception_info->catch_exception_sym);
f7f9143b
JB
10002 break;
10003 case ex_catch_exception_unhandled:
0259addd 10004 return (exception_info->catch_exception_unhandled_sym);
f7f9143b
JB
10005 break;
10006 case ex_catch_assert:
0259addd 10007 return (exception_info->catch_assert_sym);
f7f9143b
JB
10008 break;
10009 default:
10010 internal_error (__FILE__, __LINE__,
10011 _("unexpected catchpoint kind (%d)"), ex);
10012 }
10013}
10014
10015/* Return the breakpoint ops "virtual table" used for catchpoints
10016 of the EX kind. */
10017
10018static struct breakpoint_ops *
4b9eee8c 10019ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex)
f7f9143b
JB
10020{
10021 switch (ex)
10022 {
10023 case ex_catch_exception:
10024 return (&catch_exception_breakpoint_ops);
10025 break;
10026 case ex_catch_exception_unhandled:
10027 return (&catch_exception_unhandled_breakpoint_ops);
10028 break;
10029 case ex_catch_assert:
10030 return (&catch_assert_breakpoint_ops);
10031 break;
10032 default:
10033 internal_error (__FILE__, __LINE__,
10034 _("unexpected catchpoint kind (%d)"), ex);
10035 }
10036}
10037
10038/* Return the condition that will be used to match the current exception
10039 being raised with the exception that the user wants to catch. This
10040 assumes that this condition is used when the inferior just triggered
10041 an exception catchpoint.
10042
10043 The string returned is a newly allocated string that needs to be
10044 deallocated later. */
10045
10046static char *
10047ada_exception_catchpoint_cond_string (const char *exp_string)
10048{
10049 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string);
10050}
10051
10052/* Return the expression corresponding to COND_STRING evaluated at SAL. */
10053
10054static struct expression *
10055ada_parse_catchpoint_condition (char *cond_string,
10056 struct symtab_and_line sal)
10057{
10058 return (parse_exp_1 (&cond_string, block_for_pc (sal.pc), 0));
10059}
10060
10061/* Return the symtab_and_line that should be used to insert an exception
10062 catchpoint of the TYPE kind.
10063
10064 EX_STRING should contain the name of a specific exception
10065 that the catchpoint should catch, or NULL otherwise.
10066
10067 The idea behind all the remaining parameters is that their names match
10068 the name of certain fields in the breakpoint structure that are used to
10069 handle exception catchpoints. This function returns the value to which
10070 these fields should be set, depending on the type of catchpoint we need
10071 to create.
10072
10073 If COND and COND_STRING are both non-NULL, any value they might
10074 hold will be free'ed, and then replaced by newly allocated ones.
10075 These parameters are left untouched otherwise. */
10076
10077static struct symtab_and_line
10078ada_exception_sal (enum exception_catchpoint_kind ex, char *exp_string,
10079 char **addr_string, char **cond_string,
10080 struct expression **cond, struct breakpoint_ops **ops)
10081{
10082 const char *sym_name;
10083 struct symbol *sym;
10084 struct symtab_and_line sal;
10085
0259addd
JB
10086 /* First, find out which exception support info to use. */
10087 ada_exception_support_info_sniffer ();
10088
10089 /* Then lookup the function on which we will break in order to catch
f7f9143b
JB
10090 the Ada exceptions requested by the user. */
10091
10092 sym_name = ada_exception_sym_name (ex);
10093 sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
10094
10095 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10096 that should be compiled with debugging information. As a result, we
10097 expect to find that symbol in the symtabs. If we don't find it, then
10098 the target most likely does not support Ada exceptions, or we cannot
10099 insert exception breakpoints yet, because the GNAT runtime hasn't been
10100 loaded yet. */
10101
10102 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10103 in such a way that no debugging information is produced for the symbol
10104 we are looking for. In this case, we could search the minimal symbols
10105 as a fall-back mechanism. This would still be operating in degraded
10106 mode, however, as we would still be missing the debugging information
10107 that is needed in order to extract the name of the exception being
10108 raised (this name is printed in the catchpoint message, and is also
10109 used when trying to catch a specific exception). We do not handle
10110 this case for now. */
10111
10112 if (sym == NULL)
0259addd 10113 error (_("Unable to break on '%s' in this configuration."), sym_name);
f7f9143b
JB
10114
10115 /* Make sure that the symbol we found corresponds to a function. */
10116 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
10117 error (_("Symbol \"%s\" is not a function (class = %d)"),
10118 sym_name, SYMBOL_CLASS (sym));
10119
10120 sal = find_function_start_sal (sym, 1);
10121
10122 /* Set ADDR_STRING. */
10123
10124 *addr_string = xstrdup (sym_name);
10125
10126 /* Set the COND and COND_STRING (if not NULL). */
10127
10128 if (cond_string != NULL && cond != NULL)
10129 {
10130 if (*cond_string != NULL)
10131 {
10132 xfree (*cond_string);
10133 *cond_string = NULL;
10134 }
10135 if (*cond != NULL)
10136 {
10137 xfree (*cond);
10138 *cond = NULL;
10139 }
10140 if (exp_string != NULL)
10141 {
10142 *cond_string = ada_exception_catchpoint_cond_string (exp_string);
10143 *cond = ada_parse_catchpoint_condition (*cond_string, sal);
10144 }
10145 }
10146
10147 /* Set OPS. */
4b9eee8c 10148 *ops = ada_exception_breakpoint_ops (ex);
f7f9143b
JB
10149
10150 return sal;
10151}
10152
10153/* Parse the arguments (ARGS) of the "catch exception" command.
10154
10155 Set TYPE to the appropriate exception catchpoint type.
10156 If the user asked the catchpoint to catch only a specific
10157 exception, then save the exception name in ADDR_STRING.
10158
10159 See ada_exception_sal for a description of all the remaining
10160 function arguments of this function. */
10161
10162struct symtab_and_line
10163ada_decode_exception_location (char *args, char **addr_string,
10164 char **exp_string, char **cond_string,
10165 struct expression **cond,
10166 struct breakpoint_ops **ops)
10167{
10168 enum exception_catchpoint_kind ex;
10169
10170 catch_ada_exception_command_split (args, &ex, exp_string);
10171 return ada_exception_sal (ex, *exp_string, addr_string, cond_string,
10172 cond, ops);
10173}
10174
10175struct symtab_and_line
10176ada_decode_assert_location (char *args, char **addr_string,
10177 struct breakpoint_ops **ops)
10178{
10179 /* Check that no argument where provided at the end of the command. */
10180
10181 if (args != NULL)
10182 {
10183 while (isspace (*args))
10184 args++;
10185 if (*args != '\0')
10186 error (_("Junk at end of arguments."));
10187 }
10188
10189 return ada_exception_sal (ex_catch_assert, NULL, addr_string, NULL, NULL,
10190 ops);
10191}
10192
4c4b4cd2
PH
10193 /* Operators */
10194/* Information about operators given special treatment in functions
10195 below. */
10196/* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10197
10198#define ADA_OPERATORS \
10199 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10200 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10201 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10202 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10203 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10204 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10205 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10206 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10207 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10208 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10209 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10210 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10211 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10212 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10213 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
52ce6436
PH
10214 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10215 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10216 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10217 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
4c4b4cd2
PH
10218
10219static void
10220ada_operator_length (struct expression *exp, int pc, int *oplenp, int *argsp)
10221{
10222 switch (exp->elts[pc - 1].opcode)
10223 {
76a01679 10224 default:
4c4b4cd2
PH
10225 operator_length_standard (exp, pc, oplenp, argsp);
10226 break;
10227
10228#define OP_DEFN(op, len, args, binop) \
10229 case op: *oplenp = len; *argsp = args; break;
10230 ADA_OPERATORS;
10231#undef OP_DEFN
52ce6436
PH
10232
10233 case OP_AGGREGATE:
10234 *oplenp = 3;
10235 *argsp = longest_to_int (exp->elts[pc - 2].longconst);
10236 break;
10237
10238 case OP_CHOICES:
10239 *oplenp = 3;
10240 *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
10241 break;
4c4b4cd2
PH
10242 }
10243}
10244
10245static char *
10246ada_op_name (enum exp_opcode opcode)
10247{
10248 switch (opcode)
10249 {
76a01679 10250 default:
4c4b4cd2 10251 return op_name_standard (opcode);
52ce6436 10252
4c4b4cd2
PH
10253#define OP_DEFN(op, len, args, binop) case op: return #op;
10254 ADA_OPERATORS;
10255#undef OP_DEFN
52ce6436
PH
10256
10257 case OP_AGGREGATE:
10258 return "OP_AGGREGATE";
10259 case OP_CHOICES:
10260 return "OP_CHOICES";
10261 case OP_NAME:
10262 return "OP_NAME";
4c4b4cd2
PH
10263 }
10264}
10265
10266/* As for operator_length, but assumes PC is pointing at the first
10267 element of the operator, and gives meaningful results only for the
52ce6436 10268 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
4c4b4cd2
PH
10269
10270static void
76a01679
JB
10271ada_forward_operator_length (struct expression *exp, int pc,
10272 int *oplenp, int *argsp)
4c4b4cd2 10273{
76a01679 10274 switch (exp->elts[pc].opcode)
4c4b4cd2
PH
10275 {
10276 default:
10277 *oplenp = *argsp = 0;
10278 break;
52ce6436 10279
4c4b4cd2
PH
10280#define OP_DEFN(op, len, args, binop) \
10281 case op: *oplenp = len; *argsp = args; break;
10282 ADA_OPERATORS;
10283#undef OP_DEFN
52ce6436
PH
10284
10285 case OP_AGGREGATE:
10286 *oplenp = 3;
10287 *argsp = longest_to_int (exp->elts[pc + 1].longconst);
10288 break;
10289
10290 case OP_CHOICES:
10291 *oplenp = 3;
10292 *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
10293 break;
10294
10295 case OP_STRING:
10296 case OP_NAME:
10297 {
10298 int len = longest_to_int (exp->elts[pc + 1].longconst);
10299 *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
10300 *argsp = 0;
10301 break;
10302 }
4c4b4cd2
PH
10303 }
10304}
10305
10306static int
10307ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
10308{
10309 enum exp_opcode op = exp->elts[elt].opcode;
10310 int oplen, nargs;
10311 int pc = elt;
10312 int i;
76a01679 10313
4c4b4cd2
PH
10314 ada_forward_operator_length (exp, elt, &oplen, &nargs);
10315
76a01679 10316 switch (op)
4c4b4cd2 10317 {
76a01679 10318 /* Ada attributes ('Foo). */
4c4b4cd2
PH
10319 case OP_ATR_FIRST:
10320 case OP_ATR_LAST:
10321 case OP_ATR_LENGTH:
10322 case OP_ATR_IMAGE:
10323 case OP_ATR_MAX:
10324 case OP_ATR_MIN:
10325 case OP_ATR_MODULUS:
10326 case OP_ATR_POS:
10327 case OP_ATR_SIZE:
10328 case OP_ATR_TAG:
10329 case OP_ATR_VAL:
10330 break;
10331
10332 case UNOP_IN_RANGE:
10333 case UNOP_QUAL:
323e0a4a
AC
10334 /* XXX: gdb_sprint_host_address, type_sprint */
10335 fprintf_filtered (stream, _("Type @"));
4c4b4cd2
PH
10336 gdb_print_host_address (exp->elts[pc + 1].type, stream);
10337 fprintf_filtered (stream, " (");
10338 type_print (exp->elts[pc + 1].type, NULL, stream, 0);
10339 fprintf_filtered (stream, ")");
10340 break;
10341 case BINOP_IN_BOUNDS:
52ce6436
PH
10342 fprintf_filtered (stream, " (%d)",
10343 longest_to_int (exp->elts[pc + 2].longconst));
4c4b4cd2
PH
10344 break;
10345 case TERNOP_IN_RANGE:
10346 break;
10347
52ce6436
PH
10348 case OP_AGGREGATE:
10349 case OP_OTHERS:
10350 case OP_DISCRETE_RANGE:
10351 case OP_POSITIONAL:
10352 case OP_CHOICES:
10353 break;
10354
10355 case OP_NAME:
10356 case OP_STRING:
10357 {
10358 char *name = &exp->elts[elt + 2].string;
10359 int len = longest_to_int (exp->elts[elt + 1].longconst);
10360 fprintf_filtered (stream, "Text: `%.*s'", len, name);
10361 break;
10362 }
10363
4c4b4cd2
PH
10364 default:
10365 return dump_subexp_body_standard (exp, stream, elt);
10366 }
10367
10368 elt += oplen;
10369 for (i = 0; i < nargs; i += 1)
10370 elt = dump_subexp (exp, stream, elt);
10371
10372 return elt;
10373}
10374
10375/* The Ada extension of print_subexp (q.v.). */
10376
76a01679
JB
10377static void
10378ada_print_subexp (struct expression *exp, int *pos,
10379 struct ui_file *stream, enum precedence prec)
4c4b4cd2 10380{
52ce6436 10381 int oplen, nargs, i;
4c4b4cd2
PH
10382 int pc = *pos;
10383 enum exp_opcode op = exp->elts[pc].opcode;
10384
10385 ada_forward_operator_length (exp, pc, &oplen, &nargs);
10386
52ce6436 10387 *pos += oplen;
4c4b4cd2
PH
10388 switch (op)
10389 {
10390 default:
52ce6436 10391 *pos -= oplen;
4c4b4cd2
PH
10392 print_subexp_standard (exp, pos, stream, prec);
10393 return;
10394
10395 case OP_VAR_VALUE:
4c4b4cd2
PH
10396 fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
10397 return;
10398
10399 case BINOP_IN_BOUNDS:
323e0a4a 10400 /* XXX: sprint_subexp */
4c4b4cd2 10401 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 10402 fputs_filtered (" in ", stream);
4c4b4cd2 10403 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 10404 fputs_filtered ("'range", stream);
4c4b4cd2 10405 if (exp->elts[pc + 1].longconst > 1)
76a01679
JB
10406 fprintf_filtered (stream, "(%ld)",
10407 (long) exp->elts[pc + 1].longconst);
4c4b4cd2
PH
10408 return;
10409
10410 case TERNOP_IN_RANGE:
4c4b4cd2 10411 if (prec >= PREC_EQUAL)
76a01679 10412 fputs_filtered ("(", stream);
323e0a4a 10413 /* XXX: sprint_subexp */
4c4b4cd2 10414 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 10415 fputs_filtered (" in ", stream);
4c4b4cd2
PH
10416 print_subexp (exp, pos, stream, PREC_EQUAL);
10417 fputs_filtered (" .. ", stream);
10418 print_subexp (exp, pos, stream, PREC_EQUAL);
10419 if (prec >= PREC_EQUAL)
76a01679
JB
10420 fputs_filtered (")", stream);
10421 return;
4c4b4cd2
PH
10422
10423 case OP_ATR_FIRST:
10424 case OP_ATR_LAST:
10425 case OP_ATR_LENGTH:
10426 case OP_ATR_IMAGE:
10427 case OP_ATR_MAX:
10428 case OP_ATR_MIN:
10429 case OP_ATR_MODULUS:
10430 case OP_ATR_POS:
10431 case OP_ATR_SIZE:
10432 case OP_ATR_TAG:
10433 case OP_ATR_VAL:
4c4b4cd2 10434 if (exp->elts[*pos].opcode == OP_TYPE)
76a01679
JB
10435 {
10436 if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
10437 LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0);
10438 *pos += 3;
10439 }
4c4b4cd2 10440 else
76a01679 10441 print_subexp (exp, pos, stream, PREC_SUFFIX);
4c4b4cd2
PH
10442 fprintf_filtered (stream, "'%s", ada_attribute_name (op));
10443 if (nargs > 1)
76a01679
JB
10444 {
10445 int tem;
10446 for (tem = 1; tem < nargs; tem += 1)
10447 {
10448 fputs_filtered ((tem == 1) ? " (" : ", ", stream);
10449 print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
10450 }
10451 fputs_filtered (")", stream);
10452 }
4c4b4cd2 10453 return;
14f9c5c9 10454
4c4b4cd2 10455 case UNOP_QUAL:
4c4b4cd2
PH
10456 type_print (exp->elts[pc + 1].type, "", stream, 0);
10457 fputs_filtered ("'(", stream);
10458 print_subexp (exp, pos, stream, PREC_PREFIX);
10459 fputs_filtered (")", stream);
10460 return;
14f9c5c9 10461
4c4b4cd2 10462 case UNOP_IN_RANGE:
323e0a4a 10463 /* XXX: sprint_subexp */
4c4b4cd2 10464 print_subexp (exp, pos, stream, PREC_SUFFIX);
0b48a291 10465 fputs_filtered (" in ", stream);
4c4b4cd2
PH
10466 LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0);
10467 return;
52ce6436
PH
10468
10469 case OP_DISCRETE_RANGE:
10470 print_subexp (exp, pos, stream, PREC_SUFFIX);
10471 fputs_filtered ("..", stream);
10472 print_subexp (exp, pos, stream, PREC_SUFFIX);
10473 return;
10474
10475 case OP_OTHERS:
10476 fputs_filtered ("others => ", stream);
10477 print_subexp (exp, pos, stream, PREC_SUFFIX);
10478 return;
10479
10480 case OP_CHOICES:
10481 for (i = 0; i < nargs-1; i += 1)
10482 {
10483 if (i > 0)
10484 fputs_filtered ("|", stream);
10485 print_subexp (exp, pos, stream, PREC_SUFFIX);
10486 }
10487 fputs_filtered (" => ", stream);
10488 print_subexp (exp, pos, stream, PREC_SUFFIX);
10489 return;
10490
10491 case OP_POSITIONAL:
10492 print_subexp (exp, pos, stream, PREC_SUFFIX);
10493 return;
10494
10495 case OP_AGGREGATE:
10496 fputs_filtered ("(", stream);
10497 for (i = 0; i < nargs; i += 1)
10498 {
10499 if (i > 0)
10500 fputs_filtered (", ", stream);
10501 print_subexp (exp, pos, stream, PREC_SUFFIX);
10502 }
10503 fputs_filtered (")", stream);
10504 return;
4c4b4cd2
PH
10505 }
10506}
14f9c5c9
AS
10507
10508/* Table mapping opcodes into strings for printing operators
10509 and precedences of the operators. */
10510
d2e4a39e
AS
10511static const struct op_print ada_op_print_tab[] = {
10512 {":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
10513 {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
10514 {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
10515 {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
10516 {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
10517 {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
10518 {"=", BINOP_EQUAL, PREC_EQUAL, 0},
10519 {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
10520 {"<=", BINOP_LEQ, PREC_ORDER, 0},
10521 {">=", BINOP_GEQ, PREC_ORDER, 0},
10522 {">", BINOP_GTR, PREC_ORDER, 0},
10523 {"<", BINOP_LESS, PREC_ORDER, 0},
10524 {">>", BINOP_RSH, PREC_SHIFT, 0},
10525 {"<<", BINOP_LSH, PREC_SHIFT, 0},
10526 {"+", BINOP_ADD, PREC_ADD, 0},
10527 {"-", BINOP_SUB, PREC_ADD, 0},
10528 {"&", BINOP_CONCAT, PREC_ADD, 0},
10529 {"*", BINOP_MUL, PREC_MUL, 0},
10530 {"/", BINOP_DIV, PREC_MUL, 0},
10531 {"rem", BINOP_REM, PREC_MUL, 0},
10532 {"mod", BINOP_MOD, PREC_MUL, 0},
10533 {"**", BINOP_EXP, PREC_REPEAT, 0},
10534 {"@", BINOP_REPEAT, PREC_REPEAT, 0},
10535 {"-", UNOP_NEG, PREC_PREFIX, 0},
10536 {"+", UNOP_PLUS, PREC_PREFIX, 0},
10537 {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
10538 {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
10539 {"abs ", UNOP_ABS, PREC_PREFIX, 0},
4c4b4cd2
PH
10540 {".all", UNOP_IND, PREC_SUFFIX, 1},
10541 {"'access", UNOP_ADDR, PREC_SUFFIX, 1},
10542 {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
d2e4a39e 10543 {NULL, 0, 0, 0}
14f9c5c9
AS
10544};
10545\f
72d5681a
PH
10546enum ada_primitive_types {
10547 ada_primitive_type_int,
10548 ada_primitive_type_long,
10549 ada_primitive_type_short,
10550 ada_primitive_type_char,
10551 ada_primitive_type_float,
10552 ada_primitive_type_double,
10553 ada_primitive_type_void,
10554 ada_primitive_type_long_long,
10555 ada_primitive_type_long_double,
10556 ada_primitive_type_natural,
10557 ada_primitive_type_positive,
10558 ada_primitive_type_system_address,
10559 nr_ada_primitive_types
10560};
6c038f32
PH
10561
10562static void
d4a9a881 10563ada_language_arch_info (struct gdbarch *gdbarch,
72d5681a
PH
10564 struct language_arch_info *lai)
10565{
d4a9a881 10566 const struct builtin_type *builtin = builtin_type (gdbarch);
72d5681a 10567 lai->primitive_type_vector
d4a9a881 10568 = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
72d5681a
PH
10569 struct type *);
10570 lai->primitive_type_vector [ada_primitive_type_int] =
9a76efb6 10571 init_type (TYPE_CODE_INT,
d4a9a881 10572 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
9a76efb6 10573 0, "integer", (struct objfile *) NULL);
72d5681a 10574 lai->primitive_type_vector [ada_primitive_type_long] =
9a76efb6 10575 init_type (TYPE_CODE_INT,
d4a9a881 10576 gdbarch_long_bit (gdbarch) / TARGET_CHAR_BIT,
9a76efb6 10577 0, "long_integer", (struct objfile *) NULL);
72d5681a 10578 lai->primitive_type_vector [ada_primitive_type_short] =
9a76efb6 10579 init_type (TYPE_CODE_INT,
d4a9a881 10580 gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT,
9a76efb6 10581 0, "short_integer", (struct objfile *) NULL);
61ee279c
PH
10582 lai->string_char_type =
10583 lai->primitive_type_vector [ada_primitive_type_char] =
6c038f32
PH
10584 init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
10585 0, "character", (struct objfile *) NULL);
72d5681a 10586 lai->primitive_type_vector [ada_primitive_type_float] =
ea06eb3d 10587 init_type (TYPE_CODE_FLT,
d4a9a881 10588 gdbarch_float_bit (gdbarch)/ TARGET_CHAR_BIT,
6c038f32 10589 0, "float", (struct objfile *) NULL);
72d5681a 10590 lai->primitive_type_vector [ada_primitive_type_double] =
ea06eb3d 10591 init_type (TYPE_CODE_FLT,
d4a9a881 10592 gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
6c038f32 10593 0, "long_float", (struct objfile *) NULL);
72d5681a 10594 lai->primitive_type_vector [ada_primitive_type_long_long] =
9a76efb6 10595 init_type (TYPE_CODE_INT,
d4a9a881 10596 gdbarch_long_long_bit (gdbarch) / TARGET_CHAR_BIT,
6c038f32 10597 0, "long_long_integer", (struct objfile *) NULL);
72d5681a 10598 lai->primitive_type_vector [ada_primitive_type_long_double] =
ea06eb3d 10599 init_type (TYPE_CODE_FLT,
d4a9a881 10600 gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
6c038f32 10601 0, "long_long_float", (struct objfile *) NULL);
72d5681a 10602 lai->primitive_type_vector [ada_primitive_type_natural] =
9a76efb6 10603 init_type (TYPE_CODE_INT,
d4a9a881 10604 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
9a76efb6 10605 0, "natural", (struct objfile *) NULL);
72d5681a 10606 lai->primitive_type_vector [ada_primitive_type_positive] =
9a76efb6 10607 init_type (TYPE_CODE_INT,
d4a9a881 10608 gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
9a76efb6 10609 0, "positive", (struct objfile *) NULL);
72d5681a 10610 lai->primitive_type_vector [ada_primitive_type_void] = builtin->builtin_void;
6c038f32 10611
72d5681a 10612 lai->primitive_type_vector [ada_primitive_type_system_address] =
6c038f32
PH
10613 lookup_pointer_type (init_type (TYPE_CODE_VOID, 1, 0, "void",
10614 (struct objfile *) NULL));
72d5681a
PH
10615 TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
10616 = "system__address";
6c038f32 10617}
6c038f32
PH
10618\f
10619 /* Language vector */
10620
10621/* Not really used, but needed in the ada_language_defn. */
10622
10623static void
10624emit_char (int c, struct ui_file *stream, int quoter)
10625{
10626 ada_emit_char (c, stream, quoter, 1);
10627}
10628
10629static int
10630parse (void)
10631{
10632 warnings_issued = 0;
10633 return ada_parse ();
10634}
10635
10636static const struct exp_descriptor ada_exp_descriptor = {
10637 ada_print_subexp,
10638 ada_operator_length,
10639 ada_op_name,
10640 ada_dump_subexp_body,
10641 ada_evaluate_subexp
10642};
10643
10644const struct language_defn ada_language_defn = {
10645 "ada", /* Language name */
10646 language_ada,
6c038f32
PH
10647 range_check_off,
10648 type_check_off,
10649 case_sensitive_on, /* Yes, Ada is case-insensitive, but
10650 that's not quite what this means. */
6c038f32
PH
10651 array_row_major,
10652 &ada_exp_descriptor,
10653 parse,
10654 ada_error,
10655 resolve,
10656 ada_printchar, /* Print a character constant */
10657 ada_printstr, /* Function to print string constant */
10658 emit_char, /* Function to print single char (not used) */
6c038f32
PH
10659 ada_print_type, /* Print a type using appropriate syntax */
10660 ada_val_print, /* Print a value using appropriate syntax */
10661 ada_value_print, /* Print a top-level value */
10662 NULL, /* Language specific skip_trampoline */
10663 NULL, /* value_of_this */
10664 ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
10665 basic_lookup_transparent_type, /* lookup_transparent_type */
10666 ada_la_decode, /* Language specific symbol demangler */
10667 NULL, /* Language specific class_name_from_physname */
10668 ada_op_print_tab, /* expression operators for printing */
10669 0, /* c-style arrays */
10670 1, /* String lower bound */
6c038f32 10671 ada_get_gdb_completer_word_break_characters,
72d5681a 10672 ada_language_arch_info,
e79af960 10673 ada_print_array_index,
41f1b697 10674 default_pass_by_reference,
6c038f32
PH
10675 LANG_MAGIC
10676};
10677
d2e4a39e 10678void
6c038f32 10679_initialize_ada_language (void)
14f9c5c9 10680{
6c038f32
PH
10681 add_language (&ada_language_defn);
10682
10683 varsize_limit = 65536;
6c038f32
PH
10684
10685 obstack_init (&symbol_list_obstack);
10686
10687 decoded_names_store = htab_create_alloc
10688 (256, htab_hash_string, (int (*)(const void *, const void *)) streq,
10689 NULL, xcalloc, xfree);
6b69afc4
JB
10690
10691 observer_attach_executable_changed (ada_executable_changed_observer);
14f9c5c9 10692}