[ViewVC] Diff of: cvs/libeio/eio.c

Comparing libeio/eio.c (file contents):
Revision 1.18 by root, Mon Jun 16 12:19:55 2008 UTC vs.
Revision 1.54 by root, Tue Feb 23 14:32:45 2010 UTC

…		…
1	/*	1	/*
2	* libeio implementation	2	* libeio implementation
3	*	3	*
4	* Copyright (c) 2007,2008 Marc Alexander Lehmann <libeio@schmorp.de>	4	* Copyright (c) 2007,2008,2009,2010 Marc Alexander Lehmann <libeio@schmorp.de>
5	* All rights reserved.	5	* All rights reserved.
6	*	6	*
7	* Redistribution and use in source and binary forms, with or without modifica-	7	* Redistribution and use in source and binary forms, with or without modifica-
8	* tion, are permitted provided that the following conditions are met:	8	* tion, are permitted provided that the following conditions are met:
9	*	9	*
36	* provisions above, a recipient may use your version of this file under	36	* provisions above, a recipient may use your version of this file under
37	* either the BSD or the GPL.	37	* either the BSD or the GPL.
38	*/	38	*/
39		39
40	#include "eio.h"	40	#include "eio.h"
		41
		42	#ifdef EIO_STACKSIZE
		43	# define XTHREAD_STACKSIZE EIO_STACKSIZE
		44	#endif
41	#include "xthread.h"	45	#include "xthread.h"
42		46
43	#include <errno.h>	47	#include <errno.h>
44	#include <stddef.h>	48	#include <stddef.h>
45	#include <stdlib.h>	49	#include <stdlib.h>
46	#include <string.h>	50	#include <string.h>
47	#include <errno.h>	51	#include <errno.h>
48	#include <sys/types.h>	52	#include <sys/types.h>
49	#include <sys/stat.h>	53	#include <sys/stat.h>
		54	#include <sys/statvfs.h>
50	#include <limits.h>	55	#include <limits.h>
51	#include <fcntl.h>	56	#include <fcntl.h>
52	#include <assert.h>	57	#include <assert.h>
53		58
54	#ifndef EIO_FINISH	59	#ifndef EIO_FINISH
…		…
64	#endif	69	#endif
65		70
66	#ifdef _WIN32	71	#ifdef _WIN32
67		72
68	/doh/	73	/doh/
69
70	#else	74	#else
71		75
72	# include "config.h"	76	# include "config.h"
73	# include <sys/time.h>	77	# include <sys/time.h>
74	# include <sys/select.h>	78	# include <sys/select.h>
		79	# include <sys/mman.h>
75	# include <unistd.h>	80	# include <unistd.h>
76	# include <utime.h>	81	# include <utime.h>
77	# include <signal.h>	82	# include <signal.h>
78	# include <dirent.h>	83	# include <dirent.h>
79		84
		85	/* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */
		86	# if __FreeBSD__ \|\| defined __NetBSD__ \|\| defined __OpenBSD__
		87	# define _DIRENT_HAVE_D_TYPE /* sigh */
		88	# define D_INO(de) (de)->d_fileno
		89	# define D_NAMLEN(de) (de)->d_namlen
		90	# elif __linux \|\| defined d_ino \|\| _XOPEN_SOURCE >= 600
		91	# define D_INO(de) (de)->d_ino
		92	# endif
		93
		94	#ifdef _D_EXACT_NAMLEN
		95	# undef D_NAMLEN
		96	# define D_NAMLEN(de) _D_EXACT_NAMLEN (de)
		97	#endif
		98
		99	# ifdef _DIRENT_HAVE_D_TYPE
		100	# define D_TYPE(de) (de)->d_type
		101	# endif
		102
80	# ifndef EIO_STRUCT_DIRENT	103	# ifndef EIO_STRUCT_DIRENT
81	# define EIO_STRUCT_DIRENT struct dirent	104	# define EIO_STRUCT_DIRENT struct dirent
82	# endif	105	# endif
83		106
84	#endif	107	#endif
85		108
86	#if HAVE_SENDFILE	109	#if HAVE_SENDFILE
87	# if __linux	110	# if __linux
88	# include <sys/sendfile.h>	111	# include <sys/sendfile.h>
89	# elif __freebsd	112	# elif __FreeBSD__ \|\| defined __APPLE__
90	# include <sys/socket.h>	113	# include <sys/socket.h>
91	# include <sys/uio.h>	114	# include <sys/uio.h>
92	# elif __hpux	115	# elif __hpux
93	# include <sys/socket.h>	116	# include <sys/socket.h>
94	# elif __solaris /* not yet */	117	# elif __solaris
95	# include <sys/sendfile.h>	118	# include <sys/sendfile.h>
96	# else	119	# else
97	# error sendfile support requested but not available	120	# error sendfile support requested but not available
98	# endif	121	# endif
99	#endif	122	#endif
100		123
		124	#ifndef D_TYPE
		125	# define D_TYPE(de) 0
		126	#endif
		127	#ifndef D_INO
		128	# define D_INO(de) 0
		129	#endif
		130	#ifndef D_NAMLEN
		131	# define D_NAMLEN(de) strlen ((de)->d_name)
		132	#endif
		133
101	/* number of seconds after which an idle threads exit */	134	/* number of seconds after which an idle threads exit */
102	#define IDLE_TIMEOUT 10	135	#define IDLE_TIMEOUT 10
103		136
104	/* used for struct dirent, AIX doesn't provide it */	137	/* used for struct dirent, AIX doesn't provide it */
105	#ifndef NAME_MAX	138	#ifndef NAME_MAX
106	# define NAME_MAX 4096	139	# define NAME_MAX 4096
		140	#endif
		141
		142	/* used for readlink etc. */
		143	#ifndef PATH_MAX
		144	# define PATH_MAX 4096
