1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
// Copyright (C) 2020-2025 Free Software Foundation, Inc.
// This file is part of GCC.
// GCC 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, or (at your option) any later
// version.
// GCC 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 GCC; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
#ifndef RUST_COMPILE_VAR_DECL
#define RUST_COMPILE_VAR_DECL
#include "rust-compile-base.h"
#include "rust-hir-visitor.h"
namespace Rust {
namespace Compile {
class CompileVarDecl : public HIRCompileBase, public HIR::HIRPatternVisitor
{
using HIR::HIRPatternVisitor::visit;
public:
static std::vector<Bvariable *> compile (tree fndecl, tree translated_type,
HIR::Pattern *pattern, Context *ctx)
{
CompileVarDecl compiler (ctx, fndecl, translated_type);
pattern->accept_vis (compiler);
return compiler.vars;
}
void visit (HIR::IdentifierPattern &pattern) override
{
if (!pattern.is_mut ())
translated_type = Backend::immutable_type (translated_type);
tree bind_tree = ctx->peek_enclosing_scope ();
std::string identifier = pattern.get_identifier ().as_string ();
tree decl
= build_decl (pattern.get_locus (), VAR_DECL,
Backend::get_identifier_node (identifier), translated_type);
DECL_CONTEXT (decl) = fndecl;
gcc_assert (TREE_CODE (bind_tree) == BIND_EXPR);
tree block_tree = BIND_EXPR_BLOCK (bind_tree);
gcc_assert (TREE_CODE (block_tree) == BLOCK);
DECL_CHAIN (decl) = BLOCK_VARS (block_tree);
BLOCK_VARS (block_tree) = decl;
BIND_EXPR_VARS (bind_tree) = BLOCK_VARS (block_tree);
rust_preserve_from_gc (decl);
Bvariable *var = new Bvariable (decl);
HirId stmt_id = pattern.get_mappings ().get_hirid ();
ctx->insert_var_decl (stmt_id, var);
vars.push_back (var);
}
void visit (HIR::TuplePattern &pattern) override
{
switch (pattern.get_items ()->get_item_type ())
{
case HIR::TuplePatternItems::ItemType::MULTIPLE: {
rust_assert (TREE_CODE (translated_type) == RECORD_TYPE);
auto &items = static_cast<HIR::TuplePatternItemsMultiple &> (
*pattern.get_items ());
size_t offs = 0;
for (auto &sub : items.get_patterns ())
{
tree sub_ty = error_mark_node;
tree field = TYPE_FIELDS (translated_type);
for (size_t i = 0; i < offs; i++)
{
field = DECL_CHAIN (field);
gcc_assert (field != NULL_TREE);
}
sub_ty = TREE_TYPE (field);
CompileVarDecl::compile (fndecl, sub_ty, sub.get (), ctx);
offs++;
}
}
break;
default:
break;
}
}
// Empty visit for unused Pattern HIR nodes.
void visit (HIR::AltPattern &) override {}
void visit (HIR::LiteralPattern &) override {}
void visit (HIR::PathInExpression &) override {}
void visit (HIR::QualifiedPathInExpression &) override {}
void visit (HIR::RangePattern &) override {}
void visit (HIR::ReferencePattern &) override {}
void visit (HIR::SlicePattern &) override {}
void visit (HIR::StructPattern &) override {}
void visit (HIR::TupleStructPattern &) override {}
void visit (HIR::WildcardPattern &) override {}
private:
CompileVarDecl (Context *ctx, tree fndecl, tree translated_type)
: HIRCompileBase (ctx), fndecl (fndecl), translated_type (translated_type)
{}
tree fndecl;
tree translated_type;
std::vector<Bvariable *> vars;
};
} // namespace Compile
} // namespace Rust
#endif // RUST_COMPILE_VAR_DECL
|
