mirror of
https://sourceware.org/git/binutils-gdb.git
synced 2024-11-24 18:44:20 +08:00
721b08c686
This commit is preparation work for a later commit, and by itself makes no user visible change to GDB. I've split this work into a separate commit in order to make code review easier. This commit adds a new field 'la_struct_too_deep_ellipsis' to the language struct, this string will be used in the next commit to print a language specific string from within the generic value printing code. In this commit I add the new field and initialise it for each language, however at this stage the new field is never used. gdb/ChangeLog: * language.h (struct language_defn) <la_struct_too_deep_ellipsis>: New field. * ada-lang.c (ada_language_defn): Initialise new field. * c-lang.c (c_language_defn): Likewise. (cplus_language_defn): Likewise. (asm_language_defn): Likewise. (minimal_language_defn): Likewise. * d-lang.c (d_language_defn): Likewise. * f-lang.c (f_language_defn): Likewise. * go-lang.c (go_language_defn): Likewise. * language.c (unknown_language_defn): Likewise. (auto_language_defn): Likewise. * m2-lang.c (m2_language_defn): Likewise. * objc-lang.c (objc_language_defn): Likewise. * opencl-lang.c (opencl_language_defn): Likewise. * p-lang.c (pascal_language_defn): Likewise. * rust-lang.c (rust_language_defn): Likewise.
2147 lines
56 KiB
C
2147 lines
56 KiB
C
/* Rust language support routines for GDB, the GNU debugger.
|
||
|
||
Copyright (C) 2016-2019 Free Software Foundation, Inc.
|
||
|
||
This file is part of GDB.
|
||
|
||
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
|
||
the Free Software Foundation; either version 3 of the License, or
|
||
(at your option) any later version.
|
||
|
||
This program is distributed in the hope that it will be useful,
|
||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
GNU General Public License for more details.
|
||
|
||
You should have received a copy of the GNU General Public License
|
||
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
||
|
||
#include "defs.h"
|
||
|
||
#include <ctype.h>
|
||
|
||
#include "block.h"
|
||
#include "c-lang.h"
|
||
#include "charset.h"
|
||
#include "cp-support.h"
|
||
#include "demangle.h"
|
||
#include "gdbarch.h"
|
||
#include "infcall.h"
|
||
#include "objfiles.h"
|
||
#include "psymtab.h"
|
||
#include "rust-lang.h"
|
||
#include "typeprint.h"
|
||
#include "valprint.h"
|
||
#include "varobj.h"
|
||
#include <algorithm>
|
||
#include <string>
|
||
#include <vector>
|
||
|
||
/* See rust-lang.h. */
|
||
|
||
const char *
|
||
rust_last_path_segment (const char *path)
|
||
{
|
||
const char *result = strrchr (path, ':');
|
||
|
||
if (result == NULL)
|
||
return path;
|
||
return result + 1;
|
||
}
|
||
|
||
/* See rust-lang.h. */
|
||
|
||
std::string
|
||
rust_crate_for_block (const struct block *block)
|
||
{
|
||
const char *scope = block_scope (block);
|
||
|
||
if (scope[0] == '\0')
|
||
return std::string ();
|
||
|
||
return std::string (scope, cp_find_first_component (scope));
|
||
}
|
||
|
||
/* Return true if TYPE, which must be a struct type, represents a Rust
|
||
enum. */
|
||
|
||
static bool
|
||
rust_enum_p (const struct type *type)
|
||
{
|
||
return (TYPE_CODE (type) == TYPE_CODE_STRUCT
|
||
&& TYPE_NFIELDS (type) == 1
|
||
&& TYPE_FLAG_DISCRIMINATED_UNION (TYPE_FIELD_TYPE (type, 0)));
|
||
}
|
||
|
||
/* Return true if TYPE, which must be an enum type, has no
|
||
variants. */
|
||
|
||
static bool
|
||
rust_empty_enum_p (const struct type *type)
|
||
{
|
||
gdb_assert (rust_enum_p (type));
|
||
/* In Rust the enum always fills the containing structure. */
|
||
gdb_assert (TYPE_FIELD_BITPOS (type, 0) == 0);
|
||
|
||
return TYPE_NFIELDS (TYPE_FIELD_TYPE (type, 0)) == 0;
|
||
}
|
||
|
||
/* Given an enum type and contents, find which variant is active. */
|
||
|
||
static struct field *
|
||
rust_enum_variant (struct type *type, const gdb_byte *contents)
|
||
{
|
||
/* In Rust the enum always fills the containing structure. */
|
||
gdb_assert (TYPE_FIELD_BITPOS (type, 0) == 0);
|
||
|
||
struct type *union_type = TYPE_FIELD_TYPE (type, 0);
|
||
|
||
int fieldno = value_union_variant (union_type, contents);
|
||
return &TYPE_FIELD (union_type, fieldno);
|
||
}
|
||
|
||
/* See rust-lang.h. */
|
||
|
||
bool
|
||
rust_tuple_type_p (struct type *type)
|
||
{
|
||
/* The current implementation is a bit of a hack, but there's
|
||
nothing else in the debuginfo to distinguish a tuple from a
|
||
struct. */
|
||
return (TYPE_CODE (type) == TYPE_CODE_STRUCT
|
||
&& TYPE_NAME (type) != NULL
|
||
&& TYPE_NAME (type)[0] == '(');
|
||
}
|
||
|
||
/* Return true if all non-static fields of a structlike type are in a
|
||
sequence like __0, __1, __2. */
|
||
|
||
static bool
|
||
rust_underscore_fields (struct type *type)
|
||
{
|
||
int i, field_number;
|
||
|
||
field_number = 0;
|
||
|
||
if (TYPE_CODE (type) != TYPE_CODE_STRUCT)
|
||
return false;
|
||
for (i = 0; i < TYPE_NFIELDS (type); ++i)
|
||
{
|
||
if (!field_is_static (&TYPE_FIELD (type, i)))
|
||
{
|
||
char buf[20];
|
||
|
||
xsnprintf (buf, sizeof (buf), "__%d", field_number);
|
||
if (strcmp (buf, TYPE_FIELD_NAME (type, i)) != 0)
|
||
return false;
|
||
field_number++;
|
||
}
|
||
}
|
||
return true;
|
||
}
|
||
|
||
/* See rust-lang.h. */
|
||
|
||
bool
|
||
rust_tuple_struct_type_p (struct type *type)
|
||
{
|
||
/* This is just an approximation until DWARF can represent Rust more
|
||
precisely. We exclude zero-length structs because they may not
|
||
be tuple structs, and there's no way to tell. */
|
||
return TYPE_NFIELDS (type) > 0 && rust_underscore_fields (type);
|
||
}
|
||
|
||
/* Return true if TYPE is a slice type, otherwise false. */
|
||
|
||
static bool
|
||
rust_slice_type_p (struct type *type)
|
||
{
|
||
return (TYPE_CODE (type) == TYPE_CODE_STRUCT
|
||
&& TYPE_NAME (type) != NULL
|
||
&& (strncmp (TYPE_NAME (type), "&[", 2) == 0
|
||
|| strcmp (TYPE_NAME (type), "&str") == 0));
|
||
}
|
||
|
||
/* Return true if TYPE is a range type, otherwise false. */
|
||
|
||
static bool
|
||
rust_range_type_p (struct type *type)
|
||
{
|
||
int i;
|
||
|
||
if (TYPE_CODE (type) != TYPE_CODE_STRUCT
|
||
|| TYPE_NFIELDS (type) > 2
|
||
|| TYPE_NAME (type) == NULL
|
||
|| strstr (TYPE_NAME (type), "::Range") == NULL)
|
||
return false;
|
||
|
||
if (TYPE_NFIELDS (type) == 0)
|
||
return true;
|
||
|
||
i = 0;
|
||
if (strcmp (TYPE_FIELD_NAME (type, 0), "start") == 0)
|
||
{
|
||
if (TYPE_NFIELDS (type) == 1)
|
||
return true;
|
||
i = 1;
|
||
}
|
||
else if (TYPE_NFIELDS (type) == 2)
|
||
{
|
||
/* First field had to be "start". */
|
||
return false;
|
||
}
|
||
|
||
return strcmp (TYPE_FIELD_NAME (type, i), "end") == 0;
|
||
}
|
||
|
||
/* Return true if TYPE is an inclusive range type, otherwise false.
|
||
This is only valid for types which are already known to be range
|
||
types. */
|
||
|
||
static bool
|
||
rust_inclusive_range_type_p (struct type *type)
|
||
{
|
||
return (strstr (TYPE_NAME (type), "::RangeInclusive") != NULL
|
||
|| strstr (TYPE_NAME (type), "::RangeToInclusive") != NULL);
|
||
}
|
||
|
||
/* Return true if TYPE seems to be the type "u8", otherwise false. */
|
||
|
||
static bool
|
||
rust_u8_type_p (struct type *type)
|
||
{
|
||
return (TYPE_CODE (type) == TYPE_CODE_INT
|
||
&& TYPE_UNSIGNED (type)
|
||
&& TYPE_LENGTH (type) == 1);
|
||
}
|
||
|
||
/* Return true if TYPE is a Rust character type. */
|
||
|
||
static bool
|
||
rust_chartype_p (struct type *type)
|
||
{
|
||
return (TYPE_CODE (type) == TYPE_CODE_CHAR
|
||
&& TYPE_LENGTH (type) == 4
|
||
&& TYPE_UNSIGNED (type));
|
||
}
|
||
|
||
/* If VALUE represents a trait object pointer, return the underlying
|
||
pointer with the correct (i.e., runtime) type. Otherwise, return
|
||
NULL. */
|
||
|
||
static struct value *
|
||
rust_get_trait_object_pointer (struct value *value)
|
||
{
|
||
struct type *type = check_typedef (value_type (value));
|
||
|
||
if (TYPE_CODE (type) != TYPE_CODE_STRUCT || TYPE_NFIELDS (type) != 2)
|
||
return NULL;
|
||
|
||
/* Try to be a bit resilient if the ABI changes. */
|
||
int vtable_field = 0;
|
||
for (int i = 0; i < 2; ++i)
|
||
{
|
||
if (strcmp (TYPE_FIELD_NAME (type, i), "vtable") == 0)
|
||
vtable_field = i;
|
||
else if (strcmp (TYPE_FIELD_NAME (type, i), "pointer") != 0)
|
||
return NULL;
|
||
}
|
||
|
||
CORE_ADDR vtable = value_as_address (value_field (value, vtable_field));
|
||
struct symbol *symbol = find_symbol_at_address (vtable);
|
||
if (symbol == NULL || symbol->subclass != SYMBOL_RUST_VTABLE)
|
||
return NULL;
|
||
|
||
struct rust_vtable_symbol *vtable_sym
|
||
= static_cast<struct rust_vtable_symbol *> (symbol);
|
||
struct type *pointer_type = lookup_pointer_type (vtable_sym->concrete_type);
|
||
return value_cast (pointer_type, value_field (value, 1 - vtable_field));
|
||
}
|
||
|
||
|
||
|
||
/* la_emitchar implementation for Rust. */
|
||
|
||
static void
|
||
rust_emitchar (int c, struct type *type, struct ui_file *stream, int quoter)
|
||
{
|
||
if (!rust_chartype_p (type))
|
||
generic_emit_char (c, type, stream, quoter,
|
||
target_charset (get_type_arch (type)));
|
||
else if (c == '\\' || c == quoter)
|
||
fprintf_filtered (stream, "\\%c", c);
|
||
else if (c == '\n')
|
||
fputs_filtered ("\\n", stream);
|
||
else if (c == '\r')
|
||
fputs_filtered ("\\r", stream);
|
||
else if (c == '\t')
|
||
fputs_filtered ("\\t", stream);
|
||
else if (c == '\0')
|
||
fputs_filtered ("\\0", stream);
|
||
else if (c >= 32 && c <= 127 && isprint (c))
|
||
fputc_filtered (c, stream);
|
||
else if (c <= 255)
|
||
fprintf_filtered (stream, "\\x%02x", c);
|
||
else
|
||
fprintf_filtered (stream, "\\u{%06x}", c);
|
||
}
|
||
|
||
/* la_printchar implementation for Rust. */
|
||
|
||
static void
|
||
rust_printchar (int c, struct type *type, struct ui_file *stream)
|
||
{
|
||
fputs_filtered ("'", stream);
|
||
LA_EMIT_CHAR (c, type, stream, '\'');
|
||
fputs_filtered ("'", stream);
|
||
}
|
||
|
||
/* la_printstr implementation for Rust. */
|
||
|
||
static void
|
||
rust_printstr (struct ui_file *stream, struct type *type,
|
||
const gdb_byte *string, unsigned int length,
|
||
const char *user_encoding, int force_ellipses,
|
||
const struct value_print_options *options)
|
||
{
|
||
/* Rust always uses UTF-8, but let the caller override this if need
|
||
be. */
|
||
const char *encoding = user_encoding;
|
||
if (user_encoding == NULL || !*user_encoding)
|
||
{
|
||
/* In Rust strings, characters are "u8". */
|
||
if (rust_u8_type_p (type))
|
||
encoding = "UTF-8";
|
||
else
|
||
{
|
||
/* This is probably some C string, so let's let C deal with
|
||
it. */
|
||
c_printstr (stream, type, string, length, user_encoding,
|
||
force_ellipses, options);
|
||
return;
|
||
}
|
||
}
|
||
|
||
/* This is not ideal as it doesn't use our character printer. */
|
||
generic_printstr (stream, type, string, length, encoding, force_ellipses,
|
||
'"', 0, options);
|
||
}
|
||
|
||
|
||
|
||
/* Helper function to print a string slice. */
|
||
|
||
static void
|
||
rust_val_print_str (struct ui_file *stream, struct value *val,
|
||
const struct value_print_options *options)
|
||
{
|
||
struct value *base = value_struct_elt (&val, NULL, "data_ptr", NULL,
|
||
"slice");
|
||
struct value *len = value_struct_elt (&val, NULL, "length", NULL, "slice");
|
||
|
||
val_print_string (TYPE_TARGET_TYPE (value_type (base)), "UTF-8",
|
||
value_as_address (base), value_as_long (len), stream,
|
||
options);
|
||
}
|
||
|
||
/* rust_val_print helper for structs and untagged unions. */
|
||
|
||
static void
|
||
val_print_struct (struct type *type, int embedded_offset,
|
||
CORE_ADDR address, struct ui_file *stream,
|
||
int recurse, struct value *val,
|
||
const struct value_print_options *options)
|
||
{
|
||
int i;
|
||
int first_field;
|
||
|
||
if (rust_slice_type_p (type) && strcmp (TYPE_NAME (type), "&str") == 0)
|
||
{
|
||
rust_val_print_str (stream, val, options);
|
||
return;
|
||
}
|
||
|
||
bool is_tuple = rust_tuple_type_p (type);
|
||
bool is_tuple_struct = !is_tuple && rust_tuple_struct_type_p (type);
|
||
struct value_print_options opts;
|
||
|
||
if (!is_tuple)
|
||
{
|
||
if (TYPE_NAME (type) != NULL)
|
||
fprintf_filtered (stream, "%s", TYPE_NAME (type));
|
||
|
||
if (TYPE_NFIELDS (type) == 0)
|
||
return;
|
||
|
||
if (TYPE_NAME (type) != NULL)
|
||
fputs_filtered (" ", stream);
|
||
}
|
||
|
||
if (is_tuple || is_tuple_struct)
|
||
fputs_filtered ("(", stream);
|
||
else
|
||
fputs_filtered ("{", stream);
|
||
|
||
opts = *options;
|
||
opts.deref_ref = 0;
|
||
|
||
first_field = 1;
|
||
for (i = 0; i < TYPE_NFIELDS (type); ++i)
|
||
{
|
||
if (field_is_static (&TYPE_FIELD (type, i)))
|
||
continue;
|
||
|
||
if (!first_field)
|
||
fputs_filtered (",", stream);
|
||
|
||
if (options->prettyformat)
|
||
{
|
||
fputs_filtered ("\n", stream);
|
||
print_spaces_filtered (2 + 2 * recurse, stream);
|
||
}
|
||
else if (!first_field)
|
||
fputs_filtered (" ", stream);
|
||
|
||
first_field = 0;
|
||
|
||
if (!is_tuple && !is_tuple_struct)
|
||
{
|
||
fputs_filtered (TYPE_FIELD_NAME (type, i), stream);
|
||
fputs_filtered (": ", stream);
|
||
}
|
||
|
||
val_print (TYPE_FIELD_TYPE (type, i),
|
||
embedded_offset + TYPE_FIELD_BITPOS (type, i) / 8,
|
||
address,
|
||
stream, recurse + 1, val, &opts,
|
||
current_language);
|
||
}
|
||
|
||
if (options->prettyformat)
|
||
{
|
||
fputs_filtered ("\n", stream);
|
||
print_spaces_filtered (2 * recurse, stream);
|
||
}
|
||
|
||
if (is_tuple || is_tuple_struct)
|
||
fputs_filtered (")", stream);
|
||
else
|
||
fputs_filtered ("}", stream);
|
||
}
|
||
|
||
/* rust_val_print helper for discriminated unions (Rust enums). */
|
||
|
||
static void
|
||
rust_print_enum (struct type *type, int embedded_offset,
|
||
CORE_ADDR address, struct ui_file *stream,
|
||
int recurse, struct value *val,
|
||
const struct value_print_options *options)
|
||
{
|
||
struct value_print_options opts = *options;
|
||
|
||
opts.deref_ref = 0;
|
||
|
||
if (rust_empty_enum_p (type))
|
||
{
|
||
/* Print the enum type name here to be more clear. */
|
||
fprintf_filtered (stream, _("%s {<No data fields>}"), TYPE_NAME (type));
|
||
return;
|
||
}
|
||
|
||
const gdb_byte *valaddr = value_contents_for_printing (val);
|
||
struct field *variant_field = rust_enum_variant (type, valaddr);
|
||
embedded_offset += FIELD_BITPOS (*variant_field) / 8;
|
||
struct type *variant_type = FIELD_TYPE (*variant_field);
|
||
|
||
int nfields = TYPE_NFIELDS (variant_type);
|
||
|
||
bool is_tuple = rust_tuple_struct_type_p (variant_type);
|
||
|
||
fprintf_filtered (stream, "%s", TYPE_NAME (variant_type));
|
||
if (nfields == 0)
|
||
{
|
||
/* In case of a nullary variant like 'None', just output
|
||
the name. */
|
||
return;
|
||
}
|
||
|
||
/* In case of a non-nullary variant, we output 'Foo(x,y,z)'. */
|
||
if (is_tuple)
|
||
fprintf_filtered (stream, "(");
|
||
else
|
||
{
|
||
/* struct variant. */
|
||
fprintf_filtered (stream, "{");
|
||
}
|
||
|
||
bool first_field = true;
|
||
for (int j = 0; j < TYPE_NFIELDS (variant_type); j++)
|
||
{
|
||
if (!first_field)
|
||
fputs_filtered (", ", stream);
|
||
first_field = false;
|
||
|
||
if (!is_tuple)
|
||
fprintf_filtered (stream, "%s: ",
|
||
TYPE_FIELD_NAME (variant_type, j));
|
||
|
||
val_print (TYPE_FIELD_TYPE (variant_type, j),
|
||
(embedded_offset
|
||
+ TYPE_FIELD_BITPOS (variant_type, j) / 8),
|
||
address,
|
||
stream, recurse + 1, val, &opts,
|
||
current_language);
|
||
}
|
||
|
||
if (is_tuple)
|
||
fputs_filtered (")", stream);
|
||
else
|
||
fputs_filtered ("}", stream);
|
||
}
|
||
|
||
static const struct generic_val_print_decorations rust_decorations =
|
||
{
|
||
/* Complex isn't used in Rust, but we provide C-ish values just in
|
||
case. */
|
||
"",
|
||
" + ",
|
||
" * I",
|
||
"true",
|
||
"false",
|
||
"()",
|
||
"[",
|
||
"]"
|
||
};
|
||
|
||
/* la_val_print implementation for Rust. */
|
||
|
||
static void
|
||
rust_val_print (struct type *type, int embedded_offset,
|
||
CORE_ADDR address, struct ui_file *stream, int recurse,
|
||
struct value *val,
|
||
const struct value_print_options *options)
|
||
{
|
||
const gdb_byte *valaddr = value_contents_for_printing (val);
|
||
|
||
type = check_typedef (type);
|
||
switch (TYPE_CODE (type))
|
||
{
|
||
case TYPE_CODE_PTR:
|
||
{
|
||
LONGEST low_bound, high_bound;
|
||
|
||
if (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_ARRAY
|
||
&& rust_u8_type_p (TYPE_TARGET_TYPE (TYPE_TARGET_TYPE (type)))
|
||
&& get_array_bounds (TYPE_TARGET_TYPE (type), &low_bound,
|
||
&high_bound)) {
|
||
/* We have a pointer to a byte string, so just print
|
||
that. */
|
||
struct type *elttype = check_typedef (TYPE_TARGET_TYPE (type));
|
||
CORE_ADDR addr;
|
||
struct gdbarch *arch = get_type_arch (type);
|
||
int unit_size = gdbarch_addressable_memory_unit_size (arch);
|
||
|
||
addr = unpack_pointer (type, valaddr + embedded_offset * unit_size);
|
||
if (options->addressprint)
|
||
{
|
||
fputs_filtered (paddress (arch, addr), stream);
|
||
fputs_filtered (" ", stream);
|
||
}
|
||
|
||
fputs_filtered ("b", stream);
|
||
val_print_string (TYPE_TARGET_TYPE (elttype), "ASCII", addr,
|
||
high_bound - low_bound + 1, stream,
|
||
options);
|
||
break;
|
||
}
|
||
}
|
||
/* Fall through. */
|
||
|
||
case TYPE_CODE_METHODPTR:
|
||
case TYPE_CODE_MEMBERPTR:
|
||
c_val_print (type, embedded_offset, address, stream,
|
||
recurse, val, options);
|
||
break;
|
||
|
||
case TYPE_CODE_INT:
|
||
/* Recognize the unit type. */
|
||
if (TYPE_UNSIGNED (type) && TYPE_LENGTH (type) == 0
|
||
&& TYPE_NAME (type) != NULL && strcmp (TYPE_NAME (type), "()") == 0)
|
||
{
|
||
fputs_filtered ("()", stream);
|
||
break;
|
||
}
|
||
goto generic_print;
|
||
|
||
case TYPE_CODE_STRING:
|
||
{
|
||
struct gdbarch *arch = get_type_arch (type);
|
||
int unit_size = gdbarch_addressable_memory_unit_size (arch);
|
||
LONGEST low_bound, high_bound;
|
||
|
||
if (!get_array_bounds (type, &low_bound, &high_bound))
|
||
error (_("Could not determine the array bounds"));
|
||
|
||
/* If we see a plain TYPE_CODE_STRING, then we're printing a
|
||
byte string, hence the choice of "ASCII" as the
|
||
encoding. */
|
||
fputs_filtered ("b", stream);
|
||
rust_printstr (stream, TYPE_TARGET_TYPE (type),
|
||
valaddr + embedded_offset * unit_size,
|
||
high_bound - low_bound + 1, "ASCII", 0, options);
|
||
}
|
||
break;
|
||
|
||
case TYPE_CODE_ARRAY:
|
||
{
|
||
LONGEST low_bound, high_bound;
|
||
|
||
if (get_array_bounds (type, &low_bound, &high_bound)
|
||
&& high_bound - low_bound + 1 == 0)
|
||
fputs_filtered ("[]", stream);
|
||
else
|
||
goto generic_print;
|
||
}
|
||
break;
|
||
|
||
case TYPE_CODE_UNION:
|
||
/* Untagged unions are printed as if they are structs. Since
|
||
the field bit positions overlap in the debuginfo, the code
|
||
for printing a union is same as that for a struct, the only
|
||
difference is that the input type will have overlapping
|
||
fields. */
|
||
val_print_struct (type, embedded_offset, address, stream,
|
||
recurse, val, options);
|
||
break;
|
||
|
||
case TYPE_CODE_STRUCT:
|
||
if (rust_enum_p (type))
|
||
rust_print_enum (type, embedded_offset, address, stream,
|
||
recurse, val, options);
|
||
else
|
||
val_print_struct (type, embedded_offset, address, stream,
|
||
recurse, val, options);
|
||
break;
|
||
|
||
default:
|
||
generic_print:
|
||
/* Nothing special yet. */
|
||
generic_val_print (type, embedded_offset, address, stream,
|
||
recurse, val, options, &rust_decorations);
|
||
}
|
||
}
|
||
|
||
|
||
|
||
static void
|
||
rust_internal_print_type (struct type *type, const char *varstring,
|
||
struct ui_file *stream, int show, int level,
|
||
const struct type_print_options *flags,
|
||
bool for_rust_enum, print_offset_data *podata);
|
||
|
||
/* Print a struct or union typedef. */
|
||
static void
|
||
rust_print_struct_def (struct type *type, const char *varstring,
|
||
struct ui_file *stream, int show, int level,
|
||
const struct type_print_options *flags,
|
||
bool for_rust_enum, print_offset_data *podata)
|
||
{
|
||
/* Print a tuple type simply. */
|
||
if (rust_tuple_type_p (type))
|
||
{
|
||
fputs_filtered (TYPE_NAME (type), stream);
|
||
return;
|
||
}
|
||
|
||
/* If we see a base class, delegate to C. */
|
||
if (TYPE_N_BASECLASSES (type) > 0)
|
||
c_print_type (type, varstring, stream, show, level, flags);
|
||
|
||
if (flags->print_offsets)
|
||
{
|
||
/* Temporarily bump the level so that the output lines up
|
||
correctly. */
|
||
level += 2;
|
||
}
|
||
|
||
/* Compute properties of TYPE here because, in the enum case, the
|
||
rest of the code ends up looking only at the variant part. */
|
||
const char *tagname = TYPE_NAME (type);
|
||
bool is_tuple_struct = rust_tuple_struct_type_p (type);
|
||
bool is_tuple = rust_tuple_type_p (type);
|
||
bool is_enum = rust_enum_p (type);
|
||
|
||
int enum_discriminant_index = -1;
|
||
|
||
if (for_rust_enum)
|
||
{
|
||
/* Already printing an outer enum, so nothing to print here. */
|
||
}
|
||
else
|
||
{
|
||
/* This code path is also used by unions and enums. */
|
||
if (is_enum)
|
||
{
|
||
fputs_filtered ("enum ", stream);
|
||
|
||
if (rust_empty_enum_p (type))
|
||
{
|
||
if (tagname != NULL)
|
||
{
|
||
fputs_filtered (tagname, stream);
|
||
fputs_filtered (" ", stream);
|
||
}
|
||
fputs_filtered ("{}", stream);
|
||
return;
|
||
}
|
||
|
||
type = TYPE_FIELD_TYPE (type, 0);
|
||
|
||
struct dynamic_prop *discriminant_prop
|
||
= get_dyn_prop (DYN_PROP_DISCRIMINATED, type);
|
||
struct discriminant_info *info
|
||
= (struct discriminant_info *) discriminant_prop->data.baton;
|
||
enum_discriminant_index = info->discriminant_index;
|
||
}
|
||
else if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
||
fputs_filtered ("struct ", stream);
|
||
else
|
||
fputs_filtered ("union ", stream);
|
||
|
||
if (tagname != NULL)
|
||
fputs_filtered (tagname, stream);
|
||
}
|
||
|
||
if (TYPE_NFIELDS (type) == 0 && !is_tuple)
|
||
return;
|
||
if (for_rust_enum && !flags->print_offsets)
|
||
fputs_filtered (is_tuple_struct ? "(" : "{", stream);
|
||
else
|
||
fputs_filtered (is_tuple_struct ? " (\n" : " {\n", stream);
|
||
|
||
/* When printing offsets, we rearrange the fields into storage
|
||
order. This lets us show holes more clearly. We work using
|
||
field indices here because it simplifies calls to
|
||
print_offset_data::update below. */
|
||
std::vector<int> fields;
|
||
for (int i = 0; i < TYPE_NFIELDS (type); ++i)
|
||
{
|
||
if (field_is_static (&TYPE_FIELD (type, i)))
|
||
continue;
|
||
if (is_enum && i == enum_discriminant_index)
|
||
continue;
|
||
fields.push_back (i);
|
||
}
|
||
if (flags->print_offsets)
|
||
std::sort (fields.begin (), fields.end (),
|
||
[&] (int a, int b)
|
||
{
|
||
return (TYPE_FIELD_BITPOS (type, a)
|
||
< TYPE_FIELD_BITPOS (type, b));
|
||
});
|
||
|
||
for (int i : fields)
|
||
{
|
||
QUIT;
|
||
|
||
gdb_assert (!field_is_static (&TYPE_FIELD (type, i)));
|
||
gdb_assert (! (is_enum && i == enum_discriminant_index));
|
||
|
||
if (flags->print_offsets)
|
||
podata->update (type, i, stream);
|
||
|
||
/* We'd like to print "pub" here as needed, but rustc
|
||
doesn't emit the debuginfo, and our types don't have
|
||
cplus_struct_type attached. */
|
||
|
||
/* For a tuple struct we print the type but nothing
|
||
else. */
|
||
if (!for_rust_enum || flags->print_offsets)
|
||
print_spaces_filtered (level + 2, stream);
|
||
if (is_enum)
|
||
fputs_filtered (TYPE_FIELD_NAME (type, i), stream);
|
||
else if (!is_tuple_struct)
|
||
fprintf_filtered (stream, "%s: ", TYPE_FIELD_NAME (type, i));
|
||
|
||
rust_internal_print_type (TYPE_FIELD_TYPE (type, i), NULL,
|
||
stream, (is_enum ? show : show - 1),
|
||
level + 2, flags, is_enum, podata);
|
||
if (!for_rust_enum || flags->print_offsets)
|
||
fputs_filtered (",\n", stream);
|
||
/* Note that this check of "I" is ok because we only sorted the
|
||
fields by offset when print_offsets was set, so we won't take
|
||
this branch in that case. */
|
||
else if (i + 1 < TYPE_NFIELDS (type))
|
||
fputs_filtered (", ", stream);
|
||
}
|
||
|
||
if (flags->print_offsets)
|
||
{
|
||
/* Undo the temporary level increase we did above. */
|
||
level -= 2;
|
||
podata->finish (type, level, stream);
|
||
print_spaces_filtered (print_offset_data::indentation, stream);
|
||
if (level == 0)
|
||
print_spaces_filtered (2, stream);
|
||
}
|
||
if (!for_rust_enum || flags->print_offsets)
|
||
print_spaces_filtered (level, stream);
|
||
fputs_filtered (is_tuple_struct ? ")" : "}", stream);
|
||
}
|
||
|
||
/* la_print_typedef implementation for Rust. */
|
||
|
||
static void
|
||
rust_print_typedef (struct type *type,
|
||
struct symbol *new_symbol,
|
||
struct ui_file *stream)
|
||
{
|
||
type = check_typedef (type);
|
||
fprintf_filtered (stream, "type %s = ", SYMBOL_PRINT_NAME (new_symbol));
|
||
type_print (type, "", stream, 0);
|
||
fprintf_filtered (stream, ";\n");
|
||
}
|
||
|
||
/* la_print_type implementation for Rust. */
|
||
|
||
static void
|
||
rust_internal_print_type (struct type *type, const char *varstring,
|
||
struct ui_file *stream, int show, int level,
|
||
const struct type_print_options *flags,
|
||
bool for_rust_enum, print_offset_data *podata)
|
||
{
|
||
QUIT;
|
||
if (show <= 0
|
||
&& TYPE_NAME (type) != NULL)
|
||
{
|
||
/* Rust calls the unit type "void" in its debuginfo,
|
||
but we don't want to print it as that. */
|
||
if (TYPE_CODE (type) == TYPE_CODE_VOID)
|
||
fputs_filtered ("()", stream);
|
||
else
|
||
fputs_filtered (TYPE_NAME (type), stream);
|
||
return;
|
||
}
|
||
|
||
type = check_typedef (type);
|
||
switch (TYPE_CODE (type))
|
||
{
|
||
case TYPE_CODE_VOID:
|
||
/* If we have an enum, we've already printed the type's
|
||
unqualified name, and there is nothing else to print
|
||
here. */
|
||
if (!for_rust_enum)
|
||
fputs_filtered ("()", stream);
|
||
break;
|
||
|
||
case TYPE_CODE_FUNC:
|
||
/* Delegate varargs to the C printer. */
|
||
if (TYPE_VARARGS (type))
|
||
goto c_printer;
|
||
|
||
fputs_filtered ("fn ", stream);
|
||
if (varstring != NULL)
|
||
fputs_filtered (varstring, stream);
|
||
fputs_filtered ("(", stream);
|
||
for (int i = 0; i < TYPE_NFIELDS (type); ++i)
|
||
{
|
||
QUIT;
|
||
if (i > 0)
|
||
fputs_filtered (", ", stream);
|
||
rust_internal_print_type (TYPE_FIELD_TYPE (type, i), "", stream,
|
||
-1, 0, flags, false, podata);
|
||
}
|
||
fputs_filtered (")", stream);
|
||
/* If it returns unit, we can omit the return type. */
|
||
if (TYPE_CODE (TYPE_TARGET_TYPE (type)) != TYPE_CODE_VOID)
|
||
{
|
||
fputs_filtered (" -> ", stream);
|
||
rust_internal_print_type (TYPE_TARGET_TYPE (type), "", stream,
|
||
-1, 0, flags, false, podata);
|
||
}
|
||
break;
|
||
|
||
case TYPE_CODE_ARRAY:
|
||
{
|
||
LONGEST low_bound, high_bound;
|
||
|
||
fputs_filtered ("[", stream);
|
||
rust_internal_print_type (TYPE_TARGET_TYPE (type), NULL,
|
||
stream, show - 1, level, flags, false,
|
||
podata);
|
||
|
||
if (TYPE_HIGH_BOUND_KIND (TYPE_INDEX_TYPE (type)) == PROP_LOCEXPR
|
||
|| TYPE_HIGH_BOUND_KIND (TYPE_INDEX_TYPE (type)) == PROP_LOCLIST)
|
||
fprintf_filtered (stream, "; variable length");
|
||
else if (get_array_bounds (type, &low_bound, &high_bound))
|
||
fprintf_filtered (stream, "; %s",
|
||
plongest (high_bound - low_bound + 1));
|
||
fputs_filtered ("]", stream);
|
||
}
|
||
break;
|
||
|
||
case TYPE_CODE_UNION:
|
||
case TYPE_CODE_STRUCT:
|
||
rust_print_struct_def (type, varstring, stream, show, level, flags,
|
||
for_rust_enum, podata);
|
||
break;
|
||
|
||
case TYPE_CODE_ENUM:
|
||
{
|
||
int len = 0;
|
||
|
||
fputs_filtered ("enum ", stream);
|
||
if (TYPE_NAME (type) != NULL)
|
||
{
|
||
fputs_filtered (TYPE_NAME (type), stream);
|
||
fputs_filtered (" ", stream);
|
||
len = strlen (TYPE_NAME (type));
|
||
}
|
||
fputs_filtered ("{\n", stream);
|
||
|
||
for (int i = 0; i < TYPE_NFIELDS (type); ++i)
|
||
{
|
||
const char *name = TYPE_FIELD_NAME (type, i);
|
||
|
||
QUIT;
|
||
|
||
if (len > 0
|
||
&& strncmp (name, TYPE_NAME (type), len) == 0
|
||
&& name[len] == ':'
|
||
&& name[len + 1] == ':')
|
||
name += len + 2;
|
||
fprintfi_filtered (level + 2, stream, "%s,\n", name);
|
||
}
|
||
|
||
fputs_filtered ("}", stream);
|
||
}
|
||
break;
|
||
|
||
case TYPE_CODE_PTR:
|
||
{
|
||
if (TYPE_NAME (type) != nullptr)
|
||
fputs_filtered (TYPE_NAME (type), stream);
|
||
else
|
||
{
|
||
/* We currently can't distinguish between pointers and
|
||
references. */
|
||
fputs_filtered ("*mut ", stream);
|
||
type_print (TYPE_TARGET_TYPE (type), "", stream, 0);
|
||
}
|
||
}
|
||
break;
|
||
|
||
default:
|
||
c_printer:
|
||
c_print_type (type, varstring, stream, show, level, flags);
|
||
}
|
||
}
|
||
|
||
static void
|
||
rust_print_type (struct type *type, const char *varstring,
|
||
struct ui_file *stream, int show, int level,
|
||
const struct type_print_options *flags)
|
||
{
|
||
print_offset_data podata;
|
||
rust_internal_print_type (type, varstring, stream, show, level,
|
||
flags, false, &podata);
|
||
}
|
||
|
||
|
||
|
||
/* Like arch_composite_type, but uses TYPE to decide how to allocate
|
||
-- either on an obstack or on a gdbarch. */
|
||
|
||
static struct type *
|
||
rust_composite_type (struct type *original,
|
||
const char *name,
|
||
const char *field1, struct type *type1,
|
||
const char *field2, struct type *type2)
|
||
{
|
||
struct type *result = alloc_type_copy (original);
|
||
int i, nfields, bitpos;
|
||
|
||
nfields = 0;
|
||
if (field1 != NULL)
|
||
++nfields;
|
||
if (field2 != NULL)
|
||
++nfields;
|
||
|
||
TYPE_CODE (result) = TYPE_CODE_STRUCT;
|
||
TYPE_NAME (result) = name;
|
||
|
||
TYPE_NFIELDS (result) = nfields;
|
||
TYPE_FIELDS (result)
|
||
= (struct field *) TYPE_ZALLOC (result, nfields * sizeof (struct field));
|
||
|
||
i = 0;
|
||
bitpos = 0;
|
||
if (field1 != NULL)
|
||
{
|
||
struct field *field = &TYPE_FIELD (result, i);
|
||
|
||
SET_FIELD_BITPOS (*field, bitpos);
|
||
bitpos += TYPE_LENGTH (type1) * TARGET_CHAR_BIT;
|
||
|
||
FIELD_NAME (*field) = field1;
|
||
FIELD_TYPE (*field) = type1;
|
||
++i;
|
||
}
|
||
if (field2 != NULL)
|
||
{
|
||
struct field *field = &TYPE_FIELD (result, i);
|
||
unsigned align = type_align (type2);
|
||
|
||
if (align != 0)
|
||
{
|
||
int delta;
|
||
|
||
align *= TARGET_CHAR_BIT;
|
||
delta = bitpos % align;
|
||
if (delta != 0)
|
||
bitpos += align - delta;
|
||
}
|
||
SET_FIELD_BITPOS (*field, bitpos);
|
||
|
||
FIELD_NAME (*field) = field2;
|
||
FIELD_TYPE (*field) = type2;
|
||
++i;
|
||
}
|
||
|
||
if (i > 0)
|
||
TYPE_LENGTH (result)
|
||
= (TYPE_FIELD_BITPOS (result, i - 1) / TARGET_CHAR_BIT +
|
||
TYPE_LENGTH (TYPE_FIELD_TYPE (result, i - 1)));
|
||
return result;
|
||
}
|
||
|
||
/* See rust-lang.h. */
|
||
|
||
struct type *
|
||
rust_slice_type (const char *name, struct type *elt_type,
|
||
struct type *usize_type)
|
||
{
|
||
struct type *type;
|
||
|
||
elt_type = lookup_pointer_type (elt_type);
|
||
type = rust_composite_type (elt_type, name,
|
||
"data_ptr", elt_type,
|
||
"length", usize_type);
|
||
|
||
return type;
|
||
}
|
||
|
||
enum rust_primitive_types
|
||
{
|
||
rust_primitive_bool,
|
||
rust_primitive_char,
|
||
rust_primitive_i8,
|
||
rust_primitive_u8,
|
||
rust_primitive_i16,
|
||
rust_primitive_u16,
|
||
rust_primitive_i32,
|
||
rust_primitive_u32,
|
||
rust_primitive_i64,
|
||
rust_primitive_u64,
|
||
rust_primitive_isize,
|
||
rust_primitive_usize,
|
||
rust_primitive_f32,
|
||
rust_primitive_f64,
|
||
rust_primitive_unit,
|
||
rust_primitive_str,
|
||
nr_rust_primitive_types
|
||
};
|
||
|
||
/* la_language_arch_info implementation for Rust. */
|
||
|
||
static void
|
||
rust_language_arch_info (struct gdbarch *gdbarch,
|
||
struct language_arch_info *lai)
|
||
{
|
||
const struct builtin_type *builtin = builtin_type (gdbarch);
|
||
struct type *tem;
|
||
struct type **types;
|
||
unsigned int length;
|
||
|
||
types = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_rust_primitive_types + 1,
|
||
struct type *);
|
||
|
||
types[rust_primitive_bool] = arch_boolean_type (gdbarch, 8, 1, "bool");
|
||
types[rust_primitive_char] = arch_character_type (gdbarch, 32, 1, "char");
|
||
types[rust_primitive_i8] = arch_integer_type (gdbarch, 8, 0, "i8");
|
||
types[rust_primitive_u8] = arch_integer_type (gdbarch, 8, 1, "u8");
|
||
types[rust_primitive_i16] = arch_integer_type (gdbarch, 16, 0, "i16");
|
||
types[rust_primitive_u16] = arch_integer_type (gdbarch, 16, 1, "u16");
|
||
types[rust_primitive_i32] = arch_integer_type (gdbarch, 32, 0, "i32");
|
||
types[rust_primitive_u32] = arch_integer_type (gdbarch, 32, 1, "u32");
|
||
types[rust_primitive_i64] = arch_integer_type (gdbarch, 64, 0, "i64");
|
||
types[rust_primitive_u64] = arch_integer_type (gdbarch, 64, 1, "u64");
|
||
|
||
length = 8 * TYPE_LENGTH (builtin->builtin_data_ptr);
|
||
types[rust_primitive_isize] = arch_integer_type (gdbarch, length, 0, "isize");
|
||
types[rust_primitive_usize] = arch_integer_type (gdbarch, length, 1, "usize");
|
||
|
||
types[rust_primitive_f32] = arch_float_type (gdbarch, 32, "f32",
|
||
floatformats_ieee_single);
|
||
types[rust_primitive_f64] = arch_float_type (gdbarch, 64, "f64",
|
||
floatformats_ieee_double);
|
||
|
||
types[rust_primitive_unit] = arch_integer_type (gdbarch, 0, 1, "()");
|
||
|
||
tem = make_cv_type (1, 0, types[rust_primitive_u8], NULL);
|
||
types[rust_primitive_str] = rust_slice_type ("&str", tem,
|
||
types[rust_primitive_usize]);
|
||
|
||
lai->primitive_type_vector = types;
|
||
lai->bool_type_default = types[rust_primitive_bool];
|
||
lai->string_char_type = types[rust_primitive_u8];
|
||
}
|
||
|
||
|
||
|
||
/* A helper for rust_evaluate_subexp that handles OP_FUNCALL. */
|
||
|
||
static struct value *
|
||
rust_evaluate_funcall (struct expression *exp, int *pos, enum noside noside)
|
||
{
|
||
int i;
|
||
int num_args = exp->elts[*pos + 1].longconst;
|
||
const char *method;
|
||
struct value *function, *result, *arg0;
|
||
struct type *type, *fn_type;
|
||
const struct block *block;
|
||
struct block_symbol sym;
|
||
|
||
/* For an ordinary function call we can simply defer to the
|
||
generic implementation. */
|
||
if (exp->elts[*pos + 3].opcode != STRUCTOP_STRUCT)
|
||
return evaluate_subexp_standard (NULL, exp, pos, noside);
|
||
|
||
/* Skip over the OP_FUNCALL and the STRUCTOP_STRUCT. */
|
||
*pos += 4;
|
||
method = &exp->elts[*pos + 1].string;
|
||
*pos += 3 + BYTES_TO_EXP_ELEM (exp->elts[*pos].longconst + 1);
|
||
|
||
/* Evaluate the argument to STRUCTOP_STRUCT, then find its
|
||
type in order to look up the method. */
|
||
arg0 = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
||
|
||
if (noside == EVAL_SKIP)
|
||
{
|
||
for (i = 0; i < num_args; ++i)
|
||
evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
||
return arg0;
|
||
}
|
||
|
||
std::vector<struct value *> args (num_args + 1);
|
||
args[0] = arg0;
|
||
|
||
/* We don't yet implement real Deref semantics. */
|
||
while (TYPE_CODE (value_type (args[0])) == TYPE_CODE_PTR)
|
||
args[0] = value_ind (args[0]);
|
||
|
||
type = value_type (args[0]);
|
||
if ((TYPE_CODE (type) != TYPE_CODE_STRUCT
|
||
&& TYPE_CODE (type) != TYPE_CODE_UNION
|
||
&& TYPE_CODE (type) != TYPE_CODE_ENUM)
|
||
|| rust_tuple_type_p (type))
|
||
error (_("Method calls only supported on struct or enum types"));
|
||
if (TYPE_NAME (type) == NULL)
|
||
error (_("Method call on nameless type"));
|
||
|
||
std::string name = std::string (TYPE_NAME (type)) + "::" + method;
|
||
|
||
block = get_selected_block (0);
|
||
sym = lookup_symbol (name.c_str (), block, VAR_DOMAIN, NULL);
|
||
if (sym.symbol == NULL)
|
||
error (_("Could not find function named '%s'"), name.c_str ());
|
||
|
||
fn_type = SYMBOL_TYPE (sym.symbol);
|
||
if (TYPE_NFIELDS (fn_type) == 0)
|
||
error (_("Function '%s' takes no arguments"), name.c_str ());
|
||
|
||
if (TYPE_CODE (TYPE_FIELD_TYPE (fn_type, 0)) == TYPE_CODE_PTR)
|
||
args[0] = value_addr (args[0]);
|
||
|
||
function = address_of_variable (sym.symbol, block);
|
||
|
||
for (i = 0; i < num_args; ++i)
|
||
args[i + 1] = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
||
|
||
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
||
result = value_zero (TYPE_TARGET_TYPE (fn_type), not_lval);
|
||
else
|
||
result = call_function_by_hand (function, NULL, args);
|
||
return result;
|
||
}
|
||
|
||
/* A helper for rust_evaluate_subexp that handles OP_RANGE. */
|
||
|
||
static struct value *
|
||
rust_range (struct expression *exp, int *pos, enum noside noside)
|
||
{
|
||
enum range_type kind;
|
||
struct value *low = NULL, *high = NULL;
|
||
struct value *addrval, *result;
|
||
CORE_ADDR addr;
|
||
struct type *range_type;
|
||
struct type *index_type;
|
||
struct type *temp_type;
|
||
const char *name;
|
||
|
||
kind = (enum range_type) longest_to_int (exp->elts[*pos + 1].longconst);
|
||
*pos += 3;
|
||
|
||
if (kind == HIGH_BOUND_DEFAULT || kind == NONE_BOUND_DEFAULT
|
||
|| kind == NONE_BOUND_DEFAULT_EXCLUSIVE)
|
||
low = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
||
if (kind == LOW_BOUND_DEFAULT || kind == LOW_BOUND_DEFAULT_EXCLUSIVE
|
||
|| kind == NONE_BOUND_DEFAULT || kind == NONE_BOUND_DEFAULT_EXCLUSIVE)
|
||
high = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
||
bool inclusive = (kind == NONE_BOUND_DEFAULT || kind == LOW_BOUND_DEFAULT);
|
||
|
||
if (noside == EVAL_SKIP)
|
||
return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, 1);
|
||
|
||
if (low == NULL)
|
||
{
|
||
if (high == NULL)
|
||
{
|
||
index_type = NULL;
|
||
name = "std::ops::RangeFull";
|
||
}
|
||
else
|
||
{
|
||
index_type = value_type (high);
|
||
name = (inclusive
|
||
? "std::ops::RangeToInclusive" : "std::ops::RangeTo");
|
||
}
|
||
}
|
||
else
|
||
{
|
||
if (high == NULL)
|
||
{
|
||
index_type = value_type (low);
|
||
name = "std::ops::RangeFrom";
|
||
}
|
||
else
|
||
{
|
||
if (!types_equal (value_type (low), value_type (high)))
|
||
error (_("Range expression with different types"));
|
||
index_type = value_type (low);
|
||
name = inclusive ? "std::ops::RangeInclusive" : "std::ops::Range";
|
||
}
|
||
}
|
||
|
||
/* If we don't have an index type, just allocate this on the
|
||
arch. Here any type will do. */
|
||
temp_type = (index_type == NULL
|
||
? language_bool_type (exp->language_defn, exp->gdbarch)
|
||
: index_type);
|
||
/* It would be nicer to cache the range type. */
|
||
range_type = rust_composite_type (temp_type, name,
|
||
low == NULL ? NULL : "start", index_type,
|
||
high == NULL ? NULL : "end", index_type);
|
||
|
||
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
||
return value_zero (range_type, lval_memory);
|
||
|
||
addrval = value_allocate_space_in_inferior (TYPE_LENGTH (range_type));
|
||
addr = value_as_long (addrval);
|
||
result = value_at_lazy (range_type, addr);
|
||
|
||
if (low != NULL)
|
||
{
|
||
struct value *start = value_struct_elt (&result, NULL, "start", NULL,
|
||
"range");
|
||
|
||
value_assign (start, low);
|
||
}
|
||
|
||
if (high != NULL)
|
||
{
|
||
struct value *end = value_struct_elt (&result, NULL, "end", NULL,
|
||
"range");
|
||
|
||
value_assign (end, high);
|
||
}
|
||
|
||
result = value_at_lazy (range_type, addr);
|
||
return result;
|
||
}
|
||
|
||
/* A helper function to compute the range and kind given a range
|
||
value. TYPE is the type of the range value. RANGE is the range
|
||
value. LOW, HIGH, and KIND are out parameters. The LOW and HIGH
|
||
parameters might be filled in, or might not be, depending on the
|
||
kind of range this is. KIND will always be set to the appropriate
|
||
value describing the kind of range, and this can be used to
|
||
determine whether LOW or HIGH are valid. */
|
||
|
||
static void
|
||
rust_compute_range (struct type *type, struct value *range,
|
||
LONGEST *low, LONGEST *high,
|
||
enum range_type *kind)
|
||
{
|
||
int i;
|
||
|
||
*low = 0;
|
||
*high = 0;
|
||
*kind = BOTH_BOUND_DEFAULT;
|
||
|
||
if (TYPE_NFIELDS (type) == 0)
|
||
return;
|
||
|
||
i = 0;
|
||
if (strcmp (TYPE_FIELD_NAME (type, 0), "start") == 0)
|
||
{
|
||
*kind = HIGH_BOUND_DEFAULT;
|
||
*low = value_as_long (value_field (range, 0));
|
||
++i;
|
||
}
|
||
if (TYPE_NFIELDS (type) > i
|
||
&& strcmp (TYPE_FIELD_NAME (type, i), "end") == 0)
|
||
{
|
||
*kind = (*kind == BOTH_BOUND_DEFAULT
|
||
? LOW_BOUND_DEFAULT : NONE_BOUND_DEFAULT);
|
||
*high = value_as_long (value_field (range, i));
|
||
|
||
if (rust_inclusive_range_type_p (type))
|
||
++*high;
|
||
}
|
||
}
|
||
|
||
/* A helper for rust_evaluate_subexp that handles BINOP_SUBSCRIPT. */
|
||
|
||
static struct value *
|
||
rust_subscript (struct expression *exp, int *pos, enum noside noside,
|
||
int for_addr)
|
||
{
|
||
struct value *lhs, *rhs, *result;
|
||
struct type *rhstype;
|
||
LONGEST low, high_bound;
|
||
/* Initialized to appease the compiler. */
|
||
enum range_type kind = BOTH_BOUND_DEFAULT;
|
||
LONGEST high = 0;
|
||
int want_slice = 0;
|
||
|
||
++*pos;
|
||
lhs = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
||
rhs = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
||
|
||
if (noside == EVAL_SKIP)
|
||
return lhs;
|
||
|
||
rhstype = check_typedef (value_type (rhs));
|
||
if (rust_range_type_p (rhstype))
|
||
{
|
||
if (!for_addr)
|
||
error (_("Can't take slice of array without '&'"));
|
||
rust_compute_range (rhstype, rhs, &low, &high, &kind);
|
||
want_slice = 1;
|
||
}
|
||
else
|
||
low = value_as_long (rhs);
|
||
|
||
struct type *type = check_typedef (value_type (lhs));
|
||
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
||
{
|
||
struct type *base_type = nullptr;
|
||
if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
||
base_type = TYPE_TARGET_TYPE (type);
|
||
else if (rust_slice_type_p (type))
|
||
{
|
||
for (int i = 0; i < TYPE_NFIELDS (type); ++i)
|
||
{
|
||
if (strcmp (TYPE_FIELD_NAME (type, i), "data_ptr") == 0)
|
||
{
|
||
base_type = TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, i));
|
||
break;
|
||
}
|
||
}
|
||
if (base_type == nullptr)
|
||
error (_("Could not find 'data_ptr' in slice type"));
|
||
}
|
||
else if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
||
base_type = TYPE_TARGET_TYPE (type);
|
||
else
|
||
error (_("Cannot subscript non-array type"));
|
||
|
||
struct type *new_type;
|
||
if (want_slice)
|
||
{
|
||
if (rust_slice_type_p (type))
|
||
new_type = type;
|
||
else
|
||
{
|
||
struct type *usize
|
||
= language_lookup_primitive_type (exp->language_defn,
|
||
exp->gdbarch,
|
||
"usize");
|
||
new_type = rust_slice_type ("&[*gdb*]", base_type, usize);
|
||
}
|
||
}
|
||
else
|
||
new_type = base_type;
|
||
|
||
return value_zero (new_type, VALUE_LVAL (lhs));
|
||
}
|
||
else
|
||
{
|
||
LONGEST low_bound;
|
||
struct value *base;
|
||
|
||
if (TYPE_CODE (type) == TYPE_CODE_ARRAY)
|
||
{
|
||
base = lhs;
|
||
if (!get_array_bounds (type, &low_bound, &high_bound))
|
||
error (_("Can't compute array bounds"));
|
||
if (low_bound != 0)
|
||
error (_("Found array with non-zero lower bound"));
|
||
++high_bound;
|
||
}
|
||
else if (rust_slice_type_p (type))
|
||
{
|
||
struct value *len;
|
||
|
||
base = value_struct_elt (&lhs, NULL, "data_ptr", NULL, "slice");
|
||
len = value_struct_elt (&lhs, NULL, "length", NULL, "slice");
|
||
low_bound = 0;
|
||
high_bound = value_as_long (len);
|
||
}
|
||
else if (TYPE_CODE (type) == TYPE_CODE_PTR)
|
||
{
|
||
base = lhs;
|
||
low_bound = 0;
|
||
high_bound = LONGEST_MAX;
|
||
}
|
||
else
|
||
error (_("Cannot subscript non-array type"));
|
||
|
||
if (want_slice
|
||
&& (kind == BOTH_BOUND_DEFAULT || kind == LOW_BOUND_DEFAULT))
|
||
low = low_bound;
|
||
if (low < 0)
|
||
error (_("Index less than zero"));
|
||
if (low > high_bound)
|
||
error (_("Index greater than length"));
|
||
|
||
result = value_subscript (base, low);
|
||
}
|
||
|
||
if (for_addr)
|
||
{
|
||
if (want_slice)
|
||
{
|
||
struct type *usize, *slice;
|
||
CORE_ADDR addr;
|
||
struct value *addrval, *tem;
|
||
|
||
if (kind == BOTH_BOUND_DEFAULT || kind == HIGH_BOUND_DEFAULT)
|
||
high = high_bound;
|
||
if (high < 0)
|
||
error (_("High index less than zero"));
|
||
if (low > high)
|
||
error (_("Low index greater than high index"));
|
||
if (high > high_bound)
|
||
error (_("High index greater than length"));
|
||
|
||
usize = language_lookup_primitive_type (exp->language_defn,
|
||
exp->gdbarch,
|
||
"usize");
|
||
const char *new_name = ((type != nullptr
|
||
&& rust_slice_type_p (type))
|
||
? TYPE_NAME (type) : "&[*gdb*]");
|
||
|
||
slice = rust_slice_type (new_name, value_type (result), usize);
|
||
|
||
addrval = value_allocate_space_in_inferior (TYPE_LENGTH (slice));
|
||
addr = value_as_long (addrval);
|
||
tem = value_at_lazy (slice, addr);
|
||
|
||
value_assign (value_field (tem, 0), value_addr (result));
|
||
value_assign (value_field (tem, 1),
|
||
value_from_longest (usize, high - low));
|
||
|
||
result = value_at_lazy (slice, addr);
|
||
}
|
||
else
|
||
result = value_addr (result);
|
||
}
|
||
|
||
return result;
|
||
}
|
||
|
||
/* evaluate_exp implementation for Rust. */
|
||
|
||
static struct value *
|
||
rust_evaluate_subexp (struct type *expect_type, struct expression *exp,
|
||
int *pos, enum noside noside)
|
||
{
|
||
struct value *result;
|
||
|
||
switch (exp->elts[*pos].opcode)
|
||
{
|
||
case UNOP_IND:
|
||
{
|
||
if (noside != EVAL_NORMAL)
|
||
result = evaluate_subexp_standard (expect_type, exp, pos, noside);
|
||
else
|
||
{
|
||
++*pos;
|
||
struct value *value = evaluate_subexp (expect_type, exp, pos,
|
||
noside);
|
||
|
||
struct value *trait_ptr = rust_get_trait_object_pointer (value);
|
||
if (trait_ptr != NULL)
|
||
value = trait_ptr;
|
||
|
||
result = value_ind (value);
|
||
}
|
||
}
|
||
break;
|
||
|
||
case UNOP_COMPLEMENT:
|
||
{
|
||
struct value *value;
|
||
|
||
++*pos;
|
||
value = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
||
if (noside == EVAL_SKIP)
|
||
{
|
||
/* Preserving the type is enough. */
|
||
return value;
|
||
}
|
||
if (TYPE_CODE (value_type (value)) == TYPE_CODE_BOOL)
|
||
result = value_from_longest (value_type (value),
|
||
value_logical_not (value));
|
||
else
|
||
result = value_complement (value);
|
||
}
|
||
break;
|
||
|
||
case BINOP_SUBSCRIPT:
|
||
result = rust_subscript (exp, pos, noside, 0);
|
||
break;
|
||
|
||
case OP_FUNCALL:
|
||
result = rust_evaluate_funcall (exp, pos, noside);
|
||
break;
|
||
|
||
case OP_AGGREGATE:
|
||
{
|
||
int pc = (*pos)++;
|
||
struct type *type = exp->elts[pc + 1].type;
|
||
int arglen = longest_to_int (exp->elts[pc + 2].longconst);
|
||
int i;
|
||
CORE_ADDR addr = 0;
|
||
struct value *addrval = NULL;
|
||
|
||
*pos += 3;
|
||
|
||
if (noside == EVAL_NORMAL)
|
||
{
|
||
addrval = value_allocate_space_in_inferior (TYPE_LENGTH (type));
|
||
addr = value_as_long (addrval);
|
||
result = value_at_lazy (type, addr);
|
||
}
|
||
|
||
if (arglen > 0 && exp->elts[*pos].opcode == OP_OTHERS)
|
||
{
|
||
struct value *init;
|
||
|
||
++*pos;
|
||
init = rust_evaluate_subexp (NULL, exp, pos, noside);
|
||
if (noside == EVAL_NORMAL)
|
||
{
|
||
/* This isn't quite right but will do for the time
|
||
being, seeing that we can't implement the Copy
|
||
trait anyway. */
|
||
value_assign (result, init);
|
||
}
|
||
|
||
--arglen;
|
||
}
|
||
|
||
gdb_assert (arglen % 2 == 0);
|
||
for (i = 0; i < arglen; i += 2)
|
||
{
|
||
int len;
|
||
const char *fieldname;
|
||
struct value *value, *field;
|
||
|
||
gdb_assert (exp->elts[*pos].opcode == OP_NAME);
|
||
++*pos;
|
||
len = longest_to_int (exp->elts[*pos].longconst);
|
||
++*pos;
|
||
fieldname = &exp->elts[*pos].string;
|
||
*pos += 2 + BYTES_TO_EXP_ELEM (len + 1);
|
||
|
||
value = rust_evaluate_subexp (NULL, exp, pos, noside);
|
||
if (noside == EVAL_NORMAL)
|
||
{
|
||
field = value_struct_elt (&result, NULL, fieldname, NULL,
|
||
"structure");
|
||
value_assign (field, value);
|
||
}
|
||
}
|
||
|
||
if (noside == EVAL_SKIP)
|
||
return value_from_longest (builtin_type (exp->gdbarch)->builtin_int,
|
||
1);
|
||
else if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
||
result = allocate_value (type);
|
||
else
|
||
result = value_at_lazy (type, addr);
|
||
}
|
||
break;
|
||
|
||
case OP_RUST_ARRAY:
|
||
{
|
||
(*pos)++;
|
||
int copies;
|
||
struct value *elt;
|
||
struct value *ncopies;
|
||
|
||
elt = rust_evaluate_subexp (NULL, exp, pos, noside);
|
||
ncopies = rust_evaluate_subexp (NULL, exp, pos, noside);
|
||
copies = value_as_long (ncopies);
|
||
if (copies < 0)
|
||
error (_("Array with negative number of elements"));
|
||
|
||
if (noside == EVAL_NORMAL)
|
||
{
|
||
int i;
|
||
std::vector<struct value *> eltvec (copies);
|
||
|
||
for (i = 0; i < copies; ++i)
|
||
eltvec[i] = elt;
|
||
result = value_array (0, copies - 1, eltvec.data ());
|
||
}
|
||
else
|
||
{
|
||
struct type *arraytype
|
||
= lookup_array_range_type (value_type (elt), 0, copies - 1);
|
||
result = allocate_value (arraytype);
|
||
}
|
||
}
|
||
break;
|
||
|
||
case STRUCTOP_ANONYMOUS:
|
||
{
|
||
/* Anonymous field access, i.e. foo.1. */
|
||
struct value *lhs;
|
||
int pc, field_number, nfields;
|
||
struct type *type;
|
||
|
||
pc = (*pos)++;
|
||
field_number = longest_to_int (exp->elts[pc + 1].longconst);
|
||
(*pos) += 2;
|
||
lhs = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
||
|
||
type = value_type (lhs);
|
||
|
||
if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
|
||
{
|
||
struct type *outer_type = NULL;
|
||
|
||
if (rust_enum_p (type))
|
||
{
|
||
if (rust_empty_enum_p (type))
|
||
error (_("Cannot access field %d of empty enum %s"),
|
||
field_number, TYPE_NAME (type));
|
||
|
||
const gdb_byte *valaddr = value_contents (lhs);
|
||
struct field *variant_field = rust_enum_variant (type, valaddr);
|
||
|
||
struct value *union_value = value_primitive_field (lhs, 0, 0,
|
||
type);
|
||
|
||
int fieldno = (variant_field
|
||
- &TYPE_FIELD (value_type (union_value), 0));
|
||
lhs = value_primitive_field (union_value, 0, fieldno,
|
||
value_type (union_value));
|
||
outer_type = type;
|
||
type = value_type (lhs);
|
||
}
|
||
|
||
/* Tuples and tuple structs */
|
||
nfields = TYPE_NFIELDS (type);
|
||
|
||
if (field_number >= nfields || field_number < 0)
|
||
{
|
||
if (outer_type != NULL)
|
||
error(_("Cannot access field %d of variant %s::%s, "
|
||
"there are only %d fields"),
|
||
field_number, TYPE_NAME (outer_type),
|
||
rust_last_path_segment (TYPE_NAME (type)),
|
||
nfields);
|
||
else
|
||
error(_("Cannot access field %d of %s, "
|
||
"there are only %d fields"),
|
||
field_number, TYPE_NAME (type), nfields);
|
||
}
|
||
|
||
/* Tuples are tuple structs too. */
|
||
if (!rust_tuple_struct_type_p (type))
|
||
{
|
||
if (outer_type != NULL)
|
||
error(_("Variant %s::%s is not a tuple variant"),
|
||
TYPE_NAME (outer_type),
|
||
rust_last_path_segment (TYPE_NAME (type)));
|
||
else
|
||
error(_("Attempting to access anonymous field %d "
|
||
"of %s, which is not a tuple, tuple struct, or "
|
||
"tuple-like variant"),
|
||
field_number, TYPE_NAME (type));
|
||
}
|
||
|
||
result = value_primitive_field (lhs, 0, field_number, type);
|
||
}
|
||
else
|
||
error(_("Anonymous field access is only allowed on tuples, \
|
||
tuple structs, and tuple-like enum variants"));
|
||
}
|
||
break;
|
||
|
||
case STRUCTOP_STRUCT:
|
||
{
|
||
struct value *lhs;
|
||
struct type *type;
|
||
int tem, pc;
|
||
|
||
pc = (*pos)++;
|
||
tem = longest_to_int (exp->elts[pc + 1].longconst);
|
||
(*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1);
|
||
lhs = evaluate_subexp (NULL_TYPE, exp, pos, noside);
|
||
|
||
const char *field_name = &exp->elts[pc + 2].string;
|
||
type = value_type (lhs);
|
||
if (TYPE_CODE (type) == TYPE_CODE_STRUCT && rust_enum_p (type))
|
||
{
|
||
if (rust_empty_enum_p (type))
|
||
error (_("Cannot access field %s of empty enum %s"),
|
||
field_name, TYPE_NAME (type));
|
||
|
||
const gdb_byte *valaddr = value_contents (lhs);
|
||
struct field *variant_field = rust_enum_variant (type, valaddr);
|
||
|
||
struct value *union_value = value_primitive_field (lhs, 0, 0,
|
||
type);
|
||
|
||
int fieldno = (variant_field
|
||
- &TYPE_FIELD (value_type (union_value), 0));
|
||
lhs = value_primitive_field (union_value, 0, fieldno,
|
||
value_type (union_value));
|
||
|
||
struct type *outer_type = type;
|
||
type = value_type (lhs);
|
||
if (rust_tuple_type_p (type) || rust_tuple_struct_type_p (type))
|
||
error (_("Attempting to access named field %s of tuple "
|
||
"variant %s::%s, which has only anonymous fields"),
|
||
field_name, TYPE_NAME (outer_type),
|
||
rust_last_path_segment (TYPE_NAME (type)));
|
||
|
||
try
|
||
{
|
||
result = value_struct_elt (&lhs, NULL, field_name,
|
||
NULL, "structure");
|
||
}
|
||
catch (const gdb_exception_error &except)
|
||
{
|
||
error (_("Could not find field %s of struct variant %s::%s"),
|
||
field_name, TYPE_NAME (outer_type),
|
||
rust_last_path_segment (TYPE_NAME (type)));
|
||
}
|
||
}
|
||
else
|
||
result = value_struct_elt (&lhs, NULL, field_name, NULL, "structure");
|
||
if (noside == EVAL_AVOID_SIDE_EFFECTS)
|
||
result = value_zero (value_type (result), VALUE_LVAL (result));
|
||
}
|
||
break;
|
||
|
||
case OP_RANGE:
|
||
result = rust_range (exp, pos, noside);
|
||
break;
|
||
|
||
case UNOP_ADDR:
|
||
/* We might have &array[range], in which case we need to make a
|
||
slice. */
|
||
if (exp->elts[*pos + 1].opcode == BINOP_SUBSCRIPT)
|
||
{
|
||
++*pos;
|
||
result = rust_subscript (exp, pos, noside, 1);
|
||
break;
|
||
}
|
||
/* Fall through. */
|
||
default:
|
||
result = evaluate_subexp_standard (expect_type, exp, pos, noside);
|
||
break;
|
||
}
|
||
|
||
return result;
|
||
}
|
||
|
||
/* operator_length implementation for Rust. */
|
||
|
||
static void
|
||
rust_operator_length (const struct expression *exp, int pc, int *oplenp,
|
||
int *argsp)
|
||
{
|
||
int oplen = 1;
|
||
int args = 0;
|
||
|
||
switch (exp->elts[pc - 1].opcode)
|
||
{
|
||
case OP_AGGREGATE:
|
||
/* We handle aggregate as a type and argument count. The first
|
||
argument might be OP_OTHERS. After that the arguments
|
||
alternate: first an OP_NAME, then an expression. */
|
||
oplen = 4;
|
||
args = longest_to_int (exp->elts[pc - 2].longconst);
|
||
break;
|
||
|
||
case OP_OTHERS:
|
||
oplen = 1;
|
||
args = 1;
|
||
break;
|
||
|
||
case STRUCTOP_ANONYMOUS:
|
||
oplen = 3;
|
||
args = 1;
|
||
break;
|
||
|
||
case OP_RUST_ARRAY:
|
||
oplen = 1;
|
||
args = 2;
|
||
break;
|
||
|
||
default:
|
||
operator_length_standard (exp, pc, oplenp, argsp);
|
||
return;
|
||
}
|
||
|
||
*oplenp = oplen;
|
||
*argsp = args;
|
||
}
|
||
|
||
/* op_name implementation for Rust. */
|
||
|
||
static const char *
|
||
rust_op_name (enum exp_opcode opcode)
|
||
{
|
||
switch (opcode)
|
||
{
|
||
case OP_AGGREGATE:
|
||
return "OP_AGGREGATE";
|
||
case OP_OTHERS:
|
||
return "OP_OTHERS";
|
||
default:
|
||
return op_name_standard (opcode);
|
||
}
|
||
}
|
||
|
||
/* dump_subexp_body implementation for Rust. */
|
||
|
||
static int
|
||
rust_dump_subexp_body (struct expression *exp, struct ui_file *stream,
|
||
int elt)
|
||
{
|
||
switch (exp->elts[elt].opcode)
|
||
{
|
||
case OP_AGGREGATE:
|
||
{
|
||
int length = longest_to_int (exp->elts[elt + 2].longconst);
|
||
int i;
|
||
|
||
fprintf_filtered (stream, "Type @");
|
||
gdb_print_host_address (exp->elts[elt + 1].type, stream);
|
||
fprintf_filtered (stream, " (");
|
||
type_print (exp->elts[elt + 1].type, NULL, stream, 0);
|
||
fprintf_filtered (stream, "), length %d", length);
|
||
|
||
elt += 4;
|
||
for (i = 0; i < length; ++i)
|
||
elt = dump_subexp (exp, stream, elt);
|
||
}
|
||
break;
|
||
|
||
case OP_STRING:
|
||
case OP_NAME:
|
||
{
|
||
LONGEST len = exp->elts[elt + 1].longconst;
|
||
|
||
fprintf_filtered (stream, "%s: %s",
|
||
(exp->elts[elt].opcode == OP_STRING
|
||
? "string" : "name"),
|
||
&exp->elts[elt + 2].string);
|
||
elt += 4 + BYTES_TO_EXP_ELEM (len + 1);
|
||
}
|
||
break;
|
||
|
||
case OP_OTHERS:
|
||
elt = dump_subexp (exp, stream, elt + 1);
|
||
break;
|
||
|
||
case STRUCTOP_ANONYMOUS:
|
||
{
|
||
int field_number;
|
||
|
||
field_number = longest_to_int (exp->elts[elt + 1].longconst);
|
||
|
||
fprintf_filtered (stream, "Field number: %d", field_number);
|
||
elt = dump_subexp (exp, stream, elt + 3);
|
||
}
|
||
break;
|
||
|
||
case OP_RUST_ARRAY:
|
||
++elt;
|
||
break;
|
||
|
||
default:
|
||
elt = dump_subexp_body_standard (exp, stream, elt);
|
||
break;
|
||
}
|
||
|
||
return elt;
|
||
}
|
||
|
||
/* print_subexp implementation for Rust. */
|
||
|
||
static void
|
||
rust_print_subexp (struct expression *exp, int *pos, struct ui_file *stream,
|
||
enum precedence prec)
|
||
{
|
||
switch (exp->elts[*pos].opcode)
|
||
{
|
||
case OP_AGGREGATE:
|
||
{
|
||
int length = longest_to_int (exp->elts[*pos + 2].longconst);
|
||
int i;
|
||
|
||
type_print (exp->elts[*pos + 1].type, "", stream, 0);
|
||
fputs_filtered (" { ", stream);
|
||
|
||
*pos += 4;
|
||
for (i = 0; i < length; ++i)
|
||
{
|
||
rust_print_subexp (exp, pos, stream, prec);
|
||
fputs_filtered (", ", stream);
|
||
}
|
||
fputs_filtered (" }", stream);
|
||
}
|
||
break;
|
||
|
||
case OP_NAME:
|
||
{
|
||
LONGEST len = exp->elts[*pos + 1].longconst;
|
||
|
||
fputs_filtered (&exp->elts[*pos + 2].string, stream);
|
||
*pos += 4 + BYTES_TO_EXP_ELEM (len + 1);
|
||
}
|
||
break;
|
||
|
||
case OP_OTHERS:
|
||
{
|
||
fputs_filtered ("<<others>> (", stream);
|
||
++*pos;
|
||
rust_print_subexp (exp, pos, stream, prec);
|
||
fputs_filtered (")", stream);
|
||
}
|
||
break;
|
||
|
||
case STRUCTOP_ANONYMOUS:
|
||
{
|
||
int tem = longest_to_int (exp->elts[*pos + 1].longconst);
|
||
|
||
(*pos) += 3;
|
||
print_subexp (exp, pos, stream, PREC_SUFFIX);
|
||
fprintf_filtered (stream, ".%d", tem);
|
||
}
|
||
break;
|
||
|
||
case OP_RUST_ARRAY:
|
||
++*pos;
|
||
fprintf_filtered (stream, "[");
|
||
rust_print_subexp (exp, pos, stream, prec);
|
||
fprintf_filtered (stream, "; ");
|
||
rust_print_subexp (exp, pos, stream, prec);
|
||
fprintf_filtered (stream, "]");
|
||
break;
|
||
|
||
default:
|
||
print_subexp_standard (exp, pos, stream, prec);
|
||
break;
|
||
}
|
||
}
|
||
|
||
/* operator_check implementation for Rust. */
|
||
|
||
static int
|
||
rust_operator_check (struct expression *exp, int pos,
|
||
int (*objfile_func) (struct objfile *objfile,
|
||
void *data),
|
||
void *data)
|
||
{
|
||
switch (exp->elts[pos].opcode)
|
||
{
|
||
case OP_AGGREGATE:
|
||
{
|
||
struct type *type = exp->elts[pos + 1].type;
|
||
struct objfile *objfile = TYPE_OBJFILE (type);
|
||
|
||
if (objfile != NULL && (*objfile_func) (objfile, data))
|
||
return 1;
|
||
}
|
||
break;
|
||
|
||
case OP_OTHERS:
|
||
case OP_NAME:
|
||
case OP_RUST_ARRAY:
|
||
break;
|
||
|
||
default:
|
||
return operator_check_standard (exp, pos, objfile_func, data);
|
||
}
|
||
|
||
return 0;
|
||
}
|
||
|
||
|
||
|
||
/* Implementation of la_lookup_symbol_nonlocal for Rust. */
|
||
|
||
static struct block_symbol
|
||
rust_lookup_symbol_nonlocal (const struct language_defn *langdef,
|
||
const char *name,
|
||
const struct block *block,
|
||
const domain_enum domain)
|
||
{
|
||
struct block_symbol result = {};
|
||
|
||
if (symbol_lookup_debug)
|
||
{
|
||
fprintf_unfiltered (gdb_stdlog,
|
||
"rust_lookup_symbol_non_local"
|
||
" (%s, %s (scope %s), %s)\n",
|
||
name, host_address_to_string (block),
|
||
block_scope (block), domain_name (domain));
|
||
}
|
||
|
||
/* Look up bare names in the block's scope. */
|
||
std::string scopedname;
|
||
if (name[cp_find_first_component (name)] == '\0')
|
||
{
|
||
const char *scope = block_scope (block);
|
||
|
||
if (scope[0] != '\0')
|
||
{
|
||
scopedname = std::string (scope) + "::" + name;
|
||
name = scopedname.c_str ();
|
||
}
|
||
else
|
||
name = NULL;
|
||
}
|
||
|
||
if (name != NULL)
|
||
{
|
||
result = lookup_symbol_in_static_block (name, block, domain);
|
||
if (result.symbol == NULL)
|
||
result = lookup_global_symbol (name, block, domain);
|
||
}
|
||
return result;
|
||
}
|
||
|
||
|
||
|
||
/* la_sniff_from_mangled_name for Rust. */
|
||
|
||
static int
|
||
rust_sniff_from_mangled_name (const char *mangled, char **demangled)
|
||
{
|
||
*demangled = gdb_demangle (mangled, DMGL_PARAMS | DMGL_ANSI);
|
||
return *demangled != NULL;
|
||
}
|
||
|
||
|
||
|
||
/* la_watch_location_expression for Rust. */
|
||
|
||
static gdb::unique_xmalloc_ptr<char>
|
||
rust_watch_location_expression (struct type *type, CORE_ADDR addr)
|
||
{
|
||
type = check_typedef (TYPE_TARGET_TYPE (check_typedef (type)));
|
||
std::string name = type_to_string (type);
|
||
return gdb::unique_xmalloc_ptr<char>
|
||
(xstrprintf ("*(%s as *mut %s)", core_addr_to_string (addr),
|
||
name.c_str ()));
|
||
}
|
||
|
||
|
||
|
||
static const struct exp_descriptor exp_descriptor_rust =
|
||
{
|
||
rust_print_subexp,
|
||
rust_operator_length,
|
||
rust_operator_check,
|
||
rust_op_name,
|
||
rust_dump_subexp_body,
|
||
rust_evaluate_subexp
|
||
};
|
||
|
||
static const char *rust_extensions[] =
|
||
{
|
||
".rs", NULL
|
||
};
|
||
|
||
extern const struct language_defn rust_language_defn =
|
||
{
|
||
"rust",
|
||
"Rust",
|
||
language_rust,
|
||
range_check_on,
|
||
case_sensitive_on,
|
||
array_row_major,
|
||
macro_expansion_no,
|
||
rust_extensions,
|
||
&exp_descriptor_rust,
|
||
rust_parse,
|
||
null_post_parser,
|
||
rust_printchar, /* Print a character constant */
|
||
rust_printstr, /* Function to print string constant */
|
||
rust_emitchar, /* Print a single char */
|
||
rust_print_type, /* Print a type using appropriate syntax */
|
||
rust_print_typedef, /* Print a typedef using appropriate syntax */
|
||
rust_val_print, /* Print a value using appropriate syntax */
|
||
c_value_print, /* Print a top-level value */
|
||
default_read_var_value, /* la_read_var_value */
|
||
NULL, /* Language specific skip_trampoline */
|
||
NULL, /* name_of_this */
|
||
false, /* la_store_sym_names_in_linkage_form_p */
|
||
rust_lookup_symbol_nonlocal, /* lookup_symbol_nonlocal */
|
||
basic_lookup_transparent_type,/* lookup_transparent_type */
|
||
gdb_demangle, /* Language specific symbol demangler */
|
||
rust_sniff_from_mangled_name,
|
||
NULL, /* Language specific
|
||
class_name_from_physname */
|
||
c_op_print_tab, /* expression operators for printing */
|
||
1, /* c-style arrays */
|
||
0, /* String lower bound */
|
||
default_word_break_characters,
|
||
default_collect_symbol_completion_matches,
|
||
rust_language_arch_info,
|
||
default_print_array_index,
|
||
default_pass_by_reference,
|
||
c_get_string,
|
||
rust_watch_location_expression,
|
||
NULL, /* la_get_symbol_name_matcher */
|
||
iterate_over_symbols,
|
||
default_search_name_hash,
|
||
&default_varobj_ops,
|
||
NULL,
|
||
NULL,
|
||
"{...}" /* la_struct_too_deep_ellipsis */
|
||
};
|