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
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
|
//
// Copyright (c) Microsoft. All rights reserved.
// Licensed under the MIT license. See LICENSE file in the project root for full license information.
//
/*
* Generational GC handle manager. Main Entrypoint Layer.
*
* Implements generic support for external roots into a GC heap.
*
*
*/
#include "common.h"
#include "gcenv.h"
#include "gc.h"
#include "objecthandle.h"
#include "handletablepriv.h"
#ifndef FEATURE_REDHAWK
#include "nativeoverlapped.h"
#endif
/****************************************************************************
*
* FORWARD DECLARATIONS
*
****************************************************************************/
#ifdef _DEBUG
void DEBUG_PostGCScanHandler(HandleTable *pTable, const UINT *types, UINT typeCount, UINT condemned, UINT maxgen, ScanCallbackInfo *info);
void DEBUG_LogScanningStatistics(HandleTable *pTable, DWORD level);
#endif
/*--------------------------------------------------------------------------*/
/****************************************************************************
*
* HELPER ROUTINES
*
****************************************************************************/
/*
* Table
*
* Gets and validates the table pointer from a table handle.
*
*/
__inline PTR_HandleTable Table(HHANDLETABLE hTable)
{
WRAPPER_NO_CONTRACT;
SUPPORTS_DAC;
// convert the handle to a pointer
PTR_HandleTable pTable = (PTR_HandleTable)hTable;
// sanity
_ASSERTE(pTable);
// return the table pointer
return pTable;
}
/*--------------------------------------------------------------------------*/
/****************************************************************************
*
* MAIN ENTRYPOINTS
*
****************************************************************************/
#ifndef DACCESS_COMPILE
/*
* HndCreateHandleTable
*
* Alocates and initializes a handle table.
*
*/
HHANDLETABLE HndCreateHandleTable(const UINT *pTypeFlags, UINT uTypeCount, ADIndex uADIndex)
{
CONTRACTL
{
NOTHROW;
GC_NOTRIGGER;
INJECT_FAULT(return NULL);
}
CONTRACTL_END;
// sanity
_ASSERTE(uTypeCount);
// verify that we can handle the specified number of types
// may need to increase HANDLE_MAX_INTERNAL_TYPES (by 4)
_ASSERTE(uTypeCount <= HANDLE_MAX_PUBLIC_TYPES);
// verify that segment header layout we're using fits expected size
_ASSERTE(sizeof(_TableSegmentHeader) <= HANDLE_HEADER_SIZE);
// if you hit this then TABLE LAYOUT IS BROKEN
// compute the size of the handle table allocation
ULONG32 dwSize = sizeof(HandleTable) + (uTypeCount * sizeof(HandleTypeCache));
// allocate the table
HandleTable *pTable = (HandleTable *) new (nothrow) BYTE[dwSize];
if (pTable == NULL)
return NULL;
memset (pTable, 0, dwSize);
// allocate the initial handle segment
pTable->pSegmentList = SegmentAlloc(pTable);
// if that failed then we are also out of business
if (!pTable->pSegmentList)
{
// free the table's memory and get out
delete [] (BYTE*)pTable;
return NULL;
}
// initialize the table's lock
// We need to allow CRST_UNSAFE_SAMELEVEL, because
// during AD unload, we need to move some TableSegment from unloaded domain to default domain.
// We need to take both locks for the two HandleTable's to avoid racing with concurrent gc thread.
if (!pTable->Lock.InitNoThrow(CrstHandleTable, CrstFlags(CRST_REENTRANCY | CRST_UNSAFE_ANYMODE | CRST_DEBUGGER_THREAD | CRST_UNSAFE_SAMELEVEL)))
{
SegmentFree(pTable->pSegmentList);
delete [] (BYTE*)pTable;
return NULL;
}
// remember how many types we are supporting
pTable->uTypeCount = uTypeCount;
// Store user data
pTable->uTableIndex = (UINT) -1;
pTable->uADIndex = uADIndex;
// loop over various arrays an initialize them
UINT u;
// initialize the type flags for the types we were passed
for (u = 0; u < uTypeCount; u++)
pTable->rgTypeFlags[u] = pTypeFlags[u];
// preinit the rest to HNDF_NORMAL
while (u < HANDLE_MAX_INTERNAL_TYPES)
pTable->rgTypeFlags[u++] = HNDF_NORMAL;
// initialize the main cache
for (u = 0; u < uTypeCount; u++)
{
// at init time, the only non-zero field in a type cache is the free index
pTable->rgMainCache[u].lFreeIndex = HANDLES_PER_CACHE_BANK;
}
#ifdef _DEBUG
// set up scanning stats
pTable->_DEBUG_iMaxGen = -1;
#endif
// all done - return the newly created table
return (HHANDLETABLE)pTable;
}
/*
* HndDestroyHandleTable
*
* Cleans up and frees the specified handle table.
*
*/
void HndDestroyHandleTable(HHANDLETABLE hTable)
{
WRAPPER_NO_CONTRACT;
// fetch the handle table pointer
HandleTable *pTable = Table(hTable);
// decrement handle count by number of handles in this table
COUNTER_ONLY(GetPerfCounters().m_GC.cHandles -= HndCountHandles(hTable));
// We are going to free the memory for this HandleTable.
// Let us reset the copy in g_pHandleTableArray to NULL.
// Otherwise, GC will think this HandleTable is still available.
// free the lock
pTable->Lock.Destroy();
// fetch the segment list and null out the list pointer
TableSegment *pSegment = pTable->pSegmentList;
pTable->pSegmentList = NULL;
// walk the segment list, freeing the segments as we go
while (pSegment)
{
// fetch the next segment
TableSegment *pNextSegment = pSegment->pNextSegment;
// free the current one and advance to the next
SegmentFree(pSegment);
pSegment = pNextSegment;
}
// free the table's memory
delete [] (BYTE*) pTable;
}
/*
* HndSetHandleTableIndex
*
* Sets the index associated with a handle table at creation
*/
void HndSetHandleTableIndex(HHANDLETABLE hTable, UINT uTableIndex)
{
WRAPPER_NO_CONTRACT;
// fetch the handle table pointer
HandleTable *pTable = Table(hTable);
pTable->uTableIndex = uTableIndex;
}
#endif // !DACCESS_COMPILE
/*
* HndGetHandleTableIndex
*
* Retrieves the index associated with a handle table at creation
*/
UINT HndGetHandleTableIndex(HHANDLETABLE hTable)
{
WRAPPER_NO_CONTRACT;
// fetch the handle table pointer
HandleTable *pTable = Table(hTable);
_ASSERTE (pTable->uTableIndex != (UINT) -1); // We have not set uTableIndex yet.
return pTable->uTableIndex;
}
/*
* HndGetHandleTableIndex
*
* Retrieves the AppDomain index associated with a handle table at creation
*/
ADIndex HndGetHandleTableADIndex(HHANDLETABLE hTable)
{
WRAPPER_NO_CONTRACT;
// fetch the handle table pointer
HandleTable *pTable = Table(hTable);
return pTable->uADIndex;
}
/*
* HndGetHandleTableIndex
*
* Retrieves the AppDomain index associated with a handle table at creation
*/
ADIndex HndGetHandleADIndex(OBJECTHANDLE handle)
{
WRAPPER_NO_CONTRACT;
SUPPORTS_DAC;
// fetch the handle table pointer
HandleTable *pTable = Table(HndGetHandleTable(handle));
return pTable->uADIndex;
}
#ifndef DACCESS_COMPILE
/*
* HndCreateHandle
*
* Entrypoint for allocating an individual handle.
*
*/
OBJECTHANDLE HndCreateHandle(HHANDLETABLE hTable, UINT uType, OBJECTREF object, LPARAM lExtraInfo)
{
CONTRACTL
{
#ifdef FEATURE_REDHAWK
// Redhawk returns NULL on failure.
NOTHROW;
#else
THROWS;
#endif
GC_NOTRIGGER;
if (object != NULL)
{
MODE_COOPERATIVE;
}
else
{
MODE_ANY;
}
SO_INTOLERANT;
}
CONTRACTL_END;
#if defined( _DEBUG) && !defined(FEATURE_REDHAWK)
if (g_pConfig->ShouldInjectFault(INJECTFAULT_HANDLETABLE))
{
FAULT_NOT_FATAL();
char *a = new char;
delete a;
}
#endif // _DEBUG && !FEATURE_REDHAWK
VALIDATEOBJECTREF(object);
// fetch the handle table pointer
HandleTable *pTable = Table(hTable);
// sanity check the type index
_ASSERTE(uType < pTable->uTypeCount);
// get a handle from the table's cache
OBJECTHANDLE handle = TableAllocSingleHandleFromCache(pTable, uType);
// did the allocation succeed?
if (!handle)
{
#ifdef FEATURE_REDHAWK
return NULL;
#else
ThrowOutOfMemory();
#endif
}
#ifdef DEBUG_DestroyedHandleValue
if (*(_UNCHECKED_OBJECTREF *)handle == DEBUG_DestroyedHandleValue)
*(_UNCHECKED_OBJECTREF *)handle = NULL;
#endif
// yep - the handle better not point at anything yet
_ASSERTE(*(_UNCHECKED_OBJECTREF *)handle == NULL);
// we are not holding the lock - check to see if there is nonzero extra info
if (lExtraInfo)
{
// initialize the user data BEFORE assigning the referent
// this ensures proper behavior if we are currently scanning
HandleQuickSetUserData(handle, lExtraInfo);
}
// store the reference
HndAssignHandle(handle, object);
// update perf-counters: track number of handles
COUNTER_ONLY(GetPerfCounters().m_GC.cHandles ++);
#ifdef GC_PROFILING
{
BEGIN_PIN_PROFILER(CORProfilerTrackGC());
g_profControlBlock.pProfInterface->HandleCreated((UINT_PTR)handle, (ObjectID)OBJECTREF_TO_UNCHECKED_OBJECTREF(object));
END_PIN_PROFILER();
}
#endif //GC_PROFILING
STRESS_LOG2(LF_GC, LL_INFO1000, "CreateHandle: %p, type=%d\n", handle, uType);
// return the result
return handle;
}
#endif // !DACCESS_COMPILE
#ifdef _DEBUG
void ValidateFetchObjrefForHandle(OBJECTREF objref, ADIndex appDomainIndex)
{
STATIC_CONTRACT_NOTHROW;
STATIC_CONTRACT_GC_NOTRIGGER;
STATIC_CONTRACT_SO_TOLERANT;
STATIC_CONTRACT_MODE_COOPERATIVE;
STATIC_CONTRACT_DEBUG_ONLY;
BEGIN_DEBUG_ONLY_CODE;
VALIDATEOBJECTREF (objref);
AppDomain *pDomain = SystemDomain::GetAppDomainAtIndex(appDomainIndex);
// Access to a handle in unloaded domain is not allowed
_ASSERTE(pDomain != NULL);
_ASSERTE(!pDomain->NoAccessToHandleTable());
#if CHECK_APP_DOMAIN_LEAKS
if (g_pConfig->AppDomainLeaks())
{
if (appDomainIndex.m_dwIndex)
objref->TryAssignAppDomain(pDomain);
else if (objref != 0)
objref->TrySetAppDomainAgile();
}
#endif
END_DEBUG_ONLY_CODE;
}
void ValidateAssignObjrefForHandle(OBJECTREF objref, ADIndex appDomainIndex)
{
STATIC_CONTRACT_NOTHROW;
STATIC_CONTRACT_GC_NOTRIGGER;
STATIC_CONTRACT_SO_TOLERANT;
STATIC_CONTRACT_MODE_COOPERATIVE;
STATIC_CONTRACT_DEBUG_ONLY;
BEGIN_DEBUG_ONLY_CODE;
VALIDATEOBJECTREF (objref);
AppDomain *pDomain = SystemDomain::GetAppDomainAtIndex(appDomainIndex);
// Access to a handle in unloaded domain is not allowed
_ASSERTE(pDomain != NULL);
_ASSERTE(!pDomain->NoAccessToHandleTable());
#if CHECK_APP_DOMAIN_LEAKS
if (g_pConfig->AppDomainLeaks())
{
if (appDomainIndex.m_dwIndex)
objref->TryAssignAppDomain(pDomain);
else if (objref != 0)
objref->TrySetAppDomainAgile();
}
#endif
END_DEBUG_ONLY_CODE;
}
void ValidateAppDomainForHandle(OBJECTHANDLE handle)
{
STATIC_CONTRACT_DEBUG_ONLY;
STATIC_CONTRACT_NOTHROW;
#ifdef DEBUG_DestroyedHandleValue
// Verify that we are not trying to access freed handle.
_ASSERTE("Attempt to access destroyed handle." && *(_UNCHECKED_OBJECTREF *)handle != DEBUG_DestroyedHandleValue);
#endif
#ifndef DACCESS_COMPILE
BEGIN_DEBUG_ONLY_CODE;
ADIndex id = HndGetHandleADIndex(handle);
AppDomain *pUnloadingDomain = SystemDomain::AppDomainBeingUnloaded();
if (!pUnloadingDomain || pUnloadingDomain->GetIndex() != id)
{
return;
}
if (!pUnloadingDomain->NoAccessToHandleTable())
{
return;
}
_ASSERTE (!"Access to a handle in unloaded domain is not allowed");
END_DEBUG_ONLY_CODE;
#endif // !DACCESS_COMPILE
}
#endif
#ifndef DACCESS_COMPILE
/*
* HndDestroyHandle
*
* Entrypoint for freeing an individual handle.
*
*/
void HndDestroyHandle(HHANDLETABLE hTable, UINT uType, OBJECTHANDLE handle)
{
CONTRACTL
{
NOTHROW;
GC_NOTRIGGER;
MODE_ANY;
SO_TOLERANT;
CAN_TAKE_LOCK; // because of TableFreeSingleHandleToCache
}
CONTRACTL_END;
STRESS_LOG2(LF_GC, LL_INFO1000, "DestroyHandle: *%p->%p\n", handle, *(_UNCHECKED_OBJECTREF *)handle);
FireEtwDestroyGCHandle((void*) handle, GetClrInstanceId());
FireEtwPrvDestroyGCHandle((void*) handle, GetClrInstanceId());
// sanity check handle we are being asked to free
_ASSERTE(handle);
#ifdef _DEBUG
ValidateAppDomainForHandle(handle);
#endif
// fetch the handle table pointer
HandleTable *pTable = Table(hTable);
#ifdef GC_PROFILING
{
BEGIN_PIN_PROFILER(CORProfilerTrackGC());
g_profControlBlock.pProfInterface->HandleDestroyed((UINT_PTR)handle);
END_PIN_PROFILER();
}
#endif //GC_PROFILING
// update perf-counters: track number of handles
COUNTER_ONLY(GetPerfCounters().m_GC.cHandles --);
// sanity check the type index
_ASSERTE(uType < pTable->uTypeCount);
_ASSERTE(HandleFetchType(handle) == uType);
// return the handle to the table's cache
TableFreeSingleHandleToCache(pTable, uType, handle);
}
/*
* HndDestroyHandleOfUnknownType
*
* Entrypoint for freeing an individual handle whose type is unknown.
*
*/
void HndDestroyHandleOfUnknownType(HHANDLETABLE hTable, OBJECTHANDLE handle)
{
CONTRACTL
{
NOTHROW;
GC_NOTRIGGER;
SO_TOLERANT;
MODE_ANY;
}
CONTRACTL_END;
// sanity check handle we are being asked to free
_ASSERTE(handle);
#ifdef FEATURE_COMINTEROP
// If we're being asked to destroy a WinRT weak handle, that will cause a leak
// of the IWeakReference* that it holds in its extra data. Instead of using this
// API use DestroyWinRTWeakHandle instead.
_ASSERTE(HandleFetchType(handle) != HNDTYPE_WEAK_WINRT);
#endif // FEATURE_COMINTEROP
// fetch the type and then free normally
HndDestroyHandle(hTable, HandleFetchType(handle), handle);
}
/*
* HndCreateHandles
*
* Entrypoint for allocating handles in bulk.
*
*/
UINT HndCreateHandles(HHANDLETABLE hTable, UINT uType, OBJECTHANDLE *pHandles, UINT uCount)
{
WRAPPER_NO_CONTRACT;
// fetch the handle table pointer
HandleTable *pTable = Table(hTable);
// sanity check the type index
_ASSERTE(uType < pTable->uTypeCount);
// keep track of the number of handles we've allocated
UINT uSatisfied = 0;
// if this is a large number of handles then bypass the cache
if (uCount > SMALL_ALLOC_COUNT)
{
CrstHolder ch(&pTable->Lock);
// allocate handles in bulk from the main handle table
uSatisfied = TableAllocBulkHandles(pTable, uType, pHandles, uCount);
}
// do we still need to get some handles?
if (uSatisfied < uCount)
{
// get some handles from the cache
uSatisfied += TableAllocHandlesFromCache(pTable, uType, pHandles + uSatisfied, uCount - uSatisfied);
}
// update perf-counters: track number of handles
COUNTER_ONLY(GetPerfCounters().m_GC.cHandles += uSatisfied);
#ifdef GC_PROFILING
{
BEGIN_PIN_PROFILER(CORProfilerTrackGC());
for (UINT i = 0; i < uSatisfied; i++)
g_profControlBlock.pProfInterface->HandleCreated((UINT_PTR)pHandles[i], 0);
END_PIN_PROFILER();
}
#endif //GC_PROFILING
// return the number of handles we allocated
return uSatisfied;
}
/*
* HndDestroyHandles
*
* Entrypoint for freeing handles in bulk.
*
*/
void HndDestroyHandles(HHANDLETABLE hTable, UINT uType, const OBJECTHANDLE *pHandles, UINT uCount)
{
WRAPPER_NO_CONTRACT;
#ifdef _DEBUG
ValidateAppDomainForHandle(pHandles[0]);
#endif
// fetch the handle table pointer
HandleTable *pTable = Table(hTable);
// sanity check the type index
_ASSERTE(uType < pTable->uTypeCount);
#ifdef GC_PROFILING
{
BEGIN_PIN_PROFILER(CORProfilerTrackGC());
for (UINT i = 0; i < uCount; i++)
g_profControlBlock.pProfInterface->HandleDestroyed((UINT_PTR)pHandles[i]);
END_PIN_PROFILER();
}
#endif
// update perf-counters: track number of handles
COUNTER_ONLY(GetPerfCounters().m_GC.cHandles -= uCount);
// is this a small number of handles?
if (uCount <= SMALL_ALLOC_COUNT)
{
// yes - free them via the handle cache
TableFreeHandlesToCache(pTable, uType, pHandles, uCount);
return;
}
// acquire the handle manager lock
{
CrstHolder ch(&pTable->Lock);
// free the unsorted handles in bulk to the main handle table
TableFreeBulkUnpreparedHandles(pTable, uType, pHandles, uCount);
}
}
/*
* HndSetHandleExtraInfo
*
* Stores owner data with handle.
*
*/
void HndSetHandleExtraInfo(OBJECTHANDLE handle, UINT uType, LPARAM lExtraInfo)
{
WRAPPER_NO_CONTRACT;
// fetch the user data slot for this handle if we have the right type
LPARAM *pUserData = HandleValidateAndFetchUserDataPointer(handle, uType);
// is there a slot?
if (pUserData)
{
// yes - store the info
*pUserData = lExtraInfo;
}
}
/*
* HndCompareExchangeHandleExtraInfo
*
* Stores owner data with handle.
*
*/
LPARAM HndCompareExchangeHandleExtraInfo(OBJECTHANDLE handle, UINT uType, LPARAM lOldExtraInfo, LPARAM lNewExtraInfo)
{
WRAPPER_NO_CONTRACT;
// fetch the user data slot for this handle if we have the right type
LPARAM *pUserData = HandleValidateAndFetchUserDataPointer(handle, uType);
// is there a slot?
if (pUserData)
{
// yes - attempt to store the info
return (LPARAM)FastInterlockCompareExchangePointer((PVOID*)pUserData, (PVOID)lNewExtraInfo, (PVOID)lOldExtraInfo);
}
_ASSERTE(!"Shouldn't be trying to call HndCompareExchangeHandleExtraInfo on handle types without extra info");
return NULL;
}
#endif // !DACCESS_COMPILE
/*
* HndGetHandleExtraInfo
*
* Retrieves owner data from handle.
*
*/
LPARAM HndGetHandleExtraInfo(OBJECTHANDLE handle)
{
WRAPPER_NO_CONTRACT;
// assume zero until we actually get it
LPARAM lExtraInfo = 0L;
// fetch the user data slot for this handle
PTR_LPARAM pUserData = HandleQuickFetchUserDataPointer(handle);
// if we did then copy the value
if (pUserData)
{
lExtraInfo = *(pUserData);
}
// return the value to our caller
return lExtraInfo;
}
/*
* HndGetHandleTable
*
* Returns the containing table of a handle.
*
*/
HHANDLETABLE HndGetHandleTable(OBJECTHANDLE handle)
{
WRAPPER_NO_CONTRACT;
SUPPORTS_DAC;
PTR_HandleTable pTable = HandleFetchHandleTable(handle);
return (HHANDLETABLE)pTable;
}
void HndLogSetEvent(OBJECTHANDLE handle, _UNCHECKED_OBJECTREF value)
{
STATIC_CONTRACT_NOTHROW;
STATIC_CONTRACT_GC_NOTRIGGER;
STATIC_CONTRACT_SO_TOLERANT;
STATIC_CONTRACT_MODE_COOPERATIVE;
#if !defined(DACCESS_COMPILE) && defined(FEATURE_EVENT_TRACE)
if (ETW_EVENT_ENABLED(MICROSOFT_WINDOWS_DOTNETRUNTIME_PRIVATE_PROVIDER_Context, SetGCHandle) ||
ETW_EVENT_ENABLED(MICROSOFT_WINDOWS_DOTNETRUNTIME_PROVIDER_Context, SetGCHandle))
{
UINT hndType = HandleFetchType(handle);
ADIndex appDomainIndex = HndGetHandleADIndex(handle);
AppDomain* pAppDomain = SystemDomain::GetAppDomainAtIndex(appDomainIndex);
UINT generation = value != 0 ? GCHeap::GetGCHeap()->WhichGeneration(value) : 0;
FireEtwSetGCHandle((void*) handle, value, hndType, generation, (LONGLONG) pAppDomain, GetClrInstanceId());
FireEtwPrvSetGCHandle((void*) handle, value, hndType, generation, (LONGLONG) pAppDomain, GetClrInstanceId());
// Also fire the things pinned by Async pinned handles
if (hndType == HNDTYPE_ASYNCPINNED)
{
if (value->GetMethodTable() == g_pOverlappedDataClass)
{
OverlappedDataObject* overlapped = (OverlappedDataObject*) value;
if (overlapped->m_isArray)
{
ArrayBase* pUserObject = (ArrayBase*)OBJECTREFToObject(overlapped->m_userObject);
Object **ppObj = (Object**)pUserObject->GetDataPtr(TRUE);
SIZE_T num = pUserObject->GetNumComponents();
for (SIZE_T i = 0; i < num; i ++)
{
value = ppObj[i];
UINT generation = value != 0 ? GCHeap::GetGCHeap()->WhichGeneration(value) : 0;
FireEtwSetGCHandle(overlapped, value, HNDTYPE_PINNED, generation, (LONGLONG) pAppDomain, GetClrInstanceId());
}
}
else
{
value = OBJECTREF_TO_UNCHECKED_OBJECTREF(overlapped->m_userObject);
UINT generation = value != 0 ? GCHeap::GetGCHeap()->WhichGeneration(value) : 0;
FireEtwSetGCHandle(overlapped, value, HNDTYPE_PINNED, generation, (LONGLONG) pAppDomain, GetClrInstanceId());
}
}
}
}
#endif
}
/*
* HndWriteBarrier
*
* Resets the generation number for the handle's clump to zero.
*
*/
void HndWriteBarrier(OBJECTHANDLE handle, OBJECTREF objref)
{
STATIC_CONTRACT_NOTHROW;
STATIC_CONTRACT_GC_NOTRIGGER;
STATIC_CONTRACT_SO_TOLERANT;
STATIC_CONTRACT_MODE_COOPERATIVE;
// unwrap the objectref we were given
_UNCHECKED_OBJECTREF value = OBJECTREF_TO_UNCHECKED_OBJECTREF(objref);
_ASSERTE (objref != NULL);
// find out generation
int generation = GCHeap::GetGCHeap()->WhichGeneration(value);
#ifndef FEATURE_REDHAWK
//OverlappedData need special treatment: because all user data pointed by it needs to be reported by this handle,
//its age is consider to be min age of the user data, to be simple, we just make it 0
if (HandleFetchType (handle) == HNDTYPE_ASYNCPINNED && objref->GetGCSafeMethodTable () == g_pOverlappedDataClass)
{
generation = 0;
}
#endif // !FEATURE_REDHAWK
// find the write barrier for this handle
BYTE *barrier = (BYTE *)((UINT_PTR)handle & HANDLE_SEGMENT_ALIGN_MASK);
// sanity
_ASSERTE(barrier);
// find the offset of this handle into the segment
UINT_PTR offset = (UINT_PTR)handle & HANDLE_SEGMENT_CONTENT_MASK;
// make sure it is in the handle area and not the header
_ASSERTE(offset >= HANDLE_HEADER_SIZE);
// compute the clump index for this handle
offset = (offset - HANDLE_HEADER_SIZE) / (HANDLE_SIZE * HANDLE_HANDLES_PER_CLUMP);
// Be careful to read and write the age byte via volatile operations. Otherwise the compiler has been
// observed to translate the read + conditional write sequence below into an unconditional read/write
// (utilizing a conditional register move to determine whether the write is an update or simply writes
// back what was read). This is a legal transformation for non-volatile accesses but obviously leads to a
// race condition where we can lose an update (see the comment below for the race condition).
volatile BYTE * pClumpAge = barrier + offset;
// if this age is smaller than age of the clump, update the clump age
if (*pClumpAge > (BYTE)generation)
{
// We have to be careful here. HndWriteBarrier is not under any synchronization
// Consider the scenario where 2 threads are hitting the line below at the same
// time. Only one will win. If the winner has an older age than the loser, we
// just created a potential GC hole (The clump will not be reporting the
// youngest handle in the clump, thus GC may skip the clump). To fix this
// we just set the clump age to 0, which means that whoever wins the race
// results are the same, as GC will always look at the clump
*pClumpAge = (BYTE)0;
}
}
/*
* HndEnumHandles
*
* Enumerates all handles of the specified type in the handle table.
*
* This entrypoint is provided for utility code (debugger support etc) that
* needs to enumerate all roots in the handle table.
*
*/
void HndEnumHandles(HHANDLETABLE hTable, const UINT *puType, UINT uTypeCount,
HANDLESCANPROC pfnEnum, LPARAM lParam1, LPARAM lParam2, BOOL fAsync)
{
WRAPPER_NO_CONTRACT;
// fetch the handle table pointer
PTR_HandleTable pTable = Table(hTable);
// per-block scanning callback
BLOCKSCANPROC pfnBlock;
// do we need to support user data?
BOOL fEnumUserData = TypesRequireUserDataScanning(pTable, puType, uTypeCount);
if (fEnumUserData)
{
// scan all handles with user data
pfnBlock = BlockScanBlocksWithUserData;
}
else
{
// scan all handles without user data
pfnBlock = BlockScanBlocksWithoutUserData;
}
// set up parameters for handle enumeration
ScanCallbackInfo info;
info.uFlags = (fAsync? HNDGCF_ASYNC : HNDGCF_NORMAL);
info.fEnumUserData = fEnumUserData;
info.dwAgeMask = 0;
info.pCurrentSegment = NULL;
info.pfnScan = pfnEnum;
info.param1 = lParam1;
info.param2 = lParam2;
// choose a scanning method based on the async flag
TABLESCANPROC pfnScanTable = TableScanHandles;
if (fAsync)
pfnScanTable = xxxTableScanHandlesAsync;
{
// acquire the handle manager lock
CrstHolderWithState ch(&pTable->Lock);
// scan the table
pfnScanTable(pTable, puType, uTypeCount, FullSegmentIterator, pfnBlock, &info, &ch);
}
}
/*
* HndScanHandlesForGC
*
* Multiple type scanning entrypoint for GC.
*
* This entrypoint is provided for GC-time scnas of the handle table ONLY. It
* enables ephemeral scanning of the table, and optionally ages the write barrier
* as it scans.
*
*/
void HndScanHandlesForGC(HHANDLETABLE hTable, HANDLESCANPROC scanProc, LPARAM param1, LPARAM param2,
const UINT *types, UINT typeCount, UINT condemned, UINT maxgen, UINT flags)
{
WRAPPER_NO_CONTRACT;
// fetch the table pointer
PTR_HandleTable pTable = Table(hTable);
// per-segment and per-block callbacks
SEGMENTITERATOR pfnSegment;
BLOCKSCANPROC pfnBlock = NULL;
// do we need to support user data?
BOOL enumUserData =
((flags & HNDGCF_EXTRAINFO) &&
TypesRequireUserDataScanning(pTable, types, typeCount));
// what type of GC are we performing?
if (condemned >= maxgen)
{
// full GC - use our full-service segment iterator
pfnSegment = FullSegmentIterator;
// see if there is a callback
if (scanProc)
{
// do we need to scan blocks with user data?
if (enumUserData)
{
// scan all with user data
pfnBlock = BlockScanBlocksWithUserData;
}
else
{
// scan all without user data
pfnBlock = BlockScanBlocksWithoutUserData;
}
}
else if (flags & HNDGCF_AGE)
{
// there is only aging to do
pfnBlock = BlockAgeBlocks;
}
}
else
{
// this is an ephemeral GC - is it g0?
if (condemned == 0)
{
// yes - do bare-bones enumeration
pfnSegment = QuickSegmentIterator;
}
else
{
// no - do normal enumeration
pfnSegment = StandardSegmentIterator;
}
// see if there is a callback
if (scanProc)
{
// there is a scan callback - scan the condemned generation
pfnBlock = BlockScanBlocksEphemeral;
}
#ifndef DACCESS_COMPILE
else if (flags & HNDGCF_AGE)
{
// there is only aging to do
pfnBlock = BlockAgeBlocksEphemeral;
}
#endif
}
// set up parameters for scan callbacks
ScanCallbackInfo info;
info.uFlags = flags;
info.fEnumUserData = enumUserData;
info.dwAgeMask = BuildAgeMask(condemned, maxgen);
info.pCurrentSegment = NULL;
info.pfnScan = scanProc;
info.param1 = param1;
info.param2 = param2;
#if defined(_DEBUG) && !defined(DACCESS_COMPILE)
info.DEBUG_BlocksScanned = 0;
info.DEBUG_BlocksScannedNonTrivially = 0;
info.DEBUG_HandleSlotsScanned = 0;
info.DEBUG_HandlesActuallyScanned = 0;
#endif
// choose a scanning method based on the async flag
TABLESCANPROC pfnScanTable = TableScanHandles;
if (flags & HNDGCF_ASYNC)
{
pfnScanTable = xxxTableScanHandlesAsync;
}
{
// lock the table down for concurrent GC only
CrstHolderWithState ch(&pTable->Lock, (flags & HNDGCF_ASYNC) != 0);
// perform the scan
pfnScanTable(pTable, types, typeCount, pfnSegment, pfnBlock, &info, &ch);
#if defined(_DEBUG) && !defined(DACCESS_COMPILE)
// update our scanning statistics for this generation
DEBUG_PostGCScanHandler(pTable, types, typeCount, condemned, maxgen, &info);
#endif
}
}
#ifndef DACCESS_COMPILE
/*
* HndResetAgeMap
*
* Service to forceably reset the age map for a set of handles.
*
* Provided for GC-time resetting the handle table's write barrier. This is not
* normally advisable, as it increases the amount of work that will be done in
* subsequent scans. Under some circumstances, however, this is precisely what is
* desired. Generally this entrypoint should only be used under some exceptional
* condition during garbage collection, like objects being demoted from a higher
* generation to a lower one.
*
*/
void HndResetAgeMap(HHANDLETABLE hTable, const UINT *types, UINT typeCount, UINT condemned, UINT maxgen, UINT flags)
{
WRAPPER_NO_CONTRACT;
// fetch the table pointer
HandleTable *pTable = Table(hTable);
// set up parameters for scan callbacks
ScanCallbackInfo info;
info.uFlags = flags;
info.fEnumUserData = FALSE;
info.dwAgeMask = BuildAgeMask(condemned, maxgen);
info.pCurrentSegment = NULL;
info.pfnScan = NULL;
info.param1 = 0;
info.param2 = 0;
{
// lock the table down
CrstHolderWithState ch(&pTable->Lock);
// perform the scan
TableScanHandles(pTable, types, typeCount, QuickSegmentIterator, BlockResetAgeMapForBlocks, &info, &ch);
}
}
/*
* HndVerifyTable
*
* Service to check the correctness of the handle table for a set of handles
*
* Provided for checking the correctness of handle table and the gc.
* Will validate that each handle points to a valid object.
* Will also validate that the generation of the handle is <= generation of the object.
* Cannot have == because the handle table only remembers the generation for a group of
* 16 handles.
*
*/
void HndVerifyTable(HHANDLETABLE hTable, const UINT *types, UINT typeCount, UINT condemned, UINT maxgen, UINT flags)
{
WRAPPER_NO_CONTRACT;
// fetch the table pointer
HandleTable *pTable = Table(hTable);
// set up parameters for scan callbacks
ScanCallbackInfo info;
info.uFlags = flags;
info.fEnumUserData = FALSE;
info.dwAgeMask = BuildAgeMask(condemned, maxgen);
info.pCurrentSegment = NULL;
info.pfnScan = NULL;
info.param1 = 0;
info.param2 = 0;
{
// lock the table down
CrstHolderWithState ch(&pTable->Lock);
// perform the scan
TableScanHandles(pTable, types, typeCount, QuickSegmentIterator, BlockVerifyAgeMapForBlocks, &info, &ch);
}
}
/*
* HndNotifyGcCycleComplete
*
* Informs the handle table that a GC has completed.
*
*/
void HndNotifyGcCycleComplete(HHANDLETABLE hTable, UINT condemned, UINT maxgen)
{
#ifdef _DEBUG
WRAPPER_NO_CONTRACT;
// fetch the handle table pointer
HandleTable *pTable = Table(hTable);
{
// lock the table down
CrstHolder ch(&pTable->Lock);
// if this was a full GC then dump a cumulative log of scanning stats
if (condemned >= maxgen)
DEBUG_LogScanningStatistics(pTable, LL_INFO10);
}
#else
LIMITED_METHOD_CONTRACT;
#endif
}
extern int getNumberOfSlots();
/*
* HndCountHandles
*
* Counts the number of handles owned by the handle table that are marked as
* "used" that are not currently residing in the handle table's cache.
*
* Provided to compute the correct value for the GC Handle perfcounter.
* The caller is responsible for acquiring the handle table's lock if
* it is necessary.
*
*/
UINT HndCountHandles(HHANDLETABLE hTable)
{
WRAPPER_NO_CONTRACT;
// fetch the handle table pointer
HandleTable *pTable = Table(hTable);
// initialize the count of handles in the cache to 0
UINT uCacheCount = 0;
// fetch the count of handles marked as "used"
UINT uCount = pTable->dwCount;
// loop through the main cache for each handle type
HandleTypeCache *pCache = pTable->rgMainCache;
HandleTypeCache *pCacheEnd = pCache + pTable->uTypeCount;
for (; pCache != pCacheEnd; ++pCache)
{
// get relevant indexes for the reserve bank and the free bank
LONG lFreeIndex = pCache->lFreeIndex;
LONG lReserveIndex = pCache->lReserveIndex;
// clamp the min free index and min reserve index to be non-negative;
// this is necessary since interlocked operations can set these variables
// to negative values, and once negative they stay negative until the
// cache is rebalanced
if (lFreeIndex < 0) lFreeIndex = 0;
if (lReserveIndex < 0) lReserveIndex = 0;
// compute the number of handles
UINT uHandleCount = (UINT)lReserveIndex + (HANDLES_PER_CACHE_BANK - (UINT)lFreeIndex);
// add the number of handles to the total handle count and update
// dwCount in this HandleTable
uCacheCount += uHandleCount;
}
// it is not necessary to have the lock while reading the quick cache;
// loop through the quick cache for each handle type
OBJECTHANDLE * pQuickCache = pTable->rgQuickCache;
OBJECTHANDLE * pQuickCacheEnd = pQuickCache + HANDLE_MAX_INTERNAL_TYPES;
for (; pQuickCache != pQuickCacheEnd; ++pQuickCache)
if (*pQuickCache)
++uCacheCount;
// return the number of handles marked as "used" that are not
// residing in the cache
return (uCount - uCacheCount);
}
/*
* HndCountAllHandles
*
* Counts the total number of handles that are marked as "used" that are not
* currently residing in some handle table's cache.
*
* Provided to compute the correct value for the GC Handle perfcounter.
* The 'fUseLocks' flag specifies whether to acquire each handle table's lock
* while its handles are being counted.
*
*/
UINT HndCountAllHandles(BOOL fUseLocks)
{
UINT uCount = 0;
int offset = 0;
// get number of HandleTables per HandleTableBucket
int n_slots = getNumberOfSlots();
// fetch the pointer to the head of the list
struct HandleTableMap * walk = &g_HandleTableMap;
// walk the list
while (walk)
{
int nextOffset = walk->dwMaxIndex;
int max = nextOffset - offset;
PTR_PTR_HandleTableBucket pBucket = walk->pBuckets;
PTR_PTR_HandleTableBucket pLastBucket = pBucket + max;
// loop through each slot in this node
for (; pBucket != pLastBucket; ++pBucket)
{
// if there is a HandleTableBucket in this slot
if (*pBucket)
{
// loop through the HandleTables inside this HandleTableBucket,
// and accumulate the handle count of each HandleTable
HHANDLETABLE * pTable = (*pBucket)->pTable;
HHANDLETABLE * pLastTable = pTable + n_slots;
// if the 'fUseLocks' flag is set, acquire the lock for this handle table before
// calling HndCountHandles() - this will prevent dwCount from being modified and
// it will also prevent any of the main caches from being rebalanced
if (fUseLocks)
for (; pTable != pLastTable; ++pTable)
{
CrstHolder ch(&(Table(*pTable)->Lock));
uCount += HndCountHandles(*pTable);
}
else
for (; pTable != pLastTable; ++pTable)
uCount += HndCountHandles(*pTable);
}
}
offset = nextOffset;
walk = walk->pNext;
}
//return the total number of handles in all HandleTables
return uCount;
}
#ifndef FEATURE_REDHAWK
BOOL Ref_HandleAsyncPinHandles()
{
CONTRACTL
{
NOTHROW;
GC_NOTRIGGER;
if (GetThread()) {MODE_COOPERATIVE;} else {DISABLED(MODE_COOPERATIVE);}
}
CONTRACTL_END;
HandleTableBucket *pBucket = g_HandleTableMap.pBuckets[0];
BOOL result = FALSE;
int limit = getNumberOfSlots();
for (int n = 0; n < limit; n ++ )
{
if (TableHandleAsyncPinHandles(Table(pBucket->pTable[n])))
{
result = TRUE;
}
}
return result;
}
void Ref_RelocateAsyncPinHandles(HandleTableBucket *pSource, HandleTableBucket *pTarget)
{
CONTRACTL
{
NOTHROW;
GC_TRIGGERS;
}
CONTRACTL_END;
int limit = getNumberOfSlots();
for (int n = 0; n < limit; n ++ )
{
TableRelocateAsyncPinHandles(Table(pSource->pTable[n]), Table(pTarget->pTable[n]));
}
}
#endif // !FEATURE_REDHAWK
BOOL Ref_ContainHandle(HandleTableBucket *pBucket, OBJECTHANDLE handle)
{
CONTRACTL
{
NOTHROW;
GC_NOTRIGGER;
}
CONTRACTL_END;
int limit = getNumberOfSlots();
for (int n = 0; n < limit; n ++ )
{
if (TableContainHandle(Table(pBucket->pTable[n]), handle))
return TRUE;
}
return FALSE;
}
/*--------------------------------------------------------------------------*/
/****************************************************************************
*
* DEBUG SCANNING STATISTICS
*
****************************************************************************/
#ifdef _DEBUG
void DEBUG_PostGCScanHandler(HandleTable *pTable, const UINT *types, UINT typeCount, UINT condemned, UINT maxgen, ScanCallbackInfo *info)
{
LIMITED_METHOD_CONTRACT;
// looks like the GC supports more generations than we expected
_ASSERTE(condemned < MAXSTATGEN);
// remember the highest generation we've seen
if (pTable->_DEBUG_iMaxGen < (int)condemned)
pTable->_DEBUG_iMaxGen = (int)condemned;
// update the statistics
pTable->_DEBUG_TotalBlocksScanned [condemned] += info->DEBUG_BlocksScanned;
pTable->_DEBUG_TotalBlocksScannedNonTrivially [condemned] += info->DEBUG_BlocksScannedNonTrivially;
pTable->_DEBUG_TotalHandleSlotsScanned [condemned] += info->DEBUG_HandleSlotsScanned;
pTable->_DEBUG_TotalHandlesActuallyScanned [condemned] += info->DEBUG_HandlesActuallyScanned;
// if this is an ephemeral GC then dump ephemeral stats for this scan right now
if (condemned < maxgen)
{
// dump a header for the stats with the condemned generation number
LOG((LF_GC, LL_INFO1000, "--------------------------------------------------------------\n"));
LOG((LF_GC, LL_INFO1000, "Ephemeral Handle Scan Summary:\n"));
LOG((LF_GC, LL_INFO1000, " Generation = %u\n", condemned));
// dump the handle types we were asked to scan
LOG((LF_GC, LL_INFO1000, " Handle Type(s) = %u", *types));
for (UINT u = 1; u < typeCount; u++)
LOG((LF_GC, LL_INFO1000, ",%u", types[u]));
LOG((LF_GC, LL_INFO1000, "\n"));
// dump the number of blocks and slots we scanned
ULONG32 blockHandles = info->DEBUG_BlocksScanned * HANDLE_HANDLES_PER_BLOCK;
LOG((LF_GC, LL_INFO1000, " Blocks Scanned = %u (%u slots)\n", info->DEBUG_BlocksScanned, blockHandles));
// if we scanned any blocks then summarize some stats
if (blockHandles)
{
ULONG32 nonTrivialBlockHandles = info->DEBUG_BlocksScannedNonTrivially * HANDLE_HANDLES_PER_BLOCK;
LOG((LF_GC, LL_INFO1000, " Blocks Examined = %u (%u slots)\n", info->DEBUG_BlocksScannedNonTrivially, nonTrivialBlockHandles));
LOG((LF_GC, LL_INFO1000, " Slots Scanned = %u\n", info->DEBUG_HandleSlotsScanned));
LOG((LF_GC, LL_INFO1000, " Handles Scanned = %u\n", info->DEBUG_HandlesActuallyScanned));
double scanRatio = ((double)info->DEBUG_HandlesActuallyScanned / (double)blockHandles) * 100.0;
LOG((LF_GC, LL_INFO1000, " Handle Scanning Ratio = %1.1lf%%\n", scanRatio));
}
// dump a footer for the stats
LOG((LF_GC, LL_INFO1000, "--------------------------------------------------------------\n"));
}
}
void DEBUG_LogScanningStatistics(HandleTable *pTable, DWORD level)
{
WRAPPER_NO_CONTRACT;
// have we done any GC's yet?
if (pTable->_DEBUG_iMaxGen >= 0)
{
// dump a header for the stats
LOG((LF_GC, level, "\n==============================================================\n"));
LOG((LF_GC, level, " Cumulative Handle Scan Summary:\n"));
// for each generation we've collected, dump the current stats
for (int i = 0; i <= pTable->_DEBUG_iMaxGen; i++)
{
INT64 totalBlocksScanned = pTable->_DEBUG_TotalBlocksScanned[i];
// dump the generation number and the number of blocks scanned
LOG((LF_GC, level, "--------------------------------------------------------------\n"));
LOG((LF_GC, level, " Condemned Generation = %d\n", i));
LOG((LF_GC, level, " Blocks Scanned = %I64u\n", totalBlocksScanned));
// if we scanned any blocks in this generation then dump some interesting numbers
if (totalBlocksScanned)
{
LOG((LF_GC, level, " Blocks Examined = %I64u\n", pTable->_DEBUG_TotalBlocksScannedNonTrivially[i]));
LOG((LF_GC, level, " Slots Scanned = %I64u\n", pTable->_DEBUG_TotalHandleSlotsScanned [i]));
LOG((LF_GC, level, " Handles Scanned = %I64u\n", pTable->_DEBUG_TotalHandlesActuallyScanned [i]));
double blocksScanned = (double) totalBlocksScanned;
double blocksExamined = (double) pTable->_DEBUG_TotalBlocksScannedNonTrivially[i];
double slotsScanned = (double) pTable->_DEBUG_TotalHandleSlotsScanned [i];
double handlesScanned = (double) pTable->_DEBUG_TotalHandlesActuallyScanned [i];
double totalSlots = (double) (totalBlocksScanned * HANDLE_HANDLES_PER_BLOCK);
LOG((LF_GC, level, " Block Scan Ratio = %1.1lf%%\n", (100.0 * (blocksExamined / blocksScanned)) ));
LOG((LF_GC, level, " Clump Scan Ratio = %1.1lf%%\n", (100.0 * (slotsScanned / totalSlots)) ));
LOG((LF_GC, level, " Scanned Clump Saturation = %1.1lf%%\n", (100.0 * (handlesScanned / slotsScanned)) ));
LOG((LF_GC, level, " Overall Handle Scan Ratio = %1.1lf%%\n", (100.0 * (handlesScanned / totalSlots)) ));
}
}
// dump a footer for the stats
LOG((LF_GC, level, "==============================================================\n\n"));
}
}
#endif // _DEBUG
#endif // !DACCESS_COMPILE
/*--------------------------------------------------------------------------*/
|