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
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
|
/*
Copyright (C) 2009-2011 Jeroen Frijters
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
Jeroen Frijters
jeroen@frijters.net
*/
using System;
using System.Collections.Generic;
using System.Text;
using System.Runtime.InteropServices;
using IKVM.Reflection.Metadata;
namespace IKVM.Reflection.Reader
{
sealed class TypeDefImpl : Type
{
private readonly ModuleReader module;
private readonly int index;
private readonly string typeName;
private readonly string typeNamespace;
private Type[] typeArgs;
internal TypeDefImpl(ModuleReader module, int index)
{
this.module = module;
this.index = index;
this.typeName = module.GetString(module.TypeDef.records[index].TypeName);
this.typeNamespace = module.GetString(module.TypeDef.records[index].TypeNamespace);
MarkEnumOrValueType(typeNamespace, typeName);
}
public override Type BaseType
{
get
{
int extends = module.TypeDef.records[index].Extends;
if ((extends & 0xFFFFFF) == 0)
{
return null;
}
return module.ResolveType(extends, this);
}
}
public override TypeAttributes Attributes
{
get { return (TypeAttributes)module.TypeDef.records[index].Flags; }
}
public override EventInfo[] __GetDeclaredEvents()
{
int token = this.MetadataToken;
// TODO use binary search?
for (int i = 0; i < module.EventMap.records.Length; i++)
{
if (module.EventMap.records[i].Parent == token)
{
int evt = module.EventMap.records[i].EventList - 1;
int end = module.EventMap.records.Length > i + 1 ? module.EventMap.records[i + 1].EventList - 1 : module.Event.records.Length;
EventInfo[] events = new EventInfo[end - evt];
if (module.EventPtr.RowCount == 0)
{
for (int j = 0; evt < end; evt++, j++)
{
events[j] = new EventInfoImpl(module, this, evt);
}
}
else
{
for (int j = 0; evt < end; evt++, j++)
{
events[j] = new EventInfoImpl(module, this, module.EventPtr.records[evt] - 1);
}
}
return events;
}
}
return Empty<EventInfo>.Array;
}
public override FieldInfo[] __GetDeclaredFields()
{
int field = module.TypeDef.records[index].FieldList - 1;
int end = module.TypeDef.records.Length > index + 1 ? module.TypeDef.records[index + 1].FieldList - 1 : module.Field.records.Length;
FieldInfo[] fields = new FieldInfo[end - field];
if (module.FieldPtr.RowCount == 0)
{
for (int i = 0; field < end; i++, field++)
{
fields[i] = module.GetFieldAt(this, field);
}
}
else
{
for (int i = 0; field < end; i++, field++)
{
fields[i] = module.GetFieldAt(this, module.FieldPtr.records[field] - 1);
}
}
return fields;
}
public override Type[] __GetDeclaredInterfaces()
{
int token = this.MetadataToken;
List<Type> list = null;
// TODO use binary search?
for (int i = 0; i < module.InterfaceImpl.records.Length; i++)
{
if (module.InterfaceImpl.records[i].Class == token)
{
if (list == null)
{
list = new List<Type>();
}
list.Add(module.ResolveType(module.InterfaceImpl.records[i].Interface, this));
}
}
return Util.ToArray(list, Type.EmptyTypes);
}
public override MethodBase[] __GetDeclaredMethods()
{
int method = module.TypeDef.records[index].MethodList - 1;
int end = module.TypeDef.records.Length > index + 1 ? module.TypeDef.records[index + 1].MethodList - 1 : module.MethodDef.records.Length;
MethodBase[] methods = new MethodBase[end - method];
if (module.MethodPtr.RowCount == 0)
{
for (int i = 0; method < end; method++, i++)
{
methods[i] = module.GetMethodAt(this, method);
}
}
else
{
for (int i = 0; method < end; method++, i++)
{
methods[i] = module.GetMethodAt(this, module.MethodPtr.records[method] - 1);
}
}
return methods;
}
public override __MethodImplMap __GetMethodImplMap()
{
List<MethodInfo> bodies = new List<MethodInfo>();
List<List<MethodInfo>> declarations = new List<List<MethodInfo>>();
int token = this.MetadataToken;
// TODO use binary search?
for (int i = 0; i < module.MethodImpl.records.Length; i++)
{
if (module.MethodImpl.records[i].Class == token)
{
MethodInfo body = (MethodInfo)module.ResolveMethod(module.MethodImpl.records[i].MethodBody, typeArgs, null);
int index = bodies.IndexOf(body);
if (index == -1)
{
index = bodies.Count;
bodies.Add(body);
declarations.Add(new List<MethodInfo>());
}
MethodInfo declaration = (MethodInfo)module.ResolveMethod(module.MethodImpl.records[i].MethodDeclaration, typeArgs, null);
declarations[index].Add(declaration);
}
}
__MethodImplMap map = new __MethodImplMap();
map.TargetType = this;
map.MethodBodies = bodies.ToArray();
map.MethodDeclarations = new MethodInfo[declarations.Count][];
for (int i = 0; i < map.MethodDeclarations.Length; i++)
{
map.MethodDeclarations[i] = declarations[i].ToArray();
}
return map;
}
public override Type[] __GetDeclaredTypes()
{
int token = this.MetadataToken;
List<Type> list = new List<Type>();
// TODO use binary search?
for (int i = 0; i < module.NestedClass.records.Length; i++)
{
if (module.NestedClass.records[i].EnclosingClass == token)
{
list.Add(module.ResolveType(module.NestedClass.records[i].NestedClass));
}
}
return list.ToArray();
}
public override PropertyInfo[] __GetDeclaredProperties()
{
int token = this.MetadataToken;
// TODO use binary search?
for (int i = 0; i < module.PropertyMap.records.Length; i++)
{
if (module.PropertyMap.records[i].Parent == token)
{
int property = module.PropertyMap.records[i].PropertyList - 1;
int end = module.PropertyMap.records.Length > i + 1 ? module.PropertyMap.records[i + 1].PropertyList - 1 : module.Property.records.Length;
PropertyInfo[] properties = new PropertyInfo[end - property];
if (module.PropertyPtr.RowCount == 0)
{
for (int j = 0; property < end; property++, j++)
{
properties[j] = new PropertyInfoImpl(module, this, property);
}
}
else
{
for (int j = 0; property < end; property++, j++)
{
properties[j] = new PropertyInfoImpl(module, this, module.PropertyPtr.records[property] - 1);
}
}
return properties;
}
}
return Empty<PropertyInfo>.Array;
}
public override string __Name
{
get { return typeName; }
}
public override string __Namespace
{
get { return typeNamespace; }
}
public override string Name
{
get { return TypeNameParser.Escape(typeName); }
}
public override string FullName
{
get { return GetFullName(); }
}
public override int MetadataToken
{
get { return (TypeDefTable.Index << 24) + index + 1; }
}
public override Type[] GetGenericArguments()
{
PopulateGenericArguments();
return Util.Copy(typeArgs);
}
private void PopulateGenericArguments()
{
if (typeArgs == null)
{
int token = this.MetadataToken;
int first = module.GenericParam.FindFirstByOwner(token);
if (first == -1)
{
typeArgs = Type.EmptyTypes;
}
else
{
List<Type> list = new List<Type>();
int len = module.GenericParam.records.Length;
for (int i = first; i < len && module.GenericParam.records[i].Owner == token; i++)
{
list.Add(new GenericTypeParameter(module, i));
}
typeArgs = list.ToArray();
}
}
}
internal override Type GetGenericTypeArgument(int index)
{
PopulateGenericArguments();
return typeArgs[index];
}
public override CustomModifiers[] __GetGenericArgumentsCustomModifiers()
{
PopulateGenericArguments();
return new CustomModifiers[typeArgs.Length];
}
public override bool IsGenericType
{
get { return IsGenericTypeDefinition; }
}
public override bool IsGenericTypeDefinition
{
get { return module.GenericParam.FindFirstByOwner(this.MetadataToken) != -1; }
}
public override Type GetGenericTypeDefinition()
{
if (IsGenericTypeDefinition)
{
return this;
}
throw new InvalidOperationException();
}
public override string ToString()
{
StringBuilder sb = new StringBuilder(this.FullName);
string sep = "[";
foreach (Type arg in GetGenericArguments())
{
sb.Append(sep);
sb.Append(arg);
sep = ",";
}
if (sep != "[")
{
sb.Append(']');
}
return sb.ToString();
}
internal bool IsNestedByFlags
{
get { return (this.Attributes & TypeAttributes.VisibilityMask & ~TypeAttributes.Public) != 0; }
}
public override Type DeclaringType
{
get
{
// note that we cannot use Type.IsNested for this, because that calls DeclaringType
if (!IsNestedByFlags)
{
return null;
}
// TODO use binary search (if sorted)
int token = this.MetadataToken;
for (int i = 0; i < module.NestedClass.records.Length; i++)
{
if (module.NestedClass.records[i].NestedClass == token)
{
return module.ResolveType(module.NestedClass.records[i].EnclosingClass, null, null);
}
}
throw new InvalidOperationException();
}
}
public override StructLayoutAttribute StructLayoutAttribute
{
get
{
StructLayoutAttribute layout;
switch (this.Attributes & TypeAttributes.LayoutMask)
{
case TypeAttributes.AutoLayout:
layout = new StructLayoutAttribute(LayoutKind.Auto);
break;
case TypeAttributes.SequentialLayout:
layout = new StructLayoutAttribute(LayoutKind.Sequential);
break;
case TypeAttributes.ExplicitLayout:
layout = new StructLayoutAttribute(LayoutKind.Explicit);
break;
default:
throw new BadImageFormatException();
}
switch (this.Attributes & TypeAttributes.StringFormatMask)
{
case TypeAttributes.AnsiClass:
layout.CharSet = CharSet.Ansi;
break;
case TypeAttributes.UnicodeClass:
layout.CharSet = CharSet.Unicode;
break;
case TypeAttributes.AutoClass:
layout.CharSet = CharSet.Auto;
break;
default:
layout.CharSet = CharSet.None;
break;
}
if (!__GetLayout(out layout.Pack, out layout.Size))
{
// compatibility with System.Reflection
layout.Pack = 8;
}
return layout;
}
}
public override bool __GetLayout(out int packingSize, out int typeSize)
{
int token = this.MetadataToken;
// TODO use binary search?
for (int i = 0; i < module.ClassLayout.records.Length; i++)
{
if (module.ClassLayout.records[i].Parent == token)
{
packingSize = module.ClassLayout.records[i].PackingSize;
typeSize = module.ClassLayout.records[i].ClassSize;
return true;
}
}
packingSize = 0;
typeSize = 0;
return false;
}
public override Module Module
{
get { return module; }
}
internal override bool IsModulePseudoType
{
get { return index == 0; }
}
internal override IList<CustomAttributeData> GetInterfaceImplCustomAttributes(Type interfaceType, Type attributeType)
{
int token = this.MetadataToken;
// TODO use binary search?
for (int i = 0; i < module.InterfaceImpl.records.Length; i++)
{
if (module.InterfaceImpl.records[i].Class == token
&& module.ResolveType(module.InterfaceImpl.records[i].Interface, this) == interfaceType)
{
return module.GetCustomAttributes((InterfaceImplTable.Index << 24) | (i + 1), attributeType);
}
}
return Empty<CustomAttributeData>.Array;
}
}
}
|