summaryrefslogtreecommitdiff
path: root/test/test/test_cycles.c
blob: c78e6a5b126fcc526a31980954643ea2b890d871 (plain)
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
/* SPDX-License-Identifier: BSD-3-Clause
 * Copyright(c) 2010-2014 Intel Corporation
 */

#include <stdio.h>
#include <stdint.h>

#include <rte_common.h>
#include <rte_cycles.h>

#include "test.h"

#define N 10000

/*
 * Cycles test
 * ===========
 *
 * - Loop N times and check that the timer always increments and
 *   never decrements during this loop.
 *
 * - Wait one second using rte_usleep() and check that the increment
 *   of cycles is correct with regard to the frequency of the timer.
 */

static int
check_wait_one_second(void)
{
	uint64_t cycles, prev_cycles;
	uint64_t hz = rte_get_timer_hz();
	uint64_t max_inc = (hz / 100); /* 10 ms max between 2 reads */

	/* check that waiting 1 second is precise */
	prev_cycles = rte_get_timer_cycles();
	rte_delay_us(1000000);
	cycles = rte_get_timer_cycles();

	if ((uint64_t)(cycles - prev_cycles) > (hz + max_inc)) {
		printf("delay_us is not accurate: too long\n");
		return -1;
	}
	if ((uint64_t)(cycles - prev_cycles) < (hz - max_inc)) {
		printf("delay_us is not accurate: too short\n");
		return -1;
	}

	return 0;
}

static int
test_cycles(void)
{
	unsigned i;
	uint64_t start_cycles, cycles, prev_cycles;
	uint64_t hz = rte_get_timer_hz();
	uint64_t max_inc = (hz / 100); /* 10 ms max between 2 reads */

	/* check that the timer is always incrementing */
	start_cycles = rte_get_timer_cycles();
	prev_cycles = start_cycles;
	for (i=0; i<N; i++) {
		cycles = rte_get_timer_cycles();
		if ((uint64_t)(cycles - prev_cycles) > max_inc) {
			printf("increment too high or going backwards\n");
			return -1;
		}
		prev_cycles = cycles;
	}

	return check_wait_one_second();
}

REGISTER_TEST_COMMAND(cycles_autotest, test_cycles);

/*
 * One second precision test with rte_delay_us_sleep.
 */

static int
test_delay_us_sleep(void)
{
	rte_delay_us_callback_register(rte_delay_us_sleep);
	return check_wait_one_second();
}

REGISTER_TEST_COMMAND(delay_us_sleep_autotest, test_delay_us_sleep);

/*
 * rte_delay_us_callback test
 *
 * - check if callback is correctly registered/unregistered
 *
 */

static unsigned int pattern;
static void my_rte_delay_us(unsigned int us)
{
	pattern += us;
}

static int
test_user_delay_us(void)
{
	pattern = 0;

	rte_delay_us(2);
	if (pattern != 0)
		return -1;

	/* register custom delay function */
	rte_delay_us_callback_register(my_rte_delay_us);

	rte_delay_us(2);
	if (pattern != 2)
		return -1;

	rte_delay_us(3);
	if (pattern != 5)
		return -1;

	/* restore original delay function */
	rte_delay_us_callback_register(rte_delay_us_block);

	rte_delay_us(3);
	if (pattern != 5)
		return -1;

	return 0;
}

REGISTER_TEST_COMMAND(user_delay_us, test_user_delay_us);