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
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
|
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
//
// File: genericdict.cpp
//
//
// WARNING: Do NOT turn try to save dictionary slots except in the
// hardbind case. Saving further dictionary slots can lead
// to ComputeNeedsRestore returning TRUE for the dictionary and
// the associated method table (though of course only if some
// entries in the dictionary are prepopulated). However at
// earlier stages in the NGEN, code may have been compiled
// under the assumption that ComputeNeedsRestore was
// FALSE for the assocaited method table, and indeed this result
// may have been cached in the ComputeNeedsRestore
// for the MethodTable. Thus the combination of populating
// the dictionary and saving further dictionary slots could lead
// to inconsistencies and unsoundnesses in compilation.
//
//
// ============================================================================
#include "common.h"
#include "genericdict.h"
#include "typestring.h"
#include "field.h"
#include "typectxt.h"
#include "virtualcallstub.h"
#include "sigbuilder.h"
#include "compile.h"
#ifndef DACCESS_COMPILE
//---------------------------------------------------------------------------------------
//
//static
DictionaryLayout *
DictionaryLayout::Allocate(
WORD numSlots,
LoaderAllocator * pAllocator,
AllocMemTracker * pamTracker)
{
CONTRACT(DictionaryLayout*)
{
THROWS;
GC_NOTRIGGER;
INJECT_FAULT(COMPlusThrowOM(););
PRECONDITION(CheckPointer(pAllocator));
PRECONDITION(numSlots > 0);
POSTCONDITION(CheckPointer(RETVAL));
}
CONTRACT_END
S_SIZE_T bytes = S_SIZE_T(sizeof(DictionaryLayout)) + S_SIZE_T(sizeof(DictionaryEntryLayout)) * S_SIZE_T(numSlots-1);
TaggedMemAllocPtr ptr = pAllocator->GetLowFrequencyHeap()->AllocMem(bytes);
if (pamTracker != NULL)
pamTracker->Track(ptr);
DictionaryLayout * pD = (DictionaryLayout *)(void *)ptr;
// When bucket spills we'll allocate another layout structure
pD->m_pNext = NULL;
// This is the number of slots excluding the type parameters
pD->m_numSlots = numSlots;
RETURN pD;
} // DictionaryLayout::Allocate
#endif //!DACCESS_COMPILE
//---------------------------------------------------------------------------------------
//
// Count the number of bytes that are required by the first bucket in a dictionary with the specified layout
//
//static
DWORD
DictionaryLayout::GetFirstDictionaryBucketSize(
DWORD numGenericArgs,
PTR_DictionaryLayout pDictLayout)
{
LIMITED_METHOD_DAC_CONTRACT;
PRECONDITION(numGenericArgs > 0);
PRECONDITION(CheckPointer(pDictLayout, NULL_OK));
DWORD bytes = numGenericArgs * sizeof(TypeHandle);
if (pDictLayout != NULL)
bytes += pDictLayout->m_numSlots * sizeof(void*);
return bytes;
}
#ifndef DACCESS_COMPILE
//---------------------------------------------------------------------------------------
//
// Find a token in the dictionary layout and return the offsets of indirections
// required to get to its slot in the actual dictionary
//
// NOTE: We will currently never return more than one indirection. We don't
// cascade dictionaries but we will record overflows in the dictionary layout
// (and cascade that accordingly) so we can prepopulate the overflow hash in
// reliability scenarios.
//
// Optimize the case of a token being !i (for class dictionaries) or !!i (for method dictionaries)
//
//static
BOOL
DictionaryLayout::FindToken(
LoaderAllocator * pAllocator,
DWORD numGenericArgs,
DictionaryLayout * pDictLayout,
CORINFO_RUNTIME_LOOKUP * pResult,
SigBuilder * pSigBuilder,
int nFirstOffset)
{
CONTRACTL
{
STANDARD_VM_CHECK;
PRECONDITION(numGenericArgs > 0);
PRECONDITION(CheckPointer(pDictLayout));
}
CONTRACTL_END
BOOL isFirstBucket = TRUE;
// First bucket also contains type parameters
_ASSERTE(FitsIn<WORD>(numGenericArgs));
WORD slot = static_cast<WORD>(numGenericArgs);
for (;;)
{
for (DWORD iSlot = 0; iSlot < pDictLayout->m_numSlots; iSlot++)
{
RetryMatch:
BYTE * pCandidate = (BYTE *)pDictLayout->m_slots[iSlot].m_signature;
if (pCandidate != NULL)
{
DWORD cbSig;
BYTE * pSig = (BYTE *)pSigBuilder->GetSignature(&cbSig);
// Compare the signatures. We do not need to worry about the size of pCandidate.
// As long as we are comparing one byte at a time we are guaranteed to not overrun.
DWORD j;
for (j = 0; j < cbSig; j++)
{
if (pCandidate[j] != pSig[j])
break;
}
// We've found it
if (j == cbSig)
{
pResult->signature = pDictLayout->m_slots[iSlot].m_signature;
// We don't store entries outside the first bucket in the layout in the dictionary (they'll be cached in a hash
// instead).
if (!isFirstBucket)
{
return FALSE;
}
_ASSERTE(FitsIn<WORD>(nFirstOffset + 1));
pResult->indirections = static_cast<WORD>(nFirstOffset+1);
pResult->offsets[nFirstOffset] = slot * sizeof(DictionaryEntry);
return TRUE;
}
}
// If we hit an empty slot then there's no more so use it
else
{
{
BaseDomain::LockHolder lh(pAllocator->GetDomain());
if (pDictLayout->m_slots[iSlot].m_signature != NULL)
goto RetryMatch;
pSigBuilder->AppendData(isFirstBucket ? slot : 0);
DWORD cbSig;
PVOID pSig = pSigBuilder->GetSignature(&cbSig);
PVOID pPersisted = pAllocator->GetLowFrequencyHeap()->AllocMem(S_SIZE_T(cbSig));
memcpy(pPersisted, pSig, cbSig);
*EnsureWritablePages(&(pDictLayout->m_slots[iSlot].m_signature)) = pPersisted;
}
pResult->signature = pDictLayout->m_slots[iSlot].m_signature;
// Again, we only store entries in the first layout bucket in the dictionary.
if (!isFirstBucket)
{
return FALSE;
}
_ASSERTE(FitsIn<WORD>(nFirstOffset + 1));
pResult->indirections = static_cast<WORD>(nFirstOffset+1);
pResult->offsets[nFirstOffset] = slot * sizeof(DictionaryEntry);
return TRUE;
}
slot++;
}
// If we've reached the end of the chain we need to allocate another bucket. Make the pointer update carefully to avoid
// orphaning a bucket in a race. We leak the loser in such a race (since the allocation comes from the loader heap) but both
// the race and the overflow should be very rare.
if (pDictLayout->m_pNext == NULL)
FastInterlockCompareExchangePointer(EnsureWritablePages(&(pDictLayout->m_pNext)), Allocate(4, pAllocator, NULL), 0);
pDictLayout = pDictLayout->m_pNext;
isFirstBucket = FALSE;
}
} // DictionaryLayout::FindToken
#endif //!DACCESS_COMPILE
//---------------------------------------------------------------------------------------
//
DWORD
DictionaryLayout::GetMaxSlots()
{
LIMITED_METHOD_CONTRACT;
return m_numSlots;
}
//---------------------------------------------------------------------------------------
//
DWORD
DictionaryLayout::GetNumUsedSlots()
{
LIMITED_METHOD_CONTRACT;
DWORD numUsedSlots = 0;
for (DWORD i = 0; i < m_numSlots; i++)
{
if (GetEntryLayout(i)->m_signature != NULL)
numUsedSlots++;
}
return numUsedSlots;
}
//---------------------------------------------------------------------------------------
//
DictionaryEntryKind
DictionaryEntryLayout::GetKind()
{
STANDARD_VM_CONTRACT;
if (m_signature == NULL)
return EmptySlot;
SigPointer ptr((PCCOR_SIGNATURE)dac_cast<TADDR>(m_signature));
ULONG kind; // DictionaryEntryKind
IfFailThrow(ptr.GetData(&kind));
return (DictionaryEntryKind)kind;
}
#ifndef DACCESS_COMPILE
#ifdef FEATURE_NATIVE_IMAGE_GENERATION
//---------------------------------------------------------------------------------------
//
DWORD
DictionaryLayout::GetObjectSize()
{
LIMITED_METHOD_CONTRACT;
return sizeof(DictionaryLayout) + sizeof(DictionaryEntryLayout) * (m_numSlots-1);
}
//---------------------------------------------------------------------------------------
//
// Save the dictionary layout for prejitting
//
void
DictionaryLayout::Save(
DataImage * image)
{
STANDARD_VM_CONTRACT;
DictionaryLayout *pDictLayout = this;
while (pDictLayout)
{
image->StoreStructure(pDictLayout, pDictLayout->GetObjectSize(), DataImage::ITEM_DICTIONARY_LAYOUT);
pDictLayout = pDictLayout->m_pNext;
}
}
//---------------------------------------------------------------------------------------
//
// Save the dictionary layout for prejitting
//
void
DictionaryLayout::Trim()
{
CONTRACTL
{
THROWS;
GC_NOTRIGGER;
}
CONTRACTL_END;
// Only the last bucket in the chain may have unused entries
DictionaryLayout *pDictLayout = this;
while (pDictLayout->m_pNext)
pDictLayout = pDictLayout->m_pNext;
// Trim down the size to what's actually used
DWORD dwSlots = pDictLayout->GetNumUsedSlots();
_ASSERTE(FitsIn<WORD>(dwSlots));
*EnsureWritablePages(&pDictLayout->m_numSlots) = static_cast<WORD>(dwSlots);
}
//---------------------------------------------------------------------------------------
//
// Fixup pointers in the dictionary layout for prejitting
//
void
DictionaryLayout::Fixup(
DataImage * image,
BOOL fMethod)
{
STANDARD_VM_CONTRACT;
DictionaryLayout *pDictLayout = this;
while (pDictLayout)
{
for (DWORD i = 0; i < pDictLayout->m_numSlots; i++)
{
PVOID signature = pDictLayout->m_slots[i].m_signature;
if (signature != NULL)
{
image->FixupFieldToNode(pDictLayout, (BYTE *)&pDictLayout->m_slots[i].m_signature - (BYTE *)pDictLayout,
image->GetGenericSignature(signature, fMethod));
}
}
image->FixupPointerField(pDictLayout, offsetof(DictionaryLayout, m_pNext));
pDictLayout = pDictLayout->m_pNext;
}
}
//---------------------------------------------------------------------------------------
//
// Fixup pointers in the actual dictionary, including the type arguments. Delete entries
// that are expensive or difficult to restore.
//
void
Dictionary::Fixup(
DataImage * image,
BOOL canSaveInstantiation,
BOOL canSaveSlots,
DWORD numGenericArgs,
Module * pModule,
DictionaryLayout * pDictLayout)
{
STANDARD_VM_CONTRACT;
// First fixup the type handles in the instantiation itself
FixupPointer<TypeHandle> *pInst = GetInstantiation();
for (DWORD j = 0; j < numGenericArgs; j++)
{
if (canSaveInstantiation)
{
image->FixupTypeHandlePointer(pInst, &pInst[j]);
}
else
{
image->ZeroPointerField(AsPtr(), j * sizeof(DictionaryEntry));
}
}
// Now traverse the remaining slots
if (pDictLayout != NULL)
{
for (DWORD i = 0; i < pDictLayout->m_numSlots; i++)
{
int slotOffset = (numGenericArgs + i) * sizeof(DictionaryEntry);
// First check if we can simply hardbind to a prerestored object
DictionaryEntryLayout *pLayout = pDictLayout->GetEntryLayout(i);
switch (pLayout->GetKind())
{
case TypeHandleSlot:
case DeclaringTypeHandleSlot:
if (canSaveSlots &&
!IsSlotEmpty(numGenericArgs,i) &&
image->CanPrerestoreEagerBindToTypeHandle(GetTypeHandleSlot(numGenericArgs, i), NULL) &&
image->CanHardBindToZapModule(GetTypeHandleSlot(numGenericArgs, i).GetLoaderModule()))
{
image->HardBindTypeHandlePointer(AsPtr(), slotOffset);
}
else
{
// Otherwise just zero the slot
image->ZeroPointerField(AsPtr(), slotOffset);
}
break;
case MethodDescSlot:
if (canSaveSlots &&
!IsSlotEmpty(numGenericArgs,i) &&
image->CanPrerestoreEagerBindToMethodDesc(GetMethodDescSlot(numGenericArgs,i), NULL) &&
image->CanHardBindToZapModule(GetMethodDescSlot(numGenericArgs,i)->GetLoaderModule()))
{
image->FixupPointerField(AsPtr(), slotOffset);
}
else
{
// Otherwise just zero the slot
image->ZeroPointerField(AsPtr(), slotOffset);
}
break;
case FieldDescSlot:
if (canSaveSlots &&
!IsSlotEmpty(numGenericArgs,i) &&
image->CanEagerBindToFieldDesc(GetFieldDescSlot(numGenericArgs,i)) &&
image->CanHardBindToZapModule(GetFieldDescSlot(numGenericArgs,i)->GetLoaderModule()))
{
image->FixupPointerField(AsPtr(), slotOffset);
}
else
{
// Otherwise just zero the slot
image->ZeroPointerField(AsPtr(), slotOffset);
}
break;
default:
// <TODO> Method entry points are currently not saved </TODO>
// <TODO> Stub dispatch slots are currently not saved </TODO>
// Otherwise just zero the slot
image->ZeroPointerField(AsPtr(), slotOffset);
}
}
}
} // Dictionary::Fixup
//---------------------------------------------------------------------------------------
//
BOOL
Dictionary::IsWriteable(
DataImage * image,
BOOL canSaveSlots,
DWORD numGenericArgs, // Must be non-zero
Module * pModule, // module of the generic code
DictionaryLayout * pDictLayout)
{
STANDARD_VM_CONTRACT;
// Traverse dictionary slots
if (pDictLayout != NULL)
{
for (DWORD i = 0; i < pDictLayout->m_numSlots; i++)
{
// First check if we can simply hardbind to a prerestored object
DictionaryEntryLayout *pLayout = pDictLayout->GetEntryLayout(i);
switch (pLayout->GetKind())
{
case TypeHandleSlot:
case DeclaringTypeHandleSlot:
if (canSaveSlots &&
!IsSlotEmpty(numGenericArgs,i) &&
image->CanPrerestoreEagerBindToTypeHandle(GetTypeHandleSlot(numGenericArgs, i), NULL) &&
image->CanHardBindToZapModule(GetTypeHandleSlot(numGenericArgs, i).GetLoaderModule()))
{
// do nothing
}
else
{
return TRUE;
}
break;
case MethodDescSlot:
if (canSaveSlots &&
!IsSlotEmpty(numGenericArgs,i) &&
image->CanPrerestoreEagerBindToMethodDesc(GetMethodDescSlot(numGenericArgs,i), NULL) &&
image->CanHardBindToZapModule(GetMethodDescSlot(numGenericArgs,i)->GetLoaderModule()))
{
// do nothing
}
else
{
return TRUE;
}
break;
case FieldDescSlot:
if (canSaveSlots &&
!IsSlotEmpty(numGenericArgs,i) &&
image->CanEagerBindToFieldDesc(GetFieldDescSlot(numGenericArgs,i)) &&
image->CanHardBindToZapModule(GetFieldDescSlot(numGenericArgs,i)->GetLoaderModule()))
{
// do nothing
}
else
{
return TRUE;
}
break;
default:
// <TODO> Method entry points are currently not saved </TODO>
// <TODO> Stub dispatch slots are currently not saved </TODO>
return TRUE;
}
}
}
return FALSE;
} // Dictionary::IsWriteable
//---------------------------------------------------------------------------------------
//
BOOL
Dictionary::ComputeNeedsRestore(
DataImage * image,
TypeHandleList * pVisited,
DWORD numGenericArgs)
{
STANDARD_VM_CONTRACT;
// First check the type handles in the instantiation itself
FixupPointer<TypeHandle> *inst = GetInstantiation();
for (DWORD j = 0; j < numGenericArgs; j++)
{
if (!image->CanPrerestoreEagerBindToTypeHandle(inst[j].GetValue(), pVisited))
return TRUE;
}
// Unless prepopulating we don't need to check the entries
// of the dictionary because if we can't
// hardbind to them we just zero the dictionary entry and recover
// it on demand.
return FALSE;
}
#endif //FEATURE_NATIVE_IMAGE_GENERATION
#ifdef FEATURE_PREJIT
//---------------------------------------------------------------------------------------
//
void
Dictionary::Restore(
DWORD numGenericArgs,
ClassLoadLevel level)
{
CONTRACTL
{
THROWS;
GC_TRIGGERS;
INSTANCE_CHECK;
}
CONTRACTL_END
// First restore the type handles in the instantiation itself
FixupPointer<TypeHandle> *inst = GetInstantiation();
for (DWORD j = 0; j < numGenericArgs; j++)
{
Module::RestoreTypeHandlePointer(&inst[j], NULL, level);
}
// We don't restore the remainder of the dictionary - see
// long comment at the start of this file as to why
}
#endif // FEATURE_PREJIT
//---------------------------------------------------------------------------------------
//
DictionaryEntry
Dictionary::PopulateEntry(
MethodDesc * pMD,
MethodTable * pMT,
LPVOID signature,
BOOL nonExpansive,
DictionaryEntry ** ppSlot)
{
CONTRACTL {
THROWS;
GC_TRIGGERS;
} CONTRACTL_END;
CORINFO_GENERIC_HANDLE result = NULL;
*ppSlot = NULL;
SigPointer ptr((PCCOR_SIGNATURE)signature);
Dictionary * pDictionary = NULL;
ULONG kind; // DictionaryEntryKind
IfFailThrow(ptr.GetData(&kind));
if (pMT != NULL)
{
// We need to normalize the class passed in (if any) for reliability purposes. That's because preparation of a code region that
// contains these handle lookups depends on being able to predict exactly which lookups are required (so we can pre-cache the
// answers and remove any possibility of failure at runtime). This is hard to do if the lookup (in this case the lookup of the
// dictionary overflow cache) is keyed off the somewhat arbitrary type of the instance on which the call is made (we'd need to
// prepare for every possible derived type of the type containing the method). So instead we have to locate the exactly
// instantiated (non-shared) super-type of the class passed in.
ULONG dictionaryIndex = 0;
IfFailThrow(ptr.GetData(&dictionaryIndex));
pDictionary = pMT->GetDictionary();
// MethodTable is expected to be normalized
_ASSERTE(pDictionary == pMT->GetPerInstInfo()[dictionaryIndex]);
}
else
{
pDictionary = pMD->GetMethodDictionary();
}
{
SigTypeContext typeContext;
if (pMT != NULL)
{
SigTypeContext::InitTypeContext(pMT, &typeContext);
}
else
{
SigTypeContext::InitTypeContext(pMD, &typeContext);
}
Module * pContainingZapModule = ExecutionManager::FindZapModule(dac_cast<TADDR>(signature));
ZapSig::Context zapSigContext(
MscorlibBinder::GetModule(),
(void *)pContainingZapModule,
ZapSig::NormalTokens);
ZapSig::Context * pZapSigContext = (pContainingZapModule != NULL) ? &zapSigContext : NULL;
TypeHandle constraintType;
TypeHandle declaringType;
switch (kind)
{
case DeclaringTypeHandleSlot:
{
declaringType = ptr.GetTypeHandleThrowing(
MscorlibBinder::GetModule(),
&typeContext,
(nonExpansive ? ClassLoader::DontLoadTypes : ClassLoader::LoadTypes),
CLASS_LOADED,
FALSE,
NULL,
pZapSigContext);
if (declaringType.IsNull())
{
_ASSERTE(nonExpansive);
return NULL;
}
IfFailThrow(ptr.SkipExactlyOne());
// fall through
}
case TypeHandleSlot:
{
TypeHandle th = ptr.GetTypeHandleThrowing(
MscorlibBinder::GetModule(),
&typeContext,
(nonExpansive ? ClassLoader::DontLoadTypes : ClassLoader::LoadTypes),
CLASS_LOADED,
FALSE,
NULL,
pZapSigContext);
if (th.IsNull())
{
_ASSERTE(nonExpansive);
return NULL;
}
IfFailThrow(ptr.SkipExactlyOne());
if (!declaringType.IsNull())
{
th = th.GetMethodTable()->GetMethodTableMatchingParentClass(declaringType.AsMethodTable());
}
if (!IsCompilationProcess())
{
th.GetMethodTable()->EnsureInstanceActive();
}
result = (CORINFO_GENERIC_HANDLE)th.AsPtr();
break;
}
case ConstrainedMethodEntrySlot:
{
constraintType = ptr.GetTypeHandleThrowing(
MscorlibBinder::GetModule(),
&typeContext,
(nonExpansive ? ClassLoader::DontLoadTypes : ClassLoader::LoadTypes),
CLASS_LOADED,
FALSE,
NULL,
pZapSigContext);
if (constraintType.IsNull())
{
_ASSERTE(nonExpansive);
return NULL;
}
IfFailThrow(ptr.SkipExactlyOne());
// fall through
}
case MethodDescSlot:
case DispatchStubAddrSlot:
case MethodEntrySlot:
{
TypeHandle ownerType = ptr.GetTypeHandleThrowing(
MscorlibBinder::GetModule(),
&typeContext,
(nonExpansive ? ClassLoader::DontLoadTypes : ClassLoader::LoadTypes),
CLASS_LOADED,
FALSE,
NULL,
pZapSigContext);
if (ownerType.IsNull())
{
_ASSERTE(nonExpansive);
return NULL;
}
IfFailThrow(ptr.SkipExactlyOne());
// <NICE> wsperf: Create a path that doesn't load types or create new handles if nonExpansive is set </NICE>
if (nonExpansive)
return NULL;
MethodTable * pOwnerMT = ownerType.GetMethodTable();
_ASSERTE(pOwnerMT != NULL);
DWORD methodFlags;
IfFailThrow(ptr.GetData(&methodFlags));
BOOL isInstantiatingStub = ((methodFlags & ENCODE_METHOD_SIG_InstantiatingStub) != 0);
BOOL isUnboxingStub = ((methodFlags & ENCODE_METHOD_SIG_UnboxingStub) != 0);
BOOL fMethodNeedsInstantiation = ((methodFlags & ENCODE_METHOD_SIG_MethodInstantiation) != 0);
MethodDesc * pMethod = NULL;
if ((methodFlags & ENCODE_METHOD_SIG_SlotInsteadOfToken) != 0)
{
// get the method desc using slot number
DWORD slot;
IfFailThrow(ptr.GetData(&slot));
if (kind == DispatchStubAddrSlot)
{
if (NingenEnabled())
return NULL;
#ifndef CROSSGEN_COMPILE
// Generate a dispatch stub and store it in the dictionary.
//
// We generate an indirection so we don't have to write to the dictionary
// when we do updates, and to simplify stub indirect callsites. Stubs stored in
// dictionaries use "RegisterIndirect" stub calling, e.g. "call [eax]",
// i.e. here the register "eax" would contain the value fetched from the dictionary,
// which in turn points to the stub indirection which holds the value the current stub
// address itself. If we just used "call eax" then we wouldn't know which stub indirection
// to update. If we really wanted to avoid the extra indirection we could return the _address_ of the
// dictionary entry to the caller, still using "call [eax]", and then the
// stub dispatch mechanism can update the dictitonary itself and we don't
// need an indirection.
LoaderAllocator * pDictLoaderAllocator = (pMT != NULL) ? pMT->GetLoaderAllocator() : pMD->GetLoaderAllocator();
VirtualCallStubManager * pMgr = pDictLoaderAllocator->GetVirtualCallStubManager();
// We indirect through a cell so that updates can take place atomically.
// The call stub and the indirection cell have the same lifetime as the dictionary itself, i.e.
// are allocated in the domain of the dicitonary.
//
// In the case of overflow (where there is no dictionary, just a global hash table) then
// the entry will be placed in the overflow hash table (JitGenericHandleCache). This
// is partitioned according to domain, i.e. is scraped each time an AppDomain gets unloaded.
PCODE addr = pMgr->GetCallStub(ownerType, slot);
result = (CORINFO_GENERIC_HANDLE)pMgr->GenerateStubIndirection(addr);
break;
#endif // CROSSGEN_COMPILE
}
pMethod = pOwnerMT->GetMethodDescForSlot(slot);
}
else
{
// Decode type where the method token is defined
TypeHandle thMethodDefType = ptr.GetTypeHandleThrowing(
MscorlibBinder::GetModule(),
&typeContext,
(nonExpansive ? ClassLoader::DontLoadTypes : ClassLoader::LoadTypes),
CLASS_LOADED,
FALSE,
NULL,
pZapSigContext);
if (thMethodDefType.IsNull())
{
_ASSERTE(nonExpansive);
return NULL;
}
IfFailThrow(ptr.SkipExactlyOne());
MethodTable * pMethodDefMT = thMethodDefType.GetMethodTable();
_ASSERTE(pMethodDefMT != NULL);
// decode method token
RID rid;
IfFailThrow(ptr.GetData(&rid));
mdMethodDef token = TokenFromRid(rid, mdtMethodDef);
// The RID map should have been filled out if we fully loaded the class
pMethod = pMethodDefMT->GetModule()->LookupMethodDef(token);
_ASSERTE(pMethod != NULL);
pMethod->CheckRestore();
}
Instantiation inst;
// Instantiate the method if needed, or create a stub to a static method in a generic class.
if (fMethodNeedsInstantiation)
{
DWORD nargs;
IfFailThrow(ptr.GetData(&nargs));
SIZE_T cbMem;
if (!ClrSafeInt<SIZE_T>::multiply(nargs, sizeof(TypeHandle), cbMem/* passed by ref */))
ThrowHR(COR_E_OVERFLOW);
TypeHandle * pInst = (TypeHandle*) _alloca(cbMem);
for (DWORD i = 0; i < nargs; i++)
{
pInst[i] = ptr.GetTypeHandleThrowing(
MscorlibBinder::GetModule(),
&typeContext,
ClassLoader::LoadTypes,
CLASS_LOADED,
FALSE,
NULL,
pZapSigContext);
IfFailThrow(ptr.SkipExactlyOne());
}
inst = Instantiation(pInst, nargs);
}
else
{
inst = pMethod->GetMethodInstantiation();
}
// This must be called even if nargs == 0, in order to create an instantiating
// stub for static methods in generic classees if needed, also for BoxedEntryPointStubs
// in non-generic structs.
pMethod = MethodDesc::FindOrCreateAssociatedMethodDesc(
pMethod,
pOwnerMT,
isUnboxingStub,
inst,
(!isInstantiatingStub && !isUnboxingStub));
if (kind == ConstrainedMethodEntrySlot)
{
_ASSERTE(!constraintType.IsNull());
MethodDesc *pResolvedMD = constraintType.GetMethodTable()->TryResolveConstraintMethodApprox(ownerType, pMethod);
// All such calls should be resolvable. If not then for now just throw an error.
_ASSERTE(pResolvedMD);
INDEBUG(if (!pResolvedMD) constraintType.GetMethodTable()->TryResolveConstraintMethodApprox(ownerType, pMethod);)
if (!pResolvedMD)
COMPlusThrowHR(COR_E_BADIMAGEFORMAT);
result = (CORINFO_GENERIC_HANDLE)pResolvedMD->GetMultiCallableAddrOfCode();
}
else
if (kind == MethodEntrySlot)
{
result = (CORINFO_GENERIC_HANDLE)pMethod->GetMultiCallableAddrOfCode();
}
else
if (kind == DispatchStubAddrSlot)
{
_ASSERTE((methodFlags & ENCODE_METHOD_SIG_SlotInsteadOfToken) == 0);
PCODE *ppCode = (PCODE*)(void*)pMethod->GetLoaderAllocator()->GetHighFrequencyHeap()->AllocMem(S_SIZE_T(sizeof(PCODE)));
*ppCode = pMethod->GetMultiCallableAddrOfCode();
result = (CORINFO_GENERIC_HANDLE)ppCode;
}
else
{
_ASSERTE(kind == MethodDescSlot);
result = (CORINFO_GENERIC_HANDLE)pMethod;
}
break;
}
case FieldDescSlot:
{
TypeHandle th = ptr.GetTypeHandleThrowing(
MscorlibBinder::GetModule(),
&typeContext,
(nonExpansive ? ClassLoader::DontLoadTypes : ClassLoader::LoadTypes),
CLASS_LOADED,
FALSE,
NULL,
pZapSigContext);
if (th.IsNull())
{
_ASSERTE(nonExpansive);
return NULL;
}
IfFailThrow(ptr.SkipExactlyOne());
DWORD fieldIndex;
IfFailThrow(ptr.GetData(&fieldIndex));
if (!IsCompilationProcess())
{
th.AsMethodTable()->EnsureInstanceActive();
}
result = (CORINFO_GENERIC_HANDLE)th.AsMethodTable()->GetFieldDescByIndex(fieldIndex);
break;
}
default:
_ASSERTE(!"Invalid DictionaryEntryKind");
break;
}
ULONG slotIndex;
IfFailThrow(ptr.GetData(&slotIndex));
MemoryBarrier();
if ((slotIndex != 0) && !IsCompilationProcess())
{
*EnsureWritablePages(pDictionary->GetSlotAddr(0, slotIndex)) = result;
*ppSlot = pDictionary->GetSlotAddr(0, slotIndex);
}
}
return result;
} // Dictionary::PopulateEntry
//---------------------------------------------------------------------------------------
//
void
Dictionary::PrepopulateDictionary(
MethodDesc * pMD,
MethodTable * pMT,
BOOL nonExpansive)
{
STANDARD_VM_CONTRACT;
DictionaryLayout * pDictLayout = (pMT != NULL) ? pMT->GetClass()->GetDictionaryLayout() : pMD->GetDictionaryLayout();
DWORD numGenericArgs = (pMT != NULL) ? pMT->GetNumGenericArgs() : pMD->GetNumGenericMethodArgs();
if (pDictLayout != NULL)
{
for (DWORD i = 0; i < pDictLayout->GetNumUsedSlots(); i++)
{
if (IsSlotEmpty(numGenericArgs,i))
{
DictionaryEntry * pSlot;
DictionaryEntry entry;
entry = PopulateEntry(
pMD,
pMT,
pDictLayout->GetEntryLayout(i)->m_signature,
nonExpansive,
&pSlot);
_ASSERT((entry == NULL) || (entry == GetSlot(numGenericArgs,i)) || IsCompilationProcess());
_ASSERT((pSlot == NULL) || (pSlot == GetSlotAddr(numGenericArgs,i)));
}
}
}
} // Dictionary::PrepopulateDictionary
#endif //!DACCESS_COMPILE
|