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
|
// 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.
/**************************************************************
/* a test case based on DoubLinkStay. Instead of delete all of
/* the reference to a Cyclic Double linked list, it creats one
/* reference to the first node of the linked list and save it in
/* a local array in SetLink, then delete all old reference. To
/* check if GC collects leak when the local array out of stack.
/**************************************************************/
namespace DoubLink {
using System;
using System.Runtime.CompilerServices;
public class DLStack
{
internal DoubLink[] Mv_Doub;
internal int n_count = 0;
public static int Main(System.String [] Args)
{
int iRep = 100;
int iObj = 10;
Console.WriteLine("Test should return with ExitCode 100 ...");
switch( Args.Length )
{
case 1:
if (!Int32.TryParse( Args[0], out iRep ))
{
iRep = 100;
}
break;
case 2:
if (!Int32.TryParse( Args[0], out iRep ))
{
iRep = 100;
}
if (!Int32.TryParse( Args[1], out iObj ))
{
iObj = 10;
}
break;
default:
iRep = 100;
iObj = 10;
break;
}
DLStack Mv_Leak = new DLStack();
if(Mv_Leak.runTest(iRep, iObj ))
{
Console.WriteLine("Test Passed");
return 100;
}
Console.WriteLine("Test Failed");
return 1;
}
[MethodImpl(MethodImplOptions.NoInlining)]
public bool DrainFinalizerQueue(int iRep, int iObj)
{
int lastValue = DLinkNode.FinalCount;
while (true)
{
GC.Collect();
GC.WaitForPendingFinalizers();
GC.Collect();
if (DLinkNode.FinalCount == iRep * iObj * 10)
{
return true;
}
if (DLinkNode.FinalCount != lastValue)
{
Console.WriteLine(" Performing Collect/Wait/Collect cycle again");
lastValue = DLinkNode.FinalCount;
continue;
}
Console.WriteLine(" Finalized number stable at " + lastValue);
return false;
}
}
public bool runTest(int iRep, int iObj)
{
bool success = false;
for(int i=0; i <10; i++)
{
SetLink(iRep, iObj);
MakeLeak(iRep);
}
if (DrainFinalizerQueue(iRep, iObj))
{
success = true;
}
Console.WriteLine("{0} DLinkNodes finalized", DLinkNode.FinalCount);
return success;
}
public void SetLink(int iRep, int iObj)
{
DLinkNode[] Mv_DLink;
Mv_Doub = new DoubLink[iRep];
Mv_DLink = new DLinkNode[iRep*10];
for(int i=0; i<iRep; i++)
{
Mv_Doub[i] = new DoubLink(iObj);
Mv_DLink[n_count] = Mv_Doub[i][0];
n_count++;
}
}
public void MakeLeak(int iRep)
{
for(int i=0; i<iRep; i++)
{
Mv_Doub[i] = null;
}
}
}
}
|
