void test_FromLFPrelNeg() {
struct timeval timevalClose = timeval_init(0,1);
int i = 0;
for (i = 0; i < COUNTOF(fdata); i++) {
l_fp a = l_fp_init(~0, fdata[i].frac);
struct timeval E = timeval_init(-1, fdata[i].usec);
struct timeval r;
r = lfp_intv_to_tval(a);
TEST_ASSERT_TRUE(AssertTimevalClose(E,r,timevalClose)); //ASSERT_PRED_FORMAT2(TimevalClose, E, r);
}
}
void
test_FromLFPrelPos(void) {
struct timeval timevalClose = timeval_init(0, 1);
int i = 0;
for (i = 0; i < COUNTOF(fdata); ++i) {
l_fp a = l_fp_init(1, fdata[i].frac);
struct timeval E = timeval_init(1, fdata[i].usec);
struct timeval r;
r = lfp_intv_to_tval(a);
TEST_ASSERT_TRUE(AssertTimevalClose(E, r, timevalClose));
}
}
// usec -> frac -> usec roundtrip, using a prime start and increment
void test_LFProundtrip() {
int32_t t = -1;
u_int32 i = 5;
for (t = -1; t < 2; ++t)
for (i = 5; i < 1000000; i+=11) {
struct timeval E = timeval_init(t, i);
l_fp a;
struct timeval r;
a = tval_intv_to_lfp(E);
r = lfp_intv_to_tval(a);
TEST_ASSERT_EQUAL_timeval(E, r);
}
}
void test_FromLFPbittest() {
struct timeval timevalClose = timeval_init(0,1);
// 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.
u_int32 tsf = 0;
for (tsf = 0; tsf < ~((u_int32)(1000)); tsf += 1000) {
struct timeval E = timeval_init(1, my_tsf_to_tick(tsf));
l_fp a = l_fp_init(1, tsf);
struct timeval r;
r = lfp_intv_to_tval(a);
// The conversion might be off by one microsecond when
// comparing to calculated value.
TEST_ASSERT_TRUE(AssertTimevalClose(E,r,timevalClose)); //ASSERT_PRED_FORMAT2(TimevalClose, E, r);
}
}
