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
|
/* SPDX-License-Identifier: MIT */
/*
* Description: exercise full filling of SQ and CQ ring
*
*/
#include <errno.h>
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <fcntl.h>
#include "liburing.h"
#define MAX_ENTRIES 32768
static int fill_nops(struct io_uring *ring)
{
struct io_uring_sqe *sqe;
int filled = 0;
do {
sqe = io_uring_get_sqe(ring);
if (!sqe)
break;
io_uring_prep_nop(sqe);
filled++;
} while (1);
return filled;
}
static int test_nops(struct io_uring *ring)
{
struct io_uring_cqe *cqe;
int ret, nr, total = 0, i;
nr = fill_nops(ring);
if (nr < 0) {
fprintf(stderr, "Fill: %d\n", nr);
goto err;
}
ret = io_uring_submit(ring);
if (ret != nr) {
fprintf(stderr, "submit %d, wanted %d\n", ret, nr);
goto err;
}
total += ret;
nr = fill_nops(ring);
if (nr < 0) {
fprintf(stderr, "Fill: %d\n", nr);
goto err;
}
ret = io_uring_submit(ring);
if (ret != nr) {
fprintf(stderr, "submit %d, wanted %d\n", ret, nr);
goto err;
}
total += ret;
for (i = 0; i < total; i++) {
ret = io_uring_wait_cqe(ring, &cqe);
if (ret < 0) {
fprintf(stderr, "wait completion %d\n", ret);
goto err;
}
io_uring_cqe_seen(ring, cqe);
}
return 0;
err:
return 1;
}
int main(int argc, char *argv[])
{
struct io_uring ring;
int ret, depth;
if (argc > 1)
return 0;
depth = 1;
while (depth <= MAX_ENTRIES) {
ret = io_uring_queue_init(depth, &ring, 0);
if (ret) {
if (ret == -ENOMEM)
break;
fprintf(stderr, "ring setup failed: %d\n", ret);
return 1;
}
ret = test_nops(&ring);
if (ret) {
fprintf(stderr, "test_single_nop failed\n");
return ret;
}
depth <<= 1;
io_uring_queue_exit(&ring);
}
return 0;
}
|