107	#endif	145	#endif
108		146
109	/* buffer size for various temporary buffers */	147	/* buffer size for various temporary buffers */
110	#define EIO_BUFSIZE 65536	148	#define EIO_BUFSIZE 65536
111		149
…		…
117	errno = ENOMEM; \	155	errno = ENOMEM; \
118	if (!eio_buf) \	156	if (!eio_buf) \
119	return -1;	157	return -1;
120		158
121	#define EIO_TICKS ((1000000 + 1023) >> 10)	159	#define EIO_TICKS ((1000000 + 1023) >> 10)
		160
		161	/*****************************************************************************/
		162
		163	#if __GNUC__ >= 3
		164	# define expect(expr,value) __builtin_expect ((expr),(value))
		165	#else
		166	# define expect(expr,value) (expr)
		167	#endif
		168
		169	#define expect_false(expr) expect ((expr) != 0, 0)
		170	#define expect_true(expr) expect ((expr) != 0, 1)
122		171
123	/*****************************************************************************/	172	/*****************************************************************************/
124		173
125	#define ETP_PRI_MIN EIO_PRI_MIN	174	#define ETP_PRI_MIN EIO_PRI_MIN
126	#define ETP_PRI_MAX EIO_PRI_MAX	175	#define ETP_PRI_MAX EIO_PRI_MAX
…		…
144	if (wrk->dirp) \	193	if (wrk->dirp) \
145	{ \	194	{ \
146	closedir (wrk->dirp); \	195	closedir (wrk->dirp); \
147	wrk->dirp = 0; \	196	wrk->dirp = 0; \
148	}	197	}
		198
149	#define ETP_WORKER_COMMON \	199	#define ETP_WORKER_COMMON \
150	void *dbuf; \	200	void *dbuf; \
151	DIR *dirp;	201	DIR *dirp;
152		202
153	/*****************************************************************************/	203	/*****************************************************************************/
154		204
155	#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)	205	#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
156		206
157	/* calculcate time difference in ~1/EIO_TICKS of a second */	207	/* calculate time difference in ~1/EIO_TICKS of a second */
158	static int tvdiff (struct timeval tv1, struct timeval tv2)	208	static int tvdiff (struct timeval tv1, struct timeval tv2)
159	{	209	{
160	return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS	210	return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
161	+ ((tv2->tv_usec - tv1->tv_usec) >> 10);	211	+ ((tv2->tv_usec - tv1->tv_usec) >> 10);
162	}	212	}
…		…
176		226
177	static mutex_t wrklock = X_MUTEX_INIT;	227	static mutex_t wrklock = X_MUTEX_INIT;
178	static mutex_t reslock = X_MUTEX_INIT;	228	static mutex_t reslock = X_MUTEX_INIT;
179	static mutex_t reqlock = X_MUTEX_INIT;	229	static mutex_t reqlock = X_MUTEX_INIT;
180	static cond_t reqwait = X_COND_INIT;	230	static cond_t reqwait = X_COND_INIT;
		231
		232	#if !HAVE_PREADWRITE
		233	/*
		234	* make our pread/pwrite emulation safe against themselves, but not against
		235	* normal read/write by using a mutex. slows down execution a lot,
		236	* but that's your problem, not mine.
		237	*/
		238	static mutex_t preadwritelock = X_MUTEX_INIT;
		239	#endif
