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
|
/* Copyright (c) 2015, Linaro Limited
* All rights reserved.
*
* SPDX-License-Identifier: BSD-3-Clause
*/
#include <odp.h>
#include "odp_cunit_common.h"
#include "time.h"
#define TOLERANCE 1
#define BUSY_LOOP_CNT 100
/* check that a cycles difference gives a reasonable result */
void time_test_odp_cycles_diff(void)
{
/* volatile to stop optimization of busy loop */
volatile int count = 0;
uint64_t diff, cycles1, cycles2;
cycles1 = odp_time_cycles();
while (count < BUSY_LOOP_CNT) {
count++;
};
cycles2 = odp_time_cycles();
CU_ASSERT(cycles2 > cycles1);
diff = odp_time_diff_cycles(cycles1, cycles2);
CU_ASSERT(diff > 0);
}
/* check that a negative cycles difference gives a reasonable result */
void time_test_odp_cycles_negative_diff(void)
{
uint64_t diff, cycles1, cycles2;
cycles1 = 10;
cycles2 = 5;
diff = odp_time_diff_cycles(cycles1, cycles2);
CU_ASSERT(diff > 0);
}
/* check that related conversions come back to the same value */
void time_test_odp_time_conversion(void)
{
uint64_t ns1, ns2, cycles;
uint64_t upper_limit, lower_limit;
ns1 = 100;
cycles = odp_time_ns_to_cycles(ns1);
CU_ASSERT(cycles > 0);
ns2 = odp_time_cycles_to_ns(cycles);
/* need to check within arithmetic tolerance that the same
* value in ns is returned after conversions */
upper_limit = ns1 + TOLERANCE;
lower_limit = ns1 - TOLERANCE;
CU_ASSERT((ns2 <= upper_limit) && (ns2 >= lower_limit));
}
odp_testinfo_t time_suite_time[] = {
ODP_TEST_INFO(time_test_odp_cycles_diff),
ODP_TEST_INFO(time_test_odp_cycles_negative_diff),
ODP_TEST_INFO(time_test_odp_time_conversion),
ODP_TEST_INFO_NULL
};
odp_suiteinfo_t time_suites[] = {
{"Time", NULL, NULL, time_suite_time},
ODP_SUITE_INFO_NULL
};
int time_main(void)
{
return odp_cunit_run(time_suites);
}
|
