Context Navigation

io.cfa @ 2d8f7b0

ADTarm-ehast-experimentalenumforall-pointer-decayjacob/cs343-translationnew-astnew-ast-unique-exprpthread-emulationqualifiedEnum

Last change on this file since 2d8f7b0 was 2d8f7b0, checked in by Thierry Delisle <tdelisle@…>, 4 years ago
Implemented basic non-blocking io
Property mode set to `100644`
File size: 21.7 KB

Line
1	#include "kernel.hfa"
2
3	#if !defined(HAVE_LINUX_IO_URING_H)
4	void __kernel_io_startup( cluster & this ) {
5	// Nothing to do without io_uring
6	}
7
8	void __kernel_io_shutdown( cluster & this ) {
9	// Nothing to do without io_uring
10	}
11
12	bool is_async( void (*)() ) {
13	return false;
14	}
15
16	#else
17	extern "C" {
18	#define _GNU_SOURCE /* See feature_test_macros(7) */
19	#include <errno.h>
20	#include <stdint.h>
21	#include <string.h>
22	#include <unistd.h>
23	#include <sys/mman.h>
24	#include <sys/syscall.h>
25
26	#include <linux/io_uring.h>
27	}
28
29	#include "bits/signal.hfa"
30	#include "kernel_private.hfa"
31	#include "thread.hfa"
32
33	uint32_t entries_per_cluster() {
34	return 256;
35	}
36
37	static void * __io_poller( void * arg );
38
39	//=============================================================================================
40	// I/O Startup / Shutdown logic
41	//=============================================================================================
42	void __kernel_io_startup( cluster & this ) {
43	// Step 1 : call to setup
44	struct io_uring_params params;
45	memset(&params, 0, sizeof(params));
46
47	uint32_t nentries = entries_per_cluster();
48
49	int fd = syscall(__NR_io_uring_setup, nentries, &params );
50	if(fd < 0) {
51	abort("KERNEL ERROR: IO_URING SETUP - %s\n", strerror(errno));
52	}
53
54	// Step 2 : mmap result
55	memset(&this.io, 0, sizeof(struct io_ring));
56	struct io_uring_sq & sq = this.io.submit_q;
57	struct io_uring_cq & cq = this.io.completion_q;
58
59	// calculate the right ring size
60	sq.ring_sz = params.sq_off.array + (params.sq_entries * sizeof(unsigned) );
61	cq.ring_sz = params.cq_off.cqes + (params.cq_entries * sizeof(struct io_uring_cqe));
62
63	// Requires features
64	// // adjust the size according to the parameters
65	// if ((params.features & IORING_FEAT_SINGLE_MMAP) != 0) {
66	// cq->ring_sz = sq->ring_sz = max(cq->ring_sz, sq->ring_sz);
67	// }
68
69	// mmap the Submit Queue into existence
70	sq.ring_ptr = mmap(0, sq.ring_sz, PROT_READ \| PROT_WRITE, MAP_SHARED \| MAP_POPULATE, fd, IORING_OFF_SQ_RING);
71	if (sq.ring_ptr == (void*)MAP_FAILED) {
72	abort("KERNEL ERROR: IO_URING MMAP1 - %s\n", strerror(errno));
73	}
74
75	// mmap the Completion Queue into existence (may or may not be needed)
76	// Requires features
77	// if ((params.features & IORING_FEAT_SINGLE_MMAP) != 0) {
78	// cq->ring_ptr = sq->ring_ptr;
79	// }
80	// else {
81	// We need multiple call to MMAP
82	cq.ring_ptr = mmap(0, cq.ring_sz, PROT_READ \| PROT_WRITE, MAP_SHARED \| MAP_POPULATE, fd, IORING_OFF_CQ_RING);
83	if (cq.ring_ptr == (void*)MAP_FAILED) {
84	munmap(sq.ring_ptr, sq.ring_sz);
85	abort("KERNEL ERROR: IO_URING MMAP2 - %s\n", strerror(errno));
86	}
87	// }
88
89	// mmap the submit queue entries
90	size_t size = params.sq_entries * sizeof(struct io_uring_sqe);
91	sq.sqes = (struct io_uring_sqe *)mmap(0, size, PROT_READ \| PROT_WRITE, MAP_SHARED \| MAP_POPULATE, fd, IORING_OFF_SQES);
92	if (sq.sqes == (struct io_uring_sqe *)MAP_FAILED) {
93	munmap(sq.ring_ptr, sq.ring_sz);
94	if (cq.ring_ptr != sq.ring_ptr) munmap(cq.ring_ptr, cq.ring_sz);
95	abort("KERNEL ERROR: IO_URING MMAP3 - %s\n", strerror(errno));
96	}
97
98	// Get the pointers from the kernel to fill the structure
99	// submit queue
100	sq.head = (volatile uint32_t *)(((intptr_t)sq.ring_ptr) + params.sq_off.head);
101	sq.tail = (volatile uint32_t *)(((intptr_t)sq.ring_ptr) + params.sq_off.tail);
102	sq.mask = ( const uint32_t *)(((intptr_t)sq.ring_ptr) + params.sq_off.ring_mask);
103	sq.num = ( const uint32_t *)(((intptr_t)sq.ring_ptr) + params.sq_off.ring_entries);
104	sq.flags = ( uint32_t *)(((intptr_t)sq.ring_ptr) + params.sq_off.flags);
105	sq.dropped = ( uint32_t *)(((intptr_t)sq.ring_ptr) + params.sq_off.dropped);
106	sq.array = ( uint32_t *)(((intptr_t)sq.ring_ptr) + params.sq_off.array);
107	sq.alloc = *sq.tail;
108
109	// completion queue
110	cq.head = (volatile uint32_t *)(((intptr_t)cq.ring_ptr) + params.cq_off.head);
111	cq.tail = (volatile uint32_t *)(((intptr_t)cq.ring_ptr) + params.cq_off.tail);
112	cq.mask = ( const uint32_t *)(((intptr_t)cq.ring_ptr) + params.cq_off.ring_mask);
113	cq.num = ( const uint32_t *)(((intptr_t)cq.ring_ptr) + params.cq_off.ring_entries);
114	cq.overflow = ( uint32_t *)(((intptr_t)cq.ring_ptr) + params.cq_off.overflow);
115	cq.cqes = (struct io_uring_cqe *)(((intptr_t)cq.ring_ptr) + params.cq_off.cqes);
116
117	// some paranoid checks
118	/* paranoid / verifyf( (cq.mask) == ((cq.num) - 1ul32), "IO_URING Expected mask to be %u (%u entries), was %u", (cq.num) - 1ul32, cq.num, cq.mask );
119	/* paranoid / verifyf( (cq.num) >= nentries, "IO_URING Expected %u entries, got %u", nentries, *cq.num );
120	/* paranoid / verifyf( (cq.head) == 0, "IO_URING Expected head to be 0, got %u", *cq.head );
121	/* paranoid / verifyf( (cq.tail) == 0, "IO_URING Expected tail to be 0, got %u", *cq.tail );
122
123	/* paranoid / verifyf( (sq.mask) == ((sq.num) - 1ul32), "IO_URING Expected mask to be %u (%u entries), was %u", (sq.num) - 1ul32, sq.num, sq.mask );
124	/* paranoid / verifyf( (sq.num) >= nentries, "IO_URING Expected %u entries, got %u", nentries, *sq.num );
125	/* paranoid / verifyf( (sq.head) == 0, "IO_URING Expected head to be 0, got %u", *sq.head );
126	/* paranoid / verifyf( (sq.tail) == 0, "IO_URING Expected tail to be 0, got %u", *sq.tail );
127
128	// Update the global ring info
129	this.io.flags = params.flags;
130	this.io.fd = fd;
131	this.io.done = false;
132	(this.io.submit){ min(sq.num, cq.num) };
133
134	// Create the poller thread
135	this.io.stack = __create_pthread( &this.io.poller, __io_poller, &this );
136	}
137
138	void __kernel_io_shutdown( cluster & this ) {
139	// Stop the IO Poller
140	// Notify the poller thread of the shutdown
141	__atomic_store_n(&this.io.done, true, __ATOMIC_SEQ_CST);
142	sigval val = { 1 };
143	pthread_sigqueue( this.io.poller, SIGUSR1, val );
144
145	// Wait for the poller thread to finish
146	pthread_join( this.io.poller, 0p );
147	free( this.io.stack );
148
149	// Shutdown the io rings
150	struct io_uring_sq & sq = this.io.submit_q;
151	struct io_uring_cq & cq = this.io.completion_q;
152
153	// unmap the submit queue entries
154	munmap(sq.sqes, (sq.num) sizeof(struct io_uring_sqe));
155
156	// unmap the Submit Queue ring
157	munmap(sq.ring_ptr, sq.ring_sz);
158
159	// unmap the Completion Queue ring, if it is different
160	if (cq.ring_ptr != sq.ring_ptr) {
161	munmap(cq.ring_ptr, cq.ring_sz);
162	}
163
164	// close the file descriptor
165	close(this.io.fd);
166	}
167
168	//=============================================================================================
169	// I/O Polling
170	//=============================================================================================
171	struct io_user_data {
172	int32_t result;
173	$thread * thrd;
174	};
175
176	// Process a single completion message from the io_uring
177	// This is NOT thread-safe
178	static bool __io_process(struct io_ring & ring) {
179	unsigned head = *ring.completion_q.head;
180	unsigned tail = __atomic_load_n(ring.completion_q.tail, __ATOMIC_ACQUIRE);
181
182	if (head == tail) return false;
183
184	unsigned idx = head & (*ring.completion_q.mask);
185	struct io_uring_cqe & cqe = ring.completion_q.cqes[idx];
186
187	/* paranoid */ verify(&cqe);
188
189	struct io_user_data * data = (struct io_user_data *)cqe.user_data;
190	__cfaabi_bits_print_safe( STDERR_FILENO, "Performed reading io cqe %p, result %d for %p\n", data, cqe.res, data->thrd );
191
192	data->result = cqe.res;
193	__unpark( data->thrd __cfaabi_dbg_ctx2 );
194
195	// Allow new submissions to happen
196	V(ring.submit);
197
198	// Mark to the kernel that the cqe has been seen
199	// Ensure that the kernel only sees the new value of the head index after the CQEs have been read.
200	__atomic_fetch_add( ring.completion_q.head, 1, __ATOMIC_RELAXED );
201
202	return true;
203	}
204
205	static void * __io_poller( void * arg ) {
206	cluster * cltr = (cluster *)arg;
207	struct io_ring & ring = cltr->io;
208
209	sigset_t mask;
210	sigfillset(&mask);
211	if ( pthread_sigmask( SIG_BLOCK, &mask, 0p ) == -1 ) {
212	abort( "KERNEL ERROR: IO_URING - pthread_sigmask" );
213	}
214
215	sigdelset( &mask, SIGUSR1 );
216
217	verify( (ring.submit_q.head) == (ring.submit_q.tail) );
218	verify( (ring.completion_q.head) == (ring.completion_q.tail) );
219
220	LOOP: while(!__atomic_load_n(&ring.done, __ATOMIC_SEQ_CST)) {
221	int ret = syscall( __NR_io_uring_enter, ring.fd, 0, 1, IORING_ENTER_GETEVENTS, &mask, _NSIG / 8);
222	__cfaabi_bits_print_safe( STDERR_FILENO, "Performed io_wait, returned %d errmsg %s\n", ret, strerror(errno) );
223	if( ret < 0 ) {
224	switch((int)errno) {
225	case EAGAIN:
226	case EINTR:
227	continue LOOP;
228	default:
229	abort( "KERNEL ERROR: IO_URING WAIT - %s\n", strerror(errno) );
230	}
231	}
232
233	// Drain the queue
234	while(__io_process(ring)) {}
235	}
236
237	return 0p;
238	}
239
240	//=============================================================================================
241	// I/O Submissions
242	//=============================================================================================
243
244	// Submition steps :
245	// 1 - We need to make sure we don't overflow any of the buffer, P(ring.submit) to make sure
246	// entries are available. The semaphore make sure that there is no more operations in
247	// progress then the number of entries in the buffer. This probably limits concurrency
248	// more than necessary since submitted but not completed operations don't need any
249	// entries in user space. However, I don't know what happens if we overflow the buffers
250	// because too many requests completed at once. This is a safe approach in all cases.
251	// Furthermore, with hundreds of entries, this may be okay.
252	//
253	// 2 - Allocate a queue entry. The ring already has memory for all entries but only the ones
254	// listed in sq.array are visible by the kernel. For those not listed, the kernel does not
255	// offer any assurance that an entry is not being filled by multiple flags. Therefore, we
256	// need to write an allocator that allows allocating concurrently.
257	//
258	// 3 - Actually fill the submit entry, this is the only simple and straightforward step.
259	//
260	// 4 - Append the entry index to the array and adjust the tail accordingly. This operation
261	// needs to arrive to two concensus at the same time:
262	// A - The order in which entries are listed in the array: no two threads must pick the
263	// same index for their entries
264	// B - When can the tail be update for the kernel. EVERY entries in the array between
265	// head and tail must be fully filled and shouldn't ever be touched again.
266	//
267
268	static inline [* struct io_uring_sqe, uint32_t] __submit_alloc( struct io_ring & ring ) {
269	// Wait for a spot to be available
270	P(ring.submit);
271
272	// Allocate the sqe
273	uint32_t idx = __atomic_fetch_add(&ring.submit_q.alloc, 1ul32, __ATOMIC_SEQ_CST);
274
275	// Validate that we didn't overflow anything
276	// Check that nothing overflowed
277	/* paranoid */ verify( true );
278
279	// Check that it goes head -> tail -> alloc and never head -> alloc -> tail
280	/* paranoid */ verify( true );
281
282	// Return the sqe
283	return [&ring.submit_q.sqes[ idx & (*ring.submit_q.mask)], idx];
284	}
285
286	static inline void __submit( struct io_ring & ring, uint32_t idx ) {
287	// get mutual exclusion
288	lock(ring.submit_q.lock __cfaabi_dbg_ctx2);
289
290	// Append to the list of ready entries
291	uint32_t * tail = ring.submit_q.tail;
292	const uint32_t mask = *ring.submit_q.mask;
293
294	ring.submit_q.array[ (*tail) & mask ] = idx & mask;
295	__atomic_fetch_add(tail, 1ul32, __ATOMIC_SEQ_CST);
296
297	// Submit however, many entries need to be submitted
298	int ret = syscall( __NR_io_uring_enter, ring.fd, 1, 0, 0, 0p, 0);
299	__cfaabi_bits_print_safe( STDERR_FILENO, "Performed io_submit, returned %d\n", ret );
300	if( ret < 0 ) {
301	switch((int)errno) {
302	default:
303	abort( "KERNEL ERROR: IO_URING SUBMIT - %s\n", strerror(errno) );
304	}
305	}
306
307	unlock(ring.submit_q.lock);
308	// Make sure that idx was submitted
309	// Be careful to not get false positive if we cycled the entire list or that someone else submitted for us
310	}
311
312	static inline void ?{}(struct io_uring_sqe & this, uint8_t opcode, int fd) {
313	this.opcode = opcode;
314	#if !defined(IOSQE_ASYNC)
315	this.flags = 0;
316	#else
317	this.flags = IOSQE_ASYNC;
318	#endif
319	this.ioprio = 0;
320	this.fd = fd;
321	this.off = 0;
322	this.addr = 0;
323	this.len = 0;
324	this.rw_flags = 0;
325	this.__pad2[0] = this.__pad2[1] = this.__pad2[2] = 0;
326	}
327
328	static inline void ?{}(struct io_uring_sqe & this, uint8_t opcode, int fd, void * addr, uint32_t len, uint64_t off ) {
329	(this){ opcode, fd };
330	this.off = off;
331	this.addr = (uint64_t)addr;
332	this.len = len;
333	}
334
335	//=============================================================================================
336	// I/O Interface
337	//=============================================================================================
338	extern "C" {
339	#define __USE_GNU
340	#define _GNU_SOURCE
341	#include <fcntl.h>
342	#include <sys/uio.h>
343	#include <sys/socket.h>
344	#include <sys/stat.h>
345	}
346
347	#define __submit_prelude \
348	struct io_ring & ring = active_cluster()->io; \
349	struct io_uring_sqe * sqe; \
350	uint32_t idx; \
351	[sqe, idx] = __submit_alloc( ring );
352
353	#define __submit_wait \
354	io_user_data data = { 0, active_thread() }; \
355	__cfaabi_bits_print_safe( STDERR_FILENO, "Preparing user data %p for %p\n", &data, data.thrd ); \
356	sqe->user_data = (uint64_t)&data; \
357	__submit( ring, idx ); \
358	park( __cfaabi_dbg_ctx ); \
359	return data.result;
360
361	//-----------------------------------------------------------------------------
362	// Asynchronous operations
363	ssize_t async_preadv2(int fd, const struct iovec *iov, int iovcnt, off_t offset, int flags) {
364	#if !defined(IORING_OP_READV)
365	return preadv2(fd, iov, iovcnt, offset, flags);
366	#else
367	__submit_prelude
368
369	(*sqe){ IORING_OP_READV, fd, iov, iovcnt, offset };
370
371	__submit_wait
372	#endif
373	}
374
375	ssize_t async_pwritev2(int fd, const struct iovec *iov, int iovcnt, off_t offset, int flags) {
376	#if !defined(IORING_OP_WRITEV)
377	return pwritev2(fd, iov, iovcnt, offset, flags);
378	#else
379	__submit_prelude
380
381	(*sqe){ IORING_OP_WRITEV, fd, iov, iovcnt, offset };
382
383	__submit_wait
384	#endif
385	}
386
387	int async_fsync(int fd) {
388	#if !defined(IORING_OP_FSYNC)
389	return fsync(fd);
390	#else
391	__submit_prelude
392
393	(*sqe){ IORING_OP_FSYNC, fd };
394
395	__submit_wait
396	#endif
397	}
398
399	int async_sync_file_range(int fd, int64_t offset, int64_t nbytes, unsigned int flags) {
400	#if !defined(IORING_OP_SYNC_FILE_RANGE)
401	return sync_file_range(fd, offset, nbytes, flags);
402	#else
403	__submit_prelude
404
405	(*sqe){ IORING_OP_SYNC_FILE_RANGE, fd };
406	sqe->off = offset;
407	sqe->len = nbytes;
408	sqe->sync_range_flags = flags;
409
410	__submit_wait
411	#endif
412	}
413
414
415	ssize_t async_sendmsg(int sockfd, const struct msghdr *msg, int flags) {
416	#if !defined(IORING_OP_SENDMSG)
417	return recv(sockfd, msg, flags);
418	#else
419	__submit_prelude
420
421	(*sqe){ IORING_OP_SENDMSG, sockfd, msg, 1, 0 };
422	sqe->msg_flags = flags;
423
424	__submit_wait
425	#endif
426	}
427
428	ssize_t async_recvmsg(int sockfd, struct msghdr *msg, int flags) {
429	#if !defined(IORING_OP_RECVMSG)
430	return recv(sockfd, msg, flags);
431	#else
432	__submit_prelude
433
434	(*sqe){ IORING_OP_RECVMSG, sockfd, msg, 1, 0 };
435	sqe->msg_flags = flags;
436
437	__submit_wait
438	#endif
439	}
440
441	ssize_t async_send(int sockfd, const void *buf, size_t len, int flags) {
442	#if !defined(IORING_OP_SEND)
443	return send( sockfd, buf, len, flags );
444	#else
445	__submit_prelude
446
447	(*sqe){ IORING_OP_SEND, sockfd };
448	sqe->addr = (uint64_t)buf;
449	sqe->len = len;
450	sqe->msg_flags = flags;
451
452	__submit_wait
453	#endif
454	}
455
456	ssize_t async_recv(int sockfd, void *buf, size_t len, int flags) {
457	#if !defined(IORING_OP_RECV)
458	return recv( sockfd, buf, len, flags );
459	#else
460	__submit_prelude
461
462	(*sqe){ IORING_OP_RECV, sockfd };
463	sqe->addr = (uint64_t)buf;
464	sqe->len = len;
465	sqe->msg_flags = flags;
466
467	__submit_wait
468	#endif
469	}
470
471	int async_accept4(int sockfd, struct sockaddr addr, socklen_t addrlen, int flags) {
472	#if !defined(IORING_OP_ACCEPT)
473	__SOCKADDR_ARG _addr;
474	_addr.__sockaddr__ = addr;
475	return accept4( sockfd, _addr, addrlen, flags );
476	#else
477	__submit_prelude
478
479	(*sqe){ IORING_OP_ACCEPT, sockfd };
480	sqe->addr = addr;
481	sqe->addr2 = addrlen;
482	sqe->accept_flags = flags;
483
484	__submit_wait
485	#endif
486	}
487
488	int async_connect(int sockfd, const struct sockaddr *addr, socklen_t addrlen) {
489	#if !defined(IORING_OP_CONNECT)
490	__CONST_SOCKADDR_ARG _addr;
491	_addr.__sockaddr__ = addr;
492	return connect( sockfd, _addr, addrlen );
493	#else
494	__submit_prelude
495
496	(*sqe){ IORING_OP_CONNECT, sockfd };
497	sqe->addr = (uint64_t)addr;
498	sqe->off = addrlen;
499
500	__submit_wait
501	#endif
502	}
503
504	int async_fallocate(int fd, int mode, uint64_t offset, uint64_t len) {
505	#if !defined(IORING_OP_FALLOCATE)
506	return fallocate( fd, mode, offset, len );
507	#else
508	__submit_prelude
509
510	(*sqe){ IORING_OP_FALLOCATE, fd };
511	sqe->off = offset;
512	sqe->len = length;
513	sqe->mode = mode;
514
515	__submit_wait
516	#endif
517	}
518
519	int async_fadvise(int fd, uint64_t offset, uint64_t len, int advice) {
520	#if !defined(IORING_OP_FADVISE)
521	return posix_fadvise( fd, offset, len, advice );
522	#else
523	__submit_prelude
524
525	(*sqe){ IORING_OP_FADVISE, fd };
526	sqe->off = (uint64_t)offset;
527	sqe->len = length;
528	sqe->fadvise_advice = advice;
529
530	__submit_wait
531	#endif
532	}
533
534	int async_madvise(void *addr, size_t length, int advice) {
535	#if !defined(IORING_OP_MADVISE)
536	return madvise( addr, length, advice );
537	#else
538	__submit_prelude
539
540	(*sqe){ IORING_OP_MADVISE, 0 };
541	sqe->addr = (uint64_t)addr;
542	sqe->len = length;
543	sqe->fadvise_advice = advice;
544
545	__submit_wait
546	#endif
547	}
548
549	int async_openat(int dirfd, const char *pathname, int flags, mode_t mode) {
550	#if !defined(IORING_OP_OPENAT)
551	return openat( dirfd, pathname, flags, mode );
552	#else
553	__submit_prelude
554
555	(*sqe){ IORING_OP_OPENAT, dirfd };
556	sqe->addr = (uint64_t)pathname;
557	sqe->open_flags = flags;
558	sqe->mode = mode;
559
560	__submit_wait
561	#endif
562	}
563
564	int async_close(int fd) {
565	#if !defined(IORING_OP_CLOSE)
566	return close( fd );
567	#else
568	__submit_prelude
569
570	(*sqe){ IORING_OP_CLOSE, fd };
571
572	__submit_wait
573	#endif
574	}
575
576	int async_statx(int dirfd, const char pathname, int flags, unsigned int mask, struct statx statxbuf) {
577	#if !defined(IORING_OP_STATX)
578	return statx( dirfd, pathname, flags, mask, statxbuf );
579	#else
580	__submit_prelude
581
582	(*sqe){ IORING_OP_STATX, dirfd };
583	sqe->addr = (uint64_t)pathname;
584	sqe->statx_flags = flags;
585	sqe->len = mask;
586	sqe->off = (uint64_t)statxbuf;
587
588	__submit_wait
589	#endif
590	}
591
592
593	ssize_t async_read(int fd, void *buf, size_t count) {
594	#if !defined(IORING_OP_READ)
595	return read( fd, buf, count );
596	#else
597	__submit_prelude
598
599	(*sqe){ IORING_OP_READ, fd, buf, count, 0 };
600
601	__submit_wait
602	#endif
603	}
604
605	ssize_t async_write(int fd, void *buf, size_t count) {
606	#if !defined(IORING_OP_WRITE)
607	return read( fd, buf, count );
608	#else
609	__submit_prelude
610
611	(*sqe){ IORING_OP_WRITE, fd, buf, count, 0 };
612
613	__submit_wait
614	#endif
615	}
616
617	//-----------------------------------------------------------------------------
618	// Check if a function is asynchronous
619
620	// Macro magic to reduce the size of the following switch case
621	#define IS_DEFINED_APPLY(f, ...) f(__VA_ARGS__)
622	#define IS_DEFINED_SECOND(first, second, ...) second
623	#define IS_DEFINED_TEST(expansion) _CFA_IO_FEATURE_##expansion
624	#define IS_DEFINED(macro) IS_DEFINED_APPLY( IS_DEFINED_SECOND,IS_DEFINED_TEST(macro) false, true)
625
626	bool is_async( fptr_t func ) {
627
628	if( /func == (fptr_t)preadv2 \|\| /
629	func == (fptr_t)async_preadv2 )
630	#define _CFA_IO_FEATURE_IORING_OP_READV ,
631	return IS_DEFINED(IORING_OP_READV);
632
633	if( /func == (fptr_t)pwritev2 \|\| /
634	func == (fptr_t)async_pwritev2 )
635	#define _CFA_IO_FEATURE_IORING_OP_WRITEV ,
636	return IS_DEFINED(IORING_OP_WRITEV);
637
638	if( /func == (fptr_t)fsync \|\| /
639	func == (fptr_t)async_fsync )
640	#define _CFA_IO_FEATURE_IORING_OP_FSYNC ,
641	return IS_DEFINED(IORING_OP_FSYNC);
642
643	if( /func == (fptr_t)ync_file_range \|\| /
644	func == (fptr_t)async_sync_file_range )
645	#define _CFA_IO_FEATURE_IORING_OP_SYNC_FILE_RANGE ,
646	return IS_DEFINED(IORING_OP_SYNC_FILE_RANGE);
647
648	if( /func == (fptr_t)sendmsg \|\| /
649	func == (fptr_t)async_sendmsg )
650	#define _CFA_IO_FEATURE_IORING_OP_SENDMSG ,
651	return IS_DEFINED(IORING_OP_SENDMSG);
652
653	if( /func == (fptr_t)recvmsg \|\| /
654	func == (fptr_t)async_recvmsg )
655	#define _CFA_IO_FEATURE_IORING_OP_RECVMSG ,
656	return IS_DEFINED(IORING_OP_RECVMSG);
657
658	if( /func == (fptr_t)send \|\| /
659	func == (fptr_t)async_send )
660	#define _CFA_IO_FEATURE_IORING_OP_SEND ,
661	return IS_DEFINED(IORING_OP_SEND);
662
663	if( /func == (fptr_t)recv \|\| /
664	func == (fptr_t)async_recv )
665	#define _CFA_IO_FEATURE_IORING_OP_RECV ,
666	return IS_DEFINED(IORING_OP_RECV);
667
668	if( /func == (fptr_t)accept4 \|\| /
669	func == (fptr_t)async_accept4 )
670	#define _CFA_IO_FEATURE_IORING_OP_ACCEPT ,
671	return IS_DEFINED(IORING_OP_ACCEPT);
672
673	if( /func == (fptr_t)connect \|\| /
674	func == (fptr_t)async_connect )
675	#define _CFA_IO_FEATURE_IORING_OP_CONNECT ,
676	return IS_DEFINED(IORING_OP_CONNECT);
677
678	if( /func == (fptr_t)fallocate \|\| /
679	func == (fptr_t)async_fallocate )
680	#define _CFA_IO_FEATURE_IORING_OP_FALLOCATE ,
681	return IS_DEFINED(IORING_OP_FALLOCATE);
682
683	if( /func == (fptr_t)fadvise \|\| /
684	func == (fptr_t)async_fadvise )
685	#define _CFA_IO_FEATURE_IORING_OP_FADVISE ,
686	return IS_DEFINED(IORING_OP_FADVISE);
687
688	if( /func == (fptr_t)madvise \|\| /
689	func == (fptr_t)async_madvise )
690	#define _CFA_IO_FEATURE_IORING_OP_MADVISE ,
691	return IS_DEFINED(IORING_OP_MADVISE);
692
693	if( /func == (fptr_t)openat \|\| /
694	func == (fptr_t)async_openat )
695	#define _CFA_IO_FEATURE_IORING_OP_OPENAT ,
696	return IS_DEFINED(IORING_OP_OPENAT);
697
698	if( /func == (fptr_t)close \|\| /
699	func == (fptr_t)async_close )
700	#define _CFA_IO_FEATURE_IORING_OP_CLOSE ,
701	return IS_DEFINED(IORING_OP_CLOSE);
702
703	if( /func == (fptr_t)statx \|\| /
704	func == (fptr_t)async_statx )
705	#define _CFA_IO_FEATURE_IORING_OP_STATX ,
706	return IS_DEFINED(IORING_OP_STATX);
707
708	if( /func == (fptr_t)read \|\| /
709	func == (fptr_t)async_read )
710	#define _CFA_IO_FEATURE_IORING_OP_READ ,
711	return IS_DEFINED(IORING_OP_READ);
712
713	if( /func == (fptr_t)write \|\| /
714	func == (fptr_t)async_write )
715	#define _CFA_IO_FEATURE_IORING_OP_WRITE ,
716	return IS_DEFINED(IORING_OP_WRITE);
717
718	return false;
719	}
720
721	#endif

Note: See TracBrowser for help on using the repository browser.

Download in other formats:

Original Format