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
|
// 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_EARLY_NAME_RESOLVER_2_0_H
#define RUST_EARLY_NAME_RESOLVER_2_0_H
#include "optional.h"
#include "rust-ast.h"
#include "rust-ast-visitor.h"
#include "rust-name-resolution-context.h"
#include "rust-default-resolver.h"
#include "rust-rib.h"
#include "rust-toplevel-name-resolver-2.0.h"
namespace Rust {
namespace Resolver2_0 {
class Early : public DefaultResolver
{
using DefaultResolver::visit;
public:
Early (NameResolutionContext &ctx);
void go (AST::Crate &crate);
const std::vector<Error> &get_macro_resolve_errors () const
{
return macro_resolve_errors;
}
// we need to handle definitions for textual scoping
void visit (AST::MacroRulesDefinition &) override;
// as well as lexical scopes
void visit (AST::BlockExpr &) override;
void visit (AST::Module &) override;
void visit (AST::MacroInvocation &) override;
void visit (AST::Function &) override;
void visit (AST::StructStruct &) override;
struct ImportData
{
enum class Kind
{
Simple,
Glob,
Rebind
} kind;
Rib::Definition definition;
tl::optional<Namespace> ns;
static ImportData Simple (std::pair<Rib::Definition, Namespace> def_ns)
{
return ImportData (Kind::Simple, def_ns.first, def_ns.second);
}
static ImportData Rebind (std::pair<Rib::Definition, Namespace> def_ns)
{
return ImportData (Kind::Rebind, def_ns.first, def_ns.second);
}
static ImportData Glob (Rib::Definition module)
{
return ImportData (Kind::Glob, module);
}
private:
ImportData (Kind kind, Rib::Definition definition,
tl::optional<Namespace> ns = tl::nullopt)
: kind (kind), definition (definition), ns (ns)
{}
};
private:
void visit_attributes (std::vector<AST::Attribute> &attrs);
/**
* Insert a resolved macro invocation into the mappings once, meaning that we
* can call this function each time the early name resolution pass is underway
* and it will not trigger assertions for already resolved invocations.
*/
// TODO: Rename
void insert_once (AST::MacroInvocation &invocation, NodeId resolved);
// TODO: Rename
void insert_once (AST::MacroRulesDefinition &definition);
/**
* Macros can either be resolved through textual scoping or regular path
* scoping - which this class represents. Textual scoping works similarly to a
* "simple" name resolution algorith, with the addition of "shadowing". Each
* time a new lexical scope is entered, we push a new map onto the stack, in
* which newly defined macros are added. The latest defined macro is the one
* that takes precedence. When resolving a macro invocation to its definition,
* we walk up the stack and look for a definition in each of the map until we
* find one. Otherwise, the macro invocation is unresolved, and goes through
* regular path resolution.
*/
class TextualScope
{
public:
void push ();
void pop ();
void insert (std::string name, NodeId id);
tl::optional<NodeId> get (const std::string &name);
private:
std::vector<std::unordered_map<std::string, NodeId>> scopes;
};
// TODO: This is becoming a very complex type - ugly
// Mappings between an import and the definition it imports
std::unordered_map<NodeId,
std::vector<std::pair<TopLevel::ImportKind, ImportData>>>
import_mappings;
// FIXME: Documentation
// Call this on all the paths of a UseDec - so each flattened path in a
// UseTreeList for example
// FIXME: Should that return `found`?
bool resolve_simple_import (NodeId use_dec_id, TopLevel::ImportKind &&import);
bool resolve_glob_import (NodeId use_dec_id, TopLevel::ImportKind &&import);
bool resolve_rebind_import (NodeId use_dec_id, TopLevel::ImportKind &&import);
// Handle an import, resolving it to its definition and adding it to the list
// of import mappings
void build_import_mapping (
std::pair<NodeId, std::vector<TopLevel::ImportKind>> &&use_import);
TextualScope textual_scope;
std::vector<Error> macro_resolve_errors;
void collect_error (Error e) { macro_resolve_errors.push_back (e); }
};
} // namespace Resolver2_0
} // namespace Rust
#endif // ! RUST_EARLY_NAME_RESOLVER_2_0_H
|
