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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
// 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/>.
#include "rust-name-resolution-context.h"
#include "optional.h"
#include "rust-mapping-common.h"
namespace Rust {
namespace Resolver2_0 {
BindingLayer::BindingLayer (BindingSource source) : source (source)
{
push (Binding::Kind::Product);
}
bool
BindingLayer::bind_test (Identifier ident, Binding::Kind kind)
{
for (auto &bind : bindings)
{
if (bind.set.find (ident) != bind.set.cend () && bind.kind == kind)
{
return true;
}
}
return false;
}
void
BindingLayer::push (Binding::Kind kind)
{
bindings.push_back (Binding (kind));
}
bool
BindingLayer::is_and_bound (Identifier ident)
{
return bind_test (ident, Binding::Kind::Product);
}
bool
BindingLayer::is_or_bound (Identifier ident)
{
return bind_test (ident, Binding::Kind::Or);
}
void
BindingLayer::insert_ident (Identifier ident)
{
bindings.back ().set.insert (ident);
}
void
BindingLayer::merge ()
{
auto last_binding = bindings.back ();
bindings.pop_back ();
for (auto &value : last_binding.set)
{
bindings.back ().set.insert (value);
}
}
BindingSource
BindingLayer::get_source () const
{
return source;
}
NameResolutionContext::NameResolutionContext ()
: mappings (Analysis::Mappings::get ())
{}
tl::expected<NodeId, DuplicateNameError>
NameResolutionContext::insert (Identifier name, NodeId id, Namespace ns)
{
switch (ns)
{
case Namespace::Values:
return values.insert (name, id);
case Namespace::Types:
return types.insert (name, id);
case Namespace::Macros:
return macros.insert (name, id);
case Namespace::Labels:
default:
// return labels.insert (name, id);
rust_unreachable ();
}
}
tl::expected<NodeId, DuplicateNameError>
NameResolutionContext::insert_variant (Identifier name, NodeId id)
{
return types.insert_variant (name, id);
}
tl::expected<NodeId, DuplicateNameError>
NameResolutionContext::insert_shadowable (Identifier name, NodeId id,
Namespace ns)
{
switch (ns)
{
case Namespace::Values:
return values.insert_shadowable (name, id);
case Namespace::Types:
return types.insert_shadowable (name, id);
case Namespace::Macros:
return macros.insert_shadowable (name, id);
case Namespace::Labels:
default:
// return labels.insert (name, id);
rust_unreachable ();
}
}
tl::expected<NodeId, DuplicateNameError>
NameResolutionContext::insert_globbed (Identifier name, NodeId id, Namespace ns)
{
switch (ns)
{
case Namespace::Values:
return values.insert_globbed (name, id);
case Namespace::Types:
return types.insert_globbed (name, id);
case Namespace::Macros:
return macros.insert_globbed (name, id);
case Namespace::Labels:
default:
// return labels.insert (name, id);
rust_unreachable ();
}
}
void
NameResolutionContext::map_usage (Usage usage, Definition definition)
{
auto inserted = resolved_nodes.emplace (usage, definition).second;
// is that valid?
rust_assert (inserted);
}
tl::optional<NodeId>
NameResolutionContext::lookup (NodeId usage) const
{
auto it = resolved_nodes.find (Usage (usage));
if (it == resolved_nodes.end ())
return tl::nullopt;
return it->second.id;
}
void
NameResolutionContext::scoped (Rib::Kind rib_kind, NodeId id,
std::function<void (void)> lambda,
tl::optional<Identifier> path)
{
// NOTE: You must be at the root node when pushing the prelude rib.
values.push (rib_kind, id, path);
types.push (rib_kind, id, path);
macros.push (rib_kind, id, path);
// labels.push (rib, id);
lambda ();
values.pop ();
types.pop ();
macros.pop ();
// labels.pop (rib);
}
void
NameResolutionContext::scoped (Rib::Kind rib_kind, Namespace ns,
NodeId scope_id,
std::function<void (void)> lambda,
tl::optional<Identifier> path)
{
// This could work... I'm not sure why you would want to do this though.
rust_assert (rib_kind != Rib::Kind::Prelude);
switch (ns)
{
case Namespace::Values:
values.push (rib_kind, scope_id, path);
break;
case Namespace::Types:
types.push (rib_kind, scope_id, path);
break;
case Namespace::Labels:
case Namespace::Macros:
gcc_unreachable ();
}
lambda ();
switch (ns)
{
case Namespace::Values:
values.pop ();
break;
case Namespace::Types:
types.pop ();
break;
case Namespace::Labels:
case Namespace::Macros:
gcc_unreachable ();
}
}
} // namespace Resolver2_0
} // namespace Rust
|