181		240
182	typedef struct etp_worker	241	typedef struct etp_worker
183	{	242	{
184	/* locked by wrklock */	243	/* locked by wrklock */
185	struct etp_worker prev, next;	244	struct etp_worker prev, next;
…		…
330		389
331	static void etp_atfork_child (void)	390	static void etp_atfork_child (void)
332	{	391	{
333	ETP_REQ *prv;	392	ETP_REQ *prv;
334		393
335	while (prv = reqq_shift (&req_queue))	394	while ((prv = reqq_shift (&req_queue)))
336	ETP_DESTROY (prv);	395	ETP_DESTROY (prv);
337		396
338	while (prv = reqq_shift (&res_queue))	397	while ((prv = reqq_shift (&res_queue)))
339	ETP_DESTROY (prv);	398	ETP_DESTROY (prv);
340		399
341	while (wrk_first.next != &wrk_first)	400	while (wrk_first.next != &wrk_first)
342	{	401	{
343	etp_worker *wrk = wrk_first.next;	402	etp_worker *wrk = wrk_first.next;
…		…
371		430
372	pthread_once (&doinit, etp_once_init);	431	pthread_once (&doinit, etp_once_init);
373		432
374	want_poll_cb = want_poll;	433	want_poll_cb = want_poll;
375	done_poll_cb = done_poll;	434	done_poll_cb = done_poll;
		435
		436	return 0;
376	}	437	}
377		438
378	X_THREAD_PROC (etp_proc);	439	X_THREAD_PROC (etp_proc);
379		440
380	static void etp_start_thread (void)	441	static void etp_start_thread (void)
…		…
400	X_UNLOCK (wrklock);	461	X_UNLOCK (wrklock);
401	}	462	}
402		463
403	static void etp_maybe_start_thread (void)	464	static void etp_maybe_start_thread (void)
404	{	465	{
405	if (etp_nthreads () >= wanted)	466	if (expect_true (etp_nthreads () >= wanted))
406	return;	467	return;
407		468
408	/* todo: maybe use idle here, but might be less exact */	469	/* todo: maybe use idle here, but might be less exact */
409	if (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ())	470	if (expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ()))
410	return;	471	return;
411		472
412	etp_start_thread ();	473	etp_start_thread ();
413	}	474	}
414		475
…		…
467		528
468	X_LOCK (reqlock);	529	X_LOCK (reqlock);
469	--nreqs;	530	--nreqs;
470	X_UNLOCK (reqlock);	531	X_UNLOCK (reqlock);
471		532
472	if (req->type == EIO_GROUP && req->size)	533	if (expect_false (req->type == EIO_GROUP && req->size))
473	{	534	{
474	req->int1 = 1; /* mark request as delayed */	535	req->int1 = 1; /* mark request as delayed */
475	continue;	536	continue;
476	}	537	}
477	else	538	else
478	{	539	{
479	int res = ETP_FINISH (req);	540	int res = ETP_FINISH (req);
480	if (res)	541	if (expect_false (res))
481	return res;	542	return res;
482	}	543	}
483		544
484	if (maxreqs && !--maxreqs)	545	if (expect_false (maxreqs && !--maxreqs))
485	break;	546	break;
486		547
487	if (maxtime)	548	if (maxtime)
488	{	549	{
489	gettimeofday (&tv_now, 0);	550	gettimeofday (&tv_now, 0);
…		…
508		569
509	static void etp_submit (ETP_REQ *req)	570	static void etp_submit (ETP_REQ *req)
510	{	571	{
511	req->pri -= ETP_PRI_MIN;	572	req->pri -= ETP_PRI_MIN;
512		573
513	if (req->pri < ETP_PRI_MIN - ETP_PRI_MIN) req->pri = ETP_PRI_MIN - ETP_PRI_MIN;	574	if (expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN;
514	if (req->pri > ETP_PRI_MAX - ETP_PRI_MIN) req->pri = ETP_PRI_MAX - ETP_PRI_MIN;	575	if (expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
515		576
		577	if (expect_false (req->type == EIO_GROUP))
		578	{
		579	/* I hope this is worth it :/ */
516	X_LOCK (reqlock);	580	X_LOCK (reqlock);
517	++nreqs;	581	++nreqs;
		582	X_UNLOCK (reqlock);
		583
		584	X_LOCK (reslock);
		585
		586	++npending;
		587
		588	if (!reqq_push (&res_queue, req) && want_poll_cb)
		589	want_poll_cb ();
		590
		591	X_UNLOCK (reslock);
		592	}
		593	else
		594	{
		595	X_LOCK (reqlock);
		596	++nreqs;
518	++nready;	597	++nready;
519	reqq_push (&req_queue, req);	598	reqq_push (&req_queue, req);
520	X_COND_SIGNAL (reqwait);	599	X_COND_SIGNAL (reqwait);
521	X_UNLOCK (reqlock);	600	X_UNLOCK (reqlock);
522		601
523	etp_maybe_start_thread ();	602	etp_maybe_start_thread ();
		603	}
524	}	604	}
525		605
526	static void etp_set_max_poll_time (double nseconds)	606	static void etp_set_max_poll_time (double nseconds)
527	{	607	{
528	if (WORDACCESS_UNSAFE) X_LOCK (reslock);	608	if (WORDACCESS_UNSAFE) X_LOCK (reslock);
529	max_poll_time = nseconds;	609	max_poll_time = nseconds * EIO_TICKS;
530	if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);	610	if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
531	}	611	}
532		612
533	static void etp_set_max_poll_reqs (unsigned int maxreqs)	613	static void etp_set_max_poll_reqs (unsigned int maxreqs)
534	{	614	{
…		…
563		643
564	static void grp_try_feed (eio_req *grp)	644	static void grp_try_feed (eio_req *grp)
565	{	645	{
566	while (grp->size < grp->int2 && !EIO_CANCELLED (grp))	646	while (grp->size < grp->int2 && !EIO_CANCELLED (grp))
567	{	647	{
568	int old_len = grp->size;	648	grp->flags &= ~EIO_FLAG_GROUPADD;
569		649
570	EIO_FEED (grp);	650	EIO_FEED (grp);
571		651
572	/* stop if no progress has been made */	652	/* stop if no progress has been made */
573	if (old_len == grp->size)	653	if (!(grp->flags & EIO_FLAG_GROUPADD))
574	{	654	{
575	grp->feed = 0;	655	grp->feed = 0;
576	break;	656	break;
577	}	657	}
578	}	658	}
…		…
695		775
696	/*****************************************************************************/	776	/*****************************************************************************/
697	/* work around various missing functions */	777	/* work around various missing functions */
698		778
699	#if !HAVE_PREADWRITE	779	#if !HAVE_PREADWRITE
		780	# undef pread
		781	# undef pwrite
700	# define pread eio__pread	782	# define pread eio__pread
701	# define pwrite eio__pwrite	783	# define pwrite eio__pwrite
702
703	/*
704	* make our pread/pwrite safe against themselves, but not against
705	* normal read/write by using a mutex. slows down execution a lot,
706	* but that's your problem, not mine.
707	*/
708	static mutex_t preadwritelock = X_MUTEX_INIT;
709		784
710	static ssize_t	785	static ssize_t
711	eio__pread (int fd, void *buf, size_t count, off_t offset)	786	eio__pread (int fd, void *buf, size_t count, off_t offset)
712	{	787	{
713	ssize_t res;	788	ssize_t res;
…		…
731		806
732	X_LOCK (preadwritelock);	807	X_LOCK (preadwritelock);
733	ooffset = lseek (fd, 0, SEEK_CUR);	808	ooffset = lseek (fd, 0, SEEK_CUR);
734	lseek (fd, offset, SEEK_SET);	809	lseek (fd, offset, SEEK_SET);
735	res = write (fd, buf, count);	810	res = write (fd, buf, count);
736	lseek (fd, offset, SEEK_SET);	811	lseek (fd, ooffset, SEEK_SET);
737	X_UNLOCK (preadwritelock);	812	X_UNLOCK (preadwritelock);
738		813
739	return res;	814	return res;
740	}	815	}
741	#endif	816	#endif
742		817
743	#ifndef HAVE_FUTIMES	818	#ifndef HAVE_FUTIMES
744		819
		820	# undef utimes
		821	# undef futimes
745	# define utimes(path,times) eio__utimes (path, times)	822	# define utimes(path,times) eio__utimes (path, times)
746	# define futimes(fd,times) eio__futimes (fd, times)	823	# define futimes(fd,times) eio__futimes (fd, times)
747		824
748	static int	825	static int
749	eio__utimes (const char *filename, const struct timeval times[2])	826	eio__utimes (const char *filename, const struct timeval times[2])
…		…
768	}	845	}
769		846
770	#endif	847	#endif
771		848
772	#if !HAVE_FDATASYNC	849	#if !HAVE_FDATASYNC
		850	# undef fdatasync
773	# define fdatasync fsync	851	# define fdatasync(fd) fsync (fd)
774	#endif	852	#endif
		853
		854	/* sync_file_range always needs emulation */
		855	int
		856	eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags)
		857	{
		858	#if HAVE_SYNC_FILE_RANGE
		859	int res;
		860
		861	if (EIO_SYNC_FILE_RANGE_WAIT_BEFORE != SYNC_FILE_RANGE_WAIT_BEFORE
		862	\|\| EIO_SYNC_FILE_RANGE_WRITE != SYNC_FILE_RANGE_WRITE
		863	\|\| EIO_SYNC_FILE_RANGE_WAIT_AFTER != SYNC_FILE_RANGE_WAIT_AFTER)
		864	{
		865	flags = 0
		866	\| (flags & EIO_SYNC_FILE_RANGE_WAIT_BEFORE ? SYNC_FILE_RANGE_WAIT_BEFORE : 0)
		867	\| (flags & EIO_SYNC_FILE_RANGE_WRITE ? SYNC_FILE_RANGE_WRITE : 0)
		868	\| (flags & EIO_SYNC_FILE_RANGE_WAIT_AFTER ? SYNC_FILE_RANGE_WAIT_AFTER : 0);
		869	}
		870
		871	res = sync_file_range (fd, offset, nbytes, flags);
		872
		873	if (!res \|\| errno != ENOSYS)
		874	return res;
		875	#endif
		876
		877	/* even though we could play tricks with the flags, it's better to always
		878	* call fdatasync, as that matches the expectation of its users best */
		879	return fdatasync (fd);
		880	}
775		881
776	#if !HAVE_READAHEAD	882	#if !HAVE_READAHEAD
		883	# undef readahead
777	# define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)	884	# define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)
778		885
779	static ssize_t	886	static ssize_t
780	eio__readahead (int fd, off_t offset, size_t count, etp_worker *self)	887	eio__readahead (int fd, off_t offset, size_t count, etp_worker *self)
781	{	888	{
…		…
808		915
809	#if HAVE_SENDFILE	916	#if HAVE_SENDFILE
810	# if __linux	917	# if __linux
811	res = sendfile (ofd, ifd, &offset, count);	918	res = sendfile (ofd, ifd, &offset, count);
812		919
813	# elif __freebsd	920	# elif __FreeBSD__
814	/*	921	/*
815	* Of course, the freebsd sendfile is a dire hack with no thoughts	922	* Of course, the freebsd sendfile is a dire hack with no thoughts
816	* wasted on making it similar to other I/O functions.	923	* wasted on making it similar to other I/O functions.
817	*/	924	*/
818	{	925	{
819	off_t sbytes;	926	off_t sbytes;
820	res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);	927	res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
821		928
822	if (res < 0 && sbytes)	929	#if 0 /* according to the manpage, this is correct, but broken behaviour */
823	/* maybe only on EAGAIN: as usual, the manpage leaves you guessing */	930	/* freebsd' sendfile will return 0 on success */
		931	/* freebsd 8 documents it as only setting sbytes on EINTR and EAGAIN, but /
		932	/* not on e.g. EIO or EPIPE - sounds broken */
		933	if ((res < 0 && (errno == EAGAIN \|\| errno == EINTR) && sbytes) \|\| res == 0)
		934	res = sbytes;
		935	#endif
		936
		937	/* according to source inspection, this is correct, and useful behaviour */
		938	if (sbytes)
		939	res = sbytes;
		940	}
		941
		942	# elif defined (__APPLE__)
		943
		944	{
		945	off_t sbytes = count;
		946	res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
		947
		948	/* according to the manpage, sbytes is always valid */
		949	if (sbytes)
824	res = sbytes;	950	res = sbytes;
825	}	951	}
826		952
827	# elif __hpux	953	# elif __hpux
828	res = sendfile (ofd, ifd, offset, count, 0, 0);	954	res = sendfile (ofd, ifd, offset, count, 0, 0);
…		…
842	if (res < 0 && sbytes)	968	if (res < 0 && sbytes)
843	res = sbytes;	969	res = sbytes;
844	}	970	}
845		971
846	# endif	972	# endif
		973
		974	#elif defined (_WIN32)
		975
		976	/* does not work, just for documentation of what would need to be done */
		977	{
		978	HANDLE h = TO_SOCKET (ifd);
		979	SetFilePointer (h, offset, 0, FILE_BEGIN);
		980	res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
		981	}
		982
847	#else	983	#else
848	res = -1;	984	res = -1;
849	errno = ENOSYS;	985	errno = ENOSYS;
850	#endif	986	#endif
851		987
852	if (res < 0	988	if (res < 0
853	&& (errno == ENOSYS \|\| errno == EINVAL \|\| errno == ENOTSOCK	989	&& (errno == ENOSYS \|\| errno == EINVAL \|\| errno == ENOTSOCK
		990	/* BSDs */
		991	#ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */
		992	\|\| errno == ENOTSUP
		993	#endif
		994	\|\| errno == EOPNOTSUPP /* BSDs */
854	#if __solaris	995	#if __solaris
855	\|\| errno == EAFNOSUPPORT \|\| errno == EPROTOTYPE	996	\|\| errno == EAFNOSUPPORT \|\| errno == EPROTOTYPE
856	#endif	997	#endif
857	)	998	)
858	)	999	)
…		…
889	}	1030	}
890		1031
891	return res;	1032	return res;
892	}	1033	}
893		1034
		1035	static signed char
		1036	eio_dent_cmp (const eio_dirent a, const eio_dirent b)
		1037	{
		1038	return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
		1039	: a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0;
		1040	}
		1041
		1042	#define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
		1043
		1044	#define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
		1045	#define EIO_SORT_FAST 60 /* when to only use insertion sort */
		1046
		1047	static void
		1048	eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
		1049	{
		1050	unsigned char bits [9 + sizeof (ino_t) * 8];
		1051	unsigned char *bit = bits;
		1052
		1053	assert (CHAR_BIT == 8);
		1054	assert (sizeof (eio_dirent) * 8 < 256);
		1055	assert (offsetof (eio_dirent, inode)); /* we use 0 as sentinel */
		1056	assert (offsetof (eio_dirent, score)); /* we use 0 as sentinel */
		1057
		1058	if (size <= EIO_SORT_FAST)
		1059	return;
		1060
		1061	/* first prepare an array of bits to test in our radix sort */
		1062	/* try to take endianness into account, as well as differences in ino_t sizes */
		1063	/* inode_bits must contain all inodes ORed together */
		1064	/* which is used to skip bits that are 0 everywhere, which is very common */
		1065	{
		1066	ino_t endianness;
		1067	int i, j;
		1068
		1069	/* we store the byte offset of byte n into byte n of "endianness" */
		1070	for (i = 0; i < sizeof (ino_t); ++i)
		1071	((unsigned char *)&endianness)[i] = i;
		1072
		1073	*bit++ = 0;
		1074
		1075	for (i = 0; i < sizeof (ino_t); ++i)
		1076	{
		1077	/* shifting off the byte offsets out of "endianness" */
		1078	int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
		1079	endianness >>= 8;
		1080
		1081	for (j = 0; j < 8; ++j)
		1082	if (inode_bits & (((ino_t)1) << (i * 8 + j)))
		1083	*bit++ = offs + j;
		1084	}
		1085
		1086	for (j = 0; j < 8; ++j)
		1087	if (score_bits & (1 << j))
		1088	bit++ = offsetof (eio_dirent, score) 8 + j;
		1089	}
		1090
		1091	/* now actually do the sorting (a variant of MSD radix sort) */
		1092	{
		1093	eio_dirent base_stk [9 + sizeof (ino_t) 8], *base;
		1094	eio_dirent end_stk [9 + sizeof (ino_t) 8], *end;
		1095	unsigned char bit_stk [9 + sizeof (ino_t) 8];
		1096	int stk_idx = 0;
		1097
		1098	base_stk [stk_idx] = dents;
		1099	end_stk [stk_idx] = dents + size;
		1100	bit_stk [stk_idx] = bit - 1;
		1101
		1102	do
		1103	{
		1104	base = base_stk [stk_idx];
		1105	end = end_stk [stk_idx];
		1106	bit = bit_stk [stk_idx];
		1107
		1108	for (;;)
		1109	{
		1110	unsigned char O = *bit >> 3;
		1111	unsigned char M = 1 << (*bit & 7);
		1112
		1113	eio_dirent *a = base;
		1114	eio_dirent *b = end;
		1115
		1116	if (b - a < EIO_SORT_CUTOFF)
		1117	break;
		1118
		1119	/* now bit-partition the array on the bit */
		1120	/* this ugly asymmetric loop seems to perform much better than typical */
		1121	/* partition algos found in the literature */
		1122	do
		1123	if (!(((unsigned char *)a)[O] & M))
		1124	++a;
		1125	else if (!(((unsigned char *)--b)[O] & M))
		1126	{
		1127	eio_dirent tmp = a; a = b; b = tmp;
		1128	++a;
		1129	}
		1130	while (b > a);
		1131
		1132	/* next bit, or stop, if no bits left in this path */
		1133	if (!*--bit)
		1134	break;
		1135
		1136	base_stk [stk_idx] = a;
		1137	end_stk [stk_idx] = end;
		1138	bit_stk [stk_idx] = bit;
		1139	++stk_idx;
		1140
		1141	end = a;
		1142	}
		1143	}
		1144	while (stk_idx--);
		1145	}
		1146	}
		1147
		1148	static void
		1149	eio_dent_insertion_sort (eio_dirent *dents, int size)
		1150	{
		1151	/* first move the smallest element to the front, to act as a sentinel */
		1152	{
		1153	int i;
		1154	eio_dirent *min = dents;
		1155
		1156	/* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
		1157	for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
		1158	if (EIO_DENT_CMP (dents [i], <, *min))
		1159	min = &dents [i];
		1160
		1161	/* swap elements 0 and j (minimum) */
		1162	{
		1163	eio_dirent tmp = dents; dents = min; min = tmp;
		1164	}
		1165	}
		1166
		1167	/* then do standard insertion sort, assuming that all elements are >= dents [0] */
		1168	{
		1169	eio_dirent i, j;
		1170
		1171	for (i = dents + 1; i < dents + size; ++i)
		1172	{
		1173	eio_dirent value = *i;
		1174
		1175	for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
		1176	j [1] = j [0];
		1177
		1178	j [1] = value;
		1179	}
		1180	}
		1181	}
		1182
		1183	static void
		1184	eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
		1185	{
		1186	if (size <= 1)
		1187	return; /* our insertion sort relies on size > 0 */
		1188
		1189	/* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
		1190	/* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
		1191	eio_dent_radix_sort (dents, size, score_bits, inode_bits);
		1192
		1193	/* use an insertion sort at the end, or for small arrays, */
		1194	/* as insertion sort is more efficient for small partitions */
		1195	eio_dent_insertion_sort (dents, size);
		1196	}
		1197
