/* Ada language support routines for GDB, the GNU debugger. Copyright (C)
|
/* Ada language support routines for GDB, the GNU debugger. Copyright (C)
|
|
|
1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007
|
1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
|
|
This file is part of GDB.
|
This file is part of GDB.
|
|
|
This program is free software; you can redistribute it and/or modify
|
This program is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 3 of the License, or
|
the Free Software Foundation; either version 3 of the License, or
|
(at your option) any later version.
|
(at your option) any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
|
|
|
|
#include "defs.h"
|
#include "defs.h"
|
#include <stdio.h>
|
#include <stdio.h>
|
#include "gdb_string.h"
|
#include "gdb_string.h"
|
#include <ctype.h>
|
#include <ctype.h>
|
#include <stdarg.h>
|
#include <stdarg.h>
|
#include "demangle.h"
|
#include "demangle.h"
|
#include "gdb_regex.h"
|
#include "gdb_regex.h"
|
#include "frame.h"
|
#include "frame.h"
|
#include "symtab.h"
|
#include "symtab.h"
|
#include "gdbtypes.h"
|
#include "gdbtypes.h"
|
#include "gdbcmd.h"
|
#include "gdbcmd.h"
|
#include "expression.h"
|
#include "expression.h"
|
#include "parser-defs.h"
|
#include "parser-defs.h"
|
#include "language.h"
|
#include "language.h"
|
#include "c-lang.h"
|
#include "c-lang.h"
|
#include "inferior.h"
|
#include "inferior.h"
|
#include "symfile.h"
|
#include "symfile.h"
|
#include "objfiles.h"
|
#include "objfiles.h"
|
#include "breakpoint.h"
|
#include "breakpoint.h"
|
#include "gdbcore.h"
|
#include "gdbcore.h"
|
#include "hashtab.h"
|
#include "hashtab.h"
|
#include "gdb_obstack.h"
|
#include "gdb_obstack.h"
|
#include "ada-lang.h"
|
#include "ada-lang.h"
|
#include "completer.h"
|
#include "completer.h"
|
#include "gdb_stat.h"
|
#include "gdb_stat.h"
|
#ifdef UI_OUT
|
#ifdef UI_OUT
|
#include "ui-out.h"
|
#include "ui-out.h"
|
#endif
|
#endif
|
#include "block.h"
|
#include "block.h"
|
#include "infcall.h"
|
#include "infcall.h"
|
#include "dictionary.h"
|
#include "dictionary.h"
|
#include "exceptions.h"
|
#include "exceptions.h"
|
#include "annotate.h"
|
#include "annotate.h"
|
#include "valprint.h"
|
#include "valprint.h"
|
#include "source.h"
|
#include "source.h"
|
#include "observer.h"
|
#include "observer.h"
|
#include "vec.h"
|
#include "vec.h"
|
|
|
#ifndef ADA_RETAIN_DOTS
|
#ifndef ADA_RETAIN_DOTS
|
#define ADA_RETAIN_DOTS 0
|
#define ADA_RETAIN_DOTS 0
|
#endif
|
#endif
|
|
|
/* Define whether or not the C operator '/' truncates towards zero for
|
/* Define whether or not the C operator '/' truncates towards zero for
|
differently signed operands (truncation direction is undefined in C).
|
differently signed operands (truncation direction is undefined in C).
|
Copied from valarith.c. */
|
Copied from valarith.c. */
|
|
|
#ifndef TRUNCATION_TOWARDS_ZERO
|
#ifndef TRUNCATION_TOWARDS_ZERO
|
#define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
|
#define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
|
#endif
|
#endif
|
|
|
static void extract_string (CORE_ADDR addr, char *buf);
|
static void extract_string (CORE_ADDR addr, char *buf);
|
|
|
static void modify_general_field (char *, LONGEST, int, int);
|
static void modify_general_field (char *, LONGEST, int, int);
|
|
|
static struct type *desc_base_type (struct type *);
|
static struct type *desc_base_type (struct type *);
|
|
|
static struct type *desc_bounds_type (struct type *);
|
static struct type *desc_bounds_type (struct type *);
|
|
|
static struct value *desc_bounds (struct value *);
|
static struct value *desc_bounds (struct value *);
|
|
|
static int fat_pntr_bounds_bitpos (struct type *);
|
static int fat_pntr_bounds_bitpos (struct type *);
|
|
|
static int fat_pntr_bounds_bitsize (struct type *);
|
static int fat_pntr_bounds_bitsize (struct type *);
|
|
|
static struct type *desc_data_type (struct type *);
|
static struct type *desc_data_type (struct type *);
|
|
|
static struct value *desc_data (struct value *);
|
static struct value *desc_data (struct value *);
|
|
|
static int fat_pntr_data_bitpos (struct type *);
|
static int fat_pntr_data_bitpos (struct type *);
|
|
|
static int fat_pntr_data_bitsize (struct type *);
|
static int fat_pntr_data_bitsize (struct type *);
|
|
|
static struct value *desc_one_bound (struct value *, int, int);
|
static struct value *desc_one_bound (struct value *, int, int);
|
|
|
static int desc_bound_bitpos (struct type *, int, int);
|
static int desc_bound_bitpos (struct type *, int, int);
|
|
|
static int desc_bound_bitsize (struct type *, int, int);
|
static int desc_bound_bitsize (struct type *, int, int);
|
|
|
static struct type *desc_index_type (struct type *, int);
|
static struct type *desc_index_type (struct type *, int);
|
|
|
static int desc_arity (struct type *);
|
static int desc_arity (struct type *);
|
|
|
static int ada_type_match (struct type *, struct type *, int);
|
static int ada_type_match (struct type *, struct type *, int);
|
|
|
static int ada_args_match (struct symbol *, struct value **, int);
|
static int ada_args_match (struct symbol *, struct value **, int);
|
|
|
static struct value *ensure_lval (struct value *, CORE_ADDR *);
|
static struct value *ensure_lval (struct value *, CORE_ADDR *);
|
|
|
static struct value *convert_actual (struct value *, struct type *,
|
static struct value *convert_actual (struct value *, struct type *,
|
CORE_ADDR *);
|
CORE_ADDR *);
|
|
|
static struct value *make_array_descriptor (struct type *, struct value *,
|
static struct value *make_array_descriptor (struct type *, struct value *,
|
CORE_ADDR *);
|
CORE_ADDR *);
|
|
|
static void ada_add_block_symbols (struct obstack *,
|
static void ada_add_block_symbols (struct obstack *,
|
struct block *, const char *,
|
struct block *, const char *,
|
domain_enum, struct objfile *,
|
domain_enum, struct objfile *,
|
struct symtab *, int);
|
struct symtab *, int);
|
|
|
static int is_nonfunction (struct ada_symbol_info *, int);
|
static int is_nonfunction (struct ada_symbol_info *, int);
|
|
|
static void add_defn_to_vec (struct obstack *, struct symbol *,
|
static void add_defn_to_vec (struct obstack *, struct symbol *,
|
struct block *, struct symtab *);
|
struct block *, struct symtab *);
|
|
|
static int num_defns_collected (struct obstack *);
|
static int num_defns_collected (struct obstack *);
|
|
|
static struct ada_symbol_info *defns_collected (struct obstack *, int);
|
static struct ada_symbol_info *defns_collected (struct obstack *, int);
|
|
|
static struct partial_symbol *ada_lookup_partial_symbol (struct partial_symtab
|
static struct partial_symbol *ada_lookup_partial_symbol (struct partial_symtab
|
*, const char *, int,
|
*, const char *, int,
|
domain_enum, int);
|
domain_enum, int);
|
|
|
static struct symtab *symtab_for_sym (struct symbol *);
|
static struct symtab *symtab_for_sym (struct symbol *);
|
|
|
static struct value *resolve_subexp (struct expression **, int *, int,
|
static struct value *resolve_subexp (struct expression **, int *, int,
|
struct type *);
|
struct type *);
|
|
|
static void replace_operator_with_call (struct expression **, int, int, int,
|
static void replace_operator_with_call (struct expression **, int, int, int,
|
struct symbol *, struct block *);
|
struct symbol *, struct block *);
|
|
|
static int possible_user_operator_p (enum exp_opcode, struct value **);
|
static int possible_user_operator_p (enum exp_opcode, struct value **);
|
|
|
static char *ada_op_name (enum exp_opcode);
|
static char *ada_op_name (enum exp_opcode);
|
|
|
static const char *ada_decoded_op_name (enum exp_opcode);
|
static const char *ada_decoded_op_name (enum exp_opcode);
|
|
|
static int numeric_type_p (struct type *);
|
static int numeric_type_p (struct type *);
|
|
|
static int integer_type_p (struct type *);
|
static int integer_type_p (struct type *);
|
|
|
static int scalar_type_p (struct type *);
|
static int scalar_type_p (struct type *);
|
|
|
static int discrete_type_p (struct type *);
|
static int discrete_type_p (struct type *);
|
|
|
static enum ada_renaming_category parse_old_style_renaming (struct type *,
|
static enum ada_renaming_category parse_old_style_renaming (struct type *,
|
const char **,
|
const char **,
|
int *,
|
int *,
|
const char **);
|
const char **);
|
|
|
static struct symbol *find_old_style_renaming_symbol (const char *,
|
static struct symbol *find_old_style_renaming_symbol (const char *,
|
struct block *);
|
struct block *);
|
|
|
static struct type *ada_lookup_struct_elt_type (struct type *, char *,
|
static struct type *ada_lookup_struct_elt_type (struct type *, char *,
|
int, int, int *);
|
int, int, int *);
|
|
|
static struct value *evaluate_subexp (struct type *, struct expression *,
|
static struct value *evaluate_subexp (struct type *, struct expression *,
|
int *, enum noside);
|
int *, enum noside);
|
|
|
static struct value *evaluate_subexp_type (struct expression *, int *);
|
static struct value *evaluate_subexp_type (struct expression *, int *);
|
|
|
static int is_dynamic_field (struct type *, int);
|
static int is_dynamic_field (struct type *, int);
|
|
|
static struct type *to_fixed_variant_branch_type (struct type *,
|
static struct type *to_fixed_variant_branch_type (struct type *,
|
const gdb_byte *,
|
const gdb_byte *,
|
CORE_ADDR, struct value *);
|
CORE_ADDR, struct value *);
|
|
|
static struct type *to_fixed_array_type (struct type *, struct value *, int);
|
static struct type *to_fixed_array_type (struct type *, struct value *, int);
|
|
|
static struct type *to_fixed_range_type (char *, struct value *,
|
static struct type *to_fixed_range_type (char *, struct value *,
|
struct objfile *);
|
struct objfile *);
|
|
|
static struct type *to_static_fixed_type (struct type *);
|
static struct type *to_static_fixed_type (struct type *);
|
static struct type *static_unwrap_type (struct type *type);
|
static struct type *static_unwrap_type (struct type *type);
|
|
|
static struct value *unwrap_value (struct value *);
|
static struct value *unwrap_value (struct value *);
|
|
|
static struct type *packed_array_type (struct type *, long *);
|
static struct type *packed_array_type (struct type *, long *);
|
|
|
static struct type *decode_packed_array_type (struct type *);
|
static struct type *decode_packed_array_type (struct type *);
|
|
|
static struct value *decode_packed_array (struct value *);
|
static struct value *decode_packed_array (struct value *);
|
|
|
static struct value *value_subscript_packed (struct value *, int,
|
static struct value *value_subscript_packed (struct value *, int,
|
struct value **);
|
struct value **);
|
|
|
static void move_bits (gdb_byte *, int, const gdb_byte *, int, int);
|
static void move_bits (gdb_byte *, int, const gdb_byte *, int, int);
|
|
|
static struct value *coerce_unspec_val_to_type (struct value *,
|
static struct value *coerce_unspec_val_to_type (struct value *,
|
struct type *);
|
struct type *);
|
|
|
static struct value *get_var_value (char *, char *);
|
static struct value *get_var_value (char *, char *);
|
|
|
static int lesseq_defined_than (struct symbol *, struct symbol *);
|
static int lesseq_defined_than (struct symbol *, struct symbol *);
|
|
|
static int equiv_types (struct type *, struct type *);
|
static int equiv_types (struct type *, struct type *);
|
|
|
static int is_name_suffix (const char *);
|
static int is_name_suffix (const char *);
|
|
|
static int wild_match (const char *, int, const char *);
|
static int wild_match (const char *, int, const char *);
|
|
|
static struct value *ada_coerce_ref (struct value *);
|
static struct value *ada_coerce_ref (struct value *);
|
|
|
static LONGEST pos_atr (struct value *);
|
static LONGEST pos_atr (struct value *);
|
|
|
static struct value *value_pos_atr (struct value *);
|
static struct value *value_pos_atr (struct value *);
|
|
|
static struct value *value_val_atr (struct type *, struct value *);
|
static struct value *value_val_atr (struct type *, struct value *);
|
|
|
static struct symbol *standard_lookup (const char *, const struct block *,
|
static struct symbol *standard_lookup (const char *, const struct block *,
|
domain_enum);
|
domain_enum);
|
|
|
static struct value *ada_search_struct_field (char *, struct value *, int,
|
static struct value *ada_search_struct_field (char *, struct value *, int,
|
struct type *);
|
struct type *);
|
|
|
static struct value *ada_value_primitive_field (struct value *, int, int,
|
static struct value *ada_value_primitive_field (struct value *, int, int,
|
struct type *);
|
struct type *);
|
|
|
static int find_struct_field (char *, struct type *, int,
|
static int find_struct_field (char *, struct type *, int,
|
struct type **, int *, int *, int *, int *);
|
struct type **, int *, int *, int *, int *);
|
|
|
static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR,
|
static struct value *ada_to_fixed_value_create (struct type *, CORE_ADDR,
|
struct value *);
|
struct value *);
|
|
|
static struct value *ada_to_fixed_value (struct value *);
|
static struct value *ada_to_fixed_value (struct value *);
|
|
|
static int ada_resolve_function (struct ada_symbol_info *, int,
|
static int ada_resolve_function (struct ada_symbol_info *, int,
|
struct value **, int, const char *,
|
struct value **, int, const char *,
|
struct type *);
|
struct type *);
|
|
|
static struct value *ada_coerce_to_simple_array (struct value *);
|
static struct value *ada_coerce_to_simple_array (struct value *);
|
|
|
static int ada_is_direct_array_type (struct type *);
|
static int ada_is_direct_array_type (struct type *);
|
|
|
static void ada_language_arch_info (struct gdbarch *,
|
static void ada_language_arch_info (struct gdbarch *,
|
struct language_arch_info *);
|
struct language_arch_info *);
|
|
|
static void check_size (const struct type *);
|
static void check_size (const struct type *);
|
|
|
static struct value *ada_index_struct_field (int, struct value *, int,
|
static struct value *ada_index_struct_field (int, struct value *, int,
|
struct type *);
|
struct type *);
|
|
|
static struct value *assign_aggregate (struct value *, struct value *,
|
static struct value *assign_aggregate (struct value *, struct value *,
|
struct expression *, int *, enum noside);
|
struct expression *, int *, enum noside);
|
|
|
static void aggregate_assign_from_choices (struct value *, struct value *,
|
static void aggregate_assign_from_choices (struct value *, struct value *,
|
struct expression *,
|
struct expression *,
|
int *, LONGEST *, int *,
|
int *, LONGEST *, int *,
|
int, LONGEST, LONGEST);
|
int, LONGEST, LONGEST);
|
|
|
static void aggregate_assign_positional (struct value *, struct value *,
|
static void aggregate_assign_positional (struct value *, struct value *,
|
struct expression *,
|
struct expression *,
|
int *, LONGEST *, int *, int,
|
int *, LONGEST *, int *, int,
|
LONGEST, LONGEST);
|
LONGEST, LONGEST);
|
|
|
|
|
static void aggregate_assign_others (struct value *, struct value *,
|
static void aggregate_assign_others (struct value *, struct value *,
|
struct expression *,
|
struct expression *,
|
int *, LONGEST *, int, LONGEST, LONGEST);
|
int *, LONGEST *, int, LONGEST, LONGEST);
|
|
|
|
|
static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int);
|
static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int);
|
|
|
|
|
static struct value *ada_evaluate_subexp (struct type *, struct expression *,
|
static struct value *ada_evaluate_subexp (struct type *, struct expression *,
|
int *, enum noside);
|
int *, enum noside);
|
|
|
static void ada_forward_operator_length (struct expression *, int, int *,
|
static void ada_forward_operator_length (struct expression *, int, int *,
|
int *);
|
int *);
|
|
|
|
|
|
|
/* Maximum-sized dynamic type. */
|
/* Maximum-sized dynamic type. */
|
static unsigned int varsize_limit;
|
static unsigned int varsize_limit;
|
|
|
/* FIXME: brobecker/2003-09-17: No longer a const because it is
|
/* FIXME: brobecker/2003-09-17: No longer a const because it is
|
returned by a function that does not return a const char *. */
|
returned by a function that does not return a const char *. */
|
static char *ada_completer_word_break_characters =
|
static char *ada_completer_word_break_characters =
|
#ifdef VMS
|
#ifdef VMS
|
" \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
|
" \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
|
#else
|
#else
|
" \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
|
" \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
|
#endif
|
#endif
|
|
|
/* The name of the symbol to use to get the name of the main subprogram. */
|
/* The name of the symbol to use to get the name of the main subprogram. */
|
static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
|
static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[]
|
= "__gnat_ada_main_program_name";
|
= "__gnat_ada_main_program_name";
|
|
|
/* Limit on the number of warnings to raise per expression evaluation. */
|
/* Limit on the number of warnings to raise per expression evaluation. */
|
static int warning_limit = 2;
|
static int warning_limit = 2;
|
|
|
/* Number of warning messages issued; reset to 0 by cleanups after
|
/* Number of warning messages issued; reset to 0 by cleanups after
|
expression evaluation. */
|
expression evaluation. */
|
static int warnings_issued = 0;
|
static int warnings_issued = 0;
|
|
|
static const char *known_runtime_file_name_patterns[] = {
|
static const char *known_runtime_file_name_patterns[] = {
|
ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
|
ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
|
};
|
};
|
|
|
static const char *known_auxiliary_function_name_patterns[] = {
|
static const char *known_auxiliary_function_name_patterns[] = {
|
ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
|
ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
|
};
|
};
|
|
|
/* Space for allocating results of ada_lookup_symbol_list. */
|
/* Space for allocating results of ada_lookup_symbol_list. */
|
static struct obstack symbol_list_obstack;
|
static struct obstack symbol_list_obstack;
|
|
|
/* Utilities */
|
/* Utilities */
|
|
|
/* Given DECODED_NAME a string holding a symbol name in its
|
/* Given DECODED_NAME a string holding a symbol name in its
|
decoded form (ie using the Ada dotted notation), returns
|
decoded form (ie using the Ada dotted notation), returns
|
its unqualified name. */
|
its unqualified name. */
|
|
|
static const char *
|
static const char *
|
ada_unqualified_name (const char *decoded_name)
|
ada_unqualified_name (const char *decoded_name)
|
{
|
{
|
const char *result = strrchr (decoded_name, '.');
|
const char *result = strrchr (decoded_name, '.');
|
|
|
if (result != NULL)
|
if (result != NULL)
|
result++; /* Skip the dot... */
|
result++; /* Skip the dot... */
|
else
|
else
|
result = decoded_name;
|
result = decoded_name;
|
|
|
return result;
|
return result;
|
}
|
}
|
|
|
/* Return a string starting with '<', followed by STR, and '>'.
|
/* Return a string starting with '<', followed by STR, and '>'.
|
The result is good until the next call. */
|
The result is good until the next call. */
|
|
|
static char *
|
static char *
|
add_angle_brackets (const char *str)
|
add_angle_brackets (const char *str)
|
{
|
{
|
static char *result = NULL;
|
static char *result = NULL;
|
|
|
xfree (result);
|
xfree (result);
|
result = (char *) xmalloc ((strlen (str) + 3) * sizeof (char));
|
result = (char *) xmalloc ((strlen (str) + 3) * sizeof (char));
|
|
|
sprintf (result, "<%s>", str);
|
sprintf (result, "<%s>", str);
|
return result;
|
return result;
|
}
|
}
|
|
|
static char *
|
static char *
|
ada_get_gdb_completer_word_break_characters (void)
|
ada_get_gdb_completer_word_break_characters (void)
|
{
|
{
|
return ada_completer_word_break_characters;
|
return ada_completer_word_break_characters;
|
}
|
}
|
|
|
/* Print an array element index using the Ada syntax. */
|
/* Print an array element index using the Ada syntax. */
|
|
|
static void
|
static void
|
ada_print_array_index (struct value *index_value, struct ui_file *stream,
|
ada_print_array_index (struct value *index_value, struct ui_file *stream,
|
int format, enum val_prettyprint pretty)
|
int format, enum val_prettyprint pretty)
|
{
|
{
|
LA_VALUE_PRINT (index_value, stream, format, pretty);
|
LA_VALUE_PRINT (index_value, stream, format, pretty);
|
fprintf_filtered (stream, " => ");
|
fprintf_filtered (stream, " => ");
|
}
|
}
|
|
|
/* Read the string located at ADDR from the inferior and store the
|
/* Read the string located at ADDR from the inferior and store the
|
result into BUF. */
|
result into BUF. */
|
|
|
static void
|
static void
|
extract_string (CORE_ADDR addr, char *buf)
|
extract_string (CORE_ADDR addr, char *buf)
|
{
|
{
|
int char_index = 0;
|
int char_index = 0;
|
|
|
/* Loop, reading one byte at a time, until we reach the '\000'
|
/* Loop, reading one byte at a time, until we reach the '\000'
|
end-of-string marker. */
|
end-of-string marker. */
|
do
|
do
|
{
|
{
|
target_read_memory (addr + char_index * sizeof (char),
|
target_read_memory (addr + char_index * sizeof (char),
|
buf + char_index * sizeof (char), sizeof (char));
|
buf + char_index * sizeof (char), sizeof (char));
|
char_index++;
|
char_index++;
|
}
|
}
|
while (buf[char_index - 1] != '\000');
|
while (buf[char_index - 1] != '\000');
|
}
|
}
|
|
|
/* Assuming VECT points to an array of *SIZE objects of size
|
/* Assuming VECT points to an array of *SIZE objects of size
|
ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
|
ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
|
updating *SIZE as necessary and returning the (new) array. */
|
updating *SIZE as necessary and returning the (new) array. */
|
|
|
void *
|
void *
|
grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
|
grow_vect (void *vect, size_t *size, size_t min_size, int element_size)
|
{
|
{
|
if (*size < min_size)
|
if (*size < min_size)
|
{
|
{
|
*size *= 2;
|
*size *= 2;
|
if (*size < min_size)
|
if (*size < min_size)
|
*size = min_size;
|
*size = min_size;
|
vect = xrealloc (vect, *size * element_size);
|
vect = xrealloc (vect, *size * element_size);
|
}
|
}
|
return vect;
|
return vect;
|
}
|
}
|
|
|
/* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
|
/* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
|
suffix of FIELD_NAME beginning "___". */
|
suffix of FIELD_NAME beginning "___". */
|
|
|
static int
|
static int
|
field_name_match (const char *field_name, const char *target)
|
field_name_match (const char *field_name, const char *target)
|
{
|
{
|
int len = strlen (target);
|
int len = strlen (target);
|
return
|
return
|
(strncmp (field_name, target, len) == 0
|
(strncmp (field_name, target, len) == 0
|
&& (field_name[len] == '\0'
|
&& (field_name[len] == '\0'
|
|| (strncmp (field_name + len, "___", 3) == 0
|
|| (strncmp (field_name + len, "___", 3) == 0
|
&& strcmp (field_name + strlen (field_name) - 6,
|
&& strcmp (field_name + strlen (field_name) - 6,
|
"___XVN") != 0)));
|
"___XVN") != 0)));
|
}
|
}
|
|
|
|
|
/* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
|
/* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
|
FIELD_NAME, and return its index. This function also handles fields
|
FIELD_NAME, and return its index. This function also handles fields
|
whose name have ___ suffixes because the compiler sometimes alters
|
whose name have ___ suffixes because the compiler sometimes alters
|
their name by adding such a suffix to represent fields with certain
|
their name by adding such a suffix to represent fields with certain
|
constraints. If the field could not be found, return a negative
|
constraints. If the field could not be found, return a negative
|
number if MAYBE_MISSING is set. Otherwise raise an error. */
|
number if MAYBE_MISSING is set. Otherwise raise an error. */
|
|
|
int
|
int
|
ada_get_field_index (const struct type *type, const char *field_name,
|
ada_get_field_index (const struct type *type, const char *field_name,
|
int maybe_missing)
|
int maybe_missing)
|
{
|
{
|
int fieldno;
|
int fieldno;
|
for (fieldno = 0; fieldno < TYPE_NFIELDS (type); fieldno++)
|
for (fieldno = 0; fieldno < TYPE_NFIELDS (type); fieldno++)
|
if (field_name_match (TYPE_FIELD_NAME (type, fieldno), field_name))
|
if (field_name_match (TYPE_FIELD_NAME (type, fieldno), field_name))
|
return fieldno;
|
return fieldno;
|
|
|
if (!maybe_missing)
|
if (!maybe_missing)
|
error (_("Unable to find field %s in struct %s. Aborting"),
|
error (_("Unable to find field %s in struct %s. Aborting"),
|
field_name, TYPE_NAME (type));
|
field_name, TYPE_NAME (type));
|
|
|
return -1;
|
return -1;
|
}
|
}
|
|
|
/* The length of the prefix of NAME prior to any "___" suffix. */
|
/* The length of the prefix of NAME prior to any "___" suffix. */
|
|
|
int
|
int
|
ada_name_prefix_len (const char *name)
|
ada_name_prefix_len (const char *name)
|
{
|
{
|
if (name == NULL)
|
if (name == NULL)
|
return 0;
|
return 0;
|
else
|
else
|
{
|
{
|
const char *p = strstr (name, "___");
|
const char *p = strstr (name, "___");
|
if (p == NULL)
|
if (p == NULL)
|
return strlen (name);
|
return strlen (name);
|
else
|
else
|
return p - name;
|
return p - name;
|
}
|
}
|
}
|
}
|
|
|
/* Return non-zero if SUFFIX is a suffix of STR.
|
/* Return non-zero if SUFFIX is a suffix of STR.
|
Return zero if STR is null. */
|
Return zero if STR is null. */
|
|
|
static int
|
static int
|
is_suffix (const char *str, const char *suffix)
|
is_suffix (const char *str, const char *suffix)
|
{
|
{
|
int len1, len2;
|
int len1, len2;
|
if (str == NULL)
|
if (str == NULL)
|
return 0;
|
return 0;
|
len1 = strlen (str);
|
len1 = strlen (str);
|
len2 = strlen (suffix);
|
len2 = strlen (suffix);
|
return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
|
return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0);
|
}
|
}
|
|
|
/* Create a value of type TYPE whose contents come from VALADDR, if it
|
/* Create a value of type TYPE whose contents come from VALADDR, if it
|
is non-null, and whose memory address (in the inferior) is
|
is non-null, and whose memory address (in the inferior) is
|
ADDRESS. */
|
ADDRESS. */
|
|
|
struct value *
|
struct value *
|
value_from_contents_and_address (struct type *type,
|
value_from_contents_and_address (struct type *type,
|
const gdb_byte *valaddr,
|
const gdb_byte *valaddr,
|
CORE_ADDR address)
|
CORE_ADDR address)
|
{
|
{
|
struct value *v = allocate_value (type);
|
struct value *v = allocate_value (type);
|
if (valaddr == NULL)
|
if (valaddr == NULL)
|
set_value_lazy (v, 1);
|
set_value_lazy (v, 1);
|
else
|
else
|
memcpy (value_contents_raw (v), valaddr, TYPE_LENGTH (type));
|
memcpy (value_contents_raw (v), valaddr, TYPE_LENGTH (type));
|
VALUE_ADDRESS (v) = address;
|
VALUE_ADDRESS (v) = address;
|
if (address != 0)
|
if (address != 0)
|
VALUE_LVAL (v) = lval_memory;
|
VALUE_LVAL (v) = lval_memory;
|
return v;
|
return v;
|
}
|
}
|
|
|
/* The contents of value VAL, treated as a value of type TYPE. The
|
/* The contents of value VAL, treated as a value of type TYPE. The
|
result is an lval in memory if VAL is. */
|
result is an lval in memory if VAL is. */
|
|
|
static struct value *
|
static struct value *
|
coerce_unspec_val_to_type (struct value *val, struct type *type)
|
coerce_unspec_val_to_type (struct value *val, struct type *type)
|
{
|
{
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
if (value_type (val) == type)
|
if (value_type (val) == type)
|
return val;
|
return val;
|
else
|
else
|
{
|
{
|
struct value *result;
|
struct value *result;
|
|
|
/* Make sure that the object size is not unreasonable before
|
/* Make sure that the object size is not unreasonable before
|
trying to allocate some memory for it. */
|
trying to allocate some memory for it. */
|
check_size (type);
|
check_size (type);
|
|
|
result = allocate_value (type);
|
result = allocate_value (type);
|
VALUE_LVAL (result) = VALUE_LVAL (val);
|
VALUE_LVAL (result) = VALUE_LVAL (val);
|
set_value_bitsize (result, value_bitsize (val));
|
set_value_bitsize (result, value_bitsize (val));
|
set_value_bitpos (result, value_bitpos (val));
|
set_value_bitpos (result, value_bitpos (val));
|
VALUE_ADDRESS (result) = VALUE_ADDRESS (val) + value_offset (val);
|
VALUE_ADDRESS (result) = VALUE_ADDRESS (val) + value_offset (val);
|
if (value_lazy (val)
|
if (value_lazy (val)
|
|| TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
|
|| TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val)))
|
set_value_lazy (result, 1);
|
set_value_lazy (result, 1);
|
else
|
else
|
memcpy (value_contents_raw (result), value_contents (val),
|
memcpy (value_contents_raw (result), value_contents (val),
|
TYPE_LENGTH (type));
|
TYPE_LENGTH (type));
|
return result;
|
return result;
|
}
|
}
|
}
|
}
|
|
|
static const gdb_byte *
|
static const gdb_byte *
|
cond_offset_host (const gdb_byte *valaddr, long offset)
|
cond_offset_host (const gdb_byte *valaddr, long offset)
|
{
|
{
|
if (valaddr == NULL)
|
if (valaddr == NULL)
|
return NULL;
|
return NULL;
|
else
|
else
|
return valaddr + offset;
|
return valaddr + offset;
|
}
|
}
|
|
|
static CORE_ADDR
|
static CORE_ADDR
|
cond_offset_target (CORE_ADDR address, long offset)
|
cond_offset_target (CORE_ADDR address, long offset)
|
{
|
{
|
if (address == 0)
|
if (address == 0)
|
return 0;
|
return 0;
|
else
|
else
|
return address + offset;
|
return address + offset;
|
}
|
}
|
|
|
/* Issue a warning (as for the definition of warning in utils.c, but
|
/* Issue a warning (as for the definition of warning in utils.c, but
|
with exactly one argument rather than ...), unless the limit on the
|
with exactly one argument rather than ...), unless the limit on the
|
number of warnings has passed during the evaluation of the current
|
number of warnings has passed during the evaluation of the current
|
expression. */
|
expression. */
|
|
|
/* FIXME: cagney/2004-10-10: This function is mimicking the behavior
|
/* FIXME: cagney/2004-10-10: This function is mimicking the behavior
|
provided by "complaint". */
|
provided by "complaint". */
|
static void lim_warning (const char *format, ...) ATTR_FORMAT (printf, 1, 2);
|
static void lim_warning (const char *format, ...) ATTR_FORMAT (printf, 1, 2);
|
|
|
static void
|
static void
|
lim_warning (const char *format, ...)
|
lim_warning (const char *format, ...)
|
{
|
{
|
va_list args;
|
va_list args;
|
va_start (args, format);
|
va_start (args, format);
|
|
|
warnings_issued += 1;
|
warnings_issued += 1;
|
if (warnings_issued <= warning_limit)
|
if (warnings_issued <= warning_limit)
|
vwarning (format, args);
|
vwarning (format, args);
|
|
|
va_end (args);
|
va_end (args);
|
}
|
}
|
|
|
/* Issue an error if the size of an object of type T is unreasonable,
|
/* Issue an error if the size of an object of type T is unreasonable,
|
i.e. if it would be a bad idea to allocate a value of this type in
|
i.e. if it would be a bad idea to allocate a value of this type in
|
GDB. */
|
GDB. */
|
|
|
static void
|
static void
|
check_size (const struct type *type)
|
check_size (const struct type *type)
|
{
|
{
|
if (TYPE_LENGTH (type) > varsize_limit)
|
if (TYPE_LENGTH (type) > varsize_limit)
|
error (_("object size is larger than varsize-limit"));
|
error (_("object size is larger than varsize-limit"));
|
}
|
}
|
|
|
|
|
/* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
|
/* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
|
gdbtypes.h, but some of the necessary definitions in that file
|
gdbtypes.h, but some of the necessary definitions in that file
|
seem to have gone missing. */
|
seem to have gone missing. */
|
|
|
/* Maximum value of a SIZE-byte signed integer type. */
|
/* Maximum value of a SIZE-byte signed integer type. */
|
static LONGEST
|
static LONGEST
|
max_of_size (int size)
|
max_of_size (int size)
|
{
|
{
|
LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
|
LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2);
|
return top_bit | (top_bit - 1);
|
return top_bit | (top_bit - 1);
|
}
|
}
|
|
|
/* Minimum value of a SIZE-byte signed integer type. */
|
/* Minimum value of a SIZE-byte signed integer type. */
|
static LONGEST
|
static LONGEST
|
min_of_size (int size)
|
min_of_size (int size)
|
{
|
{
|
return -max_of_size (size) - 1;
|
return -max_of_size (size) - 1;
|
}
|
}
|
|
|
/* Maximum value of a SIZE-byte unsigned integer type. */
|
/* Maximum value of a SIZE-byte unsigned integer type. */
|
static ULONGEST
|
static ULONGEST
|
umax_of_size (int size)
|
umax_of_size (int size)
|
{
|
{
|
ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
|
ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1);
|
return top_bit | (top_bit - 1);
|
return top_bit | (top_bit - 1);
|
}
|
}
|
|
|
/* Maximum value of integral type T, as a signed quantity. */
|
/* Maximum value of integral type T, as a signed quantity. */
|
static LONGEST
|
static LONGEST
|
max_of_type (struct type *t)
|
max_of_type (struct type *t)
|
{
|
{
|
if (TYPE_UNSIGNED (t))
|
if (TYPE_UNSIGNED (t))
|
return (LONGEST) umax_of_size (TYPE_LENGTH (t));
|
return (LONGEST) umax_of_size (TYPE_LENGTH (t));
|
else
|
else
|
return max_of_size (TYPE_LENGTH (t));
|
return max_of_size (TYPE_LENGTH (t));
|
}
|
}
|
|
|
/* Minimum value of integral type T, as a signed quantity. */
|
/* Minimum value of integral type T, as a signed quantity. */
|
static LONGEST
|
static LONGEST
|
min_of_type (struct type *t)
|
min_of_type (struct type *t)
|
{
|
{
|
if (TYPE_UNSIGNED (t))
|
if (TYPE_UNSIGNED (t))
|
return 0;
|
return 0;
|
else
|
else
|
return min_of_size (TYPE_LENGTH (t));
|
return min_of_size (TYPE_LENGTH (t));
|
}
|
}
|
|
|
/* The largest value in the domain of TYPE, a discrete type, as an integer. */
|
/* The largest value in the domain of TYPE, a discrete type, as an integer. */
|
static struct value *
|
static struct value *
|
discrete_type_high_bound (struct type *type)
|
discrete_type_high_bound (struct type *type)
|
{
|
{
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_RANGE:
|
return value_from_longest (TYPE_TARGET_TYPE (type),
|
return value_from_longest (TYPE_TARGET_TYPE (type),
|
TYPE_HIGH_BOUND (type));
|
TYPE_HIGH_BOUND (type));
|
case TYPE_CODE_ENUM:
|
case TYPE_CODE_ENUM:
|
return
|
return
|
value_from_longest (type,
|
value_from_longest (type,
|
TYPE_FIELD_BITPOS (type,
|
TYPE_FIELD_BITPOS (type,
|
TYPE_NFIELDS (type) - 1));
|
TYPE_NFIELDS (type) - 1));
|
case TYPE_CODE_INT:
|
case TYPE_CODE_INT:
|
return value_from_longest (type, max_of_type (type));
|
return value_from_longest (type, max_of_type (type));
|
default:
|
default:
|
error (_("Unexpected type in discrete_type_high_bound."));
|
error (_("Unexpected type in discrete_type_high_bound."));
|
}
|
}
|
}
|
}
|
|
|
/* The largest value in the domain of TYPE, a discrete type, as an integer. */
|
/* The largest value in the domain of TYPE, a discrete type, as an integer. */
|
static struct value *
|
static struct value *
|
discrete_type_low_bound (struct type *type)
|
discrete_type_low_bound (struct type *type)
|
{
|
{
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_RANGE:
|
return value_from_longest (TYPE_TARGET_TYPE (type),
|
return value_from_longest (TYPE_TARGET_TYPE (type),
|
TYPE_LOW_BOUND (type));
|
TYPE_LOW_BOUND (type));
|
case TYPE_CODE_ENUM:
|
case TYPE_CODE_ENUM:
|
return value_from_longest (type, TYPE_FIELD_BITPOS (type, 0));
|
return value_from_longest (type, TYPE_FIELD_BITPOS (type, 0));
|
case TYPE_CODE_INT:
|
case TYPE_CODE_INT:
|
return value_from_longest (type, min_of_type (type));
|
return value_from_longest (type, min_of_type (type));
|
default:
|
default:
|
error (_("Unexpected type in discrete_type_low_bound."));
|
error (_("Unexpected type in discrete_type_low_bound."));
|
}
|
}
|
}
|
}
|
|
|
/* The identity on non-range types. For range types, the underlying
|
/* The identity on non-range types. For range types, the underlying
|
non-range scalar type. */
|
non-range scalar type. */
|
|
|
static struct type *
|
static struct type *
|
base_type (struct type *type)
|
base_type (struct type *type)
|
{
|
{
|
while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
|
while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE)
|
{
|
{
|
if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
|
if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL)
|
return type;
|
return type;
|
type = TYPE_TARGET_TYPE (type);
|
type = TYPE_TARGET_TYPE (type);
|
}
|
}
|
return type;
|
return type;
|
}
|
}
|
|
|
|
|
/* Language Selection */
|
/* Language Selection */
|
|
|
/* If the main program is in Ada, return language_ada, otherwise return LANG
|
/* If the main program is in Ada, return language_ada, otherwise return LANG
|
(the main program is in Ada iif the adainit symbol is found).
|
(the main program is in Ada iif the adainit symbol is found).
|
|
|
MAIN_PST is not used. */
|
MAIN_PST is not used. */
|
|
|
enum language
|
enum language
|
ada_update_initial_language (enum language lang,
|
ada_update_initial_language (enum language lang,
|
struct partial_symtab *main_pst)
|
struct partial_symtab *main_pst)
|
{
|
{
|
if (lookup_minimal_symbol ("adainit", (const char *) NULL,
|
if (lookup_minimal_symbol ("adainit", (const char *) NULL,
|
(struct objfile *) NULL) != NULL)
|
(struct objfile *) NULL) != NULL)
|
return language_ada;
|
return language_ada;
|
|
|
return lang;
|
return lang;
|
}
|
}
|
|
|
/* If the main procedure is written in Ada, then return its name.
|
/* If the main procedure is written in Ada, then return its name.
|
The result is good until the next call. Return NULL if the main
|
The result is good until the next call. Return NULL if the main
|
procedure doesn't appear to be in Ada. */
|
procedure doesn't appear to be in Ada. */
|
|
|
char *
|
char *
|
ada_main_name (void)
|
ada_main_name (void)
|
{
|
{
|
struct minimal_symbol *msym;
|
struct minimal_symbol *msym;
|
CORE_ADDR main_program_name_addr;
|
CORE_ADDR main_program_name_addr;
|
static char main_program_name[1024];
|
static char main_program_name[1024];
|
|
|
/* For Ada, the name of the main procedure is stored in a specific
|
/* For Ada, the name of the main procedure is stored in a specific
|
string constant, generated by the binder. Look for that symbol,
|
string constant, generated by the binder. Look for that symbol,
|
extract its address, and then read that string. If we didn't find
|
extract its address, and then read that string. If we didn't find
|
that string, then most probably the main procedure is not written
|
that string, then most probably the main procedure is not written
|
in Ada. */
|
in Ada. */
|
msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
|
msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL);
|
|
|
if (msym != NULL)
|
if (msym != NULL)
|
{
|
{
|
main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
|
main_program_name_addr = SYMBOL_VALUE_ADDRESS (msym);
|
if (main_program_name_addr == 0)
|
if (main_program_name_addr == 0)
|
error (_("Invalid address for Ada main program name."));
|
error (_("Invalid address for Ada main program name."));
|
|
|
extract_string (main_program_name_addr, main_program_name);
|
extract_string (main_program_name_addr, main_program_name);
|
return main_program_name;
|
return main_program_name;
|
}
|
}
|
|
|
/* The main procedure doesn't seem to be in Ada. */
|
/* The main procedure doesn't seem to be in Ada. */
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* Symbols */
|
/* Symbols */
|
|
|
/* Table of Ada operators and their GNAT-encoded names. Last entry is pair
|
/* Table of Ada operators and their GNAT-encoded names. Last entry is pair
|
of NULLs. */
|
of NULLs. */
|
|
|
const struct ada_opname_map ada_opname_table[] = {
|
const struct ada_opname_map ada_opname_table[] = {
|
{"Oadd", "\"+\"", BINOP_ADD},
|
{"Oadd", "\"+\"", BINOP_ADD},
|
{"Osubtract", "\"-\"", BINOP_SUB},
|
{"Osubtract", "\"-\"", BINOP_SUB},
|
{"Omultiply", "\"*\"", BINOP_MUL},
|
{"Omultiply", "\"*\"", BINOP_MUL},
|
{"Odivide", "\"/\"", BINOP_DIV},
|
{"Odivide", "\"/\"", BINOP_DIV},
|
{"Omod", "\"mod\"", BINOP_MOD},
|
{"Omod", "\"mod\"", BINOP_MOD},
|
{"Orem", "\"rem\"", BINOP_REM},
|
{"Orem", "\"rem\"", BINOP_REM},
|
{"Oexpon", "\"**\"", BINOP_EXP},
|
{"Oexpon", "\"**\"", BINOP_EXP},
|
{"Olt", "\"<\"", BINOP_LESS},
|
{"Olt", "\"<\"", BINOP_LESS},
|
{"Ole", "\"<=\"", BINOP_LEQ},
|
{"Ole", "\"<=\"", BINOP_LEQ},
|
{"Ogt", "\">\"", BINOP_GTR},
|
{"Ogt", "\">\"", BINOP_GTR},
|
{"Oge", "\">=\"", BINOP_GEQ},
|
{"Oge", "\">=\"", BINOP_GEQ},
|
{"Oeq", "\"=\"", BINOP_EQUAL},
|
{"Oeq", "\"=\"", BINOP_EQUAL},
|
{"One", "\"/=\"", BINOP_NOTEQUAL},
|
{"One", "\"/=\"", BINOP_NOTEQUAL},
|
{"Oand", "\"and\"", BINOP_BITWISE_AND},
|
{"Oand", "\"and\"", BINOP_BITWISE_AND},
|
{"Oor", "\"or\"", BINOP_BITWISE_IOR},
|
{"Oor", "\"or\"", BINOP_BITWISE_IOR},
|
{"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
|
{"Oxor", "\"xor\"", BINOP_BITWISE_XOR},
|
{"Oconcat", "\"&\"", BINOP_CONCAT},
|
{"Oconcat", "\"&\"", BINOP_CONCAT},
|
{"Oabs", "\"abs\"", UNOP_ABS},
|
{"Oabs", "\"abs\"", UNOP_ABS},
|
{"Onot", "\"not\"", UNOP_LOGICAL_NOT},
|
{"Onot", "\"not\"", UNOP_LOGICAL_NOT},
|
{"Oadd", "\"+\"", UNOP_PLUS},
|
{"Oadd", "\"+\"", UNOP_PLUS},
|
{"Osubtract", "\"-\"", UNOP_NEG},
|
{"Osubtract", "\"-\"", UNOP_NEG},
|
{NULL, NULL}
|
{NULL, NULL}
|
};
|
};
|
|
|
/* Return non-zero if STR should be suppressed in info listings. */
|
/* Return non-zero if STR should be suppressed in info listings. */
|
|
|
static int
|
static int
|
is_suppressed_name (const char *str)
|
is_suppressed_name (const char *str)
|
{
|
{
|
if (strncmp (str, "_ada_", 5) == 0)
|
if (strncmp (str, "_ada_", 5) == 0)
|
str += 5;
|
str += 5;
|
if (str[0] == '_' || str[0] == '\000')
|
if (str[0] == '_' || str[0] == '\000')
|
return 1;
|
return 1;
|
else
|
else
|
{
|
{
|
const char *p;
|
const char *p;
|
const char *suffix = strstr (str, "___");
|
const char *suffix = strstr (str, "___");
|
if (suffix != NULL && suffix[3] != 'X')
|
if (suffix != NULL && suffix[3] != 'X')
|
return 1;
|
return 1;
|
if (suffix == NULL)
|
if (suffix == NULL)
|
suffix = str + strlen (str);
|
suffix = str + strlen (str);
|
for (p = suffix - 1; p != str; p -= 1)
|
for (p = suffix - 1; p != str; p -= 1)
|
if (isupper (*p))
|
if (isupper (*p))
|
{
|
{
|
int i;
|
int i;
|
if (p[0] == 'X' && p[-1] != '_')
|
if (p[0] == 'X' && p[-1] != '_')
|
goto OK;
|
goto OK;
|
if (*p != 'O')
|
if (*p != 'O')
|
return 1;
|
return 1;
|
for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
|
for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
|
if (strncmp (ada_opname_table[i].encoded, p,
|
if (strncmp (ada_opname_table[i].encoded, p,
|
strlen (ada_opname_table[i].encoded)) == 0)
|
strlen (ada_opname_table[i].encoded)) == 0)
|
goto OK;
|
goto OK;
|
return 1;
|
return 1;
|
OK:;
|
OK:;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
}
|
}
|
|
|
/* The "encoded" form of DECODED, according to GNAT conventions.
|
/* The "encoded" form of DECODED, according to GNAT conventions.
|
The result is valid until the next call to ada_encode. */
|
The result is valid until the next call to ada_encode. */
|
|
|
char *
|
char *
|
ada_encode (const char *decoded)
|
ada_encode (const char *decoded)
|
{
|
{
|
static char *encoding_buffer = NULL;
|
static char *encoding_buffer = NULL;
|
static size_t encoding_buffer_size = 0;
|
static size_t encoding_buffer_size = 0;
|
const char *p;
|
const char *p;
|
int k;
|
int k;
|
|
|
if (decoded == NULL)
|
if (decoded == NULL)
|
return NULL;
|
return NULL;
|
|
|
GROW_VECT (encoding_buffer, encoding_buffer_size,
|
GROW_VECT (encoding_buffer, encoding_buffer_size,
|
2 * strlen (decoded) + 10);
|
2 * strlen (decoded) + 10);
|
|
|
k = 0;
|
k = 0;
|
for (p = decoded; *p != '\0'; p += 1)
|
for (p = decoded; *p != '\0'; p += 1)
|
{
|
{
|
if (!ADA_RETAIN_DOTS && *p == '.')
|
if (!ADA_RETAIN_DOTS && *p == '.')
|
{
|
{
|
encoding_buffer[k] = encoding_buffer[k + 1] = '_';
|
encoding_buffer[k] = encoding_buffer[k + 1] = '_';
|
k += 2;
|
k += 2;
|
}
|
}
|
else if (*p == '"')
|
else if (*p == '"')
|
{
|
{
|
const struct ada_opname_map *mapping;
|
const struct ada_opname_map *mapping;
|
|
|
for (mapping = ada_opname_table;
|
for (mapping = ada_opname_table;
|
mapping->encoded != NULL
|
mapping->encoded != NULL
|
&& strncmp (mapping->decoded, p,
|
&& strncmp (mapping->decoded, p,
|
strlen (mapping->decoded)) != 0; mapping += 1)
|
strlen (mapping->decoded)) != 0; mapping += 1)
|
;
|
;
|
if (mapping->encoded == NULL)
|
if (mapping->encoded == NULL)
|
error (_("invalid Ada operator name: %s"), p);
|
error (_("invalid Ada operator name: %s"), p);
|
strcpy (encoding_buffer + k, mapping->encoded);
|
strcpy (encoding_buffer + k, mapping->encoded);
|
k += strlen (mapping->encoded);
|
k += strlen (mapping->encoded);
|
break;
|
break;
|
}
|
}
|
else
|
else
|
{
|
{
|
encoding_buffer[k] = *p;
|
encoding_buffer[k] = *p;
|
k += 1;
|
k += 1;
|
}
|
}
|
}
|
}
|
|
|
encoding_buffer[k] = '\0';
|
encoding_buffer[k] = '\0';
|
return encoding_buffer;
|
return encoding_buffer;
|
}
|
}
|
|
|
/* Return NAME folded to lower case, or, if surrounded by single
|
/* Return NAME folded to lower case, or, if surrounded by single
|
quotes, unfolded, but with the quotes stripped away. Result good
|
quotes, unfolded, but with the quotes stripped away. Result good
|
to next call. */
|
to next call. */
|
|
|
char *
|
char *
|
ada_fold_name (const char *name)
|
ada_fold_name (const char *name)
|
{
|
{
|
static char *fold_buffer = NULL;
|
static char *fold_buffer = NULL;
|
static size_t fold_buffer_size = 0;
|
static size_t fold_buffer_size = 0;
|
|
|
int len = strlen (name);
|
int len = strlen (name);
|
GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
|
GROW_VECT (fold_buffer, fold_buffer_size, len + 1);
|
|
|
if (name[0] == '\'')
|
if (name[0] == '\'')
|
{
|
{
|
strncpy (fold_buffer, name + 1, len - 2);
|
strncpy (fold_buffer, name + 1, len - 2);
|
fold_buffer[len - 2] = '\000';
|
fold_buffer[len - 2] = '\000';
|
}
|
}
|
else
|
else
|
{
|
{
|
int i;
|
int i;
|
for (i = 0; i <= len; i += 1)
|
for (i = 0; i <= len; i += 1)
|
fold_buffer[i] = tolower (name[i]);
|
fold_buffer[i] = tolower (name[i]);
|
}
|
}
|
|
|
return fold_buffer;
|
return fold_buffer;
|
}
|
}
|
|
|
/* Return nonzero if C is either a digit or a lowercase alphabet character. */
|
/* Return nonzero if C is either a digit or a lowercase alphabet character. */
|
|
|
static int
|
static int
|
is_lower_alphanum (const char c)
|
is_lower_alphanum (const char c)
|
{
|
{
|
return (isdigit (c) || (isalpha (c) && islower (c)));
|
return (isdigit (c) || (isalpha (c) && islower (c)));
|
}
|
}
|
|
|
/* Remove either of these suffixes:
|
/* Remove either of these suffixes:
|
. .{DIGIT}+
|
. .{DIGIT}+
|
. ${DIGIT}+
|
. ${DIGIT}+
|
. ___{DIGIT}+
|
. ___{DIGIT}+
|
. __{DIGIT}+.
|
. __{DIGIT}+.
|
These are suffixes introduced by the compiler for entities such as
|
These are suffixes introduced by the compiler for entities such as
|
nested subprogram for instance, in order to avoid name clashes.
|
nested subprogram for instance, in order to avoid name clashes.
|
They do not serve any purpose for the debugger. */
|
They do not serve any purpose for the debugger. */
|
|
|
static void
|
static void
|
ada_remove_trailing_digits (const char *encoded, int *len)
|
ada_remove_trailing_digits (const char *encoded, int *len)
|
{
|
{
|
if (*len > 1 && isdigit (encoded[*len - 1]))
|
if (*len > 1 && isdigit (encoded[*len - 1]))
|
{
|
{
|
int i = *len - 2;
|
int i = *len - 2;
|
while (i > 0 && isdigit (encoded[i]))
|
while (i > 0 && isdigit (encoded[i]))
|
i--;
|
i--;
|
if (i >= 0 && encoded[i] == '.')
|
if (i >= 0 && encoded[i] == '.')
|
*len = i;
|
*len = i;
|
else if (i >= 0 && encoded[i] == '$')
|
else if (i >= 0 && encoded[i] == '$')
|
*len = i;
|
*len = i;
|
else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
|
else if (i >= 2 && strncmp (encoded + i - 2, "___", 3) == 0)
|
*len = i - 2;
|
*len = i - 2;
|
else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
|
else if (i >= 1 && strncmp (encoded + i - 1, "__", 2) == 0)
|
*len = i - 1;
|
*len = i - 1;
|
}
|
}
|
}
|
}
|
|
|
/* Remove the suffix introduced by the compiler for protected object
|
/* Remove the suffix introduced by the compiler for protected object
|
subprograms. */
|
subprograms. */
|
|
|
static void
|
static void
|
ada_remove_po_subprogram_suffix (const char *encoded, int *len)
|
ada_remove_po_subprogram_suffix (const char *encoded, int *len)
|
{
|
{
|
/* Remove trailing N. */
|
/* Remove trailing N. */
|
|
|
/* Protected entry subprograms are broken into two
|
/* Protected entry subprograms are broken into two
|
separate subprograms: The first one is unprotected, and has
|
separate subprograms: The first one is unprotected, and has
|
a 'N' suffix; the second is the protected version, and has
|
a 'N' suffix; the second is the protected version, and has
|
the 'P' suffix. The second calls the first one after handling
|
the 'P' suffix. The second calls the first one after handling
|
the protection. Since the P subprograms are internally generated,
|
the protection. Since the P subprograms are internally generated,
|
we leave these names undecoded, giving the user a clue that this
|
we leave these names undecoded, giving the user a clue that this
|
entity is internal. */
|
entity is internal. */
|
|
|
if (*len > 1
|
if (*len > 1
|
&& encoded[*len - 1] == 'N'
|
&& encoded[*len - 1] == 'N'
|
&& (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
|
&& (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2])))
|
*len = *len - 1;
|
*len = *len - 1;
|
}
|
}
|
|
|
/* If ENCODED follows the GNAT entity encoding conventions, then return
|
/* If ENCODED follows the GNAT entity encoding conventions, then return
|
the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
|
the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
|
replaced by ENCODED.
|
replaced by ENCODED.
|
|
|
The resulting string is valid until the next call of ada_decode.
|
The resulting string is valid until the next call of ada_decode.
|
If the string is unchanged by decoding, the original string pointer
|
If the string is unchanged by decoding, the original string pointer
|
is returned. */
|
is returned. */
|
|
|
const char *
|
const char *
|
ada_decode (const char *encoded)
|
ada_decode (const char *encoded)
|
{
|
{
|
int i, j;
|
int i, j;
|
int len0;
|
int len0;
|
const char *p;
|
const char *p;
|
char *decoded;
|
char *decoded;
|
int at_start_name;
|
int at_start_name;
|
static char *decoding_buffer = NULL;
|
static char *decoding_buffer = NULL;
|
static size_t decoding_buffer_size = 0;
|
static size_t decoding_buffer_size = 0;
|
|
|
/* The name of the Ada main procedure starts with "_ada_".
|
/* The name of the Ada main procedure starts with "_ada_".
|
This prefix is not part of the decoded name, so skip this part
|
This prefix is not part of the decoded name, so skip this part
|
if we see this prefix. */
|
if we see this prefix. */
|
if (strncmp (encoded, "_ada_", 5) == 0)
|
if (strncmp (encoded, "_ada_", 5) == 0)
|
encoded += 5;
|
encoded += 5;
|
|
|
/* If the name starts with '_', then it is not a properly encoded
|
/* If the name starts with '_', then it is not a properly encoded
|
name, so do not attempt to decode it. Similarly, if the name
|
name, so do not attempt to decode it. Similarly, if the name
|
starts with '<', the name should not be decoded. */
|
starts with '<', the name should not be decoded. */
|
if (encoded[0] == '_' || encoded[0] == '<')
|
if (encoded[0] == '_' || encoded[0] == '<')
|
goto Suppress;
|
goto Suppress;
|
|
|
len0 = strlen (encoded);
|
len0 = strlen (encoded);
|
|
|
ada_remove_trailing_digits (encoded, &len0);
|
ada_remove_trailing_digits (encoded, &len0);
|
ada_remove_po_subprogram_suffix (encoded, &len0);
|
ada_remove_po_subprogram_suffix (encoded, &len0);
|
|
|
/* Remove the ___X.* suffix if present. Do not forget to verify that
|
/* Remove the ___X.* suffix if present. Do not forget to verify that
|
the suffix is located before the current "end" of ENCODED. We want
|
the suffix is located before the current "end" of ENCODED. We want
|
to avoid re-matching parts of ENCODED that have previously been
|
to avoid re-matching parts of ENCODED that have previously been
|
marked as discarded (by decrementing LEN0). */
|
marked as discarded (by decrementing LEN0). */
|
p = strstr (encoded, "___");
|
p = strstr (encoded, "___");
|
if (p != NULL && p - encoded < len0 - 3)
|
if (p != NULL && p - encoded < len0 - 3)
|
{
|
{
|
if (p[3] == 'X')
|
if (p[3] == 'X')
|
len0 = p - encoded;
|
len0 = p - encoded;
|
else
|
else
|
goto Suppress;
|
goto Suppress;
|
}
|
}
|
|
|
/* Remove any trailing TKB suffix. It tells us that this symbol
|
/* Remove any trailing TKB suffix. It tells us that this symbol
|
is for the body of a task, but that information does not actually
|
is for the body of a task, but that information does not actually
|
appear in the decoded name. */
|
appear in the decoded name. */
|
|
|
if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
|
if (len0 > 3 && strncmp (encoded + len0 - 3, "TKB", 3) == 0)
|
len0 -= 3;
|
len0 -= 3;
|
|
|
/* Remove trailing "B" suffixes. */
|
/* Remove trailing "B" suffixes. */
|
/* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
|
/* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
|
|
|
if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
|
if (len0 > 1 && strncmp (encoded + len0 - 1, "B", 1) == 0)
|
len0 -= 1;
|
len0 -= 1;
|
|
|
/* Make decoded big enough for possible expansion by operator name. */
|
/* Make decoded big enough for possible expansion by operator name. */
|
|
|
GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
|
GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1);
|
decoded = decoding_buffer;
|
decoded = decoding_buffer;
|
|
|
/* Remove trailing __{digit}+ or trailing ${digit}+. */
|
/* Remove trailing __{digit}+ or trailing ${digit}+. */
|
|
|
if (len0 > 1 && isdigit (encoded[len0 - 1]))
|
if (len0 > 1 && isdigit (encoded[len0 - 1]))
|
{
|
{
|
i = len0 - 2;
|
i = len0 - 2;
|
while ((i >= 0 && isdigit (encoded[i]))
|
while ((i >= 0 && isdigit (encoded[i]))
|
|| (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
|
|| (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1])))
|
i -= 1;
|
i -= 1;
|
if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
|
if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_')
|
len0 = i - 1;
|
len0 = i - 1;
|
else if (encoded[i] == '$')
|
else if (encoded[i] == '$')
|
len0 = i;
|
len0 = i;
|
}
|
}
|
|
|
/* The first few characters that are not alphabetic are not part
|
/* The first few characters that are not alphabetic are not part
|
of any encoding we use, so we can copy them over verbatim. */
|
of any encoding we use, so we can copy them over verbatim. */
|
|
|
for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
|
for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1)
|
decoded[j] = encoded[i];
|
decoded[j] = encoded[i];
|
|
|
at_start_name = 1;
|
at_start_name = 1;
|
while (i < len0)
|
while (i < len0)
|
{
|
{
|
/* Is this a symbol function? */
|
/* Is this a symbol function? */
|
if (at_start_name && encoded[i] == 'O')
|
if (at_start_name && encoded[i] == 'O')
|
{
|
{
|
int k;
|
int k;
|
for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
|
for (k = 0; ada_opname_table[k].encoded != NULL; k += 1)
|
{
|
{
|
int op_len = strlen (ada_opname_table[k].encoded);
|
int op_len = strlen (ada_opname_table[k].encoded);
|
if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
|
if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1,
|
op_len - 1) == 0)
|
op_len - 1) == 0)
|
&& !isalnum (encoded[i + op_len]))
|
&& !isalnum (encoded[i + op_len]))
|
{
|
{
|
strcpy (decoded + j, ada_opname_table[k].decoded);
|
strcpy (decoded + j, ada_opname_table[k].decoded);
|
at_start_name = 0;
|
at_start_name = 0;
|
i += op_len;
|
i += op_len;
|
j += strlen (ada_opname_table[k].decoded);
|
j += strlen (ada_opname_table[k].decoded);
|
break;
|
break;
|
}
|
}
|
}
|
}
|
if (ada_opname_table[k].encoded != NULL)
|
if (ada_opname_table[k].encoded != NULL)
|
continue;
|
continue;
|
}
|
}
|
at_start_name = 0;
|
at_start_name = 0;
|
|
|
/* Replace "TK__" with "__", which will eventually be translated
|
/* Replace "TK__" with "__", which will eventually be translated
|
into "." (just below). */
|
into "." (just below). */
|
|
|
if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
|
if (i < len0 - 4 && strncmp (encoded + i, "TK__", 4) == 0)
|
i += 2;
|
i += 2;
|
|
|
/* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
|
/* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
|
be translated into "." (just below). These are internal names
|
be translated into "." (just below). These are internal names
|
generated for anonymous blocks inside which our symbol is nested. */
|
generated for anonymous blocks inside which our symbol is nested. */
|
|
|
if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
|
if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_'
|
&& encoded [i+2] == 'B' && encoded [i+3] == '_'
|
&& encoded [i+2] == 'B' && encoded [i+3] == '_'
|
&& isdigit (encoded [i+4]))
|
&& isdigit (encoded [i+4]))
|
{
|
{
|
int k = i + 5;
|
int k = i + 5;
|
|
|
while (k < len0 && isdigit (encoded[k]))
|
while (k < len0 && isdigit (encoded[k]))
|
k++; /* Skip any extra digit. */
|
k++; /* Skip any extra digit. */
|
|
|
/* Double-check that the "__B_{DIGITS}+" sequence we found
|
/* Double-check that the "__B_{DIGITS}+" sequence we found
|
is indeed followed by "__". */
|
is indeed followed by "__". */
|
if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
|
if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_')
|
i = k;
|
i = k;
|
}
|
}
|
|
|
/* Remove _E{DIGITS}+[sb] */
|
/* Remove _E{DIGITS}+[sb] */
|
|
|
/* Just as for protected object subprograms, there are 2 categories
|
/* Just as for protected object subprograms, there are 2 categories
|
of subprograms created by the compiler for each entry. The first
|
of subprograms created by the compiler for each entry. The first
|
one implements the actual entry code, and has a suffix following
|
one implements the actual entry code, and has a suffix following
|
the convention above; the second one implements the barrier and
|
the convention above; the second one implements the barrier and
|
uses the same convention as above, except that the 'E' is replaced
|
uses the same convention as above, except that the 'E' is replaced
|
by a 'B'.
|
by a 'B'.
|
|
|
Just as above, we do not decode the name of barrier functions
|
Just as above, we do not decode the name of barrier functions
|
to give the user a clue that the code he is debugging has been
|
to give the user a clue that the code he is debugging has been
|
internally generated. */
|
internally generated. */
|
|
|
if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
|
if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E'
|
&& isdigit (encoded[i+2]))
|
&& isdigit (encoded[i+2]))
|
{
|
{
|
int k = i + 3;
|
int k = i + 3;
|
|
|
while (k < len0 && isdigit (encoded[k]))
|
while (k < len0 && isdigit (encoded[k]))
|
k++;
|
k++;
|
|
|
if (k < len0
|
if (k < len0
|
&& (encoded[k] == 'b' || encoded[k] == 's'))
|
&& (encoded[k] == 'b' || encoded[k] == 's'))
|
{
|
{
|
k++;
|
k++;
|
/* Just as an extra precaution, make sure that if this
|
/* Just as an extra precaution, make sure that if this
|
suffix is followed by anything else, it is a '_'.
|
suffix is followed by anything else, it is a '_'.
|
Otherwise, we matched this sequence by accident. */
|
Otherwise, we matched this sequence by accident. */
|
if (k == len0
|
if (k == len0
|
|| (k < len0 && encoded[k] == '_'))
|
|| (k < len0 && encoded[k] == '_'))
|
i = k;
|
i = k;
|
}
|
}
|
}
|
}
|
|
|
/* Remove trailing "N" in [a-z0-9]+N__. The N is added by
|
/* Remove trailing "N" in [a-z0-9]+N__. The N is added by
|
the GNAT front-end in protected object subprograms. */
|
the GNAT front-end in protected object subprograms. */
|
|
|
if (i < len0 + 3
|
if (i < len0 + 3
|
&& encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
|
&& encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_')
|
{
|
{
|
/* Backtrack a bit up until we reach either the begining of
|
/* Backtrack a bit up until we reach either the begining of
|
the encoded name, or "__". Make sure that we only find
|
the encoded name, or "__". Make sure that we only find
|
digits or lowercase characters. */
|
digits or lowercase characters. */
|
const char *ptr = encoded + i - 1;
|
const char *ptr = encoded + i - 1;
|
|
|
while (ptr >= encoded && is_lower_alphanum (ptr[0]))
|
while (ptr >= encoded && is_lower_alphanum (ptr[0]))
|
ptr--;
|
ptr--;
|
if (ptr < encoded
|
if (ptr < encoded
|
|| (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
|
|| (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_'))
|
i++;
|
i++;
|
}
|
}
|
|
|
if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
|
if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1]))
|
{
|
{
|
/* This is a X[bn]* sequence not separated from the previous
|
/* This is a X[bn]* sequence not separated from the previous
|
part of the name with a non-alpha-numeric character (in other
|
part of the name with a non-alpha-numeric character (in other
|
words, immediately following an alpha-numeric character), then
|
words, immediately following an alpha-numeric character), then
|
verify that it is placed at the end of the encoded name. If
|
verify that it is placed at the end of the encoded name. If
|
not, then the encoding is not valid and we should abort the
|
not, then the encoding is not valid and we should abort the
|
decoding. Otherwise, just skip it, it is used in body-nested
|
decoding. Otherwise, just skip it, it is used in body-nested
|
package names. */
|
package names. */
|
do
|
do
|
i += 1;
|
i += 1;
|
while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
|
while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n'));
|
if (i < len0)
|
if (i < len0)
|
goto Suppress;
|
goto Suppress;
|
}
|
}
|
else if (!ADA_RETAIN_DOTS
|
else if (!ADA_RETAIN_DOTS
|
&& i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
|
&& i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_')
|
{
|
{
|
/* Replace '__' by '.'. */
|
/* Replace '__' by '.'. */
|
decoded[j] = '.';
|
decoded[j] = '.';
|
at_start_name = 1;
|
at_start_name = 1;
|
i += 2;
|
i += 2;
|
j += 1;
|
j += 1;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* It's a character part of the decoded name, so just copy it
|
/* It's a character part of the decoded name, so just copy it
|
over. */
|
over. */
|
decoded[j] = encoded[i];
|
decoded[j] = encoded[i];
|
i += 1;
|
i += 1;
|
j += 1;
|
j += 1;
|
}
|
}
|
}
|
}
|
decoded[j] = '\000';
|
decoded[j] = '\000';
|
|
|
/* Decoded names should never contain any uppercase character.
|
/* Decoded names should never contain any uppercase character.
|
Double-check this, and abort the decoding if we find one. */
|
Double-check this, and abort the decoding if we find one. */
|
|
|
for (i = 0; decoded[i] != '\0'; i += 1)
|
for (i = 0; decoded[i] != '\0'; i += 1)
|
if (isupper (decoded[i]) || decoded[i] == ' ')
|
if (isupper (decoded[i]) || decoded[i] == ' ')
|
goto Suppress;
|
goto Suppress;
|
|
|
if (strcmp (decoded, encoded) == 0)
|
if (strcmp (decoded, encoded) == 0)
|
return encoded;
|
return encoded;
|
else
|
else
|
return decoded;
|
return decoded;
|
|
|
Suppress:
|
Suppress:
|
GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
|
GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3);
|
decoded = decoding_buffer;
|
decoded = decoding_buffer;
|
if (encoded[0] == '<')
|
if (encoded[0] == '<')
|
strcpy (decoded, encoded);
|
strcpy (decoded, encoded);
|
else
|
else
|
sprintf (decoded, "<%s>", encoded);
|
sprintf (decoded, "<%s>", encoded);
|
return decoded;
|
return decoded;
|
|
|
}
|
}
|
|
|
/* Table for keeping permanent unique copies of decoded names. Once
|
/* Table for keeping permanent unique copies of decoded names. Once
|
allocated, names in this table are never released. While this is a
|
allocated, names in this table are never released. While this is a
|
storage leak, it should not be significant unless there are massive
|
storage leak, it should not be significant unless there are massive
|
changes in the set of decoded names in successive versions of a
|
changes in the set of decoded names in successive versions of a
|
symbol table loaded during a single session. */
|
symbol table loaded during a single session. */
|
static struct htab *decoded_names_store;
|
static struct htab *decoded_names_store;
|
|
|
/* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
|
/* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
|
in the language-specific part of GSYMBOL, if it has not been
|
in the language-specific part of GSYMBOL, if it has not been
|
previously computed. Tries to save the decoded name in the same
|
previously computed. Tries to save the decoded name in the same
|
obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
|
obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
|
in any case, the decoded symbol has a lifetime at least that of
|
in any case, the decoded symbol has a lifetime at least that of
|
GSYMBOL).
|
GSYMBOL).
|
The GSYMBOL parameter is "mutable" in the C++ sense: logically
|
The GSYMBOL parameter is "mutable" in the C++ sense: logically
|
const, but nevertheless modified to a semantically equivalent form
|
const, but nevertheless modified to a semantically equivalent form
|
when a decoded name is cached in it.
|
when a decoded name is cached in it.
|
*/
|
*/
|
|
|
char *
|
char *
|
ada_decode_symbol (const struct general_symbol_info *gsymbol)
|
ada_decode_symbol (const struct general_symbol_info *gsymbol)
|
{
|
{
|
char **resultp =
|
char **resultp =
|
(char **) &gsymbol->language_specific.cplus_specific.demangled_name;
|
(char **) &gsymbol->language_specific.cplus_specific.demangled_name;
|
if (*resultp == NULL)
|
if (*resultp == NULL)
|
{
|
{
|
const char *decoded = ada_decode (gsymbol->name);
|
const char *decoded = ada_decode (gsymbol->name);
|
if (gsymbol->bfd_section != NULL)
|
if (gsymbol->bfd_section != NULL)
|
{
|
{
|
bfd *obfd = gsymbol->bfd_section->owner;
|
bfd *obfd = gsymbol->bfd_section->owner;
|
if (obfd != NULL)
|
if (obfd != NULL)
|
{
|
{
|
struct objfile *objf;
|
struct objfile *objf;
|
ALL_OBJFILES (objf)
|
ALL_OBJFILES (objf)
|
{
|
{
|
if (obfd == objf->obfd)
|
if (obfd == objf->obfd)
|
{
|
{
|
*resultp = obsavestring (decoded, strlen (decoded),
|
*resultp = obsavestring (decoded, strlen (decoded),
|
&objf->objfile_obstack);
|
&objf->objfile_obstack);
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
/* Sometimes, we can't find a corresponding objfile, in which
|
/* Sometimes, we can't find a corresponding objfile, in which
|
case, we put the result on the heap. Since we only decode
|
case, we put the result on the heap. Since we only decode
|
when needed, we hope this usually does not cause a
|
when needed, we hope this usually does not cause a
|
significant memory leak (FIXME). */
|
significant memory leak (FIXME). */
|
if (*resultp == NULL)
|
if (*resultp == NULL)
|
{
|
{
|
char **slot = (char **) htab_find_slot (decoded_names_store,
|
char **slot = (char **) htab_find_slot (decoded_names_store,
|
decoded, INSERT);
|
decoded, INSERT);
|
if (*slot == NULL)
|
if (*slot == NULL)
|
*slot = xstrdup (decoded);
|
*slot = xstrdup (decoded);
|
*resultp = *slot;
|
*resultp = *slot;
|
}
|
}
|
}
|
}
|
|
|
return *resultp;
|
return *resultp;
|
}
|
}
|
|
|
char *
|
char *
|
ada_la_decode (const char *encoded, int options)
|
ada_la_decode (const char *encoded, int options)
|
{
|
{
|
return xstrdup (ada_decode (encoded));
|
return xstrdup (ada_decode (encoded));
|
}
|
}
|
|
|
/* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
|
/* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
|
suffixes that encode debugging information or leading _ada_ on
|
suffixes that encode debugging information or leading _ada_ on
|
SYM_NAME (see is_name_suffix commentary for the debugging
|
SYM_NAME (see is_name_suffix commentary for the debugging
|
information that is ignored). If WILD, then NAME need only match a
|
information that is ignored). If WILD, then NAME need only match a
|
suffix of SYM_NAME minus the same suffixes. Also returns 0 if
|
suffix of SYM_NAME minus the same suffixes. Also returns 0 if
|
either argument is NULL. */
|
either argument is NULL. */
|
|
|
int
|
int
|
ada_match_name (const char *sym_name, const char *name, int wild)
|
ada_match_name (const char *sym_name, const char *name, int wild)
|
{
|
{
|
if (sym_name == NULL || name == NULL)
|
if (sym_name == NULL || name == NULL)
|
return 0;
|
return 0;
|
else if (wild)
|
else if (wild)
|
return wild_match (name, strlen (name), sym_name);
|
return wild_match (name, strlen (name), sym_name);
|
else
|
else
|
{
|
{
|
int len_name = strlen (name);
|
int len_name = strlen (name);
|
return (strncmp (sym_name, name, len_name) == 0
|
return (strncmp (sym_name, name, len_name) == 0
|
&& is_name_suffix (sym_name + len_name))
|
&& is_name_suffix (sym_name + len_name))
|
|| (strncmp (sym_name, "_ada_", 5) == 0
|
|| (strncmp (sym_name, "_ada_", 5) == 0
|
&& strncmp (sym_name + 5, name, len_name) == 0
|
&& strncmp (sym_name + 5, name, len_name) == 0
|
&& is_name_suffix (sym_name + len_name + 5));
|
&& is_name_suffix (sym_name + len_name + 5));
|
}
|
}
|
}
|
}
|
|
|
/* True (non-zero) iff, in Ada mode, the symbol SYM should be
|
/* True (non-zero) iff, in Ada mode, the symbol SYM should be
|
suppressed in info listings. */
|
suppressed in info listings. */
|
|
|
int
|
int
|
ada_suppress_symbol_printing (struct symbol *sym)
|
ada_suppress_symbol_printing (struct symbol *sym)
|
{
|
{
|
if (SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN)
|
if (SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN)
|
return 1;
|
return 1;
|
else
|
else
|
return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym));
|
return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym));
|
}
|
}
|
|
|
|
|
/* Arrays */
|
/* Arrays */
|
|
|
/* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
|
/* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
|
|
|
static char *bound_name[] = {
|
static char *bound_name[] = {
|
"LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
|
"LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
|
"LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
|
"LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
|
};
|
};
|
|
|
/* Maximum number of array dimensions we are prepared to handle. */
|
/* Maximum number of array dimensions we are prepared to handle. */
|
|
|
#define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
|
#define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
|
|
|
/* Like modify_field, but allows bitpos > wordlength. */
|
/* Like modify_field, but allows bitpos > wordlength. */
|
|
|
static void
|
static void
|
modify_general_field (char *addr, LONGEST fieldval, int bitpos, int bitsize)
|
modify_general_field (char *addr, LONGEST fieldval, int bitpos, int bitsize)
|
{
|
{
|
modify_field (addr + bitpos / 8, fieldval, bitpos % 8, bitsize);
|
modify_field (addr + bitpos / 8, fieldval, bitpos % 8, bitsize);
|
}
|
}
|
|
|
|
|
/* The desc_* routines return primitive portions of array descriptors
|
/* The desc_* routines return primitive portions of array descriptors
|
(fat pointers). */
|
(fat pointers). */
|
|
|
/* The descriptor or array type, if any, indicated by TYPE; removes
|
/* The descriptor or array type, if any, indicated by TYPE; removes
|
level of indirection, if needed. */
|
level of indirection, if needed. */
|
|
|
static struct type *
|
static struct type *
|
desc_base_type (struct type *type)
|
desc_base_type (struct type *type)
|
{
|
{
|
if (type == NULL)
|
if (type == NULL)
|
return NULL;
|
return NULL;
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
if (type != NULL
|
if (type != NULL
|
&& (TYPE_CODE (type) == TYPE_CODE_PTR
|
&& (TYPE_CODE (type) == TYPE_CODE_PTR
|
|| TYPE_CODE (type) == TYPE_CODE_REF))
|
|| TYPE_CODE (type) == TYPE_CODE_REF))
|
return ada_check_typedef (TYPE_TARGET_TYPE (type));
|
return ada_check_typedef (TYPE_TARGET_TYPE (type));
|
else
|
else
|
return type;
|
return type;
|
}
|
}
|
|
|
/* True iff TYPE indicates a "thin" array pointer type. */
|
/* True iff TYPE indicates a "thin" array pointer type. */
|
|
|
static int
|
static int
|
is_thin_pntr (struct type *type)
|
is_thin_pntr (struct type *type)
|
{
|
{
|
return
|
return
|
is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
|
is_suffix (ada_type_name (desc_base_type (type)), "___XUT")
|
|| is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
|
|| is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE");
|
}
|
}
|
|
|
/* The descriptor type for thin pointer type TYPE. */
|
/* The descriptor type for thin pointer type TYPE. */
|
|
|
static struct type *
|
static struct type *
|
thin_descriptor_type (struct type *type)
|
thin_descriptor_type (struct type *type)
|
{
|
{
|
struct type *base_type = desc_base_type (type);
|
struct type *base_type = desc_base_type (type);
|
if (base_type == NULL)
|
if (base_type == NULL)
|
return NULL;
|
return NULL;
|
if (is_suffix (ada_type_name (base_type), "___XVE"))
|
if (is_suffix (ada_type_name (base_type), "___XVE"))
|
return base_type;
|
return base_type;
|
else
|
else
|
{
|
{
|
struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
|
struct type *alt_type = ada_find_parallel_type (base_type, "___XVE");
|
if (alt_type == NULL)
|
if (alt_type == NULL)
|
return base_type;
|
return base_type;
|
else
|
else
|
return alt_type;
|
return alt_type;
|
}
|
}
|
}
|
}
|
|
|
/* A pointer to the array data for thin-pointer value VAL. */
|
/* A pointer to the array data for thin-pointer value VAL. */
|
|
|
static struct value *
|
static struct value *
|
thin_data_pntr (struct value *val)
|
thin_data_pntr (struct value *val)
|
{
|
{
|
struct type *type = value_type (val);
|
struct type *type = value_type (val);
|
if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
return value_cast (desc_data_type (thin_descriptor_type (type)),
|
return value_cast (desc_data_type (thin_descriptor_type (type)),
|
value_copy (val));
|
value_copy (val));
|
else
|
else
|
return value_from_longest (desc_data_type (thin_descriptor_type (type)),
|
return value_from_longest (desc_data_type (thin_descriptor_type (type)),
|
VALUE_ADDRESS (val) + value_offset (val));
|
VALUE_ADDRESS (val) + value_offset (val));
|
}
|
}
|
|
|
/* True iff TYPE indicates a "thick" array pointer type. */
|
/* True iff TYPE indicates a "thick" array pointer type. */
|
|
|
static int
|
static int
|
is_thick_pntr (struct type *type)
|
is_thick_pntr (struct type *type)
|
{
|
{
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
|
return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT
|
&& lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
|
&& lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL);
|
}
|
}
|
|
|
/* If TYPE is the type of an array descriptor (fat or thin pointer) or a
|
/* If TYPE is the type of an array descriptor (fat or thin pointer) or a
|
pointer to one, the type of its bounds data; otherwise, NULL. */
|
pointer to one, the type of its bounds data; otherwise, NULL. */
|
|
|
static struct type *
|
static struct type *
|
desc_bounds_type (struct type *type)
|
desc_bounds_type (struct type *type)
|
{
|
{
|
struct type *r;
|
struct type *r;
|
|
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
if (type == NULL)
|
if (type == NULL)
|
return NULL;
|
return NULL;
|
else if (is_thin_pntr (type))
|
else if (is_thin_pntr (type))
|
{
|
{
|
type = thin_descriptor_type (type);
|
type = thin_descriptor_type (type);
|
if (type == NULL)
|
if (type == NULL)
|
return NULL;
|
return NULL;
|
r = lookup_struct_elt_type (type, "BOUNDS", 1);
|
r = lookup_struct_elt_type (type, "BOUNDS", 1);
|
if (r != NULL)
|
if (r != NULL)
|
return ada_check_typedef (r);
|
return ada_check_typedef (r);
|
}
|
}
|
else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
{
|
{
|
r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
|
r = lookup_struct_elt_type (type, "P_BOUNDS", 1);
|
if (r != NULL)
|
if (r != NULL)
|
return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
|
return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r)));
|
}
|
}
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* If ARR is an array descriptor (fat or thin pointer), or pointer to
|
/* If ARR is an array descriptor (fat or thin pointer), or pointer to
|
one, a pointer to its bounds data. Otherwise NULL. */
|
one, a pointer to its bounds data. Otherwise NULL. */
|
|
|
static struct value *
|
static struct value *
|
desc_bounds (struct value *arr)
|
desc_bounds (struct value *arr)
|
{
|
{
|
struct type *type = ada_check_typedef (value_type (arr));
|
struct type *type = ada_check_typedef (value_type (arr));
|
if (is_thin_pntr (type))
|
if (is_thin_pntr (type))
|
{
|
{
|
struct type *bounds_type =
|
struct type *bounds_type =
|
desc_bounds_type (thin_descriptor_type (type));
|
desc_bounds_type (thin_descriptor_type (type));
|
LONGEST addr;
|
LONGEST addr;
|
|
|
if (bounds_type == NULL)
|
if (bounds_type == NULL)
|
error (_("Bad GNAT array descriptor"));
|
error (_("Bad GNAT array descriptor"));
|
|
|
/* NOTE: The following calculation is not really kosher, but
|
/* NOTE: The following calculation is not really kosher, but
|
since desc_type is an XVE-encoded type (and shouldn't be),
|
since desc_type is an XVE-encoded type (and shouldn't be),
|
the correct calculation is a real pain. FIXME (and fix GCC). */
|
the correct calculation is a real pain. FIXME (and fix GCC). */
|
if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
addr = value_as_long (arr);
|
addr = value_as_long (arr);
|
else
|
else
|
addr = VALUE_ADDRESS (arr) + value_offset (arr);
|
addr = VALUE_ADDRESS (arr) + value_offset (arr);
|
|
|
return
|
return
|
value_from_longest (lookup_pointer_type (bounds_type),
|
value_from_longest (lookup_pointer_type (bounds_type),
|
addr - TYPE_LENGTH (bounds_type));
|
addr - TYPE_LENGTH (bounds_type));
|
}
|
}
|
|
|
else if (is_thick_pntr (type))
|
else if (is_thick_pntr (type))
|
return value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
|
return value_struct_elt (&arr, NULL, "P_BOUNDS", NULL,
|
_("Bad GNAT array descriptor"));
|
_("Bad GNAT array descriptor"));
|
else
|
else
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* If TYPE is the type of an array-descriptor (fat pointer), the bit
|
/* If TYPE is the type of an array-descriptor (fat pointer), the bit
|
position of the field containing the address of the bounds data. */
|
position of the field containing the address of the bounds data. */
|
|
|
static int
|
static int
|
fat_pntr_bounds_bitpos (struct type *type)
|
fat_pntr_bounds_bitpos (struct type *type)
|
{
|
{
|
return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
|
return TYPE_FIELD_BITPOS (desc_base_type (type), 1);
|
}
|
}
|
|
|
/* If TYPE is the type of an array-descriptor (fat pointer), the bit
|
/* If TYPE is the type of an array-descriptor (fat pointer), the bit
|
size of the field containing the address of the bounds data. */
|
size of the field containing the address of the bounds data. */
|
|
|
static int
|
static int
|
fat_pntr_bounds_bitsize (struct type *type)
|
fat_pntr_bounds_bitsize (struct type *type)
|
{
|
{
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
if (TYPE_FIELD_BITSIZE (type, 1) > 0)
|
if (TYPE_FIELD_BITSIZE (type, 1) > 0)
|
return TYPE_FIELD_BITSIZE (type, 1);
|
return TYPE_FIELD_BITSIZE (type, 1);
|
else
|
else
|
return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
|
return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1)));
|
}
|
}
|
|
|
/* If TYPE is the type of an array descriptor (fat or thin pointer) or a
|
/* If TYPE is the type of an array descriptor (fat or thin pointer) or a
|
pointer to one, the type of its array data (a
|
pointer to one, the type of its array data (a
|
pointer-to-array-with-no-bounds type); otherwise, NULL. Use
|
pointer-to-array-with-no-bounds type); otherwise, NULL. Use
|
ada_type_of_array to get an array type with bounds data. */
|
ada_type_of_array to get an array type with bounds data. */
|
|
|
static struct type *
|
static struct type *
|
desc_data_type (struct type *type)
|
desc_data_type (struct type *type)
|
{
|
{
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
/* NOTE: The following is bogus; see comment in desc_bounds. */
|
/* NOTE: The following is bogus; see comment in desc_bounds. */
|
if (is_thin_pntr (type))
|
if (is_thin_pntr (type))
|
return lookup_pointer_type
|
return lookup_pointer_type
|
(desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1)));
|
(desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1)));
|
else if (is_thick_pntr (type))
|
else if (is_thick_pntr (type))
|
return lookup_struct_elt_type (type, "P_ARRAY", 1);
|
return lookup_struct_elt_type (type, "P_ARRAY", 1);
|
else
|
else
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* If ARR is an array descriptor (fat or thin pointer), a pointer to
|
/* If ARR is an array descriptor (fat or thin pointer), a pointer to
|
its array data. */
|
its array data. */
|
|
|
static struct value *
|
static struct value *
|
desc_data (struct value *arr)
|
desc_data (struct value *arr)
|
{
|
{
|
struct type *type = value_type (arr);
|
struct type *type = value_type (arr);
|
if (is_thin_pntr (type))
|
if (is_thin_pntr (type))
|
return thin_data_pntr (arr);
|
return thin_data_pntr (arr);
|
else if (is_thick_pntr (type))
|
else if (is_thick_pntr (type))
|
return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
|
return value_struct_elt (&arr, NULL, "P_ARRAY", NULL,
|
_("Bad GNAT array descriptor"));
|
_("Bad GNAT array descriptor"));
|
else
|
else
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
|
|
/* If TYPE is the type of an array-descriptor (fat pointer), the bit
|
/* If TYPE is the type of an array-descriptor (fat pointer), the bit
|
position of the field containing the address of the data. */
|
position of the field containing the address of the data. */
|
|
|
static int
|
static int
|
fat_pntr_data_bitpos (struct type *type)
|
fat_pntr_data_bitpos (struct type *type)
|
{
|
{
|
return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
|
return TYPE_FIELD_BITPOS (desc_base_type (type), 0);
|
}
|
}
|
|
|
/* If TYPE is the type of an array-descriptor (fat pointer), the bit
|
/* If TYPE is the type of an array-descriptor (fat pointer), the bit
|
size of the field containing the address of the data. */
|
size of the field containing the address of the data. */
|
|
|
static int
|
static int
|
fat_pntr_data_bitsize (struct type *type)
|
fat_pntr_data_bitsize (struct type *type)
|
{
|
{
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
if (TYPE_FIELD_BITSIZE (type, 0) > 0)
|
if (TYPE_FIELD_BITSIZE (type, 0) > 0)
|
return TYPE_FIELD_BITSIZE (type, 0);
|
return TYPE_FIELD_BITSIZE (type, 0);
|
else
|
else
|
return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
|
return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0));
|
}
|
}
|
|
|
/* If BOUNDS is an array-bounds structure (or pointer to one), return
|
/* If BOUNDS is an array-bounds structure (or pointer to one), return
|
the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
|
the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
|
bound, if WHICH is 1. The first bound is I=1. */
|
bound, if WHICH is 1. The first bound is I=1. */
|
|
|
static struct value *
|
static struct value *
|
desc_one_bound (struct value *bounds, int i, int which)
|
desc_one_bound (struct value *bounds, int i, int which)
|
{
|
{
|
return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
|
return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL,
|
_("Bad GNAT array descriptor bounds"));
|
_("Bad GNAT array descriptor bounds"));
|
}
|
}
|
|
|
/* If BOUNDS is an array-bounds structure type, return the bit position
|
/* If BOUNDS is an array-bounds structure type, return the bit position
|
of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
|
of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
|
bound, if WHICH is 1. The first bound is I=1. */
|
bound, if WHICH is 1. The first bound is I=1. */
|
|
|
static int
|
static int
|
desc_bound_bitpos (struct type *type, int i, int which)
|
desc_bound_bitpos (struct type *type, int i, int which)
|
{
|
{
|
return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
|
return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2);
|
}
|
}
|
|
|
/* If BOUNDS is an array-bounds structure type, return the bit field size
|
/* If BOUNDS is an array-bounds structure type, return the bit field size
|
of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
|
of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
|
bound, if WHICH is 1. The first bound is I=1. */
|
bound, if WHICH is 1. The first bound is I=1. */
|
|
|
static int
|
static int
|
desc_bound_bitsize (struct type *type, int i, int which)
|
desc_bound_bitsize (struct type *type, int i, int which)
|
{
|
{
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
|
if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0)
|
return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
|
return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2);
|
else
|
else
|
return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
|
return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2));
|
}
|
}
|
|
|
/* If TYPE is the type of an array-bounds structure, the type of its
|
/* If TYPE is the type of an array-bounds structure, the type of its
|
Ith bound (numbering from 1). Otherwise, NULL. */
|
Ith bound (numbering from 1). Otherwise, NULL. */
|
|
|
static struct type *
|
static struct type *
|
desc_index_type (struct type *type, int i)
|
desc_index_type (struct type *type, int i)
|
{
|
{
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
|
return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1);
|
else
|
else
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* The number of index positions in the array-bounds type TYPE.
|
/* The number of index positions in the array-bounds type TYPE.
|
Return 0 if TYPE is NULL. */
|
Return 0 if TYPE is NULL. */
|
|
|
static int
|
static int
|
desc_arity (struct type *type)
|
desc_arity (struct type *type)
|
{
|
{
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
if (type != NULL)
|
if (type != NULL)
|
return TYPE_NFIELDS (type) / 2;
|
return TYPE_NFIELDS (type) / 2;
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Non-zero iff TYPE is a simple array type (not a pointer to one) or
|
/* Non-zero iff TYPE is a simple array type (not a pointer to one) or
|
an array descriptor type (representing an unconstrained array
|
an array descriptor type (representing an unconstrained array
|
type). */
|
type). */
|
|
|
static int
|
static int
|
ada_is_direct_array_type (struct type *type)
|
ada_is_direct_array_type (struct type *type)
|
{
|
{
|
if (type == NULL)
|
if (type == NULL)
|
return 0;
|
return 0;
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
return (TYPE_CODE (type) == TYPE_CODE_ARRAY
|
return (TYPE_CODE (type) == TYPE_CODE_ARRAY
|
|| ada_is_array_descriptor_type (type));
|
|| ada_is_array_descriptor_type (type));
|
}
|
}
|
|
|
/* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
|
/* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
|
* to one. */
|
* to one. */
|
|
|
int
|
int
|
ada_is_array_type (struct type *type)
|
ada_is_array_type (struct type *type)
|
{
|
{
|
while (type != NULL
|
while (type != NULL
|
&& (TYPE_CODE (type) == TYPE_CODE_PTR
|
&& (TYPE_CODE (type) == TYPE_CODE_PTR
|
|| TYPE_CODE (type) == TYPE_CODE_REF))
|
|| TYPE_CODE (type) == TYPE_CODE_REF))
|
type = TYPE_TARGET_TYPE (type);
|
type = TYPE_TARGET_TYPE (type);
|
return ada_is_direct_array_type (type);
|
return ada_is_direct_array_type (type);
|
}
|
}
|
|
|
/* Non-zero iff TYPE is a simple array type or pointer to one. */
|
/* Non-zero iff TYPE is a simple array type or pointer to one. */
|
|
|
int
|
int
|
ada_is_simple_array_type (struct type *type)
|
ada_is_simple_array_type (struct type *type)
|
{
|
{
|
if (type == NULL)
|
if (type == NULL)
|
return 0;
|
return 0;
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
return (TYPE_CODE (type) == TYPE_CODE_ARRAY
|
return (TYPE_CODE (type) == TYPE_CODE_ARRAY
|
|| (TYPE_CODE (type) == TYPE_CODE_PTR
|
|| (TYPE_CODE (type) == TYPE_CODE_PTR
|
&& TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY));
|
&& TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY));
|
}
|
}
|
|
|
/* Non-zero iff TYPE belongs to a GNAT array descriptor. */
|
/* Non-zero iff TYPE belongs to a GNAT array descriptor. */
|
|
|
int
|
int
|
ada_is_array_descriptor_type (struct type *type)
|
ada_is_array_descriptor_type (struct type *type)
|
{
|
{
|
struct type *data_type = desc_data_type (type);
|
struct type *data_type = desc_data_type (type);
|
|
|
if (type == NULL)
|
if (type == NULL)
|
return 0;
|
return 0;
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
return
|
return
|
data_type != NULL
|
data_type != NULL
|
&& ((TYPE_CODE (data_type) == TYPE_CODE_PTR
|
&& ((TYPE_CODE (data_type) == TYPE_CODE_PTR
|
&& TYPE_TARGET_TYPE (data_type) != NULL
|
&& TYPE_TARGET_TYPE (data_type) != NULL
|
&& TYPE_CODE (TYPE_TARGET_TYPE (data_type)) == TYPE_CODE_ARRAY)
|
&& TYPE_CODE (TYPE_TARGET_TYPE (data_type)) == TYPE_CODE_ARRAY)
|
|| TYPE_CODE (data_type) == TYPE_CODE_ARRAY)
|
|| TYPE_CODE (data_type) == TYPE_CODE_ARRAY)
|
&& desc_arity (desc_bounds_type (type)) > 0;
|
&& desc_arity (desc_bounds_type (type)) > 0;
|
}
|
}
|
|
|
/* Non-zero iff type is a partially mal-formed GNAT array
|
/* Non-zero iff type is a partially mal-formed GNAT array
|
descriptor. FIXME: This is to compensate for some problems with
|
descriptor. FIXME: This is to compensate for some problems with
|
debugging output from GNAT. Re-examine periodically to see if it
|
debugging output from GNAT. Re-examine periodically to see if it
|
is still needed. */
|
is still needed. */
|
|
|
int
|
int
|
ada_is_bogus_array_descriptor (struct type *type)
|
ada_is_bogus_array_descriptor (struct type *type)
|
{
|
{
|
return
|
return
|
type != NULL
|
type != NULL
|
&& TYPE_CODE (type) == TYPE_CODE_STRUCT
|
&& TYPE_CODE (type) == TYPE_CODE_STRUCT
|
&& (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
|
&& (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL
|
|| lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
|
|| lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL)
|
&& !ada_is_array_descriptor_type (type);
|
&& !ada_is_array_descriptor_type (type);
|
}
|
}
|
|
|
|
|
/* If ARR has a record type in the form of a standard GNAT array descriptor,
|
/* If ARR has a record type in the form of a standard GNAT array descriptor,
|
(fat pointer) returns the type of the array data described---specifically,
|
(fat pointer) returns the type of the array data described---specifically,
|
a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
|
a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
|
in from the descriptor; otherwise, they are left unspecified. If
|
in from the descriptor; otherwise, they are left unspecified. If
|
the ARR denotes a null array descriptor and BOUNDS is non-zero,
|
the ARR denotes a null array descriptor and BOUNDS is non-zero,
|
returns NULL. The result is simply the type of ARR if ARR is not
|
returns NULL. The result is simply the type of ARR if ARR is not
|
a descriptor. */
|
a descriptor. */
|
struct type *
|
struct type *
|
ada_type_of_array (struct value *arr, int bounds)
|
ada_type_of_array (struct value *arr, int bounds)
|
{
|
{
|
if (ada_is_packed_array_type (value_type (arr)))
|
if (ada_is_packed_array_type (value_type (arr)))
|
return decode_packed_array_type (value_type (arr));
|
return decode_packed_array_type (value_type (arr));
|
|
|
if (!ada_is_array_descriptor_type (value_type (arr)))
|
if (!ada_is_array_descriptor_type (value_type (arr)))
|
return value_type (arr);
|
return value_type (arr);
|
|
|
if (!bounds)
|
if (!bounds)
|
return
|
return
|
ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr))));
|
ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr))));
|
else
|
else
|
{
|
{
|
struct type *elt_type;
|
struct type *elt_type;
|
int arity;
|
int arity;
|
struct value *descriptor;
|
struct value *descriptor;
|
struct objfile *objf = TYPE_OBJFILE (value_type (arr));
|
struct objfile *objf = TYPE_OBJFILE (value_type (arr));
|
|
|
elt_type = ada_array_element_type (value_type (arr), -1);
|
elt_type = ada_array_element_type (value_type (arr), -1);
|
arity = ada_array_arity (value_type (arr));
|
arity = ada_array_arity (value_type (arr));
|
|
|
if (elt_type == NULL || arity == 0)
|
if (elt_type == NULL || arity == 0)
|
return ada_check_typedef (value_type (arr));
|
return ada_check_typedef (value_type (arr));
|
|
|
descriptor = desc_bounds (arr);
|
descriptor = desc_bounds (arr);
|
if (value_as_long (descriptor) == 0)
|
if (value_as_long (descriptor) == 0)
|
return NULL;
|
return NULL;
|
while (arity > 0)
|
while (arity > 0)
|
{
|
{
|
struct type *range_type = alloc_type (objf);
|
struct type *range_type = alloc_type (objf);
|
struct type *array_type = alloc_type (objf);
|
struct type *array_type = alloc_type (objf);
|
struct value *low = desc_one_bound (descriptor, arity, 0);
|
struct value *low = desc_one_bound (descriptor, arity, 0);
|
struct value *high = desc_one_bound (descriptor, arity, 1);
|
struct value *high = desc_one_bound (descriptor, arity, 1);
|
arity -= 1;
|
arity -= 1;
|
|
|
create_range_type (range_type, value_type (low),
|
create_range_type (range_type, value_type (low),
|
longest_to_int (value_as_long (low)),
|
longest_to_int (value_as_long (low)),
|
longest_to_int (value_as_long (high)));
|
longest_to_int (value_as_long (high)));
|
elt_type = create_array_type (array_type, elt_type, range_type);
|
elt_type = create_array_type (array_type, elt_type, range_type);
|
}
|
}
|
|
|
return lookup_pointer_type (elt_type);
|
return lookup_pointer_type (elt_type);
|
}
|
}
|
}
|
}
|
|
|
/* If ARR does not represent an array, returns ARR unchanged.
|
/* If ARR does not represent an array, returns ARR unchanged.
|
Otherwise, returns either a standard GDB array with bounds set
|
Otherwise, returns either a standard GDB array with bounds set
|
appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
|
appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
|
GDB array. Returns NULL if ARR is a null fat pointer. */
|
GDB array. Returns NULL if ARR is a null fat pointer. */
|
|
|
struct value *
|
struct value *
|
ada_coerce_to_simple_array_ptr (struct value *arr)
|
ada_coerce_to_simple_array_ptr (struct value *arr)
|
{
|
{
|
if (ada_is_array_descriptor_type (value_type (arr)))
|
if (ada_is_array_descriptor_type (value_type (arr)))
|
{
|
{
|
struct type *arrType = ada_type_of_array (arr, 1);
|
struct type *arrType = ada_type_of_array (arr, 1);
|
if (arrType == NULL)
|
if (arrType == NULL)
|
return NULL;
|
return NULL;
|
return value_cast (arrType, value_copy (desc_data (arr)));
|
return value_cast (arrType, value_copy (desc_data (arr)));
|
}
|
}
|
else if (ada_is_packed_array_type (value_type (arr)))
|
else if (ada_is_packed_array_type (value_type (arr)))
|
return decode_packed_array (arr);
|
return decode_packed_array (arr);
|
else
|
else
|
return arr;
|
return arr;
|
}
|
}
|
|
|
/* If ARR does not represent an array, returns ARR unchanged.
|
/* If ARR does not represent an array, returns ARR unchanged.
|
Otherwise, returns a standard GDB array describing ARR (which may
|
Otherwise, returns a standard GDB array describing ARR (which may
|
be ARR itself if it already is in the proper form). */
|
be ARR itself if it already is in the proper form). */
|
|
|
static struct value *
|
static struct value *
|
ada_coerce_to_simple_array (struct value *arr)
|
ada_coerce_to_simple_array (struct value *arr)
|
{
|
{
|
if (ada_is_array_descriptor_type (value_type (arr)))
|
if (ada_is_array_descriptor_type (value_type (arr)))
|
{
|
{
|
struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
|
struct value *arrVal = ada_coerce_to_simple_array_ptr (arr);
|
if (arrVal == NULL)
|
if (arrVal == NULL)
|
error (_("Bounds unavailable for null array pointer."));
|
error (_("Bounds unavailable for null array pointer."));
|
check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
|
check_size (TYPE_TARGET_TYPE (value_type (arrVal)));
|
return value_ind (arrVal);
|
return value_ind (arrVal);
|
}
|
}
|
else if (ada_is_packed_array_type (value_type (arr)))
|
else if (ada_is_packed_array_type (value_type (arr)))
|
return decode_packed_array (arr);
|
return decode_packed_array (arr);
|
else
|
else
|
return arr;
|
return arr;
|
}
|
}
|
|
|
/* If TYPE represents a GNAT array type, return it translated to an
|
/* If TYPE represents a GNAT array type, return it translated to an
|
ordinary GDB array type (possibly with BITSIZE fields indicating
|
ordinary GDB array type (possibly with BITSIZE fields indicating
|
packing). For other types, is the identity. */
|
packing). For other types, is the identity. */
|
|
|
struct type *
|
struct type *
|
ada_coerce_to_simple_array_type (struct type *type)
|
ada_coerce_to_simple_array_type (struct type *type)
|
{
|
{
|
struct value *mark = value_mark ();
|
struct value *mark = value_mark ();
|
struct value *dummy = value_from_longest (builtin_type_long, 0);
|
struct value *dummy = value_from_longest (builtin_type_long, 0);
|
struct type *result;
|
struct type *result;
|
deprecated_set_value_type (dummy, type);
|
deprecated_set_value_type (dummy, type);
|
result = ada_type_of_array (dummy, 0);
|
result = ada_type_of_array (dummy, 0);
|
value_free_to_mark (mark);
|
value_free_to_mark (mark);
|
return result;
|
return result;
|
}
|
}
|
|
|
/* Non-zero iff TYPE represents a standard GNAT packed-array type. */
|
/* Non-zero iff TYPE represents a standard GNAT packed-array type. */
|
|
|
int
|
int
|
ada_is_packed_array_type (struct type *type)
|
ada_is_packed_array_type (struct type *type)
|
{
|
{
|
if (type == NULL)
|
if (type == NULL)
|
return 0;
|
return 0;
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
return
|
return
|
ada_type_name (type) != NULL
|
ada_type_name (type) != NULL
|
&& strstr (ada_type_name (type), "___XP") != NULL;
|
&& strstr (ada_type_name (type), "___XP") != NULL;
|
}
|
}
|
|
|
/* Given that TYPE is a standard GDB array type with all bounds filled
|
/* Given that TYPE is a standard GDB array type with all bounds filled
|
in, and that the element size of its ultimate scalar constituents
|
in, and that the element size of its ultimate scalar constituents
|
(that is, either its elements, or, if it is an array of arrays, its
|
(that is, either its elements, or, if it is an array of arrays, its
|
elements' elements, etc.) is *ELT_BITS, return an identical type,
|
elements' elements, etc.) is *ELT_BITS, return an identical type,
|
but with the bit sizes of its elements (and those of any
|
but with the bit sizes of its elements (and those of any
|
constituent arrays) recorded in the BITSIZE components of its
|
constituent arrays) recorded in the BITSIZE components of its
|
TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
|
TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
|
in bits. */
|
in bits. */
|
|
|
static struct type *
|
static struct type *
|
packed_array_type (struct type *type, long *elt_bits)
|
packed_array_type (struct type *type, long *elt_bits)
|
{
|
{
|
struct type *new_elt_type;
|
struct type *new_elt_type;
|
struct type *new_type;
|
struct type *new_type;
|
LONGEST low_bound, high_bound;
|
LONGEST low_bound, high_bound;
|
|
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
|
if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
|
return type;
|
return type;
|
|
|
new_type = alloc_type (TYPE_OBJFILE (type));
|
new_type = alloc_type (TYPE_OBJFILE (type));
|
new_elt_type = packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
|
new_elt_type = packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)),
|
elt_bits);
|
elt_bits);
|
create_array_type (new_type, new_elt_type, TYPE_FIELD_TYPE (type, 0));
|
create_array_type (new_type, new_elt_type, TYPE_FIELD_TYPE (type, 0));
|
TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
|
TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits;
|
TYPE_NAME (new_type) = ada_type_name (type);
|
TYPE_NAME (new_type) = ada_type_name (type);
|
|
|
if (get_discrete_bounds (TYPE_FIELD_TYPE (type, 0),
|
if (get_discrete_bounds (TYPE_FIELD_TYPE (type, 0),
|
&low_bound, &high_bound) < 0)
|
&low_bound, &high_bound) < 0)
|
low_bound = high_bound = 0;
|
low_bound = high_bound = 0;
|
if (high_bound < low_bound)
|
if (high_bound < low_bound)
|
*elt_bits = TYPE_LENGTH (new_type) = 0;
|
*elt_bits = TYPE_LENGTH (new_type) = 0;
|
else
|
else
|
{
|
{
|
*elt_bits *= (high_bound - low_bound + 1);
|
*elt_bits *= (high_bound - low_bound + 1);
|
TYPE_LENGTH (new_type) =
|
TYPE_LENGTH (new_type) =
|
(*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
|
(*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
|
}
|
}
|
|
|
TYPE_FLAGS (new_type) |= TYPE_FLAG_FIXED_INSTANCE;
|
TYPE_FLAGS (new_type) |= TYPE_FLAG_FIXED_INSTANCE;
|
return new_type;
|
return new_type;
|
}
|
}
|
|
|
/* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
|
/* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
|
|
|
static struct type *
|
static struct type *
|
decode_packed_array_type (struct type *type)
|
decode_packed_array_type (struct type *type)
|
{
|
{
|
struct symbol *sym;
|
struct symbol *sym;
|
struct block **blocks;
|
struct block **blocks;
|
char *raw_name = ada_type_name (ada_check_typedef (type));
|
char *raw_name = ada_type_name (ada_check_typedef (type));
|
char *name;
|
char *name;
|
char *tail;
|
char *tail;
|
struct type *shadow_type;
|
struct type *shadow_type;
|
long bits;
|
long bits;
|
int i, n;
|
int i, n;
|
|
|
if (!raw_name)
|
if (!raw_name)
|
raw_name = ada_type_name (desc_base_type (type));
|
raw_name = ada_type_name (desc_base_type (type));
|
|
|
if (!raw_name)
|
if (!raw_name)
|
return NULL;
|
return NULL;
|
|
|
name = (char *) alloca (strlen (raw_name) + 1);
|
name = (char *) alloca (strlen (raw_name) + 1);
|
tail = strstr (raw_name, "___XP");
|
tail = strstr (raw_name, "___XP");
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
memcpy (name, raw_name, tail - raw_name);
|
memcpy (name, raw_name, tail - raw_name);
|
name[tail - raw_name] = '\000';
|
name[tail - raw_name] = '\000';
|
|
|
sym = standard_lookup (name, get_selected_block (0), VAR_DOMAIN);
|
sym = standard_lookup (name, get_selected_block (0), VAR_DOMAIN);
|
if (sym == NULL || SYMBOL_TYPE (sym) == NULL)
|
if (sym == NULL || SYMBOL_TYPE (sym) == NULL)
|
{
|
{
|
lim_warning (_("could not find bounds information on packed array"));
|
lim_warning (_("could not find bounds information on packed array"));
|
return NULL;
|
return NULL;
|
}
|
}
|
shadow_type = SYMBOL_TYPE (sym);
|
shadow_type = SYMBOL_TYPE (sym);
|
|
|
if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
|
if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY)
|
{
|
{
|
lim_warning (_("could not understand bounds information on packed array"));
|
lim_warning (_("could not understand bounds information on packed array"));
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
|
if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1)
|
{
|
{
|
lim_warning
|
lim_warning
|
(_("could not understand bit size information on packed array"));
|
(_("could not understand bit size information on packed array"));
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
return packed_array_type (shadow_type, &bits);
|
return packed_array_type (shadow_type, &bits);
|
}
|
}
|
|
|
/* Given that ARR is a struct value *indicating a GNAT packed array,
|
/* Given that ARR is a struct value *indicating a GNAT packed array,
|
returns a simple array that denotes that array. Its type is a
|
returns a simple array that denotes that array. Its type is a
|
standard GDB array type except that the BITSIZEs of the array
|
standard GDB array type except that the BITSIZEs of the array
|
target types are set to the number of bits in each element, and the
|
target types are set to the number of bits in each element, and the
|
type length is set appropriately. */
|
type length is set appropriately. */
|
|
|
static struct value *
|
static struct value *
|
decode_packed_array (struct value *arr)
|
decode_packed_array (struct value *arr)
|
{
|
{
|
struct type *type;
|
struct type *type;
|
|
|
arr = ada_coerce_ref (arr);
|
arr = ada_coerce_ref (arr);
|
if (TYPE_CODE (value_type (arr)) == TYPE_CODE_PTR)
|
if (TYPE_CODE (value_type (arr)) == TYPE_CODE_PTR)
|
arr = ada_value_ind (arr);
|
arr = ada_value_ind (arr);
|
|
|
type = decode_packed_array_type (value_type (arr));
|
type = decode_packed_array_type (value_type (arr));
|
if (type == NULL)
|
if (type == NULL)
|
{
|
{
|
error (_("can't unpack array"));
|
error (_("can't unpack array"));
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
if (gdbarch_bits_big_endian (current_gdbarch)
|
if (gdbarch_bits_big_endian (current_gdbarch)
|
&& ada_is_modular_type (value_type (arr)))
|
&& ada_is_modular_type (value_type (arr)))
|
{
|
{
|
/* This is a (right-justified) modular type representing a packed
|
/* This is a (right-justified) modular type representing a packed
|
array with no wrapper. In order to interpret the value through
|
array with no wrapper. In order to interpret the value through
|
the (left-justified) packed array type we just built, we must
|
the (left-justified) packed array type we just built, we must
|
first left-justify it. */
|
first left-justify it. */
|
int bit_size, bit_pos;
|
int bit_size, bit_pos;
|
ULONGEST mod;
|
ULONGEST mod;
|
|
|
mod = ada_modulus (value_type (arr)) - 1;
|
mod = ada_modulus (value_type (arr)) - 1;
|
bit_size = 0;
|
bit_size = 0;
|
while (mod > 0)
|
while (mod > 0)
|
{
|
{
|
bit_size += 1;
|
bit_size += 1;
|
mod >>= 1;
|
mod >>= 1;
|
}
|
}
|
bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
|
bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size;
|
arr = ada_value_primitive_packed_val (arr, NULL,
|
arr = ada_value_primitive_packed_val (arr, NULL,
|
bit_pos / HOST_CHAR_BIT,
|
bit_pos / HOST_CHAR_BIT,
|
bit_pos % HOST_CHAR_BIT,
|
bit_pos % HOST_CHAR_BIT,
|
bit_size,
|
bit_size,
|
type);
|
type);
|
}
|
}
|
|
|
return coerce_unspec_val_to_type (arr, type);
|
return coerce_unspec_val_to_type (arr, type);
|
}
|
}
|
|
|
|
|
/* The value of the element of packed array ARR at the ARITY indices
|
/* The value of the element of packed array ARR at the ARITY indices
|
given in IND. ARR must be a simple array. */
|
given in IND. ARR must be a simple array. */
|
|
|
static struct value *
|
static struct value *
|
value_subscript_packed (struct value *arr, int arity, struct value **ind)
|
value_subscript_packed (struct value *arr, int arity, struct value **ind)
|
{
|
{
|
int i;
|
int i;
|
int bits, elt_off, bit_off;
|
int bits, elt_off, bit_off;
|
long elt_total_bit_offset;
|
long elt_total_bit_offset;
|
struct type *elt_type;
|
struct type *elt_type;
|
struct value *v;
|
struct value *v;
|
|
|
bits = 0;
|
bits = 0;
|
elt_total_bit_offset = 0;
|
elt_total_bit_offset = 0;
|
elt_type = ada_check_typedef (value_type (arr));
|
elt_type = ada_check_typedef (value_type (arr));
|
for (i = 0; i < arity; i += 1)
|
for (i = 0; i < arity; i += 1)
|
{
|
{
|
if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
|
if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY
|
|| TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
|
|| TYPE_FIELD_BITSIZE (elt_type, 0) == 0)
|
error
|
error
|
(_("attempt to do packed indexing of something other than a packed array"));
|
(_("attempt to do packed indexing of something other than a packed array"));
|
else
|
else
|
{
|
{
|
struct type *range_type = TYPE_INDEX_TYPE (elt_type);
|
struct type *range_type = TYPE_INDEX_TYPE (elt_type);
|
LONGEST lowerbound, upperbound;
|
LONGEST lowerbound, upperbound;
|
LONGEST idx;
|
LONGEST idx;
|
|
|
if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
|
if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
|
{
|
{
|
lim_warning (_("don't know bounds of array"));
|
lim_warning (_("don't know bounds of array"));
|
lowerbound = upperbound = 0;
|
lowerbound = upperbound = 0;
|
}
|
}
|
|
|
idx = value_as_long (value_pos_atr (ind[i]));
|
idx = value_as_long (value_pos_atr (ind[i]));
|
if (idx < lowerbound || idx > upperbound)
|
if (idx < lowerbound || idx > upperbound)
|
lim_warning (_("packed array index %ld out of bounds"), (long) idx);
|
lim_warning (_("packed array index %ld out of bounds"), (long) idx);
|
bits = TYPE_FIELD_BITSIZE (elt_type, 0);
|
bits = TYPE_FIELD_BITSIZE (elt_type, 0);
|
elt_total_bit_offset += (idx - lowerbound) * bits;
|
elt_total_bit_offset += (idx - lowerbound) * bits;
|
elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
|
elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type));
|
}
|
}
|
}
|
}
|
elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
|
elt_off = elt_total_bit_offset / HOST_CHAR_BIT;
|
bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
|
bit_off = elt_total_bit_offset % HOST_CHAR_BIT;
|
|
|
v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
|
v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off,
|
bits, elt_type);
|
bits, elt_type);
|
return v;
|
return v;
|
}
|
}
|
|
|
/* Non-zero iff TYPE includes negative integer values. */
|
/* Non-zero iff TYPE includes negative integer values. */
|
|
|
static int
|
static int
|
has_negatives (struct type *type)
|
has_negatives (struct type *type)
|
{
|
{
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
default:
|
default:
|
return 0;
|
return 0;
|
case TYPE_CODE_INT:
|
case TYPE_CODE_INT:
|
return !TYPE_UNSIGNED (type);
|
return !TYPE_UNSIGNED (type);
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_RANGE:
|
return TYPE_LOW_BOUND (type) < 0;
|
return TYPE_LOW_BOUND (type) < 0;
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Create a new value of type TYPE from the contents of OBJ starting
|
/* Create a new value of type TYPE from the contents of OBJ starting
|
at byte OFFSET, and bit offset BIT_OFFSET within that byte,
|
at byte OFFSET, and bit offset BIT_OFFSET within that byte,
|
proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
|
proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
|
assigning through the result will set the field fetched from.
|
assigning through the result will set the field fetched from.
|
VALADDR is ignored unless OBJ is NULL, in which case,
|
VALADDR is ignored unless OBJ is NULL, in which case,
|
VALADDR+OFFSET must address the start of storage containing the
|
VALADDR+OFFSET must address the start of storage containing the
|
packed value. The value returned in this case is never an lval.
|
packed value. The value returned in this case is never an lval.
|
Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
|
Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
|
|
|
struct value *
|
struct value *
|
ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
|
ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr,
|
long offset, int bit_offset, int bit_size,
|
long offset, int bit_offset, int bit_size,
|
struct type *type)
|
struct type *type)
|
{
|
{
|
struct value *v;
|
struct value *v;
|
int src, /* Index into the source area */
|
int src, /* Index into the source area */
|
targ, /* Index into the target area */
|
targ, /* Index into the target area */
|
srcBitsLeft, /* Number of source bits left to move */
|
srcBitsLeft, /* Number of source bits left to move */
|
nsrc, ntarg, /* Number of source and target bytes */
|
nsrc, ntarg, /* Number of source and target bytes */
|
unusedLS, /* Number of bits in next significant
|
unusedLS, /* Number of bits in next significant
|
byte of source that are unused */
|
byte of source that are unused */
|
accumSize; /* Number of meaningful bits in accum */
|
accumSize; /* Number of meaningful bits in accum */
|
unsigned char *bytes; /* First byte containing data to unpack */
|
unsigned char *bytes; /* First byte containing data to unpack */
|
unsigned char *unpacked;
|
unsigned char *unpacked;
|
unsigned long accum; /* Staging area for bits being transferred */
|
unsigned long accum; /* Staging area for bits being transferred */
|
unsigned char sign;
|
unsigned char sign;
|
int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
|
int len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8;
|
/* Transmit bytes from least to most significant; delta is the direction
|
/* Transmit bytes from least to most significant; delta is the direction
|
the indices move. */
|
the indices move. */
|
int delta = gdbarch_bits_big_endian (current_gdbarch) ? -1 : 1;
|
int delta = gdbarch_bits_big_endian (current_gdbarch) ? -1 : 1;
|
|
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
|
|
if (obj == NULL)
|
if (obj == NULL)
|
{
|
{
|
v = allocate_value (type);
|
v = allocate_value (type);
|
bytes = (unsigned char *) (valaddr + offset);
|
bytes = (unsigned char *) (valaddr + offset);
|
}
|
}
|
else if (value_lazy (obj))
|
else if (value_lazy (obj))
|
{
|
{
|
v = value_at (type,
|
v = value_at (type,
|
VALUE_ADDRESS (obj) + value_offset (obj) + offset);
|
VALUE_ADDRESS (obj) + value_offset (obj) + offset);
|
bytes = (unsigned char *) alloca (len);
|
bytes = (unsigned char *) alloca (len);
|
read_memory (VALUE_ADDRESS (v), bytes, len);
|
read_memory (VALUE_ADDRESS (v), bytes, len);
|
}
|
}
|
else
|
else
|
{
|
{
|
v = allocate_value (type);
|
v = allocate_value (type);
|
bytes = (unsigned char *) value_contents (obj) + offset;
|
bytes = (unsigned char *) value_contents (obj) + offset;
|
}
|
}
|
|
|
if (obj != NULL)
|
if (obj != NULL)
|
{
|
{
|
VALUE_LVAL (v) = VALUE_LVAL (obj);
|
VALUE_LVAL (v) = VALUE_LVAL (obj);
|
if (VALUE_LVAL (obj) == lval_internalvar)
|
if (VALUE_LVAL (obj) == lval_internalvar)
|
VALUE_LVAL (v) = lval_internalvar_component;
|
VALUE_LVAL (v) = lval_internalvar_component;
|
VALUE_ADDRESS (v) = VALUE_ADDRESS (obj) + value_offset (obj) + offset;
|
VALUE_ADDRESS (v) = VALUE_ADDRESS (obj) + value_offset (obj) + offset;
|
set_value_bitpos (v, bit_offset + value_bitpos (obj));
|
set_value_bitpos (v, bit_offset + value_bitpos (obj));
|
set_value_bitsize (v, bit_size);
|
set_value_bitsize (v, bit_size);
|
if (value_bitpos (v) >= HOST_CHAR_BIT)
|
if (value_bitpos (v) >= HOST_CHAR_BIT)
|
{
|
{
|
VALUE_ADDRESS (v) += 1;
|
VALUE_ADDRESS (v) += 1;
|
set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
|
set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT);
|
}
|
}
|
}
|
}
|
else
|
else
|
set_value_bitsize (v, bit_size);
|
set_value_bitsize (v, bit_size);
|
unpacked = (unsigned char *) value_contents (v);
|
unpacked = (unsigned char *) value_contents (v);
|
|
|
srcBitsLeft = bit_size;
|
srcBitsLeft = bit_size;
|
nsrc = len;
|
nsrc = len;
|
ntarg = TYPE_LENGTH (type);
|
ntarg = TYPE_LENGTH (type);
|
sign = 0;
|
sign = 0;
|
if (bit_size == 0)
|
if (bit_size == 0)
|
{
|
{
|
memset (unpacked, 0, TYPE_LENGTH (type));
|
memset (unpacked, 0, TYPE_LENGTH (type));
|
return v;
|
return v;
|
}
|
}
|
else if (gdbarch_bits_big_endian (current_gdbarch))
|
else if (gdbarch_bits_big_endian (current_gdbarch))
|
{
|
{
|
src = len - 1;
|
src = len - 1;
|
if (has_negatives (type)
|
if (has_negatives (type)
|
&& ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
|
&& ((bytes[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1))))
|
sign = ~0;
|
sign = ~0;
|
|
|
unusedLS =
|
unusedLS =
|
(HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
|
(HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT)
|
% HOST_CHAR_BIT;
|
% HOST_CHAR_BIT;
|
|
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
case TYPE_CODE_ARRAY:
|
case TYPE_CODE_ARRAY:
|
case TYPE_CODE_UNION:
|
case TYPE_CODE_UNION:
|
case TYPE_CODE_STRUCT:
|
case TYPE_CODE_STRUCT:
|
/* Non-scalar values must be aligned at a byte boundary... */
|
/* Non-scalar values must be aligned at a byte boundary... */
|
accumSize =
|
accumSize =
|
(HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
|
(HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT;
|
/* ... And are placed at the beginning (most-significant) bytes
|
/* ... And are placed at the beginning (most-significant) bytes
|
of the target. */
|
of the target. */
|
targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
|
targ = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1;
|
break;
|
break;
|
default:
|
default:
|
accumSize = 0;
|
accumSize = 0;
|
targ = TYPE_LENGTH (type) - 1;
|
targ = TYPE_LENGTH (type) - 1;
|
break;
|
break;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
|
int sign_bit_offset = (bit_size + bit_offset - 1) % 8;
|
|
|
src = targ = 0;
|
src = targ = 0;
|
unusedLS = bit_offset;
|
unusedLS = bit_offset;
|
accumSize = 0;
|
accumSize = 0;
|
|
|
if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
|
if (has_negatives (type) && (bytes[len - 1] & (1 << sign_bit_offset)))
|
sign = ~0;
|
sign = ~0;
|
}
|
}
|
|
|
accum = 0;
|
accum = 0;
|
while (nsrc > 0)
|
while (nsrc > 0)
|
{
|
{
|
/* Mask for removing bits of the next source byte that are not
|
/* Mask for removing bits of the next source byte that are not
|
part of the value. */
|
part of the value. */
|
unsigned int unusedMSMask =
|
unsigned int unusedMSMask =
|
(1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
|
(1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) -
|
1;
|
1;
|
/* Sign-extend bits for this byte. */
|
/* Sign-extend bits for this byte. */
|
unsigned int signMask = sign & ~unusedMSMask;
|
unsigned int signMask = sign & ~unusedMSMask;
|
accum |=
|
accum |=
|
(((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
|
(((bytes[src] >> unusedLS) & unusedMSMask) | signMask) << accumSize;
|
accumSize += HOST_CHAR_BIT - unusedLS;
|
accumSize += HOST_CHAR_BIT - unusedLS;
|
if (accumSize >= HOST_CHAR_BIT)
|
if (accumSize >= HOST_CHAR_BIT)
|
{
|
{
|
unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
|
unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
|
accumSize -= HOST_CHAR_BIT;
|
accumSize -= HOST_CHAR_BIT;
|
accum >>= HOST_CHAR_BIT;
|
accum >>= HOST_CHAR_BIT;
|
ntarg -= 1;
|
ntarg -= 1;
|
targ += delta;
|
targ += delta;
|
}
|
}
|
srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
|
srcBitsLeft -= HOST_CHAR_BIT - unusedLS;
|
unusedLS = 0;
|
unusedLS = 0;
|
nsrc -= 1;
|
nsrc -= 1;
|
src += delta;
|
src += delta;
|
}
|
}
|
while (ntarg > 0)
|
while (ntarg > 0)
|
{
|
{
|
accum |= sign << accumSize;
|
accum |= sign << accumSize;
|
unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
|
unpacked[targ] = accum & ~(~0L << HOST_CHAR_BIT);
|
accumSize -= HOST_CHAR_BIT;
|
accumSize -= HOST_CHAR_BIT;
|
accum >>= HOST_CHAR_BIT;
|
accum >>= HOST_CHAR_BIT;
|
ntarg -= 1;
|
ntarg -= 1;
|
targ += delta;
|
targ += delta;
|
}
|
}
|
|
|
return v;
|
return v;
|
}
|
}
|
|
|
/* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
|
/* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
|
TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
|
TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
|
not overlap. */
|
not overlap. */
|
static void
|
static void
|
move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
|
move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source,
|
int src_offset, int n)
|
int src_offset, int n)
|
{
|
{
|
unsigned int accum, mask;
|
unsigned int accum, mask;
|
int accum_bits, chunk_size;
|
int accum_bits, chunk_size;
|
|
|
target += targ_offset / HOST_CHAR_BIT;
|
target += targ_offset / HOST_CHAR_BIT;
|
targ_offset %= HOST_CHAR_BIT;
|
targ_offset %= HOST_CHAR_BIT;
|
source += src_offset / HOST_CHAR_BIT;
|
source += src_offset / HOST_CHAR_BIT;
|
src_offset %= HOST_CHAR_BIT;
|
src_offset %= HOST_CHAR_BIT;
|
if (gdbarch_bits_big_endian (current_gdbarch))
|
if (gdbarch_bits_big_endian (current_gdbarch))
|
{
|
{
|
accum = (unsigned char) *source;
|
accum = (unsigned char) *source;
|
source += 1;
|
source += 1;
|
accum_bits = HOST_CHAR_BIT - src_offset;
|
accum_bits = HOST_CHAR_BIT - src_offset;
|
|
|
while (n > 0)
|
while (n > 0)
|
{
|
{
|
int unused_right;
|
int unused_right;
|
accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
|
accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source;
|
accum_bits += HOST_CHAR_BIT;
|
accum_bits += HOST_CHAR_BIT;
|
source += 1;
|
source += 1;
|
chunk_size = HOST_CHAR_BIT - targ_offset;
|
chunk_size = HOST_CHAR_BIT - targ_offset;
|
if (chunk_size > n)
|
if (chunk_size > n)
|
chunk_size = n;
|
chunk_size = n;
|
unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
|
unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset);
|
mask = ((1 << chunk_size) - 1) << unused_right;
|
mask = ((1 << chunk_size) - 1) << unused_right;
|
*target =
|
*target =
|
(*target & ~mask)
|
(*target & ~mask)
|
| ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
|
| ((accum >> (accum_bits - chunk_size - unused_right)) & mask);
|
n -= chunk_size;
|
n -= chunk_size;
|
accum_bits -= chunk_size;
|
accum_bits -= chunk_size;
|
target += 1;
|
target += 1;
|
targ_offset = 0;
|
targ_offset = 0;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
accum = (unsigned char) *source >> src_offset;
|
accum = (unsigned char) *source >> src_offset;
|
source += 1;
|
source += 1;
|
accum_bits = HOST_CHAR_BIT - src_offset;
|
accum_bits = HOST_CHAR_BIT - src_offset;
|
|
|
while (n > 0)
|
while (n > 0)
|
{
|
{
|
accum = accum + ((unsigned char) *source << accum_bits);
|
accum = accum + ((unsigned char) *source << accum_bits);
|
accum_bits += HOST_CHAR_BIT;
|
accum_bits += HOST_CHAR_BIT;
|
source += 1;
|
source += 1;
|
chunk_size = HOST_CHAR_BIT - targ_offset;
|
chunk_size = HOST_CHAR_BIT - targ_offset;
|
if (chunk_size > n)
|
if (chunk_size > n)
|
chunk_size = n;
|
chunk_size = n;
|
mask = ((1 << chunk_size) - 1) << targ_offset;
|
mask = ((1 << chunk_size) - 1) << targ_offset;
|
*target = (*target & ~mask) | ((accum << targ_offset) & mask);
|
*target = (*target & ~mask) | ((accum << targ_offset) & mask);
|
n -= chunk_size;
|
n -= chunk_size;
|
accum_bits -= chunk_size;
|
accum_bits -= chunk_size;
|
accum >>= chunk_size;
|
accum >>= chunk_size;
|
target += 1;
|
target += 1;
|
targ_offset = 0;
|
targ_offset = 0;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* Store the contents of FROMVAL into the location of TOVAL.
|
/* Store the contents of FROMVAL into the location of TOVAL.
|
Return a new value with the location of TOVAL and contents of
|
Return a new value with the location of TOVAL and contents of
|
FROMVAL. Handles assignment into packed fields that have
|
FROMVAL. Handles assignment into packed fields that have
|
floating-point or non-scalar types. */
|
floating-point or non-scalar types. */
|
|
|
static struct value *
|
static struct value *
|
ada_value_assign (struct value *toval, struct value *fromval)
|
ada_value_assign (struct value *toval, struct value *fromval)
|
{
|
{
|
struct type *type = value_type (toval);
|
struct type *type = value_type (toval);
|
int bits = value_bitsize (toval);
|
int bits = value_bitsize (toval);
|
|
|
toval = ada_coerce_ref (toval);
|
toval = ada_coerce_ref (toval);
|
fromval = ada_coerce_ref (fromval);
|
fromval = ada_coerce_ref (fromval);
|
|
|
if (ada_is_direct_array_type (value_type (toval)))
|
if (ada_is_direct_array_type (value_type (toval)))
|
toval = ada_coerce_to_simple_array (toval);
|
toval = ada_coerce_to_simple_array (toval);
|
if (ada_is_direct_array_type (value_type (fromval)))
|
if (ada_is_direct_array_type (value_type (fromval)))
|
fromval = ada_coerce_to_simple_array (fromval);
|
fromval = ada_coerce_to_simple_array (fromval);
|
|
|
if (!deprecated_value_modifiable (toval))
|
if (!deprecated_value_modifiable (toval))
|
error (_("Left operand of assignment is not a modifiable lvalue."));
|
error (_("Left operand of assignment is not a modifiable lvalue."));
|
|
|
if (VALUE_LVAL (toval) == lval_memory
|
if (VALUE_LVAL (toval) == lval_memory
|
&& bits > 0
|
&& bits > 0
|
&& (TYPE_CODE (type) == TYPE_CODE_FLT
|
&& (TYPE_CODE (type) == TYPE_CODE_FLT
|
|| TYPE_CODE (type) == TYPE_CODE_STRUCT))
|
|| TYPE_CODE (type) == TYPE_CODE_STRUCT))
|
{
|
{
|
int len = (value_bitpos (toval)
|
int len = (value_bitpos (toval)
|
+ bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
|
+ bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT;
|
char *buffer = (char *) alloca (len);
|
char *buffer = (char *) alloca (len);
|
struct value *val;
|
struct value *val;
|
CORE_ADDR to_addr = VALUE_ADDRESS (toval) + value_offset (toval);
|
CORE_ADDR to_addr = VALUE_ADDRESS (toval) + value_offset (toval);
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_FLT)
|
if (TYPE_CODE (type) == TYPE_CODE_FLT)
|
fromval = value_cast (type, fromval);
|
fromval = value_cast (type, fromval);
|
|
|
read_memory (to_addr, buffer, len);
|
read_memory (to_addr, buffer, len);
|
if (gdbarch_bits_big_endian (current_gdbarch))
|
if (gdbarch_bits_big_endian (current_gdbarch))
|
move_bits (buffer, value_bitpos (toval),
|
move_bits (buffer, value_bitpos (toval),
|
value_contents (fromval),
|
value_contents (fromval),
|
TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT -
|
TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT -
|
bits, bits);
|
bits, bits);
|
else
|
else
|
move_bits (buffer, value_bitpos (toval), value_contents (fromval),
|
move_bits (buffer, value_bitpos (toval), value_contents (fromval),
|
0, bits);
|
0, bits);
|
write_memory (to_addr, buffer, len);
|
write_memory (to_addr, buffer, len);
|
if (deprecated_memory_changed_hook)
|
if (deprecated_memory_changed_hook)
|
deprecated_memory_changed_hook (to_addr, len);
|
deprecated_memory_changed_hook (to_addr, len);
|
|
|
val = value_copy (toval);
|
val = value_copy (toval);
|
memcpy (value_contents_raw (val), value_contents (fromval),
|
memcpy (value_contents_raw (val), value_contents (fromval),
|
TYPE_LENGTH (type));
|
TYPE_LENGTH (type));
|
deprecated_set_value_type (val, type);
|
deprecated_set_value_type (val, type);
|
|
|
return val;
|
return val;
|
}
|
}
|
|
|
return value_assign (toval, fromval);
|
return value_assign (toval, fromval);
|
}
|
}
|
|
|
|
|
/* Given that COMPONENT is a memory lvalue that is part of the lvalue
|
/* Given that COMPONENT is a memory lvalue that is part of the lvalue
|
* CONTAINER, assign the contents of VAL to COMPONENTS's place in
|
* CONTAINER, assign the contents of VAL to COMPONENTS's place in
|
* CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
|
* CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
|
* COMPONENT, and not the inferior's memory. The current contents
|
* COMPONENT, and not the inferior's memory. The current contents
|
* of COMPONENT are ignored. */
|
* of COMPONENT are ignored. */
|
static void
|
static void
|
value_assign_to_component (struct value *container, struct value *component,
|
value_assign_to_component (struct value *container, struct value *component,
|
struct value *val)
|
struct value *val)
|
{
|
{
|
LONGEST offset_in_container =
|
LONGEST offset_in_container =
|
(LONGEST) (VALUE_ADDRESS (component) + value_offset (component)
|
(LONGEST) (VALUE_ADDRESS (component) + value_offset (component)
|
- VALUE_ADDRESS (container) - value_offset (container));
|
- VALUE_ADDRESS (container) - value_offset (container));
|
int bit_offset_in_container =
|
int bit_offset_in_container =
|
value_bitpos (component) - value_bitpos (container);
|
value_bitpos (component) - value_bitpos (container);
|
int bits;
|
int bits;
|
|
|
val = value_cast (value_type (component), val);
|
val = value_cast (value_type (component), val);
|
|
|
if (value_bitsize (component) == 0)
|
if (value_bitsize (component) == 0)
|
bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
|
bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component));
|
else
|
else
|
bits = value_bitsize (component);
|
bits = value_bitsize (component);
|
|
|
if (gdbarch_bits_big_endian (current_gdbarch))
|
if (gdbarch_bits_big_endian (current_gdbarch))
|
move_bits (value_contents_writeable (container) + offset_in_container,
|
move_bits (value_contents_writeable (container) + offset_in_container,
|
value_bitpos (container) + bit_offset_in_container,
|
value_bitpos (container) + bit_offset_in_container,
|
value_contents (val),
|
value_contents (val),
|
TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
|
TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits,
|
bits);
|
bits);
|
else
|
else
|
move_bits (value_contents_writeable (container) + offset_in_container,
|
move_bits (value_contents_writeable (container) + offset_in_container,
|
value_bitpos (container) + bit_offset_in_container,
|
value_bitpos (container) + bit_offset_in_container,
|
value_contents (val), 0, bits);
|
value_contents (val), 0, bits);
|
}
|
}
|
|
|
/* The value of the element of array ARR at the ARITY indices given in IND.
|
/* The value of the element of array ARR at the ARITY indices given in IND.
|
ARR may be either a simple array, GNAT array descriptor, or pointer
|
ARR may be either a simple array, GNAT array descriptor, or pointer
|
thereto. */
|
thereto. */
|
|
|
struct value *
|
struct value *
|
ada_value_subscript (struct value *arr, int arity, struct value **ind)
|
ada_value_subscript (struct value *arr, int arity, struct value **ind)
|
{
|
{
|
int k;
|
int k;
|
struct value *elt;
|
struct value *elt;
|
struct type *elt_type;
|
struct type *elt_type;
|
|
|
elt = ada_coerce_to_simple_array (arr);
|
elt = ada_coerce_to_simple_array (arr);
|
|
|
elt_type = ada_check_typedef (value_type (elt));
|
elt_type = ada_check_typedef (value_type (elt));
|
if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
|
if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY
|
&& TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
|
&& TYPE_FIELD_BITSIZE (elt_type, 0) > 0)
|
return value_subscript_packed (elt, arity, ind);
|
return value_subscript_packed (elt, arity, ind);
|
|
|
for (k = 0; k < arity; k += 1)
|
for (k = 0; k < arity; k += 1)
|
{
|
{
|
if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
|
if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY)
|
error (_("too many subscripts (%d expected)"), k);
|
error (_("too many subscripts (%d expected)"), k);
|
elt = value_subscript (elt, value_pos_atr (ind[k]));
|
elt = value_subscript (elt, value_pos_atr (ind[k]));
|
}
|
}
|
return elt;
|
return elt;
|
}
|
}
|
|
|
/* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
|
/* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
|
value of the element of *ARR at the ARITY indices given in
|
value of the element of *ARR at the ARITY indices given in
|
IND. Does not read the entire array into memory. */
|
IND. Does not read the entire array into memory. */
|
|
|
struct value *
|
struct value *
|
ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
|
ada_value_ptr_subscript (struct value *arr, struct type *type, int arity,
|
struct value **ind)
|
struct value **ind)
|
{
|
{
|
int k;
|
int k;
|
|
|
for (k = 0; k < arity; k += 1)
|
for (k = 0; k < arity; k += 1)
|
{
|
{
|
LONGEST lwb, upb;
|
LONGEST lwb, upb;
|
struct value *idx;
|
struct value *idx;
|
|
|
if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
|
if (TYPE_CODE (type) != TYPE_CODE_ARRAY)
|
error (_("too many subscripts (%d expected)"), k);
|
error (_("too many subscripts (%d expected)"), k);
|
arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
|
arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
|
value_copy (arr));
|
value_copy (arr));
|
get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
|
get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb);
|
idx = value_pos_atr (ind[k]);
|
idx = value_pos_atr (ind[k]);
|
if (lwb != 0)
|
if (lwb != 0)
|
idx = value_sub (idx, value_from_longest (builtin_type_int, lwb));
|
idx = value_sub (idx, value_from_longest (builtin_type_int, lwb));
|
arr = value_add (arr, idx);
|
arr = value_add (arr, idx);
|
type = TYPE_TARGET_TYPE (type);
|
type = TYPE_TARGET_TYPE (type);
|
}
|
}
|
|
|
return value_ind (arr);
|
return value_ind (arr);
|
}
|
}
|
|
|
/* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
|
/* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
|
actual type of ARRAY_PTR is ignored), returns a reference to
|
actual type of ARRAY_PTR is ignored), returns a reference to
|
the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
|
the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
|
bound of this array is LOW, as per Ada rules. */
|
bound of this array is LOW, as per Ada rules. */
|
static struct value *
|
static struct value *
|
ada_value_slice_ptr (struct value *array_ptr, struct type *type,
|
ada_value_slice_ptr (struct value *array_ptr, struct type *type,
|
int low, int high)
|
int low, int high)
|
{
|
{
|
CORE_ADDR base = value_as_address (array_ptr)
|
CORE_ADDR base = value_as_address (array_ptr)
|
+ ((low - TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type)))
|
+ ((low - TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type)))
|
* TYPE_LENGTH (TYPE_TARGET_TYPE (type)));
|
* TYPE_LENGTH (TYPE_TARGET_TYPE (type)));
|
struct type *index_type =
|
struct type *index_type =
|
create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)),
|
create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)),
|
low, high);
|
low, high);
|
struct type *slice_type =
|
struct type *slice_type =
|
create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
|
create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
|
return value_from_pointer (lookup_reference_type (slice_type), base);
|
return value_from_pointer (lookup_reference_type (slice_type), base);
|
}
|
}
|
|
|
|
|
static struct value *
|
static struct value *
|
ada_value_slice (struct value *array, int low, int high)
|
ada_value_slice (struct value *array, int low, int high)
|
{
|
{
|
struct type *type = value_type (array);
|
struct type *type = value_type (array);
|
struct type *index_type =
|
struct type *index_type =
|
create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
|
create_range_type (NULL, TYPE_INDEX_TYPE (type), low, high);
|
struct type *slice_type =
|
struct type *slice_type =
|
create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
|
create_array_type (NULL, TYPE_TARGET_TYPE (type), index_type);
|
return value_cast (slice_type, value_slice (array, low, high - low + 1));
|
return value_cast (slice_type, value_slice (array, low, high - low + 1));
|
}
|
}
|
|
|
/* If type is a record type in the form of a standard GNAT array
|
/* If type is a record type in the form of a standard GNAT array
|
descriptor, returns the number of dimensions for type. If arr is a
|
descriptor, returns the number of dimensions for type. If arr is a
|
simple array, returns the number of "array of"s that prefix its
|
simple array, returns the number of "array of"s that prefix its
|
type designation. Otherwise, returns 0. */
|
type designation. Otherwise, returns 0. */
|
|
|
int
|
int
|
ada_array_arity (struct type *type)
|
ada_array_arity (struct type *type)
|
{
|
{
|
int arity;
|
int arity;
|
|
|
if (type == NULL)
|
if (type == NULL)
|
return 0;
|
return 0;
|
|
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
arity = 0;
|
arity = 0;
|
if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
return desc_arity (desc_bounds_type (type));
|
return desc_arity (desc_bounds_type (type));
|
else
|
else
|
while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
while (TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
{
|
{
|
arity += 1;
|
arity += 1;
|
type = ada_check_typedef (TYPE_TARGET_TYPE (type));
|
type = ada_check_typedef (TYPE_TARGET_TYPE (type));
|
}
|
}
|
|
|
return arity;
|
return arity;
|
}
|
}
|
|
|
/* If TYPE is a record type in the form of a standard GNAT array
|
/* If TYPE is a record type in the form of a standard GNAT array
|
descriptor or a simple array type, returns the element type for
|
descriptor or a simple array type, returns the element type for
|
TYPE after indexing by NINDICES indices, or by all indices if
|
TYPE after indexing by NINDICES indices, or by all indices if
|
NINDICES is -1. Otherwise, returns NULL. */
|
NINDICES is -1. Otherwise, returns NULL. */
|
|
|
struct type *
|
struct type *
|
ada_array_element_type (struct type *type, int nindices)
|
ada_array_element_type (struct type *type, int nindices)
|
{
|
{
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
{
|
{
|
int k;
|
int k;
|
struct type *p_array_type;
|
struct type *p_array_type;
|
|
|
p_array_type = desc_data_type (type);
|
p_array_type = desc_data_type (type);
|
|
|
k = ada_array_arity (type);
|
k = ada_array_arity (type);
|
if (k == 0)
|
if (k == 0)
|
return NULL;
|
return NULL;
|
|
|
/* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
|
/* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
|
if (nindices >= 0 && k > nindices)
|
if (nindices >= 0 && k > nindices)
|
k = nindices;
|
k = nindices;
|
p_array_type = TYPE_TARGET_TYPE (p_array_type);
|
p_array_type = TYPE_TARGET_TYPE (p_array_type);
|
while (k > 0 && p_array_type != NULL)
|
while (k > 0 && p_array_type != NULL)
|
{
|
{
|
p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
|
p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type));
|
k -= 1;
|
k -= 1;
|
}
|
}
|
return p_array_type;
|
return p_array_type;
|
}
|
}
|
else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
else if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
{
|
{
|
while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
{
|
{
|
type = TYPE_TARGET_TYPE (type);
|
type = TYPE_TARGET_TYPE (type);
|
nindices -= 1;
|
nindices -= 1;
|
}
|
}
|
return type;
|
return type;
|
}
|
}
|
|
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* The type of nth index in arrays of given type (n numbering from 1).
|
/* The type of nth index in arrays of given type (n numbering from 1).
|
Does not examine memory. */
|
Does not examine memory. */
|
|
|
struct type *
|
struct type *
|
ada_index_type (struct type *type, int n)
|
ada_index_type (struct type *type, int n)
|
{
|
{
|
struct type *result_type;
|
struct type *result_type;
|
|
|
type = desc_base_type (type);
|
type = desc_base_type (type);
|
|
|
if (n > ada_array_arity (type))
|
if (n > ada_array_arity (type))
|
return NULL;
|
return NULL;
|
|
|
if (ada_is_simple_array_type (type))
|
if (ada_is_simple_array_type (type))
|
{
|
{
|
int i;
|
int i;
|
|
|
for (i = 1; i < n; i += 1)
|
for (i = 1; i < n; i += 1)
|
type = TYPE_TARGET_TYPE (type);
|
type = TYPE_TARGET_TYPE (type);
|
result_type = TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 0));
|
result_type = TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 0));
|
/* FIXME: The stabs type r(0,0);bound;bound in an array type
|
/* FIXME: The stabs type r(0,0);bound;bound in an array type
|
has a target type of TYPE_CODE_UNDEF. We compensate here, but
|
has a target type of TYPE_CODE_UNDEF. We compensate here, but
|
perhaps stabsread.c would make more sense. */
|
perhaps stabsread.c would make more sense. */
|
if (result_type == NULL || TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
|
if (result_type == NULL || TYPE_CODE (result_type) == TYPE_CODE_UNDEF)
|
result_type = builtin_type_int;
|
result_type = builtin_type_int;
|
|
|
return result_type;
|
return result_type;
|
}
|
}
|
else
|
else
|
return desc_index_type (desc_bounds_type (type), n);
|
return desc_index_type (desc_bounds_type (type), n);
|
}
|
}
|
|
|
/* Given that arr is an array type, returns the lower bound of the
|
/* Given that arr is an array type, returns the lower bound of the
|
Nth index (numbering from 1) if WHICH is 0, and the upper bound if
|
Nth index (numbering from 1) if WHICH is 0, and the upper bound if
|
WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
|
WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
|
array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
|
array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
|
bounds type. It works for other arrays with bounds supplied by
|
bounds type. It works for other arrays with bounds supplied by
|
run-time quantities other than discriminants. */
|
run-time quantities other than discriminants. */
|
|
|
static LONGEST
|
static LONGEST
|
ada_array_bound_from_type (struct type * arr_type, int n, int which,
|
ada_array_bound_from_type (struct type * arr_type, int n, int which,
|
struct type ** typep)
|
struct type ** typep)
|
{
|
{
|
struct type *type;
|
struct type *type;
|
struct type *index_type_desc;
|
struct type *index_type_desc;
|
|
|
if (ada_is_packed_array_type (arr_type))
|
if (ada_is_packed_array_type (arr_type))
|
arr_type = decode_packed_array_type (arr_type);
|
arr_type = decode_packed_array_type (arr_type);
|
|
|
if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
|
if (arr_type == NULL || !ada_is_simple_array_type (arr_type))
|
{
|
{
|
if (typep != NULL)
|
if (typep != NULL)
|
*typep = builtin_type_int;
|
*typep = builtin_type_int;
|
return (LONGEST) - which;
|
return (LONGEST) - which;
|
}
|
}
|
|
|
if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
|
if (TYPE_CODE (arr_type) == TYPE_CODE_PTR)
|
type = TYPE_TARGET_TYPE (arr_type);
|
type = TYPE_TARGET_TYPE (arr_type);
|
else
|
else
|
type = arr_type;
|
type = arr_type;
|
|
|
index_type_desc = ada_find_parallel_type (type, "___XA");
|
index_type_desc = ada_find_parallel_type (type, "___XA");
|
if (index_type_desc == NULL)
|
if (index_type_desc == NULL)
|
{
|
{
|
struct type *index_type;
|
struct type *index_type;
|
|
|
while (n > 1)
|
while (n > 1)
|
{
|
{
|
type = TYPE_TARGET_TYPE (type);
|
type = TYPE_TARGET_TYPE (type);
|
n -= 1;
|
n -= 1;
|
}
|
}
|
|
|
index_type = TYPE_INDEX_TYPE (type);
|
index_type = TYPE_INDEX_TYPE (type);
|
if (typep != NULL)
|
if (typep != NULL)
|
*typep = index_type;
|
*typep = index_type;
|
|
|
/* The index type is either a range type or an enumerated type.
|
/* The index type is either a range type or an enumerated type.
|
For the range type, we have some macros that allow us to
|
For the range type, we have some macros that allow us to
|
extract the value of the low and high bounds. But they
|
extract the value of the low and high bounds. But they
|
do now work for enumerated types. The expressions used
|
do now work for enumerated types. The expressions used
|
below work for both range and enum types. */
|
below work for both range and enum types. */
|
return
|
return
|
(LONGEST) (which == 0
|
(LONGEST) (which == 0
|
? TYPE_FIELD_BITPOS (index_type, 0)
|
? TYPE_FIELD_BITPOS (index_type, 0)
|
: TYPE_FIELD_BITPOS (index_type,
|
: TYPE_FIELD_BITPOS (index_type,
|
TYPE_NFIELDS (index_type) - 1));
|
TYPE_NFIELDS (index_type) - 1));
|
}
|
}
|
else
|
else
|
{
|
{
|
struct type *index_type =
|
struct type *index_type =
|
to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, n - 1),
|
to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, n - 1),
|
NULL, TYPE_OBJFILE (arr_type));
|
NULL, TYPE_OBJFILE (arr_type));
|
|
|
if (typep != NULL)
|
if (typep != NULL)
|
*typep = index_type;
|
*typep = index_type;
|
|
|
return
|
return
|
(LONGEST) (which == 0
|
(LONGEST) (which == 0
|
? TYPE_LOW_BOUND (index_type)
|
? TYPE_LOW_BOUND (index_type)
|
: TYPE_HIGH_BOUND (index_type));
|
: TYPE_HIGH_BOUND (index_type));
|
}
|
}
|
}
|
}
|
|
|
/* Given that arr is an array value, returns the lower bound of the
|
/* Given that arr is an array value, returns the lower bound of the
|
nth index (numbering from 1) if WHICH is 0, and the upper bound if
|
nth index (numbering from 1) if WHICH is 0, and the upper bound if
|
WHICH is 1. This routine will also work for arrays with bounds
|
WHICH is 1. This routine will also work for arrays with bounds
|
supplied by run-time quantities other than discriminants. */
|
supplied by run-time quantities other than discriminants. */
|
|
|
struct value *
|
struct value *
|
ada_array_bound (struct value *arr, int n, int which)
|
ada_array_bound (struct value *arr, int n, int which)
|
{
|
{
|
struct type *arr_type = value_type (arr);
|
struct type *arr_type = value_type (arr);
|
|
|
if (ada_is_packed_array_type (arr_type))
|
if (ada_is_packed_array_type (arr_type))
|
return ada_array_bound (decode_packed_array (arr), n, which);
|
return ada_array_bound (decode_packed_array (arr), n, which);
|
else if (ada_is_simple_array_type (arr_type))
|
else if (ada_is_simple_array_type (arr_type))
|
{
|
{
|
struct type *type;
|
struct type *type;
|
LONGEST v = ada_array_bound_from_type (arr_type, n, which, &type);
|
LONGEST v = ada_array_bound_from_type (arr_type, n, which, &type);
|
return value_from_longest (type, v);
|
return value_from_longest (type, v);
|
}
|
}
|
else
|
else
|
return desc_one_bound (desc_bounds (arr), n, which);
|
return desc_one_bound (desc_bounds (arr), n, which);
|
}
|
}
|
|
|
/* Given that arr is an array value, returns the length of the
|
/* Given that arr is an array value, returns the length of the
|
nth index. This routine will also work for arrays with bounds
|
nth index. This routine will also work for arrays with bounds
|
supplied by run-time quantities other than discriminants.
|
supplied by run-time quantities other than discriminants.
|
Does not work for arrays indexed by enumeration types with representation
|
Does not work for arrays indexed by enumeration types with representation
|
clauses at the moment. */
|
clauses at the moment. */
|
|
|
struct value *
|
struct value *
|
ada_array_length (struct value *arr, int n)
|
ada_array_length (struct value *arr, int n)
|
{
|
{
|
struct type *arr_type = ada_check_typedef (value_type (arr));
|
struct type *arr_type = ada_check_typedef (value_type (arr));
|
|
|
if (ada_is_packed_array_type (arr_type))
|
if (ada_is_packed_array_type (arr_type))
|
return ada_array_length (decode_packed_array (arr), n);
|
return ada_array_length (decode_packed_array (arr), n);
|
|
|
if (ada_is_simple_array_type (arr_type))
|
if (ada_is_simple_array_type (arr_type))
|
{
|
{
|
struct type *type;
|
struct type *type;
|
LONGEST v =
|
LONGEST v =
|
ada_array_bound_from_type (arr_type, n, 1, &type) -
|
ada_array_bound_from_type (arr_type, n, 1, &type) -
|
ada_array_bound_from_type (arr_type, n, 0, NULL) + 1;
|
ada_array_bound_from_type (arr_type, n, 0, NULL) + 1;
|
return value_from_longest (type, v);
|
return value_from_longest (type, v);
|
}
|
}
|
else
|
else
|
return
|
return
|
value_from_longest (builtin_type_int,
|
value_from_longest (builtin_type_int,
|
value_as_long (desc_one_bound (desc_bounds (arr),
|
value_as_long (desc_one_bound (desc_bounds (arr),
|
n, 1))
|
n, 1))
|
- value_as_long (desc_one_bound (desc_bounds (arr),
|
- value_as_long (desc_one_bound (desc_bounds (arr),
|
n, 0)) + 1);
|
n, 0)) + 1);
|
}
|
}
|
|
|
/* An empty array whose type is that of ARR_TYPE (an array type),
|
/* An empty array whose type is that of ARR_TYPE (an array type),
|
with bounds LOW to LOW-1. */
|
with bounds LOW to LOW-1. */
|
|
|
static struct value *
|
static struct value *
|
empty_array (struct type *arr_type, int low)
|
empty_array (struct type *arr_type, int low)
|
{
|
{
|
struct type *index_type =
|
struct type *index_type =
|
create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type)),
|
create_range_type (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type)),
|
low, low - 1);
|
low, low - 1);
|
struct type *elt_type = ada_array_element_type (arr_type, 1);
|
struct type *elt_type = ada_array_element_type (arr_type, 1);
|
return allocate_value (create_array_type (NULL, elt_type, index_type));
|
return allocate_value (create_array_type (NULL, elt_type, index_type));
|
}
|
}
|
|
|
|
|
/* Name resolution */
|
/* Name resolution */
|
|
|
/* The "decoded" name for the user-definable Ada operator corresponding
|
/* The "decoded" name for the user-definable Ada operator corresponding
|
to OP. */
|
to OP. */
|
|
|
static const char *
|
static const char *
|
ada_decoded_op_name (enum exp_opcode op)
|
ada_decoded_op_name (enum exp_opcode op)
|
{
|
{
|
int i;
|
int i;
|
|
|
for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
|
for (i = 0; ada_opname_table[i].encoded != NULL; i += 1)
|
{
|
{
|
if (ada_opname_table[i].op == op)
|
if (ada_opname_table[i].op == op)
|
return ada_opname_table[i].decoded;
|
return ada_opname_table[i].decoded;
|
}
|
}
|
error (_("Could not find operator name for opcode"));
|
error (_("Could not find operator name for opcode"));
|
}
|
}
|
|
|
|
|
/* Same as evaluate_type (*EXP), but resolves ambiguous symbol
|
/* Same as evaluate_type (*EXP), but resolves ambiguous symbol
|
references (marked by OP_VAR_VALUE nodes in which the symbol has an
|
references (marked by OP_VAR_VALUE nodes in which the symbol has an
|
undefined namespace) and converts operators that are
|
undefined namespace) and converts operators that are
|
user-defined into appropriate function calls. If CONTEXT_TYPE is
|
user-defined into appropriate function calls. If CONTEXT_TYPE is
|
non-null, it provides a preferred result type [at the moment, only
|
non-null, it provides a preferred result type [at the moment, only
|
type void has any effect---causing procedures to be preferred over
|
type void has any effect---causing procedures to be preferred over
|
functions in calls]. A null CONTEXT_TYPE indicates that a non-void
|
functions in calls]. A null CONTEXT_TYPE indicates that a non-void
|
return type is preferred. May change (expand) *EXP. */
|
return type is preferred. May change (expand) *EXP. */
|
|
|
static void
|
static void
|
resolve (struct expression **expp, int void_context_p)
|
resolve (struct expression **expp, int void_context_p)
|
{
|
{
|
int pc;
|
int pc;
|
pc = 0;
|
pc = 0;
|
resolve_subexp (expp, &pc, 1, void_context_p ? builtin_type_void : NULL);
|
resolve_subexp (expp, &pc, 1, void_context_p ? builtin_type_void : NULL);
|
}
|
}
|
|
|
/* Resolve the operator of the subexpression beginning at
|
/* Resolve the operator of the subexpression beginning at
|
position *POS of *EXPP. "Resolving" consists of replacing
|
position *POS of *EXPP. "Resolving" consists of replacing
|
the symbols that have undefined namespaces in OP_VAR_VALUE nodes
|
the symbols that have undefined namespaces in OP_VAR_VALUE nodes
|
with their resolutions, replacing built-in operators with
|
with their resolutions, replacing built-in operators with
|
function calls to user-defined operators, where appropriate, and,
|
function calls to user-defined operators, where appropriate, and,
|
when DEPROCEDURE_P is non-zero, converting function-valued variables
|
when DEPROCEDURE_P is non-zero, converting function-valued variables
|
into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
|
into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
|
are as in ada_resolve, above. */
|
are as in ada_resolve, above. */
|
|
|
static struct value *
|
static struct value *
|
resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
|
resolve_subexp (struct expression **expp, int *pos, int deprocedure_p,
|
struct type *context_type)
|
struct type *context_type)
|
{
|
{
|
int pc = *pos;
|
int pc = *pos;
|
int i;
|
int i;
|
struct expression *exp; /* Convenience: == *expp. */
|
struct expression *exp; /* Convenience: == *expp. */
|
enum exp_opcode op = (*expp)->elts[pc].opcode;
|
enum exp_opcode op = (*expp)->elts[pc].opcode;
|
struct value **argvec; /* Vector of operand types (alloca'ed). */
|
struct value **argvec; /* Vector of operand types (alloca'ed). */
|
int nargs; /* Number of operands. */
|
int nargs; /* Number of operands. */
|
int oplen;
|
int oplen;
|
|
|
argvec = NULL;
|
argvec = NULL;
|
nargs = 0;
|
nargs = 0;
|
exp = *expp;
|
exp = *expp;
|
|
|
/* Pass one: resolve operands, saving their types and updating *pos,
|
/* Pass one: resolve operands, saving their types and updating *pos,
|
if needed. */
|
if needed. */
|
switch (op)
|
switch (op)
|
{
|
{
|
case OP_FUNCALL:
|
case OP_FUNCALL:
|
if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
|
if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
|
&& SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
|
&& SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
|
*pos += 7;
|
*pos += 7;
|
else
|
else
|
{
|
{
|
*pos += 3;
|
*pos += 3;
|
resolve_subexp (expp, pos, 0, NULL);
|
resolve_subexp (expp, pos, 0, NULL);
|
}
|
}
|
nargs = longest_to_int (exp->elts[pc + 1].longconst);
|
nargs = longest_to_int (exp->elts[pc + 1].longconst);
|
break;
|
break;
|
|
|
case UNOP_ADDR:
|
case UNOP_ADDR:
|
*pos += 1;
|
*pos += 1;
|
resolve_subexp (expp, pos, 0, NULL);
|
resolve_subexp (expp, pos, 0, NULL);
|
break;
|
break;
|
|
|
case UNOP_QUAL:
|
case UNOP_QUAL:
|
*pos += 3;
|
*pos += 3;
|
resolve_subexp (expp, pos, 1, exp->elts[pc + 1].type);
|
resolve_subexp (expp, pos, 1, exp->elts[pc + 1].type);
|
break;
|
break;
|
|
|
case OP_ATR_MODULUS:
|
case OP_ATR_MODULUS:
|
case OP_ATR_SIZE:
|
case OP_ATR_SIZE:
|
case OP_ATR_TAG:
|
case OP_ATR_TAG:
|
case OP_ATR_FIRST:
|
case OP_ATR_FIRST:
|
case OP_ATR_LAST:
|
case OP_ATR_LAST:
|
case OP_ATR_LENGTH:
|
case OP_ATR_LENGTH:
|
case OP_ATR_POS:
|
case OP_ATR_POS:
|
case OP_ATR_VAL:
|
case OP_ATR_VAL:
|
case OP_ATR_MIN:
|
case OP_ATR_MIN:
|
case OP_ATR_MAX:
|
case OP_ATR_MAX:
|
case TERNOP_IN_RANGE:
|
case TERNOP_IN_RANGE:
|
case BINOP_IN_BOUNDS:
|
case BINOP_IN_BOUNDS:
|
case UNOP_IN_RANGE:
|
case UNOP_IN_RANGE:
|
case OP_AGGREGATE:
|
case OP_AGGREGATE:
|
case OP_OTHERS:
|
case OP_OTHERS:
|
case OP_CHOICES:
|
case OP_CHOICES:
|
case OP_POSITIONAL:
|
case OP_POSITIONAL:
|
case OP_DISCRETE_RANGE:
|
case OP_DISCRETE_RANGE:
|
case OP_NAME:
|
case OP_NAME:
|
ada_forward_operator_length (exp, pc, &oplen, &nargs);
|
ada_forward_operator_length (exp, pc, &oplen, &nargs);
|
*pos += oplen;
|
*pos += oplen;
|
break;
|
break;
|
|
|
case BINOP_ASSIGN:
|
case BINOP_ASSIGN:
|
{
|
{
|
struct value *arg1;
|
struct value *arg1;
|
|
|
*pos += 1;
|
*pos += 1;
|
arg1 = resolve_subexp (expp, pos, 0, NULL);
|
arg1 = resolve_subexp (expp, pos, 0, NULL);
|
if (arg1 == NULL)
|
if (arg1 == NULL)
|
resolve_subexp (expp, pos, 1, NULL);
|
resolve_subexp (expp, pos, 1, NULL);
|
else
|
else
|
resolve_subexp (expp, pos, 1, value_type (arg1));
|
resolve_subexp (expp, pos, 1, value_type (arg1));
|
break;
|
break;
|
}
|
}
|
|
|
case UNOP_CAST:
|
case UNOP_CAST:
|
*pos += 3;
|
*pos += 3;
|
nargs = 1;
|
nargs = 1;
|
break;
|
break;
|
|
|
case BINOP_ADD:
|
case BINOP_ADD:
|
case BINOP_SUB:
|
case BINOP_SUB:
|
case BINOP_MUL:
|
case BINOP_MUL:
|
case BINOP_DIV:
|
case BINOP_DIV:
|
case BINOP_REM:
|
case BINOP_REM:
|
case BINOP_MOD:
|
case BINOP_MOD:
|
case BINOP_EXP:
|
case BINOP_EXP:
|
case BINOP_CONCAT:
|
case BINOP_CONCAT:
|
case BINOP_LOGICAL_AND:
|
case BINOP_LOGICAL_AND:
|
case BINOP_LOGICAL_OR:
|
case BINOP_LOGICAL_OR:
|
case BINOP_BITWISE_AND:
|
case BINOP_BITWISE_AND:
|
case BINOP_BITWISE_IOR:
|
case BINOP_BITWISE_IOR:
|
case BINOP_BITWISE_XOR:
|
case BINOP_BITWISE_XOR:
|
|
|
case BINOP_EQUAL:
|
case BINOP_EQUAL:
|
case BINOP_NOTEQUAL:
|
case BINOP_NOTEQUAL:
|
case BINOP_LESS:
|
case BINOP_LESS:
|
case BINOP_GTR:
|
case BINOP_GTR:
|
case BINOP_LEQ:
|
case BINOP_LEQ:
|
case BINOP_GEQ:
|
case BINOP_GEQ:
|
|
|
case BINOP_REPEAT:
|
case BINOP_REPEAT:
|
case BINOP_SUBSCRIPT:
|
case BINOP_SUBSCRIPT:
|
case BINOP_COMMA:
|
case BINOP_COMMA:
|
*pos += 1;
|
*pos += 1;
|
nargs = 2;
|
nargs = 2;
|
break;
|
break;
|
|
|
case UNOP_NEG:
|
case UNOP_NEG:
|
case UNOP_PLUS:
|
case UNOP_PLUS:
|
case UNOP_LOGICAL_NOT:
|
case UNOP_LOGICAL_NOT:
|
case UNOP_ABS:
|
case UNOP_ABS:
|
case UNOP_IND:
|
case UNOP_IND:
|
*pos += 1;
|
*pos += 1;
|
nargs = 1;
|
nargs = 1;
|
break;
|
break;
|
|
|
case OP_LONG:
|
case OP_LONG:
|
case OP_DOUBLE:
|
case OP_DOUBLE:
|
case OP_VAR_VALUE:
|
case OP_VAR_VALUE:
|
*pos += 4;
|
*pos += 4;
|
break;
|
break;
|
|
|
case OP_TYPE:
|
case OP_TYPE:
|
case OP_BOOL:
|
case OP_BOOL:
|
case OP_LAST:
|
case OP_LAST:
|
case OP_INTERNALVAR:
|
case OP_INTERNALVAR:
|
*pos += 3;
|
*pos += 3;
|
break;
|
break;
|
|
|
case UNOP_MEMVAL:
|
case UNOP_MEMVAL:
|
*pos += 3;
|
*pos += 3;
|
nargs = 1;
|
nargs = 1;
|
break;
|
break;
|
|
|
case OP_REGISTER:
|
case OP_REGISTER:
|
*pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
|
*pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
|
break;
|
break;
|
|
|
case STRUCTOP_STRUCT:
|
case STRUCTOP_STRUCT:
|
*pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
|
*pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1);
|
nargs = 1;
|
nargs = 1;
|
break;
|
break;
|
|
|
case TERNOP_SLICE:
|
case TERNOP_SLICE:
|
*pos += 1;
|
*pos += 1;
|
nargs = 3;
|
nargs = 3;
|
break;
|
break;
|
|
|
case OP_STRING:
|
case OP_STRING:
|
break;
|
break;
|
|
|
default:
|
default:
|
error (_("Unexpected operator during name resolution"));
|
error (_("Unexpected operator during name resolution"));
|
}
|
}
|
|
|
argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
|
argvec = (struct value * *) alloca (sizeof (struct value *) * (nargs + 1));
|
for (i = 0; i < nargs; i += 1)
|
for (i = 0; i < nargs; i += 1)
|
argvec[i] = resolve_subexp (expp, pos, 1, NULL);
|
argvec[i] = resolve_subexp (expp, pos, 1, NULL);
|
argvec[i] = NULL;
|
argvec[i] = NULL;
|
exp = *expp;
|
exp = *expp;
|
|
|
/* Pass two: perform any resolution on principal operator. */
|
/* Pass two: perform any resolution on principal operator. */
|
switch (op)
|
switch (op)
|
{
|
{
|
default:
|
default:
|
break;
|
break;
|
|
|
case OP_VAR_VALUE:
|
case OP_VAR_VALUE:
|
if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
|
if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
|
{
|
{
|
struct ada_symbol_info *candidates;
|
struct ada_symbol_info *candidates;
|
int n_candidates;
|
int n_candidates;
|
|
|
n_candidates =
|
n_candidates =
|
ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
|
ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
|
(exp->elts[pc + 2].symbol),
|
(exp->elts[pc + 2].symbol),
|
exp->elts[pc + 1].block, VAR_DOMAIN,
|
exp->elts[pc + 1].block, VAR_DOMAIN,
|
&candidates);
|
&candidates);
|
|
|
if (n_candidates > 1)
|
if (n_candidates > 1)
|
{
|
{
|
/* Types tend to get re-introduced locally, so if there
|
/* Types tend to get re-introduced locally, so if there
|
are any local symbols that are not types, first filter
|
are any local symbols that are not types, first filter
|
out all types. */
|
out all types. */
|
int j;
|
int j;
|
for (j = 0; j < n_candidates; j += 1)
|
for (j = 0; j < n_candidates; j += 1)
|
switch (SYMBOL_CLASS (candidates[j].sym))
|
switch (SYMBOL_CLASS (candidates[j].sym))
|
{
|
{
|
case LOC_REGISTER:
|
case LOC_REGISTER:
|
case LOC_ARG:
|
case LOC_ARG:
|
case LOC_REF_ARG:
|
case LOC_REF_ARG:
|
case LOC_REGPARM:
|
case LOC_REGPARM:
|
case LOC_REGPARM_ADDR:
|
case LOC_REGPARM_ADDR:
|
case LOC_LOCAL:
|
case LOC_LOCAL:
|
case LOC_LOCAL_ARG:
|
case LOC_LOCAL_ARG:
|
case LOC_BASEREG:
|
case LOC_BASEREG:
|
case LOC_BASEREG_ARG:
|
case LOC_BASEREG_ARG:
|
case LOC_COMPUTED:
|
case LOC_COMPUTED:
|
case LOC_COMPUTED_ARG:
|
case LOC_COMPUTED_ARG:
|
goto FoundNonType;
|
goto FoundNonType;
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
FoundNonType:
|
FoundNonType:
|
if (j < n_candidates)
|
if (j < n_candidates)
|
{
|
{
|
j = 0;
|
j = 0;
|
while (j < n_candidates)
|
while (j < n_candidates)
|
{
|
{
|
if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
|
if (SYMBOL_CLASS (candidates[j].sym) == LOC_TYPEDEF)
|
{
|
{
|
candidates[j] = candidates[n_candidates - 1];
|
candidates[j] = candidates[n_candidates - 1];
|
n_candidates -= 1;
|
n_candidates -= 1;
|
}
|
}
|
else
|
else
|
j += 1;
|
j += 1;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
if (n_candidates == 0)
|
if (n_candidates == 0)
|
error (_("No definition found for %s"),
|
error (_("No definition found for %s"),
|
SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
|
SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
|
else if (n_candidates == 1)
|
else if (n_candidates == 1)
|
i = 0;
|
i = 0;
|
else if (deprocedure_p
|
else if (deprocedure_p
|
&& !is_nonfunction (candidates, n_candidates))
|
&& !is_nonfunction (candidates, n_candidates))
|
{
|
{
|
i = ada_resolve_function
|
i = ada_resolve_function
|
(candidates, n_candidates, NULL, 0,
|
(candidates, n_candidates, NULL, 0,
|
SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
|
SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol),
|
context_type);
|
context_type);
|
if (i < 0)
|
if (i < 0)
|
error (_("Could not find a match for %s"),
|
error (_("Could not find a match for %s"),
|
SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
|
SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
|
}
|
}
|
else
|
else
|
{
|
{
|
printf_filtered (_("Multiple matches for %s\n"),
|
printf_filtered (_("Multiple matches for %s\n"),
|
SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
|
SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
|
user_select_syms (candidates, n_candidates, 1);
|
user_select_syms (candidates, n_candidates, 1);
|
i = 0;
|
i = 0;
|
}
|
}
|
|
|
exp->elts[pc + 1].block = candidates[i].block;
|
exp->elts[pc + 1].block = candidates[i].block;
|
exp->elts[pc + 2].symbol = candidates[i].sym;
|
exp->elts[pc + 2].symbol = candidates[i].sym;
|
if (innermost_block == NULL
|
if (innermost_block == NULL
|
|| contained_in (candidates[i].block, innermost_block))
|
|| contained_in (candidates[i].block, innermost_block))
|
innermost_block = candidates[i].block;
|
innermost_block = candidates[i].block;
|
}
|
}
|
|
|
if (deprocedure_p
|
if (deprocedure_p
|
&& (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
|
&& (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol))
|
== TYPE_CODE_FUNC))
|
== TYPE_CODE_FUNC))
|
{
|
{
|
replace_operator_with_call (expp, pc, 0, 0,
|
replace_operator_with_call (expp, pc, 0, 0,
|
exp->elts[pc + 2].symbol,
|
exp->elts[pc + 2].symbol,
|
exp->elts[pc + 1].block);
|
exp->elts[pc + 1].block);
|
exp = *expp;
|
exp = *expp;
|
}
|
}
|
break;
|
break;
|
|
|
case OP_FUNCALL:
|
case OP_FUNCALL:
|
{
|
{
|
if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
|
if (exp->elts[pc + 3].opcode == OP_VAR_VALUE
|
&& SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
|
&& SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
|
{
|
{
|
struct ada_symbol_info *candidates;
|
struct ada_symbol_info *candidates;
|
int n_candidates;
|
int n_candidates;
|
|
|
n_candidates =
|
n_candidates =
|
ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
|
ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
|
(exp->elts[pc + 5].symbol),
|
(exp->elts[pc + 5].symbol),
|
exp->elts[pc + 4].block, VAR_DOMAIN,
|
exp->elts[pc + 4].block, VAR_DOMAIN,
|
&candidates);
|
&candidates);
|
if (n_candidates == 1)
|
if (n_candidates == 1)
|
i = 0;
|
i = 0;
|
else
|
else
|
{
|
{
|
i = ada_resolve_function
|
i = ada_resolve_function
|
(candidates, n_candidates,
|
(candidates, n_candidates,
|
argvec, nargs,
|
argvec, nargs,
|
SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
|
SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol),
|
context_type);
|
context_type);
|
if (i < 0)
|
if (i < 0)
|
error (_("Could not find a match for %s"),
|
error (_("Could not find a match for %s"),
|
SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
|
SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
|
}
|
}
|
|
|
exp->elts[pc + 4].block = candidates[i].block;
|
exp->elts[pc + 4].block = candidates[i].block;
|
exp->elts[pc + 5].symbol = candidates[i].sym;
|
exp->elts[pc + 5].symbol = candidates[i].sym;
|
if (innermost_block == NULL
|
if (innermost_block == NULL
|
|| contained_in (candidates[i].block, innermost_block))
|
|| contained_in (candidates[i].block, innermost_block))
|
innermost_block = candidates[i].block;
|
innermost_block = candidates[i].block;
|
}
|
}
|
}
|
}
|
break;
|
break;
|
case BINOP_ADD:
|
case BINOP_ADD:
|
case BINOP_SUB:
|
case BINOP_SUB:
|
case BINOP_MUL:
|
case BINOP_MUL:
|
case BINOP_DIV:
|
case BINOP_DIV:
|
case BINOP_REM:
|
case BINOP_REM:
|
case BINOP_MOD:
|
case BINOP_MOD:
|
case BINOP_CONCAT:
|
case BINOP_CONCAT:
|
case BINOP_BITWISE_AND:
|
case BINOP_BITWISE_AND:
|
case BINOP_BITWISE_IOR:
|
case BINOP_BITWISE_IOR:
|
case BINOP_BITWISE_XOR:
|
case BINOP_BITWISE_XOR:
|
case BINOP_EQUAL:
|
case BINOP_EQUAL:
|
case BINOP_NOTEQUAL:
|
case BINOP_NOTEQUAL:
|
case BINOP_LESS:
|
case BINOP_LESS:
|
case BINOP_GTR:
|
case BINOP_GTR:
|
case BINOP_LEQ:
|
case BINOP_LEQ:
|
case BINOP_GEQ:
|
case BINOP_GEQ:
|
case BINOP_EXP:
|
case BINOP_EXP:
|
case UNOP_NEG:
|
case UNOP_NEG:
|
case UNOP_PLUS:
|
case UNOP_PLUS:
|
case UNOP_LOGICAL_NOT:
|
case UNOP_LOGICAL_NOT:
|
case UNOP_ABS:
|
case UNOP_ABS:
|
if (possible_user_operator_p (op, argvec))
|
if (possible_user_operator_p (op, argvec))
|
{
|
{
|
struct ada_symbol_info *candidates;
|
struct ada_symbol_info *candidates;
|
int n_candidates;
|
int n_candidates;
|
|
|
n_candidates =
|
n_candidates =
|
ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
|
ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op)),
|
(struct block *) NULL, VAR_DOMAIN,
|
(struct block *) NULL, VAR_DOMAIN,
|
&candidates);
|
&candidates);
|
i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
|
i = ada_resolve_function (candidates, n_candidates, argvec, nargs,
|
ada_decoded_op_name (op), NULL);
|
ada_decoded_op_name (op), NULL);
|
if (i < 0)
|
if (i < 0)
|
break;
|
break;
|
|
|
replace_operator_with_call (expp, pc, nargs, 1,
|
replace_operator_with_call (expp, pc, nargs, 1,
|
candidates[i].sym, candidates[i].block);
|
candidates[i].sym, candidates[i].block);
|
exp = *expp;
|
exp = *expp;
|
}
|
}
|
break;
|
break;
|
|
|
case OP_TYPE:
|
case OP_TYPE:
|
case OP_REGISTER:
|
case OP_REGISTER:
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
*pos = pc;
|
*pos = pc;
|
return evaluate_subexp_type (exp, pos);
|
return evaluate_subexp_type (exp, pos);
|
}
|
}
|
|
|
/* Return non-zero if formal type FTYPE matches actual type ATYPE. If
|
/* Return non-zero if formal type FTYPE matches actual type ATYPE. If
|
MAY_DEREF is non-zero, the formal may be a pointer and the actual
|
MAY_DEREF is non-zero, the formal may be a pointer and the actual
|
a non-pointer. A type of 'void' (which is never a valid expression type)
|
a non-pointer. A type of 'void' (which is never a valid expression type)
|
by convention matches anything. */
|
by convention matches anything. */
|
/* The term "match" here is rather loose. The match is heuristic and
|
/* The term "match" here is rather loose. The match is heuristic and
|
liberal. FIXME: TOO liberal, in fact. */
|
liberal. FIXME: TOO liberal, in fact. */
|
|
|
static int
|
static int
|
ada_type_match (struct type *ftype, struct type *atype, int may_deref)
|
ada_type_match (struct type *ftype, struct type *atype, int may_deref)
|
{
|
{
|
ftype = ada_check_typedef (ftype);
|
ftype = ada_check_typedef (ftype);
|
atype = ada_check_typedef (atype);
|
atype = ada_check_typedef (atype);
|
|
|
if (TYPE_CODE (ftype) == TYPE_CODE_REF)
|
if (TYPE_CODE (ftype) == TYPE_CODE_REF)
|
ftype = TYPE_TARGET_TYPE (ftype);
|
ftype = TYPE_TARGET_TYPE (ftype);
|
if (TYPE_CODE (atype) == TYPE_CODE_REF)
|
if (TYPE_CODE (atype) == TYPE_CODE_REF)
|
atype = TYPE_TARGET_TYPE (atype);
|
atype = TYPE_TARGET_TYPE (atype);
|
|
|
if (TYPE_CODE (ftype) == TYPE_CODE_VOID
|
if (TYPE_CODE (ftype) == TYPE_CODE_VOID
|
|| TYPE_CODE (atype) == TYPE_CODE_VOID)
|
|| TYPE_CODE (atype) == TYPE_CODE_VOID)
|
return 1;
|
return 1;
|
|
|
switch (TYPE_CODE (ftype))
|
switch (TYPE_CODE (ftype))
|
{
|
{
|
default:
|
default:
|
return 1;
|
return 1;
|
case TYPE_CODE_PTR:
|
case TYPE_CODE_PTR:
|
if (TYPE_CODE (atype) == TYPE_CODE_PTR)
|
if (TYPE_CODE (atype) == TYPE_CODE_PTR)
|
return ada_type_match (TYPE_TARGET_TYPE (ftype),
|
return ada_type_match (TYPE_TARGET_TYPE (ftype),
|
TYPE_TARGET_TYPE (atype), 0);
|
TYPE_TARGET_TYPE (atype), 0);
|
else
|
else
|
return (may_deref
|
return (may_deref
|
&& ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
|
&& ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0));
|
case TYPE_CODE_INT:
|
case TYPE_CODE_INT:
|
case TYPE_CODE_ENUM:
|
case TYPE_CODE_ENUM:
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_RANGE:
|
switch (TYPE_CODE (atype))
|
switch (TYPE_CODE (atype))
|
{
|
{
|
case TYPE_CODE_INT:
|
case TYPE_CODE_INT:
|
case TYPE_CODE_ENUM:
|
case TYPE_CODE_ENUM:
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_RANGE:
|
return 1;
|
return 1;
|
default:
|
default:
|
return 0;
|
return 0;
|
}
|
}
|
|
|
case TYPE_CODE_ARRAY:
|
case TYPE_CODE_ARRAY:
|
return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
|
return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
|
|| ada_is_array_descriptor_type (atype));
|
|| ada_is_array_descriptor_type (atype));
|
|
|
case TYPE_CODE_STRUCT:
|
case TYPE_CODE_STRUCT:
|
if (ada_is_array_descriptor_type (ftype))
|
if (ada_is_array_descriptor_type (ftype))
|
return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
|
return (TYPE_CODE (atype) == TYPE_CODE_ARRAY
|
|| ada_is_array_descriptor_type (atype));
|
|| ada_is_array_descriptor_type (atype));
|
else
|
else
|
return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
|
return (TYPE_CODE (atype) == TYPE_CODE_STRUCT
|
&& !ada_is_array_descriptor_type (atype));
|
&& !ada_is_array_descriptor_type (atype));
|
|
|
case TYPE_CODE_UNION:
|
case TYPE_CODE_UNION:
|
case TYPE_CODE_FLT:
|
case TYPE_CODE_FLT:
|
return (TYPE_CODE (atype) == TYPE_CODE (ftype));
|
return (TYPE_CODE (atype) == TYPE_CODE (ftype));
|
}
|
}
|
}
|
}
|
|
|
/* Return non-zero if the formals of FUNC "sufficiently match" the
|
/* Return non-zero if the formals of FUNC "sufficiently match" the
|
vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
|
vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
|
may also be an enumeral, in which case it is treated as a 0-
|
may also be an enumeral, in which case it is treated as a 0-
|
argument function. */
|
argument function. */
|
|
|
static int
|
static int
|
ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
|
ada_args_match (struct symbol *func, struct value **actuals, int n_actuals)
|
{
|
{
|
int i;
|
int i;
|
struct type *func_type = SYMBOL_TYPE (func);
|
struct type *func_type = SYMBOL_TYPE (func);
|
|
|
if (SYMBOL_CLASS (func) == LOC_CONST
|
if (SYMBOL_CLASS (func) == LOC_CONST
|
&& TYPE_CODE (func_type) == TYPE_CODE_ENUM)
|
&& TYPE_CODE (func_type) == TYPE_CODE_ENUM)
|
return (n_actuals == 0);
|
return (n_actuals == 0);
|
else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
|
else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC)
|
return 0;
|
return 0;
|
|
|
if (TYPE_NFIELDS (func_type) != n_actuals)
|
if (TYPE_NFIELDS (func_type) != n_actuals)
|
return 0;
|
return 0;
|
|
|
for (i = 0; i < n_actuals; i += 1)
|
for (i = 0; i < n_actuals; i += 1)
|
{
|
{
|
if (actuals[i] == NULL)
|
if (actuals[i] == NULL)
|
return 0;
|
return 0;
|
else
|
else
|
{
|
{
|
struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type, i));
|
struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type, i));
|
struct type *atype = ada_check_typedef (value_type (actuals[i]));
|
struct type *atype = ada_check_typedef (value_type (actuals[i]));
|
|
|
if (!ada_type_match (ftype, atype, 1))
|
if (!ada_type_match (ftype, atype, 1))
|
return 0;
|
return 0;
|
}
|
}
|
}
|
}
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* False iff function type FUNC_TYPE definitely does not produce a value
|
/* False iff function type FUNC_TYPE definitely does not produce a value
|
compatible with type CONTEXT_TYPE. Conservatively returns 1 if
|
compatible with type CONTEXT_TYPE. Conservatively returns 1 if
|
FUNC_TYPE is not a valid function type with a non-null return type
|
FUNC_TYPE is not a valid function type with a non-null return type
|
or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
|
or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
|
|
|
static int
|
static int
|
return_match (struct type *func_type, struct type *context_type)
|
return_match (struct type *func_type, struct type *context_type)
|
{
|
{
|
struct type *return_type;
|
struct type *return_type;
|
|
|
if (func_type == NULL)
|
if (func_type == NULL)
|
return 1;
|
return 1;
|
|
|
if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
|
if (TYPE_CODE (func_type) == TYPE_CODE_FUNC)
|
return_type = base_type (TYPE_TARGET_TYPE (func_type));
|
return_type = base_type (TYPE_TARGET_TYPE (func_type));
|
else
|
else
|
return_type = base_type (func_type);
|
return_type = base_type (func_type);
|
if (return_type == NULL)
|
if (return_type == NULL)
|
return 1;
|
return 1;
|
|
|
context_type = base_type (context_type);
|
context_type = base_type (context_type);
|
|
|
if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
|
if (TYPE_CODE (return_type) == TYPE_CODE_ENUM)
|
return context_type == NULL || return_type == context_type;
|
return context_type == NULL || return_type == context_type;
|
else if (context_type == NULL)
|
else if (context_type == NULL)
|
return TYPE_CODE (return_type) != TYPE_CODE_VOID;
|
return TYPE_CODE (return_type) != TYPE_CODE_VOID;
|
else
|
else
|
return TYPE_CODE (return_type) == TYPE_CODE (context_type);
|
return TYPE_CODE (return_type) == TYPE_CODE (context_type);
|
}
|
}
|
|
|
|
|
/* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
|
/* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
|
function (if any) that matches the types of the NARGS arguments in
|
function (if any) that matches the types of the NARGS arguments in
|
ARGS. If CONTEXT_TYPE is non-null and there is at least one match
|
ARGS. If CONTEXT_TYPE is non-null and there is at least one match
|
that returns that type, then eliminate matches that don't. If
|
that returns that type, then eliminate matches that don't. If
|
CONTEXT_TYPE is void and there is at least one match that does not
|
CONTEXT_TYPE is void and there is at least one match that does not
|
return void, eliminate all matches that do.
|
return void, eliminate all matches that do.
|
|
|
Asks the user if there is more than one match remaining. Returns -1
|
Asks the user if there is more than one match remaining. Returns -1
|
if there is no such symbol or none is selected. NAME is used
|
if there is no such symbol or none is selected. NAME is used
|
solely for messages. May re-arrange and modify SYMS in
|
solely for messages. May re-arrange and modify SYMS in
|
the process; the index returned is for the modified vector. */
|
the process; the index returned is for the modified vector. */
|
|
|
static int
|
static int
|
ada_resolve_function (struct ada_symbol_info syms[],
|
ada_resolve_function (struct ada_symbol_info syms[],
|
int nsyms, struct value **args, int nargs,
|
int nsyms, struct value **args, int nargs,
|
const char *name, struct type *context_type)
|
const char *name, struct type *context_type)
|
{
|
{
|
int k;
|
int k;
|
int m; /* Number of hits */
|
int m; /* Number of hits */
|
struct type *fallback;
|
struct type *fallback;
|
struct type *return_type;
|
struct type *return_type;
|
|
|
return_type = context_type;
|
return_type = context_type;
|
if (context_type == NULL)
|
if (context_type == NULL)
|
fallback = builtin_type_void;
|
fallback = builtin_type_void;
|
else
|
else
|
fallback = NULL;
|
fallback = NULL;
|
|
|
m = 0;
|
m = 0;
|
while (1)
|
while (1)
|
{
|
{
|
for (k = 0; k < nsyms; k += 1)
|
for (k = 0; k < nsyms; k += 1)
|
{
|
{
|
struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
|
struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].sym));
|
|
|
if (ada_args_match (syms[k].sym, args, nargs)
|
if (ada_args_match (syms[k].sym, args, nargs)
|
&& return_match (type, return_type))
|
&& return_match (type, return_type))
|
{
|
{
|
syms[m] = syms[k];
|
syms[m] = syms[k];
|
m += 1;
|
m += 1;
|
}
|
}
|
}
|
}
|
if (m > 0 || return_type == fallback)
|
if (m > 0 || return_type == fallback)
|
break;
|
break;
|
else
|
else
|
return_type = fallback;
|
return_type = fallback;
|
}
|
}
|
|
|
if (m == 0)
|
if (m == 0)
|
return -1;
|
return -1;
|
else if (m > 1)
|
else if (m > 1)
|
{
|
{
|
printf_filtered (_("Multiple matches for %s\n"), name);
|
printf_filtered (_("Multiple matches for %s\n"), name);
|
user_select_syms (syms, m, 1);
|
user_select_syms (syms, m, 1);
|
return 0;
|
return 0;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Returns true (non-zero) iff decoded name N0 should appear before N1
|
/* Returns true (non-zero) iff decoded name N0 should appear before N1
|
in a listing of choices during disambiguation (see sort_choices, below).
|
in a listing of choices during disambiguation (see sort_choices, below).
|
The idea is that overloadings of a subprogram name from the
|
The idea is that overloadings of a subprogram name from the
|
same package should sort in their source order. We settle for ordering
|
same package should sort in their source order. We settle for ordering
|
such symbols by their trailing number (__N or $N). */
|
such symbols by their trailing number (__N or $N). */
|
|
|
static int
|
static int
|
encoded_ordered_before (char *N0, char *N1)
|
encoded_ordered_before (char *N0, char *N1)
|
{
|
{
|
if (N1 == NULL)
|
if (N1 == NULL)
|
return 0;
|
return 0;
|
else if (N0 == NULL)
|
else if (N0 == NULL)
|
return 1;
|
return 1;
|
else
|
else
|
{
|
{
|
int k0, k1;
|
int k0, k1;
|
for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
|
for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1)
|
;
|
;
|
for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
|
for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1)
|
;
|
;
|
if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
|
if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000'
|
&& (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
|
&& (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000')
|
{
|
{
|
int n0, n1;
|
int n0, n1;
|
n0 = k0;
|
n0 = k0;
|
while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
|
while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_')
|
n0 -= 1;
|
n0 -= 1;
|
n1 = k1;
|
n1 = k1;
|
while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
|
while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_')
|
n1 -= 1;
|
n1 -= 1;
|
if (n0 == n1 && strncmp (N0, N1, n0) == 0)
|
if (n0 == n1 && strncmp (N0, N1, n0) == 0)
|
return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
|
return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1));
|
}
|
}
|
return (strcmp (N0, N1) < 0);
|
return (strcmp (N0, N1) < 0);
|
}
|
}
|
}
|
}
|
|
|
/* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
|
/* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
|
encoded names. */
|
encoded names. */
|
|
|
static void
|
static void
|
sort_choices (struct ada_symbol_info syms[], int nsyms)
|
sort_choices (struct ada_symbol_info syms[], int nsyms)
|
{
|
{
|
int i;
|
int i;
|
for (i = 1; i < nsyms; i += 1)
|
for (i = 1; i < nsyms; i += 1)
|
{
|
{
|
struct ada_symbol_info sym = syms[i];
|
struct ada_symbol_info sym = syms[i];
|
int j;
|
int j;
|
|
|
for (j = i - 1; j >= 0; j -= 1)
|
for (j = i - 1; j >= 0; j -= 1)
|
{
|
{
|
if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
|
if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].sym),
|
SYMBOL_LINKAGE_NAME (sym.sym)))
|
SYMBOL_LINKAGE_NAME (sym.sym)))
|
break;
|
break;
|
syms[j + 1] = syms[j];
|
syms[j + 1] = syms[j];
|
}
|
}
|
syms[j + 1] = sym;
|
syms[j + 1] = sym;
|
}
|
}
|
}
|
}
|
|
|
/* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
|
/* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
|
by asking the user (if necessary), returning the number selected,
|
by asking the user (if necessary), returning the number selected,
|
and setting the first elements of SYMS items. Error if no symbols
|
and setting the first elements of SYMS items. Error if no symbols
|
selected. */
|
selected. */
|
|
|
/* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
|
/* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
|
to be re-integrated one of these days. */
|
to be re-integrated one of these days. */
|
|
|
int
|
int
|
user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
|
user_select_syms (struct ada_symbol_info *syms, int nsyms, int max_results)
|
{
|
{
|
int i;
|
int i;
|
int *chosen = (int *) alloca (sizeof (int) * nsyms);
|
int *chosen = (int *) alloca (sizeof (int) * nsyms);
|
int n_chosen;
|
int n_chosen;
|
int first_choice = (max_results == 1) ? 1 : 2;
|
int first_choice = (max_results == 1) ? 1 : 2;
|
|
|
if (max_results < 1)
|
if (max_results < 1)
|
error (_("Request to select 0 symbols!"));
|
error (_("Request to select 0 symbols!"));
|
if (nsyms <= 1)
|
if (nsyms <= 1)
|
return nsyms;
|
return nsyms;
|
|
|
printf_unfiltered (_("[0] cancel\n"));
|
printf_unfiltered (_("[0] cancel\n"));
|
if (max_results > 1)
|
if (max_results > 1)
|
printf_unfiltered (_("[1] all\n"));
|
printf_unfiltered (_("[1] all\n"));
|
|
|
sort_choices (syms, nsyms);
|
sort_choices (syms, nsyms);
|
|
|
for (i = 0; i < nsyms; i += 1)
|
for (i = 0; i < nsyms; i += 1)
|
{
|
{
|
if (syms[i].sym == NULL)
|
if (syms[i].sym == NULL)
|
continue;
|
continue;
|
|
|
if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
|
if (SYMBOL_CLASS (syms[i].sym) == LOC_BLOCK)
|
{
|
{
|
struct symtab_and_line sal =
|
struct symtab_and_line sal =
|
find_function_start_sal (syms[i].sym, 1);
|
find_function_start_sal (syms[i].sym, 1);
|
if (sal.symtab == NULL)
|
if (sal.symtab == NULL)
|
printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
|
printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
|
i + first_choice,
|
i + first_choice,
|
SYMBOL_PRINT_NAME (syms[i].sym),
|
SYMBOL_PRINT_NAME (syms[i].sym),
|
sal.line);
|
sal.line);
|
else
|
else
|
printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
|
printf_unfiltered (_("[%d] %s at %s:%d\n"), i + first_choice,
|
SYMBOL_PRINT_NAME (syms[i].sym),
|
SYMBOL_PRINT_NAME (syms[i].sym),
|
sal.symtab->filename, sal.line);
|
sal.symtab->filename, sal.line);
|
continue;
|
continue;
|
}
|
}
|
else
|
else
|
{
|
{
|
int is_enumeral =
|
int is_enumeral =
|
(SYMBOL_CLASS (syms[i].sym) == LOC_CONST
|
(SYMBOL_CLASS (syms[i].sym) == LOC_CONST
|
&& SYMBOL_TYPE (syms[i].sym) != NULL
|
&& SYMBOL_TYPE (syms[i].sym) != NULL
|
&& TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
|
&& TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) == TYPE_CODE_ENUM);
|
struct symtab *symtab = symtab_for_sym (syms[i].sym);
|
struct symtab *symtab = symtab_for_sym (syms[i].sym);
|
|
|
if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
|
if (SYMBOL_LINE (syms[i].sym) != 0 && symtab != NULL)
|
printf_unfiltered (_("[%d] %s at %s:%d\n"),
|
printf_unfiltered (_("[%d] %s at %s:%d\n"),
|
i + first_choice,
|
i + first_choice,
|
SYMBOL_PRINT_NAME (syms[i].sym),
|
SYMBOL_PRINT_NAME (syms[i].sym),
|
symtab->filename, SYMBOL_LINE (syms[i].sym));
|
symtab->filename, SYMBOL_LINE (syms[i].sym));
|
else if (is_enumeral
|
else if (is_enumeral
|
&& TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
|
&& TYPE_NAME (SYMBOL_TYPE (syms[i].sym)) != NULL)
|
{
|
{
|
printf_unfiltered (("[%d] "), i + first_choice);
|
printf_unfiltered (("[%d] "), i + first_choice);
|
ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
|
ada_print_type (SYMBOL_TYPE (syms[i].sym), NULL,
|
gdb_stdout, -1, 0);
|
gdb_stdout, -1, 0);
|
printf_unfiltered (_("'(%s) (enumeral)\n"),
|
printf_unfiltered (_("'(%s) (enumeral)\n"),
|
SYMBOL_PRINT_NAME (syms[i].sym));
|
SYMBOL_PRINT_NAME (syms[i].sym));
|
}
|
}
|
else if (symtab != NULL)
|
else if (symtab != NULL)
|
printf_unfiltered (is_enumeral
|
printf_unfiltered (is_enumeral
|
? _("[%d] %s in %s (enumeral)\n")
|
? _("[%d] %s in %s (enumeral)\n")
|
: _("[%d] %s at %s:?\n"),
|
: _("[%d] %s at %s:?\n"),
|
i + first_choice,
|
i + first_choice,
|
SYMBOL_PRINT_NAME (syms[i].sym),
|
SYMBOL_PRINT_NAME (syms[i].sym),
|
symtab->filename);
|
symtab->filename);
|
else
|
else
|
printf_unfiltered (is_enumeral
|
printf_unfiltered (is_enumeral
|
? _("[%d] %s (enumeral)\n")
|
? _("[%d] %s (enumeral)\n")
|
: _("[%d] %s at ?\n"),
|
: _("[%d] %s at ?\n"),
|
i + first_choice,
|
i + first_choice,
|
SYMBOL_PRINT_NAME (syms[i].sym));
|
SYMBOL_PRINT_NAME (syms[i].sym));
|
}
|
}
|
}
|
}
|
|
|
n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
|
n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1,
|
"overload-choice");
|
"overload-choice");
|
|
|
for (i = 0; i < n_chosen; i += 1)
|
for (i = 0; i < n_chosen; i += 1)
|
syms[i] = syms[chosen[i]];
|
syms[i] = syms[chosen[i]];
|
|
|
return n_chosen;
|
return n_chosen;
|
}
|
}
|
|
|
/* Read and validate a set of numeric choices from the user in the
|
/* Read and validate a set of numeric choices from the user in the
|
range 0 .. N_CHOICES-1. Place the results in increasing
|
range 0 .. N_CHOICES-1. Place the results in increasing
|
order in CHOICES[0 .. N-1], and return N.
|
order in CHOICES[0 .. N-1], and return N.
|
|
|
The user types choices as a sequence of numbers on one line
|
The user types choices as a sequence of numbers on one line
|
separated by blanks, encoding them as follows:
|
separated by blanks, encoding them as follows:
|
|
|
+ A choice of 0 means to cancel the selection, throwing an error.
|
+ A choice of 0 means to cancel the selection, throwing an error.
|
+ If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
|
+ If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
|
+ The user chooses k by typing k+IS_ALL_CHOICE+1.
|
+ The user chooses k by typing k+IS_ALL_CHOICE+1.
|
|
|
The user is not allowed to choose more than MAX_RESULTS values.
|
The user is not allowed to choose more than MAX_RESULTS values.
|
|
|
ANNOTATION_SUFFIX, if present, is used to annotate the input
|
ANNOTATION_SUFFIX, if present, is used to annotate the input
|
prompts (for use with the -f switch). */
|
prompts (for use with the -f switch). */
|
|
|
int
|
int
|
get_selections (int *choices, int n_choices, int max_results,
|
get_selections (int *choices, int n_choices, int max_results,
|
int is_all_choice, char *annotation_suffix)
|
int is_all_choice, char *annotation_suffix)
|
{
|
{
|
char *args;
|
char *args;
|
const char *prompt;
|
const char *prompt;
|
int n_chosen;
|
int n_chosen;
|
int first_choice = is_all_choice ? 2 : 1;
|
int first_choice = is_all_choice ? 2 : 1;
|
|
|
prompt = getenv ("PS2");
|
prompt = getenv ("PS2");
|
if (prompt == NULL)
|
if (prompt == NULL)
|
prompt = ">";
|
prompt = ">";
|
|
|
printf_unfiltered (("%s "), prompt);
|
printf_unfiltered (("%s "), prompt);
|
gdb_flush (gdb_stdout);
|
gdb_flush (gdb_stdout);
|
|
|
args = command_line_input ((char *) NULL, 0, annotation_suffix);
|
args = command_line_input ((char *) NULL, 0, annotation_suffix);
|
|
|
if (args == NULL)
|
if (args == NULL)
|
error_no_arg (_("one or more choice numbers"));
|
error_no_arg (_("one or more choice numbers"));
|
|
|
n_chosen = 0;
|
n_chosen = 0;
|
|
|
/* Set choices[0 .. n_chosen-1] to the users' choices in ascending
|
/* Set choices[0 .. n_chosen-1] to the users' choices in ascending
|
order, as given in args. Choices are validated. */
|
order, as given in args. Choices are validated. */
|
while (1)
|
while (1)
|
{
|
{
|
char *args2;
|
char *args2;
|
int choice, j;
|
int choice, j;
|
|
|
while (isspace (*args))
|
while (isspace (*args))
|
args += 1;
|
args += 1;
|
if (*args == '\0' && n_chosen == 0)
|
if (*args == '\0' && n_chosen == 0)
|
error_no_arg (_("one or more choice numbers"));
|
error_no_arg (_("one or more choice numbers"));
|
else if (*args == '\0')
|
else if (*args == '\0')
|
break;
|
break;
|
|
|
choice = strtol (args, &args2, 10);
|
choice = strtol (args, &args2, 10);
|
if (args == args2 || choice < 0
|
if (args == args2 || choice < 0
|
|| choice > n_choices + first_choice - 1)
|
|| choice > n_choices + first_choice - 1)
|
error (_("Argument must be choice number"));
|
error (_("Argument must be choice number"));
|
args = args2;
|
args = args2;
|
|
|
if (choice == 0)
|
if (choice == 0)
|
error (_("cancelled"));
|
error (_("cancelled"));
|
|
|
if (choice < first_choice)
|
if (choice < first_choice)
|
{
|
{
|
n_chosen = n_choices;
|
n_chosen = n_choices;
|
for (j = 0; j < n_choices; j += 1)
|
for (j = 0; j < n_choices; j += 1)
|
choices[j] = j;
|
choices[j] = j;
|
break;
|
break;
|
}
|
}
|
choice -= first_choice;
|
choice -= first_choice;
|
|
|
for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
|
for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1)
|
{
|
{
|
}
|
}
|
|
|
if (j < 0 || choice != choices[j])
|
if (j < 0 || choice != choices[j])
|
{
|
{
|
int k;
|
int k;
|
for (k = n_chosen - 1; k > j; k -= 1)
|
for (k = n_chosen - 1; k > j; k -= 1)
|
choices[k + 1] = choices[k];
|
choices[k + 1] = choices[k];
|
choices[j + 1] = choice;
|
choices[j + 1] = choice;
|
n_chosen += 1;
|
n_chosen += 1;
|
}
|
}
|
}
|
}
|
|
|
if (n_chosen > max_results)
|
if (n_chosen > max_results)
|
error (_("Select no more than %d of the above"), max_results);
|
error (_("Select no more than %d of the above"), max_results);
|
|
|
return n_chosen;
|
return n_chosen;
|
}
|
}
|
|
|
/* Replace the operator of length OPLEN at position PC in *EXPP with a call
|
/* Replace the operator of length OPLEN at position PC in *EXPP with a call
|
on the function identified by SYM and BLOCK, and taking NARGS
|
on the function identified by SYM and BLOCK, and taking NARGS
|
arguments. Update *EXPP as needed to hold more space. */
|
arguments. Update *EXPP as needed to hold more space. */
|
|
|
static void
|
static void
|
replace_operator_with_call (struct expression **expp, int pc, int nargs,
|
replace_operator_with_call (struct expression **expp, int pc, int nargs,
|
int oplen, struct symbol *sym,
|
int oplen, struct symbol *sym,
|
struct block *block)
|
struct block *block)
|
{
|
{
|
/* A new expression, with 6 more elements (3 for funcall, 4 for function
|
/* A new expression, with 6 more elements (3 for funcall, 4 for function
|
symbol, -oplen for operator being replaced). */
|
symbol, -oplen for operator being replaced). */
|
struct expression *newexp = (struct expression *)
|
struct expression *newexp = (struct expression *)
|
xmalloc (sizeof (struct expression)
|
xmalloc (sizeof (struct expression)
|
+ EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
|
+ EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen));
|
struct expression *exp = *expp;
|
struct expression *exp = *expp;
|
|
|
newexp->nelts = exp->nelts + 7 - oplen;
|
newexp->nelts = exp->nelts + 7 - oplen;
|
newexp->language_defn = exp->language_defn;
|
newexp->language_defn = exp->language_defn;
|
memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
|
memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc));
|
memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
|
memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen,
|
EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
|
EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen));
|
|
|
newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
|
newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL;
|
newexp->elts[pc + 1].longconst = (LONGEST) nargs;
|
newexp->elts[pc + 1].longconst = (LONGEST) nargs;
|
|
|
newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
|
newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE;
|
newexp->elts[pc + 4].block = block;
|
newexp->elts[pc + 4].block = block;
|
newexp->elts[pc + 5].symbol = sym;
|
newexp->elts[pc + 5].symbol = sym;
|
|
|
*expp = newexp;
|
*expp = newexp;
|
xfree (exp);
|
xfree (exp);
|
}
|
}
|
|
|
/* Type-class predicates */
|
/* Type-class predicates */
|
|
|
/* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
|
/* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
|
or FLOAT). */
|
or FLOAT). */
|
|
|
static int
|
static int
|
numeric_type_p (struct type *type)
|
numeric_type_p (struct type *type)
|
{
|
{
|
if (type == NULL)
|
if (type == NULL)
|
return 0;
|
return 0;
|
else
|
else
|
{
|
{
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
case TYPE_CODE_INT:
|
case TYPE_CODE_INT:
|
case TYPE_CODE_FLT:
|
case TYPE_CODE_FLT:
|
return 1;
|
return 1;
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_RANGE:
|
return (type == TYPE_TARGET_TYPE (type)
|
return (type == TYPE_TARGET_TYPE (type)
|
|| numeric_type_p (TYPE_TARGET_TYPE (type)));
|
|| numeric_type_p (TYPE_TARGET_TYPE (type)));
|
default:
|
default:
|
return 0;
|
return 0;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* True iff TYPE is integral (an INT or RANGE of INTs). */
|
/* True iff TYPE is integral (an INT or RANGE of INTs). */
|
|
|
static int
|
static int
|
integer_type_p (struct type *type)
|
integer_type_p (struct type *type)
|
{
|
{
|
if (type == NULL)
|
if (type == NULL)
|
return 0;
|
return 0;
|
else
|
else
|
{
|
{
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
case TYPE_CODE_INT:
|
case TYPE_CODE_INT:
|
return 1;
|
return 1;
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_RANGE:
|
return (type == TYPE_TARGET_TYPE (type)
|
return (type == TYPE_TARGET_TYPE (type)
|
|| integer_type_p (TYPE_TARGET_TYPE (type)));
|
|| integer_type_p (TYPE_TARGET_TYPE (type)));
|
default:
|
default:
|
return 0;
|
return 0;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
|
/* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
|
|
|
static int
|
static int
|
scalar_type_p (struct type *type)
|
scalar_type_p (struct type *type)
|
{
|
{
|
if (type == NULL)
|
if (type == NULL)
|
return 0;
|
return 0;
|
else
|
else
|
{
|
{
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
case TYPE_CODE_INT:
|
case TYPE_CODE_INT:
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_ENUM:
|
case TYPE_CODE_ENUM:
|
case TYPE_CODE_FLT:
|
case TYPE_CODE_FLT:
|
return 1;
|
return 1;
|
default:
|
default:
|
return 0;
|
return 0;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* True iff TYPE is discrete (INT, RANGE, ENUM). */
|
/* True iff TYPE is discrete (INT, RANGE, ENUM). */
|
|
|
static int
|
static int
|
discrete_type_p (struct type *type)
|
discrete_type_p (struct type *type)
|
{
|
{
|
if (type == NULL)
|
if (type == NULL)
|
return 0;
|
return 0;
|
else
|
else
|
{
|
{
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
case TYPE_CODE_INT:
|
case TYPE_CODE_INT:
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_ENUM:
|
case TYPE_CODE_ENUM:
|
return 1;
|
return 1;
|
default:
|
default:
|
return 0;
|
return 0;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* Returns non-zero if OP with operands in the vector ARGS could be
|
/* Returns non-zero if OP with operands in the vector ARGS could be
|
a user-defined function. Errs on the side of pre-defined operators
|
a user-defined function. Errs on the side of pre-defined operators
|
(i.e., result 0). */
|
(i.e., result 0). */
|
|
|
static int
|
static int
|
possible_user_operator_p (enum exp_opcode op, struct value *args[])
|
possible_user_operator_p (enum exp_opcode op, struct value *args[])
|
{
|
{
|
struct type *type0 =
|
struct type *type0 =
|
(args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
|
(args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0]));
|
struct type *type1 =
|
struct type *type1 =
|
(args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
|
(args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1]));
|
|
|
if (type0 == NULL)
|
if (type0 == NULL)
|
return 0;
|
return 0;
|
|
|
switch (op)
|
switch (op)
|
{
|
{
|
default:
|
default:
|
return 0;
|
return 0;
|
|
|
case BINOP_ADD:
|
case BINOP_ADD:
|
case BINOP_SUB:
|
case BINOP_SUB:
|
case BINOP_MUL:
|
case BINOP_MUL:
|
case BINOP_DIV:
|
case BINOP_DIV:
|
return (!(numeric_type_p (type0) && numeric_type_p (type1)));
|
return (!(numeric_type_p (type0) && numeric_type_p (type1)));
|
|
|
case BINOP_REM:
|
case BINOP_REM:
|
case BINOP_MOD:
|
case BINOP_MOD:
|
case BINOP_BITWISE_AND:
|
case BINOP_BITWISE_AND:
|
case BINOP_BITWISE_IOR:
|
case BINOP_BITWISE_IOR:
|
case BINOP_BITWISE_XOR:
|
case BINOP_BITWISE_XOR:
|
return (!(integer_type_p (type0) && integer_type_p (type1)));
|
return (!(integer_type_p (type0) && integer_type_p (type1)));
|
|
|
case BINOP_EQUAL:
|
case BINOP_EQUAL:
|
case BINOP_NOTEQUAL:
|
case BINOP_NOTEQUAL:
|
case BINOP_LESS:
|
case BINOP_LESS:
|
case BINOP_GTR:
|
case BINOP_GTR:
|
case BINOP_LEQ:
|
case BINOP_LEQ:
|
case BINOP_GEQ:
|
case BINOP_GEQ:
|
return (!(scalar_type_p (type0) && scalar_type_p (type1)));
|
return (!(scalar_type_p (type0) && scalar_type_p (type1)));
|
|
|
case BINOP_CONCAT:
|
case BINOP_CONCAT:
|
return !ada_is_array_type (type0) || !ada_is_array_type (type1);
|
return !ada_is_array_type (type0) || !ada_is_array_type (type1);
|
|
|
case BINOP_EXP:
|
case BINOP_EXP:
|
return (!(numeric_type_p (type0) && integer_type_p (type1)));
|
return (!(numeric_type_p (type0) && integer_type_p (type1)));
|
|
|
case UNOP_NEG:
|
case UNOP_NEG:
|
case UNOP_PLUS:
|
case UNOP_PLUS:
|
case UNOP_LOGICAL_NOT:
|
case UNOP_LOGICAL_NOT:
|
case UNOP_ABS:
|
case UNOP_ABS:
|
return (!numeric_type_p (type0));
|
return (!numeric_type_p (type0));
|
|
|
}
|
}
|
}
|
}
|
|
|
/* Renaming */
|
/* Renaming */
|
|
|
/* NOTES:
|
/* NOTES:
|
|
|
1. In the following, we assume that a renaming type's name may
|
1. In the following, we assume that a renaming type's name may
|
have an ___XD suffix. It would be nice if this went away at some
|
have an ___XD suffix. It would be nice if this went away at some
|
point.
|
point.
|
2. We handle both the (old) purely type-based representation of
|
2. We handle both the (old) purely type-based representation of
|
renamings and the (new) variable-based encoding. At some point,
|
renamings and the (new) variable-based encoding. At some point,
|
it is devoutly to be hoped that the former goes away
|
it is devoutly to be hoped that the former goes away
|
(FIXME: hilfinger-2007-07-09).
|
(FIXME: hilfinger-2007-07-09).
|
3. Subprogram renamings are not implemented, although the XRS
|
3. Subprogram renamings are not implemented, although the XRS
|
suffix is recognized (FIXME: hilfinger-2007-07-09). */
|
suffix is recognized (FIXME: hilfinger-2007-07-09). */
|
|
|
/* If SYM encodes a renaming,
|
/* If SYM encodes a renaming,
|
|
|
<renaming> renames <renamed entity>,
|
<renaming> renames <renamed entity>,
|
|
|
sets *LEN to the length of the renamed entity's name,
|
sets *LEN to the length of the renamed entity's name,
|
*RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
|
*RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
|
the string describing the subcomponent selected from the renamed
|
the string describing the subcomponent selected from the renamed
|
entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
|
entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
|
(in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
|
(in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
|
are undefined). Otherwise, returns a value indicating the category
|
are undefined). Otherwise, returns a value indicating the category
|
of entity renamed: an object (ADA_OBJECT_RENAMING), exception
|
of entity renamed: an object (ADA_OBJECT_RENAMING), exception
|
(ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
|
(ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
|
subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
|
subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
|
strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
|
strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
|
deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
|
deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
|
may be NULL, in which case they are not assigned.
|
may be NULL, in which case they are not assigned.
|
|
|
[Currently, however, GCC does not generate subprogram renamings.] */
|
[Currently, however, GCC does not generate subprogram renamings.] */
|
|
|
enum ada_renaming_category
|
enum ada_renaming_category
|
ada_parse_renaming (struct symbol *sym,
|
ada_parse_renaming (struct symbol *sym,
|
const char **renamed_entity, int *len,
|
const char **renamed_entity, int *len,
|
const char **renaming_expr)
|
const char **renaming_expr)
|
{
|
{
|
enum ada_renaming_category kind;
|
enum ada_renaming_category kind;
|
const char *info;
|
const char *info;
|
const char *suffix;
|
const char *suffix;
|
|
|
if (sym == NULL)
|
if (sym == NULL)
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
switch (SYMBOL_CLASS (sym))
|
switch (SYMBOL_CLASS (sym))
|
{
|
{
|
default:
|
default:
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
case LOC_TYPEDEF:
|
case LOC_TYPEDEF:
|
return parse_old_style_renaming (SYMBOL_TYPE (sym),
|
return parse_old_style_renaming (SYMBOL_TYPE (sym),
|
renamed_entity, len, renaming_expr);
|
renamed_entity, len, renaming_expr);
|
case LOC_LOCAL:
|
case LOC_LOCAL:
|
case LOC_STATIC:
|
case LOC_STATIC:
|
case LOC_COMPUTED:
|
case LOC_COMPUTED:
|
case LOC_OPTIMIZED_OUT:
|
case LOC_OPTIMIZED_OUT:
|
info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
|
info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR");
|
if (info == NULL)
|
if (info == NULL)
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
switch (info[5])
|
switch (info[5])
|
{
|
{
|
case '_':
|
case '_':
|
kind = ADA_OBJECT_RENAMING;
|
kind = ADA_OBJECT_RENAMING;
|
info += 6;
|
info += 6;
|
break;
|
break;
|
case 'E':
|
case 'E':
|
kind = ADA_EXCEPTION_RENAMING;
|
kind = ADA_EXCEPTION_RENAMING;
|
info += 7;
|
info += 7;
|
break;
|
break;
|
case 'P':
|
case 'P':
|
kind = ADA_PACKAGE_RENAMING;
|
kind = ADA_PACKAGE_RENAMING;
|
info += 7;
|
info += 7;
|
break;
|
break;
|
case 'S':
|
case 'S':
|
kind = ADA_SUBPROGRAM_RENAMING;
|
kind = ADA_SUBPROGRAM_RENAMING;
|
info += 7;
|
info += 7;
|
break;
|
break;
|
default:
|
default:
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
}
|
}
|
}
|
}
|
|
|
if (renamed_entity != NULL)
|
if (renamed_entity != NULL)
|
*renamed_entity = info;
|
*renamed_entity = info;
|
suffix = strstr (info, "___XE");
|
suffix = strstr (info, "___XE");
|
if (suffix == NULL || suffix == info)
|
if (suffix == NULL || suffix == info)
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
if (len != NULL)
|
if (len != NULL)
|
*len = strlen (info) - strlen (suffix);
|
*len = strlen (info) - strlen (suffix);
|
suffix += 5;
|
suffix += 5;
|
if (renaming_expr != NULL)
|
if (renaming_expr != NULL)
|
*renaming_expr = suffix;
|
*renaming_expr = suffix;
|
return kind;
|
return kind;
|
}
|
}
|
|
|
/* Assuming TYPE encodes a renaming according to the old encoding in
|
/* Assuming TYPE encodes a renaming according to the old encoding in
|
exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
|
exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
|
*LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
|
*LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
|
ADA_NOT_RENAMING otherwise. */
|
ADA_NOT_RENAMING otherwise. */
|
static enum ada_renaming_category
|
static enum ada_renaming_category
|
parse_old_style_renaming (struct type *type,
|
parse_old_style_renaming (struct type *type,
|
const char **renamed_entity, int *len,
|
const char **renamed_entity, int *len,
|
const char **renaming_expr)
|
const char **renaming_expr)
|
{
|
{
|
enum ada_renaming_category kind;
|
enum ada_renaming_category kind;
|
const char *name;
|
const char *name;
|
const char *info;
|
const char *info;
|
const char *suffix;
|
const char *suffix;
|
|
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
|
|| TYPE_NFIELDS (type) != 1)
|
|| TYPE_NFIELDS (type) != 1)
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
|
|
name = type_name_no_tag (type);
|
name = type_name_no_tag (type);
|
if (name == NULL)
|
if (name == NULL)
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
|
|
name = strstr (name, "___XR");
|
name = strstr (name, "___XR");
|
if (name == NULL)
|
if (name == NULL)
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
switch (name[5])
|
switch (name[5])
|
{
|
{
|
case '\0':
|
case '\0':
|
case '_':
|
case '_':
|
kind = ADA_OBJECT_RENAMING;
|
kind = ADA_OBJECT_RENAMING;
|
break;
|
break;
|
case 'E':
|
case 'E':
|
kind = ADA_EXCEPTION_RENAMING;
|
kind = ADA_EXCEPTION_RENAMING;
|
break;
|
break;
|
case 'P':
|
case 'P':
|
kind = ADA_PACKAGE_RENAMING;
|
kind = ADA_PACKAGE_RENAMING;
|
break;
|
break;
|
case 'S':
|
case 'S':
|
kind = ADA_SUBPROGRAM_RENAMING;
|
kind = ADA_SUBPROGRAM_RENAMING;
|
break;
|
break;
|
default:
|
default:
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
}
|
}
|
|
|
info = TYPE_FIELD_NAME (type, 0);
|
info = TYPE_FIELD_NAME (type, 0);
|
if (info == NULL)
|
if (info == NULL)
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
if (renamed_entity != NULL)
|
if (renamed_entity != NULL)
|
*renamed_entity = info;
|
*renamed_entity = info;
|
suffix = strstr (info, "___XE");
|
suffix = strstr (info, "___XE");
|
if (renaming_expr != NULL)
|
if (renaming_expr != NULL)
|
*renaming_expr = suffix + 5;
|
*renaming_expr = suffix + 5;
|
if (suffix == NULL || suffix == info)
|
if (suffix == NULL || suffix == info)
|
return ADA_NOT_RENAMING;
|
return ADA_NOT_RENAMING;
|
if (len != NULL)
|
if (len != NULL)
|
*len = suffix - info;
|
*len = suffix - info;
|
return kind;
|
return kind;
|
}
|
}
|
|
|
|
|
|
|
/* Evaluation: Function Calls */
|
/* Evaluation: Function Calls */
|
|
|
/* Return an lvalue containing the value VAL. This is the identity on
|
/* Return an lvalue containing the value VAL. This is the identity on
|
lvalues, and otherwise has the side-effect of pushing a copy of VAL
|
lvalues, and otherwise has the side-effect of pushing a copy of VAL
|
on the stack, using and updating *SP as the stack pointer, and
|
on the stack, using and updating *SP as the stack pointer, and
|
returning an lvalue whose VALUE_ADDRESS points to the copy. */
|
returning an lvalue whose VALUE_ADDRESS points to the copy. */
|
|
|
static struct value *
|
static struct value *
|
ensure_lval (struct value *val, CORE_ADDR *sp)
|
ensure_lval (struct value *val, CORE_ADDR *sp)
|
{
|
{
|
if (! VALUE_LVAL (val))
|
if (! VALUE_LVAL (val))
|
{
|
{
|
int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
|
int len = TYPE_LENGTH (ada_check_typedef (value_type (val)));
|
|
|
/* The following is taken from the structure-return code in
|
/* The following is taken from the structure-return code in
|
call_function_by_hand. FIXME: Therefore, some refactoring seems
|
call_function_by_hand. FIXME: Therefore, some refactoring seems
|
indicated. */
|
indicated. */
|
if (gdbarch_inner_than (current_gdbarch, 1, 2))
|
if (gdbarch_inner_than (current_gdbarch, 1, 2))
|
{
|
{
|
/* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
|
/* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
|
reserving sufficient space. */
|
reserving sufficient space. */
|
*sp -= len;
|
*sp -= len;
|
if (gdbarch_frame_align_p (current_gdbarch))
|
if (gdbarch_frame_align_p (current_gdbarch))
|
*sp = gdbarch_frame_align (current_gdbarch, *sp);
|
*sp = gdbarch_frame_align (current_gdbarch, *sp);
|
VALUE_ADDRESS (val) = *sp;
|
VALUE_ADDRESS (val) = *sp;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Stack grows upward. Align the frame, allocate space, and
|
/* Stack grows upward. Align the frame, allocate space, and
|
then again, re-align the frame. */
|
then again, re-align the frame. */
|
if (gdbarch_frame_align_p (current_gdbarch))
|
if (gdbarch_frame_align_p (current_gdbarch))
|
*sp = gdbarch_frame_align (current_gdbarch, *sp);
|
*sp = gdbarch_frame_align (current_gdbarch, *sp);
|
VALUE_ADDRESS (val) = *sp;
|
VALUE_ADDRESS (val) = *sp;
|
*sp += len;
|
*sp += len;
|
if (gdbarch_frame_align_p (current_gdbarch))
|
if (gdbarch_frame_align_p (current_gdbarch))
|
*sp = gdbarch_frame_align (current_gdbarch, *sp);
|
*sp = gdbarch_frame_align (current_gdbarch, *sp);
|
}
|
}
|
VALUE_LVAL (val) = lval_memory;
|
VALUE_LVAL (val) = lval_memory;
|
|
|
write_memory (VALUE_ADDRESS (val), value_contents_raw (val), len);
|
write_memory (VALUE_ADDRESS (val), value_contents_raw (val), len);
|
}
|
}
|
|
|
return val;
|
return val;
|
}
|
}
|
|
|
/* Return the value ACTUAL, converted to be an appropriate value for a
|
/* Return the value ACTUAL, converted to be an appropriate value for a
|
formal of type FORMAL_TYPE. Use *SP as a stack pointer for
|
formal of type FORMAL_TYPE. Use *SP as a stack pointer for
|
allocating any necessary descriptors (fat pointers), or copies of
|
allocating any necessary descriptors (fat pointers), or copies of
|
values not residing in memory, updating it as needed. */
|
values not residing in memory, updating it as needed. */
|
|
|
struct value *
|
struct value *
|
ada_convert_actual (struct value *actual, struct type *formal_type0,
|
ada_convert_actual (struct value *actual, struct type *formal_type0,
|
CORE_ADDR *sp)
|
CORE_ADDR *sp)
|
{
|
{
|
struct type *actual_type = ada_check_typedef (value_type (actual));
|
struct type *actual_type = ada_check_typedef (value_type (actual));
|
struct type *formal_type = ada_check_typedef (formal_type0);
|
struct type *formal_type = ada_check_typedef (formal_type0);
|
struct type *formal_target =
|
struct type *formal_target =
|
TYPE_CODE (formal_type) == TYPE_CODE_PTR
|
TYPE_CODE (formal_type) == TYPE_CODE_PTR
|
? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
|
? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type;
|
struct type *actual_target =
|
struct type *actual_target =
|
TYPE_CODE (actual_type) == TYPE_CODE_PTR
|
TYPE_CODE (actual_type) == TYPE_CODE_PTR
|
? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
|
? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type;
|
|
|
if (ada_is_array_descriptor_type (formal_target)
|
if (ada_is_array_descriptor_type (formal_target)
|
&& TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
|
&& TYPE_CODE (actual_target) == TYPE_CODE_ARRAY)
|
return make_array_descriptor (formal_type, actual, sp);
|
return make_array_descriptor (formal_type, actual, sp);
|
else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
|
else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR
|
|| TYPE_CODE (formal_type) == TYPE_CODE_REF)
|
|| TYPE_CODE (formal_type) == TYPE_CODE_REF)
|
{
|
{
|
struct value *result;
|
struct value *result;
|
if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
|
if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY
|
&& ada_is_array_descriptor_type (actual_target))
|
&& ada_is_array_descriptor_type (actual_target))
|
result = desc_data (actual);
|
result = desc_data (actual);
|
else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
|
else if (TYPE_CODE (actual_type) != TYPE_CODE_PTR)
|
{
|
{
|
if (VALUE_LVAL (actual) != lval_memory)
|
if (VALUE_LVAL (actual) != lval_memory)
|
{
|
{
|
struct value *val;
|
struct value *val;
|
actual_type = ada_check_typedef (value_type (actual));
|
actual_type = ada_check_typedef (value_type (actual));
|
val = allocate_value (actual_type);
|
val = allocate_value (actual_type);
|
memcpy ((char *) value_contents_raw (val),
|
memcpy ((char *) value_contents_raw (val),
|
(char *) value_contents (actual),
|
(char *) value_contents (actual),
|
TYPE_LENGTH (actual_type));
|
TYPE_LENGTH (actual_type));
|
actual = ensure_lval (val, sp);
|
actual = ensure_lval (val, sp);
|
}
|
}
|
result = value_addr (actual);
|
result = value_addr (actual);
|
}
|
}
|
else
|
else
|
return actual;
|
return actual;
|
return value_cast_pointers (formal_type, result);
|
return value_cast_pointers (formal_type, result);
|
}
|
}
|
else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
|
else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR)
|
return ada_value_ind (actual);
|
return ada_value_ind (actual);
|
|
|
return actual;
|
return actual;
|
}
|
}
|
|
|
|
|
/* Push a descriptor of type TYPE for array value ARR on the stack at
|
/* Push a descriptor of type TYPE for array value ARR on the stack at
|
*SP, updating *SP to reflect the new descriptor. Return either
|
*SP, updating *SP to reflect the new descriptor. Return either
|
an lvalue representing the new descriptor, or (if TYPE is a pointer-
|
an lvalue representing the new descriptor, or (if TYPE is a pointer-
|
to-descriptor type rather than a descriptor type), a struct value *
|
to-descriptor type rather than a descriptor type), a struct value *
|
representing a pointer to this descriptor. */
|
representing a pointer to this descriptor. */
|
|
|
static struct value *
|
static struct value *
|
make_array_descriptor (struct type *type, struct value *arr, CORE_ADDR *sp)
|
make_array_descriptor (struct type *type, struct value *arr, CORE_ADDR *sp)
|
{
|
{
|
struct type *bounds_type = desc_bounds_type (type);
|
struct type *bounds_type = desc_bounds_type (type);
|
struct type *desc_type = desc_base_type (type);
|
struct type *desc_type = desc_base_type (type);
|
struct value *descriptor = allocate_value (desc_type);
|
struct value *descriptor = allocate_value (desc_type);
|
struct value *bounds = allocate_value (bounds_type);
|
struct value *bounds = allocate_value (bounds_type);
|
int i;
|
int i;
|
|
|
for (i = ada_array_arity (ada_check_typedef (value_type (arr))); i > 0; i -= 1)
|
for (i = ada_array_arity (ada_check_typedef (value_type (arr))); i > 0; i -= 1)
|
{
|
{
|
modify_general_field (value_contents_writeable (bounds),
|
modify_general_field (value_contents_writeable (bounds),
|
value_as_long (ada_array_bound (arr, i, 0)),
|
value_as_long (ada_array_bound (arr, i, 0)),
|
desc_bound_bitpos (bounds_type, i, 0),
|
desc_bound_bitpos (bounds_type, i, 0),
|
desc_bound_bitsize (bounds_type, i, 0));
|
desc_bound_bitsize (bounds_type, i, 0));
|
modify_general_field (value_contents_writeable (bounds),
|
modify_general_field (value_contents_writeable (bounds),
|
value_as_long (ada_array_bound (arr, i, 1)),
|
value_as_long (ada_array_bound (arr, i, 1)),
|
desc_bound_bitpos (bounds_type, i, 1),
|
desc_bound_bitpos (bounds_type, i, 1),
|
desc_bound_bitsize (bounds_type, i, 1));
|
desc_bound_bitsize (bounds_type, i, 1));
|
}
|
}
|
|
|
bounds = ensure_lval (bounds, sp);
|
bounds = ensure_lval (bounds, sp);
|
|
|
modify_general_field (value_contents_writeable (descriptor),
|
modify_general_field (value_contents_writeable (descriptor),
|
VALUE_ADDRESS (ensure_lval (arr, sp)),
|
VALUE_ADDRESS (ensure_lval (arr, sp)),
|
fat_pntr_data_bitpos (desc_type),
|
fat_pntr_data_bitpos (desc_type),
|
fat_pntr_data_bitsize (desc_type));
|
fat_pntr_data_bitsize (desc_type));
|
|
|
modify_general_field (value_contents_writeable (descriptor),
|
modify_general_field (value_contents_writeable (descriptor),
|
VALUE_ADDRESS (bounds),
|
VALUE_ADDRESS (bounds),
|
fat_pntr_bounds_bitpos (desc_type),
|
fat_pntr_bounds_bitpos (desc_type),
|
fat_pntr_bounds_bitsize (desc_type));
|
fat_pntr_bounds_bitsize (desc_type));
|
|
|
descriptor = ensure_lval (descriptor, sp);
|
descriptor = ensure_lval (descriptor, sp);
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
return value_addr (descriptor);
|
return value_addr (descriptor);
|
else
|
else
|
return descriptor;
|
return descriptor;
|
}
|
}
|
|
|
/* Dummy definitions for an experimental caching module that is not
|
/* Dummy definitions for an experimental caching module that is not
|
* used in the public sources. */
|
* used in the public sources. */
|
|
|
static int
|
static int
|
lookup_cached_symbol (const char *name, domain_enum namespace,
|
lookup_cached_symbol (const char *name, domain_enum namespace,
|
struct symbol **sym, struct block **block,
|
struct symbol **sym, struct block **block,
|
struct symtab **symtab)
|
struct symtab **symtab)
|
{
|
{
|
return 0;
|
return 0;
|
}
|
}
|
|
|
static void
|
static void
|
cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
|
cache_symbol (const char *name, domain_enum namespace, struct symbol *sym,
|
struct block *block, struct symtab *symtab)
|
struct block *block, struct symtab *symtab)
|
{
|
{
|
}
|
}
|
|
|
/* Symbol Lookup */
|
/* Symbol Lookup */
|
|
|
/* Return the result of a standard (literal, C-like) lookup of NAME in
|
/* Return the result of a standard (literal, C-like) lookup of NAME in
|
given DOMAIN, visible from lexical block BLOCK. */
|
given DOMAIN, visible from lexical block BLOCK. */
|
|
|
static struct symbol *
|
static struct symbol *
|
standard_lookup (const char *name, const struct block *block,
|
standard_lookup (const char *name, const struct block *block,
|
domain_enum domain)
|
domain_enum domain)
|
{
|
{
|
struct symbol *sym;
|
struct symbol *sym;
|
struct symtab *symtab;
|
struct symtab *symtab;
|
|
|
if (lookup_cached_symbol (name, domain, &sym, NULL, NULL))
|
if (lookup_cached_symbol (name, domain, &sym, NULL, NULL))
|
return sym;
|
return sym;
|
sym =
|
sym =
|
lookup_symbol_in_language (name, block, domain, language_c, 0, &symtab);
|
lookup_symbol_in_language (name, block, domain, language_c, 0, &symtab);
|
cache_symbol (name, domain, sym, block_found, symtab);
|
cache_symbol (name, domain, sym, block_found, symtab);
|
return sym;
|
return sym;
|
}
|
}
|
|
|
|
|
/* Non-zero iff there is at least one non-function/non-enumeral symbol
|
/* Non-zero iff there is at least one non-function/non-enumeral symbol
|
in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
|
in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
|
since they contend in overloading in the same way. */
|
since they contend in overloading in the same way. */
|
static int
|
static int
|
is_nonfunction (struct ada_symbol_info syms[], int n)
|
is_nonfunction (struct ada_symbol_info syms[], int n)
|
{
|
{
|
int i;
|
int i;
|
|
|
for (i = 0; i < n; i += 1)
|
for (i = 0; i < n; i += 1)
|
if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
|
if (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_FUNC
|
&& (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
|
&& (TYPE_CODE (SYMBOL_TYPE (syms[i].sym)) != TYPE_CODE_ENUM
|
|| SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
|
|| SYMBOL_CLASS (syms[i].sym) != LOC_CONST))
|
return 1;
|
return 1;
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
|
/* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
|
struct types. Otherwise, they may not. */
|
struct types. Otherwise, they may not. */
|
|
|
static int
|
static int
|
equiv_types (struct type *type0, struct type *type1)
|
equiv_types (struct type *type0, struct type *type1)
|
{
|
{
|
if (type0 == type1)
|
if (type0 == type1)
|
return 1;
|
return 1;
|
if (type0 == NULL || type1 == NULL
|
if (type0 == NULL || type1 == NULL
|
|| TYPE_CODE (type0) != TYPE_CODE (type1))
|
|| TYPE_CODE (type0) != TYPE_CODE (type1))
|
return 0;
|
return 0;
|
if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
|
if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT
|
|| TYPE_CODE (type0) == TYPE_CODE_ENUM)
|
|| TYPE_CODE (type0) == TYPE_CODE_ENUM)
|
&& ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
|
&& ada_type_name (type0) != NULL && ada_type_name (type1) != NULL
|
&& strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
|
&& strcmp (ada_type_name (type0), ada_type_name (type1)) == 0)
|
return 1;
|
return 1;
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* True iff SYM0 represents the same entity as SYM1, or one that is
|
/* True iff SYM0 represents the same entity as SYM1, or one that is
|
no more defined than that of SYM1. */
|
no more defined than that of SYM1. */
|
|
|
static int
|
static int
|
lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
|
lesseq_defined_than (struct symbol *sym0, struct symbol *sym1)
|
{
|
{
|
if (sym0 == sym1)
|
if (sym0 == sym1)
|
return 1;
|
return 1;
|
if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
|
if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1)
|
|| SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
|
|| SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1))
|
return 0;
|
return 0;
|
|
|
switch (SYMBOL_CLASS (sym0))
|
switch (SYMBOL_CLASS (sym0))
|
{
|
{
|
case LOC_UNDEF:
|
case LOC_UNDEF:
|
return 1;
|
return 1;
|
case LOC_TYPEDEF:
|
case LOC_TYPEDEF:
|
{
|
{
|
struct type *type0 = SYMBOL_TYPE (sym0);
|
struct type *type0 = SYMBOL_TYPE (sym0);
|
struct type *type1 = SYMBOL_TYPE (sym1);
|
struct type *type1 = SYMBOL_TYPE (sym1);
|
char *name0 = SYMBOL_LINKAGE_NAME (sym0);
|
char *name0 = SYMBOL_LINKAGE_NAME (sym0);
|
char *name1 = SYMBOL_LINKAGE_NAME (sym1);
|
char *name1 = SYMBOL_LINKAGE_NAME (sym1);
|
int len0 = strlen (name0);
|
int len0 = strlen (name0);
|
return
|
return
|
TYPE_CODE (type0) == TYPE_CODE (type1)
|
TYPE_CODE (type0) == TYPE_CODE (type1)
|
&& (equiv_types (type0, type1)
|
&& (equiv_types (type0, type1)
|
|| (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
|
|| (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0
|
&& strncmp (name1 + len0, "___XV", 5) == 0));
|
&& strncmp (name1 + len0, "___XV", 5) == 0));
|
}
|
}
|
case LOC_CONST:
|
case LOC_CONST:
|
return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
|
return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1)
|
&& equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
|
&& equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1));
|
default:
|
default:
|
return 0;
|
return 0;
|
}
|
}
|
}
|
}
|
|
|
/* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
|
/* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
|
records in OBSTACKP. Do nothing if SYM is a duplicate. */
|
records in OBSTACKP. Do nothing if SYM is a duplicate. */
|
|
|
static void
|
static void
|
add_defn_to_vec (struct obstack *obstackp,
|
add_defn_to_vec (struct obstack *obstackp,
|
struct symbol *sym,
|
struct symbol *sym,
|
struct block *block, struct symtab *symtab)
|
struct block *block, struct symtab *symtab)
|
{
|
{
|
int i;
|
int i;
|
size_t tmp;
|
size_t tmp;
|
struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
|
struct ada_symbol_info *prevDefns = defns_collected (obstackp, 0);
|
|
|
/* Do not try to complete stub types, as the debugger is probably
|
/* Do not try to complete stub types, as the debugger is probably
|
already scanning all symbols matching a certain name at the
|
already scanning all symbols matching a certain name at the
|
time when this function is called. Trying to replace the stub
|
time when this function is called. Trying to replace the stub
|
type by its associated full type will cause us to restart a scan
|
type by its associated full type will cause us to restart a scan
|
which may lead to an infinite recursion. Instead, the client
|
which may lead to an infinite recursion. Instead, the client
|
collecting the matching symbols will end up collecting several
|
collecting the matching symbols will end up collecting several
|
matches, with at least one of them complete. It can then filter
|
matches, with at least one of them complete. It can then filter
|
out the stub ones if needed. */
|
out the stub ones if needed. */
|
|
|
for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
|
for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1)
|
{
|
{
|
if (lesseq_defined_than (sym, prevDefns[i].sym))
|
if (lesseq_defined_than (sym, prevDefns[i].sym))
|
return;
|
return;
|
else if (lesseq_defined_than (prevDefns[i].sym, sym))
|
else if (lesseq_defined_than (prevDefns[i].sym, sym))
|
{
|
{
|
prevDefns[i].sym = sym;
|
prevDefns[i].sym = sym;
|
prevDefns[i].block = block;
|
prevDefns[i].block = block;
|
prevDefns[i].symtab = symtab;
|
prevDefns[i].symtab = symtab;
|
return;
|
return;
|
}
|
}
|
}
|
}
|
|
|
{
|
{
|
struct ada_symbol_info info;
|
struct ada_symbol_info info;
|
|
|
info.sym = sym;
|
info.sym = sym;
|
info.block = block;
|
info.block = block;
|
info.symtab = symtab;
|
info.symtab = symtab;
|
obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
|
obstack_grow (obstackp, &info, sizeof (struct ada_symbol_info));
|
}
|
}
|
}
|
}
|
|
|
/* Number of ada_symbol_info structures currently collected in
|
/* Number of ada_symbol_info structures currently collected in
|
current vector in *OBSTACKP. */
|
current vector in *OBSTACKP. */
|
|
|
static int
|
static int
|
num_defns_collected (struct obstack *obstackp)
|
num_defns_collected (struct obstack *obstackp)
|
{
|
{
|
return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
|
return obstack_object_size (obstackp) / sizeof (struct ada_symbol_info);
|
}
|
}
|
|
|
/* Vector of ada_symbol_info structures currently collected in current
|
/* Vector of ada_symbol_info structures currently collected in current
|
vector in *OBSTACKP. If FINISH, close off the vector and return
|
vector in *OBSTACKP. If FINISH, close off the vector and return
|
its final address. */
|
its final address. */
|
|
|
static struct ada_symbol_info *
|
static struct ada_symbol_info *
|
defns_collected (struct obstack *obstackp, int finish)
|
defns_collected (struct obstack *obstackp, int finish)
|
{
|
{
|
if (finish)
|
if (finish)
|
return obstack_finish (obstackp);
|
return obstack_finish (obstackp);
|
else
|
else
|
return (struct ada_symbol_info *) obstack_base (obstackp);
|
return (struct ada_symbol_info *) obstack_base (obstackp);
|
}
|
}
|
|
|
/* Look, in partial_symtab PST, for symbol NAME in given namespace.
|
/* Look, in partial_symtab PST, for symbol NAME in given namespace.
|
Check the global symbols if GLOBAL, the static symbols if not.
|
Check the global symbols if GLOBAL, the static symbols if not.
|
Do wild-card match if WILD. */
|
Do wild-card match if WILD. */
|
|
|
static struct partial_symbol *
|
static struct partial_symbol *
|
ada_lookup_partial_symbol (struct partial_symtab *pst, const char *name,
|
ada_lookup_partial_symbol (struct partial_symtab *pst, const char *name,
|
int global, domain_enum namespace, int wild)
|
int global, domain_enum namespace, int wild)
|
{
|
{
|
struct partial_symbol **start;
|
struct partial_symbol **start;
|
int name_len = strlen (name);
|
int name_len = strlen (name);
|
int length = (global ? pst->n_global_syms : pst->n_static_syms);
|
int length = (global ? pst->n_global_syms : pst->n_static_syms);
|
int i;
|
int i;
|
|
|
if (length == 0)
|
if (length == 0)
|
{
|
{
|
return (NULL);
|
return (NULL);
|
}
|
}
|
|
|
start = (global ?
|
start = (global ?
|
pst->objfile->global_psymbols.list + pst->globals_offset :
|
pst->objfile->global_psymbols.list + pst->globals_offset :
|
pst->objfile->static_psymbols.list + pst->statics_offset);
|
pst->objfile->static_psymbols.list + pst->statics_offset);
|
|
|
if (wild)
|
if (wild)
|
{
|
{
|
for (i = 0; i < length; i += 1)
|
for (i = 0; i < length; i += 1)
|
{
|
{
|
struct partial_symbol *psym = start[i];
|
struct partial_symbol *psym = start[i];
|
|
|
if (SYMBOL_DOMAIN (psym) == namespace
|
if (SYMBOL_DOMAIN (psym) == namespace
|
&& wild_match (name, name_len, SYMBOL_LINKAGE_NAME (psym)))
|
&& wild_match (name, name_len, SYMBOL_LINKAGE_NAME (psym)))
|
return psym;
|
return psym;
|
}
|
}
|
return NULL;
|
return NULL;
|
}
|
}
|
else
|
else
|
{
|
{
|
if (global)
|
if (global)
|
{
|
{
|
int U;
|
int U;
|
i = 0;
|
i = 0;
|
U = length - 1;
|
U = length - 1;
|
while (U - i > 4)
|
while (U - i > 4)
|
{
|
{
|
int M = (U + i) >> 1;
|
int M = (U + i) >> 1;
|
struct partial_symbol *psym = start[M];
|
struct partial_symbol *psym = start[M];
|
if (SYMBOL_LINKAGE_NAME (psym)[0] < name[0])
|
if (SYMBOL_LINKAGE_NAME (psym)[0] < name[0])
|
i = M + 1;
|
i = M + 1;
|
else if (SYMBOL_LINKAGE_NAME (psym)[0] > name[0])
|
else if (SYMBOL_LINKAGE_NAME (psym)[0] > name[0])
|
U = M - 1;
|
U = M - 1;
|
else if (strcmp (SYMBOL_LINKAGE_NAME (psym), name) < 0)
|
else if (strcmp (SYMBOL_LINKAGE_NAME (psym), name) < 0)
|
i = M + 1;
|
i = M + 1;
|
else
|
else
|
U = M;
|
U = M;
|
}
|
}
|
}
|
}
|
else
|
else
|
i = 0;
|
i = 0;
|
|
|
while (i < length)
|
while (i < length)
|
{
|
{
|
struct partial_symbol *psym = start[i];
|
struct partial_symbol *psym = start[i];
|
|
|
if (SYMBOL_DOMAIN (psym) == namespace)
|
if (SYMBOL_DOMAIN (psym) == namespace)
|
{
|
{
|
int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym), name_len);
|
int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym), name_len);
|
|
|
if (cmp < 0)
|
if (cmp < 0)
|
{
|
{
|
if (global)
|
if (global)
|
break;
|
break;
|
}
|
}
|
else if (cmp == 0
|
else if (cmp == 0
|
&& is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
|
&& is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
|
+ name_len))
|
+ name_len))
|
return psym;
|
return psym;
|
}
|
}
|
i += 1;
|
i += 1;
|
}
|
}
|
|
|
if (global)
|
if (global)
|
{
|
{
|
int U;
|
int U;
|
i = 0;
|
i = 0;
|
U = length - 1;
|
U = length - 1;
|
while (U - i > 4)
|
while (U - i > 4)
|
{
|
{
|
int M = (U + i) >> 1;
|
int M = (U + i) >> 1;
|
struct partial_symbol *psym = start[M];
|
struct partial_symbol *psym = start[M];
|
if (SYMBOL_LINKAGE_NAME (psym)[0] < '_')
|
if (SYMBOL_LINKAGE_NAME (psym)[0] < '_')
|
i = M + 1;
|
i = M + 1;
|
else if (SYMBOL_LINKAGE_NAME (psym)[0] > '_')
|
else if (SYMBOL_LINKAGE_NAME (psym)[0] > '_')
|
U = M - 1;
|
U = M - 1;
|
else if (strcmp (SYMBOL_LINKAGE_NAME (psym), "_ada_") < 0)
|
else if (strcmp (SYMBOL_LINKAGE_NAME (psym), "_ada_") < 0)
|
i = M + 1;
|
i = M + 1;
|
else
|
else
|
U = M;
|
U = M;
|
}
|
}
|
}
|
}
|
else
|
else
|
i = 0;
|
i = 0;
|
|
|
while (i < length)
|
while (i < length)
|
{
|
{
|
struct partial_symbol *psym = start[i];
|
struct partial_symbol *psym = start[i];
|
|
|
if (SYMBOL_DOMAIN (psym) == namespace)
|
if (SYMBOL_DOMAIN (psym) == namespace)
|
{
|
{
|
int cmp;
|
int cmp;
|
|
|
cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym)[0];
|
cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym)[0];
|
if (cmp == 0)
|
if (cmp == 0)
|
{
|
{
|
cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym), 5);
|
cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym), 5);
|
if (cmp == 0)
|
if (cmp == 0)
|
cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym) + 5,
|
cmp = strncmp (name, SYMBOL_LINKAGE_NAME (psym) + 5,
|
name_len);
|
name_len);
|
}
|
}
|
|
|
if (cmp < 0)
|
if (cmp < 0)
|
{
|
{
|
if (global)
|
if (global)
|
break;
|
break;
|
}
|
}
|
else if (cmp == 0
|
else if (cmp == 0
|
&& is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
|
&& is_name_suffix (SYMBOL_LINKAGE_NAME (psym)
|
+ name_len + 5))
|
+ name_len + 5))
|
return psym;
|
return psym;
|
}
|
}
|
i += 1;
|
i += 1;
|
}
|
}
|
}
|
}
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* Find a symbol table containing symbol SYM or NULL if none. */
|
/* Find a symbol table containing symbol SYM or NULL if none. */
|
|
|
static struct symtab *
|
static struct symtab *
|
symtab_for_sym (struct symbol *sym)
|
symtab_for_sym (struct symbol *sym)
|
{
|
{
|
struct symtab *s;
|
struct symtab *s;
|
struct objfile *objfile;
|
struct objfile *objfile;
|
struct block *b;
|
struct block *b;
|
struct symbol *tmp_sym;
|
struct symbol *tmp_sym;
|
struct dict_iterator iter;
|
struct dict_iterator iter;
|
int j;
|
int j;
|
|
|
ALL_PRIMARY_SYMTABS (objfile, s)
|
ALL_PRIMARY_SYMTABS (objfile, s)
|
{
|
{
|
switch (SYMBOL_CLASS (sym))
|
switch (SYMBOL_CLASS (sym))
|
{
|
{
|
case LOC_CONST:
|
case LOC_CONST:
|
case LOC_STATIC:
|
case LOC_STATIC:
|
case LOC_TYPEDEF:
|
case LOC_TYPEDEF:
|
case LOC_REGISTER:
|
case LOC_REGISTER:
|
case LOC_LABEL:
|
case LOC_LABEL:
|
case LOC_BLOCK:
|
case LOC_BLOCK:
|
case LOC_CONST_BYTES:
|
case LOC_CONST_BYTES:
|
b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
|
b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
|
ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
|
ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
|
return s;
|
return s;
|
b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
|
b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
|
ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
|
ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
|
return s;
|
return s;
|
break;
|
break;
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
switch (SYMBOL_CLASS (sym))
|
switch (SYMBOL_CLASS (sym))
|
{
|
{
|
case LOC_REGISTER:
|
case LOC_REGISTER:
|
case LOC_ARG:
|
case LOC_ARG:
|
case LOC_REF_ARG:
|
case LOC_REF_ARG:
|
case LOC_REGPARM:
|
case LOC_REGPARM:
|
case LOC_REGPARM_ADDR:
|
case LOC_REGPARM_ADDR:
|
case LOC_LOCAL:
|
case LOC_LOCAL:
|
case LOC_TYPEDEF:
|
case LOC_TYPEDEF:
|
case LOC_LOCAL_ARG:
|
case LOC_LOCAL_ARG:
|
case LOC_BASEREG:
|
case LOC_BASEREG:
|
case LOC_BASEREG_ARG:
|
case LOC_BASEREG_ARG:
|
case LOC_COMPUTED:
|
case LOC_COMPUTED:
|
case LOC_COMPUTED_ARG:
|
case LOC_COMPUTED_ARG:
|
for (j = FIRST_LOCAL_BLOCK;
|
for (j = FIRST_LOCAL_BLOCK;
|
j < BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s)); j += 1)
|
j < BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s)); j += 1)
|
{
|
{
|
b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), j);
|
b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), j);
|
ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
|
ALL_BLOCK_SYMBOLS (b, iter, tmp_sym) if (sym == tmp_sym)
|
return s;
|
return s;
|
}
|
}
|
break;
|
break;
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
}
|
}
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* Return a minimal symbol matching NAME according to Ada decoding
|
/* Return a minimal symbol matching NAME according to Ada decoding
|
rules. Returns NULL if there is no such minimal symbol. Names
|
rules. Returns NULL if there is no such minimal symbol. Names
|
prefixed with "standard__" are handled specially: "standard__" is
|
prefixed with "standard__" are handled specially: "standard__" is
|
first stripped off, and only static and global symbols are searched. */
|
first stripped off, and only static and global symbols are searched. */
|
|
|
struct minimal_symbol *
|
struct minimal_symbol *
|
ada_lookup_simple_minsym (const char *name)
|
ada_lookup_simple_minsym (const char *name)
|
{
|
{
|
struct objfile *objfile;
|
struct objfile *objfile;
|
struct minimal_symbol *msymbol;
|
struct minimal_symbol *msymbol;
|
int wild_match;
|
int wild_match;
|
|
|
if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
|
if (strncmp (name, "standard__", sizeof ("standard__") - 1) == 0)
|
{
|
{
|
name += sizeof ("standard__") - 1;
|
name += sizeof ("standard__") - 1;
|
wild_match = 0;
|
wild_match = 0;
|
}
|
}
|
else
|
else
|
wild_match = (strstr (name, "__") == NULL);
|
wild_match = (strstr (name, "__") == NULL);
|
|
|
ALL_MSYMBOLS (objfile, msymbol)
|
ALL_MSYMBOLS (objfile, msymbol)
|
{
|
{
|
if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match)
|
if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match)
|
&& MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
|
&& MSYMBOL_TYPE (msymbol) != mst_solib_trampoline)
|
return msymbol;
|
return msymbol;
|
}
|
}
|
|
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* For all subprograms that statically enclose the subprogram of the
|
/* For all subprograms that statically enclose the subprogram of the
|
selected frame, add symbols matching identifier NAME in DOMAIN
|
selected frame, add symbols matching identifier NAME in DOMAIN
|
and their blocks to the list of data in OBSTACKP, as for
|
and their blocks to the list of data in OBSTACKP, as for
|
ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
|
ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
|
wildcard prefix. */
|
wildcard prefix. */
|
|
|
static void
|
static void
|
add_symbols_from_enclosing_procs (struct obstack *obstackp,
|
add_symbols_from_enclosing_procs (struct obstack *obstackp,
|
const char *name, domain_enum namespace,
|
const char *name, domain_enum namespace,
|
int wild_match)
|
int wild_match)
|
{
|
{
|
}
|
}
|
|
|
/* True if TYPE is definitely an artificial type supplied to a symbol
|
/* True if TYPE is definitely an artificial type supplied to a symbol
|
for which no debugging information was given in the symbol file. */
|
for which no debugging information was given in the symbol file. */
|
|
|
static int
|
static int
|
is_nondebugging_type (struct type *type)
|
is_nondebugging_type (struct type *type)
|
{
|
{
|
char *name = ada_type_name (type);
|
char *name = ada_type_name (type);
|
return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
|
return (name != NULL && strcmp (name, "<variable, no debug info>") == 0);
|
}
|
}
|
|
|
/* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
|
/* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
|
duplicate other symbols in the list (The only case I know of where
|
duplicate other symbols in the list (The only case I know of where
|
this happens is when object files containing stabs-in-ecoff are
|
this happens is when object files containing stabs-in-ecoff are
|
linked with files containing ordinary ecoff debugging symbols (or no
|
linked with files containing ordinary ecoff debugging symbols (or no
|
debugging symbols)). Modifies SYMS to squeeze out deleted entries.
|
debugging symbols)). Modifies SYMS to squeeze out deleted entries.
|
Returns the number of items in the modified list. */
|
Returns the number of items in the modified list. */
|
|
|
static int
|
static int
|
remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
|
remove_extra_symbols (struct ada_symbol_info *syms, int nsyms)
|
{
|
{
|
int i, j;
|
int i, j;
|
|
|
i = 0;
|
i = 0;
|
while (i < nsyms)
|
while (i < nsyms)
|
{
|
{
|
if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
|
if (SYMBOL_LINKAGE_NAME (syms[i].sym) != NULL
|
&& SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
|
&& SYMBOL_CLASS (syms[i].sym) == LOC_STATIC
|
&& is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
|
&& is_nondebugging_type (SYMBOL_TYPE (syms[i].sym)))
|
{
|
{
|
for (j = 0; j < nsyms; j += 1)
|
for (j = 0; j < nsyms; j += 1)
|
{
|
{
|
if (i != j
|
if (i != j
|
&& SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
|
&& SYMBOL_LINKAGE_NAME (syms[j].sym) != NULL
|
&& strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
|
&& strcmp (SYMBOL_LINKAGE_NAME (syms[i].sym),
|
SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
|
SYMBOL_LINKAGE_NAME (syms[j].sym)) == 0
|
&& SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
|
&& SYMBOL_CLASS (syms[i].sym) == SYMBOL_CLASS (syms[j].sym)
|
&& SYMBOL_VALUE_ADDRESS (syms[i].sym)
|
&& SYMBOL_VALUE_ADDRESS (syms[i].sym)
|
== SYMBOL_VALUE_ADDRESS (syms[j].sym))
|
== SYMBOL_VALUE_ADDRESS (syms[j].sym))
|
{
|
{
|
int k;
|
int k;
|
for (k = i + 1; k < nsyms; k += 1)
|
for (k = i + 1; k < nsyms; k += 1)
|
syms[k - 1] = syms[k];
|
syms[k - 1] = syms[k];
|
nsyms -= 1;
|
nsyms -= 1;
|
goto NextSymbol;
|
goto NextSymbol;
|
}
|
}
|
}
|
}
|
}
|
}
|
i += 1;
|
i += 1;
|
NextSymbol:
|
NextSymbol:
|
;
|
;
|
}
|
}
|
return nsyms;
|
return nsyms;
|
}
|
}
|
|
|
/* Given a type that corresponds to a renaming entity, use the type name
|
/* Given a type that corresponds to a renaming entity, use the type name
|
to extract the scope (package name or function name, fully qualified,
|
to extract the scope (package name or function name, fully qualified,
|
and following the GNAT encoding convention) where this renaming has been
|
and following the GNAT encoding convention) where this renaming has been
|
defined. The string returned needs to be deallocated after use. */
|
defined. The string returned needs to be deallocated after use. */
|
|
|
static char *
|
static char *
|
xget_renaming_scope (struct type *renaming_type)
|
xget_renaming_scope (struct type *renaming_type)
|
{
|
{
|
/* The renaming types adhere to the following convention:
|
/* The renaming types adhere to the following convention:
|
<scope>__<rename>___<XR extension>.
|
<scope>__<rename>___<XR extension>.
|
So, to extract the scope, we search for the "___XR" extension,
|
So, to extract the scope, we search for the "___XR" extension,
|
and then backtrack until we find the first "__". */
|
and then backtrack until we find the first "__". */
|
|
|
const char *name = type_name_no_tag (renaming_type);
|
const char *name = type_name_no_tag (renaming_type);
|
char *suffix = strstr (name, "___XR");
|
char *suffix = strstr (name, "___XR");
|
char *last;
|
char *last;
|
int scope_len;
|
int scope_len;
|
char *scope;
|
char *scope;
|
|
|
/* Now, backtrack a bit until we find the first "__". Start looking
|
/* Now, backtrack a bit until we find the first "__". Start looking
|
at suffix - 3, as the <rename> part is at least one character long. */
|
at suffix - 3, as the <rename> part is at least one character long. */
|
|
|
for (last = suffix - 3; last > name; last--)
|
for (last = suffix - 3; last > name; last--)
|
if (last[0] == '_' && last[1] == '_')
|
if (last[0] == '_' && last[1] == '_')
|
break;
|
break;
|
|
|
/* Make a copy of scope and return it. */
|
/* Make a copy of scope and return it. */
|
|
|
scope_len = last - name;
|
scope_len = last - name;
|
scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
|
scope = (char *) xmalloc ((scope_len + 1) * sizeof (char));
|
|
|
strncpy (scope, name, scope_len);
|
strncpy (scope, name, scope_len);
|
scope[scope_len] = '\0';
|
scope[scope_len] = '\0';
|
|
|
return scope;
|
return scope;
|
}
|
}
|
|
|
/* Return nonzero if NAME corresponds to a package name. */
|
/* Return nonzero if NAME corresponds to a package name. */
|
|
|
static int
|
static int
|
is_package_name (const char *name)
|
is_package_name (const char *name)
|
{
|
{
|
/* Here, We take advantage of the fact that no symbols are generated
|
/* Here, We take advantage of the fact that no symbols are generated
|
for packages, while symbols are generated for each function.
|
for packages, while symbols are generated for each function.
|
So the condition for NAME represent a package becomes equivalent
|
So the condition for NAME represent a package becomes equivalent
|
to NAME not existing in our list of symbols. There is only one
|
to NAME not existing in our list of symbols. There is only one
|
small complication with library-level functions (see below). */
|
small complication with library-level functions (see below). */
|
|
|
char *fun_name;
|
char *fun_name;
|
|
|
/* If it is a function that has not been defined at library level,
|
/* If it is a function that has not been defined at library level,
|
then we should be able to look it up in the symbols. */
|
then we should be able to look it up in the symbols. */
|
if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
|
if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL)
|
return 0;
|
return 0;
|
|
|
/* Library-level function names start with "_ada_". See if function
|
/* Library-level function names start with "_ada_". See if function
|
"_ada_" followed by NAME can be found. */
|
"_ada_" followed by NAME can be found. */
|
|
|
/* Do a quick check that NAME does not contain "__", since library-level
|
/* Do a quick check that NAME does not contain "__", since library-level
|
functions names cannot contain "__" in them. */
|
functions names cannot contain "__" in them. */
|
if (strstr (name, "__") != NULL)
|
if (strstr (name, "__") != NULL)
|
return 0;
|
return 0;
|
|
|
fun_name = xstrprintf ("_ada_%s", name);
|
fun_name = xstrprintf ("_ada_%s", name);
|
|
|
return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
|
return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL);
|
}
|
}
|
|
|
/* Return nonzero if SYM corresponds to a renaming entity that is
|
/* Return nonzero if SYM corresponds to a renaming entity that is
|
not visible from FUNCTION_NAME. */
|
not visible from FUNCTION_NAME. */
|
|
|
static int
|
static int
|
old_renaming_is_invisible (const struct symbol *sym, char *function_name)
|
old_renaming_is_invisible (const struct symbol *sym, char *function_name)
|
{
|
{
|
char *scope;
|
char *scope;
|
|
|
if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
|
if (SYMBOL_CLASS (sym) != LOC_TYPEDEF)
|
return 0;
|
return 0;
|
|
|
scope = xget_renaming_scope (SYMBOL_TYPE (sym));
|
scope = xget_renaming_scope (SYMBOL_TYPE (sym));
|
|
|
make_cleanup (xfree, scope);
|
make_cleanup (xfree, scope);
|
|
|
/* If the rename has been defined in a package, then it is visible. */
|
/* If the rename has been defined in a package, then it is visible. */
|
if (is_package_name (scope))
|
if (is_package_name (scope))
|
return 0;
|
return 0;
|
|
|
/* Check that the rename is in the current function scope by checking
|
/* Check that the rename is in the current function scope by checking
|
that its name starts with SCOPE. */
|
that its name starts with SCOPE. */
|
|
|
/* If the function name starts with "_ada_", it means that it is
|
/* If the function name starts with "_ada_", it means that it is
|
a library-level function. Strip this prefix before doing the
|
a library-level function. Strip this prefix before doing the
|
comparison, as the encoding for the renaming does not contain
|
comparison, as the encoding for the renaming does not contain
|
this prefix. */
|
this prefix. */
|
if (strncmp (function_name, "_ada_", 5) == 0)
|
if (strncmp (function_name, "_ada_", 5) == 0)
|
function_name += 5;
|
function_name += 5;
|
|
|
return (strncmp (function_name, scope, strlen (scope)) != 0);
|
return (strncmp (function_name, scope, strlen (scope)) != 0);
|
}
|
}
|
|
|
/* Remove entries from SYMS that corresponds to a renaming entity that
|
/* Remove entries from SYMS that corresponds to a renaming entity that
|
is not visible from the function associated with CURRENT_BLOCK or
|
is not visible from the function associated with CURRENT_BLOCK or
|
that is superfluous due to the presence of more specific renaming
|
that is superfluous due to the presence of more specific renaming
|
information. Places surviving symbols in the initial entries of
|
information. Places surviving symbols in the initial entries of
|
SYMS and returns the number of surviving symbols.
|
SYMS and returns the number of surviving symbols.
|
|
|
Rationale:
|
Rationale:
|
First, in cases where an object renaming is implemented as a
|
First, in cases where an object renaming is implemented as a
|
reference variable, GNAT may produce both the actual reference
|
reference variable, GNAT may produce both the actual reference
|
variable and the renaming encoding. In this case, we discard the
|
variable and the renaming encoding. In this case, we discard the
|
latter.
|
latter.
|
|
|
Second, GNAT emits a type following a specified encoding for each renaming
|
Second, GNAT emits a type following a specified encoding for each renaming
|
entity. Unfortunately, STABS currently does not support the definition
|
entity. Unfortunately, STABS currently does not support the definition
|
of types that are local to a given lexical block, so all renamings types
|
of types that are local to a given lexical block, so all renamings types
|
are emitted at library level. As a consequence, if an application
|
are emitted at library level. As a consequence, if an application
|
contains two renaming entities using the same name, and a user tries to
|
contains two renaming entities using the same name, and a user tries to
|
print the value of one of these entities, the result of the ada symbol
|
print the value of one of these entities, the result of the ada symbol
|
lookup will also contain the wrong renaming type.
|
lookup will also contain the wrong renaming type.
|
|
|
This function partially covers for this limitation by attempting to
|
This function partially covers for this limitation by attempting to
|
remove from the SYMS list renaming symbols that should be visible
|
remove from the SYMS list renaming symbols that should be visible
|
from CURRENT_BLOCK. However, there does not seem be a 100% reliable
|
from CURRENT_BLOCK. However, there does not seem be a 100% reliable
|
method with the current information available. The implementation
|
method with the current information available. The implementation
|
below has a couple of limitations (FIXME: brobecker-2003-05-12):
|
below has a couple of limitations (FIXME: brobecker-2003-05-12):
|
|
|
- When the user tries to print a rename in a function while there
|
- When the user tries to print a rename in a function while there
|
is another rename entity defined in a package: Normally, the
|
is another rename entity defined in a package: Normally, the
|
rename in the function has precedence over the rename in the
|
rename in the function has precedence over the rename in the
|
package, so the latter should be removed from the list. This is
|
package, so the latter should be removed from the list. This is
|
currently not the case.
|
currently not the case.
|
|
|
- This function will incorrectly remove valid renames if
|
- This function will incorrectly remove valid renames if
|
the CURRENT_BLOCK corresponds to a function which symbol name
|
the CURRENT_BLOCK corresponds to a function which symbol name
|
has been changed by an "Export" pragma. As a consequence,
|
has been changed by an "Export" pragma. As a consequence,
|
the user will be unable to print such rename entities. */
|
the user will be unable to print such rename entities. */
|
|
|
static int
|
static int
|
remove_irrelevant_renamings (struct ada_symbol_info *syms,
|
remove_irrelevant_renamings (struct ada_symbol_info *syms,
|
int nsyms, const struct block *current_block)
|
int nsyms, const struct block *current_block)
|
{
|
{
|
struct symbol *current_function;
|
struct symbol *current_function;
|
char *current_function_name;
|
char *current_function_name;
|
int i;
|
int i;
|
int is_new_style_renaming;
|
int is_new_style_renaming;
|
|
|
/* If there is both a renaming foo___XR... encoded as a variable and
|
/* If there is both a renaming foo___XR... encoded as a variable and
|
a simple variable foo in the same block, discard the latter.
|
a simple variable foo in the same block, discard the latter.
|
First, zero out such symbols, then compress. */
|
First, zero out such symbols, then compress. */
|
is_new_style_renaming = 0;
|
is_new_style_renaming = 0;
|
for (i = 0; i < nsyms; i += 1)
|
for (i = 0; i < nsyms; i += 1)
|
{
|
{
|
struct symbol *sym = syms[i].sym;
|
struct symbol *sym = syms[i].sym;
|
struct block *block = syms[i].block;
|
struct block *block = syms[i].block;
|
const char *name;
|
const char *name;
|
const char *suffix;
|
const char *suffix;
|
|
|
if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
|
if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF)
|
continue;
|
continue;
|
name = SYMBOL_LINKAGE_NAME (sym);
|
name = SYMBOL_LINKAGE_NAME (sym);
|
suffix = strstr (name, "___XR");
|
suffix = strstr (name, "___XR");
|
|
|
if (suffix != NULL)
|
if (suffix != NULL)
|
{
|
{
|
int name_len = suffix - name;
|
int name_len = suffix - name;
|
int j;
|
int j;
|
is_new_style_renaming = 1;
|
is_new_style_renaming = 1;
|
for (j = 0; j < nsyms; j += 1)
|
for (j = 0; j < nsyms; j += 1)
|
if (i != j && syms[j].sym != NULL
|
if (i != j && syms[j].sym != NULL
|
&& strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
|
&& strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].sym),
|
name_len) == 0
|
name_len) == 0
|
&& block == syms[j].block)
|
&& block == syms[j].block)
|
syms[j].sym = NULL;
|
syms[j].sym = NULL;
|
}
|
}
|
}
|
}
|
if (is_new_style_renaming)
|
if (is_new_style_renaming)
|
{
|
{
|
int j, k;
|
int j, k;
|
|
|
for (j = k = 0; j < nsyms; j += 1)
|
for (j = k = 0; j < nsyms; j += 1)
|
if (syms[j].sym != NULL)
|
if (syms[j].sym != NULL)
|
{
|
{
|
syms[k] = syms[j];
|
syms[k] = syms[j];
|
k += 1;
|
k += 1;
|
}
|
}
|
return k;
|
return k;
|
}
|
}
|
|
|
/* Extract the function name associated to CURRENT_BLOCK.
|
/* Extract the function name associated to CURRENT_BLOCK.
|
Abort if unable to do so. */
|
Abort if unable to do so. */
|
|
|
if (current_block == NULL)
|
if (current_block == NULL)
|
return nsyms;
|
return nsyms;
|
|
|
current_function = block_function (current_block);
|
current_function = block_function (current_block);
|
if (current_function == NULL)
|
if (current_function == NULL)
|
return nsyms;
|
return nsyms;
|
|
|
current_function_name = SYMBOL_LINKAGE_NAME (current_function);
|
current_function_name = SYMBOL_LINKAGE_NAME (current_function);
|
if (current_function_name == NULL)
|
if (current_function_name == NULL)
|
return nsyms;
|
return nsyms;
|
|
|
/* Check each of the symbols, and remove it from the list if it is
|
/* Check each of the symbols, and remove it from the list if it is
|
a type corresponding to a renaming that is out of the scope of
|
a type corresponding to a renaming that is out of the scope of
|
the current block. */
|
the current block. */
|
|
|
i = 0;
|
i = 0;
|
while (i < nsyms)
|
while (i < nsyms)
|
{
|
{
|
if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
|
if (ada_parse_renaming (syms[i].sym, NULL, NULL, NULL)
|
== ADA_OBJECT_RENAMING
|
== ADA_OBJECT_RENAMING
|
&& old_renaming_is_invisible (syms[i].sym, current_function_name))
|
&& old_renaming_is_invisible (syms[i].sym, current_function_name))
|
{
|
{
|
int j;
|
int j;
|
for (j = i + 1; j < nsyms; j += 1)
|
for (j = i + 1; j < nsyms; j += 1)
|
syms[j - 1] = syms[j];
|
syms[j - 1] = syms[j];
|
nsyms -= 1;
|
nsyms -= 1;
|
}
|
}
|
else
|
else
|
i += 1;
|
i += 1;
|
}
|
}
|
|
|
return nsyms;
|
return nsyms;
|
}
|
}
|
|
|
/* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
|
/* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
|
scope and in global scopes, returning the number of matches. Sets
|
scope and in global scopes, returning the number of matches. Sets
|
*RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
|
*RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
|
indicating the symbols found and the blocks and symbol tables (if
|
indicating the symbols found and the blocks and symbol tables (if
|
any) in which they were found. This vector are transient---good only to
|
any) in which they were found. This vector are transient---good only to
|
the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
|
the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
|
symbol match within the nest of blocks whose innermost member is BLOCK0,
|
symbol match within the nest of blocks whose innermost member is BLOCK0,
|
is the one match returned (no other matches in that or
|
is the one match returned (no other matches in that or
|
enclosing blocks is returned). If there are any matches in or
|
enclosing blocks is returned). If there are any matches in or
|
surrounding BLOCK0, then these alone are returned. Otherwise, the
|
surrounding BLOCK0, then these alone are returned. Otherwise, the
|
search extends to global and file-scope (static) symbol tables.
|
search extends to global and file-scope (static) symbol tables.
|
Names prefixed with "standard__" are handled specially: "standard__"
|
Names prefixed with "standard__" are handled specially: "standard__"
|
is first stripped off, and only static and global symbols are searched. */
|
is first stripped off, and only static and global symbols are searched. */
|
|
|
int
|
int
|
ada_lookup_symbol_list (const char *name0, const struct block *block0,
|
ada_lookup_symbol_list (const char *name0, const struct block *block0,
|
domain_enum namespace,
|
domain_enum namespace,
|
struct ada_symbol_info **results)
|
struct ada_symbol_info **results)
|
{
|
{
|
struct symbol *sym;
|
struct symbol *sym;
|
struct symtab *s;
|
struct symtab *s;
|
struct partial_symtab *ps;
|
struct partial_symtab *ps;
|
struct blockvector *bv;
|
struct blockvector *bv;
|
struct objfile *objfile;
|
struct objfile *objfile;
|
struct block *block;
|
struct block *block;
|
const char *name;
|
const char *name;
|
struct minimal_symbol *msymbol;
|
struct minimal_symbol *msymbol;
|
int wild_match;
|
int wild_match;
|
int cacheIfUnique;
|
int cacheIfUnique;
|
int block_depth;
|
int block_depth;
|
int ndefns;
|
int ndefns;
|
|
|
obstack_free (&symbol_list_obstack, NULL);
|
obstack_free (&symbol_list_obstack, NULL);
|
obstack_init (&symbol_list_obstack);
|
obstack_init (&symbol_list_obstack);
|
|
|
cacheIfUnique = 0;
|
cacheIfUnique = 0;
|
|
|
/* Search specified block and its superiors. */
|
/* Search specified block and its superiors. */
|
|
|
wild_match = (strstr (name0, "__") == NULL);
|
wild_match = (strstr (name0, "__") == NULL);
|
name = name0;
|
name = name0;
|
block = (struct block *) block0; /* FIXME: No cast ought to be
|
block = (struct block *) block0; /* FIXME: No cast ought to be
|
needed, but adding const will
|
needed, but adding const will
|
have a cascade effect. */
|
have a cascade effect. */
|
if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
|
if (strncmp (name0, "standard__", sizeof ("standard__") - 1) == 0)
|
{
|
{
|
wild_match = 0;
|
wild_match = 0;
|
block = NULL;
|
block = NULL;
|
name = name0 + sizeof ("standard__") - 1;
|
name = name0 + sizeof ("standard__") - 1;
|
}
|
}
|
|
|
block_depth = 0;
|
block_depth = 0;
|
while (block != NULL)
|
while (block != NULL)
|
{
|
{
|
block_depth += 1;
|
block_depth += 1;
|
ada_add_block_symbols (&symbol_list_obstack, block, name,
|
ada_add_block_symbols (&symbol_list_obstack, block, name,
|
namespace, NULL, NULL, wild_match);
|
namespace, NULL, NULL, wild_match);
|
|
|
/* If we found a non-function match, assume that's the one. */
|
/* If we found a non-function match, assume that's the one. */
|
if (is_nonfunction (defns_collected (&symbol_list_obstack, 0),
|
if (is_nonfunction (defns_collected (&symbol_list_obstack, 0),
|
num_defns_collected (&symbol_list_obstack)))
|
num_defns_collected (&symbol_list_obstack)))
|
goto done;
|
goto done;
|
|
|
block = BLOCK_SUPERBLOCK (block);
|
block = BLOCK_SUPERBLOCK (block);
|
}
|
}
|
|
|
/* If no luck so far, try to find NAME as a local symbol in some lexically
|
/* If no luck so far, try to find NAME as a local symbol in some lexically
|
enclosing subprogram. */
|
enclosing subprogram. */
|
if (num_defns_collected (&symbol_list_obstack) == 0 && block_depth > 2)
|
if (num_defns_collected (&symbol_list_obstack) == 0 && block_depth > 2)
|
add_symbols_from_enclosing_procs (&symbol_list_obstack,
|
add_symbols_from_enclosing_procs (&symbol_list_obstack,
|
name, namespace, wild_match);
|
name, namespace, wild_match);
|
|
|
/* If we found ANY matches among non-global symbols, we're done. */
|
/* If we found ANY matches among non-global symbols, we're done. */
|
|
|
if (num_defns_collected (&symbol_list_obstack) > 0)
|
if (num_defns_collected (&symbol_list_obstack) > 0)
|
goto done;
|
goto done;
|
|
|
cacheIfUnique = 1;
|
cacheIfUnique = 1;
|
if (lookup_cached_symbol (name0, namespace, &sym, &block, &s))
|
if (lookup_cached_symbol (name0, namespace, &sym, &block, &s))
|
{
|
{
|
if (sym != NULL)
|
if (sym != NULL)
|
add_defn_to_vec (&symbol_list_obstack, sym, block, s);
|
add_defn_to_vec (&symbol_list_obstack, sym, block, s);
|
goto done;
|
goto done;
|
}
|
}
|
|
|
/* Now add symbols from all global blocks: symbol tables, minimal symbol
|
/* Now add symbols from all global blocks: symbol tables, minimal symbol
|
tables, and psymtab's. */
|
tables, and psymtab's. */
|
|
|
ALL_PRIMARY_SYMTABS (objfile, s)
|
ALL_PRIMARY_SYMTABS (objfile, s)
|
{
|
{
|
QUIT;
|
QUIT;
|
bv = BLOCKVECTOR (s);
|
bv = BLOCKVECTOR (s);
|
block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
|
block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
|
ada_add_block_symbols (&symbol_list_obstack, block, name, namespace,
|
ada_add_block_symbols (&symbol_list_obstack, block, name, namespace,
|
objfile, s, wild_match);
|
objfile, s, wild_match);
|
}
|
}
|
|
|
if (namespace == VAR_DOMAIN)
|
if (namespace == VAR_DOMAIN)
|
{
|
{
|
ALL_MSYMBOLS (objfile, msymbol)
|
ALL_MSYMBOLS (objfile, msymbol)
|
{
|
{
|
if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match))
|
if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol), name, wild_match))
|
{
|
{
|
switch (MSYMBOL_TYPE (msymbol))
|
switch (MSYMBOL_TYPE (msymbol))
|
{
|
{
|
case mst_solib_trampoline:
|
case mst_solib_trampoline:
|
break;
|
break;
|
default:
|
default:
|
s = find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol));
|
s = find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol));
|
if (s != NULL)
|
if (s != NULL)
|
{
|
{
|
int ndefns0 = num_defns_collected (&symbol_list_obstack);
|
int ndefns0 = num_defns_collected (&symbol_list_obstack);
|
QUIT;
|
QUIT;
|
bv = BLOCKVECTOR (s);
|
bv = BLOCKVECTOR (s);
|
block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
|
block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
|
ada_add_block_symbols (&symbol_list_obstack, block,
|
ada_add_block_symbols (&symbol_list_obstack, block,
|
SYMBOL_LINKAGE_NAME (msymbol),
|
SYMBOL_LINKAGE_NAME (msymbol),
|
namespace, objfile, s, wild_match);
|
namespace, objfile, s, wild_match);
|
|
|
if (num_defns_collected (&symbol_list_obstack) == ndefns0)
|
if (num_defns_collected (&symbol_list_obstack) == ndefns0)
|
{
|
{
|
block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
|
block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
|
ada_add_block_symbols (&symbol_list_obstack, block,
|
ada_add_block_symbols (&symbol_list_obstack, block,
|
SYMBOL_LINKAGE_NAME (msymbol),
|
SYMBOL_LINKAGE_NAME (msymbol),
|
namespace, objfile, s,
|
namespace, objfile, s,
|
wild_match);
|
wild_match);
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
ALL_PSYMTABS (objfile, ps)
|
ALL_PSYMTABS (objfile, ps)
|
{
|
{
|
QUIT;
|
QUIT;
|
if (!ps->readin
|
if (!ps->readin
|
&& ada_lookup_partial_symbol (ps, name, 1, namespace, wild_match))
|
&& ada_lookup_partial_symbol (ps, name, 1, namespace, wild_match))
|
{
|
{
|
s = PSYMTAB_TO_SYMTAB (ps);
|
s = PSYMTAB_TO_SYMTAB (ps);
|
if (!s->primary)
|
if (!s->primary)
|
continue;
|
continue;
|
bv = BLOCKVECTOR (s);
|
bv = BLOCKVECTOR (s);
|
block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
|
block = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
|
ada_add_block_symbols (&symbol_list_obstack, block, name,
|
ada_add_block_symbols (&symbol_list_obstack, block, name,
|
namespace, objfile, s, wild_match);
|
namespace, objfile, s, wild_match);
|
}
|
}
|
}
|
}
|
|
|
/* Now add symbols from all per-file blocks if we've gotten no hits
|
/* Now add symbols from all per-file blocks if we've gotten no hits
|
(Not strictly correct, but perhaps better than an error).
|
(Not strictly correct, but perhaps better than an error).
|
Do the symtabs first, then check the psymtabs. */
|
Do the symtabs first, then check the psymtabs. */
|
|
|
if (num_defns_collected (&symbol_list_obstack) == 0)
|
if (num_defns_collected (&symbol_list_obstack) == 0)
|
{
|
{
|
|
|
ALL_PRIMARY_SYMTABS (objfile, s)
|
ALL_PRIMARY_SYMTABS (objfile, s)
|
{
|
{
|
QUIT;
|
QUIT;
|
bv = BLOCKVECTOR (s);
|
bv = BLOCKVECTOR (s);
|
block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
|
block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
|
ada_add_block_symbols (&symbol_list_obstack, block, name, namespace,
|
ada_add_block_symbols (&symbol_list_obstack, block, name, namespace,
|
objfile, s, wild_match);
|
objfile, s, wild_match);
|
}
|
}
|
|
|
ALL_PSYMTABS (objfile, ps)
|
ALL_PSYMTABS (objfile, ps)
|
{
|
{
|
QUIT;
|
QUIT;
|
if (!ps->readin
|
if (!ps->readin
|
&& ada_lookup_partial_symbol (ps, name, 0, namespace, wild_match))
|
&& ada_lookup_partial_symbol (ps, name, 0, namespace, wild_match))
|
{
|
{
|
s = PSYMTAB_TO_SYMTAB (ps);
|
s = PSYMTAB_TO_SYMTAB (ps);
|
bv = BLOCKVECTOR (s);
|
bv = BLOCKVECTOR (s);
|
if (!s->primary)
|
if (!s->primary)
|
continue;
|
continue;
|
block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
|
block = BLOCKVECTOR_BLOCK (bv, STATIC_BLOCK);
|
ada_add_block_symbols (&symbol_list_obstack, block, name,
|
ada_add_block_symbols (&symbol_list_obstack, block, name,
|
namespace, objfile, s, wild_match);
|
namespace, objfile, s, wild_match);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
done:
|
done:
|
ndefns = num_defns_collected (&symbol_list_obstack);
|
ndefns = num_defns_collected (&symbol_list_obstack);
|
*results = defns_collected (&symbol_list_obstack, 1);
|
*results = defns_collected (&symbol_list_obstack, 1);
|
|
|
ndefns = remove_extra_symbols (*results, ndefns);
|
ndefns = remove_extra_symbols (*results, ndefns);
|
|
|
if (ndefns == 0)
|
if (ndefns == 0)
|
cache_symbol (name0, namespace, NULL, NULL, NULL);
|
cache_symbol (name0, namespace, NULL, NULL, NULL);
|
|
|
if (ndefns == 1 && cacheIfUnique)
|
if (ndefns == 1 && cacheIfUnique)
|
cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block,
|
cache_symbol (name0, namespace, (*results)[0].sym, (*results)[0].block,
|
(*results)[0].symtab);
|
(*results)[0].symtab);
|
|
|
ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
|
ndefns = remove_irrelevant_renamings (*results, ndefns, block0);
|
|
|
return ndefns;
|
return ndefns;
|
}
|
}
|
|
|
struct symbol *
|
struct symbol *
|
ada_lookup_encoded_symbol (const char *name, const struct block *block0,
|
ada_lookup_encoded_symbol (const char *name, const struct block *block0,
|
domain_enum namespace,
|
domain_enum namespace,
|
struct block **block_found, struct symtab **symtab)
|
struct block **block_found, struct symtab **symtab)
|
{
|
{
|
struct ada_symbol_info *candidates;
|
struct ada_symbol_info *candidates;
|
int n_candidates;
|
int n_candidates;
|
|
|
n_candidates = ada_lookup_symbol_list (name, block0, namespace, &candidates);
|
n_candidates = ada_lookup_symbol_list (name, block0, namespace, &candidates);
|
|
|
if (n_candidates == 0)
|
if (n_candidates == 0)
|
return NULL;
|
return NULL;
|
|
|
if (block_found != NULL)
|
if (block_found != NULL)
|
*block_found = candidates[0].block;
|
*block_found = candidates[0].block;
|
|
|
if (symtab != NULL)
|
if (symtab != NULL)
|
{
|
{
|
*symtab = candidates[0].symtab;
|
*symtab = candidates[0].symtab;
|
if (*symtab == NULL && candidates[0].block != NULL)
|
if (*symtab == NULL && candidates[0].block != NULL)
|
{
|
{
|
struct objfile *objfile;
|
struct objfile *objfile;
|
struct symtab *s;
|
struct symtab *s;
|
struct block *b;
|
struct block *b;
|
struct blockvector *bv;
|
struct blockvector *bv;
|
|
|
/* Search the list of symtabs for one which contains the
|
/* Search the list of symtabs for one which contains the
|
address of the start of this block. */
|
address of the start of this block. */
|
ALL_PRIMARY_SYMTABS (objfile, s)
|
ALL_PRIMARY_SYMTABS (objfile, s)
|
{
|
{
|
bv = BLOCKVECTOR (s);
|
bv = BLOCKVECTOR (s);
|
b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
|
b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK);
|
if (BLOCK_START (b) <= BLOCK_START (candidates[0].block)
|
if (BLOCK_START (b) <= BLOCK_START (candidates[0].block)
|
&& BLOCK_END (b) > BLOCK_START (candidates[0].block))
|
&& BLOCK_END (b) > BLOCK_START (candidates[0].block))
|
{
|
{
|
*symtab = s;
|
*symtab = s;
|
return fixup_symbol_section (candidates[0].sym, objfile);
|
return fixup_symbol_section (candidates[0].sym, objfile);
|
}
|
}
|
}
|
}
|
/* FIXME: brobecker/2004-11-12: I think that we should never
|
/* FIXME: brobecker/2004-11-12: I think that we should never
|
reach this point. I don't see a reason why we would not
|
reach this point. I don't see a reason why we would not
|
find a symtab for a given block, so I suggest raising an
|
find a symtab for a given block, so I suggest raising an
|
internal_error exception here. Otherwise, we end up
|
internal_error exception here. Otherwise, we end up
|
returning a symbol but no symtab, which certain parts of
|
returning a symbol but no symtab, which certain parts of
|
the code that rely (indirectly) on this function do not
|
the code that rely (indirectly) on this function do not
|
expect, eventually causing a SEGV. */
|
expect, eventually causing a SEGV. */
|
return fixup_symbol_section (candidates[0].sym, NULL);
|
return fixup_symbol_section (candidates[0].sym, NULL);
|
}
|
}
|
}
|
}
|
return candidates[0].sym;
|
return candidates[0].sym;
|
}
|
}
|
|
|
/* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
|
/* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
|
scope and in global scopes, or NULL if none. NAME is folded and
|
scope and in global scopes, or NULL if none. NAME is folded and
|
encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
|
encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
|
choosing the first symbol if there are multiple choices.
|
choosing the first symbol if there are multiple choices.
|
*IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
|
*IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
|
table in which the symbol was found (in both cases, these
|
table in which the symbol was found (in both cases, these
|
assignments occur only if the pointers are non-null). */
|
assignments occur only if the pointers are non-null). */
|
struct symbol *
|
struct symbol *
|
ada_lookup_symbol (const char *name, const struct block *block0,
|
ada_lookup_symbol (const char *name, const struct block *block0,
|
domain_enum namespace, int *is_a_field_of_this,
|
domain_enum namespace, int *is_a_field_of_this,
|
struct symtab **symtab)
|
struct symtab **symtab)
|
{
|
{
|
if (is_a_field_of_this != NULL)
|
if (is_a_field_of_this != NULL)
|
*is_a_field_of_this = 0;
|
*is_a_field_of_this = 0;
|
|
|
return
|
return
|
ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
|
ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name)),
|
block0, namespace, NULL, symtab);
|
block0, namespace, NULL, symtab);
|
}
|
}
|
|
|
static struct symbol *
|
static struct symbol *
|
ada_lookup_symbol_nonlocal (const char *name,
|
ada_lookup_symbol_nonlocal (const char *name,
|
const char *linkage_name,
|
const char *linkage_name,
|
const struct block *block,
|
const struct block *block,
|
const domain_enum domain, struct symtab **symtab)
|
const domain_enum domain, struct symtab **symtab)
|
{
|
{
|
if (linkage_name == NULL)
|
if (linkage_name == NULL)
|
linkage_name = name;
|
linkage_name = name;
|
return ada_lookup_symbol (linkage_name, block_static_block (block), domain,
|
return ada_lookup_symbol (linkage_name, block_static_block (block), domain,
|
NULL, symtab);
|
NULL, symtab);
|
}
|
}
|
|
|
|
|
/* True iff STR is a possible encoded suffix of a normal Ada name
|
/* True iff STR is a possible encoded suffix of a normal Ada name
|
that is to be ignored for matching purposes. Suffixes of parallel
|
that is to be ignored for matching purposes. Suffixes of parallel
|
names (e.g., XVE) are not included here. Currently, the possible suffixes
|
names (e.g., XVE) are not included here. Currently, the possible suffixes
|
are given by either of the regular expression:
|
are given by either of the regular expression:
|
|
|
[.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
|
[.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
|
___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
|
___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
|
_E[0-9]+[bs]$ [protected object entry suffixes]
|
_E[0-9]+[bs]$ [protected object entry suffixes]
|
(X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
|
(X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
|
|
|
Also, any leading "__[0-9]+" sequence is skipped before the suffix
|
Also, any leading "__[0-9]+" sequence is skipped before the suffix
|
match is performed. This sequence is used to differentiate homonyms,
|
match is performed. This sequence is used to differentiate homonyms,
|
is an optional part of a valid name suffix. */
|
is an optional part of a valid name suffix. */
|
|
|
static int
|
static int
|
is_name_suffix (const char *str)
|
is_name_suffix (const char *str)
|
{
|
{
|
int k;
|
int k;
|
const char *matching;
|
const char *matching;
|
const int len = strlen (str);
|
const int len = strlen (str);
|
|
|
/* Skip optional leading __[0-9]+. */
|
/* Skip optional leading __[0-9]+. */
|
|
|
if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
|
if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2]))
|
{
|
{
|
str += 3;
|
str += 3;
|
while (isdigit (str[0]))
|
while (isdigit (str[0]))
|
str += 1;
|
str += 1;
|
}
|
}
|
|
|
/* [.$][0-9]+ */
|
/* [.$][0-9]+ */
|
|
|
if (str[0] == '.' || str[0] == '$')
|
if (str[0] == '.' || str[0] == '$')
|
{
|
{
|
matching = str + 1;
|
matching = str + 1;
|
while (isdigit (matching[0]))
|
while (isdigit (matching[0]))
|
matching += 1;
|
matching += 1;
|
if (matching[0] == '\0')
|
if (matching[0] == '\0')
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* ___[0-9]+ */
|
/* ___[0-9]+ */
|
|
|
if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
|
if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_')
|
{
|
{
|
matching = str + 3;
|
matching = str + 3;
|
while (isdigit (matching[0]))
|
while (isdigit (matching[0]))
|
matching += 1;
|
matching += 1;
|
if (matching[0] == '\0')
|
if (matching[0] == '\0')
|
return 1;
|
return 1;
|
}
|
}
|
|
|
#if 0
|
#if 0
|
/* FIXME: brobecker/2005-09-23: Protected Object subprograms end
|
/* FIXME: brobecker/2005-09-23: Protected Object subprograms end
|
with a N at the end. Unfortunately, the compiler uses the same
|
with a N at the end. Unfortunately, the compiler uses the same
|
convention for other internal types it creates. So treating
|
convention for other internal types it creates. So treating
|
all entity names that end with an "N" as a name suffix causes
|
all entity names that end with an "N" as a name suffix causes
|
some regressions. For instance, consider the case of an enumerated
|
some regressions. For instance, consider the case of an enumerated
|
type. To support the 'Image attribute, it creates an array whose
|
type. To support the 'Image attribute, it creates an array whose
|
name ends with N.
|
name ends with N.
|
Having a single character like this as a suffix carrying some
|
Having a single character like this as a suffix carrying some
|
information is a bit risky. Perhaps we should change the encoding
|
information is a bit risky. Perhaps we should change the encoding
|
to be something like "_N" instead. In the meantime, do not do
|
to be something like "_N" instead. In the meantime, do not do
|
the following check. */
|
the following check. */
|
/* Protected Object Subprograms */
|
/* Protected Object Subprograms */
|
if (len == 1 && str [0] == 'N')
|
if (len == 1 && str [0] == 'N')
|
return 1;
|
return 1;
|
#endif
|
#endif
|
|
|
/* _E[0-9]+[bs]$ */
|
/* _E[0-9]+[bs]$ */
|
if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
|
if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2]))
|
{
|
{
|
matching = str + 3;
|
matching = str + 3;
|
while (isdigit (matching[0]))
|
while (isdigit (matching[0]))
|
matching += 1;
|
matching += 1;
|
if ((matching[0] == 'b' || matching[0] == 's')
|
if ((matching[0] == 'b' || matching[0] == 's')
|
&& matching [1] == '\0')
|
&& matching [1] == '\0')
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* ??? We should not modify STR directly, as we are doing below. This
|
/* ??? We should not modify STR directly, as we are doing below. This
|
is fine in this case, but may become problematic later if we find
|
is fine in this case, but may become problematic later if we find
|
that this alternative did not work, and want to try matching
|
that this alternative did not work, and want to try matching
|
another one from the begining of STR. Since we modified it, we
|
another one from the begining of STR. Since we modified it, we
|
won't be able to find the begining of the string anymore! */
|
won't be able to find the begining of the string anymore! */
|
if (str[0] == 'X')
|
if (str[0] == 'X')
|
{
|
{
|
str += 1;
|
str += 1;
|
while (str[0] != '_' && str[0] != '\0')
|
while (str[0] != '_' && str[0] != '\0')
|
{
|
{
|
if (str[0] != 'n' && str[0] != 'b')
|
if (str[0] != 'n' && str[0] != 'b')
|
return 0;
|
return 0;
|
str += 1;
|
str += 1;
|
}
|
}
|
}
|
}
|
|
|
if (str[0] == '\000')
|
if (str[0] == '\000')
|
return 1;
|
return 1;
|
|
|
if (str[0] == '_')
|
if (str[0] == '_')
|
{
|
{
|
if (str[1] != '_' || str[2] == '\000')
|
if (str[1] != '_' || str[2] == '\000')
|
return 0;
|
return 0;
|
if (str[2] == '_')
|
if (str[2] == '_')
|
{
|
{
|
if (strcmp (str + 3, "JM") == 0)
|
if (strcmp (str + 3, "JM") == 0)
|
return 1;
|
return 1;
|
/* FIXME: brobecker/2004-09-30: GNAT will soon stop using
|
/* FIXME: brobecker/2004-09-30: GNAT will soon stop using
|
the LJM suffix in favor of the JM one. But we will
|
the LJM suffix in favor of the JM one. But we will
|
still accept LJM as a valid suffix for a reasonable
|
still accept LJM as a valid suffix for a reasonable
|
amount of time, just to allow ourselves to debug programs
|
amount of time, just to allow ourselves to debug programs
|
compiled using an older version of GNAT. */
|
compiled using an older version of GNAT. */
|
if (strcmp (str + 3, "LJM") == 0)
|
if (strcmp (str + 3, "LJM") == 0)
|
return 1;
|
return 1;
|
if (str[3] != 'X')
|
if (str[3] != 'X')
|
return 0;
|
return 0;
|
if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
|
if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B'
|
|| str[4] == 'U' || str[4] == 'P')
|
|| str[4] == 'U' || str[4] == 'P')
|
return 1;
|
return 1;
|
if (str[4] == 'R' && str[5] != 'T')
|
if (str[4] == 'R' && str[5] != 'T')
|
return 1;
|
return 1;
|
return 0;
|
return 0;
|
}
|
}
|
if (!isdigit (str[2]))
|
if (!isdigit (str[2]))
|
return 0;
|
return 0;
|
for (k = 3; str[k] != '\0'; k += 1)
|
for (k = 3; str[k] != '\0'; k += 1)
|
if (!isdigit (str[k]) && str[k] != '_')
|
if (!isdigit (str[k]) && str[k] != '_')
|
return 0;
|
return 0;
|
return 1;
|
return 1;
|
}
|
}
|
if (str[0] == '$' && isdigit (str[1]))
|
if (str[0] == '$' && isdigit (str[1]))
|
{
|
{
|
for (k = 2; str[k] != '\0'; k += 1)
|
for (k = 2; str[k] != '\0'; k += 1)
|
if (!isdigit (str[k]) && str[k] != '_')
|
if (!isdigit (str[k]) && str[k] != '_')
|
return 0;
|
return 0;
|
return 1;
|
return 1;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Return nonzero if the given string starts with a dot ('.')
|
/* Return nonzero if the given string starts with a dot ('.')
|
followed by zero or more digits.
|
followed by zero or more digits.
|
|
|
Note: brobecker/2003-11-10: A forward declaration has not been
|
Note: brobecker/2003-11-10: A forward declaration has not been
|
added at the begining of this file yet, because this function
|
added at the begining of this file yet, because this function
|
is only used to work around a problem found during wild matching
|
is only used to work around a problem found during wild matching
|
when trying to match minimal symbol names against symbol names
|
when trying to match minimal symbol names against symbol names
|
obtained from dwarf-2 data. This function is therefore currently
|
obtained from dwarf-2 data. This function is therefore currently
|
only used in wild_match() and is likely to be deleted when the
|
only used in wild_match() and is likely to be deleted when the
|
problem in dwarf-2 is fixed. */
|
problem in dwarf-2 is fixed. */
|
|
|
static int
|
static int
|
is_dot_digits_suffix (const char *str)
|
is_dot_digits_suffix (const char *str)
|
{
|
{
|
if (str[0] != '.')
|
if (str[0] != '.')
|
return 0;
|
return 0;
|
|
|
str++;
|
str++;
|
while (isdigit (str[0]))
|
while (isdigit (str[0]))
|
str++;
|
str++;
|
return (str[0] == '\0');
|
return (str[0] == '\0');
|
}
|
}
|
|
|
/* Return non-zero if the string starting at NAME and ending before
|
/* Return non-zero if the string starting at NAME and ending before
|
NAME_END contains no capital letters. */
|
NAME_END contains no capital letters. */
|
|
|
static int
|
static int
|
is_valid_name_for_wild_match (const char *name0)
|
is_valid_name_for_wild_match (const char *name0)
|
{
|
{
|
const char *decoded_name = ada_decode (name0);
|
const char *decoded_name = ada_decode (name0);
|
int i;
|
int i;
|
|
|
for (i=0; decoded_name[i] != '\0'; i++)
|
for (i=0; decoded_name[i] != '\0'; i++)
|
if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
|
if (isalpha (decoded_name[i]) && !islower (decoded_name[i]))
|
return 0;
|
return 0;
|
|
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* True if NAME represents a name of the form A1.A2....An, n>=1 and
|
/* True if NAME represents a name of the form A1.A2....An, n>=1 and
|
PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
|
PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
|
informational suffixes of NAME (i.e., for which is_name_suffix is
|
informational suffixes of NAME (i.e., for which is_name_suffix is
|
true). */
|
true). */
|
|
|
static int
|
static int
|
wild_match (const char *patn0, int patn_len, const char *name0)
|
wild_match (const char *patn0, int patn_len, const char *name0)
|
{
|
{
|
int name_len;
|
int name_len;
|
char *name;
|
char *name;
|
char *name_start;
|
char *name_start;
|
char *patn;
|
char *patn;
|
|
|
/* FIXME: brobecker/2003-11-10: For some reason, the symbol name
|
/* FIXME: brobecker/2003-11-10: For some reason, the symbol name
|
stored in the symbol table for nested function names is sometimes
|
stored in the symbol table for nested function names is sometimes
|
different from the name of the associated entity stored in
|
different from the name of the associated entity stored in
|
the dwarf-2 data: This is the case for nested subprograms, where
|
the dwarf-2 data: This is the case for nested subprograms, where
|
the minimal symbol name contains a trailing ".[:digit:]+" suffix,
|
the minimal symbol name contains a trailing ".[:digit:]+" suffix,
|
while the symbol name from the dwarf-2 data does not.
|
while the symbol name from the dwarf-2 data does not.
|
|
|
Although the DWARF-2 standard documents that entity names stored
|
Although the DWARF-2 standard documents that entity names stored
|
in the dwarf-2 data should be identical to the name as seen in
|
in the dwarf-2 data should be identical to the name as seen in
|
the source code, GNAT takes a different approach as we already use
|
the source code, GNAT takes a different approach as we already use
|
a special encoding mechanism to convey the information so that
|
a special encoding mechanism to convey the information so that
|
a C debugger can still use the information generated to debug
|
a C debugger can still use the information generated to debug
|
Ada programs. A corollary is that the symbol names in the dwarf-2
|
Ada programs. A corollary is that the symbol names in the dwarf-2
|
data should match the names found in the symbol table. I therefore
|
data should match the names found in the symbol table. I therefore
|
consider this issue as a compiler defect.
|
consider this issue as a compiler defect.
|
|
|
Until the compiler is properly fixed, we work-around the problem
|
Until the compiler is properly fixed, we work-around the problem
|
by ignoring such suffixes during the match. We do so by making
|
by ignoring such suffixes during the match. We do so by making
|
a copy of PATN0 and NAME0, and then by stripping such a suffix
|
a copy of PATN0 and NAME0, and then by stripping such a suffix
|
if present. We then perform the match on the resulting strings. */
|
if present. We then perform the match on the resulting strings. */
|
{
|
{
|
char *dot;
|
char *dot;
|
name_len = strlen (name0);
|
name_len = strlen (name0);
|
|
|
name = name_start = (char *) alloca ((name_len + 1) * sizeof (char));
|
name = name_start = (char *) alloca ((name_len + 1) * sizeof (char));
|
strcpy (name, name0);
|
strcpy (name, name0);
|
dot = strrchr (name, '.');
|
dot = strrchr (name, '.');
|
if (dot != NULL && is_dot_digits_suffix (dot))
|
if (dot != NULL && is_dot_digits_suffix (dot))
|
*dot = '\0';
|
*dot = '\0';
|
|
|
patn = (char *) alloca ((patn_len + 1) * sizeof (char));
|
patn = (char *) alloca ((patn_len + 1) * sizeof (char));
|
strncpy (patn, patn0, patn_len);
|
strncpy (patn, patn0, patn_len);
|
patn[patn_len] = '\0';
|
patn[patn_len] = '\0';
|
dot = strrchr (patn, '.');
|
dot = strrchr (patn, '.');
|
if (dot != NULL && is_dot_digits_suffix (dot))
|
if (dot != NULL && is_dot_digits_suffix (dot))
|
{
|
{
|
*dot = '\0';
|
*dot = '\0';
|
patn_len = dot - patn;
|
patn_len = dot - patn;
|
}
|
}
|
}
|
}
|
|
|
/* Now perform the wild match. */
|
/* Now perform the wild match. */
|
|
|
name_len = strlen (name);
|
name_len = strlen (name);
|
if (name_len >= patn_len + 5 && strncmp (name, "_ada_", 5) == 0
|
if (name_len >= patn_len + 5 && strncmp (name, "_ada_", 5) == 0
|
&& strncmp (patn, name + 5, patn_len) == 0
|
&& strncmp (patn, name + 5, patn_len) == 0
|
&& is_name_suffix (name + patn_len + 5))
|
&& is_name_suffix (name + patn_len + 5))
|
return 1;
|
return 1;
|
|
|
while (name_len >= patn_len)
|
while (name_len >= patn_len)
|
{
|
{
|
if (strncmp (patn, name, patn_len) == 0
|
if (strncmp (patn, name, patn_len) == 0
|
&& is_name_suffix (name + patn_len))
|
&& is_name_suffix (name + patn_len))
|
return (name == name_start || is_valid_name_for_wild_match (name0));
|
return (name == name_start || is_valid_name_for_wild_match (name0));
|
do
|
do
|
{
|
{
|
name += 1;
|
name += 1;
|
name_len -= 1;
|
name_len -= 1;
|
}
|
}
|
while (name_len > 0
|
while (name_len > 0
|
&& name[0] != '.' && (name[0] != '_' || name[1] != '_'));
|
&& name[0] != '.' && (name[0] != '_' || name[1] != '_'));
|
if (name_len <= 0)
|
if (name_len <= 0)
|
return 0;
|
return 0;
|
if (name[0] == '_')
|
if (name[0] == '_')
|
{
|
{
|
if (!islower (name[2]))
|
if (!islower (name[2]))
|
return 0;
|
return 0;
|
name += 2;
|
name += 2;
|
name_len -= 2;
|
name_len -= 2;
|
}
|
}
|
else
|
else
|
{
|
{
|
if (!islower (name[1]))
|
if (!islower (name[1]))
|
return 0;
|
return 0;
|
name += 1;
|
name += 1;
|
name_len -= 1;
|
name_len -= 1;
|
}
|
}
|
}
|
}
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* Add symbols from BLOCK matching identifier NAME in DOMAIN to
|
/* Add symbols from BLOCK matching identifier NAME in DOMAIN to
|
vector *defn_symbols, updating the list of symbols in OBSTACKP
|
vector *defn_symbols, updating the list of symbols in OBSTACKP
|
(if necessary). If WILD, treat as NAME with a wildcard prefix.
|
(if necessary). If WILD, treat as NAME with a wildcard prefix.
|
OBJFILE is the section containing BLOCK.
|
OBJFILE is the section containing BLOCK.
|
SYMTAB is recorded with each symbol added. */
|
SYMTAB is recorded with each symbol added. */
|
|
|
static void
|
static void
|
ada_add_block_symbols (struct obstack *obstackp,
|
ada_add_block_symbols (struct obstack *obstackp,
|
struct block *block, const char *name,
|
struct block *block, const char *name,
|
domain_enum domain, struct objfile *objfile,
|
domain_enum domain, struct objfile *objfile,
|
struct symtab *symtab, int wild)
|
struct symtab *symtab, int wild)
|
{
|
{
|
struct dict_iterator iter;
|
struct dict_iterator iter;
|
int name_len = strlen (name);
|
int name_len = strlen (name);
|
/* A matching argument symbol, if any. */
|
/* A matching argument symbol, if any. */
|
struct symbol *arg_sym;
|
struct symbol *arg_sym;
|
/* Set true when we find a matching non-argument symbol. */
|
/* Set true when we find a matching non-argument symbol. */
|
int found_sym;
|
int found_sym;
|
struct symbol *sym;
|
struct symbol *sym;
|
|
|
arg_sym = NULL;
|
arg_sym = NULL;
|
found_sym = 0;
|
found_sym = 0;
|
if (wild)
|
if (wild)
|
{
|
{
|
struct symbol *sym;
|
struct symbol *sym;
|
ALL_BLOCK_SYMBOLS (block, iter, sym)
|
ALL_BLOCK_SYMBOLS (block, iter, sym)
|
{
|
{
|
if (SYMBOL_DOMAIN (sym) == domain
|
if (SYMBOL_DOMAIN (sym) == domain
|
&& wild_match (name, name_len, SYMBOL_LINKAGE_NAME (sym)))
|
&& wild_match (name, name_len, SYMBOL_LINKAGE_NAME (sym)))
|
{
|
{
|
switch (SYMBOL_CLASS (sym))
|
switch (SYMBOL_CLASS (sym))
|
{
|
{
|
case LOC_ARG:
|
case LOC_ARG:
|
case LOC_LOCAL_ARG:
|
case LOC_LOCAL_ARG:
|
case LOC_REF_ARG:
|
case LOC_REF_ARG:
|
case LOC_REGPARM:
|
case LOC_REGPARM:
|
case LOC_REGPARM_ADDR:
|
case LOC_REGPARM_ADDR:
|
case LOC_BASEREG_ARG:
|
case LOC_BASEREG_ARG:
|
case LOC_COMPUTED_ARG:
|
case LOC_COMPUTED_ARG:
|
arg_sym = sym;
|
arg_sym = sym;
|
break;
|
break;
|
case LOC_UNRESOLVED:
|
case LOC_UNRESOLVED:
|
continue;
|
continue;
|
default:
|
default:
|
found_sym = 1;
|
found_sym = 1;
|
add_defn_to_vec (obstackp,
|
add_defn_to_vec (obstackp,
|
fixup_symbol_section (sym, objfile),
|
fixup_symbol_section (sym, objfile),
|
block, symtab);
|
block, symtab);
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
ALL_BLOCK_SYMBOLS (block, iter, sym)
|
ALL_BLOCK_SYMBOLS (block, iter, sym)
|
{
|
{
|
if (SYMBOL_DOMAIN (sym) == domain)
|
if (SYMBOL_DOMAIN (sym) == domain)
|
{
|
{
|
int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym), name_len);
|
int cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym), name_len);
|
if (cmp == 0
|
if (cmp == 0
|
&& is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len))
|
&& is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len))
|
{
|
{
|
switch (SYMBOL_CLASS (sym))
|
switch (SYMBOL_CLASS (sym))
|
{
|
{
|
case LOC_ARG:
|
case LOC_ARG:
|
case LOC_LOCAL_ARG:
|
case LOC_LOCAL_ARG:
|
case LOC_REF_ARG:
|
case LOC_REF_ARG:
|
case LOC_REGPARM:
|
case LOC_REGPARM:
|
case LOC_REGPARM_ADDR:
|
case LOC_REGPARM_ADDR:
|
case LOC_BASEREG_ARG:
|
case LOC_BASEREG_ARG:
|
case LOC_COMPUTED_ARG:
|
case LOC_COMPUTED_ARG:
|
arg_sym = sym;
|
arg_sym = sym;
|
break;
|
break;
|
case LOC_UNRESOLVED:
|
case LOC_UNRESOLVED:
|
break;
|
break;
|
default:
|
default:
|
found_sym = 1;
|
found_sym = 1;
|
add_defn_to_vec (obstackp,
|
add_defn_to_vec (obstackp,
|
fixup_symbol_section (sym, objfile),
|
fixup_symbol_section (sym, objfile),
|
block, symtab);
|
block, symtab);
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
if (!found_sym && arg_sym != NULL)
|
if (!found_sym && arg_sym != NULL)
|
{
|
{
|
add_defn_to_vec (obstackp,
|
add_defn_to_vec (obstackp,
|
fixup_symbol_section (arg_sym, objfile),
|
fixup_symbol_section (arg_sym, objfile),
|
block, symtab);
|
block, symtab);
|
}
|
}
|
|
|
if (!wild)
|
if (!wild)
|
{
|
{
|
arg_sym = NULL;
|
arg_sym = NULL;
|
found_sym = 0;
|
found_sym = 0;
|
|
|
ALL_BLOCK_SYMBOLS (block, iter, sym)
|
ALL_BLOCK_SYMBOLS (block, iter, sym)
|
{
|
{
|
if (SYMBOL_DOMAIN (sym) == domain)
|
if (SYMBOL_DOMAIN (sym) == domain)
|
{
|
{
|
int cmp;
|
int cmp;
|
|
|
cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
|
cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0];
|
if (cmp == 0)
|
if (cmp == 0)
|
{
|
{
|
cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
|
cmp = strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym), 5);
|
if (cmp == 0)
|
if (cmp == 0)
|
cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
|
cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5,
|
name_len);
|
name_len);
|
}
|
}
|
|
|
if (cmp == 0
|
if (cmp == 0
|
&& is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
|
&& is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5))
|
{
|
{
|
switch (SYMBOL_CLASS (sym))
|
switch (SYMBOL_CLASS (sym))
|
{
|
{
|
case LOC_ARG:
|
case LOC_ARG:
|
case LOC_LOCAL_ARG:
|
case LOC_LOCAL_ARG:
|
case LOC_REF_ARG:
|
case LOC_REF_ARG:
|
case LOC_REGPARM:
|
case LOC_REGPARM:
|
case LOC_REGPARM_ADDR:
|
case LOC_REGPARM_ADDR:
|
case LOC_BASEREG_ARG:
|
case LOC_BASEREG_ARG:
|
case LOC_COMPUTED_ARG:
|
case LOC_COMPUTED_ARG:
|
arg_sym = sym;
|
arg_sym = sym;
|
break;
|
break;
|
case LOC_UNRESOLVED:
|
case LOC_UNRESOLVED:
|
break;
|
break;
|
default:
|
default:
|
found_sym = 1;
|
found_sym = 1;
|
add_defn_to_vec (obstackp,
|
add_defn_to_vec (obstackp,
|
fixup_symbol_section (sym, objfile),
|
fixup_symbol_section (sym, objfile),
|
block, symtab);
|
block, symtab);
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* NOTE: This really shouldn't be needed for _ada_ symbols.
|
/* NOTE: This really shouldn't be needed for _ada_ symbols.
|
They aren't parameters, right? */
|
They aren't parameters, right? */
|
if (!found_sym && arg_sym != NULL)
|
if (!found_sym && arg_sym != NULL)
|
{
|
{
|
add_defn_to_vec (obstackp,
|
add_defn_to_vec (obstackp,
|
fixup_symbol_section (arg_sym, objfile),
|
fixup_symbol_section (arg_sym, objfile),
|
block, symtab);
|
block, symtab);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Symbol Completion */
|
/* Symbol Completion */
|
|
|
/* If SYM_NAME is a completion candidate for TEXT, return this symbol
|
/* If SYM_NAME is a completion candidate for TEXT, return this symbol
|
name in a form that's appropriate for the completion. The result
|
name in a form that's appropriate for the completion. The result
|
does not need to be deallocated, but is only good until the next call.
|
does not need to be deallocated, but is only good until the next call.
|
|
|
TEXT_LEN is equal to the length of TEXT.
|
TEXT_LEN is equal to the length of TEXT.
|
Perform a wild match if WILD_MATCH is set.
|
Perform a wild match if WILD_MATCH is set.
|
ENCODED should be set if TEXT represents the start of a symbol name
|
ENCODED should be set if TEXT represents the start of a symbol name
|
in its encoded form. */
|
in its encoded form. */
|
|
|
static const char *
|
static const char *
|
symbol_completion_match (const char *sym_name,
|
symbol_completion_match (const char *sym_name,
|
const char *text, int text_len,
|
const char *text, int text_len,
|
int wild_match, int encoded)
|
int wild_match, int encoded)
|
{
|
{
|
char *result;
|
char *result;
|
const int verbatim_match = (text[0] == '<');
|
const int verbatim_match = (text[0] == '<');
|
int match = 0;
|
int match = 0;
|
|
|
if (verbatim_match)
|
if (verbatim_match)
|
{
|
{
|
/* Strip the leading angle bracket. */
|
/* Strip the leading angle bracket. */
|
text = text + 1;
|
text = text + 1;
|
text_len--;
|
text_len--;
|
}
|
}
|
|
|
/* First, test against the fully qualified name of the symbol. */
|
/* First, test against the fully qualified name of the symbol. */
|
|
|
if (strncmp (sym_name, text, text_len) == 0)
|
if (strncmp (sym_name, text, text_len) == 0)
|
match = 1;
|
match = 1;
|
|
|
if (match && !encoded)
|
if (match && !encoded)
|
{
|
{
|
/* One needed check before declaring a positive match is to verify
|
/* One needed check before declaring a positive match is to verify
|
that iff we are doing a verbatim match, the decoded version
|
that iff we are doing a verbatim match, the decoded version
|
of the symbol name starts with '<'. Otherwise, this symbol name
|
of the symbol name starts with '<'. Otherwise, this symbol name
|
is not a suitable completion. */
|
is not a suitable completion. */
|
const char *sym_name_copy = sym_name;
|
const char *sym_name_copy = sym_name;
|
int has_angle_bracket;
|
int has_angle_bracket;
|
|
|
sym_name = ada_decode (sym_name);
|
sym_name = ada_decode (sym_name);
|
has_angle_bracket = (sym_name[0] == '<');
|
has_angle_bracket = (sym_name[0] == '<');
|
match = (has_angle_bracket == verbatim_match);
|
match = (has_angle_bracket == verbatim_match);
|
sym_name = sym_name_copy;
|
sym_name = sym_name_copy;
|
}
|
}
|
|
|
if (match && !verbatim_match)
|
if (match && !verbatim_match)
|
{
|
{
|
/* When doing non-verbatim match, another check that needs to
|
/* When doing non-verbatim match, another check that needs to
|
be done is to verify that the potentially matching symbol name
|
be done is to verify that the potentially matching symbol name
|
does not include capital letters, because the ada-mode would
|
does not include capital letters, because the ada-mode would
|
not be able to understand these symbol names without the
|
not be able to understand these symbol names without the
|
angle bracket notation. */
|
angle bracket notation. */
|
const char *tmp;
|
const char *tmp;
|
|
|
for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
|
for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++);
|
if (*tmp != '\0')
|
if (*tmp != '\0')
|
match = 0;
|
match = 0;
|
}
|
}
|
|
|
/* Second: Try wild matching... */
|
/* Second: Try wild matching... */
|
|
|
if (!match && wild_match)
|
if (!match && wild_match)
|
{
|
{
|
/* Since we are doing wild matching, this means that TEXT
|
/* Since we are doing wild matching, this means that TEXT
|
may represent an unqualified symbol name. We therefore must
|
may represent an unqualified symbol name. We therefore must
|
also compare TEXT against the unqualified name of the symbol. */
|
also compare TEXT against the unqualified name of the symbol. */
|
sym_name = ada_unqualified_name (ada_decode (sym_name));
|
sym_name = ada_unqualified_name (ada_decode (sym_name));
|
|
|
if (strncmp (sym_name, text, text_len) == 0)
|
if (strncmp (sym_name, text, text_len) == 0)
|
match = 1;
|
match = 1;
|
}
|
}
|
|
|
/* Finally: If we found a mach, prepare the result to return. */
|
/* Finally: If we found a mach, prepare the result to return. */
|
|
|
if (!match)
|
if (!match)
|
return NULL;
|
return NULL;
|
|
|
if (verbatim_match)
|
if (verbatim_match)
|
sym_name = add_angle_brackets (sym_name);
|
sym_name = add_angle_brackets (sym_name);
|
|
|
if (!encoded)
|
if (!encoded)
|
sym_name = ada_decode (sym_name);
|
sym_name = ada_decode (sym_name);
|
|
|
return sym_name;
|
return sym_name;
|
}
|
}
|
|
|
typedef char *char_ptr;
|
typedef char *char_ptr;
|
DEF_VEC_P (char_ptr);
|
DEF_VEC_P (char_ptr);
|
|
|
/* A companion function to ada_make_symbol_completion_list().
|
/* A companion function to ada_make_symbol_completion_list().
|
Check if SYM_NAME represents a symbol which name would be suitable
|
Check if SYM_NAME represents a symbol which name would be suitable
|
to complete TEXT (TEXT_LEN is the length of TEXT), in which case
|
to complete TEXT (TEXT_LEN is the length of TEXT), in which case
|
it is appended at the end of the given string vector SV.
|
it is appended at the end of the given string vector SV.
|
|
|
ORIG_TEXT is the string original string from the user command
|
ORIG_TEXT is the string original string from the user command
|
that needs to be completed. WORD is the entire command on which
|
that needs to be completed. WORD is the entire command on which
|
completion should be performed. These two parameters are used to
|
completion should be performed. These two parameters are used to
|
determine which part of the symbol name should be added to the
|
determine which part of the symbol name should be added to the
|
completion vector.
|
completion vector.
|
if WILD_MATCH is set, then wild matching is performed.
|
if WILD_MATCH is set, then wild matching is performed.
|
ENCODED should be set if TEXT represents a symbol name in its
|
ENCODED should be set if TEXT represents a symbol name in its
|
encoded formed (in which case the completion should also be
|
encoded formed (in which case the completion should also be
|
encoded). */
|
encoded). */
|
|
|
static void
|
static void
|
symbol_completion_add (VEC(char_ptr) **sv,
|
symbol_completion_add (VEC(char_ptr) **sv,
|
const char *sym_name,
|
const char *sym_name,
|
const char *text, int text_len,
|
const char *text, int text_len,
|
const char *orig_text, const char *word,
|
const char *orig_text, const char *word,
|
int wild_match, int encoded)
|
int wild_match, int encoded)
|
{
|
{
|
const char *match = symbol_completion_match (sym_name, text, text_len,
|
const char *match = symbol_completion_match (sym_name, text, text_len,
|
wild_match, encoded);
|
wild_match, encoded);
|
char *completion;
|
char *completion;
|
|
|
if (match == NULL)
|
if (match == NULL)
|
return;
|
return;
|
|
|
/* We found a match, so add the appropriate completion to the given
|
/* We found a match, so add the appropriate completion to the given
|
string vector. */
|
string vector. */
|
|
|
if (word == orig_text)
|
if (word == orig_text)
|
{
|
{
|
completion = xmalloc (strlen (match) + 5);
|
completion = xmalloc (strlen (match) + 5);
|
strcpy (completion, match);
|
strcpy (completion, match);
|
}
|
}
|
else if (word > orig_text)
|
else if (word > orig_text)
|
{
|
{
|
/* Return some portion of sym_name. */
|
/* Return some portion of sym_name. */
|
completion = xmalloc (strlen (match) + 5);
|
completion = xmalloc (strlen (match) + 5);
|
strcpy (completion, match + (word - orig_text));
|
strcpy (completion, match + (word - orig_text));
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Return some of ORIG_TEXT plus sym_name. */
|
/* Return some of ORIG_TEXT plus sym_name. */
|
completion = xmalloc (strlen (match) + (orig_text - word) + 5);
|
completion = xmalloc (strlen (match) + (orig_text - word) + 5);
|
strncpy (completion, word, orig_text - word);
|
strncpy (completion, word, orig_text - word);
|
completion[orig_text - word] = '\0';
|
completion[orig_text - word] = '\0';
|
strcat (completion, match);
|
strcat (completion, match);
|
}
|
}
|
|
|
VEC_safe_push (char_ptr, *sv, completion);
|
VEC_safe_push (char_ptr, *sv, completion);
|
}
|
}
|
|
|
/* Return a list of possible symbol names completing TEXT0. The list
|
/* Return a list of possible symbol names completing TEXT0. The list
|
is NULL terminated. WORD is the entire command on which completion
|
is NULL terminated. WORD is the entire command on which completion
|
is made. */
|
is made. */
|
|
|
static char **
|
static char **
|
ada_make_symbol_completion_list (char *text0, char *word)
|
ada_make_symbol_completion_list (char *text0, char *word)
|
{
|
{
|
char *text;
|
char *text;
|
int text_len;
|
int text_len;
|
int wild_match;
|
int wild_match;
|
int encoded;
|
int encoded;
|
VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128);
|
VEC(char_ptr) *completions = VEC_alloc (char_ptr, 128);
|
struct symbol *sym;
|
struct symbol *sym;
|
struct symtab *s;
|
struct symtab *s;
|
struct partial_symtab *ps;
|
struct partial_symtab *ps;
|
struct minimal_symbol *msymbol;
|
struct minimal_symbol *msymbol;
|
struct objfile *objfile;
|
struct objfile *objfile;
|
struct block *b, *surrounding_static_block = 0;
|
struct block *b, *surrounding_static_block = 0;
|
int i;
|
int i;
|
struct dict_iterator iter;
|
struct dict_iterator iter;
|
|
|
if (text0[0] == '<')
|
if (text0[0] == '<')
|
{
|
{
|
text = xstrdup (text0);
|
text = xstrdup (text0);
|
make_cleanup (xfree, text);
|
make_cleanup (xfree, text);
|
text_len = strlen (text);
|
text_len = strlen (text);
|
wild_match = 0;
|
wild_match = 0;
|
encoded = 1;
|
encoded = 1;
|
}
|
}
|
else
|
else
|
{
|
{
|
text = xstrdup (ada_encode (text0));
|
text = xstrdup (ada_encode (text0));
|
make_cleanup (xfree, text);
|
make_cleanup (xfree, text);
|
text_len = strlen (text);
|
text_len = strlen (text);
|
for (i = 0; i < text_len; i++)
|
for (i = 0; i < text_len; i++)
|
text[i] = tolower (text[i]);
|
text[i] = tolower (text[i]);
|
|
|
encoded = (strstr (text0, "__") != NULL);
|
encoded = (strstr (text0, "__") != NULL);
|
/* If the name contains a ".", then the user is entering a fully
|
/* If the name contains a ".", then the user is entering a fully
|
qualified entity name, and the match must not be done in wild
|
qualified entity name, and the match must not be done in wild
|
mode. Similarly, if the user wants to complete what looks like
|
mode. Similarly, if the user wants to complete what looks like
|
an encoded name, the match must not be done in wild mode. */
|
an encoded name, the match must not be done in wild mode. */
|
wild_match = (strchr (text0, '.') == NULL && !encoded);
|
wild_match = (strchr (text0, '.') == NULL && !encoded);
|
}
|
}
|
|
|
/* First, look at the partial symtab symbols. */
|
/* First, look at the partial symtab symbols. */
|
ALL_PSYMTABS (objfile, ps)
|
ALL_PSYMTABS (objfile, ps)
|
{
|
{
|
struct partial_symbol **psym;
|
struct partial_symbol **psym;
|
|
|
/* If the psymtab's been read in we'll get it when we search
|
/* If the psymtab's been read in we'll get it when we search
|
through the blockvector. */
|
through the blockvector. */
|
if (ps->readin)
|
if (ps->readin)
|
continue;
|
continue;
|
|
|
for (psym = objfile->global_psymbols.list + ps->globals_offset;
|
for (psym = objfile->global_psymbols.list + ps->globals_offset;
|
psym < (objfile->global_psymbols.list + ps->globals_offset
|
psym < (objfile->global_psymbols.list + ps->globals_offset
|
+ ps->n_global_syms); psym++)
|
+ ps->n_global_syms); psym++)
|
{
|
{
|
QUIT;
|
QUIT;
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (*psym),
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (*psym),
|
text, text_len, text0, word,
|
text, text_len, text0, word,
|
wild_match, encoded);
|
wild_match, encoded);
|
}
|
}
|
|
|
for (psym = objfile->static_psymbols.list + ps->statics_offset;
|
for (psym = objfile->static_psymbols.list + ps->statics_offset;
|
psym < (objfile->static_psymbols.list + ps->statics_offset
|
psym < (objfile->static_psymbols.list + ps->statics_offset
|
+ ps->n_static_syms); psym++)
|
+ ps->n_static_syms); psym++)
|
{
|
{
|
QUIT;
|
QUIT;
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (*psym),
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (*psym),
|
text, text_len, text0, word,
|
text, text_len, text0, word,
|
wild_match, encoded);
|
wild_match, encoded);
|
}
|
}
|
}
|
}
|
|
|
/* At this point scan through the misc symbol vectors and add each
|
/* At this point scan through the misc symbol vectors and add each
|
symbol you find to the list. Eventually we want to ignore
|
symbol you find to the list. Eventually we want to ignore
|
anything that isn't a text symbol (everything else will be
|
anything that isn't a text symbol (everything else will be
|
handled by the psymtab code above). */
|
handled by the psymtab code above). */
|
|
|
ALL_MSYMBOLS (objfile, msymbol)
|
ALL_MSYMBOLS (objfile, msymbol)
|
{
|
{
|
QUIT;
|
QUIT;
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (msymbol),
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (msymbol),
|
text, text_len, text0, word, wild_match, encoded);
|
text, text_len, text0, word, wild_match, encoded);
|
}
|
}
|
|
|
/* Search upwards from currently selected frame (so that we can
|
/* Search upwards from currently selected frame (so that we can
|
complete on local vars. */
|
complete on local vars. */
|
|
|
for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
|
for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b))
|
{
|
{
|
if (!BLOCK_SUPERBLOCK (b))
|
if (!BLOCK_SUPERBLOCK (b))
|
surrounding_static_block = b; /* For elmin of dups */
|
surrounding_static_block = b; /* For elmin of dups */
|
|
|
ALL_BLOCK_SYMBOLS (b, iter, sym)
|
ALL_BLOCK_SYMBOLS (b, iter, sym)
|
{
|
{
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
|
text, text_len, text0, word,
|
text, text_len, text0, word,
|
wild_match, encoded);
|
wild_match, encoded);
|
}
|
}
|
}
|
}
|
|
|
/* Go through the symtabs and check the externs and statics for
|
/* Go through the symtabs and check the externs and statics for
|
symbols which match. */
|
symbols which match. */
|
|
|
ALL_SYMTABS (objfile, s)
|
ALL_SYMTABS (objfile, s)
|
{
|
{
|
QUIT;
|
QUIT;
|
b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
|
b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), GLOBAL_BLOCK);
|
ALL_BLOCK_SYMBOLS (b, iter, sym)
|
ALL_BLOCK_SYMBOLS (b, iter, sym)
|
{
|
{
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
|
text, text_len, text0, word,
|
text, text_len, text0, word,
|
wild_match, encoded);
|
wild_match, encoded);
|
}
|
}
|
}
|
}
|
|
|
ALL_SYMTABS (objfile, s)
|
ALL_SYMTABS (objfile, s)
|
{
|
{
|
QUIT;
|
QUIT;
|
b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
|
b = BLOCKVECTOR_BLOCK (BLOCKVECTOR (s), STATIC_BLOCK);
|
/* Don't do this block twice. */
|
/* Don't do this block twice. */
|
if (b == surrounding_static_block)
|
if (b == surrounding_static_block)
|
continue;
|
continue;
|
ALL_BLOCK_SYMBOLS (b, iter, sym)
|
ALL_BLOCK_SYMBOLS (b, iter, sym)
|
{
|
{
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
|
symbol_completion_add (&completions, SYMBOL_LINKAGE_NAME (sym),
|
text, text_len, text0, word,
|
text, text_len, text0, word,
|
wild_match, encoded);
|
wild_match, encoded);
|
}
|
}
|
}
|
}
|
|
|
/* Append the closing NULL entry. */
|
/* Append the closing NULL entry. */
|
VEC_safe_push (char_ptr, completions, NULL);
|
VEC_safe_push (char_ptr, completions, NULL);
|
|
|
/* Make a copy of the COMPLETIONS VEC before we free it, and then
|
/* Make a copy of the COMPLETIONS VEC before we free it, and then
|
return the copy. It's unfortunate that we have to make a copy
|
return the copy. It's unfortunate that we have to make a copy
|
of an array that we're about to destroy, but there is nothing much
|
of an array that we're about to destroy, but there is nothing much
|
we can do about it. Fortunately, it's typically not a very large
|
we can do about it. Fortunately, it's typically not a very large
|
array. */
|
array. */
|
{
|
{
|
const size_t completions_size =
|
const size_t completions_size =
|
VEC_length (char_ptr, completions) * sizeof (char *);
|
VEC_length (char_ptr, completions) * sizeof (char *);
|
char **result = malloc (completions_size);
|
char **result = malloc (completions_size);
|
|
|
memcpy (result, VEC_address (char_ptr, completions), completions_size);
|
memcpy (result, VEC_address (char_ptr, completions), completions_size);
|
|
|
VEC_free (char_ptr, completions);
|
VEC_free (char_ptr, completions);
|
return result;
|
return result;
|
}
|
}
|
}
|
}
|
|
|
/* Field Access */
|
/* Field Access */
|
|
|
/* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
|
/* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
|
for tagged types. */
|
for tagged types. */
|
|
|
static int
|
static int
|
ada_is_dispatch_table_ptr_type (struct type *type)
|
ada_is_dispatch_table_ptr_type (struct type *type)
|
{
|
{
|
char *name;
|
char *name;
|
|
|
if (TYPE_CODE (type) != TYPE_CODE_PTR)
|
if (TYPE_CODE (type) != TYPE_CODE_PTR)
|
return 0;
|
return 0;
|
|
|
name = TYPE_NAME (TYPE_TARGET_TYPE (type));
|
name = TYPE_NAME (TYPE_TARGET_TYPE (type));
|
if (name == NULL)
|
if (name == NULL)
|
return 0;
|
return 0;
|
|
|
return (strcmp (name, "ada__tags__dispatch_table") == 0);
|
return (strcmp (name, "ada__tags__dispatch_table") == 0);
|
}
|
}
|
|
|
/* True if field number FIELD_NUM in struct or union type TYPE is supposed
|
/* True if field number FIELD_NUM in struct or union type TYPE is supposed
|
to be invisible to users. */
|
to be invisible to users. */
|
|
|
int
|
int
|
ada_is_ignored_field (struct type *type, int field_num)
|
ada_is_ignored_field (struct type *type, int field_num)
|
{
|
{
|
if (field_num < 0 || field_num > TYPE_NFIELDS (type))
|
if (field_num < 0 || field_num > TYPE_NFIELDS (type))
|
return 1;
|
return 1;
|
|
|
/* Check the name of that field. */
|
/* Check the name of that field. */
|
{
|
{
|
const char *name = TYPE_FIELD_NAME (type, field_num);
|
const char *name = TYPE_FIELD_NAME (type, field_num);
|
|
|
/* Anonymous field names should not be printed.
|
/* Anonymous field names should not be printed.
|
brobecker/2007-02-20: I don't think this can actually happen
|
brobecker/2007-02-20: I don't think this can actually happen
|
but we don't want to print the value of annonymous fields anyway. */
|
but we don't want to print the value of annonymous fields anyway. */
|
if (name == NULL)
|
if (name == NULL)
|
return 1;
|
return 1;
|
|
|
/* A field named "_parent" is internally generated by GNAT for
|
/* A field named "_parent" is internally generated by GNAT for
|
tagged types, and should not be printed either. */
|
tagged types, and should not be printed either. */
|
if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
|
if (name[0] == '_' && strncmp (name, "_parent", 7) != 0)
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* If this is the dispatch table of a tagged type, then ignore. */
|
/* If this is the dispatch table of a tagged type, then ignore. */
|
if (ada_is_tagged_type (type, 1)
|
if (ada_is_tagged_type (type, 1)
|
&& ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)))
|
&& ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)))
|
return 1;
|
return 1;
|
|
|
/* Not a special field, so it should not be ignored. */
|
/* Not a special field, so it should not be ignored. */
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
|
/* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
|
pointer or reference type whose ultimate target has a tag field. */
|
pointer or reference type whose ultimate target has a tag field. */
|
|
|
int
|
int
|
ada_is_tagged_type (struct type *type, int refok)
|
ada_is_tagged_type (struct type *type, int refok)
|
{
|
{
|
return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
|
return (ada_lookup_struct_elt_type (type, "_tag", refok, 1, NULL) != NULL);
|
}
|
}
|
|
|
/* True iff TYPE represents the type of X'Tag */
|
/* True iff TYPE represents the type of X'Tag */
|
|
|
int
|
int
|
ada_is_tag_type (struct type *type)
|
ada_is_tag_type (struct type *type)
|
{
|
{
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR)
|
return 0;
|
return 0;
|
else
|
else
|
{
|
{
|
const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
|
const char *name = ada_type_name (TYPE_TARGET_TYPE (type));
|
return (name != NULL
|
return (name != NULL
|
&& strcmp (name, "ada__tags__dispatch_table") == 0);
|
&& strcmp (name, "ada__tags__dispatch_table") == 0);
|
}
|
}
|
}
|
}
|
|
|
/* The type of the tag on VAL. */
|
/* The type of the tag on VAL. */
|
|
|
struct type *
|
struct type *
|
ada_tag_type (struct value *val)
|
ada_tag_type (struct value *val)
|
{
|
{
|
return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
|
return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0, NULL);
|
}
|
}
|
|
|
/* The value of the tag on VAL. */
|
/* The value of the tag on VAL. */
|
|
|
struct value *
|
struct value *
|
ada_value_tag (struct value *val)
|
ada_value_tag (struct value *val)
|
{
|
{
|
return ada_value_struct_elt (val, "_tag", 0);
|
return ada_value_struct_elt (val, "_tag", 0);
|
}
|
}
|
|
|
/* The value of the tag on the object of type TYPE whose contents are
|
/* The value of the tag on the object of type TYPE whose contents are
|
saved at VALADDR, if it is non-null, or is at memory address
|
saved at VALADDR, if it is non-null, or is at memory address
|
ADDRESS. */
|
ADDRESS. */
|
|
|
static struct value *
|
static struct value *
|
value_tag_from_contents_and_address (struct type *type,
|
value_tag_from_contents_and_address (struct type *type,
|
const gdb_byte *valaddr,
|
const gdb_byte *valaddr,
|
CORE_ADDR address)
|
CORE_ADDR address)
|
{
|
{
|
int tag_byte_offset, dummy1, dummy2;
|
int tag_byte_offset, dummy1, dummy2;
|
struct type *tag_type;
|
struct type *tag_type;
|
if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
|
if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset,
|
NULL, NULL, NULL))
|
NULL, NULL, NULL))
|
{
|
{
|
const gdb_byte *valaddr1 = ((valaddr == NULL)
|
const gdb_byte *valaddr1 = ((valaddr == NULL)
|
? NULL
|
? NULL
|
: valaddr + tag_byte_offset);
|
: valaddr + tag_byte_offset);
|
CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
|
CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset;
|
|
|
return value_from_contents_and_address (tag_type, valaddr1, address1);
|
return value_from_contents_and_address (tag_type, valaddr1, address1);
|
}
|
}
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
static struct type *
|
static struct type *
|
type_from_tag (struct value *tag)
|
type_from_tag (struct value *tag)
|
{
|
{
|
const char *type_name = ada_tag_name (tag);
|
const char *type_name = ada_tag_name (tag);
|
if (type_name != NULL)
|
if (type_name != NULL)
|
return ada_find_any_type (ada_encode (type_name));
|
return ada_find_any_type (ada_encode (type_name));
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
struct tag_args
|
struct tag_args
|
{
|
{
|
struct value *tag;
|
struct value *tag;
|
char *name;
|
char *name;
|
};
|
};
|
|
|
|
|
static int ada_tag_name_1 (void *);
|
static int ada_tag_name_1 (void *);
|
static int ada_tag_name_2 (struct tag_args *);
|
static int ada_tag_name_2 (struct tag_args *);
|
|
|
/* Wrapper function used by ada_tag_name. Given a struct tag_args*
|
/* Wrapper function used by ada_tag_name. Given a struct tag_args*
|
value ARGS, sets ARGS->name to the tag name of ARGS->tag.
|
value ARGS, sets ARGS->name to the tag name of ARGS->tag.
|
The value stored in ARGS->name is valid until the next call to
|
The value stored in ARGS->name is valid until the next call to
|
ada_tag_name_1. */
|
ada_tag_name_1. */
|
|
|
static int
|
static int
|
ada_tag_name_1 (void *args0)
|
ada_tag_name_1 (void *args0)
|
{
|
{
|
struct tag_args *args = (struct tag_args *) args0;
|
struct tag_args *args = (struct tag_args *) args0;
|
static char name[1024];
|
static char name[1024];
|
char *p;
|
char *p;
|
struct value *val;
|
struct value *val;
|
args->name = NULL;
|
args->name = NULL;
|
val = ada_value_struct_elt (args->tag, "tsd", 1);
|
val = ada_value_struct_elt (args->tag, "tsd", 1);
|
if (val == NULL)
|
if (val == NULL)
|
return ada_tag_name_2 (args);
|
return ada_tag_name_2 (args);
|
val = ada_value_struct_elt (val, "expanded_name", 1);
|
val = ada_value_struct_elt (val, "expanded_name", 1);
|
if (val == NULL)
|
if (val == NULL)
|
return 0;
|
return 0;
|
read_memory_string (value_as_address (val), name, sizeof (name) - 1);
|
read_memory_string (value_as_address (val), name, sizeof (name) - 1);
|
for (p = name; *p != '\0'; p += 1)
|
for (p = name; *p != '\0'; p += 1)
|
if (isalpha (*p))
|
if (isalpha (*p))
|
*p = tolower (*p);
|
*p = tolower (*p);
|
args->name = name;
|
args->name = name;
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Utility function for ada_tag_name_1 that tries the second
|
/* Utility function for ada_tag_name_1 that tries the second
|
representation for the dispatch table (in which there is no
|
representation for the dispatch table (in which there is no
|
explicit 'tsd' field in the referent of the tag pointer, and instead
|
explicit 'tsd' field in the referent of the tag pointer, and instead
|
the tsd pointer is stored just before the dispatch table. */
|
the tsd pointer is stored just before the dispatch table. */
|
|
|
static int
|
static int
|
ada_tag_name_2 (struct tag_args *args)
|
ada_tag_name_2 (struct tag_args *args)
|
{
|
{
|
struct type *info_type;
|
struct type *info_type;
|
static char name[1024];
|
static char name[1024];
|
char *p;
|
char *p;
|
struct value *val, *valp;
|
struct value *val, *valp;
|
|
|
args->name = NULL;
|
args->name = NULL;
|
info_type = ada_find_any_type ("ada__tags__type_specific_data");
|
info_type = ada_find_any_type ("ada__tags__type_specific_data");
|
if (info_type == NULL)
|
if (info_type == NULL)
|
return 0;
|
return 0;
|
info_type = lookup_pointer_type (lookup_pointer_type (info_type));
|
info_type = lookup_pointer_type (lookup_pointer_type (info_type));
|
valp = value_cast (info_type, args->tag);
|
valp = value_cast (info_type, args->tag);
|
if (valp == NULL)
|
if (valp == NULL)
|
return 0;
|
return 0;
|
val = value_ind (value_add (valp, value_from_longest (builtin_type_int, -1)));
|
val = value_ind (value_add (valp, value_from_longest (builtin_type_int, -1)));
|
if (val == NULL)
|
if (val == NULL)
|
return 0;
|
return 0;
|
val = ada_value_struct_elt (val, "expanded_name", 1);
|
val = ada_value_struct_elt (val, "expanded_name", 1);
|
if (val == NULL)
|
if (val == NULL)
|
return 0;
|
return 0;
|
read_memory_string (value_as_address (val), name, sizeof (name) - 1);
|
read_memory_string (value_as_address (val), name, sizeof (name) - 1);
|
for (p = name; *p != '\0'; p += 1)
|
for (p = name; *p != '\0'; p += 1)
|
if (isalpha (*p))
|
if (isalpha (*p))
|
*p = tolower (*p);
|
*p = tolower (*p);
|
args->name = name;
|
args->name = name;
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* The type name of the dynamic type denoted by the 'tag value TAG, as
|
/* The type name of the dynamic type denoted by the 'tag value TAG, as
|
* a C string. */
|
* a C string. */
|
|
|
const char *
|
const char *
|
ada_tag_name (struct value *tag)
|
ada_tag_name (struct value *tag)
|
{
|
{
|
struct tag_args args;
|
struct tag_args args;
|
if (!ada_is_tag_type (value_type (tag)))
|
if (!ada_is_tag_type (value_type (tag)))
|
return NULL;
|
return NULL;
|
args.tag = tag;
|
args.tag = tag;
|
args.name = NULL;
|
args.name = NULL;
|
catch_errors (ada_tag_name_1, &args, NULL, RETURN_MASK_ALL);
|
catch_errors (ada_tag_name_1, &args, NULL, RETURN_MASK_ALL);
|
return args.name;
|
return args.name;
|
}
|
}
|
|
|
/* The parent type of TYPE, or NULL if none. */
|
/* The parent type of TYPE, or NULL if none. */
|
|
|
struct type *
|
struct type *
|
ada_parent_type (struct type *type)
|
ada_parent_type (struct type *type)
|
{
|
{
|
int i;
|
int i;
|
|
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
|
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
|
return NULL;
|
return NULL;
|
|
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
if (ada_is_parent_field (type, i))
|
if (ada_is_parent_field (type, i))
|
return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
|
return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
|
|
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* True iff field number FIELD_NUM of structure type TYPE contains the
|
/* True iff field number FIELD_NUM of structure type TYPE contains the
|
parent-type (inherited) fields of a derived type. Assumes TYPE is
|
parent-type (inherited) fields of a derived type. Assumes TYPE is
|
a structure type with at least FIELD_NUM+1 fields. */
|
a structure type with at least FIELD_NUM+1 fields. */
|
|
|
int
|
int
|
ada_is_parent_field (struct type *type, int field_num)
|
ada_is_parent_field (struct type *type, int field_num)
|
{
|
{
|
const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
|
const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num);
|
return (name != NULL
|
return (name != NULL
|
&& (strncmp (name, "PARENT", 6) == 0
|
&& (strncmp (name, "PARENT", 6) == 0
|
|| strncmp (name, "_parent", 7) == 0));
|
|| strncmp (name, "_parent", 7) == 0));
|
}
|
}
|
|
|
/* True iff field number FIELD_NUM of structure type TYPE is a
|
/* True iff field number FIELD_NUM of structure type TYPE is a
|
transparent wrapper field (which should be silently traversed when doing
|
transparent wrapper field (which should be silently traversed when doing
|
field selection and flattened when printing). Assumes TYPE is a
|
field selection and flattened when printing). Assumes TYPE is a
|
structure type with at least FIELD_NUM+1 fields. Such fields are always
|
structure type with at least FIELD_NUM+1 fields. Such fields are always
|
structures. */
|
structures. */
|
|
|
int
|
int
|
ada_is_wrapper_field (struct type *type, int field_num)
|
ada_is_wrapper_field (struct type *type, int field_num)
|
{
|
{
|
const char *name = TYPE_FIELD_NAME (type, field_num);
|
const char *name = TYPE_FIELD_NAME (type, field_num);
|
return (name != NULL
|
return (name != NULL
|
&& (strncmp (name, "PARENT", 6) == 0
|
&& (strncmp (name, "PARENT", 6) == 0
|
|| strcmp (name, "REP") == 0
|
|| strcmp (name, "REP") == 0
|
|| strncmp (name, "_parent", 7) == 0
|
|| strncmp (name, "_parent", 7) == 0
|
|| name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
|
|| name[0] == 'S' || name[0] == 'R' || name[0] == 'O'));
|
}
|
}
|
|
|
/* True iff field number FIELD_NUM of structure or union type TYPE
|
/* True iff field number FIELD_NUM of structure or union type TYPE
|
is a variant wrapper. Assumes TYPE is a structure type with at least
|
is a variant wrapper. Assumes TYPE is a structure type with at least
|
FIELD_NUM+1 fields. */
|
FIELD_NUM+1 fields. */
|
|
|
int
|
int
|
ada_is_variant_part (struct type *type, int field_num)
|
ada_is_variant_part (struct type *type, int field_num)
|
{
|
{
|
struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
|
struct type *field_type = TYPE_FIELD_TYPE (type, field_num);
|
return (TYPE_CODE (field_type) == TYPE_CODE_UNION
|
return (TYPE_CODE (field_type) == TYPE_CODE_UNION
|
|| (is_dynamic_field (type, field_num)
|
|| (is_dynamic_field (type, field_num)
|
&& (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
|
&& (TYPE_CODE (TYPE_TARGET_TYPE (field_type))
|
== TYPE_CODE_UNION)));
|
== TYPE_CODE_UNION)));
|
}
|
}
|
|
|
/* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
|
/* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
|
whose discriminants are contained in the record type OUTER_TYPE,
|
whose discriminants are contained in the record type OUTER_TYPE,
|
returns the type of the controlling discriminant for the variant. */
|
returns the type of the controlling discriminant for the variant. */
|
|
|
struct type *
|
struct type *
|
ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
|
ada_variant_discrim_type (struct type *var_type, struct type *outer_type)
|
{
|
{
|
char *name = ada_variant_discrim_name (var_type);
|
char *name = ada_variant_discrim_name (var_type);
|
struct type *type =
|
struct type *type =
|
ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
|
ada_lookup_struct_elt_type (outer_type, name, 1, 1, NULL);
|
if (type == NULL)
|
if (type == NULL)
|
return builtin_type_int;
|
return builtin_type_int;
|
else
|
else
|
return type;
|
return type;
|
}
|
}
|
|
|
/* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
|
/* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
|
valid field number within it, returns 1 iff field FIELD_NUM of TYPE
|
valid field number within it, returns 1 iff field FIELD_NUM of TYPE
|
represents a 'when others' clause; otherwise 0. */
|
represents a 'when others' clause; otherwise 0. */
|
|
|
int
|
int
|
ada_is_others_clause (struct type *type, int field_num)
|
ada_is_others_clause (struct type *type, int field_num)
|
{
|
{
|
const char *name = TYPE_FIELD_NAME (type, field_num);
|
const char *name = TYPE_FIELD_NAME (type, field_num);
|
return (name != NULL && name[0] == 'O');
|
return (name != NULL && name[0] == 'O');
|
}
|
}
|
|
|
/* Assuming that TYPE0 is the type of the variant part of a record,
|
/* Assuming that TYPE0 is the type of the variant part of a record,
|
returns the name of the discriminant controlling the variant.
|
returns the name of the discriminant controlling the variant.
|
The value is valid until the next call to ada_variant_discrim_name. */
|
The value is valid until the next call to ada_variant_discrim_name. */
|
|
|
char *
|
char *
|
ada_variant_discrim_name (struct type *type0)
|
ada_variant_discrim_name (struct type *type0)
|
{
|
{
|
static char *result = NULL;
|
static char *result = NULL;
|
static size_t result_len = 0;
|
static size_t result_len = 0;
|
struct type *type;
|
struct type *type;
|
const char *name;
|
const char *name;
|
const char *discrim_end;
|
const char *discrim_end;
|
const char *discrim_start;
|
const char *discrim_start;
|
|
|
if (TYPE_CODE (type0) == TYPE_CODE_PTR)
|
if (TYPE_CODE (type0) == TYPE_CODE_PTR)
|
type = TYPE_TARGET_TYPE (type0);
|
type = TYPE_TARGET_TYPE (type0);
|
else
|
else
|
type = type0;
|
type = type0;
|
|
|
name = ada_type_name (type);
|
name = ada_type_name (type);
|
|
|
if (name == NULL || name[0] == '\000')
|
if (name == NULL || name[0] == '\000')
|
return "";
|
return "";
|
|
|
for (discrim_end = name + strlen (name) - 6; discrim_end != name;
|
for (discrim_end = name + strlen (name) - 6; discrim_end != name;
|
discrim_end -= 1)
|
discrim_end -= 1)
|
{
|
{
|
if (strncmp (discrim_end, "___XVN", 6) == 0)
|
if (strncmp (discrim_end, "___XVN", 6) == 0)
|
break;
|
break;
|
}
|
}
|
if (discrim_end == name)
|
if (discrim_end == name)
|
return "";
|
return "";
|
|
|
for (discrim_start = discrim_end; discrim_start != name + 3;
|
for (discrim_start = discrim_end; discrim_start != name + 3;
|
discrim_start -= 1)
|
discrim_start -= 1)
|
{
|
{
|
if (discrim_start == name + 1)
|
if (discrim_start == name + 1)
|
return "";
|
return "";
|
if ((discrim_start > name + 3
|
if ((discrim_start > name + 3
|
&& strncmp (discrim_start - 3, "___", 3) == 0)
|
&& strncmp (discrim_start - 3, "___", 3) == 0)
|
|| discrim_start[-1] == '.')
|
|| discrim_start[-1] == '.')
|
break;
|
break;
|
}
|
}
|
|
|
GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
|
GROW_VECT (result, result_len, discrim_end - discrim_start + 1);
|
strncpy (result, discrim_start, discrim_end - discrim_start);
|
strncpy (result, discrim_start, discrim_end - discrim_start);
|
result[discrim_end - discrim_start] = '\0';
|
result[discrim_end - discrim_start] = '\0';
|
return result;
|
return result;
|
}
|
}
|
|
|
/* Scan STR for a subtype-encoded number, beginning at position K.
|
/* Scan STR for a subtype-encoded number, beginning at position K.
|
Put the position of the character just past the number scanned in
|
Put the position of the character just past the number scanned in
|
*NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
|
*NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
|
Return 1 if there was a valid number at the given position, and 0
|
Return 1 if there was a valid number at the given position, and 0
|
otherwise. A "subtype-encoded" number consists of the absolute value
|
otherwise. A "subtype-encoded" number consists of the absolute value
|
in decimal, followed by the letter 'm' to indicate a negative number.
|
in decimal, followed by the letter 'm' to indicate a negative number.
|
Assumes 0m does not occur. */
|
Assumes 0m does not occur. */
|
|
|
int
|
int
|
ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
|
ada_scan_number (const char str[], int k, LONGEST * R, int *new_k)
|
{
|
{
|
ULONGEST RU;
|
ULONGEST RU;
|
|
|
if (!isdigit (str[k]))
|
if (!isdigit (str[k]))
|
return 0;
|
return 0;
|
|
|
/* Do it the hard way so as not to make any assumption about
|
/* Do it the hard way so as not to make any assumption about
|
the relationship of unsigned long (%lu scan format code) and
|
the relationship of unsigned long (%lu scan format code) and
|
LONGEST. */
|
LONGEST. */
|
RU = 0;
|
RU = 0;
|
while (isdigit (str[k]))
|
while (isdigit (str[k]))
|
{
|
{
|
RU = RU * 10 + (str[k] - '0');
|
RU = RU * 10 + (str[k] - '0');
|
k += 1;
|
k += 1;
|
}
|
}
|
|
|
if (str[k] == 'm')
|
if (str[k] == 'm')
|
{
|
{
|
if (R != NULL)
|
if (R != NULL)
|
*R = (-(LONGEST) (RU - 1)) - 1;
|
*R = (-(LONGEST) (RU - 1)) - 1;
|
k += 1;
|
k += 1;
|
}
|
}
|
else if (R != NULL)
|
else if (R != NULL)
|
*R = (LONGEST) RU;
|
*R = (LONGEST) RU;
|
|
|
/* NOTE on the above: Technically, C does not say what the results of
|
/* NOTE on the above: Technically, C does not say what the results of
|
- (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
|
- (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
|
number representable as a LONGEST (although either would probably work
|
number representable as a LONGEST (although either would probably work
|
in most implementations). When RU>0, the locution in the then branch
|
in most implementations). When RU>0, the locution in the then branch
|
above is always equivalent to the negative of RU. */
|
above is always equivalent to the negative of RU. */
|
|
|
if (new_k != NULL)
|
if (new_k != NULL)
|
*new_k = k;
|
*new_k = k;
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
|
/* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
|
and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
|
and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
|
in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
|
in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
|
|
|
int
|
int
|
ada_in_variant (LONGEST val, struct type *type, int field_num)
|
ada_in_variant (LONGEST val, struct type *type, int field_num)
|
{
|
{
|
const char *name = TYPE_FIELD_NAME (type, field_num);
|
const char *name = TYPE_FIELD_NAME (type, field_num);
|
int p;
|
int p;
|
|
|
p = 0;
|
p = 0;
|
while (1)
|
while (1)
|
{
|
{
|
switch (name[p])
|
switch (name[p])
|
{
|
{
|
case '\0':
|
case '\0':
|
return 0;
|
return 0;
|
case 'S':
|
case 'S':
|
{
|
{
|
LONGEST W;
|
LONGEST W;
|
if (!ada_scan_number (name, p + 1, &W, &p))
|
if (!ada_scan_number (name, p + 1, &W, &p))
|
return 0;
|
return 0;
|
if (val == W)
|
if (val == W)
|
return 1;
|
return 1;
|
break;
|
break;
|
}
|
}
|
case 'R':
|
case 'R':
|
{
|
{
|
LONGEST L, U;
|
LONGEST L, U;
|
if (!ada_scan_number (name, p + 1, &L, &p)
|
if (!ada_scan_number (name, p + 1, &L, &p)
|
|| name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
|
|| name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p))
|
return 0;
|
return 0;
|
if (val >= L && val <= U)
|
if (val >= L && val <= U)
|
return 1;
|
return 1;
|
break;
|
break;
|
}
|
}
|
case 'O':
|
case 'O':
|
return 1;
|
return 1;
|
default:
|
default:
|
return 0;
|
return 0;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* FIXME: Lots of redundancy below. Try to consolidate. */
|
/* FIXME: Lots of redundancy below. Try to consolidate. */
|
|
|
/* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
|
/* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
|
ARG_TYPE, extract and return the value of one of its (non-static)
|
ARG_TYPE, extract and return the value of one of its (non-static)
|
fields. FIELDNO says which field. Differs from value_primitive_field
|
fields. FIELDNO says which field. Differs from value_primitive_field
|
only in that it can handle packed values of arbitrary type. */
|
only in that it can handle packed values of arbitrary type. */
|
|
|
static struct value *
|
static struct value *
|
ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
|
ada_value_primitive_field (struct value *arg1, int offset, int fieldno,
|
struct type *arg_type)
|
struct type *arg_type)
|
{
|
{
|
struct type *type;
|
struct type *type;
|
|
|
arg_type = ada_check_typedef (arg_type);
|
arg_type = ada_check_typedef (arg_type);
|
type = TYPE_FIELD_TYPE (arg_type, fieldno);
|
type = TYPE_FIELD_TYPE (arg_type, fieldno);
|
|
|
/* Handle packed fields. */
|
/* Handle packed fields. */
|
|
|
if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
|
if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0)
|
{
|
{
|
int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
|
int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno);
|
int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
|
int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno);
|
|
|
return ada_value_primitive_packed_val (arg1, value_contents (arg1),
|
return ada_value_primitive_packed_val (arg1, value_contents (arg1),
|
offset + bit_pos / 8,
|
offset + bit_pos / 8,
|
bit_pos % 8, bit_size, type);
|
bit_pos % 8, bit_size, type);
|
}
|
}
|
else
|
else
|
return value_primitive_field (arg1, offset, fieldno, arg_type);
|
return value_primitive_field (arg1, offset, fieldno, arg_type);
|
}
|
}
|
|
|
/* Find field with name NAME in object of type TYPE. If found,
|
/* Find field with name NAME in object of type TYPE. If found,
|
set the following for each argument that is non-null:
|
set the following for each argument that is non-null:
|
- *FIELD_TYPE_P to the field's type;
|
- *FIELD_TYPE_P to the field's type;
|
- *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
|
- *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
|
an object of that type;
|
an object of that type;
|
- *BIT_OFFSET_P to the bit offset modulo byte size of the field;
|
- *BIT_OFFSET_P to the bit offset modulo byte size of the field;
|
- *BIT_SIZE_P to its size in bits if the field is packed, and
|
- *BIT_SIZE_P to its size in bits if the field is packed, and
|
0 otherwise;
|
0 otherwise;
|
If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
|
If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
|
fields up to but not including the desired field, or by the total
|
fields up to but not including the desired field, or by the total
|
number of fields if not found. A NULL value of NAME never
|
number of fields if not found. A NULL value of NAME never
|
matches; the function just counts visible fields in this case.
|
matches; the function just counts visible fields in this case.
|
|
|
Returns 1 if found, 0 otherwise. */
|
Returns 1 if found, 0 otherwise. */
|
|
|
static int
|
static int
|
find_struct_field (char *name, struct type *type, int offset,
|
find_struct_field (char *name, struct type *type, int offset,
|
struct type **field_type_p,
|
struct type **field_type_p,
|
int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
|
int *byte_offset_p, int *bit_offset_p, int *bit_size_p,
|
int *index_p)
|
int *index_p)
|
{
|
{
|
int i;
|
int i;
|
|
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
|
|
if (field_type_p != NULL)
|
if (field_type_p != NULL)
|
*field_type_p = NULL;
|
*field_type_p = NULL;
|
if (byte_offset_p != NULL)
|
if (byte_offset_p != NULL)
|
*byte_offset_p = 0;
|
*byte_offset_p = 0;
|
if (bit_offset_p != NULL)
|
if (bit_offset_p != NULL)
|
*bit_offset_p = 0;
|
*bit_offset_p = 0;
|
if (bit_size_p != NULL)
|
if (bit_size_p != NULL)
|
*bit_size_p = 0;
|
*bit_size_p = 0;
|
|
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
{
|
{
|
int bit_pos = TYPE_FIELD_BITPOS (type, i);
|
int bit_pos = TYPE_FIELD_BITPOS (type, i);
|
int fld_offset = offset + bit_pos / 8;
|
int fld_offset = offset + bit_pos / 8;
|
char *t_field_name = TYPE_FIELD_NAME (type, i);
|
char *t_field_name = TYPE_FIELD_NAME (type, i);
|
|
|
if (t_field_name == NULL)
|
if (t_field_name == NULL)
|
continue;
|
continue;
|
|
|
else if (name != NULL && field_name_match (t_field_name, name))
|
else if (name != NULL && field_name_match (t_field_name, name))
|
{
|
{
|
int bit_size = TYPE_FIELD_BITSIZE (type, i);
|
int bit_size = TYPE_FIELD_BITSIZE (type, i);
|
if (field_type_p != NULL)
|
if (field_type_p != NULL)
|
*field_type_p = TYPE_FIELD_TYPE (type, i);
|
*field_type_p = TYPE_FIELD_TYPE (type, i);
|
if (byte_offset_p != NULL)
|
if (byte_offset_p != NULL)
|
*byte_offset_p = fld_offset;
|
*byte_offset_p = fld_offset;
|
if (bit_offset_p != NULL)
|
if (bit_offset_p != NULL)
|
*bit_offset_p = bit_pos % 8;
|
*bit_offset_p = bit_pos % 8;
|
if (bit_size_p != NULL)
|
if (bit_size_p != NULL)
|
*bit_size_p = bit_size;
|
*bit_size_p = bit_size;
|
return 1;
|
return 1;
|
}
|
}
|
else if (ada_is_wrapper_field (type, i))
|
else if (ada_is_wrapper_field (type, i))
|
{
|
{
|
if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
|
if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset,
|
field_type_p, byte_offset_p, bit_offset_p,
|
field_type_p, byte_offset_p, bit_offset_p,
|
bit_size_p, index_p))
|
bit_size_p, index_p))
|
return 1;
|
return 1;
|
}
|
}
|
else if (ada_is_variant_part (type, i))
|
else if (ada_is_variant_part (type, i))
|
{
|
{
|
/* PNH: Wait. Do we ever execute this section, or is ARG always of
|
/* PNH: Wait. Do we ever execute this section, or is ARG always of
|
fixed type?? */
|
fixed type?? */
|
int j;
|
int j;
|
struct type *field_type
|
struct type *field_type
|
= ada_check_typedef (TYPE_FIELD_TYPE (type, i));
|
= ada_check_typedef (TYPE_FIELD_TYPE (type, i));
|
|
|
for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
|
for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
|
{
|
{
|
if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
|
if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j),
|
fld_offset
|
fld_offset
|
+ TYPE_FIELD_BITPOS (field_type, j) / 8,
|
+ TYPE_FIELD_BITPOS (field_type, j) / 8,
|
field_type_p, byte_offset_p,
|
field_type_p, byte_offset_p,
|
bit_offset_p, bit_size_p, index_p))
|
bit_offset_p, bit_size_p, index_p))
|
return 1;
|
return 1;
|
}
|
}
|
}
|
}
|
else if (index_p != NULL)
|
else if (index_p != NULL)
|
*index_p += 1;
|
*index_p += 1;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Number of user-visible fields in record type TYPE. */
|
/* Number of user-visible fields in record type TYPE. */
|
|
|
static int
|
static int
|
num_visible_fields (struct type *type)
|
num_visible_fields (struct type *type)
|
{
|
{
|
int n;
|
int n;
|
n = 0;
|
n = 0;
|
find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
|
find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n);
|
return n;
|
return n;
|
}
|
}
|
|
|
/* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
|
/* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
|
and search in it assuming it has (class) type TYPE.
|
and search in it assuming it has (class) type TYPE.
|
If found, return value, else return NULL.
|
If found, return value, else return NULL.
|
|
|
Searches recursively through wrapper fields (e.g., '_parent'). */
|
Searches recursively through wrapper fields (e.g., '_parent'). */
|
|
|
static struct value *
|
static struct value *
|
ada_search_struct_field (char *name, struct value *arg, int offset,
|
ada_search_struct_field (char *name, struct value *arg, int offset,
|
struct type *type)
|
struct type *type)
|
{
|
{
|
int i;
|
int i;
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
|
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
{
|
{
|
char *t_field_name = TYPE_FIELD_NAME (type, i);
|
char *t_field_name = TYPE_FIELD_NAME (type, i);
|
|
|
if (t_field_name == NULL)
|
if (t_field_name == NULL)
|
continue;
|
continue;
|
|
|
else if (field_name_match (t_field_name, name))
|
else if (field_name_match (t_field_name, name))
|
return ada_value_primitive_field (arg, offset, i, type);
|
return ada_value_primitive_field (arg, offset, i, type);
|
|
|
else if (ada_is_wrapper_field (type, i))
|
else if (ada_is_wrapper_field (type, i))
|
{
|
{
|
struct value *v = /* Do not let indent join lines here. */
|
struct value *v = /* Do not let indent join lines here. */
|
ada_search_struct_field (name, arg,
|
ada_search_struct_field (name, arg,
|
offset + TYPE_FIELD_BITPOS (type, i) / 8,
|
offset + TYPE_FIELD_BITPOS (type, i) / 8,
|
TYPE_FIELD_TYPE (type, i));
|
TYPE_FIELD_TYPE (type, i));
|
if (v != NULL)
|
if (v != NULL)
|
return v;
|
return v;
|
}
|
}
|
|
|
else if (ada_is_variant_part (type, i))
|
else if (ada_is_variant_part (type, i))
|
{
|
{
|
/* PNH: Do we ever get here? See find_struct_field. */
|
/* PNH: Do we ever get here? See find_struct_field. */
|
int j;
|
int j;
|
struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
|
struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
|
int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
|
int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8;
|
|
|
for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
|
for (j = 0; j < TYPE_NFIELDS (field_type); j += 1)
|
{
|
{
|
struct value *v = ada_search_struct_field /* Force line break. */
|
struct value *v = ada_search_struct_field /* Force line break. */
|
(name, arg,
|
(name, arg,
|
var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
|
var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8,
|
TYPE_FIELD_TYPE (field_type, j));
|
TYPE_FIELD_TYPE (field_type, j));
|
if (v != NULL)
|
if (v != NULL)
|
return v;
|
return v;
|
}
|
}
|
}
|
}
|
}
|
}
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
static struct value *ada_index_struct_field_1 (int *, struct value *,
|
static struct value *ada_index_struct_field_1 (int *, struct value *,
|
int, struct type *);
|
int, struct type *);
|
|
|
|
|
/* Return field #INDEX in ARG, where the index is that returned by
|
/* Return field #INDEX in ARG, where the index is that returned by
|
* find_struct_field through its INDEX_P argument. Adjust the address
|
* find_struct_field through its INDEX_P argument. Adjust the address
|
* of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
|
* of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
|
* If found, return value, else return NULL. */
|
* If found, return value, else return NULL. */
|
|
|
static struct value *
|
static struct value *
|
ada_index_struct_field (int index, struct value *arg, int offset,
|
ada_index_struct_field (int index, struct value *arg, int offset,
|
struct type *type)
|
struct type *type)
|
{
|
{
|
return ada_index_struct_field_1 (&index, arg, offset, type);
|
return ada_index_struct_field_1 (&index, arg, offset, type);
|
}
|
}
|
|
|
|
|
/* Auxiliary function for ada_index_struct_field. Like
|
/* Auxiliary function for ada_index_struct_field. Like
|
* ada_index_struct_field, but takes index from *INDEX_P and modifies
|
* ada_index_struct_field, but takes index from *INDEX_P and modifies
|
* *INDEX_P. */
|
* *INDEX_P. */
|
|
|
static struct value *
|
static struct value *
|
ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
|
ada_index_struct_field_1 (int *index_p, struct value *arg, int offset,
|
struct type *type)
|
struct type *type)
|
{
|
{
|
int i;
|
int i;
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
|
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
{
|
{
|
if (TYPE_FIELD_NAME (type, i) == NULL)
|
if (TYPE_FIELD_NAME (type, i) == NULL)
|
continue;
|
continue;
|
else if (ada_is_wrapper_field (type, i))
|
else if (ada_is_wrapper_field (type, i))
|
{
|
{
|
struct value *v = /* Do not let indent join lines here. */
|
struct value *v = /* Do not let indent join lines here. */
|
ada_index_struct_field_1 (index_p, arg,
|
ada_index_struct_field_1 (index_p, arg,
|
offset + TYPE_FIELD_BITPOS (type, i) / 8,
|
offset + TYPE_FIELD_BITPOS (type, i) / 8,
|
TYPE_FIELD_TYPE (type, i));
|
TYPE_FIELD_TYPE (type, i));
|
if (v != NULL)
|
if (v != NULL)
|
return v;
|
return v;
|
}
|
}
|
|
|
else if (ada_is_variant_part (type, i))
|
else if (ada_is_variant_part (type, i))
|
{
|
{
|
/* PNH: Do we ever get here? See ada_search_struct_field,
|
/* PNH: Do we ever get here? See ada_search_struct_field,
|
find_struct_field. */
|
find_struct_field. */
|
error (_("Cannot assign this kind of variant record"));
|
error (_("Cannot assign this kind of variant record"));
|
}
|
}
|
else if (*index_p == 0)
|
else if (*index_p == 0)
|
return ada_value_primitive_field (arg, offset, i, type);
|
return ada_value_primitive_field (arg, offset, i, type);
|
else
|
else
|
*index_p -= 1;
|
*index_p -= 1;
|
}
|
}
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* Given ARG, a value of type (pointer or reference to a)*
|
/* Given ARG, a value of type (pointer or reference to a)*
|
structure/union, extract the component named NAME from the ultimate
|
structure/union, extract the component named NAME from the ultimate
|
target structure/union and return it as a value with its
|
target structure/union and return it as a value with its
|
appropriate type. If ARG is a pointer or reference and the field
|
appropriate type. If ARG is a pointer or reference and the field
|
is not packed, returns a reference to the field, otherwise the
|
is not packed, returns a reference to the field, otherwise the
|
value of the field (an lvalue if ARG is an lvalue).
|
value of the field (an lvalue if ARG is an lvalue).
|
|
|
The routine searches for NAME among all members of the structure itself
|
The routine searches for NAME among all members of the structure itself
|
and (recursively) among all members of any wrapper members
|
and (recursively) among all members of any wrapper members
|
(e.g., '_parent').
|
(e.g., '_parent').
|
|
|
If NO_ERR, then simply return NULL in case of error, rather than
|
If NO_ERR, then simply return NULL in case of error, rather than
|
calling error. */
|
calling error. */
|
|
|
struct value *
|
struct value *
|
ada_value_struct_elt (struct value *arg, char *name, int no_err)
|
ada_value_struct_elt (struct value *arg, char *name, int no_err)
|
{
|
{
|
struct type *t, *t1;
|
struct type *t, *t1;
|
struct value *v;
|
struct value *v;
|
|
|
v = NULL;
|
v = NULL;
|
t1 = t = ada_check_typedef (value_type (arg));
|
t1 = t = ada_check_typedef (value_type (arg));
|
if (TYPE_CODE (t) == TYPE_CODE_REF)
|
if (TYPE_CODE (t) == TYPE_CODE_REF)
|
{
|
{
|
t1 = TYPE_TARGET_TYPE (t);
|
t1 = TYPE_TARGET_TYPE (t);
|
if (t1 == NULL)
|
if (t1 == NULL)
|
goto BadValue;
|
goto BadValue;
|
t1 = ada_check_typedef (t1);
|
t1 = ada_check_typedef (t1);
|
if (TYPE_CODE (t1) == TYPE_CODE_PTR)
|
if (TYPE_CODE (t1) == TYPE_CODE_PTR)
|
{
|
{
|
arg = coerce_ref (arg);
|
arg = coerce_ref (arg);
|
t = t1;
|
t = t1;
|
}
|
}
|
}
|
}
|
|
|
while (TYPE_CODE (t) == TYPE_CODE_PTR)
|
while (TYPE_CODE (t) == TYPE_CODE_PTR)
|
{
|
{
|
t1 = TYPE_TARGET_TYPE (t);
|
t1 = TYPE_TARGET_TYPE (t);
|
if (t1 == NULL)
|
if (t1 == NULL)
|
goto BadValue;
|
goto BadValue;
|
t1 = ada_check_typedef (t1);
|
t1 = ada_check_typedef (t1);
|
if (TYPE_CODE (t1) == TYPE_CODE_PTR)
|
if (TYPE_CODE (t1) == TYPE_CODE_PTR)
|
{
|
{
|
arg = value_ind (arg);
|
arg = value_ind (arg);
|
t = t1;
|
t = t1;
|
}
|
}
|
else
|
else
|
break;
|
break;
|
}
|
}
|
|
|
if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
|
if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION)
|
goto BadValue;
|
goto BadValue;
|
|
|
if (t1 == t)
|
if (t1 == t)
|
v = ada_search_struct_field (name, arg, 0, t);
|
v = ada_search_struct_field (name, arg, 0, t);
|
else
|
else
|
{
|
{
|
int bit_offset, bit_size, byte_offset;
|
int bit_offset, bit_size, byte_offset;
|
struct type *field_type;
|
struct type *field_type;
|
CORE_ADDR address;
|
CORE_ADDR address;
|
|
|
if (TYPE_CODE (t) == TYPE_CODE_PTR)
|
if (TYPE_CODE (t) == TYPE_CODE_PTR)
|
address = value_as_address (arg);
|
address = value_as_address (arg);
|
else
|
else
|
address = unpack_pointer (t, value_contents (arg));
|
address = unpack_pointer (t, value_contents (arg));
|
|
|
t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
|
t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, address, NULL, 1);
|
if (find_struct_field (name, t1, 0,
|
if (find_struct_field (name, t1, 0,
|
&field_type, &byte_offset, &bit_offset,
|
&field_type, &byte_offset, &bit_offset,
|
&bit_size, NULL))
|
&bit_size, NULL))
|
{
|
{
|
if (bit_size != 0)
|
if (bit_size != 0)
|
{
|
{
|
if (TYPE_CODE (t) == TYPE_CODE_REF)
|
if (TYPE_CODE (t) == TYPE_CODE_REF)
|
arg = ada_coerce_ref (arg);
|
arg = ada_coerce_ref (arg);
|
else
|
else
|
arg = ada_value_ind (arg);
|
arg = ada_value_ind (arg);
|
v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
|
v = ada_value_primitive_packed_val (arg, NULL, byte_offset,
|
bit_offset, bit_size,
|
bit_offset, bit_size,
|
field_type);
|
field_type);
|
}
|
}
|
else
|
else
|
v = value_from_pointer (lookup_reference_type (field_type),
|
v = value_from_pointer (lookup_reference_type (field_type),
|
address + byte_offset);
|
address + byte_offset);
|
}
|
}
|
}
|
}
|
|
|
if (v != NULL || no_err)
|
if (v != NULL || no_err)
|
return v;
|
return v;
|
else
|
else
|
error (_("There is no member named %s."), name);
|
error (_("There is no member named %s."), name);
|
|
|
BadValue:
|
BadValue:
|
if (no_err)
|
if (no_err)
|
return NULL;
|
return NULL;
|
else
|
else
|
error (_("Attempt to extract a component of a value that is not a record."));
|
error (_("Attempt to extract a component of a value that is not a record."));
|
}
|
}
|
|
|
/* Given a type TYPE, look up the type of the component of type named NAME.
|
/* Given a type TYPE, look up the type of the component of type named NAME.
|
If DISPP is non-null, add its byte displacement from the beginning of a
|
If DISPP is non-null, add its byte displacement from the beginning of a
|
structure (pointed to by a value) of type TYPE to *DISPP (does not
|
structure (pointed to by a value) of type TYPE to *DISPP (does not
|
work for packed fields).
|
work for packed fields).
|
|
|
Matches any field whose name has NAME as a prefix, possibly
|
Matches any field whose name has NAME as a prefix, possibly
|
followed by "___".
|
followed by "___".
|
|
|
TYPE can be either a struct or union. If REFOK, TYPE may also
|
TYPE can be either a struct or union. If REFOK, TYPE may also
|
be a (pointer or reference)+ to a struct or union, and the
|
be a (pointer or reference)+ to a struct or union, and the
|
ultimate target type will be searched.
|
ultimate target type will be searched.
|
|
|
Looks recursively into variant clauses and parent types.
|
Looks recursively into variant clauses and parent types.
|
|
|
If NOERR is nonzero, return NULL if NAME is not suitably defined or
|
If NOERR is nonzero, return NULL if NAME is not suitably defined or
|
TYPE is not a type of the right kind. */
|
TYPE is not a type of the right kind. */
|
|
|
static struct type *
|
static struct type *
|
ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
|
ada_lookup_struct_elt_type (struct type *type, char *name, int refok,
|
int noerr, int *dispp)
|
int noerr, int *dispp)
|
{
|
{
|
int i;
|
int i;
|
|
|
if (name == NULL)
|
if (name == NULL)
|
goto BadName;
|
goto BadName;
|
|
|
if (refok && type != NULL)
|
if (refok && type != NULL)
|
while (1)
|
while (1)
|
{
|
{
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
if (TYPE_CODE (type) != TYPE_CODE_PTR
|
if (TYPE_CODE (type) != TYPE_CODE_PTR
|
&& TYPE_CODE (type) != TYPE_CODE_REF)
|
&& TYPE_CODE (type) != TYPE_CODE_REF)
|
break;
|
break;
|
type = TYPE_TARGET_TYPE (type);
|
type = TYPE_TARGET_TYPE (type);
|
}
|
}
|
|
|
if (type == NULL
|
if (type == NULL
|
|| (TYPE_CODE (type) != TYPE_CODE_STRUCT
|
|| (TYPE_CODE (type) != TYPE_CODE_STRUCT
|
&& TYPE_CODE (type) != TYPE_CODE_UNION))
|
&& TYPE_CODE (type) != TYPE_CODE_UNION))
|
{
|
{
|
if (noerr)
|
if (noerr)
|
return NULL;
|
return NULL;
|
else
|
else
|
{
|
{
|
target_terminal_ours ();
|
target_terminal_ours ();
|
gdb_flush (gdb_stdout);
|
gdb_flush (gdb_stdout);
|
if (type == NULL)
|
if (type == NULL)
|
error (_("Type (null) is not a structure or union type"));
|
error (_("Type (null) is not a structure or union type"));
|
else
|
else
|
{
|
{
|
/* XXX: type_sprint */
|
/* XXX: type_sprint */
|
fprintf_unfiltered (gdb_stderr, _("Type "));
|
fprintf_unfiltered (gdb_stderr, _("Type "));
|
type_print (type, "", gdb_stderr, -1);
|
type_print (type, "", gdb_stderr, -1);
|
error (_(" is not a structure or union type"));
|
error (_(" is not a structure or union type"));
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
type = to_static_fixed_type (type);
|
type = to_static_fixed_type (type);
|
|
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
{
|
{
|
char *t_field_name = TYPE_FIELD_NAME (type, i);
|
char *t_field_name = TYPE_FIELD_NAME (type, i);
|
struct type *t;
|
struct type *t;
|
int disp;
|
int disp;
|
|
|
if (t_field_name == NULL)
|
if (t_field_name == NULL)
|
continue;
|
continue;
|
|
|
else if (field_name_match (t_field_name, name))
|
else if (field_name_match (t_field_name, name))
|
{
|
{
|
if (dispp != NULL)
|
if (dispp != NULL)
|
*dispp += TYPE_FIELD_BITPOS (type, i) / 8;
|
*dispp += TYPE_FIELD_BITPOS (type, i) / 8;
|
return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
|
return ada_check_typedef (TYPE_FIELD_TYPE (type, i));
|
}
|
}
|
|
|
else if (ada_is_wrapper_field (type, i))
|
else if (ada_is_wrapper_field (type, i))
|
{
|
{
|
disp = 0;
|
disp = 0;
|
t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
|
t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name,
|
0, 1, &disp);
|
0, 1, &disp);
|
if (t != NULL)
|
if (t != NULL)
|
{
|
{
|
if (dispp != NULL)
|
if (dispp != NULL)
|
*dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
|
*dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
|
return t;
|
return t;
|
}
|
}
|
}
|
}
|
|
|
else if (ada_is_variant_part (type, i))
|
else if (ada_is_variant_part (type, i))
|
{
|
{
|
int j;
|
int j;
|
struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
|
struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, i));
|
|
|
for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
|
for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1)
|
{
|
{
|
disp = 0;
|
disp = 0;
|
t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, j),
|
t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, j),
|
name, 0, 1, &disp);
|
name, 0, 1, &disp);
|
if (t != NULL)
|
if (t != NULL)
|
{
|
{
|
if (dispp != NULL)
|
if (dispp != NULL)
|
*dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
|
*dispp += disp + TYPE_FIELD_BITPOS (type, i) / 8;
|
return t;
|
return t;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
}
|
}
|
|
|
BadName:
|
BadName:
|
if (!noerr)
|
if (!noerr)
|
{
|
{
|
target_terminal_ours ();
|
target_terminal_ours ();
|
gdb_flush (gdb_stdout);
|
gdb_flush (gdb_stdout);
|
if (name == NULL)
|
if (name == NULL)
|
{
|
{
|
/* XXX: type_sprint */
|
/* XXX: type_sprint */
|
fprintf_unfiltered (gdb_stderr, _("Type "));
|
fprintf_unfiltered (gdb_stderr, _("Type "));
|
type_print (type, "", gdb_stderr, -1);
|
type_print (type, "", gdb_stderr, -1);
|
error (_(" has no component named <null>"));
|
error (_(" has no component named <null>"));
|
}
|
}
|
else
|
else
|
{
|
{
|
/* XXX: type_sprint */
|
/* XXX: type_sprint */
|
fprintf_unfiltered (gdb_stderr, _("Type "));
|
fprintf_unfiltered (gdb_stderr, _("Type "));
|
type_print (type, "", gdb_stderr, -1);
|
type_print (type, "", gdb_stderr, -1);
|
error (_(" has no component named %s"), name);
|
error (_(" has no component named %s"), name);
|
}
|
}
|
}
|
}
|
|
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
|
/* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
|
within a value of type OUTER_TYPE that is stored in GDB at
|
within a value of type OUTER_TYPE that is stored in GDB at
|
OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
|
OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
|
numbering from 0) is applicable. Returns -1 if none are. */
|
numbering from 0) is applicable. Returns -1 if none are. */
|
|
|
int
|
int
|
ada_which_variant_applies (struct type *var_type, struct type *outer_type,
|
ada_which_variant_applies (struct type *var_type, struct type *outer_type,
|
const gdb_byte *outer_valaddr)
|
const gdb_byte *outer_valaddr)
|
{
|
{
|
int others_clause;
|
int others_clause;
|
int i;
|
int i;
|
char *discrim_name = ada_variant_discrim_name (var_type);
|
char *discrim_name = ada_variant_discrim_name (var_type);
|
struct value *outer;
|
struct value *outer;
|
struct value *discrim;
|
struct value *discrim;
|
LONGEST discrim_val;
|
LONGEST discrim_val;
|
|
|
outer = value_from_contents_and_address (outer_type, outer_valaddr, 0);
|
outer = value_from_contents_and_address (outer_type, outer_valaddr, 0);
|
discrim = ada_value_struct_elt (outer, discrim_name, 1);
|
discrim = ada_value_struct_elt (outer, discrim_name, 1);
|
if (discrim == NULL)
|
if (discrim == NULL)
|
return -1;
|
return -1;
|
discrim_val = value_as_long (discrim);
|
discrim_val = value_as_long (discrim);
|
|
|
others_clause = -1;
|
others_clause = -1;
|
for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
|
for (i = 0; i < TYPE_NFIELDS (var_type); i += 1)
|
{
|
{
|
if (ada_is_others_clause (var_type, i))
|
if (ada_is_others_clause (var_type, i))
|
others_clause = i;
|
others_clause = i;
|
else if (ada_in_variant (discrim_val, var_type, i))
|
else if (ada_in_variant (discrim_val, var_type, i))
|
return i;
|
return i;
|
}
|
}
|
|
|
return others_clause;
|
return others_clause;
|
}
|
}
|
|
|
|
|
|
|
/* Dynamic-Sized Records */
|
/* Dynamic-Sized Records */
|
|
|
/* Strategy: The type ostensibly attached to a value with dynamic size
|
/* Strategy: The type ostensibly attached to a value with dynamic size
|
(i.e., a size that is not statically recorded in the debugging
|
(i.e., a size that is not statically recorded in the debugging
|
data) does not accurately reflect the size or layout of the value.
|
data) does not accurately reflect the size or layout of the value.
|
Our strategy is to convert these values to values with accurate,
|
Our strategy is to convert these values to values with accurate,
|
conventional types that are constructed on the fly. */
|
conventional types that are constructed on the fly. */
|
|
|
/* There is a subtle and tricky problem here. In general, we cannot
|
/* There is a subtle and tricky problem here. In general, we cannot
|
determine the size of dynamic records without its data. However,
|
determine the size of dynamic records without its data. However,
|
the 'struct value' data structure, which GDB uses to represent
|
the 'struct value' data structure, which GDB uses to represent
|
quantities in the inferior process (the target), requires the size
|
quantities in the inferior process (the target), requires the size
|
of the type at the time of its allocation in order to reserve space
|
of the type at the time of its allocation in order to reserve space
|
for GDB's internal copy of the data. That's why the
|
for GDB's internal copy of the data. That's why the
|
'to_fixed_xxx_type' routines take (target) addresses as parameters,
|
'to_fixed_xxx_type' routines take (target) addresses as parameters,
|
rather than struct value*s.
|
rather than struct value*s.
|
|
|
However, GDB's internal history variables ($1, $2, etc.) are
|
However, GDB's internal history variables ($1, $2, etc.) are
|
struct value*s containing internal copies of the data that are not, in
|
struct value*s containing internal copies of the data that are not, in
|
general, the same as the data at their corresponding addresses in
|
general, the same as the data at their corresponding addresses in
|
the target. Fortunately, the types we give to these values are all
|
the target. Fortunately, the types we give to these values are all
|
conventional, fixed-size types (as per the strategy described
|
conventional, fixed-size types (as per the strategy described
|
above), so that we don't usually have to perform the
|
above), so that we don't usually have to perform the
|
'to_fixed_xxx_type' conversions to look at their values.
|
'to_fixed_xxx_type' conversions to look at their values.
|
Unfortunately, there is one exception: if one of the internal
|
Unfortunately, there is one exception: if one of the internal
|
history variables is an array whose elements are unconstrained
|
history variables is an array whose elements are unconstrained
|
records, then we will need to create distinct fixed types for each
|
records, then we will need to create distinct fixed types for each
|
element selected. */
|
element selected. */
|
|
|
/* The upshot of all of this is that many routines take a (type, host
|
/* The upshot of all of this is that many routines take a (type, host
|
address, target address) triple as arguments to represent a value.
|
address, target address) triple as arguments to represent a value.
|
The host address, if non-null, is supposed to contain an internal
|
The host address, if non-null, is supposed to contain an internal
|
copy of the relevant data; otherwise, the program is to consult the
|
copy of the relevant data; otherwise, the program is to consult the
|
target at the target address. */
|
target at the target address. */
|
|
|
/* Assuming that VAL0 represents a pointer value, the result of
|
/* Assuming that VAL0 represents a pointer value, the result of
|
dereferencing it. Differs from value_ind in its treatment of
|
dereferencing it. Differs from value_ind in its treatment of
|
dynamic-sized types. */
|
dynamic-sized types. */
|
|
|
struct value *
|
struct value *
|
ada_value_ind (struct value *val0)
|
ada_value_ind (struct value *val0)
|
{
|
{
|
struct value *val = unwrap_value (value_ind (val0));
|
struct value *val = unwrap_value (value_ind (val0));
|
return ada_to_fixed_value (val);
|
return ada_to_fixed_value (val);
|
}
|
}
|
|
|
/* The value resulting from dereferencing any "reference to"
|
/* The value resulting from dereferencing any "reference to"
|
qualifiers on VAL0. */
|
qualifiers on VAL0. */
|
|
|
static struct value *
|
static struct value *
|
ada_coerce_ref (struct value *val0)
|
ada_coerce_ref (struct value *val0)
|
{
|
{
|
if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
|
if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF)
|
{
|
{
|
struct value *val = val0;
|
struct value *val = val0;
|
val = coerce_ref (val);
|
val = coerce_ref (val);
|
val = unwrap_value (val);
|
val = unwrap_value (val);
|
return ada_to_fixed_value (val);
|
return ada_to_fixed_value (val);
|
}
|
}
|
else
|
else
|
return val0;
|
return val0;
|
}
|
}
|
|
|
/* Return OFF rounded upward if necessary to a multiple of
|
/* Return OFF rounded upward if necessary to a multiple of
|
ALIGNMENT (a power of 2). */
|
ALIGNMENT (a power of 2). */
|
|
|
static unsigned int
|
static unsigned int
|
align_value (unsigned int off, unsigned int alignment)
|
align_value (unsigned int off, unsigned int alignment)
|
{
|
{
|
return (off + alignment - 1) & ~(alignment - 1);
|
return (off + alignment - 1) & ~(alignment - 1);
|
}
|
}
|
|
|
/* Return the bit alignment required for field #F of template type TYPE. */
|
/* Return the bit alignment required for field #F of template type TYPE. */
|
|
|
static unsigned int
|
static unsigned int
|
field_alignment (struct type *type, int f)
|
field_alignment (struct type *type, int f)
|
{
|
{
|
const char *name = TYPE_FIELD_NAME (type, f);
|
const char *name = TYPE_FIELD_NAME (type, f);
|
int len;
|
int len;
|
int align_offset;
|
int align_offset;
|
|
|
/* The field name should never be null, unless the debugging information
|
/* The field name should never be null, unless the debugging information
|
is somehow malformed. In this case, we assume the field does not
|
is somehow malformed. In this case, we assume the field does not
|
require any alignment. */
|
require any alignment. */
|
if (name == NULL)
|
if (name == NULL)
|
return 1;
|
return 1;
|
|
|
len = strlen (name);
|
len = strlen (name);
|
|
|
if (!isdigit (name[len - 1]))
|
if (!isdigit (name[len - 1]))
|
return 1;
|
return 1;
|
|
|
if (isdigit (name[len - 2]))
|
if (isdigit (name[len - 2]))
|
align_offset = len - 2;
|
align_offset = len - 2;
|
else
|
else
|
align_offset = len - 1;
|
align_offset = len - 1;
|
|
|
if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
|
if (align_offset < 7 || strncmp ("___XV", name + align_offset - 6, 5) != 0)
|
return TARGET_CHAR_BIT;
|
return TARGET_CHAR_BIT;
|
|
|
return atoi (name + align_offset) * TARGET_CHAR_BIT;
|
return atoi (name + align_offset) * TARGET_CHAR_BIT;
|
}
|
}
|
|
|
/* Find a symbol named NAME. Ignores ambiguity. */
|
/* Find a symbol named NAME. Ignores ambiguity. */
|
|
|
struct symbol *
|
struct symbol *
|
ada_find_any_symbol (const char *name)
|
ada_find_any_symbol (const char *name)
|
{
|
{
|
struct symbol *sym;
|
struct symbol *sym;
|
|
|
sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
|
sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN);
|
if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
|
if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
|
return sym;
|
return sym;
|
|
|
sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
|
sym = standard_lookup (name, NULL, STRUCT_DOMAIN);
|
return sym;
|
return sym;
|
}
|
}
|
|
|
/* Find a type named NAME. Ignores ambiguity. */
|
/* Find a type named NAME. Ignores ambiguity. */
|
|
|
struct type *
|
struct type *
|
ada_find_any_type (const char *name)
|
ada_find_any_type (const char *name)
|
{
|
{
|
struct symbol *sym = ada_find_any_symbol (name);
|
struct symbol *sym = ada_find_any_symbol (name);
|
|
|
if (sym != NULL)
|
if (sym != NULL)
|
return SYMBOL_TYPE (sym);
|
return SYMBOL_TYPE (sym);
|
|
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* Given NAME and an associated BLOCK, search all symbols for
|
/* Given NAME and an associated BLOCK, search all symbols for
|
NAME suffixed with "___XR", which is the ``renaming'' symbol
|
NAME suffixed with "___XR", which is the ``renaming'' symbol
|
associated to NAME. Return this symbol if found, return
|
associated to NAME. Return this symbol if found, return
|
NULL otherwise. */
|
NULL otherwise. */
|
|
|
struct symbol *
|
struct symbol *
|
ada_find_renaming_symbol (const char *name, struct block *block)
|
ada_find_renaming_symbol (const char *name, struct block *block)
|
{
|
{
|
struct symbol *sym;
|
struct symbol *sym;
|
|
|
sym = find_old_style_renaming_symbol (name, block);
|
sym = find_old_style_renaming_symbol (name, block);
|
|
|
if (sym != NULL)
|
if (sym != NULL)
|
return sym;
|
return sym;
|
|
|
/* Not right yet. FIXME pnh 7/20/2007. */
|
/* Not right yet. FIXME pnh 7/20/2007. */
|
sym = ada_find_any_symbol (name);
|
sym = ada_find_any_symbol (name);
|
if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
|
if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL)
|
return sym;
|
return sym;
|
else
|
else
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
static struct symbol *
|
static struct symbol *
|
find_old_style_renaming_symbol (const char *name, struct block *block)
|
find_old_style_renaming_symbol (const char *name, struct block *block)
|
{
|
{
|
const struct symbol *function_sym = block_function (block);
|
const struct symbol *function_sym = block_function (block);
|
char *rename;
|
char *rename;
|
|
|
if (function_sym != NULL)
|
if (function_sym != NULL)
|
{
|
{
|
/* If the symbol is defined inside a function, NAME is not fully
|
/* If the symbol is defined inside a function, NAME is not fully
|
qualified. This means we need to prepend the function name
|
qualified. This means we need to prepend the function name
|
as well as adding the ``___XR'' suffix to build the name of
|
as well as adding the ``___XR'' suffix to build the name of
|
the associated renaming symbol. */
|
the associated renaming symbol. */
|
char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
|
char *function_name = SYMBOL_LINKAGE_NAME (function_sym);
|
/* Function names sometimes contain suffixes used
|
/* Function names sometimes contain suffixes used
|
for instance to qualify nested subprograms. When building
|
for instance to qualify nested subprograms. When building
|
the XR type name, we need to make sure that this suffix is
|
the XR type name, we need to make sure that this suffix is
|
not included. So do not include any suffix in the function
|
not included. So do not include any suffix in the function
|
name length below. */
|
name length below. */
|
const int function_name_len = ada_name_prefix_len (function_name);
|
const int function_name_len = ada_name_prefix_len (function_name);
|
const int rename_len = function_name_len + 2 /* "__" */
|
const int rename_len = function_name_len + 2 /* "__" */
|
+ strlen (name) + 6 /* "___XR\0" */ ;
|
+ strlen (name) + 6 /* "___XR\0" */ ;
|
|
|
/* Strip the suffix if necessary. */
|
/* Strip the suffix if necessary. */
|
function_name[function_name_len] = '\0';
|
function_name[function_name_len] = '\0';
|
|
|
/* Library-level functions are a special case, as GNAT adds
|
/* Library-level functions are a special case, as GNAT adds
|
a ``_ada_'' prefix to the function name to avoid namespace
|
a ``_ada_'' prefix to the function name to avoid namespace
|
pollution. However, the renaming symbols themselves do not
|
pollution. However, the renaming symbols themselves do not
|
have this prefix, so we need to skip this prefix if present. */
|
have this prefix, so we need to skip this prefix if present. */
|
if (function_name_len > 5 /* "_ada_" */
|
if (function_name_len > 5 /* "_ada_" */
|
&& strstr (function_name, "_ada_") == function_name)
|
&& strstr (function_name, "_ada_") == function_name)
|
function_name = function_name + 5;
|
function_name = function_name + 5;
|
|
|
rename = (char *) alloca (rename_len * sizeof (char));
|
rename = (char *) alloca (rename_len * sizeof (char));
|
sprintf (rename, "%s__%s___XR", function_name, name);
|
sprintf (rename, "%s__%s___XR", function_name, name);
|
}
|
}
|
else
|
else
|
{
|
{
|
const int rename_len = strlen (name) + 6;
|
const int rename_len = strlen (name) + 6;
|
rename = (char *) alloca (rename_len * sizeof (char));
|
rename = (char *) alloca (rename_len * sizeof (char));
|
sprintf (rename, "%s___XR", name);
|
sprintf (rename, "%s___XR", name);
|
}
|
}
|
|
|
return ada_find_any_symbol (rename);
|
return ada_find_any_symbol (rename);
|
}
|
}
|
|
|
/* Because of GNAT encoding conventions, several GDB symbols may match a
|
/* Because of GNAT encoding conventions, several GDB symbols may match a
|
given type name. If the type denoted by TYPE0 is to be preferred to
|
given type name. If the type denoted by TYPE0 is to be preferred to
|
that of TYPE1 for purposes of type printing, return non-zero;
|
that of TYPE1 for purposes of type printing, return non-zero;
|
otherwise return 0. */
|
otherwise return 0. */
|
|
|
int
|
int
|
ada_prefer_type (struct type *type0, struct type *type1)
|
ada_prefer_type (struct type *type0, struct type *type1)
|
{
|
{
|
if (type1 == NULL)
|
if (type1 == NULL)
|
return 1;
|
return 1;
|
else if (type0 == NULL)
|
else if (type0 == NULL)
|
return 0;
|
return 0;
|
else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
|
else if (TYPE_CODE (type1) == TYPE_CODE_VOID)
|
return 1;
|
return 1;
|
else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
|
else if (TYPE_CODE (type0) == TYPE_CODE_VOID)
|
return 0;
|
return 0;
|
else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
|
else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL)
|
return 1;
|
return 1;
|
else if (ada_is_packed_array_type (type0))
|
else if (ada_is_packed_array_type (type0))
|
return 1;
|
return 1;
|
else if (ada_is_array_descriptor_type (type0)
|
else if (ada_is_array_descriptor_type (type0)
|
&& !ada_is_array_descriptor_type (type1))
|
&& !ada_is_array_descriptor_type (type1))
|
return 1;
|
return 1;
|
else
|
else
|
{
|
{
|
const char *type0_name = type_name_no_tag (type0);
|
const char *type0_name = type_name_no_tag (type0);
|
const char *type1_name = type_name_no_tag (type1);
|
const char *type1_name = type_name_no_tag (type1);
|
|
|
if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
|
if (type0_name != NULL && strstr (type0_name, "___XR") != NULL
|
&& (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
|
&& (type1_name == NULL || strstr (type1_name, "___XR") == NULL))
|
return 1;
|
return 1;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* The name of TYPE, which is either its TYPE_NAME, or, if that is
|
/* The name of TYPE, which is either its TYPE_NAME, or, if that is
|
null, its TYPE_TAG_NAME. Null if TYPE is null. */
|
null, its TYPE_TAG_NAME. Null if TYPE is null. */
|
|
|
char *
|
char *
|
ada_type_name (struct type *type)
|
ada_type_name (struct type *type)
|
{
|
{
|
if (type == NULL)
|
if (type == NULL)
|
return NULL;
|
return NULL;
|
else if (TYPE_NAME (type) != NULL)
|
else if (TYPE_NAME (type) != NULL)
|
return TYPE_NAME (type);
|
return TYPE_NAME (type);
|
else
|
else
|
return TYPE_TAG_NAME (type);
|
return TYPE_TAG_NAME (type);
|
}
|
}
|
|
|
/* Find a parallel type to TYPE whose name is formed by appending
|
/* Find a parallel type to TYPE whose name is formed by appending
|
SUFFIX to the name of TYPE. */
|
SUFFIX to the name of TYPE. */
|
|
|
struct type *
|
struct type *
|
ada_find_parallel_type (struct type *type, const char *suffix)
|
ada_find_parallel_type (struct type *type, const char *suffix)
|
{
|
{
|
static char *name;
|
static char *name;
|
static size_t name_len = 0;
|
static size_t name_len = 0;
|
int len;
|
int len;
|
char *typename = ada_type_name (type);
|
char *typename = ada_type_name (type);
|
|
|
if (typename == NULL)
|
if (typename == NULL)
|
return NULL;
|
return NULL;
|
|
|
len = strlen (typename);
|
len = strlen (typename);
|
|
|
GROW_VECT (name, name_len, len + strlen (suffix) + 1);
|
GROW_VECT (name, name_len, len + strlen (suffix) + 1);
|
|
|
strcpy (name, typename);
|
strcpy (name, typename);
|
strcpy (name + len, suffix);
|
strcpy (name + len, suffix);
|
|
|
return ada_find_any_type (name);
|
return ada_find_any_type (name);
|
}
|
}
|
|
|
|
|
/* If TYPE is a variable-size record type, return the corresponding template
|
/* If TYPE is a variable-size record type, return the corresponding template
|
type describing its fields. Otherwise, return NULL. */
|
type describing its fields. Otherwise, return NULL. */
|
|
|
static struct type *
|
static struct type *
|
dynamic_template_type (struct type *type)
|
dynamic_template_type (struct type *type)
|
{
|
{
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
|
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT
|
|| ada_type_name (type) == NULL)
|
|| ada_type_name (type) == NULL)
|
return NULL;
|
return NULL;
|
else
|
else
|
{
|
{
|
int len = strlen (ada_type_name (type));
|
int len = strlen (ada_type_name (type));
|
if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
|
if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0)
|
return type;
|
return type;
|
else
|
else
|
return ada_find_parallel_type (type, "___XVE");
|
return ada_find_parallel_type (type, "___XVE");
|
}
|
}
|
}
|
}
|
|
|
/* Assuming that TEMPL_TYPE is a union or struct type, returns
|
/* Assuming that TEMPL_TYPE is a union or struct type, returns
|
non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
|
non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
|
|
|
static int
|
static int
|
is_dynamic_field (struct type *templ_type, int field_num)
|
is_dynamic_field (struct type *templ_type, int field_num)
|
{
|
{
|
const char *name = TYPE_FIELD_NAME (templ_type, field_num);
|
const char *name = TYPE_FIELD_NAME (templ_type, field_num);
|
return name != NULL
|
return name != NULL
|
&& TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
|
&& TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR
|
&& strstr (name, "___XVL") != NULL;
|
&& strstr (name, "___XVL") != NULL;
|
}
|
}
|
|
|
/* The index of the variant field of TYPE, or -1 if TYPE does not
|
/* The index of the variant field of TYPE, or -1 if TYPE does not
|
represent a variant record type. */
|
represent a variant record type. */
|
|
|
static int
|
static int
|
variant_field_index (struct type *type)
|
variant_field_index (struct type *type)
|
{
|
{
|
int f;
|
int f;
|
|
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT)
|
return -1;
|
return -1;
|
|
|
for (f = 0; f < TYPE_NFIELDS (type); f += 1)
|
for (f = 0; f < TYPE_NFIELDS (type); f += 1)
|
{
|
{
|
if (ada_is_variant_part (type, f))
|
if (ada_is_variant_part (type, f))
|
return f;
|
return f;
|
}
|
}
|
return -1;
|
return -1;
|
}
|
}
|
|
|
/* A record type with no fields. */
|
/* A record type with no fields. */
|
|
|
static struct type *
|
static struct type *
|
empty_record (struct objfile *objfile)
|
empty_record (struct objfile *objfile)
|
{
|
{
|
struct type *type = alloc_type (objfile);
|
struct type *type = alloc_type (objfile);
|
TYPE_CODE (type) = TYPE_CODE_STRUCT;
|
TYPE_CODE (type) = TYPE_CODE_STRUCT;
|
TYPE_NFIELDS (type) = 0;
|
TYPE_NFIELDS (type) = 0;
|
TYPE_FIELDS (type) = NULL;
|
TYPE_FIELDS (type) = NULL;
|
TYPE_NAME (type) = "<empty>";
|
TYPE_NAME (type) = "<empty>";
|
TYPE_TAG_NAME (type) = NULL;
|
TYPE_TAG_NAME (type) = NULL;
|
TYPE_FLAGS (type) = 0;
|
TYPE_FLAGS (type) = 0;
|
TYPE_LENGTH (type) = 0;
|
TYPE_LENGTH (type) = 0;
|
return type;
|
return type;
|
}
|
}
|
|
|
/* An ordinary record type (with fixed-length fields) that describes
|
/* An ordinary record type (with fixed-length fields) that describes
|
the value of type TYPE at VALADDR or ADDRESS (see comments at
|
the value of type TYPE at VALADDR or ADDRESS (see comments at
|
the beginning of this section) VAL according to GNAT conventions.
|
the beginning of this section) VAL according to GNAT conventions.
|
DVAL0 should describe the (portion of a) record that contains any
|
DVAL0 should describe the (portion of a) record that contains any
|
necessary discriminants. It should be NULL if value_type (VAL) is
|
necessary discriminants. It should be NULL if value_type (VAL) is
|
an outer-level type (i.e., as opposed to a branch of a variant.) A
|
an outer-level type (i.e., as opposed to a branch of a variant.) A
|
variant field (unless unchecked) is replaced by a particular branch
|
variant field (unless unchecked) is replaced by a particular branch
|
of the variant.
|
of the variant.
|
|
|
If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
|
If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
|
length are not statically known are discarded. As a consequence,
|
length are not statically known are discarded. As a consequence,
|
VALADDR, ADDRESS and DVAL0 are ignored.
|
VALADDR, ADDRESS and DVAL0 are ignored.
|
|
|
NOTE: Limitations: For now, we assume that dynamic fields and
|
NOTE: Limitations: For now, we assume that dynamic fields and
|
variants occupy whole numbers of bytes. However, they need not be
|
variants occupy whole numbers of bytes. However, they need not be
|
byte-aligned. */
|
byte-aligned. */
|
|
|
struct type *
|
struct type *
|
ada_template_to_fixed_record_type_1 (struct type *type,
|
ada_template_to_fixed_record_type_1 (struct type *type,
|
const gdb_byte *valaddr,
|
const gdb_byte *valaddr,
|
CORE_ADDR address, struct value *dval0,
|
CORE_ADDR address, struct value *dval0,
|
int keep_dynamic_fields)
|
int keep_dynamic_fields)
|
{
|
{
|
struct value *mark = value_mark ();
|
struct value *mark = value_mark ();
|
struct value *dval;
|
struct value *dval;
|
struct type *rtype;
|
struct type *rtype;
|
int nfields, bit_len;
|
int nfields, bit_len;
|
int variant_field;
|
int variant_field;
|
long off;
|
long off;
|
int fld_bit_len, bit_incr;
|
int fld_bit_len, bit_incr;
|
int f;
|
int f;
|
|
|
/* Compute the number of fields in this record type that are going
|
/* Compute the number of fields in this record type that are going
|
to be processed: unless keep_dynamic_fields, this includes only
|
to be processed: unless keep_dynamic_fields, this includes only
|
fields whose position and length are static will be processed. */
|
fields whose position and length are static will be processed. */
|
if (keep_dynamic_fields)
|
if (keep_dynamic_fields)
|
nfields = TYPE_NFIELDS (type);
|
nfields = TYPE_NFIELDS (type);
|
else
|
else
|
{
|
{
|
nfields = 0;
|
nfields = 0;
|
while (nfields < TYPE_NFIELDS (type)
|
while (nfields < TYPE_NFIELDS (type)
|
&& !ada_is_variant_part (type, nfields)
|
&& !ada_is_variant_part (type, nfields)
|
&& !is_dynamic_field (type, nfields))
|
&& !is_dynamic_field (type, nfields))
|
nfields++;
|
nfields++;
|
}
|
}
|
|
|
rtype = alloc_type (TYPE_OBJFILE (type));
|
rtype = alloc_type (TYPE_OBJFILE (type));
|
TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
|
TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
|
INIT_CPLUS_SPECIFIC (rtype);
|
INIT_CPLUS_SPECIFIC (rtype);
|
TYPE_NFIELDS (rtype) = nfields;
|
TYPE_NFIELDS (rtype) = nfields;
|
TYPE_FIELDS (rtype) = (struct field *)
|
TYPE_FIELDS (rtype) = (struct field *)
|
TYPE_ALLOC (rtype, nfields * sizeof (struct field));
|
TYPE_ALLOC (rtype, nfields * sizeof (struct field));
|
memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
|
memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields);
|
TYPE_NAME (rtype) = ada_type_name (type);
|
TYPE_NAME (rtype) = ada_type_name (type);
|
TYPE_TAG_NAME (rtype) = NULL;
|
TYPE_TAG_NAME (rtype) = NULL;
|
TYPE_FLAGS (rtype) |= TYPE_FLAG_FIXED_INSTANCE;
|
TYPE_FLAGS (rtype) |= TYPE_FLAG_FIXED_INSTANCE;
|
|
|
off = 0;
|
off = 0;
|
bit_len = 0;
|
bit_len = 0;
|
variant_field = -1;
|
variant_field = -1;
|
|
|
for (f = 0; f < nfields; f += 1)
|
for (f = 0; f < nfields; f += 1)
|
{
|
{
|
off = align_value (off, field_alignment (type, f))
|
off = align_value (off, field_alignment (type, f))
|
+ TYPE_FIELD_BITPOS (type, f);
|
+ TYPE_FIELD_BITPOS (type, f);
|
TYPE_FIELD_BITPOS (rtype, f) = off;
|
TYPE_FIELD_BITPOS (rtype, f) = off;
|
TYPE_FIELD_BITSIZE (rtype, f) = 0;
|
TYPE_FIELD_BITSIZE (rtype, f) = 0;
|
|
|
if (ada_is_variant_part (type, f))
|
if (ada_is_variant_part (type, f))
|
{
|
{
|
variant_field = f;
|
variant_field = f;
|
fld_bit_len = bit_incr = 0;
|
fld_bit_len = bit_incr = 0;
|
}
|
}
|
else if (is_dynamic_field (type, f))
|
else if (is_dynamic_field (type, f))
|
{
|
{
|
if (dval0 == NULL)
|
if (dval0 == NULL)
|
dval = value_from_contents_and_address (rtype, valaddr, address);
|
dval = value_from_contents_and_address (rtype, valaddr, address);
|
else
|
else
|
dval = dval0;
|
dval = dval0;
|
|
|
/* Get the fixed type of the field. Note that, in this case, we
|
/* Get the fixed type of the field. Note that, in this case, we
|
do not want to get the real type out of the tag: if the current
|
do not want to get the real type out of the tag: if the current
|
field is the parent part of a tagged record, we will get the
|
field is the parent part of a tagged record, we will get the
|
tag of the object. Clearly wrong: the real type of the parent
|
tag of the object. Clearly wrong: the real type of the parent
|
is not the real type of the child. We would end up in an infinite
|
is not the real type of the child. We would end up in an infinite
|
loop. */
|
loop. */
|
TYPE_FIELD_TYPE (rtype, f) =
|
TYPE_FIELD_TYPE (rtype, f) =
|
ada_to_fixed_type
|
ada_to_fixed_type
|
(ada_get_base_type
|
(ada_get_base_type
|
(TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f))),
|
(TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f))),
|
cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
|
cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
|
cond_offset_target (address, off / TARGET_CHAR_BIT), dval, 0);
|
cond_offset_target (address, off / TARGET_CHAR_BIT), dval, 0);
|
TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
|
TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
|
bit_incr = fld_bit_len =
|
bit_incr = fld_bit_len =
|
TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
|
TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT;
|
}
|
}
|
else
|
else
|
{
|
{
|
TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
|
TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f);
|
TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
|
TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f);
|
if (TYPE_FIELD_BITSIZE (type, f) > 0)
|
if (TYPE_FIELD_BITSIZE (type, f) > 0)
|
bit_incr = fld_bit_len =
|
bit_incr = fld_bit_len =
|
TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
|
TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f);
|
else
|
else
|
bit_incr = fld_bit_len =
|
bit_incr = fld_bit_len =
|
TYPE_LENGTH (TYPE_FIELD_TYPE (type, f)) * TARGET_CHAR_BIT;
|
TYPE_LENGTH (TYPE_FIELD_TYPE (type, f)) * TARGET_CHAR_BIT;
|
}
|
}
|
if (off + fld_bit_len > bit_len)
|
if (off + fld_bit_len > bit_len)
|
bit_len = off + fld_bit_len;
|
bit_len = off + fld_bit_len;
|
off += bit_incr;
|
off += bit_incr;
|
TYPE_LENGTH (rtype) =
|
TYPE_LENGTH (rtype) =
|
align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
|
align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
|
}
|
}
|
|
|
/* We handle the variant part, if any, at the end because of certain
|
/* We handle the variant part, if any, at the end because of certain
|
odd cases in which it is re-ordered so as NOT the last field of
|
odd cases in which it is re-ordered so as NOT the last field of
|
the record. This can happen in the presence of representation
|
the record. This can happen in the presence of representation
|
clauses. */
|
clauses. */
|
if (variant_field >= 0)
|
if (variant_field >= 0)
|
{
|
{
|
struct type *branch_type;
|
struct type *branch_type;
|
|
|
off = TYPE_FIELD_BITPOS (rtype, variant_field);
|
off = TYPE_FIELD_BITPOS (rtype, variant_field);
|
|
|
if (dval0 == NULL)
|
if (dval0 == NULL)
|
dval = value_from_contents_and_address (rtype, valaddr, address);
|
dval = value_from_contents_and_address (rtype, valaddr, address);
|
else
|
else
|
dval = dval0;
|
dval = dval0;
|
|
|
branch_type =
|
branch_type =
|
to_fixed_variant_branch_type
|
to_fixed_variant_branch_type
|
(TYPE_FIELD_TYPE (type, variant_field),
|
(TYPE_FIELD_TYPE (type, variant_field),
|
cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
|
cond_offset_host (valaddr, off / TARGET_CHAR_BIT),
|
cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
|
cond_offset_target (address, off / TARGET_CHAR_BIT), dval);
|
if (branch_type == NULL)
|
if (branch_type == NULL)
|
{
|
{
|
for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
|
for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1)
|
TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
|
TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
|
TYPE_NFIELDS (rtype) -= 1;
|
TYPE_NFIELDS (rtype) -= 1;
|
}
|
}
|
else
|
else
|
{
|
{
|
TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
|
TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
|
TYPE_FIELD_NAME (rtype, variant_field) = "S";
|
TYPE_FIELD_NAME (rtype, variant_field) = "S";
|
fld_bit_len =
|
fld_bit_len =
|
TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
|
TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) *
|
TARGET_CHAR_BIT;
|
TARGET_CHAR_BIT;
|
if (off + fld_bit_len > bit_len)
|
if (off + fld_bit_len > bit_len)
|
bit_len = off + fld_bit_len;
|
bit_len = off + fld_bit_len;
|
TYPE_LENGTH (rtype) =
|
TYPE_LENGTH (rtype) =
|
align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
|
align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT;
|
}
|
}
|
}
|
}
|
|
|
/* According to exp_dbug.ads, the size of TYPE for variable-size records
|
/* According to exp_dbug.ads, the size of TYPE for variable-size records
|
should contain the alignment of that record, which should be a strictly
|
should contain the alignment of that record, which should be a strictly
|
positive value. If null or negative, then something is wrong, most
|
positive value. If null or negative, then something is wrong, most
|
probably in the debug info. In that case, we don't round up the size
|
probably in the debug info. In that case, we don't round up the size
|
of the resulting type. If this record is not part of another structure,
|
of the resulting type. If this record is not part of another structure,
|
the current RTYPE length might be good enough for our purposes. */
|
the current RTYPE length might be good enough for our purposes. */
|
if (TYPE_LENGTH (type) <= 0)
|
if (TYPE_LENGTH (type) <= 0)
|
{
|
{
|
if (TYPE_NAME (rtype))
|
if (TYPE_NAME (rtype))
|
warning (_("Invalid type size for `%s' detected: %d."),
|
warning (_("Invalid type size for `%s' detected: %d."),
|
TYPE_NAME (rtype), TYPE_LENGTH (type));
|
TYPE_NAME (rtype), TYPE_LENGTH (type));
|
else
|
else
|
warning (_("Invalid type size for <unnamed> detected: %d."),
|
warning (_("Invalid type size for <unnamed> detected: %d."),
|
TYPE_LENGTH (type));
|
TYPE_LENGTH (type));
|
}
|
}
|
else
|
else
|
{
|
{
|
TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
|
TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype),
|
TYPE_LENGTH (type));
|
TYPE_LENGTH (type));
|
}
|
}
|
|
|
value_free_to_mark (mark);
|
value_free_to_mark (mark);
|
if (TYPE_LENGTH (rtype) > varsize_limit)
|
if (TYPE_LENGTH (rtype) > varsize_limit)
|
error (_("record type with dynamic size is larger than varsize-limit"));
|
error (_("record type with dynamic size is larger than varsize-limit"));
|
return rtype;
|
return rtype;
|
}
|
}
|
|
|
/* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
|
/* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
|
of 1. */
|
of 1. */
|
|
|
static struct type *
|
static struct type *
|
template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
|
template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr,
|
CORE_ADDR address, struct value *dval0)
|
CORE_ADDR address, struct value *dval0)
|
{
|
{
|
return ada_template_to_fixed_record_type_1 (type, valaddr,
|
return ada_template_to_fixed_record_type_1 (type, valaddr,
|
address, dval0, 1);
|
address, dval0, 1);
|
}
|
}
|
|
|
/* An ordinary record type in which ___XVL-convention fields and
|
/* An ordinary record type in which ___XVL-convention fields and
|
___XVU- and ___XVN-convention field types in TYPE0 are replaced with
|
___XVU- and ___XVN-convention field types in TYPE0 are replaced with
|
static approximations, containing all possible fields. Uses
|
static approximations, containing all possible fields. Uses
|
no runtime values. Useless for use in values, but that's OK,
|
no runtime values. Useless for use in values, but that's OK,
|
since the results are used only for type determinations. Works on both
|
since the results are used only for type determinations. Works on both
|
structs and unions. Representation note: to save space, we memorize
|
structs and unions. Representation note: to save space, we memorize
|
the result of this function in the TYPE_TARGET_TYPE of the
|
the result of this function in the TYPE_TARGET_TYPE of the
|
template type. */
|
template type. */
|
|
|
static struct type *
|
static struct type *
|
template_to_static_fixed_type (struct type *type0)
|
template_to_static_fixed_type (struct type *type0)
|
{
|
{
|
struct type *type;
|
struct type *type;
|
int nfields;
|
int nfields;
|
int f;
|
int f;
|
|
|
if (TYPE_TARGET_TYPE (type0) != NULL)
|
if (TYPE_TARGET_TYPE (type0) != NULL)
|
return TYPE_TARGET_TYPE (type0);
|
return TYPE_TARGET_TYPE (type0);
|
|
|
nfields = TYPE_NFIELDS (type0);
|
nfields = TYPE_NFIELDS (type0);
|
type = type0;
|
type = type0;
|
|
|
for (f = 0; f < nfields; f += 1)
|
for (f = 0; f < nfields; f += 1)
|
{
|
{
|
struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
|
struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type0, f));
|
struct type *new_type;
|
struct type *new_type;
|
|
|
if (is_dynamic_field (type0, f))
|
if (is_dynamic_field (type0, f))
|
new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
|
new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type));
|
else
|
else
|
new_type = static_unwrap_type (field_type);
|
new_type = static_unwrap_type (field_type);
|
if (type == type0 && new_type != field_type)
|
if (type == type0 && new_type != field_type)
|
{
|
{
|
TYPE_TARGET_TYPE (type0) = type = alloc_type (TYPE_OBJFILE (type0));
|
TYPE_TARGET_TYPE (type0) = type = alloc_type (TYPE_OBJFILE (type0));
|
TYPE_CODE (type) = TYPE_CODE (type0);
|
TYPE_CODE (type) = TYPE_CODE (type0);
|
INIT_CPLUS_SPECIFIC (type);
|
INIT_CPLUS_SPECIFIC (type);
|
TYPE_NFIELDS (type) = nfields;
|
TYPE_NFIELDS (type) = nfields;
|
TYPE_FIELDS (type) = (struct field *)
|
TYPE_FIELDS (type) = (struct field *)
|
TYPE_ALLOC (type, nfields * sizeof (struct field));
|
TYPE_ALLOC (type, nfields * sizeof (struct field));
|
memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
|
memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0),
|
sizeof (struct field) * nfields);
|
sizeof (struct field) * nfields);
|
TYPE_NAME (type) = ada_type_name (type0);
|
TYPE_NAME (type) = ada_type_name (type0);
|
TYPE_TAG_NAME (type) = NULL;
|
TYPE_TAG_NAME (type) = NULL;
|
TYPE_FLAGS (type) |= TYPE_FLAG_FIXED_INSTANCE;
|
TYPE_FLAGS (type) |= TYPE_FLAG_FIXED_INSTANCE;
|
TYPE_LENGTH (type) = 0;
|
TYPE_LENGTH (type) = 0;
|
}
|
}
|
TYPE_FIELD_TYPE (type, f) = new_type;
|
TYPE_FIELD_TYPE (type, f) = new_type;
|
TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
|
TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f);
|
}
|
}
|
return type;
|
return type;
|
}
|
}
|
|
|
/* Given an object of type TYPE whose contents are at VALADDR and
|
/* Given an object of type TYPE whose contents are at VALADDR and
|
whose address in memory is ADDRESS, returns a revision of TYPE --
|
whose address in memory is ADDRESS, returns a revision of TYPE --
|
a non-dynamic-sized record with a variant part -- in which
|
a non-dynamic-sized record with a variant part -- in which
|
the variant part is replaced with the appropriate branch. Looks
|
the variant part is replaced with the appropriate branch. Looks
|
for discriminant values in DVAL0, which can be NULL if the record
|
for discriminant values in DVAL0, which can be NULL if the record
|
contains the necessary discriminant values. */
|
contains the necessary discriminant values. */
|
|
|
static struct type *
|
static struct type *
|
to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
|
to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr,
|
CORE_ADDR address, struct value *dval0)
|
CORE_ADDR address, struct value *dval0)
|
{
|
{
|
struct value *mark = value_mark ();
|
struct value *mark = value_mark ();
|
struct value *dval;
|
struct value *dval;
|
struct type *rtype;
|
struct type *rtype;
|
struct type *branch_type;
|
struct type *branch_type;
|
int nfields = TYPE_NFIELDS (type);
|
int nfields = TYPE_NFIELDS (type);
|
int variant_field = variant_field_index (type);
|
int variant_field = variant_field_index (type);
|
|
|
if (variant_field == -1)
|
if (variant_field == -1)
|
return type;
|
return type;
|
|
|
if (dval0 == NULL)
|
if (dval0 == NULL)
|
dval = value_from_contents_and_address (type, valaddr, address);
|
dval = value_from_contents_and_address (type, valaddr, address);
|
else
|
else
|
dval = dval0;
|
dval = dval0;
|
|
|
rtype = alloc_type (TYPE_OBJFILE (type));
|
rtype = alloc_type (TYPE_OBJFILE (type));
|
TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
|
TYPE_CODE (rtype) = TYPE_CODE_STRUCT;
|
INIT_CPLUS_SPECIFIC (rtype);
|
INIT_CPLUS_SPECIFIC (rtype);
|
TYPE_NFIELDS (rtype) = nfields;
|
TYPE_NFIELDS (rtype) = nfields;
|
TYPE_FIELDS (rtype) =
|
TYPE_FIELDS (rtype) =
|
(struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
|
(struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field));
|
memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
|
memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type),
|
sizeof (struct field) * nfields);
|
sizeof (struct field) * nfields);
|
TYPE_NAME (rtype) = ada_type_name (type);
|
TYPE_NAME (rtype) = ada_type_name (type);
|
TYPE_TAG_NAME (rtype) = NULL;
|
TYPE_TAG_NAME (rtype) = NULL;
|
TYPE_FLAGS (rtype) |= TYPE_FLAG_FIXED_INSTANCE;
|
TYPE_FLAGS (rtype) |= TYPE_FLAG_FIXED_INSTANCE;
|
TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
|
TYPE_LENGTH (rtype) = TYPE_LENGTH (type);
|
|
|
branch_type = to_fixed_variant_branch_type
|
branch_type = to_fixed_variant_branch_type
|
(TYPE_FIELD_TYPE (type, variant_field),
|
(TYPE_FIELD_TYPE (type, variant_field),
|
cond_offset_host (valaddr,
|
cond_offset_host (valaddr,
|
TYPE_FIELD_BITPOS (type, variant_field)
|
TYPE_FIELD_BITPOS (type, variant_field)
|
/ TARGET_CHAR_BIT),
|
/ TARGET_CHAR_BIT),
|
cond_offset_target (address,
|
cond_offset_target (address,
|
TYPE_FIELD_BITPOS (type, variant_field)
|
TYPE_FIELD_BITPOS (type, variant_field)
|
/ TARGET_CHAR_BIT), dval);
|
/ TARGET_CHAR_BIT), dval);
|
if (branch_type == NULL)
|
if (branch_type == NULL)
|
{
|
{
|
int f;
|
int f;
|
for (f = variant_field + 1; f < nfields; f += 1)
|
for (f = variant_field + 1; f < nfields; f += 1)
|
TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
|
TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f];
|
TYPE_NFIELDS (rtype) -= 1;
|
TYPE_NFIELDS (rtype) -= 1;
|
}
|
}
|
else
|
else
|
{
|
{
|
TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
|
TYPE_FIELD_TYPE (rtype, variant_field) = branch_type;
|
TYPE_FIELD_NAME (rtype, variant_field) = "S";
|
TYPE_FIELD_NAME (rtype, variant_field) = "S";
|
TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
|
TYPE_FIELD_BITSIZE (rtype, variant_field) = 0;
|
TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
|
TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type);
|
}
|
}
|
TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
|
TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field));
|
|
|
value_free_to_mark (mark);
|
value_free_to_mark (mark);
|
return rtype;
|
return rtype;
|
}
|
}
|
|
|
/* An ordinary record type (with fixed-length fields) that describes
|
/* An ordinary record type (with fixed-length fields) that describes
|
the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
|
the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
|
beginning of this section]. Any necessary discriminants' values
|
beginning of this section]. Any necessary discriminants' values
|
should be in DVAL, a record value; it may be NULL if the object
|
should be in DVAL, a record value; it may be NULL if the object
|
at ADDR itself contains any necessary discriminant values.
|
at ADDR itself contains any necessary discriminant values.
|
Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
|
Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
|
values from the record are needed. Except in the case that DVAL,
|
values from the record are needed. Except in the case that DVAL,
|
VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
|
VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
|
unchecked) is replaced by a particular branch of the variant.
|
unchecked) is replaced by a particular branch of the variant.
|
|
|
NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
|
NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
|
is questionable and may be removed. It can arise during the
|
is questionable and may be removed. It can arise during the
|
processing of an unconstrained-array-of-record type where all the
|
processing of an unconstrained-array-of-record type where all the
|
variant branches have exactly the same size. This is because in
|
variant branches have exactly the same size. This is because in
|
such cases, the compiler does not bother to use the XVS convention
|
such cases, the compiler does not bother to use the XVS convention
|
when encoding the record. I am currently dubious of this
|
when encoding the record. I am currently dubious of this
|
shortcut and suspect the compiler should be altered. FIXME. */
|
shortcut and suspect the compiler should be altered. FIXME. */
|
|
|
static struct type *
|
static struct type *
|
to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
|
to_fixed_record_type (struct type *type0, const gdb_byte *valaddr,
|
CORE_ADDR address, struct value *dval)
|
CORE_ADDR address, struct value *dval)
|
{
|
{
|
struct type *templ_type;
|
struct type *templ_type;
|
|
|
if (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE)
|
if (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE)
|
return type0;
|
return type0;
|
|
|
templ_type = dynamic_template_type (type0);
|
templ_type = dynamic_template_type (type0);
|
|
|
if (templ_type != NULL)
|
if (templ_type != NULL)
|
return template_to_fixed_record_type (templ_type, valaddr, address, dval);
|
return template_to_fixed_record_type (templ_type, valaddr, address, dval);
|
else if (variant_field_index (type0) >= 0)
|
else if (variant_field_index (type0) >= 0)
|
{
|
{
|
if (dval == NULL && valaddr == NULL && address == 0)
|
if (dval == NULL && valaddr == NULL && address == 0)
|
return type0;
|
return type0;
|
return to_record_with_fixed_variant_part (type0, valaddr, address,
|
return to_record_with_fixed_variant_part (type0, valaddr, address,
|
dval);
|
dval);
|
}
|
}
|
else
|
else
|
{
|
{
|
TYPE_FLAGS (type0) |= TYPE_FLAG_FIXED_INSTANCE;
|
TYPE_FLAGS (type0) |= TYPE_FLAG_FIXED_INSTANCE;
|
return type0;
|
return type0;
|
}
|
}
|
|
|
}
|
}
|
|
|
/* An ordinary record type (with fixed-length fields) that describes
|
/* An ordinary record type (with fixed-length fields) that describes
|
the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
|
the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
|
union type. Any necessary discriminants' values should be in DVAL,
|
union type. Any necessary discriminants' values should be in DVAL,
|
a record value. That is, this routine selects the appropriate
|
a record value. That is, this routine selects the appropriate
|
branch of the union at ADDR according to the discriminant value
|
branch of the union at ADDR according to the discriminant value
|
indicated in the union's type name. */
|
indicated in the union's type name. */
|
|
|
static struct type *
|
static struct type *
|
to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
|
to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr,
|
CORE_ADDR address, struct value *dval)
|
CORE_ADDR address, struct value *dval)
|
{
|
{
|
int which;
|
int which;
|
struct type *templ_type;
|
struct type *templ_type;
|
struct type *var_type;
|
struct type *var_type;
|
|
|
if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
|
if (TYPE_CODE (var_type0) == TYPE_CODE_PTR)
|
var_type = TYPE_TARGET_TYPE (var_type0);
|
var_type = TYPE_TARGET_TYPE (var_type0);
|
else
|
else
|
var_type = var_type0;
|
var_type = var_type0;
|
|
|
templ_type = ada_find_parallel_type (var_type, "___XVU");
|
templ_type = ada_find_parallel_type (var_type, "___XVU");
|
|
|
if (templ_type != NULL)
|
if (templ_type != NULL)
|
var_type = templ_type;
|
var_type = templ_type;
|
|
|
which =
|
which =
|
ada_which_variant_applies (var_type,
|
ada_which_variant_applies (var_type,
|
value_type (dval), value_contents (dval));
|
value_type (dval), value_contents (dval));
|
|
|
if (which < 0)
|
if (which < 0)
|
return empty_record (TYPE_OBJFILE (var_type));
|
return empty_record (TYPE_OBJFILE (var_type));
|
else if (is_dynamic_field (var_type, which))
|
else if (is_dynamic_field (var_type, which))
|
return to_fixed_record_type
|
return to_fixed_record_type
|
(TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
|
(TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)),
|
valaddr, address, dval);
|
valaddr, address, dval);
|
else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
|
else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0)
|
return
|
return
|
to_fixed_record_type
|
to_fixed_record_type
|
(TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
|
(TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval);
|
else
|
else
|
return TYPE_FIELD_TYPE (var_type, which);
|
return TYPE_FIELD_TYPE (var_type, which);
|
}
|
}
|
|
|
/* Assuming that TYPE0 is an array type describing the type of a value
|
/* Assuming that TYPE0 is an array type describing the type of a value
|
at ADDR, and that DVAL describes a record containing any
|
at ADDR, and that DVAL describes a record containing any
|
discriminants used in TYPE0, returns a type for the value that
|
discriminants used in TYPE0, returns a type for the value that
|
contains no dynamic components (that is, no components whose sizes
|
contains no dynamic components (that is, no components whose sizes
|
are determined by run-time quantities). Unless IGNORE_TOO_BIG is
|
are determined by run-time quantities). Unless IGNORE_TOO_BIG is
|
true, gives an error message if the resulting type's size is over
|
true, gives an error message if the resulting type's size is over
|
varsize_limit. */
|
varsize_limit. */
|
|
|
static struct type *
|
static struct type *
|
to_fixed_array_type (struct type *type0, struct value *dval,
|
to_fixed_array_type (struct type *type0, struct value *dval,
|
int ignore_too_big)
|
int ignore_too_big)
|
{
|
{
|
struct type *index_type_desc;
|
struct type *index_type_desc;
|
struct type *result;
|
struct type *result;
|
|
|
if (ada_is_packed_array_type (type0) /* revisit? */
|
if (ada_is_packed_array_type (type0) /* revisit? */
|
|| (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE))
|
|| (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE))
|
return type0;
|
return type0;
|
|
|
index_type_desc = ada_find_parallel_type (type0, "___XA");
|
index_type_desc = ada_find_parallel_type (type0, "___XA");
|
if (index_type_desc == NULL)
|
if (index_type_desc == NULL)
|
{
|
{
|
struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
|
struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0));
|
/* NOTE: elt_type---the fixed version of elt_type0---should never
|
/* NOTE: elt_type---the fixed version of elt_type0---should never
|
depend on the contents of the array in properly constructed
|
depend on the contents of the array in properly constructed
|
debugging data. */
|
debugging data. */
|
/* Create a fixed version of the array element type.
|
/* Create a fixed version of the array element type.
|
We're not providing the address of an element here,
|
We're not providing the address of an element here,
|
and thus the actual object value cannot be inspected to do
|
and thus the actual object value cannot be inspected to do
|
the conversion. This should not be a problem, since arrays of
|
the conversion. This should not be a problem, since arrays of
|
unconstrained objects are not allowed. In particular, all
|
unconstrained objects are not allowed. In particular, all
|
the elements of an array of a tagged type should all be of
|
the elements of an array of a tagged type should all be of
|
the same type specified in the debugging info. No need to
|
the same type specified in the debugging info. No need to
|
consult the object tag. */
|
consult the object tag. */
|
struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
|
struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1);
|
|
|
if (elt_type0 == elt_type)
|
if (elt_type0 == elt_type)
|
result = type0;
|
result = type0;
|
else
|
else
|
result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
|
result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
|
elt_type, TYPE_INDEX_TYPE (type0));
|
elt_type, TYPE_INDEX_TYPE (type0));
|
}
|
}
|
else
|
else
|
{
|
{
|
int i;
|
int i;
|
struct type *elt_type0;
|
struct type *elt_type0;
|
|
|
elt_type0 = type0;
|
elt_type0 = type0;
|
for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
|
for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1)
|
elt_type0 = TYPE_TARGET_TYPE (elt_type0);
|
elt_type0 = TYPE_TARGET_TYPE (elt_type0);
|
|
|
/* NOTE: result---the fixed version of elt_type0---should never
|
/* NOTE: result---the fixed version of elt_type0---should never
|
depend on the contents of the array in properly constructed
|
depend on the contents of the array in properly constructed
|
debugging data. */
|
debugging data. */
|
/* Create a fixed version of the array element type.
|
/* Create a fixed version of the array element type.
|
We're not providing the address of an element here,
|
We're not providing the address of an element here,
|
and thus the actual object value cannot be inspected to do
|
and thus the actual object value cannot be inspected to do
|
the conversion. This should not be a problem, since arrays of
|
the conversion. This should not be a problem, since arrays of
|
unconstrained objects are not allowed. In particular, all
|
unconstrained objects are not allowed. In particular, all
|
the elements of an array of a tagged type should all be of
|
the elements of an array of a tagged type should all be of
|
the same type specified in the debugging info. No need to
|
the same type specified in the debugging info. No need to
|
consult the object tag. */
|
consult the object tag. */
|
result =
|
result =
|
ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
|
ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1);
|
for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
|
for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1)
|
{
|
{
|
struct type *range_type =
|
struct type *range_type =
|
to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, i),
|
to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc, i),
|
dval, TYPE_OBJFILE (type0));
|
dval, TYPE_OBJFILE (type0));
|
result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
|
result = create_array_type (alloc_type (TYPE_OBJFILE (type0)),
|
result, range_type);
|
result, range_type);
|
}
|
}
|
if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
|
if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit)
|
error (_("array type with dynamic size is larger than varsize-limit"));
|
error (_("array type with dynamic size is larger than varsize-limit"));
|
}
|
}
|
|
|
TYPE_FLAGS (result) |= TYPE_FLAG_FIXED_INSTANCE;
|
TYPE_FLAGS (result) |= TYPE_FLAG_FIXED_INSTANCE;
|
return result;
|
return result;
|
}
|
}
|
|
|
|
|
/* A standard type (containing no dynamically sized components)
|
/* A standard type (containing no dynamically sized components)
|
corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
|
corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
|
DVAL describes a record containing any discriminants used in TYPE0,
|
DVAL describes a record containing any discriminants used in TYPE0,
|
and may be NULL if there are none, or if the object of type TYPE at
|
and may be NULL if there are none, or if the object of type TYPE at
|
ADDRESS or in VALADDR contains these discriminants.
|
ADDRESS or in VALADDR contains these discriminants.
|
|
|
If CHECK_TAG is not null, in the case of tagged types, this function
|
If CHECK_TAG is not null, in the case of tagged types, this function
|
attempts to locate the object's tag and use it to compute the actual
|
attempts to locate the object's tag and use it to compute the actual
|
type. However, when ADDRESS is null, we cannot use it to determine the
|
type. However, when ADDRESS is null, we cannot use it to determine the
|
location of the tag, and therefore compute the tagged type's actual type.
|
location of the tag, and therefore compute the tagged type's actual type.
|
So we return the tagged type without consulting the tag. */
|
So we return the tagged type without consulting the tag. */
|
|
|
static struct type *
|
static struct type *
|
ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
|
ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr,
|
CORE_ADDR address, struct value *dval, int check_tag)
|
CORE_ADDR address, struct value *dval, int check_tag)
|
{
|
{
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
default:
|
default:
|
return type;
|
return type;
|
case TYPE_CODE_STRUCT:
|
case TYPE_CODE_STRUCT:
|
{
|
{
|
struct type *static_type = to_static_fixed_type (type);
|
struct type *static_type = to_static_fixed_type (type);
|
struct type *fixed_record_type =
|
struct type *fixed_record_type =
|
to_fixed_record_type (type, valaddr, address, NULL);
|
to_fixed_record_type (type, valaddr, address, NULL);
|
/* If STATIC_TYPE is a tagged type and we know the object's address,
|
/* If STATIC_TYPE is a tagged type and we know the object's address,
|
then we can determine its tag, and compute the object's actual
|
then we can determine its tag, and compute the object's actual
|
type from there. Note that we have to use the fixed record
|
type from there. Note that we have to use the fixed record
|
type (the parent part of the record may have dynamic fields
|
type (the parent part of the record may have dynamic fields
|
and the way the location of _tag is expressed may depend on
|
and the way the location of _tag is expressed may depend on
|
them). */
|
them). */
|
|
|
if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
|
if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0))
|
{
|
{
|
struct type *real_type =
|
struct type *real_type =
|
type_from_tag (value_tag_from_contents_and_address
|
type_from_tag (value_tag_from_contents_and_address
|
(fixed_record_type,
|
(fixed_record_type,
|
valaddr,
|
valaddr,
|
address));
|
address));
|
if (real_type != NULL)
|
if (real_type != NULL)
|
return to_fixed_record_type (real_type, valaddr, address, NULL);
|
return to_fixed_record_type (real_type, valaddr, address, NULL);
|
}
|
}
|
return fixed_record_type;
|
return fixed_record_type;
|
}
|
}
|
case TYPE_CODE_ARRAY:
|
case TYPE_CODE_ARRAY:
|
return to_fixed_array_type (type, dval, 1);
|
return to_fixed_array_type (type, dval, 1);
|
case TYPE_CODE_UNION:
|
case TYPE_CODE_UNION:
|
if (dval == NULL)
|
if (dval == NULL)
|
return type;
|
return type;
|
else
|
else
|
return to_fixed_variant_branch_type (type, valaddr, address, dval);
|
return to_fixed_variant_branch_type (type, valaddr, address, dval);
|
}
|
}
|
}
|
}
|
|
|
/* The same as ada_to_fixed_type_1, except that it preserves the type
|
/* The same as ada_to_fixed_type_1, except that it preserves the type
|
if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
|
if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
|
ada_to_fixed_type_1 would return the type referenced by TYPE. */
|
ada_to_fixed_type_1 would return the type referenced by TYPE. */
|
|
|
struct type *
|
struct type *
|
ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
|
ada_to_fixed_type (struct type *type, const gdb_byte *valaddr,
|
CORE_ADDR address, struct value *dval, int check_tag)
|
CORE_ADDR address, struct value *dval, int check_tag)
|
|
|
{
|
{
|
struct type *fixed_type =
|
struct type *fixed_type =
|
ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
|
ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag);
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
|
if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF
|
&& TYPE_TARGET_TYPE (type) == fixed_type)
|
&& TYPE_TARGET_TYPE (type) == fixed_type)
|
return type;
|
return type;
|
|
|
return fixed_type;
|
return fixed_type;
|
}
|
}
|
|
|
/* A standard (static-sized) type corresponding as well as possible to
|
/* A standard (static-sized) type corresponding as well as possible to
|
TYPE0, but based on no runtime data. */
|
TYPE0, but based on no runtime data. */
|
|
|
static struct type *
|
static struct type *
|
to_static_fixed_type (struct type *type0)
|
to_static_fixed_type (struct type *type0)
|
{
|
{
|
struct type *type;
|
struct type *type;
|
|
|
if (type0 == NULL)
|
if (type0 == NULL)
|
return NULL;
|
return NULL;
|
|
|
if (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE)
|
if (TYPE_FLAGS (type0) & TYPE_FLAG_FIXED_INSTANCE)
|
return type0;
|
return type0;
|
|
|
type0 = ada_check_typedef (type0);
|
type0 = ada_check_typedef (type0);
|
|
|
switch (TYPE_CODE (type0))
|
switch (TYPE_CODE (type0))
|
{
|
{
|
default:
|
default:
|
return type0;
|
return type0;
|
case TYPE_CODE_STRUCT:
|
case TYPE_CODE_STRUCT:
|
type = dynamic_template_type (type0);
|
type = dynamic_template_type (type0);
|
if (type != NULL)
|
if (type != NULL)
|
return template_to_static_fixed_type (type);
|
return template_to_static_fixed_type (type);
|
else
|
else
|
return template_to_static_fixed_type (type0);
|
return template_to_static_fixed_type (type0);
|
case TYPE_CODE_UNION:
|
case TYPE_CODE_UNION:
|
type = ada_find_parallel_type (type0, "___XVU");
|
type = ada_find_parallel_type (type0, "___XVU");
|
if (type != NULL)
|
if (type != NULL)
|
return template_to_static_fixed_type (type);
|
return template_to_static_fixed_type (type);
|
else
|
else
|
return template_to_static_fixed_type (type0);
|
return template_to_static_fixed_type (type0);
|
}
|
}
|
}
|
}
|
|
|
/* A static approximation of TYPE with all type wrappers removed. */
|
/* A static approximation of TYPE with all type wrappers removed. */
|
|
|
static struct type *
|
static struct type *
|
static_unwrap_type (struct type *type)
|
static_unwrap_type (struct type *type)
|
{
|
{
|
if (ada_is_aligner_type (type))
|
if (ada_is_aligner_type (type))
|
{
|
{
|
struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
|
struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0);
|
if (ada_type_name (type1) == NULL)
|
if (ada_type_name (type1) == NULL)
|
TYPE_NAME (type1) = ada_type_name (type);
|
TYPE_NAME (type1) = ada_type_name (type);
|
|
|
return static_unwrap_type (type1);
|
return static_unwrap_type (type1);
|
}
|
}
|
else
|
else
|
{
|
{
|
struct type *raw_real_type = ada_get_base_type (type);
|
struct type *raw_real_type = ada_get_base_type (type);
|
if (raw_real_type == type)
|
if (raw_real_type == type)
|
return type;
|
return type;
|
else
|
else
|
return to_static_fixed_type (raw_real_type);
|
return to_static_fixed_type (raw_real_type);
|
}
|
}
|
}
|
}
|
|
|
/* In some cases, incomplete and private types require
|
/* In some cases, incomplete and private types require
|
cross-references that are not resolved as records (for example,
|
cross-references that are not resolved as records (for example,
|
type Foo;
|
type Foo;
|
type FooP is access Foo;
|
type FooP is access Foo;
|
V: FooP;
|
V: FooP;
|
type Foo is array ...;
|
type Foo is array ...;
|
). In these cases, since there is no mechanism for producing
|
). In these cases, since there is no mechanism for producing
|
cross-references to such types, we instead substitute for FooP a
|
cross-references to such types, we instead substitute for FooP a
|
stub enumeration type that is nowhere resolved, and whose tag is
|
stub enumeration type that is nowhere resolved, and whose tag is
|
the name of the actual type. Call these types "non-record stubs". */
|
the name of the actual type. Call these types "non-record stubs". */
|
|
|
/* A type equivalent to TYPE that is not a non-record stub, if one
|
/* A type equivalent to TYPE that is not a non-record stub, if one
|
exists, otherwise TYPE. */
|
exists, otherwise TYPE. */
|
|
|
struct type *
|
struct type *
|
ada_check_typedef (struct type *type)
|
ada_check_typedef (struct type *type)
|
{
|
{
|
if (type == NULL)
|
if (type == NULL)
|
return NULL;
|
return NULL;
|
|
|
CHECK_TYPEDEF (type);
|
CHECK_TYPEDEF (type);
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
|
if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM
|
|| !TYPE_STUB (type)
|
|| !TYPE_STUB (type)
|
|| TYPE_TAG_NAME (type) == NULL)
|
|| TYPE_TAG_NAME (type) == NULL)
|
return type;
|
return type;
|
else
|
else
|
{
|
{
|
char *name = TYPE_TAG_NAME (type);
|
char *name = TYPE_TAG_NAME (type);
|
struct type *type1 = ada_find_any_type (name);
|
struct type *type1 = ada_find_any_type (name);
|
return (type1 == NULL) ? type : type1;
|
return (type1 == NULL) ? type : type1;
|
}
|
}
|
}
|
}
|
|
|
/* A value representing the data at VALADDR/ADDRESS as described by
|
/* A value representing the data at VALADDR/ADDRESS as described by
|
type TYPE0, but with a standard (static-sized) type that correctly
|
type TYPE0, but with a standard (static-sized) type that correctly
|
describes it. If VAL0 is not NULL and TYPE0 already is a standard
|
describes it. If VAL0 is not NULL and TYPE0 already is a standard
|
type, then return VAL0 [this feature is simply to avoid redundant
|
type, then return VAL0 [this feature is simply to avoid redundant
|
creation of struct values]. */
|
creation of struct values]. */
|
|
|
static struct value *
|
static struct value *
|
ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
|
ada_to_fixed_value_create (struct type *type0, CORE_ADDR address,
|
struct value *val0)
|
struct value *val0)
|
{
|
{
|
struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
|
struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1);
|
if (type == type0 && val0 != NULL)
|
if (type == type0 && val0 != NULL)
|
return val0;
|
return val0;
|
else
|
else
|
return value_from_contents_and_address (type, 0, address);
|
return value_from_contents_and_address (type, 0, address);
|
}
|
}
|
|
|
/* A value representing VAL, but with a standard (static-sized) type
|
/* A value representing VAL, but with a standard (static-sized) type
|
that correctly describes it. Does not necessarily create a new
|
that correctly describes it. Does not necessarily create a new
|
value. */
|
value. */
|
|
|
static struct value *
|
static struct value *
|
ada_to_fixed_value (struct value *val)
|
ada_to_fixed_value (struct value *val)
|
{
|
{
|
return ada_to_fixed_value_create (value_type (val),
|
return ada_to_fixed_value_create (value_type (val),
|
VALUE_ADDRESS (val) + value_offset (val),
|
VALUE_ADDRESS (val) + value_offset (val),
|
val);
|
val);
|
}
|
}
|
|
|
/* A value representing VAL, but with a standard (static-sized) type
|
/* A value representing VAL, but with a standard (static-sized) type
|
chosen to approximate the real type of VAL as well as possible, but
|
chosen to approximate the real type of VAL as well as possible, but
|
without consulting any runtime values. For Ada dynamic-sized
|
without consulting any runtime values. For Ada dynamic-sized
|
types, therefore, the type of the result is likely to be inaccurate. */
|
types, therefore, the type of the result is likely to be inaccurate. */
|
|
|
struct value *
|
struct value *
|
ada_to_static_fixed_value (struct value *val)
|
ada_to_static_fixed_value (struct value *val)
|
{
|
{
|
struct type *type =
|
struct type *type =
|
to_static_fixed_type (static_unwrap_type (value_type (val)));
|
to_static_fixed_type (static_unwrap_type (value_type (val)));
|
if (type == value_type (val))
|
if (type == value_type (val))
|
return val;
|
return val;
|
else
|
else
|
return coerce_unspec_val_to_type (val, type);
|
return coerce_unspec_val_to_type (val, type);
|
}
|
}
|
|
|
|
|
/* Attributes */
|
/* Attributes */
|
|
|
/* Table mapping attribute numbers to names.
|
/* Table mapping attribute numbers to names.
|
NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
|
NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
|
|
|
static const char *attribute_names[] = {
|
static const char *attribute_names[] = {
|
"<?>",
|
"<?>",
|
|
|
"first",
|
"first",
|
"last",
|
"last",
|
"length",
|
"length",
|
"image",
|
"image",
|
"max",
|
"max",
|
"min",
|
"min",
|
"modulus",
|
"modulus",
|
"pos",
|
"pos",
|
"size",
|
"size",
|
"tag",
|
"tag",
|
"val",
|
"val",
|
0
|
0
|
};
|
};
|
|
|
const char *
|
const char *
|
ada_attribute_name (enum exp_opcode n)
|
ada_attribute_name (enum exp_opcode n)
|
{
|
{
|
if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
|
if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL)
|
return attribute_names[n - OP_ATR_FIRST + 1];
|
return attribute_names[n - OP_ATR_FIRST + 1];
|
else
|
else
|
return attribute_names[0];
|
return attribute_names[0];
|
}
|
}
|
|
|
/* Evaluate the 'POS attribute applied to ARG. */
|
/* Evaluate the 'POS attribute applied to ARG. */
|
|
|
static LONGEST
|
static LONGEST
|
pos_atr (struct value *arg)
|
pos_atr (struct value *arg)
|
{
|
{
|
struct type *type = value_type (arg);
|
struct type *type = value_type (arg);
|
|
|
if (!discrete_type_p (type))
|
if (!discrete_type_p (type))
|
error (_("'POS only defined on discrete types"));
|
error (_("'POS only defined on discrete types"));
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_ENUM)
|
if (TYPE_CODE (type) == TYPE_CODE_ENUM)
|
{
|
{
|
int i;
|
int i;
|
LONGEST v = value_as_long (arg);
|
LONGEST v = value_as_long (arg);
|
|
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
for (i = 0; i < TYPE_NFIELDS (type); i += 1)
|
{
|
{
|
if (v == TYPE_FIELD_BITPOS (type, i))
|
if (v == TYPE_FIELD_BITPOS (type, i))
|
return i;
|
return i;
|
}
|
}
|
error (_("enumeration value is invalid: can't find 'POS"));
|
error (_("enumeration value is invalid: can't find 'POS"));
|
}
|
}
|
else
|
else
|
return value_as_long (arg);
|
return value_as_long (arg);
|
}
|
}
|
|
|
static struct value *
|
static struct value *
|
value_pos_atr (struct value *arg)
|
value_pos_atr (struct value *arg)
|
{
|
{
|
return value_from_longest (builtin_type_int, pos_atr (arg));
|
return value_from_longest (builtin_type_int, pos_atr (arg));
|
}
|
}
|
|
|
/* Evaluate the TYPE'VAL attribute applied to ARG. */
|
/* Evaluate the TYPE'VAL attribute applied to ARG. */
|
|
|
static struct value *
|
static struct value *
|
value_val_atr (struct type *type, struct value *arg)
|
value_val_atr (struct type *type, struct value *arg)
|
{
|
{
|
if (!discrete_type_p (type))
|
if (!discrete_type_p (type))
|
error (_("'VAL only defined on discrete types"));
|
error (_("'VAL only defined on discrete types"));
|
if (!integer_type_p (value_type (arg)))
|
if (!integer_type_p (value_type (arg)))
|
error (_("'VAL requires integral argument"));
|
error (_("'VAL requires integral argument"));
|
|
|
if (TYPE_CODE (type) == TYPE_CODE_ENUM)
|
if (TYPE_CODE (type) == TYPE_CODE_ENUM)
|
{
|
{
|
long pos = value_as_long (arg);
|
long pos = value_as_long (arg);
|
if (pos < 0 || pos >= TYPE_NFIELDS (type))
|
if (pos < 0 || pos >= TYPE_NFIELDS (type))
|
error (_("argument to 'VAL out of range"));
|
error (_("argument to 'VAL out of range"));
|
return value_from_longest (type, TYPE_FIELD_BITPOS (type, pos));
|
return value_from_longest (type, TYPE_FIELD_BITPOS (type, pos));
|
}
|
}
|
else
|
else
|
return value_from_longest (type, value_as_long (arg));
|
return value_from_longest (type, value_as_long (arg));
|
}
|
}
|
|
|
|
|
/* Evaluation */
|
/* Evaluation */
|
|
|
/* True if TYPE appears to be an Ada character type.
|
/* True if TYPE appears to be an Ada character type.
|
[At the moment, this is true only for Character and Wide_Character;
|
[At the moment, this is true only for Character and Wide_Character;
|
It is a heuristic test that could stand improvement]. */
|
It is a heuristic test that could stand improvement]. */
|
|
|
int
|
int
|
ada_is_character_type (struct type *type)
|
ada_is_character_type (struct type *type)
|
{
|
{
|
const char *name;
|
const char *name;
|
|
|
/* If the type code says it's a character, then assume it really is,
|
/* If the type code says it's a character, then assume it really is,
|
and don't check any further. */
|
and don't check any further. */
|
if (TYPE_CODE (type) == TYPE_CODE_CHAR)
|
if (TYPE_CODE (type) == TYPE_CODE_CHAR)
|
return 1;
|
return 1;
|
|
|
/* Otherwise, assume it's a character type iff it is a discrete type
|
/* Otherwise, assume it's a character type iff it is a discrete type
|
with a known character type name. */
|
with a known character type name. */
|
name = ada_type_name (type);
|
name = ada_type_name (type);
|
return (name != NULL
|
return (name != NULL
|
&& (TYPE_CODE (type) == TYPE_CODE_INT
|
&& (TYPE_CODE (type) == TYPE_CODE_INT
|
|| TYPE_CODE (type) == TYPE_CODE_RANGE)
|
|| TYPE_CODE (type) == TYPE_CODE_RANGE)
|
&& (strcmp (name, "character") == 0
|
&& (strcmp (name, "character") == 0
|
|| strcmp (name, "wide_character") == 0
|
|| strcmp (name, "wide_character") == 0
|
|| strcmp (name, "wide_wide_character") == 0
|
|| strcmp (name, "wide_wide_character") == 0
|
|| strcmp (name, "unsigned char") == 0));
|
|| strcmp (name, "unsigned char") == 0));
|
}
|
}
|
|
|
/* True if TYPE appears to be an Ada string type. */
|
/* True if TYPE appears to be an Ada string type. */
|
|
|
int
|
int
|
ada_is_string_type (struct type *type)
|
ada_is_string_type (struct type *type)
|
{
|
{
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
if (type != NULL
|
if (type != NULL
|
&& TYPE_CODE (type) != TYPE_CODE_PTR
|
&& TYPE_CODE (type) != TYPE_CODE_PTR
|
&& (ada_is_simple_array_type (type)
|
&& (ada_is_simple_array_type (type)
|
|| ada_is_array_descriptor_type (type))
|
|| ada_is_array_descriptor_type (type))
|
&& ada_array_arity (type) == 1)
|
&& ada_array_arity (type) == 1)
|
{
|
{
|
struct type *elttype = ada_array_element_type (type, 1);
|
struct type *elttype = ada_array_element_type (type, 1);
|
|
|
return ada_is_character_type (elttype);
|
return ada_is_character_type (elttype);
|
}
|
}
|
else
|
else
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* True if TYPE is a struct type introduced by the compiler to force the
|
/* True if TYPE is a struct type introduced by the compiler to force the
|
alignment of a value. Such types have a single field with a
|
alignment of a value. Such types have a single field with a
|
distinctive name. */
|
distinctive name. */
|
|
|
int
|
int
|
ada_is_aligner_type (struct type *type)
|
ada_is_aligner_type (struct type *type)
|
{
|
{
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
|
|
/* If we can find a parallel XVS type, then the XVS type should
|
/* If we can find a parallel XVS type, then the XVS type should
|
be used instead of this type. And hence, this is not an aligner
|
be used instead of this type. And hence, this is not an aligner
|
type. */
|
type. */
|
if (ada_find_parallel_type (type, "___XVS") != NULL)
|
if (ada_find_parallel_type (type, "___XVS") != NULL)
|
return 0;
|
return 0;
|
|
|
return (TYPE_CODE (type) == TYPE_CODE_STRUCT
|
return (TYPE_CODE (type) == TYPE_CODE_STRUCT
|
&& TYPE_NFIELDS (type) == 1
|
&& TYPE_NFIELDS (type) == 1
|
&& strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
|
&& strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0);
|
}
|
}
|
|
|
/* If there is an ___XVS-convention type parallel to SUBTYPE, return
|
/* If there is an ___XVS-convention type parallel to SUBTYPE, return
|
the parallel type. */
|
the parallel type. */
|
|
|
struct type *
|
struct type *
|
ada_get_base_type (struct type *raw_type)
|
ada_get_base_type (struct type *raw_type)
|
{
|
{
|
struct type *real_type_namer;
|
struct type *real_type_namer;
|
struct type *raw_real_type;
|
struct type *raw_real_type;
|
|
|
if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
|
if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT)
|
return raw_type;
|
return raw_type;
|
|
|
real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
|
real_type_namer = ada_find_parallel_type (raw_type, "___XVS");
|
if (real_type_namer == NULL
|
if (real_type_namer == NULL
|
|| TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
|
|| TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT
|
|| TYPE_NFIELDS (real_type_namer) != 1)
|
|| TYPE_NFIELDS (real_type_namer) != 1)
|
return raw_type;
|
return raw_type;
|
|
|
raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
|
raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0));
|
if (raw_real_type == NULL)
|
if (raw_real_type == NULL)
|
return raw_type;
|
return raw_type;
|
else
|
else
|
return raw_real_type;
|
return raw_real_type;
|
}
|
}
|
|
|
/* The type of value designated by TYPE, with all aligners removed. */
|
/* The type of value designated by TYPE, with all aligners removed. */
|
|
|
struct type *
|
struct type *
|
ada_aligned_type (struct type *type)
|
ada_aligned_type (struct type *type)
|
{
|
{
|
if (ada_is_aligner_type (type))
|
if (ada_is_aligner_type (type))
|
return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
|
return ada_aligned_type (TYPE_FIELD_TYPE (type, 0));
|
else
|
else
|
return ada_get_base_type (type);
|
return ada_get_base_type (type);
|
}
|
}
|
|
|
|
|
/* The address of the aligned value in an object at address VALADDR
|
/* The address of the aligned value in an object at address VALADDR
|
having type TYPE. Assumes ada_is_aligner_type (TYPE). */
|
having type TYPE. Assumes ada_is_aligner_type (TYPE). */
|
|
|
const gdb_byte *
|
const gdb_byte *
|
ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
|
ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr)
|
{
|
{
|
if (ada_is_aligner_type (type))
|
if (ada_is_aligner_type (type))
|
return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
|
return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0),
|
valaddr +
|
valaddr +
|
TYPE_FIELD_BITPOS (type,
|
TYPE_FIELD_BITPOS (type,
|
0) / TARGET_CHAR_BIT);
|
0) / TARGET_CHAR_BIT);
|
else
|
else
|
return valaddr;
|
return valaddr;
|
}
|
}
|
|
|
|
|
|
|
/* The printed representation of an enumeration literal with encoded
|
/* The printed representation of an enumeration literal with encoded
|
name NAME. The value is good to the next call of ada_enum_name. */
|
name NAME. The value is good to the next call of ada_enum_name. */
|
const char *
|
const char *
|
ada_enum_name (const char *name)
|
ada_enum_name (const char *name)
|
{
|
{
|
static char *result;
|
static char *result;
|
static size_t result_len = 0;
|
static size_t result_len = 0;
|
char *tmp;
|
char *tmp;
|
|
|
/* First, unqualify the enumeration name:
|
/* First, unqualify the enumeration name:
|
1. Search for the last '.' character. If we find one, then skip
|
1. Search for the last '.' character. If we find one, then skip
|
all the preceeding characters, the unqualified name starts
|
all the preceeding characters, the unqualified name starts
|
right after that dot.
|
right after that dot.
|
2. Otherwise, we may be debugging on a target where the compiler
|
2. Otherwise, we may be debugging on a target where the compiler
|
translates dots into "__". Search forward for double underscores,
|
translates dots into "__". Search forward for double underscores,
|
but stop searching when we hit an overloading suffix, which is
|
but stop searching when we hit an overloading suffix, which is
|
of the form "__" followed by digits. */
|
of the form "__" followed by digits. */
|
|
|
tmp = strrchr (name, '.');
|
tmp = strrchr (name, '.');
|
if (tmp != NULL)
|
if (tmp != NULL)
|
name = tmp + 1;
|
name = tmp + 1;
|
else
|
else
|
{
|
{
|
while ((tmp = strstr (name, "__")) != NULL)
|
while ((tmp = strstr (name, "__")) != NULL)
|
{
|
{
|
if (isdigit (tmp[2]))
|
if (isdigit (tmp[2]))
|
break;
|
break;
|
else
|
else
|
name = tmp + 2;
|
name = tmp + 2;
|
}
|
}
|
}
|
}
|
|
|
if (name[0] == 'Q')
|
if (name[0] == 'Q')
|
{
|
{
|
int v;
|
int v;
|
if (name[1] == 'U' || name[1] == 'W')
|
if (name[1] == 'U' || name[1] == 'W')
|
{
|
{
|
if (sscanf (name + 2, "%x", &v) != 1)
|
if (sscanf (name + 2, "%x", &v) != 1)
|
return name;
|
return name;
|
}
|
}
|
else
|
else
|
return name;
|
return name;
|
|
|
GROW_VECT (result, result_len, 16);
|
GROW_VECT (result, result_len, 16);
|
if (isascii (v) && isprint (v))
|
if (isascii (v) && isprint (v))
|
sprintf (result, "'%c'", v);
|
sprintf (result, "'%c'", v);
|
else if (name[1] == 'U')
|
else if (name[1] == 'U')
|
sprintf (result, "[\"%02x\"]", v);
|
sprintf (result, "[\"%02x\"]", v);
|
else
|
else
|
sprintf (result, "[\"%04x\"]", v);
|
sprintf (result, "[\"%04x\"]", v);
|
|
|
return result;
|
return result;
|
}
|
}
|
else
|
else
|
{
|
{
|
tmp = strstr (name, "__");
|
tmp = strstr (name, "__");
|
if (tmp == NULL)
|
if (tmp == NULL)
|
tmp = strstr (name, "$");
|
tmp = strstr (name, "$");
|
if (tmp != NULL)
|
if (tmp != NULL)
|
{
|
{
|
GROW_VECT (result, result_len, tmp - name + 1);
|
GROW_VECT (result, result_len, tmp - name + 1);
|
strncpy (result, name, tmp - name);
|
strncpy (result, name, tmp - name);
|
result[tmp - name] = '\0';
|
result[tmp - name] = '\0';
|
return result;
|
return result;
|
}
|
}
|
|
|
return name;
|
return name;
|
}
|
}
|
}
|
}
|
|
|
static struct value *
|
static struct value *
|
evaluate_subexp (struct type *expect_type, struct expression *exp, int *pos,
|
evaluate_subexp (struct type *expect_type, struct expression *exp, int *pos,
|
enum noside noside)
|
enum noside noside)
|
{
|
{
|
return (*exp->language_defn->la_exp_desc->evaluate_exp)
|
return (*exp->language_defn->la_exp_desc->evaluate_exp)
|
(expect_type, exp, pos, noside);
|
(expect_type, exp, pos, noside);
|
}
|
}
|
|
|
/* Evaluate the subexpression of EXP starting at *POS as for
|
/* Evaluate the subexpression of EXP starting at *POS as for
|
evaluate_type, updating *POS to point just past the evaluated
|
evaluate_type, updating *POS to point just past the evaluated
|
expression. */
|
expression. */
|
|
|
static struct value *
|
static struct value *
|
evaluate_subexp_type (struct expression *exp, int *pos)
|
evaluate_subexp_type (struct expression *exp, int *pos)
|
{
|
{
|
return (*exp->language_defn->la_exp_desc->evaluate_exp)
|
return (*exp->language_defn->la_exp_desc->evaluate_exp)
|
(NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
|
(NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
|
}
|
}
|
|
|
/* If VAL is wrapped in an aligner or subtype wrapper, return the
|
/* If VAL is wrapped in an aligner or subtype wrapper, return the
|
value it wraps. */
|
value it wraps. */
|
|
|
static struct value *
|
static struct value *
|
unwrap_value (struct value *val)
|
unwrap_value (struct value *val)
|
{
|
{
|
struct type *type = ada_check_typedef (value_type (val));
|
struct type *type = ada_check_typedef (value_type (val));
|
if (ada_is_aligner_type (type))
|
if (ada_is_aligner_type (type))
|
{
|
{
|
struct value *v = value_struct_elt (&val, NULL, "F",
|
struct value *v = value_struct_elt (&val, NULL, "F",
|
NULL, "internal structure");
|
NULL, "internal structure");
|
struct type *val_type = ada_check_typedef (value_type (v));
|
struct type *val_type = ada_check_typedef (value_type (v));
|
if (ada_type_name (val_type) == NULL)
|
if (ada_type_name (val_type) == NULL)
|
TYPE_NAME (val_type) = ada_type_name (type);
|
TYPE_NAME (val_type) = ada_type_name (type);
|
|
|
return unwrap_value (v);
|
return unwrap_value (v);
|
}
|
}
|
else
|
else
|
{
|
{
|
struct type *raw_real_type =
|
struct type *raw_real_type =
|
ada_check_typedef (ada_get_base_type (type));
|
ada_check_typedef (ada_get_base_type (type));
|
|
|
if (type == raw_real_type)
|
if (type == raw_real_type)
|
return val;
|
return val;
|
|
|
return
|
return
|
coerce_unspec_val_to_type
|
coerce_unspec_val_to_type
|
(val, ada_to_fixed_type (raw_real_type, 0,
|
(val, ada_to_fixed_type (raw_real_type, 0,
|
VALUE_ADDRESS (val) + value_offset (val),
|
VALUE_ADDRESS (val) + value_offset (val),
|
NULL, 1));
|
NULL, 1));
|
}
|
}
|
}
|
}
|
|
|
static struct value *
|
static struct value *
|
cast_to_fixed (struct type *type, struct value *arg)
|
cast_to_fixed (struct type *type, struct value *arg)
|
{
|
{
|
LONGEST val;
|
LONGEST val;
|
|
|
if (type == value_type (arg))
|
if (type == value_type (arg))
|
return arg;
|
return arg;
|
else if (ada_is_fixed_point_type (value_type (arg)))
|
else if (ada_is_fixed_point_type (value_type (arg)))
|
val = ada_float_to_fixed (type,
|
val = ada_float_to_fixed (type,
|
ada_fixed_to_float (value_type (arg),
|
ada_fixed_to_float (value_type (arg),
|
value_as_long (arg)));
|
value_as_long (arg)));
|
else
|
else
|
{
|
{
|
DOUBLEST argd =
|
DOUBLEST argd =
|
value_as_double (value_cast (builtin_type_double, value_copy (arg)));
|
value_as_double (value_cast (builtin_type_double, value_copy (arg)));
|
val = ada_float_to_fixed (type, argd);
|
val = ada_float_to_fixed (type, argd);
|
}
|
}
|
|
|
return value_from_longest (type, val);
|
return value_from_longest (type, val);
|
}
|
}
|
|
|
static struct value *
|
static struct value *
|
cast_from_fixed_to_double (struct value *arg)
|
cast_from_fixed_to_double (struct value *arg)
|
{
|
{
|
DOUBLEST val = ada_fixed_to_float (value_type (arg),
|
DOUBLEST val = ada_fixed_to_float (value_type (arg),
|
value_as_long (arg));
|
value_as_long (arg));
|
return value_from_double (builtin_type_double, val);
|
return value_from_double (builtin_type_double, val);
|
}
|
}
|
|
|
/* Coerce VAL as necessary for assignment to an lval of type TYPE, and
|
/* Coerce VAL as necessary for assignment to an lval of type TYPE, and
|
return the converted value. */
|
return the converted value. */
|
|
|
static struct value *
|
static struct value *
|
coerce_for_assign (struct type *type, struct value *val)
|
coerce_for_assign (struct type *type, struct value *val)
|
{
|
{
|
struct type *type2 = value_type (val);
|
struct type *type2 = value_type (val);
|
if (type == type2)
|
if (type == type2)
|
return val;
|
return val;
|
|
|
type2 = ada_check_typedef (type2);
|
type2 = ada_check_typedef (type2);
|
type = ada_check_typedef (type);
|
type = ada_check_typedef (type);
|
|
|
if (TYPE_CODE (type2) == TYPE_CODE_PTR
|
if (TYPE_CODE (type2) == TYPE_CODE_PTR
|
&& TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
&& TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
{
|
{
|
val = ada_value_ind (val);
|
val = ada_value_ind (val);
|
type2 = value_type (val);
|
type2 = value_type (val);
|
}
|
}
|
|
|
if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
|
if (TYPE_CODE (type2) == TYPE_CODE_ARRAY
|
&& TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
&& TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
{
|
{
|
if (TYPE_LENGTH (type2) != TYPE_LENGTH (type)
|
if (TYPE_LENGTH (type2) != TYPE_LENGTH (type)
|
|| TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
|
|| TYPE_LENGTH (TYPE_TARGET_TYPE (type2))
|
!= TYPE_LENGTH (TYPE_TARGET_TYPE (type2)))
|
!= TYPE_LENGTH (TYPE_TARGET_TYPE (type2)))
|
error (_("Incompatible types in assignment"));
|
error (_("Incompatible types in assignment"));
|
deprecated_set_value_type (val, type);
|
deprecated_set_value_type (val, type);
|
}
|
}
|
return val;
|
return val;
|
}
|
}
|
|
|
static struct value *
|
static struct value *
|
ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
|
ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op)
|
{
|
{
|
struct value *val;
|
struct value *val;
|
struct type *type1, *type2;
|
struct type *type1, *type2;
|
LONGEST v, v1, v2;
|
LONGEST v, v1, v2;
|
|
|
arg1 = coerce_ref (arg1);
|
arg1 = coerce_ref (arg1);
|
arg2 = coerce_ref (arg2);
|
arg2 = coerce_ref (arg2);
|
type1 = base_type (ada_check_typedef (value_type (arg1)));
|
type1 = base_type (ada_check_typedef (value_type (arg1)));
|
type2 = base_type (ada_check_typedef (value_type (arg2)));
|
type2 = base_type (ada_check_typedef (value_type (arg2)));
|
|
|
if (TYPE_CODE (type1) != TYPE_CODE_INT
|
if (TYPE_CODE (type1) != TYPE_CODE_INT
|
|| TYPE_CODE (type2) != TYPE_CODE_INT)
|
|| TYPE_CODE (type2) != TYPE_CODE_INT)
|
return value_binop (arg1, arg2, op);
|
return value_binop (arg1, arg2, op);
|
|
|
switch (op)
|
switch (op)
|
{
|
{
|
case BINOP_MOD:
|
case BINOP_MOD:
|
case BINOP_DIV:
|
case BINOP_DIV:
|
case BINOP_REM:
|
case BINOP_REM:
|
break;
|
break;
|
default:
|
default:
|
return value_binop (arg1, arg2, op);
|
return value_binop (arg1, arg2, op);
|
}
|
}
|
|
|
v2 = value_as_long (arg2);
|
v2 = value_as_long (arg2);
|
if (v2 == 0)
|
if (v2 == 0)
|
error (_("second operand of %s must not be zero."), op_string (op));
|
error (_("second operand of %s must not be zero."), op_string (op));
|
|
|
if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
|
if (TYPE_UNSIGNED (type1) || op == BINOP_MOD)
|
return value_binop (arg1, arg2, op);
|
return value_binop (arg1, arg2, op);
|
|
|
v1 = value_as_long (arg1);
|
v1 = value_as_long (arg1);
|
switch (op)
|
switch (op)
|
{
|
{
|
case BINOP_DIV:
|
case BINOP_DIV:
|
v = v1 / v2;
|
v = v1 / v2;
|
if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
|
if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0)
|
v += v > 0 ? -1 : 1;
|
v += v > 0 ? -1 : 1;
|
break;
|
break;
|
case BINOP_REM:
|
case BINOP_REM:
|
v = v1 % v2;
|
v = v1 % v2;
|
if (v * v1 < 0)
|
if (v * v1 < 0)
|
v -= v2;
|
v -= v2;
|
break;
|
break;
|
default:
|
default:
|
/* Should not reach this point. */
|
/* Should not reach this point. */
|
v = 0;
|
v = 0;
|
}
|
}
|
|
|
val = allocate_value (type1);
|
val = allocate_value (type1);
|
store_unsigned_integer (value_contents_raw (val),
|
store_unsigned_integer (value_contents_raw (val),
|
TYPE_LENGTH (value_type (val)), v);
|
TYPE_LENGTH (value_type (val)), v);
|
return val;
|
return val;
|
}
|
}
|
|
|
static int
|
static int
|
ada_value_equal (struct value *arg1, struct value *arg2)
|
ada_value_equal (struct value *arg1, struct value *arg2)
|
{
|
{
|
if (ada_is_direct_array_type (value_type (arg1))
|
if (ada_is_direct_array_type (value_type (arg1))
|
|| ada_is_direct_array_type (value_type (arg2)))
|
|| ada_is_direct_array_type (value_type (arg2)))
|
{
|
{
|
/* Automatically dereference any array reference before
|
/* Automatically dereference any array reference before
|
we attempt to perform the comparison. */
|
we attempt to perform the comparison. */
|
arg1 = ada_coerce_ref (arg1);
|
arg1 = ada_coerce_ref (arg1);
|
arg2 = ada_coerce_ref (arg2);
|
arg2 = ada_coerce_ref (arg2);
|
|
|
arg1 = ada_coerce_to_simple_array (arg1);
|
arg1 = ada_coerce_to_simple_array (arg1);
|
arg2 = ada_coerce_to_simple_array (arg2);
|
arg2 = ada_coerce_to_simple_array (arg2);
|
if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
|
if (TYPE_CODE (value_type (arg1)) != TYPE_CODE_ARRAY
|
|| TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
|
|| TYPE_CODE (value_type (arg2)) != TYPE_CODE_ARRAY)
|
error (_("Attempt to compare array with non-array"));
|
error (_("Attempt to compare array with non-array"));
|
/* FIXME: The following works only for types whose
|
/* FIXME: The following works only for types whose
|
representations use all bits (no padding or undefined bits)
|
representations use all bits (no padding or undefined bits)
|
and do not have user-defined equality. */
|
and do not have user-defined equality. */
|
return
|
return
|
TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
|
TYPE_LENGTH (value_type (arg1)) == TYPE_LENGTH (value_type (arg2))
|
&& memcmp (value_contents (arg1), value_contents (arg2),
|
&& memcmp (value_contents (arg1), value_contents (arg2),
|
TYPE_LENGTH (value_type (arg1))) == 0;
|
TYPE_LENGTH (value_type (arg1))) == 0;
|
}
|
}
|
return value_equal (arg1, arg2);
|
return value_equal (arg1, arg2);
|
}
|
}
|
|
|
/* Total number of component associations in the aggregate starting at
|
/* Total number of component associations in the aggregate starting at
|
index PC in EXP. Assumes that index PC is the start of an
|
index PC in EXP. Assumes that index PC is the start of an
|
OP_AGGREGATE. */
|
OP_AGGREGATE. */
|
|
|
static int
|
static int
|
num_component_specs (struct expression *exp, int pc)
|
num_component_specs (struct expression *exp, int pc)
|
{
|
{
|
int n, m, i;
|
int n, m, i;
|
m = exp->elts[pc + 1].longconst;
|
m = exp->elts[pc + 1].longconst;
|
pc += 3;
|
pc += 3;
|
n = 0;
|
n = 0;
|
for (i = 0; i < m; i += 1)
|
for (i = 0; i < m; i += 1)
|
{
|
{
|
switch (exp->elts[pc].opcode)
|
switch (exp->elts[pc].opcode)
|
{
|
{
|
default:
|
default:
|
n += 1;
|
n += 1;
|
break;
|
break;
|
case OP_CHOICES:
|
case OP_CHOICES:
|
n += exp->elts[pc + 1].longconst;
|
n += exp->elts[pc + 1].longconst;
|
break;
|
break;
|
}
|
}
|
ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
|
ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP);
|
}
|
}
|
return n;
|
return n;
|
}
|
}
|
|
|
/* Assign the result of evaluating EXP starting at *POS to the INDEXth
|
/* Assign the result of evaluating EXP starting at *POS to the INDEXth
|
component of LHS (a simple array or a record), updating *POS past
|
component of LHS (a simple array or a record), updating *POS past
|
the expression, assuming that LHS is contained in CONTAINER. Does
|
the expression, assuming that LHS is contained in CONTAINER. Does
|
not modify the inferior's memory, nor does it modify LHS (unless
|
not modify the inferior's memory, nor does it modify LHS (unless
|
LHS == CONTAINER). */
|
LHS == CONTAINER). */
|
|
|
static void
|
static void
|
assign_component (struct value *container, struct value *lhs, LONGEST index,
|
assign_component (struct value *container, struct value *lhs, LONGEST index,
|
struct expression *exp, int *pos)
|
struct expression *exp, int *pos)
|
{
|
{
|
struct value *mark = value_mark ();
|
struct value *mark = value_mark ();
|
struct value *elt;
|
struct value *elt;
|
if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
|
if (TYPE_CODE (value_type (lhs)) == TYPE_CODE_ARRAY)
|
{
|
{
|
struct value *index_val = value_from_longest (builtin_type_int, index);
|
struct value *index_val = value_from_longest (builtin_type_int, index);
|
elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
|
elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val));
|
}
|
}
|
else
|
else
|
{
|
{
|
elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
|
elt = ada_index_struct_field (index, lhs, 0, value_type (lhs));
|
elt = ada_to_fixed_value (unwrap_value (elt));
|
elt = ada_to_fixed_value (unwrap_value (elt));
|
}
|
}
|
|
|
if (exp->elts[*pos].opcode == OP_AGGREGATE)
|
if (exp->elts[*pos].opcode == OP_AGGREGATE)
|
assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
|
assign_aggregate (container, elt, exp, pos, EVAL_NORMAL);
|
else
|
else
|
value_assign_to_component (container, elt,
|
value_assign_to_component (container, elt,
|
ada_evaluate_subexp (NULL, exp, pos,
|
ada_evaluate_subexp (NULL, exp, pos,
|
EVAL_NORMAL));
|
EVAL_NORMAL));
|
|
|
value_free_to_mark (mark);
|
value_free_to_mark (mark);
|
}
|
}
|
|
|
/* Assuming that LHS represents an lvalue having a record or array
|
/* Assuming that LHS represents an lvalue having a record or array
|
type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
|
type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
|
of that aggregate's value to LHS, advancing *POS past the
|
of that aggregate's value to LHS, advancing *POS past the
|
aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
|
aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
|
lvalue containing LHS (possibly LHS itself). Does not modify
|
lvalue containing LHS (possibly LHS itself). Does not modify
|
the inferior's memory, nor does it modify the contents of
|
the inferior's memory, nor does it modify the contents of
|
LHS (unless == CONTAINER). Returns the modified CONTAINER. */
|
LHS (unless == CONTAINER). Returns the modified CONTAINER. */
|
|
|
static struct value *
|
static struct value *
|
assign_aggregate (struct value *container,
|
assign_aggregate (struct value *container,
|
struct value *lhs, struct expression *exp,
|
struct value *lhs, struct expression *exp,
|
int *pos, enum noside noside)
|
int *pos, enum noside noside)
|
{
|
{
|
struct type *lhs_type;
|
struct type *lhs_type;
|
int n = exp->elts[*pos+1].longconst;
|
int n = exp->elts[*pos+1].longconst;
|
LONGEST low_index, high_index;
|
LONGEST low_index, high_index;
|
int num_specs;
|
int num_specs;
|
LONGEST *indices;
|
LONGEST *indices;
|
int max_indices, num_indices;
|
int max_indices, num_indices;
|
int is_array_aggregate;
|
int is_array_aggregate;
|
int i;
|
int i;
|
struct value *mark = value_mark ();
|
struct value *mark = value_mark ();
|
|
|
*pos += 3;
|
*pos += 3;
|
if (noside != EVAL_NORMAL)
|
if (noside != EVAL_NORMAL)
|
{
|
{
|
int i;
|
int i;
|
for (i = 0; i < n; i += 1)
|
for (i = 0; i < n; i += 1)
|
ada_evaluate_subexp (NULL, exp, pos, noside);
|
ada_evaluate_subexp (NULL, exp, pos, noside);
|
return container;
|
return container;
|
}
|
}
|
|
|
container = ada_coerce_ref (container);
|
container = ada_coerce_ref (container);
|
if (ada_is_direct_array_type (value_type (container)))
|
if (ada_is_direct_array_type (value_type (container)))
|
container = ada_coerce_to_simple_array (container);
|
container = ada_coerce_to_simple_array (container);
|
lhs = ada_coerce_ref (lhs);
|
lhs = ada_coerce_ref (lhs);
|
if (!deprecated_value_modifiable (lhs))
|
if (!deprecated_value_modifiable (lhs))
|
error (_("Left operand of assignment is not a modifiable lvalue."));
|
error (_("Left operand of assignment is not a modifiable lvalue."));
|
|
|
lhs_type = value_type (lhs);
|
lhs_type = value_type (lhs);
|
if (ada_is_direct_array_type (lhs_type))
|
if (ada_is_direct_array_type (lhs_type))
|
{
|
{
|
lhs = ada_coerce_to_simple_array (lhs);
|
lhs = ada_coerce_to_simple_array (lhs);
|
lhs_type = value_type (lhs);
|
lhs_type = value_type (lhs);
|
low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
|
low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type);
|
high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
|
high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type);
|
is_array_aggregate = 1;
|
is_array_aggregate = 1;
|
}
|
}
|
else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
|
else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT)
|
{
|
{
|
low_index = 0;
|
low_index = 0;
|
high_index = num_visible_fields (lhs_type) - 1;
|
high_index = num_visible_fields (lhs_type) - 1;
|
is_array_aggregate = 0;
|
is_array_aggregate = 0;
|
}
|
}
|
else
|
else
|
error (_("Left-hand side must be array or record."));
|
error (_("Left-hand side must be array or record."));
|
|
|
num_specs = num_component_specs (exp, *pos - 3);
|
num_specs = num_component_specs (exp, *pos - 3);
|
max_indices = 4 * num_specs + 4;
|
max_indices = 4 * num_specs + 4;
|
indices = alloca (max_indices * sizeof (indices[0]));
|
indices = alloca (max_indices * sizeof (indices[0]));
|
indices[0] = indices[1] = low_index - 1;
|
indices[0] = indices[1] = low_index - 1;
|
indices[2] = indices[3] = high_index + 1;
|
indices[2] = indices[3] = high_index + 1;
|
num_indices = 4;
|
num_indices = 4;
|
|
|
for (i = 0; i < n; i += 1)
|
for (i = 0; i < n; i += 1)
|
{
|
{
|
switch (exp->elts[*pos].opcode)
|
switch (exp->elts[*pos].opcode)
|
{
|
{
|
case OP_CHOICES:
|
case OP_CHOICES:
|
aggregate_assign_from_choices (container, lhs, exp, pos, indices,
|
aggregate_assign_from_choices (container, lhs, exp, pos, indices,
|
&num_indices, max_indices,
|
&num_indices, max_indices,
|
low_index, high_index);
|
low_index, high_index);
|
break;
|
break;
|
case OP_POSITIONAL:
|
case OP_POSITIONAL:
|
aggregate_assign_positional (container, lhs, exp, pos, indices,
|
aggregate_assign_positional (container, lhs, exp, pos, indices,
|
&num_indices, max_indices,
|
&num_indices, max_indices,
|
low_index, high_index);
|
low_index, high_index);
|
break;
|
break;
|
case OP_OTHERS:
|
case OP_OTHERS:
|
if (i != n-1)
|
if (i != n-1)
|
error (_("Misplaced 'others' clause"));
|
error (_("Misplaced 'others' clause"));
|
aggregate_assign_others (container, lhs, exp, pos, indices,
|
aggregate_assign_others (container, lhs, exp, pos, indices,
|
num_indices, low_index, high_index);
|
num_indices, low_index, high_index);
|
break;
|
break;
|
default:
|
default:
|
error (_("Internal error: bad aggregate clause"));
|
error (_("Internal error: bad aggregate clause"));
|
}
|
}
|
}
|
}
|
|
|
return container;
|
return container;
|
}
|
}
|
|
|
/* Assign into the component of LHS indexed by the OP_POSITIONAL
|
/* Assign into the component of LHS indexed by the OP_POSITIONAL
|
construct at *POS, updating *POS past the construct, given that
|
construct at *POS, updating *POS past the construct, given that
|
the positions are relative to lower bound LOW, where HIGH is the
|
the positions are relative to lower bound LOW, where HIGH is the
|
upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
|
upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
|
updating *NUM_INDICES as needed. CONTAINER is as for
|
updating *NUM_INDICES as needed. CONTAINER is as for
|
assign_aggregate. */
|
assign_aggregate. */
|
static void
|
static void
|
aggregate_assign_positional (struct value *container,
|
aggregate_assign_positional (struct value *container,
|
struct value *lhs, struct expression *exp,
|
struct value *lhs, struct expression *exp,
|
int *pos, LONGEST *indices, int *num_indices,
|
int *pos, LONGEST *indices, int *num_indices,
|
int max_indices, LONGEST low, LONGEST high)
|
int max_indices, LONGEST low, LONGEST high)
|
{
|
{
|
LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
|
LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low;
|
|
|
if (ind - 1 == high)
|
if (ind - 1 == high)
|
warning (_("Extra components in aggregate ignored."));
|
warning (_("Extra components in aggregate ignored."));
|
if (ind <= high)
|
if (ind <= high)
|
{
|
{
|
add_component_interval (ind, ind, indices, num_indices, max_indices);
|
add_component_interval (ind, ind, indices, num_indices, max_indices);
|
*pos += 3;
|
*pos += 3;
|
assign_component (container, lhs, ind, exp, pos);
|
assign_component (container, lhs, ind, exp, pos);
|
}
|
}
|
else
|
else
|
ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
|
ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
|
}
|
}
|
|
|
/* Assign into the components of LHS indexed by the OP_CHOICES
|
/* Assign into the components of LHS indexed by the OP_CHOICES
|
construct at *POS, updating *POS past the construct, given that
|
construct at *POS, updating *POS past the construct, given that
|
the allowable indices are LOW..HIGH. Record the indices assigned
|
the allowable indices are LOW..HIGH. Record the indices assigned
|
to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
|
to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
|
needed. CONTAINER is as for assign_aggregate. */
|
needed. CONTAINER is as for assign_aggregate. */
|
static void
|
static void
|
aggregate_assign_from_choices (struct value *container,
|
aggregate_assign_from_choices (struct value *container,
|
struct value *lhs, struct expression *exp,
|
struct value *lhs, struct expression *exp,
|
int *pos, LONGEST *indices, int *num_indices,
|
int *pos, LONGEST *indices, int *num_indices,
|
int max_indices, LONGEST low, LONGEST high)
|
int max_indices, LONGEST low, LONGEST high)
|
{
|
{
|
int j;
|
int j;
|
int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
|
int n_choices = longest_to_int (exp->elts[*pos+1].longconst);
|
int choice_pos, expr_pc;
|
int choice_pos, expr_pc;
|
int is_array = ada_is_direct_array_type (value_type (lhs));
|
int is_array = ada_is_direct_array_type (value_type (lhs));
|
|
|
choice_pos = *pos += 3;
|
choice_pos = *pos += 3;
|
|
|
for (j = 0; j < n_choices; j += 1)
|
for (j = 0; j < n_choices; j += 1)
|
ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
|
ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
|
expr_pc = *pos;
|
expr_pc = *pos;
|
ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
|
ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
|
|
|
for (j = 0; j < n_choices; j += 1)
|
for (j = 0; j < n_choices; j += 1)
|
{
|
{
|
LONGEST lower, upper;
|
LONGEST lower, upper;
|
enum exp_opcode op = exp->elts[choice_pos].opcode;
|
enum exp_opcode op = exp->elts[choice_pos].opcode;
|
if (op == OP_DISCRETE_RANGE)
|
if (op == OP_DISCRETE_RANGE)
|
{
|
{
|
choice_pos += 1;
|
choice_pos += 1;
|
lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
|
lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
|
EVAL_NORMAL));
|
EVAL_NORMAL));
|
upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
|
upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos,
|
EVAL_NORMAL));
|
EVAL_NORMAL));
|
}
|
}
|
else if (is_array)
|
else if (is_array)
|
{
|
{
|
lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
|
lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos,
|
EVAL_NORMAL));
|
EVAL_NORMAL));
|
upper = lower;
|
upper = lower;
|
}
|
}
|
else
|
else
|
{
|
{
|
int ind;
|
int ind;
|
char *name;
|
char *name;
|
switch (op)
|
switch (op)
|
{
|
{
|
case OP_NAME:
|
case OP_NAME:
|
name = &exp->elts[choice_pos + 2].string;
|
name = &exp->elts[choice_pos + 2].string;
|
break;
|
break;
|
case OP_VAR_VALUE:
|
case OP_VAR_VALUE:
|
name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
|
name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol);
|
break;
|
break;
|
default:
|
default:
|
error (_("Invalid record component association."));
|
error (_("Invalid record component association."));
|
}
|
}
|
ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
|
ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP);
|
ind = 0;
|
ind = 0;
|
if (! find_struct_field (name, value_type (lhs), 0,
|
if (! find_struct_field (name, value_type (lhs), 0,
|
NULL, NULL, NULL, NULL, &ind))
|
NULL, NULL, NULL, NULL, &ind))
|
error (_("Unknown component name: %s."), name);
|
error (_("Unknown component name: %s."), name);
|
lower = upper = ind;
|
lower = upper = ind;
|
}
|
}
|
|
|
if (lower <= upper && (lower < low || upper > high))
|
if (lower <= upper && (lower < low || upper > high))
|
error (_("Index in component association out of bounds."));
|
error (_("Index in component association out of bounds."));
|
|
|
add_component_interval (lower, upper, indices, num_indices,
|
add_component_interval (lower, upper, indices, num_indices,
|
max_indices);
|
max_indices);
|
while (lower <= upper)
|
while (lower <= upper)
|
{
|
{
|
int pos1;
|
int pos1;
|
pos1 = expr_pc;
|
pos1 = expr_pc;
|
assign_component (container, lhs, lower, exp, &pos1);
|
assign_component (container, lhs, lower, exp, &pos1);
|
lower += 1;
|
lower += 1;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* Assign the value of the expression in the OP_OTHERS construct in
|
/* Assign the value of the expression in the OP_OTHERS construct in
|
EXP at *POS into the components of LHS indexed from LOW .. HIGH that
|
EXP at *POS into the components of LHS indexed from LOW .. HIGH that
|
have not been previously assigned. The index intervals already assigned
|
have not been previously assigned. The index intervals already assigned
|
are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
|
are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
|
OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
|
OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
|
static void
|
static void
|
aggregate_assign_others (struct value *container,
|
aggregate_assign_others (struct value *container,
|
struct value *lhs, struct expression *exp,
|
struct value *lhs, struct expression *exp,
|
int *pos, LONGEST *indices, int num_indices,
|
int *pos, LONGEST *indices, int num_indices,
|
LONGEST low, LONGEST high)
|
LONGEST low, LONGEST high)
|
{
|
{
|
int i;
|
int i;
|
int expr_pc = *pos+1;
|
int expr_pc = *pos+1;
|
|
|
for (i = 0; i < num_indices - 2; i += 2)
|
for (i = 0; i < num_indices - 2; i += 2)
|
{
|
{
|
LONGEST ind;
|
LONGEST ind;
|
for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
|
for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1)
|
{
|
{
|
int pos;
|
int pos;
|
pos = expr_pc;
|
pos = expr_pc;
|
assign_component (container, lhs, ind, exp, &pos);
|
assign_component (container, lhs, ind, exp, &pos);
|
}
|
}
|
}
|
}
|
ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
|
ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP);
|
}
|
}
|
|
|
/* Add the interval [LOW .. HIGH] to the sorted set of intervals
|
/* Add the interval [LOW .. HIGH] to the sorted set of intervals
|
[ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
|
[ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
|
modifying *SIZE as needed. It is an error if *SIZE exceeds
|
modifying *SIZE as needed. It is an error if *SIZE exceeds
|
MAX_SIZE. The resulting intervals do not overlap. */
|
MAX_SIZE. The resulting intervals do not overlap. */
|
static void
|
static void
|
add_component_interval (LONGEST low, LONGEST high,
|
add_component_interval (LONGEST low, LONGEST high,
|
LONGEST* indices, int *size, int max_size)
|
LONGEST* indices, int *size, int max_size)
|
{
|
{
|
int i, j;
|
int i, j;
|
for (i = 0; i < *size; i += 2) {
|
for (i = 0; i < *size; i += 2) {
|
if (high >= indices[i] && low <= indices[i + 1])
|
if (high >= indices[i] && low <= indices[i + 1])
|
{
|
{
|
int kh;
|
int kh;
|
for (kh = i + 2; kh < *size; kh += 2)
|
for (kh = i + 2; kh < *size; kh += 2)
|
if (high < indices[kh])
|
if (high < indices[kh])
|
break;
|
break;
|
if (low < indices[i])
|
if (low < indices[i])
|
indices[i] = low;
|
indices[i] = low;
|
indices[i + 1] = indices[kh - 1];
|
indices[i + 1] = indices[kh - 1];
|
if (high > indices[i + 1])
|
if (high > indices[i + 1])
|
indices[i + 1] = high;
|
indices[i + 1] = high;
|
memcpy (indices + i + 2, indices + kh, *size - kh);
|
memcpy (indices + i + 2, indices + kh, *size - kh);
|
*size -= kh - i - 2;
|
*size -= kh - i - 2;
|
return;
|
return;
|
}
|
}
|
else if (high < indices[i])
|
else if (high < indices[i])
|
break;
|
break;
|
}
|
}
|
|
|
if (*size == max_size)
|
if (*size == max_size)
|
error (_("Internal error: miscounted aggregate components."));
|
error (_("Internal error: miscounted aggregate components."));
|
*size += 2;
|
*size += 2;
|
for (j = *size-1; j >= i+2; j -= 1)
|
for (j = *size-1; j >= i+2; j -= 1)
|
indices[j] = indices[j - 2];
|
indices[j] = indices[j - 2];
|
indices[i] = low;
|
indices[i] = low;
|
indices[i + 1] = high;
|
indices[i + 1] = high;
|
}
|
}
|
|
|
/* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
|
/* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
|
is different. */
|
is different. */
|
|
|
static struct value *
|
static struct value *
|
ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
|
ada_value_cast (struct type *type, struct value *arg2, enum noside noside)
|
{
|
{
|
if (type == ada_check_typedef (value_type (arg2)))
|
if (type == ada_check_typedef (value_type (arg2)))
|
return arg2;
|
return arg2;
|
|
|
if (ada_is_fixed_point_type (type))
|
if (ada_is_fixed_point_type (type))
|
return (cast_to_fixed (type, arg2));
|
return (cast_to_fixed (type, arg2));
|
|
|
if (ada_is_fixed_point_type (value_type (arg2)))
|
if (ada_is_fixed_point_type (value_type (arg2)))
|
return value_cast (type, cast_from_fixed_to_double (arg2));
|
return value_cast (type, cast_from_fixed_to_double (arg2));
|
|
|
return value_cast (type, arg2);
|
return value_cast (type, arg2);
|
}
|
}
|
|
|
static struct value *
|
static struct value *
|
ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
|
ada_evaluate_subexp (struct type *expect_type, struct expression *exp,
|
int *pos, enum noside noside)
|
int *pos, enum noside noside)
|
{
|
{
|
enum exp_opcode op;
|
enum exp_opcode op;
|
int tem, tem2, tem3;
|
int tem, tem2, tem3;
|
int pc;
|
int pc;
|
struct value *arg1 = NULL, *arg2 = NULL, *arg3;
|
struct value *arg1 = NULL, *arg2 = NULL, *arg3;
|
struct type *type;
|
struct type *type;
|
int nargs, oplen;
|
int nargs, oplen;
|
struct value **argvec;
|
struct value **argvec;
|
|
|
pc = *pos;
|
pc = *pos;
|
*pos += 1;
|
*pos += 1;
|
op = exp->elts[pc].opcode;
|
op = exp->elts[pc].opcode;
|
|
|
switch (op)
|
switch (op)
|
{
|
{
|
default:
|
default:
|
*pos -= 1;
|
*pos -= 1;
|
arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
|
arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside);
|
arg1 = unwrap_value (arg1);
|
arg1 = unwrap_value (arg1);
|
|
|
/* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
|
/* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
|
then we need to perform the conversion manually, because
|
then we need to perform the conversion manually, because
|
evaluate_subexp_standard doesn't do it. This conversion is
|
evaluate_subexp_standard doesn't do it. This conversion is
|
necessary in Ada because the different kinds of float/fixed
|
necessary in Ada because the different kinds of float/fixed
|
types in Ada have different representations.
|
types in Ada have different representations.
|
|
|
Similarly, we need to perform the conversion from OP_LONG
|
Similarly, we need to perform the conversion from OP_LONG
|
ourselves. */
|
ourselves. */
|
if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
|
if ((op == OP_DOUBLE || op == OP_LONG) && expect_type != NULL)
|
arg1 = ada_value_cast (expect_type, arg1, noside);
|
arg1 = ada_value_cast (expect_type, arg1, noside);
|
|
|
return arg1;
|
return arg1;
|
|
|
case OP_STRING:
|
case OP_STRING:
|
{
|
{
|
struct value *result;
|
struct value *result;
|
*pos -= 1;
|
*pos -= 1;
|
result = evaluate_subexp_standard (expect_type, exp, pos, noside);
|
result = evaluate_subexp_standard (expect_type, exp, pos, noside);
|
/* The result type will have code OP_STRING, bashed there from
|
/* The result type will have code OP_STRING, bashed there from
|
OP_ARRAY. Bash it back. */
|
OP_ARRAY. Bash it back. */
|
if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
|
if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING)
|
TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
|
TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY;
|
return result;
|
return result;
|
}
|
}
|
|
|
case UNOP_CAST:
|
case UNOP_CAST:
|
(*pos) += 2;
|
(*pos) += 2;
|
type = exp->elts[pc + 1].type;
|
type = exp->elts[pc + 1].type;
|
arg1 = evaluate_subexp (type, exp, pos, noside);
|
arg1 = evaluate_subexp (type, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
arg1 = ada_value_cast (type, arg1, noside);
|
arg1 = ada_value_cast (type, arg1, noside);
|
return arg1;
|
return arg1;
|
|
|
case UNOP_QUAL:
|
case UNOP_QUAL:
|
(*pos) += 2;
|
(*pos) += 2;
|
type = exp->elts[pc + 1].type;
|
type = exp->elts[pc + 1].type;
|
return ada_evaluate_subexp (type, exp, pos, noside);
|
return ada_evaluate_subexp (type, exp, pos, noside);
|
|
|
case BINOP_ASSIGN:
|
case BINOP_ASSIGN:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (exp->elts[*pos].opcode == OP_AGGREGATE)
|
if (exp->elts[*pos].opcode == OP_AGGREGATE)
|
{
|
{
|
arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
|
arg1 = assign_aggregate (arg1, arg1, exp, pos, noside);
|
if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
|
return arg1;
|
return arg1;
|
return ada_value_assign (arg1, arg1);
|
return ada_value_assign (arg1, arg1);
|
}
|
}
|
arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
|
arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
|
if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS)
|
return arg1;
|
return arg1;
|
if (ada_is_fixed_point_type (value_type (arg1)))
|
if (ada_is_fixed_point_type (value_type (arg1)))
|
arg2 = cast_to_fixed (value_type (arg1), arg2);
|
arg2 = cast_to_fixed (value_type (arg1), arg2);
|
else if (ada_is_fixed_point_type (value_type (arg2)))
|
else if (ada_is_fixed_point_type (value_type (arg2)))
|
error
|
error
|
(_("Fixed-point values must be assigned to fixed-point variables"));
|
(_("Fixed-point values must be assigned to fixed-point variables"));
|
else
|
else
|
arg2 = coerce_for_assign (value_type (arg1), arg2);
|
arg2 = coerce_for_assign (value_type (arg1), arg2);
|
return ada_value_assign (arg1, arg2);
|
return ada_value_assign (arg1, arg2);
|
|
|
case BINOP_ADD:
|
case BINOP_ADD:
|
arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
|
arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
|
arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
|
arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
if ((ada_is_fixed_point_type (value_type (arg1))
|
if ((ada_is_fixed_point_type (value_type (arg1))
|
|| ada_is_fixed_point_type (value_type (arg2)))
|
|| ada_is_fixed_point_type (value_type (arg2)))
|
&& value_type (arg1) != value_type (arg2))
|
&& value_type (arg1) != value_type (arg2))
|
error (_("Operands of fixed-point addition must have the same type"));
|
error (_("Operands of fixed-point addition must have the same type"));
|
/* Do the addition, and cast the result to the type of the first
|
/* Do the addition, and cast the result to the type of the first
|
argument. We cannot cast the result to a reference type, so if
|
argument. We cannot cast the result to a reference type, so if
|
ARG1 is a reference type, find its underlying type. */
|
ARG1 is a reference type, find its underlying type. */
|
type = value_type (arg1);
|
type = value_type (arg1);
|
while (TYPE_CODE (type) == TYPE_CODE_REF)
|
while (TYPE_CODE (type) == TYPE_CODE_REF)
|
type = TYPE_TARGET_TYPE (type);
|
type = TYPE_TARGET_TYPE (type);
|
return value_cast (type, value_add (arg1, arg2));
|
return value_cast (type, value_add (arg1, arg2));
|
|
|
case BINOP_SUB:
|
case BINOP_SUB:
|
arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
|
arg1 = evaluate_subexp_with_coercion (exp, pos, noside);
|
arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
|
arg2 = evaluate_subexp_with_coercion (exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
if ((ada_is_fixed_point_type (value_type (arg1))
|
if ((ada_is_fixed_point_type (value_type (arg1))
|
|| ada_is_fixed_point_type (value_type (arg2)))
|
|| ada_is_fixed_point_type (value_type (arg2)))
|
&& value_type (arg1) != value_type (arg2))
|
&& value_type (arg1) != value_type (arg2))
|
error (_("Operands of fixed-point subtraction must have the same type"));
|
error (_("Operands of fixed-point subtraction must have the same type"));
|
/* Do the substraction, and cast the result to the type of the first
|
/* Do the substraction, and cast the result to the type of the first
|
argument. We cannot cast the result to a reference type, so if
|
argument. We cannot cast the result to a reference type, so if
|
ARG1 is a reference type, find its underlying type. */
|
ARG1 is a reference type, find its underlying type. */
|
type = value_type (arg1);
|
type = value_type (arg1);
|
while (TYPE_CODE (type) == TYPE_CODE_REF)
|
while (TYPE_CODE (type) == TYPE_CODE_REF)
|
type = TYPE_TARGET_TYPE (type);
|
type = TYPE_TARGET_TYPE (type);
|
return value_cast (type, value_sub (arg1, arg2));
|
return value_cast (type, value_sub (arg1, arg2));
|
|
|
case BINOP_MUL:
|
case BINOP_MUL:
|
case BINOP_DIV:
|
case BINOP_DIV:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS
|
&& (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD))
|
&& (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD))
|
return value_zero (value_type (arg1), not_lval);
|
return value_zero (value_type (arg1), not_lval);
|
else
|
else
|
{
|
{
|
if (ada_is_fixed_point_type (value_type (arg1)))
|
if (ada_is_fixed_point_type (value_type (arg1)))
|
arg1 = cast_from_fixed_to_double (arg1);
|
arg1 = cast_from_fixed_to_double (arg1);
|
if (ada_is_fixed_point_type (value_type (arg2)))
|
if (ada_is_fixed_point_type (value_type (arg2)))
|
arg2 = cast_from_fixed_to_double (arg2);
|
arg2 = cast_from_fixed_to_double (arg2);
|
return ada_value_binop (arg1, arg2, op);
|
return ada_value_binop (arg1, arg2, op);
|
}
|
}
|
|
|
case BINOP_REM:
|
case BINOP_REM:
|
case BINOP_MOD:
|
case BINOP_MOD:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS
|
&& (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD))
|
&& (op == BINOP_DIV || op == BINOP_REM || op == BINOP_MOD))
|
return value_zero (value_type (arg1), not_lval);
|
return value_zero (value_type (arg1), not_lval);
|
else
|
else
|
return ada_value_binop (arg1, arg2, op);
|
return ada_value_binop (arg1, arg2, op);
|
|
|
case BINOP_EQUAL:
|
case BINOP_EQUAL:
|
case BINOP_NOTEQUAL:
|
case BINOP_NOTEQUAL:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
|
arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
tem = 0;
|
tem = 0;
|
else
|
else
|
tem = ada_value_equal (arg1, arg2);
|
tem = ada_value_equal (arg1, arg2);
|
if (op == BINOP_NOTEQUAL)
|
if (op == BINOP_NOTEQUAL)
|
tem = !tem;
|
tem = !tem;
|
return value_from_longest (LA_BOOL_TYPE, (LONGEST) tem);
|
return value_from_longest (LA_BOOL_TYPE, (LONGEST) tem);
|
|
|
case UNOP_NEG:
|
case UNOP_NEG:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
else if (ada_is_fixed_point_type (value_type (arg1)))
|
else if (ada_is_fixed_point_type (value_type (arg1)))
|
return value_cast (value_type (arg1), value_neg (arg1));
|
return value_cast (value_type (arg1), value_neg (arg1));
|
else
|
else
|
return value_neg (arg1);
|
return value_neg (arg1);
|
|
|
case BINOP_LOGICAL_AND:
|
case BINOP_LOGICAL_AND:
|
case BINOP_LOGICAL_OR:
|
case BINOP_LOGICAL_OR:
|
case UNOP_LOGICAL_NOT:
|
case UNOP_LOGICAL_NOT:
|
{
|
{
|
struct value *val;
|
struct value *val;
|
|
|
*pos -= 1;
|
*pos -= 1;
|
val = evaluate_subexp_standard (expect_type, exp, pos, noside);
|
val = evaluate_subexp_standard (expect_type, exp, pos, noside);
|
return value_cast (LA_BOOL_TYPE, val);
|
return value_cast (LA_BOOL_TYPE, val);
|
}
|
}
|
|
|
case BINOP_BITWISE_AND:
|
case BINOP_BITWISE_AND:
|
case BINOP_BITWISE_IOR:
|
case BINOP_BITWISE_IOR:
|
case BINOP_BITWISE_XOR:
|
case BINOP_BITWISE_XOR:
|
{
|
{
|
struct value *val;
|
struct value *val;
|
|
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS);
|
*pos = pc;
|
*pos = pc;
|
val = evaluate_subexp_standard (expect_type, exp, pos, noside);
|
val = evaluate_subexp_standard (expect_type, exp, pos, noside);
|
|
|
return value_cast (value_type (arg1), val);
|
return value_cast (value_type (arg1), val);
|
}
|
}
|
|
|
case OP_VAR_VALUE:
|
case OP_VAR_VALUE:
|
*pos -= 1;
|
*pos -= 1;
|
|
|
/* Tagged types are a little special in the fact that the real type
|
/* Tagged types are a little special in the fact that the real type
|
is dynamic and can only be determined by inspecting the object
|
is dynamic and can only be determined by inspecting the object
|
value. So even if we're support to do an EVAL_AVOID_SIDE_EFFECTS
|
value. So even if we're support to do an EVAL_AVOID_SIDE_EFFECTS
|
evaluation, we force an EVAL_NORMAL evaluation for tagged types. */
|
evaluation, we force an EVAL_NORMAL evaluation for tagged types. */
|
if (noside == EVAL_AVOID_SIDE_EFFECTS
|
if (noside == EVAL_AVOID_SIDE_EFFECTS
|
&& ada_is_tagged_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol), 1))
|
&& ada_is_tagged_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol), 1))
|
noside = EVAL_NORMAL;
|
noside = EVAL_NORMAL;
|
|
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
{
|
{
|
*pos += 4;
|
*pos += 4;
|
goto nosideret;
|
goto nosideret;
|
}
|
}
|
else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
|
else if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN)
|
/* Only encountered when an unresolved symbol occurs in a
|
/* Only encountered when an unresolved symbol occurs in a
|
context other than a function call, in which case, it is
|
context other than a function call, in which case, it is
|
invalid. */
|
invalid. */
|
error (_("Unexpected unresolved symbol, %s, during evaluation"),
|
error (_("Unexpected unresolved symbol, %s, during evaluation"),
|
SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
|
SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol));
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
{
|
{
|
*pos += 4;
|
*pos += 4;
|
return value_zero
|
return value_zero
|
(to_static_fixed_type
|
(to_static_fixed_type
|
(static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
|
(static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol))),
|
not_lval);
|
not_lval);
|
}
|
}
|
else
|
else
|
{
|
{
|
arg1 =
|
arg1 =
|
unwrap_value (evaluate_subexp_standard
|
unwrap_value (evaluate_subexp_standard
|
(expect_type, exp, pos, noside));
|
(expect_type, exp, pos, noside));
|
return ada_to_fixed_value (arg1);
|
return ada_to_fixed_value (arg1);
|
}
|
}
|
|
|
case OP_FUNCALL:
|
case OP_FUNCALL:
|
(*pos) += 2;
|
(*pos) += 2;
|
|
|
/* Allocate arg vector, including space for the function to be
|
/* Allocate arg vector, including space for the function to be
|
called in argvec[0] and a terminating NULL. */
|
called in argvec[0] and a terminating NULL. */
|
nargs = longest_to_int (exp->elts[pc + 1].longconst);
|
nargs = longest_to_int (exp->elts[pc + 1].longconst);
|
argvec =
|
argvec =
|
(struct value **) alloca (sizeof (struct value *) * (nargs + 2));
|
(struct value **) alloca (sizeof (struct value *) * (nargs + 2));
|
|
|
if (exp->elts[*pos].opcode == OP_VAR_VALUE
|
if (exp->elts[*pos].opcode == OP_VAR_VALUE
|
&& SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
|
&& SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN)
|
error (_("Unexpected unresolved symbol, %s, during evaluation"),
|
error (_("Unexpected unresolved symbol, %s, during evaluation"),
|
SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
|
SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol));
|
else
|
else
|
{
|
{
|
for (tem = 0; tem <= nargs; tem += 1)
|
for (tem = 0; tem <= nargs; tem += 1)
|
argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
argvec[tem] = 0;
|
argvec[tem] = 0;
|
|
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
}
|
}
|
|
|
if (ada_is_packed_array_type (desc_base_type (value_type (argvec[0]))))
|
if (ada_is_packed_array_type (desc_base_type (value_type (argvec[0]))))
|
argvec[0] = ada_coerce_to_simple_array (argvec[0]);
|
argvec[0] = ada_coerce_to_simple_array (argvec[0]);
|
else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
|
else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF
|
|| (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
|
|| (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY
|
&& VALUE_LVAL (argvec[0]) == lval_memory))
|
&& VALUE_LVAL (argvec[0]) == lval_memory))
|
argvec[0] = value_addr (argvec[0]);
|
argvec[0] = value_addr (argvec[0]);
|
|
|
type = ada_check_typedef (value_type (argvec[0]));
|
type = ada_check_typedef (value_type (argvec[0]));
|
if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
{
|
{
|
switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
|
switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))))
|
{
|
{
|
case TYPE_CODE_FUNC:
|
case TYPE_CODE_FUNC:
|
type = ada_check_typedef (TYPE_TARGET_TYPE (type));
|
type = ada_check_typedef (TYPE_TARGET_TYPE (type));
|
break;
|
break;
|
case TYPE_CODE_ARRAY:
|
case TYPE_CODE_ARRAY:
|
break;
|
break;
|
case TYPE_CODE_STRUCT:
|
case TYPE_CODE_STRUCT:
|
if (noside != EVAL_AVOID_SIDE_EFFECTS)
|
if (noside != EVAL_AVOID_SIDE_EFFECTS)
|
argvec[0] = ada_value_ind (argvec[0]);
|
argvec[0] = ada_value_ind (argvec[0]);
|
type = ada_check_typedef (TYPE_TARGET_TYPE (type));
|
type = ada_check_typedef (TYPE_TARGET_TYPE (type));
|
break;
|
break;
|
default:
|
default:
|
error (_("cannot subscript or call something of type `%s'"),
|
error (_("cannot subscript or call something of type `%s'"),
|
ada_type_name (value_type (argvec[0])));
|
ada_type_name (value_type (argvec[0])));
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
case TYPE_CODE_FUNC:
|
case TYPE_CODE_FUNC:
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return allocate_value (TYPE_TARGET_TYPE (type));
|
return allocate_value (TYPE_TARGET_TYPE (type));
|
return call_function_by_hand (argvec[0], nargs, argvec + 1);
|
return call_function_by_hand (argvec[0], nargs, argvec + 1);
|
case TYPE_CODE_STRUCT:
|
case TYPE_CODE_STRUCT:
|
{
|
{
|
int arity;
|
int arity;
|
|
|
arity = ada_array_arity (type);
|
arity = ada_array_arity (type);
|
type = ada_array_element_type (type, nargs);
|
type = ada_array_element_type (type, nargs);
|
if (type == NULL)
|
if (type == NULL)
|
error (_("cannot subscript or call a record"));
|
error (_("cannot subscript or call a record"));
|
if (arity != nargs)
|
if (arity != nargs)
|
error (_("wrong number of subscripts; expecting %d"), arity);
|
error (_("wrong number of subscripts; expecting %d"), arity);
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return value_zero (ada_aligned_type (type), lval_memory);
|
return value_zero (ada_aligned_type (type), lval_memory);
|
return
|
return
|
unwrap_value (ada_value_subscript
|
unwrap_value (ada_value_subscript
|
(argvec[0], nargs, argvec + 1));
|
(argvec[0], nargs, argvec + 1));
|
}
|
}
|
case TYPE_CODE_ARRAY:
|
case TYPE_CODE_ARRAY:
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
{
|
{
|
type = ada_array_element_type (type, nargs);
|
type = ada_array_element_type (type, nargs);
|
if (type == NULL)
|
if (type == NULL)
|
error (_("element type of array unknown"));
|
error (_("element type of array unknown"));
|
else
|
else
|
return value_zero (ada_aligned_type (type), lval_memory);
|
return value_zero (ada_aligned_type (type), lval_memory);
|
}
|
}
|
return
|
return
|
unwrap_value (ada_value_subscript
|
unwrap_value (ada_value_subscript
|
(ada_coerce_to_simple_array (argvec[0]),
|
(ada_coerce_to_simple_array (argvec[0]),
|
nargs, argvec + 1));
|
nargs, argvec + 1));
|
case TYPE_CODE_PTR: /* Pointer to array */
|
case TYPE_CODE_PTR: /* Pointer to array */
|
type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
|
type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1);
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
{
|
{
|
type = ada_array_element_type (type, nargs);
|
type = ada_array_element_type (type, nargs);
|
if (type == NULL)
|
if (type == NULL)
|
error (_("element type of array unknown"));
|
error (_("element type of array unknown"));
|
else
|
else
|
return value_zero (ada_aligned_type (type), lval_memory);
|
return value_zero (ada_aligned_type (type), lval_memory);
|
}
|
}
|
return
|
return
|
unwrap_value (ada_value_ptr_subscript (argvec[0], type,
|
unwrap_value (ada_value_ptr_subscript (argvec[0], type,
|
nargs, argvec + 1));
|
nargs, argvec + 1));
|
|
|
default:
|
default:
|
error (_("Attempt to index or call something other than an "
|
error (_("Attempt to index or call something other than an "
|
"array or function"));
|
"array or function"));
|
}
|
}
|
|
|
case TERNOP_SLICE:
|
case TERNOP_SLICE:
|
{
|
{
|
struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
struct value *low_bound_val =
|
struct value *low_bound_val =
|
evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
struct value *high_bound_val =
|
struct value *high_bound_val =
|
evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
LONGEST low_bound;
|
LONGEST low_bound;
|
LONGEST high_bound;
|
LONGEST high_bound;
|
low_bound_val = coerce_ref (low_bound_val);
|
low_bound_val = coerce_ref (low_bound_val);
|
high_bound_val = coerce_ref (high_bound_val);
|
high_bound_val = coerce_ref (high_bound_val);
|
low_bound = pos_atr (low_bound_val);
|
low_bound = pos_atr (low_bound_val);
|
high_bound = pos_atr (high_bound_val);
|
high_bound = pos_atr (high_bound_val);
|
|
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
|
|
/* If this is a reference to an aligner type, then remove all
|
/* If this is a reference to an aligner type, then remove all
|
the aligners. */
|
the aligners. */
|
if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
|
if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
|
&& ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
|
&& ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array))))
|
TYPE_TARGET_TYPE (value_type (array)) =
|
TYPE_TARGET_TYPE (value_type (array)) =
|
ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
|
ada_aligned_type (TYPE_TARGET_TYPE (value_type (array)));
|
|
|
if (ada_is_packed_array_type (value_type (array)))
|
if (ada_is_packed_array_type (value_type (array)))
|
error (_("cannot slice a packed array"));
|
error (_("cannot slice a packed array"));
|
|
|
/* If this is a reference to an array or an array lvalue,
|
/* If this is a reference to an array or an array lvalue,
|
convert to a pointer. */
|
convert to a pointer. */
|
if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
|
if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF
|
|| (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
|
|| (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY
|
&& VALUE_LVAL (array) == lval_memory))
|
&& VALUE_LVAL (array) == lval_memory))
|
array = value_addr (array);
|
array = value_addr (array);
|
|
|
if (noside == EVAL_AVOID_SIDE_EFFECTS
|
if (noside == EVAL_AVOID_SIDE_EFFECTS
|
&& ada_is_array_descriptor_type (ada_check_typedef
|
&& ada_is_array_descriptor_type (ada_check_typedef
|
(value_type (array))))
|
(value_type (array))))
|
return empty_array (ada_type_of_array (array, 0), low_bound);
|
return empty_array (ada_type_of_array (array, 0), low_bound);
|
|
|
array = ada_coerce_to_simple_array_ptr (array);
|
array = ada_coerce_to_simple_array_ptr (array);
|
|
|
/* If we have more than one level of pointer indirection,
|
/* If we have more than one level of pointer indirection,
|
dereference the value until we get only one level. */
|
dereference the value until we get only one level. */
|
while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
|
while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR
|
&& (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
|
&& (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array)))
|
== TYPE_CODE_PTR))
|
== TYPE_CODE_PTR))
|
array = value_ind (array);
|
array = value_ind (array);
|
|
|
/* Make sure we really do have an array type before going further,
|
/* Make sure we really do have an array type before going further,
|
to avoid a SEGV when trying to get the index type or the target
|
to avoid a SEGV when trying to get the index type or the target
|
type later down the road if the debug info generated by
|
type later down the road if the debug info generated by
|
the compiler is incorrect or incomplete. */
|
the compiler is incorrect or incomplete. */
|
if (!ada_is_simple_array_type (value_type (array)))
|
if (!ada_is_simple_array_type (value_type (array)))
|
error (_("cannot take slice of non-array"));
|
error (_("cannot take slice of non-array"));
|
|
|
if (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR)
|
if (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR)
|
{
|
{
|
if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS)
|
return empty_array (TYPE_TARGET_TYPE (value_type (array)),
|
return empty_array (TYPE_TARGET_TYPE (value_type (array)),
|
low_bound);
|
low_bound);
|
else
|
else
|
{
|
{
|
struct type *arr_type0 =
|
struct type *arr_type0 =
|
to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array)),
|
to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array)),
|
NULL, 1);
|
NULL, 1);
|
return ada_value_slice_ptr (array, arr_type0,
|
return ada_value_slice_ptr (array, arr_type0,
|
longest_to_int (low_bound),
|
longest_to_int (low_bound),
|
longest_to_int (high_bound));
|
longest_to_int (high_bound));
|
}
|
}
|
}
|
}
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return array;
|
return array;
|
else if (high_bound < low_bound)
|
else if (high_bound < low_bound)
|
return empty_array (value_type (array), low_bound);
|
return empty_array (value_type (array), low_bound);
|
else
|
else
|
return ada_value_slice (array, longest_to_int (low_bound),
|
return ada_value_slice (array, longest_to_int (low_bound),
|
longest_to_int (high_bound));
|
longest_to_int (high_bound));
|
}
|
}
|
|
|
case UNOP_IN_RANGE:
|
case UNOP_IN_RANGE:
|
(*pos) += 2;
|
(*pos) += 2;
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
type = exp->elts[pc + 1].type;
|
type = exp->elts[pc + 1].type;
|
|
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
|
|
switch (TYPE_CODE (type))
|
switch (TYPE_CODE (type))
|
{
|
{
|
default:
|
default:
|
lim_warning (_("Membership test incompletely implemented; "
|
lim_warning (_("Membership test incompletely implemented; "
|
"always returns true"));
|
"always returns true"));
|
return value_from_longest (builtin_type_int, (LONGEST) 1);
|
return value_from_longest (builtin_type_int, (LONGEST) 1);
|
|
|
case TYPE_CODE_RANGE:
|
case TYPE_CODE_RANGE:
|
arg2 = value_from_longest (builtin_type_int, TYPE_LOW_BOUND (type));
|
arg2 = value_from_longest (builtin_type_int, TYPE_LOW_BOUND (type));
|
arg3 = value_from_longest (builtin_type_int,
|
arg3 = value_from_longest (builtin_type_int,
|
TYPE_HIGH_BOUND (type));
|
TYPE_HIGH_BOUND (type));
|
return
|
return
|
value_from_longest (builtin_type_int,
|
value_from_longest (builtin_type_int,
|
(value_less (arg1, arg3)
|
(value_less (arg1, arg3)
|
|| value_equal (arg1, arg3))
|
|| value_equal (arg1, arg3))
|
&& (value_less (arg2, arg1)
|
&& (value_less (arg2, arg1)
|
|| value_equal (arg2, arg1)));
|
|| value_equal (arg2, arg1)));
|
}
|
}
|
|
|
case BINOP_IN_BOUNDS:
|
case BINOP_IN_BOUNDS:
|
(*pos) += 2;
|
(*pos) += 2;
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
|
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
|
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return value_zero (builtin_type_int, not_lval);
|
return value_zero (builtin_type_int, not_lval);
|
|
|
tem = longest_to_int (exp->elts[pc + 1].longconst);
|
tem = longest_to_int (exp->elts[pc + 1].longconst);
|
|
|
if (tem < 1 || tem > ada_array_arity (value_type (arg2)))
|
if (tem < 1 || tem > ada_array_arity (value_type (arg2)))
|
error (_("invalid dimension number to 'range"));
|
error (_("invalid dimension number to 'range"));
|
|
|
arg3 = ada_array_bound (arg2, tem, 1);
|
arg3 = ada_array_bound (arg2, tem, 1);
|
arg2 = ada_array_bound (arg2, tem, 0);
|
arg2 = ada_array_bound (arg2, tem, 0);
|
|
|
return
|
return
|
value_from_longest (builtin_type_int,
|
value_from_longest (builtin_type_int,
|
(value_less (arg1, arg3)
|
(value_less (arg1, arg3)
|
|| value_equal (arg1, arg3))
|
|| value_equal (arg1, arg3))
|
&& (value_less (arg2, arg1)
|
&& (value_less (arg2, arg1)
|
|| value_equal (arg2, arg1)));
|
|| value_equal (arg2, arg1)));
|
|
|
case TERNOP_IN_RANGE:
|
case TERNOP_IN_RANGE:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
|
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
|
|
return
|
return
|
value_from_longest (builtin_type_int,
|
value_from_longest (builtin_type_int,
|
(value_less (arg1, arg3)
|
(value_less (arg1, arg3)
|
|| value_equal (arg1, arg3))
|
|| value_equal (arg1, arg3))
|
&& (value_less (arg2, arg1)
|
&& (value_less (arg2, arg1)
|
|| value_equal (arg2, arg1)));
|
|| value_equal (arg2, arg1)));
|
|
|
case OP_ATR_FIRST:
|
case OP_ATR_FIRST:
|
case OP_ATR_LAST:
|
case OP_ATR_LAST:
|
case OP_ATR_LENGTH:
|
case OP_ATR_LENGTH:
|
{
|
{
|
struct type *type_arg;
|
struct type *type_arg;
|
if (exp->elts[*pos].opcode == OP_TYPE)
|
if (exp->elts[*pos].opcode == OP_TYPE)
|
{
|
{
|
evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
|
evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
|
arg1 = NULL;
|
arg1 = NULL;
|
type_arg = exp->elts[pc + 2].type;
|
type_arg = exp->elts[pc + 2].type;
|
}
|
}
|
else
|
else
|
{
|
{
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
type_arg = NULL;
|
type_arg = NULL;
|
}
|
}
|
|
|
if (exp->elts[*pos].opcode != OP_LONG)
|
if (exp->elts[*pos].opcode != OP_LONG)
|
error (_("Invalid operand to '%s"), ada_attribute_name (op));
|
error (_("Invalid operand to '%s"), ada_attribute_name (op));
|
tem = longest_to_int (exp->elts[*pos + 2].longconst);
|
tem = longest_to_int (exp->elts[*pos + 2].longconst);
|
*pos += 4;
|
*pos += 4;
|
|
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
|
|
if (type_arg == NULL)
|
if (type_arg == NULL)
|
{
|
{
|
arg1 = ada_coerce_ref (arg1);
|
arg1 = ada_coerce_ref (arg1);
|
|
|
if (ada_is_packed_array_type (value_type (arg1)))
|
if (ada_is_packed_array_type (value_type (arg1)))
|
arg1 = ada_coerce_to_simple_array (arg1);
|
arg1 = ada_coerce_to_simple_array (arg1);
|
|
|
if (tem < 1 || tem > ada_array_arity (value_type (arg1)))
|
if (tem < 1 || tem > ada_array_arity (value_type (arg1)))
|
error (_("invalid dimension number to '%s"),
|
error (_("invalid dimension number to '%s"),
|
ada_attribute_name (op));
|
ada_attribute_name (op));
|
|
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
{
|
{
|
type = ada_index_type (value_type (arg1), tem);
|
type = ada_index_type (value_type (arg1), tem);
|
if (type == NULL)
|
if (type == NULL)
|
error
|
error
|
(_("attempt to take bound of something that is not an array"));
|
(_("attempt to take bound of something that is not an array"));
|
return allocate_value (type);
|
return allocate_value (type);
|
}
|
}
|
|
|
switch (op)
|
switch (op)
|
{
|
{
|
default: /* Should never happen. */
|
default: /* Should never happen. */
|
error (_("unexpected attribute encountered"));
|
error (_("unexpected attribute encountered"));
|
case OP_ATR_FIRST:
|
case OP_ATR_FIRST:
|
return ada_array_bound (arg1, tem, 0);
|
return ada_array_bound (arg1, tem, 0);
|
case OP_ATR_LAST:
|
case OP_ATR_LAST:
|
return ada_array_bound (arg1, tem, 1);
|
return ada_array_bound (arg1, tem, 1);
|
case OP_ATR_LENGTH:
|
case OP_ATR_LENGTH:
|
return ada_array_length (arg1, tem);
|
return ada_array_length (arg1, tem);
|
}
|
}
|
}
|
}
|
else if (discrete_type_p (type_arg))
|
else if (discrete_type_p (type_arg))
|
{
|
{
|
struct type *range_type;
|
struct type *range_type;
|
char *name = ada_type_name (type_arg);
|
char *name = ada_type_name (type_arg);
|
range_type = NULL;
|
range_type = NULL;
|
if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
|
if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM)
|
range_type =
|
range_type =
|
to_fixed_range_type (name, NULL, TYPE_OBJFILE (type_arg));
|
to_fixed_range_type (name, NULL, TYPE_OBJFILE (type_arg));
|
if (range_type == NULL)
|
if (range_type == NULL)
|
range_type = type_arg;
|
range_type = type_arg;
|
switch (op)
|
switch (op)
|
{
|
{
|
default:
|
default:
|
error (_("unexpected attribute encountered"));
|
error (_("unexpected attribute encountered"));
|
case OP_ATR_FIRST:
|
case OP_ATR_FIRST:
|
return discrete_type_low_bound (range_type);
|
return discrete_type_low_bound (range_type);
|
case OP_ATR_LAST:
|
case OP_ATR_LAST:
|
return discrete_type_high_bound (range_type);
|
return discrete_type_high_bound (range_type);
|
case OP_ATR_LENGTH:
|
case OP_ATR_LENGTH:
|
error (_("the 'length attribute applies only to array types"));
|
error (_("the 'length attribute applies only to array types"));
|
}
|
}
|
}
|
}
|
else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
|
else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT)
|
error (_("unimplemented type attribute"));
|
error (_("unimplemented type attribute"));
|
else
|
else
|
{
|
{
|
LONGEST low, high;
|
LONGEST low, high;
|
|
|
if (ada_is_packed_array_type (type_arg))
|
if (ada_is_packed_array_type (type_arg))
|
type_arg = decode_packed_array_type (type_arg);
|
type_arg = decode_packed_array_type (type_arg);
|
|
|
if (tem < 1 || tem > ada_array_arity (type_arg))
|
if (tem < 1 || tem > ada_array_arity (type_arg))
|
error (_("invalid dimension number to '%s"),
|
error (_("invalid dimension number to '%s"),
|
ada_attribute_name (op));
|
ada_attribute_name (op));
|
|
|
type = ada_index_type (type_arg, tem);
|
type = ada_index_type (type_arg, tem);
|
if (type == NULL)
|
if (type == NULL)
|
error
|
error
|
(_("attempt to take bound of something that is not an array"));
|
(_("attempt to take bound of something that is not an array"));
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return allocate_value (type);
|
return allocate_value (type);
|
|
|
switch (op)
|
switch (op)
|
{
|
{
|
default:
|
default:
|
error (_("unexpected attribute encountered"));
|
error (_("unexpected attribute encountered"));
|
case OP_ATR_FIRST:
|
case OP_ATR_FIRST:
|
low = ada_array_bound_from_type (type_arg, tem, 0, &type);
|
low = ada_array_bound_from_type (type_arg, tem, 0, &type);
|
return value_from_longest (type, low);
|
return value_from_longest (type, low);
|
case OP_ATR_LAST:
|
case OP_ATR_LAST:
|
high = ada_array_bound_from_type (type_arg, tem, 1, &type);
|
high = ada_array_bound_from_type (type_arg, tem, 1, &type);
|
return value_from_longest (type, high);
|
return value_from_longest (type, high);
|
case OP_ATR_LENGTH:
|
case OP_ATR_LENGTH:
|
low = ada_array_bound_from_type (type_arg, tem, 0, &type);
|
low = ada_array_bound_from_type (type_arg, tem, 0, &type);
|
high = ada_array_bound_from_type (type_arg, tem, 1, NULL);
|
high = ada_array_bound_from_type (type_arg, tem, 1, NULL);
|
return value_from_longest (type, high - low + 1);
|
return value_from_longest (type, high - low + 1);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
case OP_ATR_TAG:
|
case OP_ATR_TAG:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
|
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return value_zero (ada_tag_type (arg1), not_lval);
|
return value_zero (ada_tag_type (arg1), not_lval);
|
|
|
return ada_value_tag (arg1);
|
return ada_value_tag (arg1);
|
|
|
case OP_ATR_MIN:
|
case OP_ATR_MIN:
|
case OP_ATR_MAX:
|
case OP_ATR_MAX:
|
evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
|
evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return value_zero (value_type (arg1), not_lval);
|
return value_zero (value_type (arg1), not_lval);
|
else
|
else
|
return value_binop (arg1, arg2,
|
return value_binop (arg1, arg2,
|
op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
|
op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX);
|
|
|
case OP_ATR_MODULUS:
|
case OP_ATR_MODULUS:
|
{
|
{
|
struct type *type_arg = exp->elts[pc + 2].type;
|
struct type *type_arg = exp->elts[pc + 2].type;
|
evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
|
evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
|
|
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
|
|
if (!ada_is_modular_type (type_arg))
|
if (!ada_is_modular_type (type_arg))
|
error (_("'modulus must be applied to modular type"));
|
error (_("'modulus must be applied to modular type"));
|
|
|
return value_from_longest (TYPE_TARGET_TYPE (type_arg),
|
return value_from_longest (TYPE_TARGET_TYPE (type_arg),
|
ada_modulus (type_arg));
|
ada_modulus (type_arg));
|
}
|
}
|
|
|
|
|
case OP_ATR_POS:
|
case OP_ATR_POS:
|
evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
|
evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return value_zero (builtin_type_int, not_lval);
|
return value_zero (builtin_type_int, not_lval);
|
else
|
else
|
return value_pos_atr (arg1);
|
return value_pos_atr (arg1);
|
|
|
case OP_ATR_SIZE:
|
case OP_ATR_SIZE:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return value_zero (builtin_type_int, not_lval);
|
return value_zero (builtin_type_int, not_lval);
|
else
|
else
|
return value_from_longest (builtin_type_int,
|
return value_from_longest (builtin_type_int,
|
TARGET_CHAR_BIT
|
TARGET_CHAR_BIT
|
* TYPE_LENGTH (value_type (arg1)));
|
* TYPE_LENGTH (value_type (arg1)));
|
|
|
case OP_ATR_VAL:
|
case OP_ATR_VAL:
|
evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
|
evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
type = exp->elts[pc + 2].type;
|
type = exp->elts[pc + 2].type;
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return value_zero (type, not_lval);
|
return value_zero (type, not_lval);
|
else
|
else
|
return value_val_atr (type, arg1);
|
return value_val_atr (type, arg1);
|
|
|
case BINOP_EXP:
|
case BINOP_EXP:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return value_zero (value_type (arg1), not_lval);
|
return value_zero (value_type (arg1), not_lval);
|
else
|
else
|
return value_binop (arg1, arg2, op);
|
return value_binop (arg1, arg2, op);
|
|
|
case UNOP_PLUS:
|
case UNOP_PLUS:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
else
|
else
|
return arg1;
|
return arg1;
|
|
|
case UNOP_ABS:
|
case UNOP_ABS:
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
|
if (value_less (arg1, value_zero (value_type (arg1), not_lval)))
|
return value_neg (arg1);
|
return value_neg (arg1);
|
else
|
else
|
return arg1;
|
return arg1;
|
|
|
case UNOP_IND:
|
case UNOP_IND:
|
if (expect_type && TYPE_CODE (expect_type) == TYPE_CODE_PTR)
|
if (expect_type && TYPE_CODE (expect_type) == TYPE_CODE_PTR)
|
expect_type = TYPE_TARGET_TYPE (ada_check_typedef (expect_type));
|
expect_type = TYPE_TARGET_TYPE (ada_check_typedef (expect_type));
|
arg1 = evaluate_subexp (expect_type, exp, pos, noside);
|
arg1 = evaluate_subexp (expect_type, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
type = ada_check_typedef (value_type (arg1));
|
type = ada_check_typedef (value_type (arg1));
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
{
|
{
|
if (ada_is_array_descriptor_type (type))
|
if (ada_is_array_descriptor_type (type))
|
/* GDB allows dereferencing GNAT array descriptors. */
|
/* GDB allows dereferencing GNAT array descriptors. */
|
{
|
{
|
struct type *arrType = ada_type_of_array (arg1, 0);
|
struct type *arrType = ada_type_of_array (arg1, 0);
|
if (arrType == NULL)
|
if (arrType == NULL)
|
error (_("Attempt to dereference null array pointer."));
|
error (_("Attempt to dereference null array pointer."));
|
return value_at_lazy (arrType, 0);
|
return value_at_lazy (arrType, 0);
|
}
|
}
|
else if (TYPE_CODE (type) == TYPE_CODE_PTR
|
else if (TYPE_CODE (type) == TYPE_CODE_PTR
|
|| TYPE_CODE (type) == TYPE_CODE_REF
|
|| TYPE_CODE (type) == TYPE_CODE_REF
|
/* In C you can dereference an array to get the 1st elt. */
|
/* In C you can dereference an array to get the 1st elt. */
|
|| TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
|| TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
{
|
{
|
type = to_static_fixed_type
|
type = to_static_fixed_type
|
(ada_aligned_type
|
(ada_aligned_type
|
(ada_check_typedef (TYPE_TARGET_TYPE (type))));
|
(ada_check_typedef (TYPE_TARGET_TYPE (type))));
|
check_size (type);
|
check_size (type);
|
return value_zero (type, lval_memory);
|
return value_zero (type, lval_memory);
|
}
|
}
|
else if (TYPE_CODE (type) == TYPE_CODE_INT)
|
else if (TYPE_CODE (type) == TYPE_CODE_INT)
|
/* GDB allows dereferencing an int. */
|
/* GDB allows dereferencing an int. */
|
return value_zero (builtin_type_int, lval_memory);
|
return value_zero (builtin_type_int, lval_memory);
|
else
|
else
|
error (_("Attempt to take contents of a non-pointer value."));
|
error (_("Attempt to take contents of a non-pointer value."));
|
}
|
}
|
arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
|
arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */
|
type = ada_check_typedef (value_type (arg1));
|
type = ada_check_typedef (value_type (arg1));
|
|
|
if (ada_is_array_descriptor_type (type))
|
if (ada_is_array_descriptor_type (type))
|
/* GDB allows dereferencing GNAT array descriptors. */
|
/* GDB allows dereferencing GNAT array descriptors. */
|
return ada_coerce_to_simple_array (arg1);
|
return ada_coerce_to_simple_array (arg1);
|
else
|
else
|
return ada_value_ind (arg1);
|
return ada_value_ind (arg1);
|
|
|
case STRUCTOP_STRUCT:
|
case STRUCTOP_STRUCT:
|
tem = longest_to_int (exp->elts[pc + 1].longconst);
|
tem = longest_to_int (exp->elts[pc + 1].longconst);
|
(*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
|
(*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
{
|
{
|
struct type *type1 = value_type (arg1);
|
struct type *type1 = value_type (arg1);
|
if (ada_is_tagged_type (type1, 1))
|
if (ada_is_tagged_type (type1, 1))
|
{
|
{
|
type = ada_lookup_struct_elt_type (type1,
|
type = ada_lookup_struct_elt_type (type1,
|
&exp->elts[pc + 2].string,
|
&exp->elts[pc + 2].string,
|
1, 1, NULL);
|
1, 1, NULL);
|
if (type == NULL)
|
if (type == NULL)
|
/* In this case, we assume that the field COULD exist
|
/* In this case, we assume that the field COULD exist
|
in some extension of the type. Return an object of
|
in some extension of the type. Return an object of
|
"type" void, which will match any formal
|
"type" void, which will match any formal
|
(see ada_type_match). */
|
(see ada_type_match). */
|
return value_zero (builtin_type_void, lval_memory);
|
return value_zero (builtin_type_void, lval_memory);
|
}
|
}
|
else
|
else
|
type =
|
type =
|
ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
|
ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1,
|
0, NULL);
|
0, NULL);
|
|
|
return value_zero (ada_aligned_type (type), lval_memory);
|
return value_zero (ada_aligned_type (type), lval_memory);
|
}
|
}
|
else
|
else
|
return
|
return
|
ada_to_fixed_value (unwrap_value
|
ada_to_fixed_value (unwrap_value
|
(ada_value_struct_elt
|
(ada_value_struct_elt
|
(arg1, &exp->elts[pc + 2].string, 0)));
|
(arg1, &exp->elts[pc + 2].string, 0)));
|
case OP_TYPE:
|
case OP_TYPE:
|
/* The value is not supposed to be used. This is here to make it
|
/* The value is not supposed to be used. This is here to make it
|
easier to accommodate expressions that contain types. */
|
easier to accommodate expressions that contain types. */
|
(*pos) += 2;
|
(*pos) += 2;
|
if (noside == EVAL_SKIP)
|
if (noside == EVAL_SKIP)
|
goto nosideret;
|
goto nosideret;
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
return allocate_value (exp->elts[pc + 1].type);
|
return allocate_value (exp->elts[pc + 1].type);
|
else
|
else
|
error (_("Attempt to use a type name as an expression"));
|
error (_("Attempt to use a type name as an expression"));
|
|
|
case OP_AGGREGATE:
|
case OP_AGGREGATE:
|
case OP_CHOICES:
|
case OP_CHOICES:
|
case OP_OTHERS:
|
case OP_OTHERS:
|
case OP_DISCRETE_RANGE:
|
case OP_DISCRETE_RANGE:
|
case OP_POSITIONAL:
|
case OP_POSITIONAL:
|
case OP_NAME:
|
case OP_NAME:
|
if (noside == EVAL_NORMAL)
|
if (noside == EVAL_NORMAL)
|
switch (op)
|
switch (op)
|
{
|
{
|
case OP_NAME:
|
case OP_NAME:
|
error (_("Undefined name, ambiguous name, or renaming used in "
|
error (_("Undefined name, ambiguous name, or renaming used in "
|
"component association: %s."), &exp->elts[pc+2].string);
|
"component association: %s."), &exp->elts[pc+2].string);
|
case OP_AGGREGATE:
|
case OP_AGGREGATE:
|
error (_("Aggregates only allowed on the right of an assignment"));
|
error (_("Aggregates only allowed on the right of an assignment"));
|
default:
|
default:
|
internal_error (__FILE__, __LINE__, _("aggregate apparently mangled"));
|
internal_error (__FILE__, __LINE__, _("aggregate apparently mangled"));
|
}
|
}
|
|
|
ada_forward_operator_length (exp, pc, &oplen, &nargs);
|
ada_forward_operator_length (exp, pc, &oplen, &nargs);
|
*pos += oplen - 1;
|
*pos += oplen - 1;
|
for (tem = 0; tem < nargs; tem += 1)
|
for (tem = 0; tem < nargs; tem += 1)
|
ada_evaluate_subexp (NULL, exp, pos, noside);
|
ada_evaluate_subexp (NULL, exp, pos, noside);
|
goto nosideret;
|
goto nosideret;
|
}
|
}
|
|
|
nosideret:
|
nosideret:
|
return value_from_longest (builtin_type_long, (LONGEST) 1);
|
return value_from_longest (builtin_type_long, (LONGEST) 1);
|
}
|
}
|
|
|
|
|
/* Fixed point */
|
/* Fixed point */
|
|
|
/* If TYPE encodes an Ada fixed-point type, return the suffix of the
|
/* If TYPE encodes an Ada fixed-point type, return the suffix of the
|
type name that encodes the 'small and 'delta information.
|
type name that encodes the 'small and 'delta information.
|
Otherwise, return NULL. */
|
Otherwise, return NULL. */
|
|
|
static const char *
|
static const char *
|
fixed_type_info (struct type *type)
|
fixed_type_info (struct type *type)
|
{
|
{
|
const char *name = ada_type_name (type);
|
const char *name = ada_type_name (type);
|
enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
|
enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type);
|
|
|
if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
|
if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL)
|
{
|
{
|
const char *tail = strstr (name, "___XF_");
|
const char *tail = strstr (name, "___XF_");
|
if (tail == NULL)
|
if (tail == NULL)
|
return NULL;
|
return NULL;
|
else
|
else
|
return tail + 5;
|
return tail + 5;
|
}
|
}
|
else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
|
else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type)
|
return fixed_type_info (TYPE_TARGET_TYPE (type));
|
return fixed_type_info (TYPE_TARGET_TYPE (type));
|
else
|
else
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* Returns non-zero iff TYPE represents an Ada fixed-point type. */
|
/* Returns non-zero iff TYPE represents an Ada fixed-point type. */
|
|
|
int
|
int
|
ada_is_fixed_point_type (struct type *type)
|
ada_is_fixed_point_type (struct type *type)
|
{
|
{
|
return fixed_type_info (type) != NULL;
|
return fixed_type_info (type) != NULL;
|
}
|
}
|
|
|
/* Return non-zero iff TYPE represents a System.Address type. */
|
/* Return non-zero iff TYPE represents a System.Address type. */
|
|
|
int
|
int
|
ada_is_system_address_type (struct type *type)
|
ada_is_system_address_type (struct type *type)
|
{
|
{
|
return (TYPE_NAME (type)
|
return (TYPE_NAME (type)
|
&& strcmp (TYPE_NAME (type), "system__address") == 0);
|
&& strcmp (TYPE_NAME (type), "system__address") == 0);
|
}
|
}
|
|
|
/* Assuming that TYPE is the representation of an Ada fixed-point
|
/* Assuming that TYPE is the representation of an Ada fixed-point
|
type, return its delta, or -1 if the type is malformed and the
|
type, return its delta, or -1 if the type is malformed and the
|
delta cannot be determined. */
|
delta cannot be determined. */
|
|
|
DOUBLEST
|
DOUBLEST
|
ada_delta (struct type *type)
|
ada_delta (struct type *type)
|
{
|
{
|
const char *encoding = fixed_type_info (type);
|
const char *encoding = fixed_type_info (type);
|
long num, den;
|
long num, den;
|
|
|
if (sscanf (encoding, "_%ld_%ld", &num, &den) < 2)
|
if (sscanf (encoding, "_%ld_%ld", &num, &den) < 2)
|
return -1.0;
|
return -1.0;
|
else
|
else
|
return (DOUBLEST) num / (DOUBLEST) den;
|
return (DOUBLEST) num / (DOUBLEST) den;
|
}
|
}
|
|
|
/* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
|
/* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
|
factor ('SMALL value) associated with the type. */
|
factor ('SMALL value) associated with the type. */
|
|
|
static DOUBLEST
|
static DOUBLEST
|
scaling_factor (struct type *type)
|
scaling_factor (struct type *type)
|
{
|
{
|
const char *encoding = fixed_type_info (type);
|
const char *encoding = fixed_type_info (type);
|
unsigned long num0, den0, num1, den1;
|
unsigned long num0, den0, num1, den1;
|
int n;
|
int n;
|
|
|
n = sscanf (encoding, "_%lu_%lu_%lu_%lu", &num0, &den0, &num1, &den1);
|
n = sscanf (encoding, "_%lu_%lu_%lu_%lu", &num0, &den0, &num1, &den1);
|
|
|
if (n < 2)
|
if (n < 2)
|
return 1.0;
|
return 1.0;
|
else if (n == 4)
|
else if (n == 4)
|
return (DOUBLEST) num1 / (DOUBLEST) den1;
|
return (DOUBLEST) num1 / (DOUBLEST) den1;
|
else
|
else
|
return (DOUBLEST) num0 / (DOUBLEST) den0;
|
return (DOUBLEST) num0 / (DOUBLEST) den0;
|
}
|
}
|
|
|
|
|
/* Assuming that X is the representation of a value of fixed-point
|
/* Assuming that X is the representation of a value of fixed-point
|
type TYPE, return its floating-point equivalent. */
|
type TYPE, return its floating-point equivalent. */
|
|
|
DOUBLEST
|
DOUBLEST
|
ada_fixed_to_float (struct type *type, LONGEST x)
|
ada_fixed_to_float (struct type *type, LONGEST x)
|
{
|
{
|
return (DOUBLEST) x *scaling_factor (type);
|
return (DOUBLEST) x *scaling_factor (type);
|
}
|
}
|
|
|
/* The representation of a fixed-point value of type TYPE
|
/* The representation of a fixed-point value of type TYPE
|
corresponding to the value X. */
|
corresponding to the value X. */
|
|
|
LONGEST
|
LONGEST
|
ada_float_to_fixed (struct type *type, DOUBLEST x)
|
ada_float_to_fixed (struct type *type, DOUBLEST x)
|
{
|
{
|
return (LONGEST) (x / scaling_factor (type) + 0.5);
|
return (LONGEST) (x / scaling_factor (type) + 0.5);
|
}
|
}
|
|
|
|
|
/* VAX floating formats */
|
/* VAX floating formats */
|
|
|
/* Non-zero iff TYPE represents one of the special VAX floating-point
|
/* Non-zero iff TYPE represents one of the special VAX floating-point
|
types. */
|
types. */
|
|
|
int
|
int
|
ada_is_vax_floating_type (struct type *type)
|
ada_is_vax_floating_type (struct type *type)
|
{
|
{
|
int name_len =
|
int name_len =
|
(ada_type_name (type) == NULL) ? 0 : strlen (ada_type_name (type));
|
(ada_type_name (type) == NULL) ? 0 : strlen (ada_type_name (type));
|
return
|
return
|
name_len > 6
|
name_len > 6
|
&& (TYPE_CODE (type) == TYPE_CODE_INT
|
&& (TYPE_CODE (type) == TYPE_CODE_INT
|
|| TYPE_CODE (type) == TYPE_CODE_RANGE)
|
|| TYPE_CODE (type) == TYPE_CODE_RANGE)
|
&& strncmp (ada_type_name (type) + name_len - 6, "___XF", 5) == 0;
|
&& strncmp (ada_type_name (type) + name_len - 6, "___XF", 5) == 0;
|
}
|
}
|
|
|
/* The type of special VAX floating-point type this is, assuming
|
/* The type of special VAX floating-point type this is, assuming
|
ada_is_vax_floating_point. */
|
ada_is_vax_floating_point. */
|
|
|
int
|
int
|
ada_vax_float_type_suffix (struct type *type)
|
ada_vax_float_type_suffix (struct type *type)
|
{
|
{
|
return ada_type_name (type)[strlen (ada_type_name (type)) - 1];
|
return ada_type_name (type)[strlen (ada_type_name (type)) - 1];
|
}
|
}
|
|
|
/* A value representing the special debugging function that outputs
|
/* A value representing the special debugging function that outputs
|
VAX floating-point values of the type represented by TYPE. Assumes
|
VAX floating-point values of the type represented by TYPE. Assumes
|
ada_is_vax_floating_type (TYPE). */
|
ada_is_vax_floating_type (TYPE). */
|
|
|
struct value *
|
struct value *
|
ada_vax_float_print_function (struct type *type)
|
ada_vax_float_print_function (struct type *type)
|
{
|
{
|
switch (ada_vax_float_type_suffix (type))
|
switch (ada_vax_float_type_suffix (type))
|
{
|
{
|
case 'F':
|
case 'F':
|
return get_var_value ("DEBUG_STRING_F", 0);
|
return get_var_value ("DEBUG_STRING_F", 0);
|
case 'D':
|
case 'D':
|
return get_var_value ("DEBUG_STRING_D", 0);
|
return get_var_value ("DEBUG_STRING_D", 0);
|
case 'G':
|
case 'G':
|
return get_var_value ("DEBUG_STRING_G", 0);
|
return get_var_value ("DEBUG_STRING_G", 0);
|
default:
|
default:
|
error (_("invalid VAX floating-point type"));
|
error (_("invalid VAX floating-point type"));
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Range types */
|
/* Range types */
|
|
|
/* Scan STR beginning at position K for a discriminant name, and
|
/* Scan STR beginning at position K for a discriminant name, and
|
return the value of that discriminant field of DVAL in *PX. If
|
return the value of that discriminant field of DVAL in *PX. If
|
PNEW_K is not null, put the position of the character beyond the
|
PNEW_K is not null, put the position of the character beyond the
|
name scanned in *PNEW_K. Return 1 if successful; return 0 and do
|
name scanned in *PNEW_K. Return 1 if successful; return 0 and do
|
not alter *PX and *PNEW_K if unsuccessful. */
|
not alter *PX and *PNEW_K if unsuccessful. */
|
|
|
static int
|
static int
|
scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
|
scan_discrim_bound (char *str, int k, struct value *dval, LONGEST * px,
|
int *pnew_k)
|
int *pnew_k)
|
{
|
{
|
static char *bound_buffer = NULL;
|
static char *bound_buffer = NULL;
|
static size_t bound_buffer_len = 0;
|
static size_t bound_buffer_len = 0;
|
char *bound;
|
char *bound;
|
char *pend;
|
char *pend;
|
struct value *bound_val;
|
struct value *bound_val;
|
|
|
if (dval == NULL || str == NULL || str[k] == '\0')
|
if (dval == NULL || str == NULL || str[k] == '\0')
|
return 0;
|
return 0;
|
|
|
pend = strstr (str + k, "__");
|
pend = strstr (str + k, "__");
|
if (pend == NULL)
|
if (pend == NULL)
|
{
|
{
|
bound = str + k;
|
bound = str + k;
|
k += strlen (bound);
|
k += strlen (bound);
|
}
|
}
|
else
|
else
|
{
|
{
|
GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
|
GROW_VECT (bound_buffer, bound_buffer_len, pend - (str + k) + 1);
|
bound = bound_buffer;
|
bound = bound_buffer;
|
strncpy (bound_buffer, str + k, pend - (str + k));
|
strncpy (bound_buffer, str + k, pend - (str + k));
|
bound[pend - (str + k)] = '\0';
|
bound[pend - (str + k)] = '\0';
|
k = pend - str;
|
k = pend - str;
|
}
|
}
|
|
|
bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
|
bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval));
|
if (bound_val == NULL)
|
if (bound_val == NULL)
|
return 0;
|
return 0;
|
|
|
*px = value_as_long (bound_val);
|
*px = value_as_long (bound_val);
|
if (pnew_k != NULL)
|
if (pnew_k != NULL)
|
*pnew_k = k;
|
*pnew_k = k;
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* Value of variable named NAME in the current environment. If
|
/* Value of variable named NAME in the current environment. If
|
no such variable found, then if ERR_MSG is null, returns 0, and
|
no such variable found, then if ERR_MSG is null, returns 0, and
|
otherwise causes an error with message ERR_MSG. */
|
otherwise causes an error with message ERR_MSG. */
|
|
|
static struct value *
|
static struct value *
|
get_var_value (char *name, char *err_msg)
|
get_var_value (char *name, char *err_msg)
|
{
|
{
|
struct ada_symbol_info *syms;
|
struct ada_symbol_info *syms;
|
int nsyms;
|
int nsyms;
|
|
|
nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
|
nsyms = ada_lookup_symbol_list (name, get_selected_block (0), VAR_DOMAIN,
|
&syms);
|
&syms);
|
|
|
if (nsyms != 1)
|
if (nsyms != 1)
|
{
|
{
|
if (err_msg == NULL)
|
if (err_msg == NULL)
|
return 0;
|
return 0;
|
else
|
else
|
error (("%s"), err_msg);
|
error (("%s"), err_msg);
|
}
|
}
|
|
|
return value_of_variable (syms[0].sym, syms[0].block);
|
return value_of_variable (syms[0].sym, syms[0].block);
|
}
|
}
|
|
|
/* Value of integer variable named NAME in the current environment. If
|
/* Value of integer variable named NAME in the current environment. If
|
no such variable found, returns 0, and sets *FLAG to 0. If
|
no such variable found, returns 0, and sets *FLAG to 0. If
|
successful, sets *FLAG to 1. */
|
successful, sets *FLAG to 1. */
|
|
|
LONGEST
|
LONGEST
|
get_int_var_value (char *name, int *flag)
|
get_int_var_value (char *name, int *flag)
|
{
|
{
|
struct value *var_val = get_var_value (name, 0);
|
struct value *var_val = get_var_value (name, 0);
|
|
|
if (var_val == 0)
|
if (var_val == 0)
|
{
|
{
|
if (flag != NULL)
|
if (flag != NULL)
|
*flag = 0;
|
*flag = 0;
|
return 0;
|
return 0;
|
}
|
}
|
else
|
else
|
{
|
{
|
if (flag != NULL)
|
if (flag != NULL)
|
*flag = 1;
|
*flag = 1;
|
return value_as_long (var_val);
|
return value_as_long (var_val);
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Return a range type whose base type is that of the range type named
|
/* Return a range type whose base type is that of the range type named
|
NAME in the current environment, and whose bounds are calculated
|
NAME in the current environment, and whose bounds are calculated
|
from NAME according to the GNAT range encoding conventions.
|
from NAME according to the GNAT range encoding conventions.
|
Extract discriminant values, if needed, from DVAL. If a new type
|
Extract discriminant values, if needed, from DVAL. If a new type
|
must be created, allocate in OBJFILE's space. The bounds
|
must be created, allocate in OBJFILE's space. The bounds
|
information, in general, is encoded in NAME, the base type given in
|
information, in general, is encoded in NAME, the base type given in
|
the named range type. */
|
the named range type. */
|
|
|
static struct type *
|
static struct type *
|
to_fixed_range_type (char *name, struct value *dval, struct objfile *objfile)
|
to_fixed_range_type (char *name, struct value *dval, struct objfile *objfile)
|
{
|
{
|
struct type *raw_type = ada_find_any_type (name);
|
struct type *raw_type = ada_find_any_type (name);
|
struct type *base_type;
|
struct type *base_type;
|
char *subtype_info;
|
char *subtype_info;
|
|
|
if (raw_type == NULL)
|
if (raw_type == NULL)
|
base_type = builtin_type_int;
|
base_type = builtin_type_int;
|
else if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
|
else if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE)
|
base_type = TYPE_TARGET_TYPE (raw_type);
|
base_type = TYPE_TARGET_TYPE (raw_type);
|
else
|
else
|
base_type = raw_type;
|
base_type = raw_type;
|
|
|
subtype_info = strstr (name, "___XD");
|
subtype_info = strstr (name, "___XD");
|
if (subtype_info == NULL)
|
if (subtype_info == NULL)
|
return raw_type;
|
return raw_type;
|
else
|
else
|
{
|
{
|
static char *name_buf = NULL;
|
static char *name_buf = NULL;
|
static size_t name_len = 0;
|
static size_t name_len = 0;
|
int prefix_len = subtype_info - name;
|
int prefix_len = subtype_info - name;
|
LONGEST L, U;
|
LONGEST L, U;
|
struct type *type;
|
struct type *type;
|
char *bounds_str;
|
char *bounds_str;
|
int n;
|
int n;
|
|
|
GROW_VECT (name_buf, name_len, prefix_len + 5);
|
GROW_VECT (name_buf, name_len, prefix_len + 5);
|
strncpy (name_buf, name, prefix_len);
|
strncpy (name_buf, name, prefix_len);
|
name_buf[prefix_len] = '\0';
|
name_buf[prefix_len] = '\0';
|
|
|
subtype_info += 5;
|
subtype_info += 5;
|
bounds_str = strchr (subtype_info, '_');
|
bounds_str = strchr (subtype_info, '_');
|
n = 1;
|
n = 1;
|
|
|
if (*subtype_info == 'L')
|
if (*subtype_info == 'L')
|
{
|
{
|
if (!ada_scan_number (bounds_str, n, &L, &n)
|
if (!ada_scan_number (bounds_str, n, &L, &n)
|
&& !scan_discrim_bound (bounds_str, n, dval, &L, &n))
|
&& !scan_discrim_bound (bounds_str, n, dval, &L, &n))
|
return raw_type;
|
return raw_type;
|
if (bounds_str[n] == '_')
|
if (bounds_str[n] == '_')
|
n += 2;
|
n += 2;
|
else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
|
else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */
|
n += 1;
|
n += 1;
|
subtype_info += 1;
|
subtype_info += 1;
|
}
|
}
|
else
|
else
|
{
|
{
|
int ok;
|
int ok;
|
strcpy (name_buf + prefix_len, "___L");
|
strcpy (name_buf + prefix_len, "___L");
|
L = get_int_var_value (name_buf, &ok);
|
L = get_int_var_value (name_buf, &ok);
|
if (!ok)
|
if (!ok)
|
{
|
{
|
lim_warning (_("Unknown lower bound, using 1."));
|
lim_warning (_("Unknown lower bound, using 1."));
|
L = 1;
|
L = 1;
|
}
|
}
|
}
|
}
|
|
|
if (*subtype_info == 'U')
|
if (*subtype_info == 'U')
|
{
|
{
|
if (!ada_scan_number (bounds_str, n, &U, &n)
|
if (!ada_scan_number (bounds_str, n, &U, &n)
|
&& !scan_discrim_bound (bounds_str, n, dval, &U, &n))
|
&& !scan_discrim_bound (bounds_str, n, dval, &U, &n))
|
return raw_type;
|
return raw_type;
|
}
|
}
|
else
|
else
|
{
|
{
|
int ok;
|
int ok;
|
strcpy (name_buf + prefix_len, "___U");
|
strcpy (name_buf + prefix_len, "___U");
|
U = get_int_var_value (name_buf, &ok);
|
U = get_int_var_value (name_buf, &ok);
|
if (!ok)
|
if (!ok)
|
{
|
{
|
lim_warning (_("Unknown upper bound, using %ld."), (long) L);
|
lim_warning (_("Unknown upper bound, using %ld."), (long) L);
|
U = L;
|
U = L;
|
}
|
}
|
}
|
}
|
|
|
if (objfile == NULL)
|
if (objfile == NULL)
|
objfile = TYPE_OBJFILE (base_type);
|
objfile = TYPE_OBJFILE (base_type);
|
type = create_range_type (alloc_type (objfile), base_type, L, U);
|
type = create_range_type (alloc_type (objfile), base_type, L, U);
|
TYPE_NAME (type) = name;
|
TYPE_NAME (type) = name;
|
return type;
|
return type;
|
}
|
}
|
}
|
}
|
|
|
/* True iff NAME is the name of a range type. */
|
/* True iff NAME is the name of a range type. */
|
|
|
int
|
int
|
ada_is_range_type_name (const char *name)
|
ada_is_range_type_name (const char *name)
|
{
|
{
|
return (name != NULL && strstr (name, "___XD"));
|
return (name != NULL && strstr (name, "___XD"));
|
}
|
}
|
|
|
|
|
/* Modular types */
|
/* Modular types */
|
|
|
/* True iff TYPE is an Ada modular type. */
|
/* True iff TYPE is an Ada modular type. */
|
|
|
int
|
int
|
ada_is_modular_type (struct type *type)
|
ada_is_modular_type (struct type *type)
|
{
|
{
|
struct type *subranged_type = base_type (type);
|
struct type *subranged_type = base_type (type);
|
|
|
return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
|
return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE
|
&& TYPE_CODE (subranged_type) != TYPE_CODE_ENUM
|
&& TYPE_CODE (subranged_type) != TYPE_CODE_ENUM
|
&& TYPE_UNSIGNED (subranged_type));
|
&& TYPE_UNSIGNED (subranged_type));
|
}
|
}
|
|
|
/* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
|
/* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
|
|
|
ULONGEST
|
ULONGEST
|
ada_modulus (struct type * type)
|
ada_modulus (struct type * type)
|
{
|
{
|
return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
|
return (ULONGEST) TYPE_HIGH_BOUND (type) + 1;
|
}
|
}
|
|
|
|
|
/* Ada exception catchpoint support:
|
/* Ada exception catchpoint support:
|
---------------------------------
|
---------------------------------
|
|
|
We support 3 kinds of exception catchpoints:
|
We support 3 kinds of exception catchpoints:
|
. catchpoints on Ada exceptions
|
. catchpoints on Ada exceptions
|
. catchpoints on unhandled Ada exceptions
|
. catchpoints on unhandled Ada exceptions
|
. catchpoints on failed assertions
|
. catchpoints on failed assertions
|
|
|
Exceptions raised during failed assertions, or unhandled exceptions
|
Exceptions raised during failed assertions, or unhandled exceptions
|
could perfectly be caught with the general catchpoint on Ada exceptions.
|
could perfectly be caught with the general catchpoint on Ada exceptions.
|
However, we can easily differentiate these two special cases, and having
|
However, we can easily differentiate these two special cases, and having
|
the option to distinguish these two cases from the rest can be useful
|
the option to distinguish these two cases from the rest can be useful
|
to zero-in on certain situations.
|
to zero-in on certain situations.
|
|
|
Exception catchpoints are a specialized form of breakpoint,
|
Exception catchpoints are a specialized form of breakpoint,
|
since they rely on inserting breakpoints inside known routines
|
since they rely on inserting breakpoints inside known routines
|
of the GNAT runtime. The implementation therefore uses a standard
|
of the GNAT runtime. The implementation therefore uses a standard
|
breakpoint structure of the BP_BREAKPOINT type, but with its own set
|
breakpoint structure of the BP_BREAKPOINT type, but with its own set
|
of breakpoint_ops.
|
of breakpoint_ops.
|
|
|
Support in the runtime for exception catchpoints have been changed
|
Support in the runtime for exception catchpoints have been changed
|
a few times already, and these changes affect the implementation
|
a few times already, and these changes affect the implementation
|
of these catchpoints. In order to be able to support several
|
of these catchpoints. In order to be able to support several
|
variants of the runtime, we use a sniffer that will determine
|
variants of the runtime, we use a sniffer that will determine
|
the runtime variant used by the program being debugged.
|
the runtime variant used by the program being debugged.
|
|
|
At this time, we do not support the use of conditions on Ada exception
|
At this time, we do not support the use of conditions on Ada exception
|
catchpoints. The COND and COND_STRING fields are therefore set
|
catchpoints. The COND and COND_STRING fields are therefore set
|
to NULL (most of the time, see below).
|
to NULL (most of the time, see below).
|
|
|
Conditions where EXP_STRING, COND, and COND_STRING are used:
|
Conditions where EXP_STRING, COND, and COND_STRING are used:
|
|
|
When a user specifies the name of a specific exception in the case
|
When a user specifies the name of a specific exception in the case
|
of catchpoints on Ada exceptions, we store the name of that exception
|
of catchpoints on Ada exceptions, we store the name of that exception
|
in the EXP_STRING. We then translate this request into an actual
|
in the EXP_STRING. We then translate this request into an actual
|
condition stored in COND_STRING, and then parse it into an expression
|
condition stored in COND_STRING, and then parse it into an expression
|
stored in COND. */
|
stored in COND. */
|
|
|
/* The different types of catchpoints that we introduced for catching
|
/* The different types of catchpoints that we introduced for catching
|
Ada exceptions. */
|
Ada exceptions. */
|
|
|
enum exception_catchpoint_kind
|
enum exception_catchpoint_kind
|
{
|
{
|
ex_catch_exception,
|
ex_catch_exception,
|
ex_catch_exception_unhandled,
|
ex_catch_exception_unhandled,
|
ex_catch_assert
|
ex_catch_assert
|
};
|
};
|
|
|
typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
|
typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void);
|
|
|
/* A structure that describes how to support exception catchpoints
|
/* A structure that describes how to support exception catchpoints
|
for a given executable. */
|
for a given executable. */
|
|
|
struct exception_support_info
|
struct exception_support_info
|
{
|
{
|
/* The name of the symbol to break on in order to insert
|
/* The name of the symbol to break on in order to insert
|
a catchpoint on exceptions. */
|
a catchpoint on exceptions. */
|
const char *catch_exception_sym;
|
const char *catch_exception_sym;
|
|
|
/* The name of the symbol to break on in order to insert
|
/* The name of the symbol to break on in order to insert
|
a catchpoint on unhandled exceptions. */
|
a catchpoint on unhandled exceptions. */
|
const char *catch_exception_unhandled_sym;
|
const char *catch_exception_unhandled_sym;
|
|
|
/* The name of the symbol to break on in order to insert
|
/* The name of the symbol to break on in order to insert
|
a catchpoint on failed assertions. */
|
a catchpoint on failed assertions. */
|
const char *catch_assert_sym;
|
const char *catch_assert_sym;
|
|
|
/* Assuming that the inferior just triggered an unhandled exception
|
/* Assuming that the inferior just triggered an unhandled exception
|
catchpoint, this function is responsible for returning the address
|
catchpoint, this function is responsible for returning the address
|
in inferior memory where the name of that exception is stored.
|
in inferior memory where the name of that exception is stored.
|
Return zero if the address could not be computed. */
|
Return zero if the address could not be computed. */
|
ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
|
ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr;
|
};
|
};
|
|
|
static CORE_ADDR ada_unhandled_exception_name_addr (void);
|
static CORE_ADDR ada_unhandled_exception_name_addr (void);
|
static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
|
static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void);
|
|
|
/* The following exception support info structure describes how to
|
/* The following exception support info structure describes how to
|
implement exception catchpoints with the latest version of the
|
implement exception catchpoints with the latest version of the
|
Ada runtime (as of 2007-03-06). */
|
Ada runtime (as of 2007-03-06). */
|
|
|
static const struct exception_support_info default_exception_support_info =
|
static const struct exception_support_info default_exception_support_info =
|
{
|
{
|
"__gnat_debug_raise_exception", /* catch_exception_sym */
|
"__gnat_debug_raise_exception", /* catch_exception_sym */
|
"__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
|
"__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
|
"__gnat_debug_raise_assert_failure", /* catch_assert_sym */
|
"__gnat_debug_raise_assert_failure", /* catch_assert_sym */
|
ada_unhandled_exception_name_addr
|
ada_unhandled_exception_name_addr
|
};
|
};
|
|
|
/* The following exception support info structure describes how to
|
/* The following exception support info structure describes how to
|
implement exception catchpoints with a slightly older version
|
implement exception catchpoints with a slightly older version
|
of the Ada runtime. */
|
of the Ada runtime. */
|
|
|
static const struct exception_support_info exception_support_info_fallback =
|
static const struct exception_support_info exception_support_info_fallback =
|
{
|
{
|
"__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
|
"__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
|
"__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
|
"__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
|
"system__assertions__raise_assert_failure", /* catch_assert_sym */
|
"system__assertions__raise_assert_failure", /* catch_assert_sym */
|
ada_unhandled_exception_name_addr_from_raise
|
ada_unhandled_exception_name_addr_from_raise
|
};
|
};
|
|
|
/* For each executable, we sniff which exception info structure to use
|
/* For each executable, we sniff which exception info structure to use
|
and cache it in the following global variable. */
|
and cache it in the following global variable. */
|
|
|
static const struct exception_support_info *exception_info = NULL;
|
static const struct exception_support_info *exception_info = NULL;
|
|
|
/* Inspect the Ada runtime and determine which exception info structure
|
/* Inspect the Ada runtime and determine which exception info structure
|
should be used to provide support for exception catchpoints.
|
should be used to provide support for exception catchpoints.
|
|
|
This function will always set exception_info, or raise an error. */
|
This function will always set exception_info, or raise an error. */
|
|
|
static void
|
static void
|
ada_exception_support_info_sniffer (void)
|
ada_exception_support_info_sniffer (void)
|
{
|
{
|
struct symbol *sym;
|
struct symbol *sym;
|
|
|
/* If the exception info is already known, then no need to recompute it. */
|
/* If the exception info is already known, then no need to recompute it. */
|
if (exception_info != NULL)
|
if (exception_info != NULL)
|
return;
|
return;
|
|
|
/* Check the latest (default) exception support info. */
|
/* Check the latest (default) exception support info. */
|
sym = standard_lookup (default_exception_support_info.catch_exception_sym,
|
sym = standard_lookup (default_exception_support_info.catch_exception_sym,
|
NULL, VAR_DOMAIN);
|
NULL, VAR_DOMAIN);
|
if (sym != NULL)
|
if (sym != NULL)
|
{
|
{
|
exception_info = &default_exception_support_info;
|
exception_info = &default_exception_support_info;
|
return;
|
return;
|
}
|
}
|
|
|
/* Try our fallback exception suport info. */
|
/* Try our fallback exception suport info. */
|
sym = standard_lookup (exception_support_info_fallback.catch_exception_sym,
|
sym = standard_lookup (exception_support_info_fallback.catch_exception_sym,
|
NULL, VAR_DOMAIN);
|
NULL, VAR_DOMAIN);
|
if (sym != NULL)
|
if (sym != NULL)
|
{
|
{
|
exception_info = &exception_support_info_fallback;
|
exception_info = &exception_support_info_fallback;
|
return;
|
return;
|
}
|
}
|
|
|
/* Sometimes, it is normal for us to not be able to find the routine
|
/* Sometimes, it is normal for us to not be able to find the routine
|
we are looking for. This happens when the program is linked with
|
we are looking for. This happens when the program is linked with
|
the shared version of the GNAT runtime, and the program has not been
|
the shared version of the GNAT runtime, and the program has not been
|
started yet. Inform the user of these two possible causes if
|
started yet. Inform the user of these two possible causes if
|
applicable. */
|
applicable. */
|
|
|
if (ada_update_initial_language (language_unknown, NULL) != language_ada)
|
if (ada_update_initial_language (language_unknown, NULL) != language_ada)
|
error (_("Unable to insert catchpoint. Is this an Ada main program?"));
|
error (_("Unable to insert catchpoint. Is this an Ada main program?"));
|
|
|
/* If the symbol does not exist, then check that the program is
|
/* If the symbol does not exist, then check that the program is
|
already started, to make sure that shared libraries have been
|
already started, to make sure that shared libraries have been
|
loaded. If it is not started, this may mean that the symbol is
|
loaded. If it is not started, this may mean that the symbol is
|
in a shared library. */
|
in a shared library. */
|
|
|
if (ptid_get_pid (inferior_ptid) == 0)
|
if (ptid_get_pid (inferior_ptid) == 0)
|
error (_("Unable to insert catchpoint. Try to start the program first."));
|
error (_("Unable to insert catchpoint. Try to start the program first."));
|
|
|
/* At this point, we know that we are debugging an Ada program and
|
/* At this point, we know that we are debugging an Ada program and
|
that the inferior has been started, but we still are not able to
|
that the inferior has been started, but we still are not able to
|
find the run-time symbols. That can mean that we are in
|
find the run-time symbols. That can mean that we are in
|
configurable run time mode, or that a-except as been optimized
|
configurable run time mode, or that a-except as been optimized
|
out by the linker... In any case, at this point it is not worth
|
out by the linker... In any case, at this point it is not worth
|
supporting this feature. */
|
supporting this feature. */
|
|
|
error (_("Cannot insert catchpoints in this configuration."));
|
error (_("Cannot insert catchpoints in this configuration."));
|
}
|
}
|
|
|
/* An observer of "executable_changed" events.
|
/* An observer of "executable_changed" events.
|
Its role is to clear certain cached values that need to be recomputed
|
Its role is to clear certain cached values that need to be recomputed
|
each time a new executable is loaded by GDB. */
|
each time a new executable is loaded by GDB. */
|
|
|
static void
|
static void
|
ada_executable_changed_observer (void *unused)
|
ada_executable_changed_observer (void *unused)
|
{
|
{
|
/* If the executable changed, then it is possible that the Ada runtime
|
/* If the executable changed, then it is possible that the Ada runtime
|
is different. So we need to invalidate the exception support info
|
is different. So we need to invalidate the exception support info
|
cache. */
|
cache. */
|
exception_info = NULL;
|
exception_info = NULL;
|
}
|
}
|
|
|
/* Return the name of the function at PC, NULL if could not find it.
|
/* Return the name of the function at PC, NULL if could not find it.
|
This function only checks the debugging information, not the symbol
|
This function only checks the debugging information, not the symbol
|
table. */
|
table. */
|
|
|
static char *
|
static char *
|
function_name_from_pc (CORE_ADDR pc)
|
function_name_from_pc (CORE_ADDR pc)
|
{
|
{
|
char *func_name;
|
char *func_name;
|
|
|
if (!find_pc_partial_function (pc, &func_name, NULL, NULL))
|
if (!find_pc_partial_function (pc, &func_name, NULL, NULL))
|
return NULL;
|
return NULL;
|
|
|
return func_name;
|
return func_name;
|
}
|
}
|
|
|
/* True iff FRAME is very likely to be that of a function that is
|
/* True iff FRAME is very likely to be that of a function that is
|
part of the runtime system. This is all very heuristic, but is
|
part of the runtime system. This is all very heuristic, but is
|
intended to be used as advice as to what frames are uninteresting
|
intended to be used as advice as to what frames are uninteresting
|
to most users. */
|
to most users. */
|
|
|
static int
|
static int
|
is_known_support_routine (struct frame_info *frame)
|
is_known_support_routine (struct frame_info *frame)
|
{
|
{
|
struct symtab_and_line sal;
|
struct symtab_and_line sal;
|
char *func_name;
|
char *func_name;
|
int i;
|
int i;
|
|
|
/* If this code does not have any debugging information (no symtab),
|
/* If this code does not have any debugging information (no symtab),
|
This cannot be any user code. */
|
This cannot be any user code. */
|
|
|
find_frame_sal (frame, &sal);
|
find_frame_sal (frame, &sal);
|
if (sal.symtab == NULL)
|
if (sal.symtab == NULL)
|
return 1;
|
return 1;
|
|
|
/* If there is a symtab, but the associated source file cannot be
|
/* If there is a symtab, but the associated source file cannot be
|
located, then assume this is not user code: Selecting a frame
|
located, then assume this is not user code: Selecting a frame
|
for which we cannot display the code would not be very helpful
|
for which we cannot display the code would not be very helpful
|
for the user. This should also take care of case such as VxWorks
|
for the user. This should also take care of case such as VxWorks
|
where the kernel has some debugging info provided for a few units. */
|
where the kernel has some debugging info provided for a few units. */
|
|
|
if (symtab_to_fullname (sal.symtab) == NULL)
|
if (symtab_to_fullname (sal.symtab) == NULL)
|
return 1;
|
return 1;
|
|
|
/* Check the unit filename againt the Ada runtime file naming.
|
/* Check the unit filename againt the Ada runtime file naming.
|
We also check the name of the objfile against the name of some
|
We also check the name of the objfile against the name of some
|
known system libraries that sometimes come with debugging info
|
known system libraries that sometimes come with debugging info
|
too. */
|
too. */
|
|
|
for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
|
for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1)
|
{
|
{
|
re_comp (known_runtime_file_name_patterns[i]);
|
re_comp (known_runtime_file_name_patterns[i]);
|
if (re_exec (sal.symtab->filename))
|
if (re_exec (sal.symtab->filename))
|
return 1;
|
return 1;
|
if (sal.symtab->objfile != NULL
|
if (sal.symtab->objfile != NULL
|
&& re_exec (sal.symtab->objfile->name))
|
&& re_exec (sal.symtab->objfile->name))
|
return 1;
|
return 1;
|
}
|
}
|
|
|
/* Check whether the function is a GNAT-generated entity. */
|
/* Check whether the function is a GNAT-generated entity. */
|
|
|
func_name = function_name_from_pc (get_frame_address_in_block (frame));
|
func_name = function_name_from_pc (get_frame_address_in_block (frame));
|
if (func_name == NULL)
|
if (func_name == NULL)
|
return 1;
|
return 1;
|
|
|
for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
|
for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1)
|
{
|
{
|
re_comp (known_auxiliary_function_name_patterns[i]);
|
re_comp (known_auxiliary_function_name_patterns[i]);
|
if (re_exec (func_name))
|
if (re_exec (func_name))
|
return 1;
|
return 1;
|
}
|
}
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Find the first frame that contains debugging information and that is not
|
/* Find the first frame that contains debugging information and that is not
|
part of the Ada run-time, starting from FI and moving upward. */
|
part of the Ada run-time, starting from FI and moving upward. */
|
|
|
static void
|
static void
|
ada_find_printable_frame (struct frame_info *fi)
|
ada_find_printable_frame (struct frame_info *fi)
|
{
|
{
|
for (; fi != NULL; fi = get_prev_frame (fi))
|
for (; fi != NULL; fi = get_prev_frame (fi))
|
{
|
{
|
if (!is_known_support_routine (fi))
|
if (!is_known_support_routine (fi))
|
{
|
{
|
select_frame (fi);
|
select_frame (fi);
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
}
|
}
|
|
|
/* Assuming that the inferior just triggered an unhandled exception
|
/* Assuming that the inferior just triggered an unhandled exception
|
catchpoint, return the address in inferior memory where the name
|
catchpoint, return the address in inferior memory where the name
|
of the exception is stored.
|
of the exception is stored.
|
|
|
Return zero if the address could not be computed. */
|
Return zero if the address could not be computed. */
|
|
|
static CORE_ADDR
|
static CORE_ADDR
|
ada_unhandled_exception_name_addr (void)
|
ada_unhandled_exception_name_addr (void)
|
{
|
{
|
return parse_and_eval_address ("e.full_name");
|
return parse_and_eval_address ("e.full_name");
|
}
|
}
|
|
|
/* Same as ada_unhandled_exception_name_addr, except that this function
|
/* Same as ada_unhandled_exception_name_addr, except that this function
|
should be used when the inferior uses an older version of the runtime,
|
should be used when the inferior uses an older version of the runtime,
|
where the exception name needs to be extracted from a specific frame
|
where the exception name needs to be extracted from a specific frame
|
several frames up in the callstack. */
|
several frames up in the callstack. */
|
|
|
static CORE_ADDR
|
static CORE_ADDR
|
ada_unhandled_exception_name_addr_from_raise (void)
|
ada_unhandled_exception_name_addr_from_raise (void)
|
{
|
{
|
int frame_level;
|
int frame_level;
|
struct frame_info *fi;
|
struct frame_info *fi;
|
|
|
/* To determine the name of this exception, we need to select
|
/* To determine the name of this exception, we need to select
|
the frame corresponding to RAISE_SYM_NAME. This frame is
|
the frame corresponding to RAISE_SYM_NAME. This frame is
|
at least 3 levels up, so we simply skip the first 3 frames
|
at least 3 levels up, so we simply skip the first 3 frames
|
without checking the name of their associated function. */
|
without checking the name of their associated function. */
|
fi = get_current_frame ();
|
fi = get_current_frame ();
|
for (frame_level = 0; frame_level < 3; frame_level += 1)
|
for (frame_level = 0; frame_level < 3; frame_level += 1)
|
if (fi != NULL)
|
if (fi != NULL)
|
fi = get_prev_frame (fi);
|
fi = get_prev_frame (fi);
|
|
|
while (fi != NULL)
|
while (fi != NULL)
|
{
|
{
|
const char *func_name =
|
const char *func_name =
|
function_name_from_pc (get_frame_address_in_block (fi));
|
function_name_from_pc (get_frame_address_in_block (fi));
|
if (func_name != NULL
|
if (func_name != NULL
|
&& strcmp (func_name, exception_info->catch_exception_sym) == 0)
|
&& strcmp (func_name, exception_info->catch_exception_sym) == 0)
|
break; /* We found the frame we were looking for... */
|
break; /* We found the frame we were looking for... */
|
fi = get_prev_frame (fi);
|
fi = get_prev_frame (fi);
|
}
|
}
|
|
|
if (fi == NULL)
|
if (fi == NULL)
|
return 0;
|
return 0;
|
|
|
select_frame (fi);
|
select_frame (fi);
|
return parse_and_eval_address ("id.full_name");
|
return parse_and_eval_address ("id.full_name");
|
}
|
}
|
|
|
/* Assuming the inferior just triggered an Ada exception catchpoint
|
/* Assuming the inferior just triggered an Ada exception catchpoint
|
(of any type), return the address in inferior memory where the name
|
(of any type), return the address in inferior memory where the name
|
of the exception is stored, if applicable.
|
of the exception is stored, if applicable.
|
|
|
Return zero if the address could not be computed, or if not relevant. */
|
Return zero if the address could not be computed, or if not relevant. */
|
|
|
static CORE_ADDR
|
static CORE_ADDR
|
ada_exception_name_addr_1 (enum exception_catchpoint_kind ex,
|
ada_exception_name_addr_1 (enum exception_catchpoint_kind ex,
|
struct breakpoint *b)
|
struct breakpoint *b)
|
{
|
{
|
switch (ex)
|
switch (ex)
|
{
|
{
|
case ex_catch_exception:
|
case ex_catch_exception:
|
return (parse_and_eval_address ("e.full_name"));
|
return (parse_and_eval_address ("e.full_name"));
|
break;
|
break;
|
|
|
case ex_catch_exception_unhandled:
|
case ex_catch_exception_unhandled:
|
return exception_info->unhandled_exception_name_addr ();
|
return exception_info->unhandled_exception_name_addr ();
|
break;
|
break;
|
|
|
case ex_catch_assert:
|
case ex_catch_assert:
|
return 0; /* Exception name is not relevant in this case. */
|
return 0; /* Exception name is not relevant in this case. */
|
break;
|
break;
|
|
|
default:
|
default:
|
internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
|
internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
|
break;
|
break;
|
}
|
}
|
|
|
return 0; /* Should never be reached. */
|
return 0; /* Should never be reached. */
|
}
|
}
|
|
|
/* Same as ada_exception_name_addr_1, except that it intercepts and contains
|
/* Same as ada_exception_name_addr_1, except that it intercepts and contains
|
any error that ada_exception_name_addr_1 might cause to be thrown.
|
any error that ada_exception_name_addr_1 might cause to be thrown.
|
When an error is intercepted, a warning with the error message is printed,
|
When an error is intercepted, a warning with the error message is printed,
|
and zero is returned. */
|
and zero is returned. */
|
|
|
static CORE_ADDR
|
static CORE_ADDR
|
ada_exception_name_addr (enum exception_catchpoint_kind ex,
|
ada_exception_name_addr (enum exception_catchpoint_kind ex,
|
struct breakpoint *b)
|
struct breakpoint *b)
|
{
|
{
|
struct gdb_exception e;
|
struct gdb_exception e;
|
CORE_ADDR result = 0;
|
CORE_ADDR result = 0;
|
|
|
TRY_CATCH (e, RETURN_MASK_ERROR)
|
TRY_CATCH (e, RETURN_MASK_ERROR)
|
{
|
{
|
result = ada_exception_name_addr_1 (ex, b);
|
result = ada_exception_name_addr_1 (ex, b);
|
}
|
}
|
|
|
if (e.reason < 0)
|
if (e.reason < 0)
|
{
|
{
|
warning (_("failed to get exception name: %s"), e.message);
|
warning (_("failed to get exception name: %s"), e.message);
|
return 0;
|
return 0;
|
}
|
}
|
|
|
return result;
|
return result;
|
}
|
}
|
|
|
/* Implement the PRINT_IT method in the breakpoint_ops structure
|
/* Implement the PRINT_IT method in the breakpoint_ops structure
|
for all exception catchpoint kinds. */
|
for all exception catchpoint kinds. */
|
|
|
static enum print_stop_action
|
static enum print_stop_action
|
print_it_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
|
print_it_exception (enum exception_catchpoint_kind ex, struct breakpoint *b)
|
{
|
{
|
const CORE_ADDR addr = ada_exception_name_addr (ex, b);
|
const CORE_ADDR addr = ada_exception_name_addr (ex, b);
|
char exception_name[256];
|
char exception_name[256];
|
|
|
if (addr != 0)
|
if (addr != 0)
|
{
|
{
|
read_memory (addr, exception_name, sizeof (exception_name) - 1);
|
read_memory (addr, exception_name, sizeof (exception_name) - 1);
|
exception_name [sizeof (exception_name) - 1] = '\0';
|
exception_name [sizeof (exception_name) - 1] = '\0';
|
}
|
}
|
|
|
ada_find_printable_frame (get_current_frame ());
|
ada_find_printable_frame (get_current_frame ());
|
|
|
annotate_catchpoint (b->number);
|
annotate_catchpoint (b->number);
|
switch (ex)
|
switch (ex)
|
{
|
{
|
case ex_catch_exception:
|
case ex_catch_exception:
|
if (addr != 0)
|
if (addr != 0)
|
printf_filtered (_("\nCatchpoint %d, %s at "),
|
printf_filtered (_("\nCatchpoint %d, %s at "),
|
b->number, exception_name);
|
b->number, exception_name);
|
else
|
else
|
printf_filtered (_("\nCatchpoint %d, exception at "), b->number);
|
printf_filtered (_("\nCatchpoint %d, exception at "), b->number);
|
break;
|
break;
|
case ex_catch_exception_unhandled:
|
case ex_catch_exception_unhandled:
|
if (addr != 0)
|
if (addr != 0)
|
printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
|
printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
|
b->number, exception_name);
|
b->number, exception_name);
|
else
|
else
|
printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
|
printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
|
b->number);
|
b->number);
|
break;
|
break;
|
case ex_catch_assert:
|
case ex_catch_assert:
|
printf_filtered (_("\nCatchpoint %d, failed assertion at "),
|
printf_filtered (_("\nCatchpoint %d, failed assertion at "),
|
b->number);
|
b->number);
|
break;
|
break;
|
}
|
}
|
|
|
return PRINT_SRC_AND_LOC;
|
return PRINT_SRC_AND_LOC;
|
}
|
}
|
|
|
/* Implement the PRINT_ONE method in the breakpoint_ops structure
|
/* Implement the PRINT_ONE method in the breakpoint_ops structure
|
for all exception catchpoint kinds. */
|
for all exception catchpoint kinds. */
|
|
|
static void
|
static void
|
print_one_exception (enum exception_catchpoint_kind ex,
|
print_one_exception (enum exception_catchpoint_kind ex,
|
struct breakpoint *b, CORE_ADDR *last_addr)
|
struct breakpoint *b, CORE_ADDR *last_addr)
|
{
|
{
|
if (addressprint)
|
if (addressprint)
|
{
|
{
|
annotate_field (4);
|
annotate_field (4);
|
ui_out_field_core_addr (uiout, "addr", b->loc->address);
|
ui_out_field_core_addr (uiout, "addr", b->loc->address);
|
}
|
}
|
|
|
annotate_field (5);
|
annotate_field (5);
|
*last_addr = b->loc->address;
|
*last_addr = b->loc->address;
|
switch (ex)
|
switch (ex)
|
{
|
{
|
case ex_catch_exception:
|
case ex_catch_exception:
|
if (b->exp_string != NULL)
|
if (b->exp_string != NULL)
|
{
|
{
|
char *msg = xstrprintf (_("`%s' Ada exception"), b->exp_string);
|
char *msg = xstrprintf (_("`%s' Ada exception"), b->exp_string);
|
|
|
ui_out_field_string (uiout, "what", msg);
|
ui_out_field_string (uiout, "what", msg);
|
xfree (msg);
|
xfree (msg);
|
}
|
}
|
else
|
else
|
ui_out_field_string (uiout, "what", "all Ada exceptions");
|
ui_out_field_string (uiout, "what", "all Ada exceptions");
|
|
|
break;
|
break;
|
|
|
case ex_catch_exception_unhandled:
|
case ex_catch_exception_unhandled:
|
ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
|
ui_out_field_string (uiout, "what", "unhandled Ada exceptions");
|
break;
|
break;
|
|
|
case ex_catch_assert:
|
case ex_catch_assert:
|
ui_out_field_string (uiout, "what", "failed Ada assertions");
|
ui_out_field_string (uiout, "what", "failed Ada assertions");
|
break;
|
break;
|
|
|
default:
|
default:
|
internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
|
internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
/* Implement the PRINT_MENTION method in the breakpoint_ops structure
|
/* Implement the PRINT_MENTION method in the breakpoint_ops structure
|
for all exception catchpoint kinds. */
|
for all exception catchpoint kinds. */
|
|
|
static void
|
static void
|
print_mention_exception (enum exception_catchpoint_kind ex,
|
print_mention_exception (enum exception_catchpoint_kind ex,
|
struct breakpoint *b)
|
struct breakpoint *b)
|
{
|
{
|
switch (ex)
|
switch (ex)
|
{
|
{
|
case ex_catch_exception:
|
case ex_catch_exception:
|
if (b->exp_string != NULL)
|
if (b->exp_string != NULL)
|
printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
|
printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
|
b->number, b->exp_string);
|
b->number, b->exp_string);
|
else
|
else
|
printf_filtered (_("Catchpoint %d: all Ada exceptions"), b->number);
|
printf_filtered (_("Catchpoint %d: all Ada exceptions"), b->number);
|
|
|
break;
|
break;
|
|
|
case ex_catch_exception_unhandled:
|
case ex_catch_exception_unhandled:
|
printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
|
printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
|
b->number);
|
b->number);
|
break;
|
break;
|
|
|
case ex_catch_assert:
|
case ex_catch_assert:
|
printf_filtered (_("Catchpoint %d: failed Ada assertions"), b->number);
|
printf_filtered (_("Catchpoint %d: failed Ada assertions"), b->number);
|
break;
|
break;
|
|
|
default:
|
default:
|
internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
|
internal_error (__FILE__, __LINE__, _("unexpected catchpoint type"));
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
/* Virtual table for "catch exception" breakpoints. */
|
/* Virtual table for "catch exception" breakpoints. */
|
|
|
static enum print_stop_action
|
static enum print_stop_action
|
print_it_catch_exception (struct breakpoint *b)
|
print_it_catch_exception (struct breakpoint *b)
|
{
|
{
|
return print_it_exception (ex_catch_exception, b);
|
return print_it_exception (ex_catch_exception, b);
|
}
|
}
|
|
|
static void
|
static void
|
print_one_catch_exception (struct breakpoint *b, CORE_ADDR *last_addr)
|
print_one_catch_exception (struct breakpoint *b, CORE_ADDR *last_addr)
|
{
|
{
|
print_one_exception (ex_catch_exception, b, last_addr);
|
print_one_exception (ex_catch_exception, b, last_addr);
|
}
|
}
|
|
|
static void
|
static void
|
print_mention_catch_exception (struct breakpoint *b)
|
print_mention_catch_exception (struct breakpoint *b)
|
{
|
{
|
print_mention_exception (ex_catch_exception, b);
|
print_mention_exception (ex_catch_exception, b);
|
}
|
}
|
|
|
static struct breakpoint_ops catch_exception_breakpoint_ops =
|
static struct breakpoint_ops catch_exception_breakpoint_ops =
|
{
|
{
|
print_it_catch_exception,
|
print_it_catch_exception,
|
print_one_catch_exception,
|
print_one_catch_exception,
|
print_mention_catch_exception
|
print_mention_catch_exception
|
};
|
};
|
|
|
/* Virtual table for "catch exception unhandled" breakpoints. */
|
/* Virtual table for "catch exception unhandled" breakpoints. */
|
|
|
static enum print_stop_action
|
static enum print_stop_action
|
print_it_catch_exception_unhandled (struct breakpoint *b)
|
print_it_catch_exception_unhandled (struct breakpoint *b)
|
{
|
{
|
return print_it_exception (ex_catch_exception_unhandled, b);
|
return print_it_exception (ex_catch_exception_unhandled, b);
|
}
|
}
|
|
|
static void
|
static void
|
print_one_catch_exception_unhandled (struct breakpoint *b, CORE_ADDR *last_addr)
|
print_one_catch_exception_unhandled (struct breakpoint *b, CORE_ADDR *last_addr)
|
{
|
{
|
print_one_exception (ex_catch_exception_unhandled, b, last_addr);
|
print_one_exception (ex_catch_exception_unhandled, b, last_addr);
|
}
|
}
|
|
|
static void
|
static void
|
print_mention_catch_exception_unhandled (struct breakpoint *b)
|
print_mention_catch_exception_unhandled (struct breakpoint *b)
|
{
|
{
|
print_mention_exception (ex_catch_exception_unhandled, b);
|
print_mention_exception (ex_catch_exception_unhandled, b);
|
}
|
}
|
|
|
static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops = {
|
static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops = {
|
print_it_catch_exception_unhandled,
|
print_it_catch_exception_unhandled,
|
print_one_catch_exception_unhandled,
|
print_one_catch_exception_unhandled,
|
print_mention_catch_exception_unhandled
|
print_mention_catch_exception_unhandled
|
};
|
};
|
|
|
/* Virtual table for "catch assert" breakpoints. */
|
/* Virtual table for "catch assert" breakpoints. */
|
|
|
static enum print_stop_action
|
static enum print_stop_action
|
print_it_catch_assert (struct breakpoint *b)
|
print_it_catch_assert (struct breakpoint *b)
|
{
|
{
|
return print_it_exception (ex_catch_assert, b);
|
return print_it_exception (ex_catch_assert, b);
|
}
|
}
|
|
|
static void
|
static void
|
print_one_catch_assert (struct breakpoint *b, CORE_ADDR *last_addr)
|
print_one_catch_assert (struct breakpoint *b, CORE_ADDR *last_addr)
|
{
|
{
|
print_one_exception (ex_catch_assert, b, last_addr);
|
print_one_exception (ex_catch_assert, b, last_addr);
|
}
|
}
|
|
|
static void
|
static void
|
print_mention_catch_assert (struct breakpoint *b)
|
print_mention_catch_assert (struct breakpoint *b)
|
{
|
{
|
print_mention_exception (ex_catch_assert, b);
|
print_mention_exception (ex_catch_assert, b);
|
}
|
}
|
|
|
static struct breakpoint_ops catch_assert_breakpoint_ops = {
|
static struct breakpoint_ops catch_assert_breakpoint_ops = {
|
print_it_catch_assert,
|
print_it_catch_assert,
|
print_one_catch_assert,
|
print_one_catch_assert,
|
print_mention_catch_assert
|
print_mention_catch_assert
|
};
|
};
|
|
|
/* Return non-zero if B is an Ada exception catchpoint. */
|
/* Return non-zero if B is an Ada exception catchpoint. */
|
|
|
int
|
int
|
ada_exception_catchpoint_p (struct breakpoint *b)
|
ada_exception_catchpoint_p (struct breakpoint *b)
|
{
|
{
|
return (b->ops == &catch_exception_breakpoint_ops
|
return (b->ops == &catch_exception_breakpoint_ops
|
|| b->ops == &catch_exception_unhandled_breakpoint_ops
|
|| b->ops == &catch_exception_unhandled_breakpoint_ops
|
|| b->ops == &catch_assert_breakpoint_ops);
|
|| b->ops == &catch_assert_breakpoint_ops);
|
}
|
}
|
|
|
/* Return a newly allocated copy of the first space-separated token
|
/* Return a newly allocated copy of the first space-separated token
|
in ARGSP, and then adjust ARGSP to point immediately after that
|
in ARGSP, and then adjust ARGSP to point immediately after that
|
token.
|
token.
|
|
|
Return NULL if ARGPS does not contain any more tokens. */
|
Return NULL if ARGPS does not contain any more tokens. */
|
|
|
static char *
|
static char *
|
ada_get_next_arg (char **argsp)
|
ada_get_next_arg (char **argsp)
|
{
|
{
|
char *args = *argsp;
|
char *args = *argsp;
|
char *end;
|
char *end;
|
char *result;
|
char *result;
|
|
|
/* Skip any leading white space. */
|
/* Skip any leading white space. */
|
|
|
while (isspace (*args))
|
while (isspace (*args))
|
args++;
|
args++;
|
|
|
if (args[0] == '\0')
|
if (args[0] == '\0')
|
return NULL; /* No more arguments. */
|
return NULL; /* No more arguments. */
|
|
|
/* Find the end of the current argument. */
|
/* Find the end of the current argument. */
|
|
|
end = args;
|
end = args;
|
while (*end != '\0' && !isspace (*end))
|
while (*end != '\0' && !isspace (*end))
|
end++;
|
end++;
|
|
|
/* Adjust ARGSP to point to the start of the next argument. */
|
/* Adjust ARGSP to point to the start of the next argument. */
|
|
|
*argsp = end;
|
*argsp = end;
|
|
|
/* Make a copy of the current argument and return it. */
|
/* Make a copy of the current argument and return it. */
|
|
|
result = xmalloc (end - args + 1);
|
result = xmalloc (end - args + 1);
|
strncpy (result, args, end - args);
|
strncpy (result, args, end - args);
|
result[end - args] = '\0';
|
result[end - args] = '\0';
|
|
|
return result;
|
return result;
|
}
|
}
|
|
|
/* Split the arguments specified in a "catch exception" command.
|
/* Split the arguments specified in a "catch exception" command.
|
Set EX to the appropriate catchpoint type.
|
Set EX to the appropriate catchpoint type.
|
Set EXP_STRING to the name of the specific exception if
|
Set EXP_STRING to the name of the specific exception if
|
specified by the user. */
|
specified by the user. */
|
|
|
static void
|
static void
|
catch_ada_exception_command_split (char *args,
|
catch_ada_exception_command_split (char *args,
|
enum exception_catchpoint_kind *ex,
|
enum exception_catchpoint_kind *ex,
|
char **exp_string)
|
char **exp_string)
|
{
|
{
|
struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
|
struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
|
char *exception_name;
|
char *exception_name;
|
|
|
exception_name = ada_get_next_arg (&args);
|
exception_name = ada_get_next_arg (&args);
|
make_cleanup (xfree, exception_name);
|
make_cleanup (xfree, exception_name);
|
|
|
/* Check that we do not have any more arguments. Anything else
|
/* Check that we do not have any more arguments. Anything else
|
is unexpected. */
|
is unexpected. */
|
|
|
while (isspace (*args))
|
while (isspace (*args))
|
args++;
|
args++;
|
|
|
if (args[0] != '\0')
|
if (args[0] != '\0')
|
error (_("Junk at end of expression"));
|
error (_("Junk at end of expression"));
|
|
|
discard_cleanups (old_chain);
|
discard_cleanups (old_chain);
|
|
|
if (exception_name == NULL)
|
if (exception_name == NULL)
|
{
|
{
|
/* Catch all exceptions. */
|
/* Catch all exceptions. */
|
*ex = ex_catch_exception;
|
*ex = ex_catch_exception;
|
*exp_string = NULL;
|
*exp_string = NULL;
|
}
|
}
|
else if (strcmp (exception_name, "unhandled") == 0)
|
else if (strcmp (exception_name, "unhandled") == 0)
|
{
|
{
|
/* Catch unhandled exceptions. */
|
/* Catch unhandled exceptions. */
|
*ex = ex_catch_exception_unhandled;
|
*ex = ex_catch_exception_unhandled;
|
*exp_string = NULL;
|
*exp_string = NULL;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Catch a specific exception. */
|
/* Catch a specific exception. */
|
*ex = ex_catch_exception;
|
*ex = ex_catch_exception;
|
*exp_string = exception_name;
|
*exp_string = exception_name;
|
}
|
}
|
}
|
}
|
|
|
/* Return the name of the symbol on which we should break in order to
|
/* Return the name of the symbol on which we should break in order to
|
implement a catchpoint of the EX kind. */
|
implement a catchpoint of the EX kind. */
|
|
|
static const char *
|
static const char *
|
ada_exception_sym_name (enum exception_catchpoint_kind ex)
|
ada_exception_sym_name (enum exception_catchpoint_kind ex)
|
{
|
{
|
gdb_assert (exception_info != NULL);
|
gdb_assert (exception_info != NULL);
|
|
|
switch (ex)
|
switch (ex)
|
{
|
{
|
case ex_catch_exception:
|
case ex_catch_exception:
|
return (exception_info->catch_exception_sym);
|
return (exception_info->catch_exception_sym);
|
break;
|
break;
|
case ex_catch_exception_unhandled:
|
case ex_catch_exception_unhandled:
|
return (exception_info->catch_exception_unhandled_sym);
|
return (exception_info->catch_exception_unhandled_sym);
|
break;
|
break;
|
case ex_catch_assert:
|
case ex_catch_assert:
|
return (exception_info->catch_assert_sym);
|
return (exception_info->catch_assert_sym);
|
break;
|
break;
|
default:
|
default:
|
internal_error (__FILE__, __LINE__,
|
internal_error (__FILE__, __LINE__,
|
_("unexpected catchpoint kind (%d)"), ex);
|
_("unexpected catchpoint kind (%d)"), ex);
|
}
|
}
|
}
|
}
|
|
|
/* Return the breakpoint ops "virtual table" used for catchpoints
|
/* Return the breakpoint ops "virtual table" used for catchpoints
|
of the EX kind. */
|
of the EX kind. */
|
|
|
static struct breakpoint_ops *
|
static struct breakpoint_ops *
|
ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex)
|
ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex)
|
{
|
{
|
switch (ex)
|
switch (ex)
|
{
|
{
|
case ex_catch_exception:
|
case ex_catch_exception:
|
return (&catch_exception_breakpoint_ops);
|
return (&catch_exception_breakpoint_ops);
|
break;
|
break;
|
case ex_catch_exception_unhandled:
|
case ex_catch_exception_unhandled:
|
return (&catch_exception_unhandled_breakpoint_ops);
|
return (&catch_exception_unhandled_breakpoint_ops);
|
break;
|
break;
|
case ex_catch_assert:
|
case ex_catch_assert:
|
return (&catch_assert_breakpoint_ops);
|
return (&catch_assert_breakpoint_ops);
|
break;
|
break;
|
default:
|
default:
|
internal_error (__FILE__, __LINE__,
|
internal_error (__FILE__, __LINE__,
|
_("unexpected catchpoint kind (%d)"), ex);
|
_("unexpected catchpoint kind (%d)"), ex);
|
}
|
}
|
}
|
}
|
|
|
/* Return the condition that will be used to match the current exception
|
/* Return the condition that will be used to match the current exception
|
being raised with the exception that the user wants to catch. This
|
being raised with the exception that the user wants to catch. This
|
assumes that this condition is used when the inferior just triggered
|
assumes that this condition is used when the inferior just triggered
|
an exception catchpoint.
|
an exception catchpoint.
|
|
|
The string returned is a newly allocated string that needs to be
|
The string returned is a newly allocated string that needs to be
|
deallocated later. */
|
deallocated later. */
|
|
|
static char *
|
static char *
|
ada_exception_catchpoint_cond_string (const char *exp_string)
|
ada_exception_catchpoint_cond_string (const char *exp_string)
|
{
|
{
|
return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string);
|
return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string);
|
}
|
}
|
|
|
/* Return the expression corresponding to COND_STRING evaluated at SAL. */
|
/* Return the expression corresponding to COND_STRING evaluated at SAL. */
|
|
|
static struct expression *
|
static struct expression *
|
ada_parse_catchpoint_condition (char *cond_string,
|
ada_parse_catchpoint_condition (char *cond_string,
|
struct symtab_and_line sal)
|
struct symtab_and_line sal)
|
{
|
{
|
return (parse_exp_1 (&cond_string, block_for_pc (sal.pc), 0));
|
return (parse_exp_1 (&cond_string, block_for_pc (sal.pc), 0));
|
}
|
}
|
|
|
/* Return the symtab_and_line that should be used to insert an exception
|
/* Return the symtab_and_line that should be used to insert an exception
|
catchpoint of the TYPE kind.
|
catchpoint of the TYPE kind.
|
|
|
EX_STRING should contain the name of a specific exception
|
EX_STRING should contain the name of a specific exception
|
that the catchpoint should catch, or NULL otherwise.
|
that the catchpoint should catch, or NULL otherwise.
|
|
|
The idea behind all the remaining parameters is that their names match
|
The idea behind all the remaining parameters is that their names match
|
the name of certain fields in the breakpoint structure that are used to
|
the name of certain fields in the breakpoint structure that are used to
|
handle exception catchpoints. This function returns the value to which
|
handle exception catchpoints. This function returns the value to which
|
these fields should be set, depending on the type of catchpoint we need
|
these fields should be set, depending on the type of catchpoint we need
|
to create.
|
to create.
|
|
|
If COND and COND_STRING are both non-NULL, any value they might
|
If COND and COND_STRING are both non-NULL, any value they might
|
hold will be free'ed, and then replaced by newly allocated ones.
|
hold will be free'ed, and then replaced by newly allocated ones.
|
These parameters are left untouched otherwise. */
|
These parameters are left untouched otherwise. */
|
|
|
static struct symtab_and_line
|
static struct symtab_and_line
|
ada_exception_sal (enum exception_catchpoint_kind ex, char *exp_string,
|
ada_exception_sal (enum exception_catchpoint_kind ex, char *exp_string,
|
char **addr_string, char **cond_string,
|
char **addr_string, char **cond_string,
|
struct expression **cond, struct breakpoint_ops **ops)
|
struct expression **cond, struct breakpoint_ops **ops)
|
{
|
{
|
const char *sym_name;
|
const char *sym_name;
|
struct symbol *sym;
|
struct symbol *sym;
|
struct symtab_and_line sal;
|
struct symtab_and_line sal;
|
|
|
/* First, find out which exception support info to use. */
|
/* First, find out which exception support info to use. */
|
ada_exception_support_info_sniffer ();
|
ada_exception_support_info_sniffer ();
|
|
|
/* Then lookup the function on which we will break in order to catch
|
/* Then lookup the function on which we will break in order to catch
|
the Ada exceptions requested by the user. */
|
the Ada exceptions requested by the user. */
|
|
|
sym_name = ada_exception_sym_name (ex);
|
sym_name = ada_exception_sym_name (ex);
|
sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
|
sym = standard_lookup (sym_name, NULL, VAR_DOMAIN);
|
|
|
/* The symbol we're looking up is provided by a unit in the GNAT runtime
|
/* The symbol we're looking up is provided by a unit in the GNAT runtime
|
that should be compiled with debugging information. As a result, we
|
that should be compiled with debugging information. As a result, we
|
expect to find that symbol in the symtabs. If we don't find it, then
|
expect to find that symbol in the symtabs. If we don't find it, then
|
the target most likely does not support Ada exceptions, or we cannot
|
the target most likely does not support Ada exceptions, or we cannot
|
insert exception breakpoints yet, because the GNAT runtime hasn't been
|
insert exception breakpoints yet, because the GNAT runtime hasn't been
|
loaded yet. */
|
loaded yet. */
|
|
|
/* brobecker/2006-12-26: It is conceivable that the runtime was compiled
|
/* brobecker/2006-12-26: It is conceivable that the runtime was compiled
|
in such a way that no debugging information is produced for the symbol
|
in such a way that no debugging information is produced for the symbol
|
we are looking for. In this case, we could search the minimal symbols
|
we are looking for. In this case, we could search the minimal symbols
|
as a fall-back mechanism. This would still be operating in degraded
|
as a fall-back mechanism. This would still be operating in degraded
|
mode, however, as we would still be missing the debugging information
|
mode, however, as we would still be missing the debugging information
|
that is needed in order to extract the name of the exception being
|
that is needed in order to extract the name of the exception being
|
raised (this name is printed in the catchpoint message, and is also
|
raised (this name is printed in the catchpoint message, and is also
|
used when trying to catch a specific exception). We do not handle
|
used when trying to catch a specific exception). We do not handle
|
this case for now. */
|
this case for now. */
|
|
|
if (sym == NULL)
|
if (sym == NULL)
|
error (_("Unable to break on '%s' in this configuration."), sym_name);
|
error (_("Unable to break on '%s' in this configuration."), sym_name);
|
|
|
/* Make sure that the symbol we found corresponds to a function. */
|
/* Make sure that the symbol we found corresponds to a function. */
|
if (SYMBOL_CLASS (sym) != LOC_BLOCK)
|
if (SYMBOL_CLASS (sym) != LOC_BLOCK)
|
error (_("Symbol \"%s\" is not a function (class = %d)"),
|
error (_("Symbol \"%s\" is not a function (class = %d)"),
|
sym_name, SYMBOL_CLASS (sym));
|
sym_name, SYMBOL_CLASS (sym));
|
|
|
sal = find_function_start_sal (sym, 1);
|
sal = find_function_start_sal (sym, 1);
|
|
|
/* Set ADDR_STRING. */
|
/* Set ADDR_STRING. */
|
|
|
*addr_string = xstrdup (sym_name);
|
*addr_string = xstrdup (sym_name);
|
|
|
/* Set the COND and COND_STRING (if not NULL). */
|
/* Set the COND and COND_STRING (if not NULL). */
|
|
|
if (cond_string != NULL && cond != NULL)
|
if (cond_string != NULL && cond != NULL)
|
{
|
{
|
if (*cond_string != NULL)
|
if (*cond_string != NULL)
|
{
|
{
|
xfree (*cond_string);
|
xfree (*cond_string);
|
*cond_string = NULL;
|
*cond_string = NULL;
|
}
|
}
|
if (*cond != NULL)
|
if (*cond != NULL)
|
{
|
{
|
xfree (*cond);
|
xfree (*cond);
|
*cond = NULL;
|
*cond = NULL;
|
}
|
}
|
if (exp_string != NULL)
|
if (exp_string != NULL)
|
{
|
{
|
*cond_string = ada_exception_catchpoint_cond_string (exp_string);
|
*cond_string = ada_exception_catchpoint_cond_string (exp_string);
|
*cond = ada_parse_catchpoint_condition (*cond_string, sal);
|
*cond = ada_parse_catchpoint_condition (*cond_string, sal);
|
}
|
}
|
}
|
}
|
|
|
/* Set OPS. */
|
/* Set OPS. */
|
*ops = ada_exception_breakpoint_ops (ex);
|
*ops = ada_exception_breakpoint_ops (ex);
|
|
|
return sal;
|
return sal;
|
}
|
}
|
|
|
/* Parse the arguments (ARGS) of the "catch exception" command.
|
/* Parse the arguments (ARGS) of the "catch exception" command.
|
|
|
Set TYPE to the appropriate exception catchpoint type.
|
Set TYPE to the appropriate exception catchpoint type.
|
If the user asked the catchpoint to catch only a specific
|
If the user asked the catchpoint to catch only a specific
|
exception, then save the exception name in ADDR_STRING.
|
exception, then save the exception name in ADDR_STRING.
|
|
|
See ada_exception_sal for a description of all the remaining
|
See ada_exception_sal for a description of all the remaining
|
function arguments of this function. */
|
function arguments of this function. */
|
|
|
struct symtab_and_line
|
struct symtab_and_line
|
ada_decode_exception_location (char *args, char **addr_string,
|
ada_decode_exception_location (char *args, char **addr_string,
|
char **exp_string, char **cond_string,
|
char **exp_string, char **cond_string,
|
struct expression **cond,
|
struct expression **cond,
|
struct breakpoint_ops **ops)
|
struct breakpoint_ops **ops)
|
{
|
{
|
enum exception_catchpoint_kind ex;
|
enum exception_catchpoint_kind ex;
|
|
|
catch_ada_exception_command_split (args, &ex, exp_string);
|
catch_ada_exception_command_split (args, &ex, exp_string);
|
return ada_exception_sal (ex, *exp_string, addr_string, cond_string,
|
return ada_exception_sal (ex, *exp_string, addr_string, cond_string,
|
cond, ops);
|
cond, ops);
|
}
|
}
|
|
|
struct symtab_and_line
|
struct symtab_and_line
|
ada_decode_assert_location (char *args, char **addr_string,
|
ada_decode_assert_location (char *args, char **addr_string,
|
struct breakpoint_ops **ops)
|
struct breakpoint_ops **ops)
|
{
|
{
|
/* Check that no argument where provided at the end of the command. */
|
/* Check that no argument where provided at the end of the command. */
|
|
|
if (args != NULL)
|
if (args != NULL)
|
{
|
{
|
while (isspace (*args))
|
while (isspace (*args))
|
args++;
|
args++;
|
if (*args != '\0')
|
if (*args != '\0')
|
error (_("Junk at end of arguments."));
|
error (_("Junk at end of arguments."));
|
}
|
}
|
|
|
return ada_exception_sal (ex_catch_assert, NULL, addr_string, NULL, NULL,
|
return ada_exception_sal (ex_catch_assert, NULL, addr_string, NULL, NULL,
|
ops);
|
ops);
|
}
|
}
|
|
|
/* Operators */
|
/* Operators */
|
/* Information about operators given special treatment in functions
|
/* Information about operators given special treatment in functions
|
below. */
|
below. */
|
/* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
|
/* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
|
|
|
#define ADA_OPERATORS \
|
#define ADA_OPERATORS \
|
OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
|
OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
|
OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
|
OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
|
OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
|
OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
|
OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
|
OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
|
OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
|
OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
|
OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
|
OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
|
OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
|
OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
|
OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
|
OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
|
OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
|
OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
|
OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
|
OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
|
OP_DEFN (OP_ATR_POS, 1, 2, 0) \
|
OP_DEFN (OP_ATR_POS, 1, 2, 0) \
|
OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
|
OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
|
OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
|
OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
|
OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
|
OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
|
OP_DEFN (UNOP_QUAL, 3, 1, 0) \
|
OP_DEFN (UNOP_QUAL, 3, 1, 0) \
|
OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
|
OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
|
OP_DEFN (OP_OTHERS, 1, 1, 0) \
|
OP_DEFN (OP_OTHERS, 1, 1, 0) \
|
OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
|
OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
|
OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
|
OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
|
|
|
static void
|
static void
|
ada_operator_length (struct expression *exp, int pc, int *oplenp, int *argsp)
|
ada_operator_length (struct expression *exp, int pc, int *oplenp, int *argsp)
|
{
|
{
|
switch (exp->elts[pc - 1].opcode)
|
switch (exp->elts[pc - 1].opcode)
|
{
|
{
|
default:
|
default:
|
operator_length_standard (exp, pc, oplenp, argsp);
|
operator_length_standard (exp, pc, oplenp, argsp);
|
break;
|
break;
|
|
|
#define OP_DEFN(op, len, args, binop) \
|
#define OP_DEFN(op, len, args, binop) \
|
case op: *oplenp = len; *argsp = args; break;
|
case op: *oplenp = len; *argsp = args; break;
|
ADA_OPERATORS;
|
ADA_OPERATORS;
|
#undef OP_DEFN
|
#undef OP_DEFN
|
|
|
case OP_AGGREGATE:
|
case OP_AGGREGATE:
|
*oplenp = 3;
|
*oplenp = 3;
|
*argsp = longest_to_int (exp->elts[pc - 2].longconst);
|
*argsp = longest_to_int (exp->elts[pc - 2].longconst);
|
break;
|
break;
|
|
|
case OP_CHOICES:
|
case OP_CHOICES:
|
*oplenp = 3;
|
*oplenp = 3;
|
*argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
|
*argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1;
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
static char *
|
static char *
|
ada_op_name (enum exp_opcode opcode)
|
ada_op_name (enum exp_opcode opcode)
|
{
|
{
|
switch (opcode)
|
switch (opcode)
|
{
|
{
|
default:
|
default:
|
return op_name_standard (opcode);
|
return op_name_standard (opcode);
|
|
|
#define OP_DEFN(op, len, args, binop) case op: return #op;
|
#define OP_DEFN(op, len, args, binop) case op: return #op;
|
ADA_OPERATORS;
|
ADA_OPERATORS;
|
#undef OP_DEFN
|
#undef OP_DEFN
|
|
|
case OP_AGGREGATE:
|
case OP_AGGREGATE:
|
return "OP_AGGREGATE";
|
return "OP_AGGREGATE";
|
case OP_CHOICES:
|
case OP_CHOICES:
|
return "OP_CHOICES";
|
return "OP_CHOICES";
|
case OP_NAME:
|
case OP_NAME:
|
return "OP_NAME";
|
return "OP_NAME";
|
}
|
}
|
}
|
}
|
|
|
/* As for operator_length, but assumes PC is pointing at the first
|
/* As for operator_length, but assumes PC is pointing at the first
|
element of the operator, and gives meaningful results only for the
|
element of the operator, and gives meaningful results only for the
|
Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
|
Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
|
|
|
static void
|
static void
|
ada_forward_operator_length (struct expression *exp, int pc,
|
ada_forward_operator_length (struct expression *exp, int pc,
|
int *oplenp, int *argsp)
|
int *oplenp, int *argsp)
|
{
|
{
|
switch (exp->elts[pc].opcode)
|
switch (exp->elts[pc].opcode)
|
{
|
{
|
default:
|
default:
|
*oplenp = *argsp = 0;
|
*oplenp = *argsp = 0;
|
break;
|
break;
|
|
|
#define OP_DEFN(op, len, args, binop) \
|
#define OP_DEFN(op, len, args, binop) \
|
case op: *oplenp = len; *argsp = args; break;
|
case op: *oplenp = len; *argsp = args; break;
|
ADA_OPERATORS;
|
ADA_OPERATORS;
|
#undef OP_DEFN
|
#undef OP_DEFN
|
|
|
case OP_AGGREGATE:
|
case OP_AGGREGATE:
|
*oplenp = 3;
|
*oplenp = 3;
|
*argsp = longest_to_int (exp->elts[pc + 1].longconst);
|
*argsp = longest_to_int (exp->elts[pc + 1].longconst);
|
break;
|
break;
|
|
|
case OP_CHOICES:
|
case OP_CHOICES:
|
*oplenp = 3;
|
*oplenp = 3;
|
*argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
|
*argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1;
|
break;
|
break;
|
|
|
case OP_STRING:
|
case OP_STRING:
|
case OP_NAME:
|
case OP_NAME:
|
{
|
{
|
int len = longest_to_int (exp->elts[pc + 1].longconst);
|
int len = longest_to_int (exp->elts[pc + 1].longconst);
|
*oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
|
*oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1);
|
*argsp = 0;
|
*argsp = 0;
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
static int
|
static int
|
ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
|
ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt)
|
{
|
{
|
enum exp_opcode op = exp->elts[elt].opcode;
|
enum exp_opcode op = exp->elts[elt].opcode;
|
int oplen, nargs;
|
int oplen, nargs;
|
int pc = elt;
|
int pc = elt;
|
int i;
|
int i;
|
|
|
ada_forward_operator_length (exp, elt, &oplen, &nargs);
|
ada_forward_operator_length (exp, elt, &oplen, &nargs);
|
|
|
switch (op)
|
switch (op)
|
{
|
{
|
/* Ada attributes ('Foo). */
|
/* Ada attributes ('Foo). */
|
case OP_ATR_FIRST:
|
case OP_ATR_FIRST:
|
case OP_ATR_LAST:
|
case OP_ATR_LAST:
|
case OP_ATR_LENGTH:
|
case OP_ATR_LENGTH:
|
case OP_ATR_IMAGE:
|
case OP_ATR_IMAGE:
|
case OP_ATR_MAX:
|
case OP_ATR_MAX:
|
case OP_ATR_MIN:
|
case OP_ATR_MIN:
|
case OP_ATR_MODULUS:
|
case OP_ATR_MODULUS:
|
case OP_ATR_POS:
|
case OP_ATR_POS:
|
case OP_ATR_SIZE:
|
case OP_ATR_SIZE:
|
case OP_ATR_TAG:
|
case OP_ATR_TAG:
|
case OP_ATR_VAL:
|
case OP_ATR_VAL:
|
break;
|
break;
|
|
|
case UNOP_IN_RANGE:
|
case UNOP_IN_RANGE:
|
case UNOP_QUAL:
|
case UNOP_QUAL:
|
/* XXX: gdb_sprint_host_address, type_sprint */
|
/* XXX: gdb_sprint_host_address, type_sprint */
|
fprintf_filtered (stream, _("Type @"));
|
fprintf_filtered (stream, _("Type @"));
|
gdb_print_host_address (exp->elts[pc + 1].type, stream);
|
gdb_print_host_address (exp->elts[pc + 1].type, stream);
|
fprintf_filtered (stream, " (");
|
fprintf_filtered (stream, " (");
|
type_print (exp->elts[pc + 1].type, NULL, stream, 0);
|
type_print (exp->elts[pc + 1].type, NULL, stream, 0);
|
fprintf_filtered (stream, ")");
|
fprintf_filtered (stream, ")");
|
break;
|
break;
|
case BINOP_IN_BOUNDS:
|
case BINOP_IN_BOUNDS:
|
fprintf_filtered (stream, " (%d)",
|
fprintf_filtered (stream, " (%d)",
|
longest_to_int (exp->elts[pc + 2].longconst));
|
longest_to_int (exp->elts[pc + 2].longconst));
|
break;
|
break;
|
case TERNOP_IN_RANGE:
|
case TERNOP_IN_RANGE:
|
break;
|
break;
|
|
|
case OP_AGGREGATE:
|
case OP_AGGREGATE:
|
case OP_OTHERS:
|
case OP_OTHERS:
|
case OP_DISCRETE_RANGE:
|
case OP_DISCRETE_RANGE:
|
case OP_POSITIONAL:
|
case OP_POSITIONAL:
|
case OP_CHOICES:
|
case OP_CHOICES:
|
break;
|
break;
|
|
|
case OP_NAME:
|
case OP_NAME:
|
case OP_STRING:
|
case OP_STRING:
|
{
|
{
|
char *name = &exp->elts[elt + 2].string;
|
char *name = &exp->elts[elt + 2].string;
|
int len = longest_to_int (exp->elts[elt + 1].longconst);
|
int len = longest_to_int (exp->elts[elt + 1].longconst);
|
fprintf_filtered (stream, "Text: `%.*s'", len, name);
|
fprintf_filtered (stream, "Text: `%.*s'", len, name);
|
break;
|
break;
|
}
|
}
|
|
|
default:
|
default:
|
return dump_subexp_body_standard (exp, stream, elt);
|
return dump_subexp_body_standard (exp, stream, elt);
|
}
|
}
|
|
|
elt += oplen;
|
elt += oplen;
|
for (i = 0; i < nargs; i += 1)
|
for (i = 0; i < nargs; i += 1)
|
elt = dump_subexp (exp, stream, elt);
|
elt = dump_subexp (exp, stream, elt);
|
|
|
return elt;
|
return elt;
|
}
|
}
|
|
|
/* The Ada extension of print_subexp (q.v.). */
|
/* The Ada extension of print_subexp (q.v.). */
|
|
|
static void
|
static void
|
ada_print_subexp (struct expression *exp, int *pos,
|
ada_print_subexp (struct expression *exp, int *pos,
|
struct ui_file *stream, enum precedence prec)
|
struct ui_file *stream, enum precedence prec)
|
{
|
{
|
int oplen, nargs, i;
|
int oplen, nargs, i;
|
int pc = *pos;
|
int pc = *pos;
|
enum exp_opcode op = exp->elts[pc].opcode;
|
enum exp_opcode op = exp->elts[pc].opcode;
|
|
|
ada_forward_operator_length (exp, pc, &oplen, &nargs);
|
ada_forward_operator_length (exp, pc, &oplen, &nargs);
|
|
|
*pos += oplen;
|
*pos += oplen;
|
switch (op)
|
switch (op)
|
{
|
{
|
default:
|
default:
|
*pos -= oplen;
|
*pos -= oplen;
|
print_subexp_standard (exp, pos, stream, prec);
|
print_subexp_standard (exp, pos, stream, prec);
|
return;
|
return;
|
|
|
case OP_VAR_VALUE:
|
case OP_VAR_VALUE:
|
fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
|
fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream);
|
return;
|
return;
|
|
|
case BINOP_IN_BOUNDS:
|
case BINOP_IN_BOUNDS:
|
/* XXX: sprint_subexp */
|
/* XXX: sprint_subexp */
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
fputs_filtered (" in ", stream);
|
fputs_filtered (" in ", stream);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
fputs_filtered ("'range", stream);
|
fputs_filtered ("'range", stream);
|
if (exp->elts[pc + 1].longconst > 1)
|
if (exp->elts[pc + 1].longconst > 1)
|
fprintf_filtered (stream, "(%ld)",
|
fprintf_filtered (stream, "(%ld)",
|
(long) exp->elts[pc + 1].longconst);
|
(long) exp->elts[pc + 1].longconst);
|
return;
|
return;
|
|
|
case TERNOP_IN_RANGE:
|
case TERNOP_IN_RANGE:
|
if (prec >= PREC_EQUAL)
|
if (prec >= PREC_EQUAL)
|
fputs_filtered ("(", stream);
|
fputs_filtered ("(", stream);
|
/* XXX: sprint_subexp */
|
/* XXX: sprint_subexp */
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
fputs_filtered (" in ", stream);
|
fputs_filtered (" in ", stream);
|
print_subexp (exp, pos, stream, PREC_EQUAL);
|
print_subexp (exp, pos, stream, PREC_EQUAL);
|
fputs_filtered (" .. ", stream);
|
fputs_filtered (" .. ", stream);
|
print_subexp (exp, pos, stream, PREC_EQUAL);
|
print_subexp (exp, pos, stream, PREC_EQUAL);
|
if (prec >= PREC_EQUAL)
|
if (prec >= PREC_EQUAL)
|
fputs_filtered (")", stream);
|
fputs_filtered (")", stream);
|
return;
|
return;
|
|
|
case OP_ATR_FIRST:
|
case OP_ATR_FIRST:
|
case OP_ATR_LAST:
|
case OP_ATR_LAST:
|
case OP_ATR_LENGTH:
|
case OP_ATR_LENGTH:
|
case OP_ATR_IMAGE:
|
case OP_ATR_IMAGE:
|
case OP_ATR_MAX:
|
case OP_ATR_MAX:
|
case OP_ATR_MIN:
|
case OP_ATR_MIN:
|
case OP_ATR_MODULUS:
|
case OP_ATR_MODULUS:
|
case OP_ATR_POS:
|
case OP_ATR_POS:
|
case OP_ATR_SIZE:
|
case OP_ATR_SIZE:
|
case OP_ATR_TAG:
|
case OP_ATR_TAG:
|
case OP_ATR_VAL:
|
case OP_ATR_VAL:
|
if (exp->elts[*pos].opcode == OP_TYPE)
|
if (exp->elts[*pos].opcode == OP_TYPE)
|
{
|
{
|
if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
|
if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID)
|
LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0);
|
LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0);
|
*pos += 3;
|
*pos += 3;
|
}
|
}
|
else
|
else
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
fprintf_filtered (stream, "'%s", ada_attribute_name (op));
|
fprintf_filtered (stream, "'%s", ada_attribute_name (op));
|
if (nargs > 1)
|
if (nargs > 1)
|
{
|
{
|
int tem;
|
int tem;
|
for (tem = 1; tem < nargs; tem += 1)
|
for (tem = 1; tem < nargs; tem += 1)
|
{
|
{
|
fputs_filtered ((tem == 1) ? " (" : ", ", stream);
|
fputs_filtered ((tem == 1) ? " (" : ", ", stream);
|
print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
|
print_subexp (exp, pos, stream, PREC_ABOVE_COMMA);
|
}
|
}
|
fputs_filtered (")", stream);
|
fputs_filtered (")", stream);
|
}
|
}
|
return;
|
return;
|
|
|
case UNOP_QUAL:
|
case UNOP_QUAL:
|
type_print (exp->elts[pc + 1].type, "", stream, 0);
|
type_print (exp->elts[pc + 1].type, "", stream, 0);
|
fputs_filtered ("'(", stream);
|
fputs_filtered ("'(", stream);
|
print_subexp (exp, pos, stream, PREC_PREFIX);
|
print_subexp (exp, pos, stream, PREC_PREFIX);
|
fputs_filtered (")", stream);
|
fputs_filtered (")", stream);
|
return;
|
return;
|
|
|
case UNOP_IN_RANGE:
|
case UNOP_IN_RANGE:
|
/* XXX: sprint_subexp */
|
/* XXX: sprint_subexp */
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
fputs_filtered (" in ", stream);
|
fputs_filtered (" in ", stream);
|
LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0);
|
LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0);
|
return;
|
return;
|
|
|
case OP_DISCRETE_RANGE:
|
case OP_DISCRETE_RANGE:
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
fputs_filtered ("..", stream);
|
fputs_filtered ("..", stream);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
return;
|
return;
|
|
|
case OP_OTHERS:
|
case OP_OTHERS:
|
fputs_filtered ("others => ", stream);
|
fputs_filtered ("others => ", stream);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
return;
|
return;
|
|
|
case OP_CHOICES:
|
case OP_CHOICES:
|
for (i = 0; i < nargs-1; i += 1)
|
for (i = 0; i < nargs-1; i += 1)
|
{
|
{
|
if (i > 0)
|
if (i > 0)
|
fputs_filtered ("|", stream);
|
fputs_filtered ("|", stream);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
}
|
}
|
fputs_filtered (" => ", stream);
|
fputs_filtered (" => ", stream);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
return;
|
return;
|
|
|
case OP_POSITIONAL:
|
case OP_POSITIONAL:
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
return;
|
return;
|
|
|
case OP_AGGREGATE:
|
case OP_AGGREGATE:
|
fputs_filtered ("(", stream);
|
fputs_filtered ("(", stream);
|
for (i = 0; i < nargs; i += 1)
|
for (i = 0; i < nargs; i += 1)
|
{
|
{
|
if (i > 0)
|
if (i > 0)
|
fputs_filtered (", ", stream);
|
fputs_filtered (", ", stream);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
}
|
}
|
fputs_filtered (")", stream);
|
fputs_filtered (")", stream);
|
return;
|
return;
|
}
|
}
|
}
|
}
|
|
|
/* Table mapping opcodes into strings for printing operators
|
/* Table mapping opcodes into strings for printing operators
|
and precedences of the operators. */
|
and precedences of the operators. */
|
|
|
static const struct op_print ada_op_print_tab[] = {
|
static const struct op_print ada_op_print_tab[] = {
|
{":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
|
{":=", BINOP_ASSIGN, PREC_ASSIGN, 1},
|
{"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
|
{"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0},
|
{"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
|
{"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0},
|
{"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
|
{"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0},
|
{"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
|
{"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0},
|
{"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
|
{"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0},
|
{"=", BINOP_EQUAL, PREC_EQUAL, 0},
|
{"=", BINOP_EQUAL, PREC_EQUAL, 0},
|
{"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
|
{"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0},
|
{"<=", BINOP_LEQ, PREC_ORDER, 0},
|
{"<=", BINOP_LEQ, PREC_ORDER, 0},
|
{">=", BINOP_GEQ, PREC_ORDER, 0},
|
{">=", BINOP_GEQ, PREC_ORDER, 0},
|
{">", BINOP_GTR, PREC_ORDER, 0},
|
{">", BINOP_GTR, PREC_ORDER, 0},
|
{"<", BINOP_LESS, PREC_ORDER, 0},
|
{"<", BINOP_LESS, PREC_ORDER, 0},
|
{">>", BINOP_RSH, PREC_SHIFT, 0},
|
{">>", BINOP_RSH, PREC_SHIFT, 0},
|
{"<<", BINOP_LSH, PREC_SHIFT, 0},
|
{"<<", BINOP_LSH, PREC_SHIFT, 0},
|
{"+", BINOP_ADD, PREC_ADD, 0},
|
{"+", BINOP_ADD, PREC_ADD, 0},
|
{"-", BINOP_SUB, PREC_ADD, 0},
|
{"-", BINOP_SUB, PREC_ADD, 0},
|
{"&", BINOP_CONCAT, PREC_ADD, 0},
|
{"&", BINOP_CONCAT, PREC_ADD, 0},
|
{"*", BINOP_MUL, PREC_MUL, 0},
|
{"*", BINOP_MUL, PREC_MUL, 0},
|
{"/", BINOP_DIV, PREC_MUL, 0},
|
{"/", BINOP_DIV, PREC_MUL, 0},
|
{"rem", BINOP_REM, PREC_MUL, 0},
|
{"rem", BINOP_REM, PREC_MUL, 0},
|
{"mod", BINOP_MOD, PREC_MUL, 0},
|
{"mod", BINOP_MOD, PREC_MUL, 0},
|
{"**", BINOP_EXP, PREC_REPEAT, 0},
|
{"**", BINOP_EXP, PREC_REPEAT, 0},
|
{"@", BINOP_REPEAT, PREC_REPEAT, 0},
|
{"@", BINOP_REPEAT, PREC_REPEAT, 0},
|
{"-", UNOP_NEG, PREC_PREFIX, 0},
|
{"-", UNOP_NEG, PREC_PREFIX, 0},
|
{"+", UNOP_PLUS, PREC_PREFIX, 0},
|
{"+", UNOP_PLUS, PREC_PREFIX, 0},
|
{"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
|
{"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0},
|
{"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
|
{"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0},
|
{"abs ", UNOP_ABS, PREC_PREFIX, 0},
|
{"abs ", UNOP_ABS, PREC_PREFIX, 0},
|
{".all", UNOP_IND, PREC_SUFFIX, 1},
|
{".all", UNOP_IND, PREC_SUFFIX, 1},
|
{"'access", UNOP_ADDR, PREC_SUFFIX, 1},
|
{"'access", UNOP_ADDR, PREC_SUFFIX, 1},
|
{"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
|
{"'size", OP_ATR_SIZE, PREC_SUFFIX, 1},
|
{NULL, 0, 0, 0}
|
{NULL, 0, 0, 0}
|
};
|
};
|
|
|
enum ada_primitive_types {
|
enum ada_primitive_types {
|
ada_primitive_type_int,
|
ada_primitive_type_int,
|
ada_primitive_type_long,
|
ada_primitive_type_long,
|
ada_primitive_type_short,
|
ada_primitive_type_short,
|
ada_primitive_type_char,
|
ada_primitive_type_char,
|
ada_primitive_type_float,
|
ada_primitive_type_float,
|
ada_primitive_type_double,
|
ada_primitive_type_double,
|
ada_primitive_type_void,
|
ada_primitive_type_void,
|
ada_primitive_type_long_long,
|
ada_primitive_type_long_long,
|
ada_primitive_type_long_double,
|
ada_primitive_type_long_double,
|
ada_primitive_type_natural,
|
ada_primitive_type_natural,
|
ada_primitive_type_positive,
|
ada_primitive_type_positive,
|
ada_primitive_type_system_address,
|
ada_primitive_type_system_address,
|
nr_ada_primitive_types
|
nr_ada_primitive_types
|
};
|
};
|
|
|
static void
|
static void
|
ada_language_arch_info (struct gdbarch *gdbarch,
|
ada_language_arch_info (struct gdbarch *gdbarch,
|
struct language_arch_info *lai)
|
struct language_arch_info *lai)
|
{
|
{
|
const struct builtin_type *builtin = builtin_type (gdbarch);
|
const struct builtin_type *builtin = builtin_type (gdbarch);
|
lai->primitive_type_vector
|
lai->primitive_type_vector
|
= GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
|
= GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1,
|
struct type *);
|
struct type *);
|
lai->primitive_type_vector [ada_primitive_type_int] =
|
lai->primitive_type_vector [ada_primitive_type_int] =
|
init_type (TYPE_CODE_INT,
|
init_type (TYPE_CODE_INT,
|
gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
|
gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
|
0, "integer", (struct objfile *) NULL);
|
0, "integer", (struct objfile *) NULL);
|
lai->primitive_type_vector [ada_primitive_type_long] =
|
lai->primitive_type_vector [ada_primitive_type_long] =
|
init_type (TYPE_CODE_INT,
|
init_type (TYPE_CODE_INT,
|
gdbarch_long_bit (gdbarch) / TARGET_CHAR_BIT,
|
gdbarch_long_bit (gdbarch) / TARGET_CHAR_BIT,
|
0, "long_integer", (struct objfile *) NULL);
|
0, "long_integer", (struct objfile *) NULL);
|
lai->primitive_type_vector [ada_primitive_type_short] =
|
lai->primitive_type_vector [ada_primitive_type_short] =
|
init_type (TYPE_CODE_INT,
|
init_type (TYPE_CODE_INT,
|
gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT,
|
gdbarch_short_bit (gdbarch) / TARGET_CHAR_BIT,
|
0, "short_integer", (struct objfile *) NULL);
|
0, "short_integer", (struct objfile *) NULL);
|
lai->string_char_type =
|
lai->string_char_type =
|
lai->primitive_type_vector [ada_primitive_type_char] =
|
lai->primitive_type_vector [ada_primitive_type_char] =
|
init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
|
init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
|
0, "character", (struct objfile *) NULL);
|
0, "character", (struct objfile *) NULL);
|
lai->primitive_type_vector [ada_primitive_type_float] =
|
lai->primitive_type_vector [ada_primitive_type_float] =
|
init_type (TYPE_CODE_FLT,
|
init_type (TYPE_CODE_FLT,
|
gdbarch_float_bit (gdbarch)/ TARGET_CHAR_BIT,
|
gdbarch_float_bit (gdbarch)/ TARGET_CHAR_BIT,
|
0, "float", (struct objfile *) NULL);
|
0, "float", (struct objfile *) NULL);
|
lai->primitive_type_vector [ada_primitive_type_double] =
|
lai->primitive_type_vector [ada_primitive_type_double] =
|
init_type (TYPE_CODE_FLT,
|
init_type (TYPE_CODE_FLT,
|
gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
|
gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
|
0, "long_float", (struct objfile *) NULL);
|
0, "long_float", (struct objfile *) NULL);
|
lai->primitive_type_vector [ada_primitive_type_long_long] =
|
lai->primitive_type_vector [ada_primitive_type_long_long] =
|
init_type (TYPE_CODE_INT,
|
init_type (TYPE_CODE_INT,
|
gdbarch_long_long_bit (gdbarch) / TARGET_CHAR_BIT,
|
gdbarch_long_long_bit (gdbarch) / TARGET_CHAR_BIT,
|
0, "long_long_integer", (struct objfile *) NULL);
|
0, "long_long_integer", (struct objfile *) NULL);
|
lai->primitive_type_vector [ada_primitive_type_long_double] =
|
lai->primitive_type_vector [ada_primitive_type_long_double] =
|
init_type (TYPE_CODE_FLT,
|
init_type (TYPE_CODE_FLT,
|
gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
|
gdbarch_double_bit (gdbarch) / TARGET_CHAR_BIT,
|
0, "long_long_float", (struct objfile *) NULL);
|
0, "long_long_float", (struct objfile *) NULL);
|
lai->primitive_type_vector [ada_primitive_type_natural] =
|
lai->primitive_type_vector [ada_primitive_type_natural] =
|
init_type (TYPE_CODE_INT,
|
init_type (TYPE_CODE_INT,
|
gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
|
gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
|
0, "natural", (struct objfile *) NULL);
|
0, "natural", (struct objfile *) NULL);
|
lai->primitive_type_vector [ada_primitive_type_positive] =
|
lai->primitive_type_vector [ada_primitive_type_positive] =
|
init_type (TYPE_CODE_INT,
|
init_type (TYPE_CODE_INT,
|
gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
|
gdbarch_int_bit (gdbarch) / TARGET_CHAR_BIT,
|
0, "positive", (struct objfile *) NULL);
|
0, "positive", (struct objfile *) NULL);
|
lai->primitive_type_vector [ada_primitive_type_void] = builtin->builtin_void;
|
lai->primitive_type_vector [ada_primitive_type_void] = builtin->builtin_void;
|
|
|
lai->primitive_type_vector [ada_primitive_type_system_address] =
|
lai->primitive_type_vector [ada_primitive_type_system_address] =
|
lookup_pointer_type (init_type (TYPE_CODE_VOID, 1, 0, "void",
|
lookup_pointer_type (init_type (TYPE_CODE_VOID, 1, 0, "void",
|
(struct objfile *) NULL));
|
(struct objfile *) NULL));
|
TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
|
TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address])
|
= "system__address";
|
= "system__address";
|
}
|
}
|
|
|
/* Language vector */
|
/* Language vector */
|
|
|
/* Not really used, but needed in the ada_language_defn. */
|
/* Not really used, but needed in the ada_language_defn. */
|
|
|
static void
|
static void
|
emit_char (int c, struct ui_file *stream, int quoter)
|
emit_char (int c, struct ui_file *stream, int quoter)
|
{
|
{
|
ada_emit_char (c, stream, quoter, 1);
|
ada_emit_char (c, stream, quoter, 1);
|
}
|
}
|
|
|
static int
|
static int
|
parse (void)
|
parse (void)
|
{
|
{
|
warnings_issued = 0;
|
warnings_issued = 0;
|
return ada_parse ();
|
return ada_parse ();
|
}
|
}
|
|
|
static const struct exp_descriptor ada_exp_descriptor = {
|
static const struct exp_descriptor ada_exp_descriptor = {
|
ada_print_subexp,
|
ada_print_subexp,
|
ada_operator_length,
|
ada_operator_length,
|
ada_op_name,
|
ada_op_name,
|
ada_dump_subexp_body,
|
ada_dump_subexp_body,
|
ada_evaluate_subexp
|
ada_evaluate_subexp
|
};
|
};
|
|
|
const struct language_defn ada_language_defn = {
|
const struct language_defn ada_language_defn = {
|
"ada", /* Language name */
|
"ada", /* Language name */
|
language_ada,
|
language_ada,
|
range_check_off,
|
range_check_off,
|
type_check_off,
|
type_check_off,
|
case_sensitive_on, /* Yes, Ada is case-insensitive, but
|
case_sensitive_on, /* Yes, Ada is case-insensitive, but
|
that's not quite what this means. */
|
that's not quite what this means. */
|
array_row_major,
|
array_row_major,
|
&ada_exp_descriptor,
|
&ada_exp_descriptor,
|
parse,
|
parse,
|
ada_error,
|
ada_error,
|
resolve,
|
resolve,
|
ada_printchar, /* Print a character constant */
|
ada_printchar, /* Print a character constant */
|
ada_printstr, /* Function to print string constant */
|
ada_printstr, /* Function to print string constant */
|
emit_char, /* Function to print single char (not used) */
|
emit_char, /* Function to print single char (not used) */
|
ada_print_type, /* Print a type using appropriate syntax */
|
ada_print_type, /* Print a type using appropriate syntax */
|
ada_val_print, /* Print a value using appropriate syntax */
|
ada_val_print, /* Print a value using appropriate syntax */
|
ada_value_print, /* Print a top-level value */
|
ada_value_print, /* Print a top-level value */
|
NULL, /* Language specific skip_trampoline */
|
NULL, /* Language specific skip_trampoline */
|
NULL, /* value_of_this */
|
NULL, /* value_of_this */
|
ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
|
ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */
|
basic_lookup_transparent_type, /* lookup_transparent_type */
|
basic_lookup_transparent_type, /* lookup_transparent_type */
|
ada_la_decode, /* Language specific symbol demangler */
|
ada_la_decode, /* Language specific symbol demangler */
|
NULL, /* Language specific class_name_from_physname */
|
NULL, /* Language specific class_name_from_physname */
|
ada_op_print_tab, /* expression operators for printing */
|
ada_op_print_tab, /* expression operators for printing */
|
0, /* c-style arrays */
|
0, /* c-style arrays */
|
1, /* String lower bound */
|
1, /* String lower bound */
|
ada_get_gdb_completer_word_break_characters,
|
ada_get_gdb_completer_word_break_characters,
|
ada_make_symbol_completion_list,
|
ada_make_symbol_completion_list,
|
ada_language_arch_info,
|
ada_language_arch_info,
|
ada_print_array_index,
|
ada_print_array_index,
|
default_pass_by_reference,
|
default_pass_by_reference,
|
LANG_MAGIC
|
LANG_MAGIC
|
};
|
};
|
|
|
void
|
void
|
_initialize_ada_language (void)
|
_initialize_ada_language (void)
|
{
|
{
|
add_language (&ada_language_defn);
|
add_language (&ada_language_defn);
|
|
|
varsize_limit = 65536;
|
varsize_limit = 65536;
|
|
|
obstack_init (&symbol_list_obstack);
|
obstack_init (&symbol_list_obstack);
|
|
|
decoded_names_store = htab_create_alloc
|
decoded_names_store = htab_create_alloc
|
(256, htab_hash_string, (int (*)(const void *, const void *)) streq,
|
(256, htab_hash_string, (int (*)(const void *, const void *)) streq,
|
NULL, xcalloc, xfree);
|
NULL, xcalloc, xfree);
|
|
|
observer_attach_executable_changed (ada_executable_changed_observer);
|
observer_attach_executable_changed (ada_executable_changed_observer);
|
}
|
}
|
|
|
