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
|
/*
*/
#include <ast/ast.hpp>
#include <ast/crate.hpp>
#include <main_bindings.hpp>
#include <synext.hpp>
#include <map>
#include "macro_rules.hpp"
::std::map< ::std::string, ::std::unique_ptr<ExpandDecorator> > g_decorators;
::std::map< ::std::string, ::std::unique_ptr<ExpandProcMacro> > g_macros;
void Register_Synext_Decorator(::std::string name, ::std::unique_ptr<ExpandDecorator> handler) {
g_decorators[name] = mv$(handler);
}
void Register_Synext_Macro(::std::string name, ::std::unique_ptr<ExpandProcMacro> handler) {
g_macros[name] = mv$(handler);
}
void Expand_Attrs(const ::AST::MetaItems& attrs, AttrStage stage, ::AST::Crate& crate, const ::AST::Path& path, ::AST::Module& mod, ::AST::Item& item)
{
for( auto& a : attrs.m_items )
{
for( auto& d : g_decorators ) {
if( d.first == a.name() ) {
DEBUG("#[" << d.first << "] " << (int)d.second->stage() << "-" << (int)stage);
if( d.second->stage() == stage ) {
d.second->handle(a, crate, path, mod, item);
}
}
}
}
}
AST::Expr Expand_Macro(bool is_early, LList<const AST::Module*> modstack, ::AST::Module& mod, ::AST::MacroInvocation& mi, MacroPosition pos)
{
for( const auto& m : g_macros )
{
if( mi.name() == m.first && m.second->expand_early() == is_early )
{
auto e = m.second->expand(mi.input_ident(), mi.input_tt(), mod, MacroPosition::Item);
mi.clear();
return e;
}
}
// Iterate up the module tree, using the first located macro
for(const auto* ll = &modstack; ll; ll = ll->m_prev)
{
const auto& mac_mod = *ll->m_item;
for( const auto& mr : mac_mod.macros() )
{
//DEBUG("- " << mr.name);
if( mr.name == mi.name() )
{
if( mi.input_ident() != "" )
; // TODO: ERROR - macro_rules! macros can't take an ident
auto e = Macro_Invoke(mr.name.c_str(), mr.data, mi.input_tt(), mod, MacroPosition::Item);
mi.clear();
return e;
}
}
for( const auto& mri : mac_mod.macro_imports_res() )
{
//DEBUG("- " << mri.name);
if( mri.name == mi.name() )
{
if( mi.input_ident() != "" )
; // TODO: ERROR - macro_rules! macros can't take an ident
auto e = Macro_Invoke(mi.name().c_str(), *mri.data, mi.input_tt(), mod, MacroPosition::Item);
mi.clear();
return e;
}
}
}
if( ! is_early ) {
// Error - Unknown macro name
ERROR(mi.span(), E0000, "Unknown macro '" << mi.name() << "'");
}
// Leave valid and return an empty expression
return AST::Expr();
}
void Expand_Mod(bool is_early, ::AST::Crate& crate, LList<const AST::Module*> modstack, ::AST::Path modpath, ::AST::Module& mod)
{
TRACE_FUNCTION_F("is_early = " << is_early << ", modpath = " << modpath);
for( const auto& mi: mod.macro_imports_res() )
DEBUG("- Imports '" << mi.name << "'");
// 1. Macros first
//for( auto& mi : mod.macro_invs() )
for(unsigned int i = 0; i < mod.macro_invs().size(); i ++ )
{
auto& mi = mod.macro_invs()[i];
DEBUG("> Macro invoke '"<<mi.name()<<"'");
if( mi.name() != "" )
{
// Move out of the module to avoid invalidation if a new macro invocation is added
auto mi_owned = mv$(mi);
auto rv = Expand_Macro(is_early, modstack, mod, mi_owned, MacroPosition::Item);
if( rv.is_valid() )
; // TODO: ERROR - macro yeilded an expression in item position
if( mi_owned.name() != "" )
{
mod.macro_invs()[i] = mv$(mi_owned);
}
}
}
// 2. General items
DEBUG("Items");
for( auto& i : mod.items() )
{
DEBUG("- " << i.name << " :: " << i.data.attrs);
::AST::Path path = modpath + i.name;
Expand_Attrs(i.data.attrs, (is_early ? AttrStage::EarlyPre : AttrStage::LatePre), crate, path, mod, i.data);
TU_MATCH(::AST::Item, (i.data), (e),
(None,
// Skip, nothing
),
(Module,
LList<const AST::Module*> sub_modstack(&modstack, &e.e);
Expand_Mod(is_early, crate, sub_modstack, path, e.e);
),
(Crate,
// Skip, no recursion
),
(Struct,
// TODO: Struct items
),
(Enum,
),
(Trait,
),
(Type,
// TODO: Do type aliases require recursion?
),
(Function,
// TODO:
),
(Static,
// TODO:
)
)
Expand_Attrs(i.data.attrs, (is_early ? AttrStage::EarlyPost : AttrStage::LatePost), crate, path, mod, i.data);
}
for( const auto& mi: mod.macro_imports_res() )
DEBUG("- Imports '" << mi.name << "'");
// 3. Post-recurse macros (everything else)
}
void Expand(::AST::Crate& crate)
{
// 1. Crate attributes
for( auto& a : crate.m_attrs.m_items )
{
for( auto& d : g_decorators ) {
if( d.first == a.name() && d.second->stage() == AttrStage::EarlyPre ) {
d.second->handle(a, crate);
}
}
}
// 2. Module attributes
for( auto& a : crate.m_attrs.m_items )
{
for( auto& d : g_decorators ) {
if( d.first == a.name() && d.second->stage() == AttrStage::EarlyPre ) {
//d.second->handle(a, crate, ::AST::Path(), crate.m_root_module, crate.m_root_module);
}
}
}
// 3. Module tree
Expand_Mod(true , crate, LList<const ::AST::Module*>(nullptr, &crate.m_root_module), ::AST::Path(), crate.m_root_module);
Expand_Mod(false, crate, LList<const ::AST::Module*>(nullptr, &crate.m_root_module), ::AST::Path(), crate.m_root_module);
// Post-process
#if 0
for( auto& a : crate.m_attrs.m_items )
{
for( auto& d : g_decorators ) {
if( d.first == a.name() && d.second->expand_before_macros() == false ) {
//d.second->handle(a, crate, ::AST::Path(), crate.m_root_module, crate.m_root_module);
}
}
}
for( auto& a : crate.m_attrs.m_items )
{
for( auto& d : g_decorators ) {
if( d.first == a.name() && d.second->expand_before_macros() == false ) {
d.second->handle(a, crate);
}
}
}
#endif
}
|