894	/* read a full directory */	1198	/* read a full directory */
895	static void	1199	static void
896	eio__scandir (eio_req req, etp_worker self)	1200	eio__scandir (eio_req req, etp_worker self)
897	{	1201	{
898	DIR *dirp;	1202	DIR *dirp;
899	EIO_STRUCT_DIRENT *entp;	1203	EIO_STRUCT_DIRENT *entp;
900	char name, names;	1204	char name, names;
901	int memlen = 4096;	1205	int namesalloc = 4096;
902	int memofs = 0;	1206	int namesoffs = 0;
		1207	int flags = req->int1;
		1208	eio_dirent *dents = 0;
		1209	int dentalloc = 128;
903	int res = 0;	1210	int dentoffs = 0;
		1211	ino_t inode_bits = 0;
		1212
		1213	req->result = -1;
		1214
		1215	if (!(flags & EIO_READDIR_DENTS))
		1216	flags &= ~(EIO_READDIR_DIRS_FIRST \| EIO_READDIR_STAT_ORDER);
904		1217
905	X_LOCK (wrklock);	1218	X_LOCK (wrklock);
		1219	/* the corresponding closedir is in ETP_WORKER_CLEAR */
906	self->dirp = dirp = opendir (req->ptr1);	1220	self->dirp = dirp = opendir (req->ptr1);
907	req->flags \|= EIO_FLAG_PTR2_FREE;	1221	req->flags \|= EIO_FLAG_PTR1_FREE \| EIO_FLAG_PTR2_FREE;
		1222	req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
908	req->ptr2 = names = malloc (memlen);	1223	req->ptr2 = names = malloc (namesalloc);
909	X_UNLOCK (wrklock);	1224	X_UNLOCK (wrklock);
910		1225
911	if (dirp && names)	1226	if (dirp && names && (!flags \|\| dents))
912	for (;;)	1227	for (;;)
913	{	1228	{
914	errno = 0;	1229	errno = 0;
915	entp = readdir (dirp);	1230	entp = readdir (dirp);
916		1231
917	if (!entp)	1232	if (!entp)
		1233	{
		1234	if (errno)
		1235	break;
		1236
		1237	/* sort etc. */
		1238	req->int1 = flags;
		1239	req->result = dentoffs;
		1240
		1241	if (flags & EIO_READDIR_STAT_ORDER)
		1242	eio_dent_sort (dents, dentoffs, 0, inode_bits); /* sort by inode exclusively */
		1243	else if (flags & EIO_READDIR_DIRS_FIRST)
		1244	if (flags & EIO_READDIR_FOUND_UNKNOWN)
		1245	eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
		1246	else
		1247	{
		1248	/* in this case, all is known, and we just put dirs first and sort them */
		1249	eio_dirent *oth = dents + dentoffs;
		1250	eio_dirent *dir = dents;
		1251
		1252	/* now partition dirs to the front, and non-dirs to the back */
		1253	/* by walking from both sides and swapping if necessary */
		1254	/* also clear score, so it doesn't influence sorting */
		1255	while (oth > dir)
		1256	{
		1257	if (dir->type == EIO_DT_DIR)
		1258	++dir;
		1259	else if ((--oth)->type == EIO_DT_DIR)
		1260	{
		1261	eio_dirent tmp = dir; dir = oth; oth = tmp;
		1262
		1263	++dir;
		1264	}
		1265	}
		1266
		1267	/* now sort the dirs only */
		1268	eio_dent_sort (dents, dir - dents, 0, inode_bits);
		1269	}
		1270
918	break;	1271	break;
		1272	}
919		1273
		1274	/* now add the entry to our list(s) */
920	name = entp->d_name;	1275	name = entp->d_name;
921		1276
		1277	/* skip . and .. entries */
922	if (name [0] != '.' \|\| (name [1] && (name [1] != '.' \|\| name [2])))	1278	if (name [0] != '.' \|\| (name [1] && (name [1] != '.' \|\| name [2])))
923	{	1279	{
924	int len = strlen (name) + 1;	1280	int len = D_NAMLEN (entp) + 1;
925		1281
926	res++;	1282	while (expect_false (namesoffs + len > namesalloc))
927
928	while (memofs + len > memlen)
929	{	1283	{
930	memlen *= 2;	1284	namesalloc *= 2;
931	X_LOCK (wrklock);	1285	X_LOCK (wrklock);
932	req->ptr2 = names = realloc (names, memlen);	1286	req->ptr2 = names = realloc (names, namesalloc);
933	X_UNLOCK (wrklock);	1287	X_UNLOCK (wrklock);
934		1288
935	if (!names)	1289	if (!names)
936	break;	1290	break;
937	}	1291	}
938		1292
939	memcpy (names + memofs, name, len);	1293	memcpy (names + namesoffs, name, len);
		1294
		1295	if (dents)
		1296	{
		1297	struct eio_dirent *ent;
		1298
		1299	if (expect_false (dentoffs == dentalloc))
		1300	{
		1301	dentalloc *= 2;
		1302	X_LOCK (wrklock);
		1303	req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
		1304	X_UNLOCK (wrklock);
		1305
		1306	if (!dents)
		1307	break;
		1308	}
		1309
		1310	ent = dents + dentoffs;
		1311
		1312	ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
		1313	ent->namelen = len - 1;
		1314	ent->inode = D_INO (entp);
		1315
		1316	inode_bits \|= ent->inode;
		1317
		1318	switch (D_TYPE (entp))
		1319	{
		1320	default:
		1321	ent->type = EIO_DT_UNKNOWN;
		1322	flags \|= EIO_READDIR_FOUND_UNKNOWN;
		1323	break;
		1324
		1325	#ifdef DT_FIFO
		1326	case DT_FIFO: ent->type = EIO_DT_FIFO; break;
		1327	#endif
		1328	#ifdef DT_CHR
		1329	case DT_CHR: ent->type = EIO_DT_CHR; break;
		1330	#endif
		1331	#ifdef DT_MPC
		1332	case DT_MPC: ent->type = EIO_DT_MPC; break;
		1333	#endif
		1334	#ifdef DT_DIR
		1335	case DT_DIR: ent->type = EIO_DT_DIR; break;
		1336	#endif
		1337	#ifdef DT_NAM
		1338	case DT_NAM: ent->type = EIO_DT_NAM; break;
		1339	#endif
		1340	#ifdef DT_BLK
		1341	case DT_BLK: ent->type = EIO_DT_BLK; break;
		1342	#endif
		1343	#ifdef DT_MPB
		1344	case DT_MPB: ent->type = EIO_DT_MPB; break;
		1345	#endif
		1346	#ifdef DT_REG
		1347	case DT_REG: ent->type = EIO_DT_REG; break;
		1348	#endif
		1349	#ifdef DT_NWK
		1350	case DT_NWK: ent->type = EIO_DT_NWK; break;
		1351	#endif
		1352	#ifdef DT_CMP
		1353	case DT_CMP: ent->type = EIO_DT_CMP; break;
		1354	#endif
		1355	#ifdef DT_LNK
		1356	case DT_LNK: ent->type = EIO_DT_LNK; break;
		1357	#endif
		1358	#ifdef DT_SOCK
		1359	case DT_SOCK: ent->type = EIO_DT_SOCK; break;
		1360	#endif
		1361	#ifdef DT_DOOR
		1362	case DT_DOOR: ent->type = EIO_DT_DOOR; break;
		1363	#endif
		1364	#ifdef DT_WHT
		1365	case DT_WHT: ent->type = EIO_DT_WHT; break;
		1366	#endif
		1367	}
		1368
		1369	ent->score = 7;
		1370
		1371	if (flags & EIO_READDIR_DIRS_FIRST)
		1372	{
		1373	if (ent->type == EIO_DT_UNKNOWN)
		1374	{
		1375	if (name == '.') / leading dots are likely directories, and, in any case, rare */
		1376	ent->score = 1;
		1377	else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
		1378	ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
		1379	}
		1380	else if (ent->type == EIO_DT_DIR)
		1381	ent->score = 0;
		1382	}
		1383	}
		1384
940	memofs += len;	1385	namesoffs += len;
		1386	++dentoffs;
		1387	}
		1388
		1389	if (EIO_CANCELLED (req))
		1390	{
		1391	errno = ECANCELED;
		1392	break;
941	}	1393	}
942	}	1394	}
		1395	}
943		1396
944	if (errno)	1397	#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
945	res = -1;	1398	# define eio__msync(a,b,c) ((errno = ENOSYS), -1)
946		1399	#else
947	req->result = res;	1400
		1401	int
		1402	eio__msync (void *mem, size_t len, int flags)
		1403	{
		1404	if (EIO_MS_ASYNC != MS_SYNC
		1405	\|\| EIO_MS_INVALIDATE != MS_INVALIDATE
		1406	\|\| EIO_MS_SYNC != MS_SYNC)
		1407	{
		1408	flags = 0
		1409	\| (flags & EIO_MS_ASYNC ? MS_ASYNC : 0)
		1410	\| (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0)
		1411	\| (flags & EIO_MS_SYNC ? MS_SYNC : 0);
		1412	}
		1413
		1414	return msync (mem, len, flags);
		1415	}
		1416
		1417	#endif
		1418
		1419	int
		1420	eio__mtouch (void *mem, size_t len, int flags)
		1421	{
		1422	intptr_t addr = (intptr_t)mem;
		1423	intptr_t end = addr + len;
		1424	#ifdef PAGESIZE
		1425	const intptr_t page = PAGESIZE;
		1426	#else
		1427	static intptr_t page;
		1428
		1429	if (!page)
		1430	page = sysconf (_SC_PAGESIZE);
		1431	#endif
		1432
		1433	/* round down to start of page, although this is probably useless */
		1434	addr &= ~(page - 1); /* assume page size is always a power of two */
		1435
		1436	if (addr < end)
		1437	if (flags & EIO_MT_MODIFY) /* modify */
		1438	do { ((volatile sig_atomic_t )addr) \|= 0; } while ((addr += page) < len);
		1439	else
		1440	do { ((volatile sig_atomic_t )addr) ; } while ((addr += page) < len);
		1441
		1442	return 0;
948	}	1443	}
949		1444
950	/*****************************************************************************/	1445	/*****************************************************************************/
951		1446
952	#define ALLOC(len) \	1447	#define ALLOC(len) \
…		…
1039		1534
1040	/*****************************************************************************/	1535	/*****************************************************************************/
1041		1536
1042	int eio_init (void (want_poll)(void), void (done_poll)(void))	1537	int eio_init (void (want_poll)(void), void (done_poll)(void))
1043	{	1538	{
1044	etp_init (want_poll, done_poll);	1539	return etp_init (want_poll, done_poll);
1045	}	1540	}
1046		1541
1047	static void eio_api_destroy (eio_req *req)	1542	static void eio_api_destroy (eio_req *req)
1048	{	1543	{
1049	free (req);	1544	free (req);
…		…
1095	case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));	1590	case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1096	req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;	1591	req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1097	case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));	1592	case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1098	req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;	1593	req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
1099		1594
		1595	case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
		1596	req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
		1597	case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
		1598	req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
		1599
