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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
use super::*;
fn insert(types: &mut HashMap<&'static str, Vec<Type>>, name: &'static str, ty: Type) {
types.entry(name).or_default().push(ty);
}
pub struct Reader(
HashMap<&'static str, HashMap<&'static str, Vec<Type>>>,
Vec<*mut File>,
);
impl std::ops::Deref for Reader {
type Target = HashMap<&'static str, HashMap<&'static str, Vec<Type>>>;
fn deref(&self) -> &Self::Target {
&self.0
}
}
impl Drop for Reader {
fn drop(&mut self) {
for file in &self.1 {
unsafe {
_ = Box::from_raw(*file);
}
}
}
}
impl Reader {
pub fn new(files: Vec<File>) -> Box<Self> {
let mut reader = Box::new(Self(HashMap::new(), vec![]));
reader.1 = files
.into_iter()
.map(|mut file| unsafe {
file.reader = std::mem::transmute_copy(&reader);
std::mem::transmute(Box::new(file))
})
.collect();
for file in &reader.1 {
let file: &'static File = unsafe { &**file };
let mut nested = HashMap::<TypeDef, Vec<TypeDef>>::new();
for key in file.table::<NestedClass>() {
let inner = key.inner();
nested.entry(key.outer()).or_default().push(inner);
}
for def in file.table::<TypeDef>() {
let flags = def.flags();
if flags.is_nested() || def.nested().is_some() {
// This skips the nested types as we've already retrieved them.
continue;
}
let type_name = def.type_name();
if Type::remap(type_name) != Remap::None {
continue;
}
let types = reader.0.entry(type_name.namespace()).or_default();
let category = Category::new(def);
if flags.contains(TypeAttributes::WindowsRuntime) {
let ty = match category {
Category::Attribute => continue,
Category::Class => Type::Class(Class { def }),
Category::Delegate => Type::Delegate(Delegate {
def,
generics: def.generics(),
}),
Category::Enum => Type::Enum(Enum { def }),
Category::Interface => Type::Interface(Interface {
def,
generics: def.generics(),
kind: InterfaceKind::None,
}),
Category::Struct => {
// Skip marker types representing API contracts.
if def.has_attribute("ApiContractAttribute") {
continue;
}
Type::Struct(Struct { def })
}
};
insert(types, type_name.name(), ty);
} else {
match category {
Category::Attribute => continue,
Category::Class => {
if type_name.name() == "Apis" {
for method in def.methods() {
if let Some(map) = method.impl_map() {
// Skip inline and ordinal functions.
if map.scope().name() == "FORCEINLINE"
|| map.import_name().starts_with("#")
{
continue;
}
}
let name = method.name();
insert(
types,
name,
Type::CppFn(CppFn {
namespace: type_name.namespace(),
method,
}),
);
}
for field in def.fields() {
let name = field.name();
insert(
types,
name,
Type::CppConst(CppConst {
namespace: type_name.namespace(),
field,
}),
);
}
}
}
Category::Delegate => {
insert(
types,
type_name.name(),
Type::CppDelegate(CppDelegate { def }),
);
}
Category::Enum => {
insert(types, type_name.name(), Type::CppEnum(CppEnum { def }));
if !def.has_attribute("ScopedEnumAttribute") {
for field in def.fields() {
if field.flags().contains(FieldAttributes::Literal) {
let name = field.name();
insert(
types,
name,
Type::CppConst(CppConst {
namespace: type_name.namespace(),
field,
}),
);
}
}
}
}
Category::Interface => {
insert(
types,
type_name.name(),
Type::CppInterface(CppInterface { def }),
);
}
Category::Struct => {
fn make(
def: TypeDef,
name: &'static str,
nested: &HashMap<TypeDef, Vec<TypeDef>>,
) -> CppStruct {
let mut ty = CppStruct {
def,
name,
nested: BTreeMap::new(),
};
for (index, def) in
nested.get(&def).into_iter().flatten().enumerate()
{
// Only nested structs are supported. https://github.com/microsoft/windows-rs/issues/3468
if Category::new(*def) == Category::Struct {
ty.nested.insert(
def.name(),
make(
*def,
format!("{}_{index}", ty.name).leak(),
nested,
),
);
}
}
ty
}
insert(
types,
type_name.name(),
Type::CppStruct(make(def, type_name.name(), &nested)),
);
}
};
}
}
}
reader
}
#[track_caller]
pub fn unwrap_full_name(&self, namespace: &str, name: &str) -> Type {
if let Some(ty) = self.with_full_name(namespace, name).next() {
ty
} else {
panic!("type not found: {namespace}.{name}")
}
}
/// Gets all types matching the given namespace and name.
pub fn with_full_name(&self, namespace: &str, name: &str) -> impl Iterator<Item = Type> + '_ {
self.get(namespace)
.and_then(|types| types.get(name))
.into_iter()
.flatten()
.cloned()
}
}
#[derive(PartialEq)]
enum Category {
Interface,
Class,
Enum,
Struct,
Delegate,
Attribute,
}
impl Category {
fn new(def: TypeDef) -> Self {
if let Some(extends) = def.extends() {
if extends.namespace() == "System" {
match extends.name() {
"Enum" => Self::Enum,
"MulticastDelegate" => Self::Delegate,
"ValueType" => Self::Struct,
"Attribute" => Self::Attribute,
_ => Self::Class,
}
} else {
Self::Class
}
} else {
Self::Interface
}
}
}