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
|
// 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 basic test case for GC with cyclic Double linked list leaks.
/* Creat a DoubLink object which is a cyclic Double linked list
/* object with iObj number node. then deletes its reference when
/* the next object is created. Do this loop iRep times.
/**************************************************************/
namespace DoubLink {
using System;
public class DoubLinkGen
{
// disabling unused variable warning
#pragma warning disable 0414
internal DoubLink Mv_Doub;
#pragma warning restore 0414
public static int Main(System.String [] Args)
{
int iRep = 0;
int iObj = 0;
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;
}
DoubLinkGen Mv_Leak = new DoubLinkGen();
if(Mv_Leak.runTest(iRep, iObj ))
{
Console.WriteLine("Test Passed");
return 100;
}
Console.WriteLine("Test Failed");
return 1;
}
public bool runTest(int iRep, int iObj)
{
SetLink(iRep, iObj);
Mv_Doub = null;
GC.Collect();
GC.WaitForPendingFinalizers();
GC.Collect();
if (DLinkNode.FinalCount != iRep * iObj)
{
// see github#4093 for the rationale for fail-fast in this test.
Environment.FailFast(string.Empty);
}
Console.Write(DLinkNode.FinalCount);
Console.WriteLine(" DLinkNodes finalized");
return (DLinkNode.FinalCount==iRep*iObj);
}
public void SetLink(int iRep, int iObj)
{
for(int i=0; i<iRep; i++)
{
Mv_Doub = new DoubLink(iObj);
}
}
}
public class DoubLink
{
internal DLinkNode[] Mv_DLink;
public DoubLink(int Num)
: this(Num, false)
{
}
public DoubLink(int Num, bool large)
{
Mv_DLink = new DLinkNode[Num];
if (Num == 0)
{
return;
}
if (Num == 1)
{
// only one element
Mv_DLink[0] = new DLinkNode((large ? 250 : 1), Mv_DLink[0], Mv_DLink[0]);
return;
}
// first element
Mv_DLink[0] = new DLinkNode((large ? 250 : 1), Mv_DLink[Num - 1], Mv_DLink[1]);
// all elements in between
for (int i = 1; i < Num - 1; i++)
{
Mv_DLink[i] = new DLinkNode((large ? 250 : i + 1), Mv_DLink[i - 1], Mv_DLink[i + 1]);
}
// last element
Mv_DLink[Num - 1] = new DLinkNode((large ? 250 : Num), Mv_DLink[Num - 2], Mv_DLink[0]);
}
public int NodeNum
{
get
{
return Mv_DLink.Length;
}
}
public DLinkNode this[int index]
{
get
{
return Mv_DLink[index];
}
set
{
Mv_DLink[index] = value;
}
}
}
public class DLinkNode
{
// disabling unused variable warning
#pragma warning disable 0414
internal DLinkNode Last;
internal DLinkNode Next;
internal int[] Size;
#pragma warning restore 0414
public static int FinalCount = 0;
public DLinkNode(int SizeNum, DLinkNode LastObject, DLinkNode NextObject)
{
Last = LastObject;
Next = NextObject;
Size = new int[SizeNum * 1024];
}
~DLinkNode()
{
FinalCount++;
}
}
}
|