1100	case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;	1600	case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
1101	case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;	1601	case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
1102	case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;	1602	case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
1103	case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;	1603	case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
1104	case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;	1604	case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
…		…
1113	case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;	1613	case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
1114	case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;	1614	case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
1115	case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;	1615	case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
1116	case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break;	1616	case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break;
1117		1617
1118	case EIO_READLINK: ALLOC (NAME_MAX);	1618	case EIO_READLINK: ALLOC (PATH_MAX);
1119	req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break;	1619	req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break;
1120		1620
1121	case EIO_SYNC: req->result = 0; sync (); break;	1621	case EIO_SYNC: req->result = 0; sync (); break;
1122	case EIO_FSYNC: req->result = fsync (req->int1); break;	1622	case EIO_FSYNC: req->result = fsync (req->int1); break;
1123	case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;	1623	case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
		1624	case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break;
		1625	case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break;
		1626	case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
1124		1627
1125	case EIO_READDIR: eio__scandir (req, self); break;	1628	case EIO_READDIR: eio__scandir (req, self); break;
1126		1629
1127	case EIO_BUSY:	1630	case EIO_BUSY:
1128	#ifdef _WIN32	1631	#ifdef _WIN32
…		…
1160		1663
1161	req->result = req->type == EIO_FUTIME	1664	req->result = req->type == EIO_FUTIME
1162	? futimes (req->int1, times)	1665	? futimes (req->int1, times)
1163	: utimes (req->ptr1, times);	1666	: utimes (req->ptr1, times);
1164	}	1667	}
		1668	break;
