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
|
// 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-rib.h"
#include "rust-name-resolution-context.h"
namespace Rust {
namespace Resolver2_0 {
Rib::Definition::Definition (NodeId id, bool shadowable)
: ids ({id}), shadowable (shadowable)
{}
bool
Rib::Definition::is_ambiguous () const
{
return shadowable && ids.size () > 1;
}
std::string
Rib::Definition::to_string () const
{
std::stringstream out;
out << (shadowable ? "(S)" : "(NS)") << "[";
std::string sep;
for (auto id : ids)
{
out << sep << id;
sep = ",";
}
out << "]";
return out.str ();
}
Rib::Definition
Rib::Definition::Shadowable (NodeId id)
{
return Definition (id, true);
}
Rib::Definition
Rib::Definition::NonShadowable (NodeId id)
{
return Definition (id, false);
}
DuplicateNameError::DuplicateNameError (std::string name, NodeId existing)
: name (name), existing (existing)
{}
Rib::Rib (Kind kind) : kind (kind) {}
Rib::Rib (Kind kind, std::string identifier, NodeId id)
: Rib (kind, {{identifier, id}})
{}
Rib::Rib (Kind kind, std::unordered_map<std::string, NodeId> to_insert)
: kind (kind)
{
for (auto &value : to_insert)
values.insert ({value.first, Definition::NonShadowable (value.second)});
}
tl::expected<NodeId, DuplicateNameError>
Rib::insert (std::string name, Definition def)
{
auto it = values.find (name);
if (it == values.end ())
{
/* No old value */
values[name] = def;
}
else if (it->second.shadowable && def.shadowable)
{ /* Both shadowable */
auto ¤t = values[name];
for (auto id : def.ids)
{
if (std::find (current.ids.cbegin (), current.ids.cend (), id)
== current.ids.cend ())
{
current.ids.push_back (id);
}
}
}
else if (it->second.shadowable)
{ /* Only old shadowable : replace value */
values[name] = def;
}
else /* Neither are shadowable */
{
return tl::make_unexpected (
DuplicateNameError (name, it->second.ids.back ()));
}
return def.ids.back ();
}
tl::optional<Rib::Definition>
Rib::get (const std::string &name)
{
auto it = values.find (name);
if (it == values.end ())
return tl::nullopt;
return it->second;
}
const std::unordered_map<std::string, Rib::Definition> &
Rib::get_values () const
{
return values;
}
} // namespace Resolver2_0
} // namespace Rust
|
