jdk-24/test/hotspot/gtest/gc/shenandoah/test_shenandoahNumberSeq.cpp
Magnus Ihse Bursie 2979806c72 8345795: Update copyright year to 2024 for hotspot in files where it was missed
Reviewed-by: dholmes, tschatzl, dnsimon, sspitsyn
2024-12-10 08:47:46 +00:00

164 lines
4.4 KiB
C++

/*
* Copyright (c) 2022, 2024, Oracle and/or its affiliates. All rights reserved.
* Copyright Amazon.com Inc. 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.
*/
#include "precompiled.hpp"
#include "gc/shenandoah/shenandoahNumberSeq.hpp"
#include "utilities/ostream.hpp"
#include "utilities/vmassert_uninstall.hpp"
#include <iostream>
#include "utilities/vmassert_reinstall.hpp"
#include "unittest.hpp"
class ShenandoahNumberSeqTest: public ::testing::Test {
protected:
const double err = 0.5;
HdrSeq seq1;
HdrSeq seq2;
HdrSeq seq3;
void print() {
if (seq1.num() > 0) {
print(seq1, "seq1");
}
if (seq2.num() > 0) {
print(seq2, "seq2");
}
if (seq3.num() > 0) {
print(seq3, "seq3");
}
}
void print(HdrSeq& seq, const char* msg) {
std::cout << "[";
for (int i = 0; i <= 100; i += 10) {
std::cout << "\t p" << i << ":" << seq.percentile(i);
}
std::cout << "\t] : " << msg << "\n";
}
};
class BasicShenandoahNumberSeqTest: public ShenandoahNumberSeqTest {
public:
BasicShenandoahNumberSeqTest() {
seq1.add(0);
seq1.add(1);
seq1.add(10);
for (int i = 0; i < 7; i++) {
seq1.add(100);
}
ShenandoahNumberSeqTest::print();
}
};
class ShenandoahNumberSeqMergeTest: public ShenandoahNumberSeqTest {
public:
ShenandoahNumberSeqMergeTest() {
for (int i = 0; i < 80; i++) {
seq1.add(1);
seq3.add(1);
}
for (int i = 0; i < 20; i++) {
seq2.add(100);
seq3.add(100);
}
ShenandoahNumberSeqTest::print();
}
};
TEST_VM_F(BasicShenandoahNumberSeqTest, maximum_test) {
EXPECT_EQ(seq1.maximum(), 100);
}
TEST_VM_F(BasicShenandoahNumberSeqTest, minimum_test) {
EXPECT_EQ(0, seq1.percentile(0));
}
TEST_VM_F(BasicShenandoahNumberSeqTest, percentile_test) {
EXPECT_NEAR(0, seq1.percentile(10), err);
EXPECT_NEAR(1, seq1.percentile(20), err);
EXPECT_NEAR(10, seq1.percentile(30), err);
EXPECT_NEAR(100, seq1.percentile(40), err);
EXPECT_NEAR(100, seq1.percentile(50), err);
EXPECT_NEAR(100, seq1.percentile(75), err);
EXPECT_NEAR(100, seq1.percentile(90), err);
EXPECT_NEAR(100, seq1.percentile(100), err);
}
TEST_VM_F(BasicShenandoahNumberSeqTest, clear_test) {
HdrSeq test;
test.add(1);
EXPECT_NE(test.num(), 0);
EXPECT_NE(test.sum(), 0);
EXPECT_NE(test.maximum(), 0);
EXPECT_NE(test.avg(), 0);
EXPECT_EQ(test.sd(), 0);
EXPECT_NE(test.davg(), 0);
EXPECT_EQ(test.dvariance(), 0);
for (int i = 0; i <= 100; i += 10) {
EXPECT_NE(test.percentile(i), 0);
}
test.clear();
EXPECT_EQ(test.num(), 0);
EXPECT_EQ(test.sum(), 0);
EXPECT_EQ(test.maximum(), 0);
EXPECT_EQ(test.avg(), 0);
EXPECT_EQ(test.sd(), 0);
EXPECT_EQ(test.davg(), 0);
EXPECT_EQ(test.dvariance(), 0);
for (int i = 0; i <= 100; i += 10) {
EXPECT_EQ(test.percentile(i), 0);
}
}
TEST_VM_F(ShenandoahNumberSeqMergeTest, merge_test) {
EXPECT_EQ(seq1.num(), 80);
EXPECT_EQ(seq2.num(), 20);
EXPECT_EQ(seq3.num(), 100);
HdrSeq merged;
merged.add(seq1);
merged.add(seq2);
EXPECT_EQ(merged.num(), seq3.num());
EXPECT_EQ(merged.maximum(), seq3.maximum());
EXPECT_EQ(merged.percentile(0), seq3.percentile(0));
for (int i = 0; i <= 100; i += 10) {
EXPECT_NEAR(merged.percentile(i), seq3.percentile(i), err);
}
EXPECT_NEAR(merged.avg(), seq3.avg(), err);
EXPECT_NEAR(merged.sd(), seq3.sd(), err);
// These are not implemented
EXPECT_TRUE(isnan(merged.davg()));
EXPECT_TRUE(isnan(merged.dvariance()));
}