1165		1669
1166	case EIO_GROUP:	1670	case EIO_GROUP:
		1671	abort (); /* handled in eio_request */
		1672
1167	case EIO_NOP:	1673	case EIO_NOP:
1168	req->result = 0;	1674	req->result = 0;
1169	break;	1675	break;
1170		1676
1171	case EIO_CUSTOM:	1677	case EIO_CUSTOM:
1172	req->feed (req);	1678	((void ()(eio_req ))req->feed) (req);
1173	break;	1679	break;
1174		1680
1175	default:	1681	default:
1176	req->result = -1;	1682	req->result = -1;
1177	break;	1683	break;
…		…
1200	eio_req eio_fsync (int fd, int pri, eio_cb cb, void data)	1706	eio_req eio_fsync (int fd, int pri, eio_cb cb, void data)
1201	{	1707	{
1202	REQ (EIO_FSYNC); req->int1 = fd; SEND;	1708	REQ (EIO_FSYNC); req->int1 = fd; SEND;
1203	}	1709	}
1204		1710
		1711	eio_req eio_msync (void addr, size_t length, int flags, int pri, eio_cb cb, void *data)
		1712	{
		1713	REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
		1714	}
		1715
		1716	eio_req eio_mtouch (void addr, size_t length, int flags, int pri, eio_cb cb, void *data)
		1717	{
		1718	REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
		1719	}
		1720
		1721	eio_req eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void data)
		1722	{
		1723	REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND;
		1724	}
		1725
