-
Notifications
You must be signed in to change notification settings - Fork 0
/
ioqueue.c
314 lines (287 loc) · 9.53 KB
/
ioqueue.c
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
// ioqueue.c - Linux Kernel AIO implementation of the ioqueue API
//
// Copyright (C) 2015 Jeremy R. Fishman
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation, either version 3 of the
// License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// and Lesser General Public License along with this program. If not,
// see <http://www.gnu.org/licenses/>.
#include <errno.h>
#include <limits.h>
#include <sys/time.h>
#include <sys/types.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <linux/aio_abi.h>
#include <sys/eventfd.h>
#include "ioqueue.h"
/** KAIO l-value helpers **/
/* the request file operation */
#define IOCB_OP(iocbp) (*(unsigned short*)&((iocbp)->aio_lio_opcode))
/* the request file descriptor */
#define IOCB_FD(iocbp) (*(int*)&((iocbp)->aio_fildes))
/* the request buffer */
#define IOCB_BUF(iocbp) (*(void**)&((iocbp)->aio_buf))
/* the request length */
#define IOCB_LEN(iocbp) (*(size_t*)&((iocbp)->aio_nbytes))
/* the request file offset */
#define IOCB_OFF(iocbp) (*(off_t*)&((iocbp)->aio_offset))
/* the request closure data */
#define IOCB_DATA(iocbp) (*(void**)&((iocbp)->aio_data))
/* the request flags */
#define IOCB_FLAGS(iocbp) (*(unsigned int*)&((iocbp)->aio_flags))
/* the request eventfd */
#define IOCB_RESFD(iocbp) (*(int*)&((iocbp)->aio_resfd))
/* the event closure data */
#define IOEV_DATA(ioev) (*(void**)&(ioev)->data)
/* KAIO syscalls - wrappers provided by libaio */
extern int io_setup(unsigned depth, aio_context_t *ctxp);
extern int io_destroy(aio_context_t ctx);
extern int io_submit(aio_context_t ctx, long nr, struct iocb *ios[]);
extern int io_cancel(aio_context_t ctx, struct iocb *iocbp, struct io_event *evp);
extern int io_getevents(aio_context_t ctx, long min_nr, long nr, struct io_event *events, struct timespec *timeout);
/**
* ioqueue request closure
* Contains reference to the callback, the callback closure, and the
* KAIO struct iocb that is passed to the kernel. The struct iocb in
* turn contains a pointer back to the struct ioqueue_request.
*/
struct ioqueue_request {
ioqueue_cb cb;
void *cb_data;
struct iocb iocb; /* IO_DATA(&request.iocb) == (void*)&request */
};
/** global variables **/
/* KAIO request buffer, when not in-flight, as passed to io_submit()
* - the array head is a queue of requests yet to be submitted
* - the array tail is a stack of completed and unused requests
*/
static struct iocb **_io_reqs;
/* KAIO event buffer for completed I/O events, as received from io_getevents() */
static struct io_event *_io_evs;
/* KAIO context - opaque integer handle */
static aio_context_t _ctx = 0;
static unsigned int _depth; /* maximum outstanding requests */
static unsigned int _nreqs; /* allocated request objects */
static unsigned int _nfree; /* free request stack size */
static unsigned int _nwait; /* waiting request stack size */
static int _eventfd; /* eventfd(2) for poll/epoll */
/* initiliaze the io queue to the given maximum outstanding requests */
int ioqueue_init(unsigned int depth)
{
int ret;
if (_ctx != 0 || depth == 0 || depth > INT_MAX) {
errno = EINVAL;
return -1;
}
_io_reqs = malloc((size_t)depth * sizeof(struct iocb *));
if (_io_reqs == NULL) {
return -1;
}
_io_evs = malloc((size_t)depth * sizeof(struct io_event));
if (_io_evs == NULL) {
free(_io_reqs);
return -1;
}
ret = io_setup(depth, &_ctx);
if (ret < 0) {
free(_io_reqs);
free(_io_evs);
errno = -ret;
return -1;
}
_depth = (unsigned int)depth;
_nreqs = 0;
_nfree = 0;
_nwait = 0;
_eventfd = eventfd(0, EFD_CLOEXEC | EFD_NONBLOCK);
return 0;
}
/* retrieve a file descrptor suitable for io readiness notifications via e.g. poll/epoll */
int ioqueue_eventfd()
{
return _eventfd;
}
/* allocate (or retrieve) a request object */
static struct ioqueue_request * ioqueue_request_alloc()
{
struct ioqueue_request *req;
if (_nfree > 0) {
/* pop a request from the tail free-stack */
req = IOCB_DATA(_io_reqs[_depth - (_nfree--)]);
} else if (_nreqs < _depth) {
/* allocate a new request */
req = malloc(sizeof(struct ioqueue_request));
if (req == NULL) return NULL;
_nreqs++;
} else {
/* queue overflow */
errno = EAGAIN;
return NULL;
}
/* clear request and set self pointer */
memset(req, 0, sizeof(struct ioqueue_request));
IOCB_DATA(&req->iocb) = req;
/* push onto the head wait-queue */
_io_reqs[_nwait++] = &req->iocb;
return req;
}
/* free a request */
static void ioqueue_request_free(struct ioqueue_request *req)
{
/* push onto the tail free-stack */
_io_reqs[_depth - (++_nfree)] = &req->iocb;
}
static void
ioqueue_request_finish(struct ioqueue_request *const req, ssize_t res, int err)
{
if (res < 0) {
/* set errno for callback */
errno = err;
}
/* run callback */
switch (IOCB_OP(&req->iocb)) {
case IOCB_CMD_PREAD:
case IOCB_CMD_PWRITE:
(* (ioqueue_cb) req->cb)(req->cb_data, res, IOCB_BUF(&req->iocb));
break;
default:
/* unreachable */
abort();
}
/* push free'd request onto tail-stack */
ioqueue_request_free(req);
}
/* enqueue a pread request */
int ioqueue_pread(int fd, void *buf, size_t len, off_t offset, ioqueue_cb cb, void *cb_data)
{
if (buf == NULL || len == 0 || len > SSIZE_MAX || cb == NULL) {
errno = EINVAL;
return -1;
}
struct ioqueue_request *const req = ioqueue_request_alloc();
if (req == NULL) return -1;
req->cb = (ioqueue_cb) cb;
req->cb_data = cb_data;
IOCB_OP(&req->iocb) = IOCB_CMD_PREAD;
IOCB_FD(&req->iocb) = fd;
IOCB_BUF(&req->iocb) = buf;
IOCB_LEN(&req->iocb) = len;
IOCB_OFF(&req->iocb) = offset;
if (_eventfd != -1) {
IOCB_FLAGS(&req->iocb) |= IOCB_FLAG_RESFD;
IOCB_RESFD(&req->iocb) = _eventfd;
}
return 0;
}
/* enqueue a pwrite request */
int ioqueue_pwrite(int fd, void *buf, size_t len, off_t offset, ioqueue_cb cb, void *cb_data)
{
if (buf == NULL || len == 0 || len > SSIZE_MAX || cb == NULL) {
errno = EINVAL;
return -1;
}
struct ioqueue_request *const req = ioqueue_request_alloc();
if (req == NULL) return -1;
req->cb = (ioqueue_cb) cb;
req->cb_data = cb_data;
IOCB_OP(&req->iocb) = IOCB_CMD_PWRITE;
IOCB_FD(&req->iocb) = fd;
IOCB_BUF(&req->iocb) = buf;
IOCB_LEN(&req->iocb) = len;
IOCB_OFF(&req->iocb) = offset;
if (_eventfd != -1) {
IOCB_FLAGS(&req->iocb) |= IOCB_FLAG_RESFD;
IOCB_RESFD(&req->iocb) = _eventfd;
}
return 0;
}
/* submit as many requests as possible from the front of the queue */
static int ioqueue_submit(unsigned int *nerr)
{
unsigned int i, n;
int ret;
for (i = 0, n = 0; i < _nwait;) {
ret = io_submit(_ctx, _nwait - i, _io_reqs + i);
if (ret < 0) {
if (-ret == EBADF) {
/* head of the queue is bad, finish the request and continue */
ioqueue_request_finish(IOCB_DATA(_io_reqs[i]), -1, EBADF);
i ++;
} else {
/* ensure wait-queue occupies the head of the array */
memmove(_io_reqs, _io_reqs + i, (size_t)(_nwait - i));
_nwait -= i;
errno = -ret;
return -1;
}
} else {
/* count the submitted requests (excludes EBADF above) */
n += (unsigned int)ret;
i += (unsigned int)ret;
}
}
_nwait -= i;
if (nerr) {
*nerr = (i - n);
}
return (int)n; // n <= _nwait <= INT_MAX
}
/* fetch and process any completed requests */
int ioqueue_reap(unsigned int min)
{
int ret, i;
unsigned int nerr;
/* cannot wait for more requests than have been allocated */
if (_nfree == _nreqs || min > _nreqs || (unsigned int)min > _nreqs - _nfree) {
errno = EINVAL;
return -1;
}
/* ensure the requests have been submitted */
ret = ioqueue_submit(&nerr);
if (ret == -1) return ret;
/* re-adjust minimum to account for EBADF-finished requests */
if (nerr > 0) {
min -= nerr;
}
/* block for at least 'min' completion events */
do {
ret = io_getevents(_ctx, min, _depth, _io_evs, NULL);
} while (ret < 0 && errno == EINTR);
if (ret < 0) {
return ret;
}
/* finish the reaped requests */
for (i = 0; i < ret; i++) {
ioqueue_request_finish(IOEV_DATA(&_io_evs[i]), _io_evs[i].res, (int)_io_evs[i].res2);
}
/* return the number of completed requests */
return ret + (int)nerr;
}
void ioqueue_destroy()
{
while (_nfree != _nreqs) {
/* assume latency matters -- block for requests one at a time */
ioqueue_reap(1);
}
free(_io_evs);
while (_nfree > 0) {
free(IOCB_DATA(_io_reqs[_depth - _nfree]));
_io_reqs[_depth - _nfree] = 0;
_nfree--;
_nreqs--;
}
free(_io_reqs);
io_destroy(_ctx);
_ctx = 0;
}