aboutsummaryrefslogtreecommitdiff
path: root/tests/libntp/timevalops.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'tests/libntp/timevalops.cpp')
-rw-r--r--tests/libntp/timevalops.cpp480
1 files changed, 480 insertions, 0 deletions
diff --git a/tests/libntp/timevalops.cpp b/tests/libntp/timevalops.cpp
new file mode 100644
index 000000000000..7232615b91bc
--- /dev/null
+++ b/tests/libntp/timevalops.cpp
@@ -0,0 +1,480 @@
+#include "libntptest.h"
+#include "timestructs.h"
+
+extern "C" {
+#include <math.h>
+#include "timevalops.h"
+}
+
+#include <string>
+#include <sstream>
+
+using namespace timeStruct;
+
+class timevalTest : public libntptest {
+protected:
+ static u_int32 my_tick_to_tsf(u_int32 ticks);
+ static u_int32 my_tsf_to_tick(u_int32 tsf);
+
+ // that's it...
+ struct lfpfracdata {
+ long usec;
+ u_int32 frac;
+ };
+ static const lfpfracdata fdata[];
+};
+
+u_int32
+timevalTest::my_tick_to_tsf(
+ u_int32 ticks
+ )
+{
+ // convert microseconds to l_fp fractional units, using double
+ // precision float calculations or, if available, 64bit integer
+ // arithmetic. This should give the precise fraction, rounded to
+ // the nearest representation.
+#ifdef HAVE_U_INT64
+ return u_int32(((u_int64(ticks) << 32) + 500000) / 1000000);
+#else
+ return u_int32(double(ticks) * 4294.967296 + 0.5);
+#endif
+ // And before you ask: if ticks >= 1000000, the result is
+ // truncated nonsense, so don't use it out-of-bounds.
+}
+
+u_int32
+timevalTest::my_tsf_to_tick(
+ u_int32 tsf
+ )
+{
+ // Inverse operation: converts fraction to microseconds.
+#ifdef HAVE_U_INT64
+ return u_int32((u_int64(tsf) * 1000000 + 0x80000000) >> 32);
+#else
+ return u_int32(double(tsf) / 4294.967296 + 0.5);
+#endif
+ // Beware: The result might be 10^6 due to rounding!
+}
+
+const timevalTest::lfpfracdata timevalTest::fdata [] = {
+ { 0, 0x00000000 }, { 7478, 0x01ea1405 },
+ { 22077, 0x05a6d699 }, { 125000, 0x20000000 },
+ { 180326, 0x2e29d841 }, { 207979, 0x353e1c9b },
+ { 250000, 0x40000000 }, { 269509, 0x44fe8ab5 },
+ { 330441, 0x5497c808 }, { 333038, 0x5541fa76 },
+ { 375000, 0x60000000 }, { 394734, 0x650d4995 },
+ { 446327, 0x72427c7c }, { 500000, 0x80000000 },
+ { 517139, 0x846338b4 }, { 571953, 0x926b8306 },
+ { 587353, 0x965cc426 }, { 625000, 0xa0000000 },
+ { 692136, 0xb12fd32c }, { 750000, 0xc0000000 },
+ { 834068, 0xd5857aff }, { 848454, 0xd9344806 },
+ { 854222, 0xdaae4b02 }, { 861465, 0xdc88f862 },
+ { 875000, 0xe0000000 }, { 910661, 0xe921144d },
+ { 922162, 0xec12cf10 }, { 942190, 0xf1335d25 }
+};
+
+
+// ---------------------------------------------------------------------
+// test support stuff - part1
+// ---------------------------------------------------------------------
+
+TEST_F(timevalTest, Helpers1) {
+ timeval_wrap x;
+
+ for (x.V.tv_sec = -2; x.V.tv_sec < 3; x.V.tv_sec++) {
+ x.V.tv_usec = -1;
+ ASSERT_FALSE(x.valid());
+ x.V.tv_usec = 0;
+ ASSERT_TRUE(x.valid());
+ x.V.tv_usec = 999999;
+ ASSERT_TRUE(x.valid());
+ x.V.tv_usec = 1000000;
+ ASSERT_FALSE(x.valid());
+ }
+}
+
+//----------------------------------------------------------------------
+// test normalisation
+//----------------------------------------------------------------------
+
+TEST_F(timevalTest, Normalise) {
+ for (long ns = -2000000000; ns <= 2000000000; ns += 10000000) {
+ timeval_wrap x(0, ns);
+
+ x = normalize_tval(x);
+ ASSERT_TRUE(x.valid());
+ }
+}
+
+//----------------------------------------------------------------------
+// test classification
+//----------------------------------------------------------------------
+
+TEST_F(timevalTest, SignNoFrac) {
+ // sign test, no fraction
+ for (int i = -4; i <= 4; ++i) {
+ timeval_wrap a(i, 0);
+ int E = (i > 0) - (i < 0);
+ int r = test_tval(a);
+
+ ASSERT_EQ(E, r);
+ }
+}
+
+TEST_F(timevalTest, SignWithFrac) {
+ // sign test, with fraction
+ for (int i = -4; i <= 4; ++i) {
+ timeval_wrap a(i, 10);
+ int E = (i >= 0) - (i < 0);
+ int r = test_tval(a);
+
+ ASSERT_EQ(E, r);
+ }
+}
+
+//----------------------------------------------------------------------
+// test compare
+//----------------------------------------------------------------------
+TEST_F(timevalTest, CmpFracEQ) {
+ // fractions are equal
+ for (int i = -4; i <= 4; ++i)
+ for (int j = -4; j <= 4; ++j) {
+ timeval_wrap a(i, 200);
+ timeval_wrap b(j, 200);
+ int E = (i > j) - (i < j);
+ int r = cmp_tval_denorm(a, b);
+
+ ASSERT_EQ(E, r);
+ }
+}
+
+TEST_F(timevalTest, CmpFracGT) {
+ // fraction a bigger fraction b
+ for (int i = -4; i <= 4; ++i)
+ for (int j = -4; j <= 4; ++j) {
+ timeval_wrap a( i , 999800);
+ timeval_wrap b( j , 200);
+ int E = (i >= j) - (i < j);
+ int r = cmp_tval_denorm(a, b);
+
+ ASSERT_EQ(E, r);
+ }
+}
+
+TEST_F(timevalTest, CmpFracLT) {
+ // fraction a less fraction b
+ for (int i = -4; i <= 4; ++i)
+ for (int j = -4; j <= 4; ++j) {
+ timeval_wrap a(i, 200);
+ timeval_wrap b(j, 999800);
+ int E = (i > j) - (i <= j);
+ int r = cmp_tval_denorm(a, b);
+
+ ASSERT_EQ(E, r);
+ }
+}
+
+//----------------------------------------------------------------------
+// Test addition (sum)
+//----------------------------------------------------------------------
+
+TEST_F(timevalTest, AddFullNorm) {
+ for (int i = -4; i <= 4; ++i)
+ for (int j = -4; j <= 4; ++j) {
+ timeval_wrap a(i, 200);
+ timeval_wrap b(j, 400);
+ timeval_wrap E(i + j, 200 + 400);
+ timeval_wrap c;
+
+ c = add_tval(a, b);
+ ASSERT_EQ(E, c);
+ }
+}
+
+TEST_F(timevalTest, AddFullOflow1) {
+ for (int i = -4; i <= 4; ++i)
+ for (int j = -4; j <= 4; ++j) {
+ timeval_wrap a(i, 200);
+ timeval_wrap b(j, 999900);
+ timeval_wrap E(i + j + 1, 100);
+ timeval_wrap c;
+
+ c = add_tval(a, b);
+ ASSERT_EQ(E, c);
+ }
+}
+
+TEST_F(timevalTest, AddUsecNorm) {
+ for (int i = -4; i <= 4; ++i) {
+ timeval_wrap a(i, 200);
+ timeval_wrap E(i, 600);
+ timeval_wrap c;
+
+ c = add_tval_us(a, 600 - 200);
+ ASSERT_EQ(E, c);
+ }
+}
+
+TEST_F(timevalTest, AddUsecOflow1) {
+ for (int i = -4; i <= 4; ++i) {
+ timeval_wrap a(i, 200);
+ timeval_wrap E(i + 1, 100);
+ timeval_wrap c;
+
+ c = add_tval_us(a, MICROSECONDS - 100);
+ ASSERT_EQ(E, c);
+ }
+}
+
+//----------------------------------------------------------------------
+// test subtraction (difference)
+//----------------------------------------------------------------------
+
+TEST_F(timevalTest, SubFullNorm) {
+ for (int i = -4; i <= 4; ++i)
+ for (int j = -4; j <= 4; ++j) {
+ timeval_wrap a(i, 600);
+ timeval_wrap b(j, 400);
+ timeval_wrap E(i - j, 600 - 400);
+ timeval_wrap c;
+
+ c = sub_tval(a, b);
+ ASSERT_EQ(E, c);
+ }
+}
+
+TEST_F(timevalTest, SubFullOflow) {
+ for (int i = -4; i <= 4; ++i)
+ for (int j = -4; j <= 4; ++j) {
+ timeval_wrap a(i, 100);
+ timeval_wrap b(j, 999900);
+ timeval_wrap E(i - j - 1, 200);
+ timeval_wrap c;
+
+ c = sub_tval(a, b);
+ ASSERT_EQ(E, c);
+ }
+}
+
+TEST_F(timevalTest, SubUsecNorm) {
+ for (int i = -4; i <= 4; ++i) {
+ timeval_wrap a(i, 600);
+ timeval_wrap E(i, 200);
+ timeval_wrap c;
+
+ c = sub_tval_us(a, 600 - 200);
+ ASSERT_EQ(E, c);
+ }
+}
+
+TEST_F(timevalTest, SubUsecOflow) {
+ for (int i = -4; i <= 4; ++i) {
+ timeval_wrap a(i, 100);
+ timeval_wrap E(i - 1, 200);
+ timeval_wrap c;
+
+ c = sub_tval_us(a, MICROSECONDS - 100);
+ ASSERT_EQ(E, c);
+ }
+}
+
+//----------------------------------------------------------------------
+// test negation
+//----------------------------------------------------------------------
+
+TEST_F(timevalTest, Neg) {
+ for (int i = -4; i <= 4; ++i) {
+ timeval_wrap a(i, 100);
+ timeval_wrap b;
+ timeval_wrap c;
+
+ b = neg_tval(a);
+ c = add_tval(a, b);
+ ASSERT_EQ(0, test_tval(c));
+ }
+}
+
+//----------------------------------------------------------------------
+// test abs value
+//----------------------------------------------------------------------
+
+TEST_F(timevalTest, AbsNoFrac) {
+ for (int i = -4; i <= 4; ++i) {
+ timeval_wrap a(i, 0);
+ timeval_wrap b;
+
+ b = abs_tval(a);
+ ASSERT_EQ((i != 0), test_tval(b));
+ }
+}
+
+TEST_F(timevalTest, AbsWithFrac) {
+ for (int i = -4; i <= 4; ++i) {
+ timeval_wrap a(i, 100);
+ timeval_wrap b;
+
+ b = abs_tval(a);
+ ASSERT_EQ(1, test_tval(b));
+ }
+}
+
+// ---------------------------------------------------------------------
+// test support stuff -- part 2
+// ---------------------------------------------------------------------
+
+TEST_F(timevalTest, Helpers2) {
+ AssertTimevalClose isClose(0, 2);
+ timeval_wrap x, y;
+
+ for (x.V.tv_sec = -2; x.V.tv_sec < 3; x.V.tv_sec++)
+ for (x.V.tv_usec = 1;
+ x.V.tv_usec < 1000000;
+ x.V.tv_usec += 499999) {
+ for (long i = -4; i < 5; i++) {
+ y = x;
+ y.V.tv_usec += i;
+ if (i >= -2 && i <= 2)
+ ASSERT_PRED_FORMAT2(isClose, x, y);
+ else
+ ASSERT_PRED_FORMAT2(!isClose, x, y);
+ }
+ }
+}
+
+// and the global predicate instances we're using here
+static AssertFpClose FpClose(0, 1);
+static AssertTimevalClose TimevalClose(0, 1);
+
+//----------------------------------------------------------------------
+// conversion to l_fp
+//----------------------------------------------------------------------
+
+TEST_F(timevalTest, ToLFPbittest) {
+ for (u_int32 i = 0; i < 1000000; i++) {
+ timeval_wrap a(1, i);
+ l_fp_wrap E(1, my_tick_to_tsf(i));
+ l_fp_wrap r;
+
+ r = tval_intv_to_lfp(a);
+ ASSERT_PRED_FORMAT2(FpClose, E, r);
+ }
+}
+
+TEST_F(timevalTest, ToLFPrelPos) {
+ for (int i = 0; i < COUNTOF(fdata); i++) {
+ timeval_wrap a(1, fdata[i].usec);
+ l_fp_wrap E(1, fdata[i].frac);
+ l_fp_wrap r;
+
+ r = tval_intv_to_lfp(a);
+ ASSERT_PRED_FORMAT2(FpClose, E, r);
+ }
+}
+
+TEST_F(timevalTest, ToLFPrelNeg) {
+ for (int i = 0; i < COUNTOF(fdata); i++) {
+ timeval_wrap a(-1, fdata[i].usec);
+ l_fp_wrap E(~0, fdata[i].frac);
+ l_fp_wrap r;
+
+ r = tval_intv_to_lfp(a);
+ ASSERT_PRED_FORMAT2(FpClose, E, r);
+ }
+}
+
+TEST_F(timevalTest, ToLFPabs) {
+ for (int i = 0; i < COUNTOF(fdata); i++) {
+ timeval_wrap a(1, fdata[i].usec);
+ l_fp_wrap E(1 + JAN_1970, fdata[i].frac);
+ l_fp_wrap r;
+
+ r = tval_stamp_to_lfp(a);
+ ASSERT_PRED_FORMAT2(FpClose, E, r);
+ }
+}
+
+//----------------------------------------------------------------------
+// conversion from l_fp
+//----------------------------------------------------------------------
+
+TEST_F(timevalTest, FromLFPbittest) {
+ // Not *exactly* a bittest, because 2**32 tests would take a
+ // really long time even on very fast machines! So we do test
+ // every 1000 fractional units.
+ for (u_int32 tsf = 0; tsf < ~u_int32(1000); tsf += 1000) {
+ timeval_wrap E(1, my_tsf_to_tick(tsf));
+ l_fp_wrap a(1, tsf);
+ timeval_wrap r;
+
+ r = lfp_intv_to_tval(a);
+ // The conversion might be off by one microsecond when
+ // comparing to calculated value.
+ ASSERT_PRED_FORMAT2(TimevalClose, E, r);
+ }
+}
+
+TEST_F(timevalTest, FromLFPrelPos) {
+ for (int i = 0; i < COUNTOF(fdata); i++) {
+ l_fp_wrap a(1, fdata[i].frac);
+ timeval_wrap E(1, fdata[i].usec);
+ timeval_wrap r;
+
+ r = lfp_intv_to_tval(a);
+ ASSERT_PRED_FORMAT2(TimevalClose, E, r);
+ }
+}
+
+TEST_F(timevalTest, FromLFPrelNeg) {
+ for (int i = 0; i < COUNTOF(fdata); i++) {
+ l_fp_wrap a(~0, fdata[i].frac);
+ timeval_wrap E(-1, fdata[i].usec);
+ timeval_wrap r;
+
+ r = lfp_intv_to_tval(a);
+ ASSERT_PRED_FORMAT2(TimevalClose, E, r);
+ }
+}
+
+// usec -> frac -> usec roundtrip, using a prime start and increment
+TEST_F(timevalTest, LFProundtrip) {
+ for (int32_t t = -1; t < 2; ++t)
+ for (u_int32 i = 5; i < 1000000; i+=11) {
+ timeval_wrap E(t, i);
+ l_fp_wrap a;
+ timeval_wrap r;
+
+ a = tval_intv_to_lfp(E);
+ r = lfp_intv_to_tval(a);
+ ASSERT_EQ(E, r);
+ }
+}
+
+//----------------------------------------------------------------------
+// string formatting
+//----------------------------------------------------------------------
+
+TEST_F(timevalTest, ToString) {
+ static const struct {
+ time_t sec;
+ long usec;
+ const char * repr;
+ } data [] = {
+ { 0, 0, "0.000000" },
+ { 2, 0, "2.000000" },
+ {-2, 0, "-2.000000" },
+ { 0, 1, "0.000001" },
+ { 0,-1, "-0.000001" },
+ { 1,-1, "0.999999" },
+ {-1, 1, "-0.999999" },
+ {-1,-1, "-1.000001" },
+ };
+ for (int i = 0; i < COUNTOF(data); ++i) {
+ timeval_wrap a(data[i].sec, data[i].usec);
+ std::string E(data[i].repr);
+ std::string r(tvaltoa(a));
+
+ ASSERT_EQ(E, r);
+ }
+}
+
+// -*- EOF -*-
generated by cgit v1.2.3 (git 2.25.1) at 2024-09-23 18:59:28 +0000