1205	eio_req eio_fdatasync (int fd, int pri, eio_cb cb, void data)	1726	eio_req eio_fdatasync (int fd, int pri, eio_cb cb, void data)
1206	{	1727	{
1207	REQ (EIO_FDATASYNC); req->int1 = fd; SEND;	1728	REQ (EIO_FDATASYNC); req->int1 = fd; SEND;
1208	}	1729	}
1209		1730
…		…
1228	}	1749	}
1229		1750
1230	eio_req eio_fstat (int fd, int pri, eio_cb cb, void data)	1751	eio_req eio_fstat (int fd, int pri, eio_cb cb, void data)
1231	{	1752	{
1232	REQ (EIO_FSTAT); req->int1 = fd; SEND;	1753	REQ (EIO_FSTAT); req->int1 = fd; SEND;
		1754	}
		1755
		1756	eio_req eio_fstatvfs (int fd, int pri, eio_cb cb, void data)
		1757	{
		1758	REQ (EIO_FSTATVFS); req->int1 = fd; SEND;
1233	}	1759	}
1234		1760
1235	eio_req eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void data)	1761	eio_req eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void data)
1236	{	1762	{
1237	REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;	1763	REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
…		…
1311	eio_req eio_lstat (const char path, int pri, eio_cb cb, void *data)	1837	eio_req eio_lstat (const char path, int pri, eio_cb cb, void *data)
1312	{	1838	{
1313	return eio__1path (EIO_LSTAT, path, pri, cb, data);	1839	return eio__1path (EIO_LSTAT, path, pri, cb, data);
1314	}	1840	}
1315		1841
		1842	eio_req eio_statvfs (const char path, int pri, eio_cb cb, void *data)
		1843	{
		1844	return eio__1path (EIO_STATVFS, path, pri, cb, data);
		1845	}
		1846
1316	eio_req eio_unlink (const char path, int pri, eio_cb cb, void *data)	1847	eio_req eio_unlink (const char path, int pri, eio_cb cb, void *data)
1317	{	1848	{
1318	return eio__1path (EIO_UNLINK, path, pri, cb, data);	1849	return eio__1path (EIO_UNLINK, path, pri, cb, data);
1319	}	1850	}
1320		1851
1321	eio_req eio_rmdir (const char path, int pri, eio_cb cb, void *data)	1852	eio_req eio_rmdir (const char path, int pri, eio_cb cb, void *data)
1322	{	1853	{
1323	return eio__1path (EIO_RMDIR, path, pri, cb, data);	1854	return eio__1path (EIO_RMDIR, path, pri, cb, data);
1324	}	1855	}
1325		1856
1326	eio_req eio_readdir (const char path, int pri, eio_cb cb, void *data)	1857	eio_req eio_readdir (const char path, int flags, int pri, eio_cb cb, void *data)
1327	{	1858	{
1328	return eio__1path (EIO_READDIR, path, pri, cb, data);	1859	REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
1329	}	1860	}
1330		1861
1331	eio_req eio_mknod (const char path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)	1862	eio_req eio_mknod (const char path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
1332	{	1863	{
1333	REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND;	1864	REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND;
…		…
1364	return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);	1895	return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
1365	}	1896	}
1366		1897
1367	eio_req eio_custom (eio_cb execute, int pri, eio_cb cb, void data)	1898	eio_req eio_custom (eio_cb execute, int pri, eio_cb cb, void data)
1368	{	1899	{
1369	REQ (EIO_CUSTOM); req->feed = execute; SEND;	1900	REQ (EIO_CUSTOM); req->feed = (void ()(eio_req ))execute; SEND;
1370	}	1901	}
1371		1902
1372	#endif	1903	#endif
1373		1904
1374	eio_req eio_grp (eio_cb cb, void data)	1905	eio_req eio_grp (eio_cb cb, void data)
…		…
1402		1933
1403	void eio_grp_add (eio_req grp, eio_req req)	1934	void eio_grp_add (eio_req grp, eio_req req)
1404	{	1935	{
1405	assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2));	1936	assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2));
1406		1937
		1938	grp->flags \|= EIO_FLAG_GROUPADD;
		1939
