-
Notifications
You must be signed in to change notification settings - Fork 253
/
Utils.cs
399 lines (316 loc) · 13.5 KB
/
Utils.cs
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
using Sigil;
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Reflection;
using System.Reflection.Emit;
using System.Runtime.Serialization;
using System.Text;
using System.Threading.Tasks;
namespace Jil.Serialize
{
partial class Utils
{
private static readonly Dictionary<int, OpCode> OneByteOps;
private static readonly Dictionary<int, OpCode> TwoByteOps;
static Utils()
{
var oneByte = new List<OpCode>();
var twoByte = new List<OpCode>();
foreach (var field in typeof(OpCodes).GetFields(BindingFlags.Public | BindingFlags.Static))
{
var op = (OpCode)field.GetValue(null);
if (op.Size == 1)
{
oneByte.Add(op);
continue;
}
if (op.Size == 2)
{
twoByte.Add(op);
continue;
}
throw new Exception("Unexpected op size for " + op);
}
OneByteOps = oneByte.ToDictionary(d => (int)d.Value, d => d);
TwoByteOps = twoByte.ToDictionary(d => (int)(d.Value & 0xFF), d => d);
}
// The Experiments project was used to find these #s
// Basically, based on some limited testing it appears that this order of
// member access is the "fastest" most often given the buckets I've chosen to use.
// I make no claims that this is absolutely ideal, but it appears to be better than
// declaration order.
internal static int[] MemberOrdering = new int[] { 3, 1, -4, 2 };
public static List<MemberInfo> IdealMemberOrderForWriting(Type forType, IEnumerable<Type> recursiveTypes, IEnumerable<MemberInfo> members)
{
var fields = Utils.FieldOffsetsInMemory(forType);
var props = Utils.PropertyFieldUsage(forType);
var simpleTypes = members.Where(m => m.ReturnType().IsValueType && !m.ReturnType().IsNullableType() && m.ReturnType().IsPrimitiveType()).ToList();
var otherPrimitive = members.Where(m => (m.ReturnType().IsPrimitiveType() || m.ReturnType().IsNullableType()) && !simpleTypes.Contains(m)).ToList();
var recursive = members.Where(m => recursiveTypes.Contains(m.ReturnType()) && !simpleTypes.Contains(m) && !otherPrimitive.Contains(m)).ToList();
var everythingElse = members.Where(m => !simpleTypes.Contains(m) && !otherPrimitive.Contains(m) && !recursive.Contains(m)).ToList();
Func<MemberInfo, int> byAccessOrder =
m =>
{
var asField = m as FieldInfo;
if (asField != null)
{
int fieldAddr;
if (fields.TryGetValue(asField, out fieldAddr))
{
return fieldAddr;
}
return int.MaxValue;
}
var asProp = m as PropertyInfo;
if (asProp != null)
{
List<FieldInfo> usesFields;
if (!props.TryGetValue(asProp, out usesFields))
{
return int.MaxValue;
}
if (usesFields.Count == 0) return int.MaxValue;
return
usesFields.Select(
f =>
{
int fieldAdd;
if (fields.TryGetValue(f, out fieldAdd))
{
return fieldAdd;
}
return int.MaxValue;
}
).Min();
}
return int.MaxValue;
};
Func<MemberInfo, int> fieldsFirst = m => m is FieldInfo ? 0 : 1;
var ret = new List<MemberInfo>();
foreach (var ix in MemberOrdering)
{
var asc = ix > 0;
var i = Math.Abs(ix);
switch (i)
{
case 1:
ret.AddRange(
asc ?
simpleTypes.OrderBy(byAccessOrder).ThenBy(fieldsFirst) :
simpleTypes.OrderByDescending(byAccessOrder).ThenByDescending(fieldsFirst)
);
break;
case 2:
ret.AddRange(
asc ?
otherPrimitive.OrderBy(byAccessOrder).ThenBy(fieldsFirst) :
otherPrimitive.OrderByDescending(byAccessOrder).ThenByDescending(fieldsFirst)
);
break;
case 3:
ret.AddRange(
asc ?
everythingElse.OrderBy(byAccessOrder).ThenBy(fieldsFirst) :
everythingElse.OrderByDescending(byAccessOrder).ThenByDescending(fieldsFirst)
);
break;
case 4:
ret.AddRange(
asc ?
recursive.OrderBy(byAccessOrder).ThenBy(fieldsFirst) :
recursive.OrderByDescending(byAccessOrder).ThenByDescending(fieldsFirst)
);
break;
default: throw new Exception();
}
}
return ret;
}
public static Dictionary<PropertyInfo, List<FieldInfo>> PropertyFieldUsage(Type t)
{
var ret = new Dictionary<PropertyInfo, List<FieldInfo>>();
var props = t.GetProperties(BindingFlags.Public | BindingFlags.Instance | BindingFlags.NonPublic).Where(p => p.GetMethod != null && p.GetMethod.GetParameters().Count() == 0);
var module = t.Module;
foreach (var prop in props)
{
try
{
var getMtd = prop.GetMethod;
var mtdBody = getMtd.GetMethodBody();
var il = mtdBody.GetILAsByteArray();
var fieldHandles = _GetFieldHandles(il);
var fieldInfos =
fieldHandles
.Select(
f =>
{
var genArgs = t.GetGenericArguments();
return module.ResolveField(f, genArgs, null);
}
).ToList();
ret[prop] = fieldInfos;
}
catch { /* Anything that goes wrong in here, we can't really do anything about; just continue with less knowledge */ }
}
return ret;
}
private static List<int> _GetFieldHandles(byte[] cil)
{
var ret = new List<int>();
int i = 0;
while (i < cil.Length)
{
int? fieldHandle;
OpCode ignored;
var startsAt = i;
i += _ReadOp(cil, i, out fieldHandle, out ignored);
if (fieldHandle.HasValue)
{
ret.Add(fieldHandle.Value);
}
}
return ret;
}
private static int _ReadOp(byte[] cil, int ix, out int? fieldHandle, out OpCode opcode)
{
const byte ContinueOpcode = 0xFE;
int advance = 0;
byte first = cil[ix];
if (first == ContinueOpcode)
{
var next = cil[ix + 1];
opcode = TwoByteOps[next];
advance += 2;
}
else
{
opcode = OneByteOps[first];
advance++;
}
fieldHandle = _ReadFieldOperands(opcode, cil, ix, ix + advance, ref advance);
return advance;
}
private static int? _ReadFieldOperands(OpCode op, byte[] cil, int instrStart, int operandStart, ref int advance)
{
Func<int, int> readInt = (at) => cil[at] | (cil[at + 1] << 8) | (cil[at + 2] << 16) | (cil[at + 3] << 24);
switch (op.OperandType)
{
case OperandType.InlineBrTarget:
advance += 4;
return null;
case OperandType.InlineSwitch:
advance += 4;
var len = readInt(operandStart);
var offset1 = instrStart + len * 4;
for (var i = 0; i < len; i++)
{
advance += 4;
}
return null;
case OperandType.ShortInlineBrTarget:
advance += 1;
return null;
case OperandType.InlineField:
advance += 4;
var field = readInt(operandStart);
return field;
case OperandType.InlineTok:
case OperandType.InlineType:
case OperandType.InlineMethod:
advance += 4;
return null;
case OperandType.InlineI:
advance += 4;
return null;
case OperandType.InlineI8:
advance += 8;
return null;
case OperandType.InlineNone:
return null;
case OperandType.InlineR:
advance += 8;
return null;
case OperandType.InlineSig:
advance += 4;
return null;
case OperandType.InlineString:
advance += 4;
return null;
case OperandType.InlineVar:
advance += 2;
return null;
case OperandType.ShortInlineI:
advance += 1;
return null;
case OperandType.ShortInlineR:
advance += 4;
return null;
case OperandType.ShortInlineVar:
advance += 1;
return null;
default: throw new Exception("Unexpected operand type [" + op.OperandType + "]");
}
}
public static Dictionary<FieldInfo, int> FieldOffsetsInMemory(Type t)
{
try
{
var fields = t.GetFields(BindingFlags.Public | BindingFlags.Instance | BindingFlags.NonPublic);
var emit = Emit<Func<object, ulong[]>>.NewDynamicMethod("_GetOffsetsInMemory" + t.FullName);
var retLoc = emit.DeclareLocal<ulong[]>("ret");
emit.LoadConstant(fields.Length); // ulong
emit.NewArray(typeof(ulong)); // ulong[]
emit.StoreLocal(retLoc); // --empty--
for (var i = 0; i < fields.Length; i++)
{
var field = fields[i];
emit.LoadLocal(retLoc); // ulong[]
emit.LoadConstant(i); // ulong[] ulong
emit.LoadArgument(0); // ulong[] ulong param#0
emit.CastClass(t); // ulong[] ulong param#0
emit.LoadFieldAddress(field); // ulong[] ulong field&
emit.Convert<ulong>(); // ulong[] ulong ulong
emit.StoreElement<ulong>(); // --empty--
}
emit.LoadLocal(retLoc); // ulong[]
emit.Return(); // --empty--
var getAddrs = emit.CreateDelegate();
var cons = t.GetConstructors(BindingFlags.Public | BindingFlags.NonPublic | BindingFlags.Instance).OrderBy(p => p.GetParameters().Count()).FirstOrDefault();
var consParameters = cons != null ? cons.GetParameters().Select(p => p.ParameterType.DefaultValue()).ToArray() : null;
object obj;
if (cons != null)
{
obj = cons.Invoke(consParameters);
}
else
{
obj = Activator.CreateInstance(t);
}
var addrs = getAddrs(obj);
if (addrs.Length == 0)
{
return new Dictionary<FieldInfo, int>();
}
var min = addrs.Min();
var ret = new Dictionary<FieldInfo, int>();
for (var i = 0; i < fields.Length; i++)
{
var field = fields[i];
var addr = addrs[i];
var offset = addr - min;
ret[field] = (int)offset;
}
return ret;
}
catch
{
// A lot can go wrong during this, and the common response is just to bail
// This catch is much simpler than trying (and probably failing) to enumerate
// all the exceptional cases
return new Dictionary<FieldInfo, int>();
}
}
}
}