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
|
/*
* Copyright (c) 2008, 2021, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package jit.graph;
import jdk.test.lib.Utils;
import nsk.share.TestFailure;
import java.lang.reflect.InvocationTargetException;
import java.util.Random;
import java.util.Vector;
public class test6 {
private static final int[] MethodID = {Globals.MethodID_Array[11]};
private static Random localNumGen = new Random(Utils.SEED);
private static final int maxEntries = 25;
// flattens the binary tree into an array
private void getSortedArray(Node root, int[] dataArray, int[] index) {
if ((root != null) && (root != RBTree.treeNull)) {
getSortedArray(root.getNode(Node.Left_son), dataArray, index);
dataArray[index[0]++] = root.getKey();
getSortedArray(root.getNode(Node.Right_son), dataArray, index);
}
}
public synchronized void rbTest(Vector summation, Vector ID, Long functionDepth, Integer staticFunctionDepth)
throws InvocationTargetException {
Globals.appendSumToSummationVector(MethodID[0], summation);
if (CGT.shouldFinish()) {
return;
}
if (Globals.VERBOSE) {
System.out.println("test6.rbTest");
}
if ((functionDepth.longValue() <= 0) && (staticFunctionDepth.intValue() <= 0)) {
return;
}
MethodData methodCallStr;
Long numFcalls;
Integer staticFcalls;
if (staticFunctionDepth.intValue() > 0) {
numFcalls = functionDepth;
staticFcalls = Integer.valueOf(staticFunctionDepth.intValue() - 1);
methodCallStr = Globals.returnNextStaticMethod(MethodID[0]);
} else {
numFcalls = Long.valueOf(functionDepth.longValue() - 1);
staticFcalls = staticFunctionDepth;
methodCallStr = Globals.nextRandomMethod();
}
RBTree myTree = new RBTree();
int numElements = 1 + localNumGen.nextInt(maxEntries);
int dataArray[] = new int[numElements];
boolean insertArray[] = new boolean[numElements];
Vector temp = new Vector(numElements);
// code guarantees no duplicates
for (int i = 0; i < numElements; i++) {
int nextKey = localNumGen.nextInt(16385);
while (temp.indexOf(Integer.valueOf(nextKey)) != -1) {
nextKey = localNumGen.nextInt(16385);
}
temp.addElement(Integer.valueOf(nextKey));
dataArray[i] = nextKey;
insertArray[i] = false;
}
temp = null;
int numLoops = 10 + localNumGen.nextInt(1024);
for (int i = 0; i < numLoops; i++) {
int nextIndex = localNumGen.nextInt(numElements);
if (!insertArray[nextIndex]) {
myTree.RBInsert(dataArray[nextIndex]);
insertArray[nextIndex] = true;
} else {
myTree.RBDelete(dataArray[nextIndex]);
insertArray[nextIndex] = false;
}
}
int numValid = 0;
for (int i = 0; i < numElements; i++) {
Node searchNode = myTree.Search(dataArray[i]);
if (insertArray[i] && (searchNode == RBTree.treeNull)) {
throw new TestFailure("Valid Node Not Found in Binary Tree. Node " + dataArray[i]);
} else if ((!insertArray[i]) && (searchNode != RBTree.treeNull)) {
throw new TestFailure("Deleted Node Found in Binary Tree. Node " + dataArray[i]);
} else if (insertArray[i]) {
numValid++;
}
// so that verification is only done once
insertArray[i] = true;
}
int[] sortedArray = new int[numValid];
getSortedArray(myTree.getRoot(), sortedArray, new int[]{0});
for (int i = 1; i < numValid; i++) {
if (sortedArray[i] <= sortedArray[i - 1]) {
StringBuilder outStr = new StringBuilder("Actual ");
for (int aSortedArray : sortedArray) {
outStr.append(aSortedArray)
.append(", ");
}
System.out.println("Binary Tree Property Not Held");
System.out.println("Root " + myTree.getRoot()
.getKey());
throw new TestFailure(outStr.toString());
}
}
Globals.addFunctionIDToVector(methodCallStr.id, ID);
Globals.callMethod(methodCallStr, summation, ID, numFcalls, staticFcalls);
}
}
|