1407	++grp->size;	1940	++grp->size;
1408	req->grp = grp;	1941	req->grp = grp;
1409		1942
1410	req->grp_prev = 0;	1943	req->grp_prev = 0;
1411	req->grp_next = grp->grp_first;	1944	req->grp_next = grp->grp_first;
…		…
1420	/* misc garbage */	1953	/* misc garbage */
1421		1954
1422	ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)	1955	ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
1423	{	1956	{
1424	etp_worker wrk;	1957	etp_worker wrk;
		1958	ssize_t ret;
1425		1959
1426	wrk.dbuf = 0;	1960	wrk.dbuf = 0;
1427		1961
1428	eio__sendfile (ofd, ifd, offset, count, &wrk);	1962	ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
1429		1963
1430	if (wrk.dbuf)	1964	if (wrk.dbuf)
1431	free (wrk.dbuf);	1965	free (wrk.dbuf);
1432	}
1433		1966
		1967	return ret;
		1968	}
		1969

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing libeio/eio.c (file contents): Revision 1.18 by root, Mon Jun 16 12:19:55 2008 UTC vs. Revision 1.54 by root, Tue Feb 23 14:32:45 2010 UTC

Diff Legend

Comparing libeio/eio.c (file contents):
Revision 1.18 by root, Mon Jun 16 12:19:55 2008 UTC vs.
Revision 1.54 by root, Tue Feb 23 14:32:45 2010 UTC