ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libeio/eio.c

Comparing libeio/eio.c (file contents):
Revision 1.10 by root, Tue May 13 17:08:15 2008 UTC vs.
Revision 1.55 by root, Wed Mar 31 00:46:18 2010 UTC

		1	/*
		2	* libeio implementation
		3	*
		4	* Copyright (c) 2007,2008,2009,2010 Marc Alexander Lehmann <libeio@schmorp.de>
		5	* All rights reserved.
		6	*
		7	* Redistribution and use in source and binary forms, with or without modifica-
		8	* tion, are permitted provided that the following conditions are met:
		9	*
		10	* 1. Redistributions of source code must retain the above copyright notice,
		11	* this list of conditions and the following disclaimer.
		12	*
		13	* 2. Redistributions in binary form must reproduce the above copyright
		14	* notice, this list of conditions and the following disclaimer in the
		15	* documentation and/or other materials provided with the distribution.
		16	*
		17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
		18	* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
		19	* CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
		20	* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
		21	* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
		22	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
		23	* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
		24	* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
		25	* ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
		26	* OF THE POSSIBILITY OF SUCH DAMAGE.
		27	*
		28	* Alternatively, the contents of this file may be used under the terms of
		29	* the GNU General Public License ("GPL") version 2 or any later version,
		30	* in which case the provisions of the GPL are applicable instead of
		31	* the above. If you wish to allow the use of your version of this file
		32	* only under the terms of the GPL and not to allow others to use your
		33	* version of this file under the BSD license, indicate your decision
		34	* by deleting the provisions above and replace them with the notice
		35	* and other provisions required by the GPL. If you do not delete the
		36	* provisions above, a recipient may use your version of this file under
		37	* either the BSD or the GPL.
		38	*/
		39
1	#include "eio.h"	40	#include "eio.h"
		41
		42	#ifdef EIO_STACKSIZE
		43	# define XTHREAD_STACKSIZE EIO_STACKSIZE
		44	#endif
2	#include "xthread.h"	45	#include "xthread.h"
3		46
4	#include <errno.h>	47	#include <errno.h>
5	#include <stddef.h>	48	#include <stddef.h>
6	#include <stdlib.h>	49	#include <stdlib.h>
7	#include <string.h>	50	#include <string.h>
8	#include <errno.h>	51	#include <errno.h>
9	#include <sys/types.h>	52	#include <sys/types.h>
10	#include <sys/stat.h>	53	#include <sys/stat.h>
		54	#include <sys/statvfs.h>
11	#include <limits.h>	55	#include <limits.h>
12	#include <fcntl.h>	56	#include <fcntl.h>
13	#include <assert.h>	57	#include <assert.h>
14		58
15	#ifndef EIO_FINISH	59	#ifndef EIO_FINISH
…		…
25	#endif	69	#endif
26		70
27	#ifdef _WIN32	71	#ifdef _WIN32
28		72
29	/*doh*/	73	/*doh*/
30
31	#else	74	#else
32		75
33	# include "config.h"	76	# include "config.h"
34	# include <sys/time.h>	77	# include <sys/time.h>
35	# include <sys/select.h>	78	# include <sys/select.h>
		79	# include <sys/mman.h>
36	# include <unistd.h>	80	# include <unistd.h>
37	# include <utime.h>	81	# include <utime.h>
38	# include <signal.h>	82	# include <signal.h>
39	# include <dirent.h>	83	# include <dirent.h>
40		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
41	# ifndef EIO_STRUCT_DIRENT	103	# ifndef EIO_STRUCT_DIRENT
42	# define EIO_STRUCT_DIRENT struct dirent	104	# define EIO_STRUCT_DIRENT struct dirent
43	# endif	105	# endif
44		106
45	#endif	107	#endif
46		108
47	#if HAVE_SENDFILE	109	#if HAVE_SENDFILE
48	# if __linux	110	# if __linux
49	# include <sys/sendfile.h>	111	# include <sys/sendfile.h>
50	# elif __freebsd	112	# elif __FreeBSD__ || defined __APPLE__
51	# include <sys/socket.h>	113	# include <sys/socket.h>
52	# include <sys/uio.h>	114	# include <sys/uio.h>
53	# elif __hpux	115	# elif __hpux
54	# include <sys/socket.h>	116	# include <sys/socket.h>
55	# elif __solaris /* not yet */	117	# elif __solaris
56	# include <sys/sendfile.h>	118	# include <sys/sendfile.h>
57	# else	119	# else
58	# error sendfile support requested but not available	120	# error sendfile support requested but not available
59	# endif	121	# endif
60	#endif	122	#endif
61		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
62	/* number of seconds after which an idle threads exit */	134	/* number of seconds after which an idle threads exit */
63	#define IDLE_TIMEOUT 10	135	#define IDLE_TIMEOUT 10
64		136
65	/* used for struct dirent, AIX doesn't provide it */	137	/* used for struct dirent, AIX doesn't provide it */
66	#ifndef NAME_MAX	138	#ifndef NAME_MAX
67	# define NAME_MAX 4096	139	# define NAME_MAX 4096
68	#endif	140	#endif
69		141
		142	/* used for readlink etc. */
		143	#ifndef PATH_MAX
		144	# define PATH_MAX 4096
		145	#endif
		146
70	/* buffer size for various temporary buffers */	147	/* buffer size for various temporary buffers */
71	#define EIO_BUFSIZE 65536	148	#define EIO_BUFSIZE 65536
72		149
73	#define dBUF \	150	#define dBUF \
74	char *eio_buf; \	151	char *eio_buf; \
75	X_LOCK (wrklock); \	152	ETP_WORKER_LOCK (self); \
76	self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \	153	self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \
77	X_UNLOCK (wrklock); \	154	ETP_WORKER_UNLOCK (self); \
78	errno = ENOMEM; \	155	errno = ENOMEM; \
79	if (!eio_buf) \	156	if (!eio_buf) \
80	return -1;	157	return -1;
81		158
82	#define EIO_TICKS ((1000000 + 1023) >> 10)	159	#define EIO_TICKS ((1000000 + 1023) >> 10)
83		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)
		171
		172	/*****************************************************************************/
		173
		174	#define ETP_PRI_MIN EIO_PRI_MIN
		175	#define ETP_PRI_MAX EIO_PRI_MAX
		176
		177	struct etp_worker;
		178
		179	#define ETP_REQ eio_req
		180	#define ETP_DESTROY(req) eio_destroy (req)
		181	static int eio_finish (eio_req *req);
		182	#define ETP_FINISH(req) eio_finish (req)
		183	static void eio_execute (struct etp_worker *self, eio_req *req);
		184	#define ETP_EXECUTE(wrk,req) eio_execute (wrk,req)
		185
		186	#define ETP_WORKER_CLEAR(req) \
		187	if (wrk->dbuf) \
		188	{ \
		189	free (wrk->dbuf); \
		190	wrk->dbuf = 0; \
		191	} \
		192	\
		193	if (wrk->dirp) \
		194	{ \
		195	closedir (wrk->dirp); \
		196	wrk->dirp = 0; \
		197	}
		198
		199	#define ETP_WORKER_COMMON \
		200	void *dbuf; \
		201	DIR *dirp;
		202
		203	/*****************************************************************************/
		204
		205	#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
		206
		207	/* calculate time difference in ~1/EIO_TICKS of a second */
		208	static int tvdiff (struct timeval *tv1, struct timeval *tv2)
		209	{
		210	return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
		211	+ ((tv2->tv_usec - tv1->tv_usec) >> 10);
		212	}
		213
		214	static unsigned int started, idle, wanted = 4;
		215
84	static void (*want_poll_cb) (void);	216	static void (*want_poll_cb) (void);
85	static void (*done_poll_cb) (void);	217	static void (*done_poll_cb) (void);
86		218
87	static unsigned int max_poll_time = 0;	219	static unsigned int max_poll_time; /* reslock */
88	static unsigned int max_poll_reqs = 0;	220	static unsigned int max_poll_reqs; /* reslock */
89		221
90	/* calculcate time difference in ~1/EIO_TICKS of a second */	222	static volatile unsigned int nreqs; /* reqlock */
91	static int tvdiff (struct timeval *tv1, struct timeval *tv2)	223	static volatile unsigned int nready; /* reqlock */
92	{	224	static volatile unsigned int npending; /* reqlock */
93	return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS	225	static volatile unsigned int max_idle = 4;
94	+ ((tv2->tv_usec - tv1->tv_usec) >> 10);
95	}
96		226
97	static unsigned int started, idle, wanted = 4;	227	static xmutex_t wrklock = X_MUTEX_INIT;
		228	static xmutex_t reslock = X_MUTEX_INIT;
		229	static xmutex_t reqlock = X_MUTEX_INIT;
		230	static xcond_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 xmutex_t preadwritelock = X_MUTEX_INIT;
		239	#endif
		240
		241	typedef struct etp_worker
		242	{
		243	/* locked by wrklock */
		244	struct etp_worker *prev, *next;
		245
		246	xthread_t tid;
		247
		248	/* locked by reslock, reqlock or wrklock */
		249	ETP_REQ *req; /* currently processed request */
		250
		251	ETP_WORKER_COMMON
		252	} etp_worker;
		253
		254	static etp_worker wrk_first = { &wrk_first, &wrk_first, 0 }; /* NOT etp */
		255
		256	#define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock)
		257	#define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock)
98		258
99	/* worker threads management */	259	/* worker threads management */
100	static mutex_t wrklock = X_MUTEX_INIT;
101		260
102	typedef struct worker
103	{
104	/* locked by wrklock */
105	struct worker *prev, *next;
106
107	thread_t tid;
108
109	/* locked by reslock, reqlock or wrklock */
110	eio_req *req; /* currently processed request */
111	void *dbuf;
112	DIR *dirp;
113	} worker;
114
115	static worker wrk_first = { &wrk_first, &wrk_first, 0 };
116
117	static void worker_clear (worker *wrk)	261	static void etp_worker_clear (etp_worker *wrk)
118	{	262	{
119	if (wrk->dirp)	263	ETP_WORKER_CLEAR (wrk);
120	{
121	closedir (wrk->dirp);
122	wrk->dirp = 0;
123	}
124
125	if (wrk->dbuf)
126	{
127	free (wrk->dbuf);
128	wrk->dbuf = 0;
129	}
130	}	264	}
131		265
132	static void worker_free (worker *wrk)	266	static void etp_worker_free (etp_worker *wrk)
133	{	267	{
134	wrk->next->prev = wrk->prev;	268	wrk->next->prev = wrk->prev;
135	wrk->prev->next = wrk->next;	269	wrk->prev->next = wrk->next;
136		270
137	free (wrk);	271	free (wrk);
138	}	272	}
139		273
140	static volatile unsigned int nreqs, nready, npending;
141	static volatile unsigned int max_idle = 4;
142
143	static mutex_t reslock = X_MUTEX_INIT;
144	static mutex_t reqlock = X_MUTEX_INIT;
145	static cond_t reqwait = X_COND_INIT;
146
147	unsigned int eio_nreqs (void)	274	static unsigned int etp_nreqs (void)
148	{	275	{
		276	int retval;
		277	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
		278	retval = nreqs;
		279	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
149	return nreqs;	280	return retval;
150	}	281	}
151		282
152	unsigned int eio_nready (void)	283	static unsigned int etp_nready (void)
153	{	284	{
154	unsigned int retval;	285	unsigned int retval;
155		286
156	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);	287	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
157	retval = nready;	288	retval = nready;
158	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);	289	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
159		290
160	return retval;	291	return retval;
161	}	292	}
162		293
163	unsigned int eio_npending (void)	294	static unsigned int etp_npending (void)
164	{	295	{
165	unsigned int retval;	296	unsigned int retval;
166		297
167	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);	298	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
168	retval = npending;	299	retval = npending;
169	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);	300	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
170		301
171	return retval;	302	return retval;
172	}	303	}
173		304
174	unsigned int eio_nthreads (void)	305	static unsigned int etp_nthreads (void)
175	{	306	{
176	unsigned int retval;	307	unsigned int retval;
177		308
178	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);	309	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
179	retval = started;	310	retval = started;
…		…
186	* a somewhat faster data structure might be nice, but	317	* a somewhat faster data structure might be nice, but
187	* with 8 priorities this actually needs <20 insns	318	* with 8 priorities this actually needs <20 insns
188	* per shift, the most expensive operation.	319	* per shift, the most expensive operation.
189	*/	320	*/
190	typedef struct {	321	typedef struct {
191	eio_req *qs[EIO_NUM_PRI], *qe[EIO_NUM_PRI]; /* qstart, qend */	322	ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */
192	int size;	323	int size;
193	} reqq;	324	} etp_reqq;
194		325
195	static reqq req_queue;	326	static etp_reqq req_queue;
196	static reqq res_queue;	327	static etp_reqq res_queue;
197		328
198	static int reqq_push (reqq *q, eio_req *req)	329	static int reqq_push (etp_reqq *q, ETP_REQ *req)
199	{	330	{
200	int pri = req->pri;	331	int pri = req->pri;
201	req->next = 0;	332	req->next = 0;
202		333
203	if (q->qe[pri])	334	if (q->qe[pri])
…		…
209	q->qe[pri] = q->qs[pri] = req;	340	q->qe[pri] = q->qs[pri] = req;
210		341
211	return q->size++;	342	return q->size++;
212	}	343	}
213		344
214	static eio_req *reqq_shift (reqq *q)	345	static ETP_REQ *reqq_shift (etp_reqq *q)
215	{	346	{
216	int pri;	347	int pri;
217		348
218	if (!q->size)	349	if (!q->size)
219	return 0;	350	return 0;
220		351
221	--q->size;	352	--q->size;
222		353
223	for (pri = EIO_NUM_PRI; pri--; )	354	for (pri = ETP_NUM_PRI; pri--; )
224	{	355	{
225	eio_req *req = q->qs[pri];	356	eio_req *req = q->qs[pri];
226		357
227	if (req)	358	if (req)
228	{	359	{
…		…
234	}	365	}
235		366
236	abort ();	367	abort ();
237	}	368	}
238		369
239	static void grp_try_feed (eio_req *grp)	370	static void etp_atfork_prepare (void)
240	{	371	{
241	while (grp->size < grp->int2 && !EIO_CANCELLED (grp))	372	X_LOCK (wrklock);
		373	X_LOCK (reqlock);
		374	X_LOCK (reslock);
		375	#if !HAVE_PREADWRITE
		376	X_LOCK (preadwritelock);
		377	#endif
		378	}
		379
		380	static void etp_atfork_parent (void)
		381	{
		382	#if !HAVE_PREADWRITE
		383	X_UNLOCK (preadwritelock);
		384	#endif
		385	X_UNLOCK (reslock);
		386	X_UNLOCK (reqlock);
		387	X_UNLOCK (wrklock);
		388	}
		389
		390	static void etp_atfork_child (void)
		391	{
		392	ETP_REQ *prv;
		393
		394	while ((prv = reqq_shift (&req_queue)))
		395	ETP_DESTROY (prv);
		396
		397	while ((prv = reqq_shift (&res_queue)))
		398	ETP_DESTROY (prv);
		399
		400	while (wrk_first.next != &wrk_first)
242	{	401	{
243	int old_len = grp->size;	402	etp_worker *wrk = wrk_first.next;
244		403
245	EIO_FEED (grp);	404	if (wrk->req)
		405	ETP_DESTROY (wrk->req);
246		406
247	/* stop if no progress has been made */	407	etp_worker_clear (wrk);
248	if (old_len == grp->size)	408	etp_worker_free (wrk);
249	{
250	grp->feed = 0;
251	break;
252	}
253	}	409	}
254	}
255		410
256	static int eio_finish (eio_req *req);	411	started = 0;
		412	idle = 0;
		413	nreqs = 0;
		414	nready = 0;
		415	npending = 0;
257		416
258	static int grp_dec (eio_req *grp)	417	etp_atfork_parent ();
259	{	418	}
260	--grp->size;
261		419
262	/* call feeder, if applicable */	420	static void
263	grp_try_feed (grp);	421	etp_once_init (void)
		422	{
		423	X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child);
		424	}
264		425
265	/* finish, if done */	426	static int
266	if (!grp->size && grp->int1)	427	etp_init (void (*want_poll)(void), void (*done_poll)(void))
267	return eio_finish (grp);	428	{
268	else	429	static pthread_once_t doinit = PTHREAD_ONCE_INIT;
		430
		431	pthread_once (&doinit, etp_once_init);
		432
		433	want_poll_cb = want_poll;
		434	done_poll_cb = done_poll;
		435
269	return 0;	436	return 0;
270	}	437	}
271		438
272	void eio_destroy (eio_req *req)
273	{
274	if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1);
275	if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
276
277	EIO_DESTROY (req);
278	}
279
280	static int eio_finish (eio_req *req)
281	{
282	int res = EIO_FINISH (req);
283
284	if (req->grp)
285	{
286	int res2;
287	eio_req *grp = req->grp;
288
289	/* unlink request */
290	if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
291	if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
292
293	if (grp->grp_first == req)
294	grp->grp_first = req->grp_next;
295
296	res2 = grp_dec (grp);
297
298	if (!res && res2)
299	res = res2;
300	}
301
302	eio_destroy (req);
303
304	return res;
305	}
306
307	void eio_grp_cancel (eio_req *grp)
308	{
309	for (grp = grp->grp_first; grp; grp = grp->grp_next)
310	eio_cancel (grp);
311	}
312
313	void eio_cancel (eio_req *req)
314	{
315	X_LOCK (wrklock);
316	req->flags |= EIO_FLAG_CANCELLED;
317	X_UNLOCK (wrklock);
318
319	eio_grp_cancel (req);
320	}
321
322	X_THREAD_PROC (eio_proc);	439	X_THREAD_PROC (etp_proc);
323		440
324	static void start_thread (void)	441	static void etp_start_thread (void)
325	{	442	{
326	worker *wrk = calloc (1, sizeof (worker));	443	etp_worker *wrk = calloc (1, sizeof (etp_worker));
327		444
328	/*TODO*/	445	/*TODO*/
329	assert (("unable to allocate worker thread data", wrk));	446	assert (("unable to allocate worker thread data", wrk));
330		447
331	X_LOCK (wrklock);	448	X_LOCK (wrklock);
332		449
333	if (thread_create (&wrk->tid, eio_proc, (void *)wrk))	450	if (thread_create (&wrk->tid, etp_proc, (void *)wrk))
334	{	451	{
335	wrk->prev = &wrk_first;	452	wrk->prev = &wrk_first;
336	wrk->next = wrk_first.next;	453	wrk->next = wrk_first.next;
337	wrk_first.next->prev = wrk;	454	wrk_first.next->prev = wrk;
338	wrk_first.next = wrk;	455	wrk_first.next = wrk;
…		…
342	free (wrk);	459	free (wrk);
343		460
344	X_UNLOCK (wrklock);	461	X_UNLOCK (wrklock);
345	}	462	}
346		463
347	static void maybe_start_thread (void)	464	static void etp_maybe_start_thread (void)
348	{	465	{
349	if (eio_nthreads () >= wanted)	466	if (expect_true (etp_nthreads () >= wanted))
350	return;	467	return;
351		468
352	/* todo: maybe use idle here, but might be less exact */	469	/* todo: maybe use idle here, but might be less exact */
353	if (0 <= (int)eio_nthreads () + (int)eio_npending () - (int)eio_nreqs ())	470	if (expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ()))
354	return;	471	return;
355		472
356	start_thread ();	473	etp_start_thread ();
357	}	474	}
358		475
359	void eio_submit (eio_req *req)
360	{
361	++nreqs;
362
363	X_LOCK (reqlock);
364	++nready;
365	reqq_push (&req_queue, req);
366	X_COND_SIGNAL (reqwait);
367	X_UNLOCK (reqlock);
368
369	maybe_start_thread ();
370	}
371
372	static void end_thread (void)	476	static void etp_end_thread (void)
373	{	477	{
374	eio_req *req = calloc (1, sizeof (eio_req));	478	eio_req *req = calloc (1, sizeof (eio_req));
375		479
376	req->type = EIO_QUIT;	480	req->type = -1;
377	req->pri = EIO_PRI_MAX + EIO_PRI_BIAS;	481	req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
378		482
379	X_LOCK (reqlock);	483	X_LOCK (reqlock);
380	reqq_push (&req_queue, req);	484	reqq_push (&req_queue, req);
381	X_COND_SIGNAL (reqwait);	485	X_COND_SIGNAL (reqwait);
382	X_UNLOCK (reqlock);	486	X_UNLOCK (reqlock);
…		…
384	X_LOCK (wrklock);	488	X_LOCK (wrklock);
385	--started;	489	--started;
386	X_UNLOCK (wrklock);	490	X_UNLOCK (wrklock);
387	}	491	}
388		492
389	void eio_set_max_poll_time (double nseconds)
390	{
391	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
392	max_poll_time = nseconds;
393	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
394	}
395
396	void eio_set_max_poll_reqs (unsigned int maxreqs)
397	{
398	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
399	max_poll_reqs = maxreqs;
400	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
401	}
402
403	void eio_set_max_idle (unsigned int nthreads)
404	{
405	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
406	max_idle = nthreads <= 0 ? 1 : nthreads;
407	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
408	}
409
410	void eio_set_min_parallel (unsigned int nthreads)
411	{
412	if (wanted < nthreads)
413	wanted = nthreads;
414	}
415
416	void eio_set_max_parallel (unsigned int nthreads)
417	{
418	if (wanted > nthreads)
419	wanted = nthreads;
420
421	while (started > wanted)
422	end_thread ();
423	}
424
425	int eio_poll (void)	493	static int etp_poll (void)
426	{	494	{
427	int maxreqs = max_poll_reqs;	495	unsigned int maxreqs;
		496	unsigned int maxtime;
428	struct timeval tv_start, tv_now;	497	struct timeval tv_start, tv_now;
429	eio_req *req;
430		498
		499	X_LOCK (reslock);
		500	maxreqs = max_poll_reqs;
		501	maxtime = max_poll_time;
		502	X_UNLOCK (reslock);
		503
431	if (max_poll_time)	504	if (maxtime)
432	gettimeofday (&tv_start, 0);	505	gettimeofday (&tv_start, 0);
433		506
434	for (;;)	507	for (;;)
435	{	508	{
		509	ETP_REQ *req;
		510
436	maybe_start_thread ();	511	etp_maybe_start_thread ();
437		512
438	X_LOCK (reslock);	513	X_LOCK (reslock);
439	req = reqq_shift (&res_queue);	514	req = reqq_shift (&res_queue);
440		515
441	if (req)	516	if (req)
…		…
449	X_UNLOCK (reslock);	524	X_UNLOCK (reslock);
450		525
451	if (!req)	526	if (!req)
452	return 0;	527	return 0;
453		528
		529	X_LOCK (reqlock);
454	--nreqs;	530	--nreqs;
		531	X_UNLOCK (reqlock);
455		532
456	if (req->type == EIO_GROUP && req->size)	533	if (expect_false (req->type == EIO_GROUP && req->size))
457	{	534	{
458	req->int1 = 1; /* mark request as delayed */	535	req->int1 = 1; /* mark request as delayed */
459	continue;	536	continue;
460	}	537	}
461	else	538	else
462	{	539	{
463	int res = eio_finish (req);	540	int res = ETP_FINISH (req);
464	if (res)	541	if (expect_false (res))
465	return res;	542	return res;
466	}	543	}
467		544
468	if (maxreqs && !--maxreqs)	545	if (expect_false (maxreqs && !--maxreqs))
469	break;	546	break;
470		547
471	if (max_poll_time)	548	if (maxtime)
472	{	549	{
473	gettimeofday (&tv_now, 0);	550	gettimeofday (&tv_now, 0);
474		551
475	if (tvdiff (&tv_start, &tv_now) >= max_poll_time)	552	if (tvdiff (&tv_start, &tv_now) >= maxtime)
476	break;	553	break;
477	}	554	}
478	}	555	}
479		556
480	errno = EAGAIN;	557	errno = EAGAIN;
481	return -1;	558	return -1;
482	}	559	}
483		560
		561	static void etp_cancel (ETP_REQ *req)
		562	{
		563	X_LOCK (wrklock);
		564	req->flags |= EIO_FLAG_CANCELLED;
		565	X_UNLOCK (wrklock);
		566
		567	eio_grp_cancel (req);
		568	}
		569
		570	static void etp_submit (ETP_REQ *req)
		571	{
		572	req->pri -= ETP_PRI_MIN;
		573
		574	if (expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN;
		575	if (expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
		576
		577	if (expect_false (req->type == EIO_GROUP))
		578	{
		579	/* I hope this is worth it :/ */
		580	X_LOCK (reqlock);
		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;
		597	++nready;
		598	reqq_push (&req_queue, req);
		599	X_COND_SIGNAL (reqwait);
		600	X_UNLOCK (reqlock);
		601
		602	etp_maybe_start_thread ();
		603	}
		604	}
		605
		606	static void etp_set_max_poll_time (double nseconds)
		607	{
		608	if (WORDACCESS_UNSAFE) X_LOCK (reslock);
		609	max_poll_time = nseconds * EIO_TICKS;
		610	if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
		611	}
		612
		613	static void etp_set_max_poll_reqs (unsigned int maxreqs)
		614	{
		615	if (WORDACCESS_UNSAFE) X_LOCK (reslock);
		616	max_poll_reqs = maxreqs;
		617	if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
		618	}
		619
		620	static void etp_set_max_idle (unsigned int nthreads)
		621	{
		622	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
		623	max_idle = nthreads <= 0 ? 1 : nthreads;
		624	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
		625	}
		626
		627	static void etp_set_min_parallel (unsigned int nthreads)
		628	{
		629	if (wanted < nthreads)
		630	wanted = nthreads;
		631	}
		632
		633	static void etp_set_max_parallel (unsigned int nthreads)
		634	{
		635	if (wanted > nthreads)
		636	wanted = nthreads;
		637
		638	while (started > wanted)
		639	etp_end_thread ();
		640	}
		641
		642	/*****************************************************************************/
		643
		644	static void grp_try_feed (eio_req *grp)
		645	{
		646	while (grp->size < grp->int2 && !EIO_CANCELLED (grp))
		647	{
		648	grp->flags &= ~EIO_FLAG_GROUPADD;
		649
		650	EIO_FEED (grp);
		651
		652	/* stop if no progress has been made */
		653	if (!(grp->flags & EIO_FLAG_GROUPADD))
		654	{
		655	grp->feed = 0;
		656	break;
		657	}
		658	}
		659	}
		660
		661	static int grp_dec (eio_req *grp)
		662	{
		663	--grp->size;
		664
		665	/* call feeder, if applicable */
		666	grp_try_feed (grp);
		667
		668	/* finish, if done */
		669	if (!grp->size && grp->int1)
		670	return eio_finish (grp);
		671	else
		672	return 0;
		673	}
		674
		675	void eio_destroy (eio_req *req)
		676	{
		677	if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1);
		678	if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
		679
		680	EIO_DESTROY (req);
		681	}
		682
		683	static int eio_finish (eio_req *req)
		684	{
		685	int res = EIO_FINISH (req);
		686
		687	if (req->grp)
		688	{
		689	int res2;
		690	eio_req *grp = req->grp;
		691
		692	/* unlink request */
		693	if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
		694	if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
		695
		696	if (grp->grp_first == req)
		697	grp->grp_first = req->grp_next;
		698
		699	res2 = grp_dec (grp);
		700
		701	if (!res && res2)
		702	res = res2;
		703	}
		704
		705	eio_destroy (req);
		706
		707	return res;
		708	}
		709
		710	void eio_grp_cancel (eio_req *grp)
		711	{
		712	for (grp = grp->grp_first; grp; grp = grp->grp_next)
		713	eio_cancel (grp);
		714	}
		715
		716	void eio_cancel (eio_req *req)
		717	{
		718	etp_cancel (req);
		719	}
		720
		721	void eio_submit (eio_req *req)
		722	{
		723	etp_submit (req);
		724	}
		725
		726	unsigned int eio_nreqs (void)
		727	{
		728	return etp_nreqs ();
		729	}
		730
		731	unsigned int eio_nready (void)
		732	{
		733	return etp_nready ();
		734	}
		735
		736	unsigned int eio_npending (void)
		737	{
		738	return etp_npending ();
		739	}
		740
		741	unsigned int eio_nthreads (void)
		742	{
		743	return etp_nthreads ();
		744	}
		745
		746	void eio_set_max_poll_time (double nseconds)
		747	{
		748	etp_set_max_poll_time (nseconds);
		749	}
		750
		751	void eio_set_max_poll_reqs (unsigned int maxreqs)
		752	{
		753	etp_set_max_poll_reqs (maxreqs);
		754	}
		755
		756	void eio_set_max_idle (unsigned int nthreads)
		757	{
		758	etp_set_max_idle (nthreads);
		759	}
		760
		761	void eio_set_min_parallel (unsigned int nthreads)
		762	{
		763	etp_set_min_parallel (nthreads);
		764	}
		765
		766	void eio_set_max_parallel (unsigned int nthreads)
		767	{
		768	etp_set_max_parallel (nthreads);
		769	}
		770
		771	int eio_poll (void)
		772	{
		773	return etp_poll ();
		774	}
		775
484	/*****************************************************************************/	776	/*****************************************************************************/
485	/* work around various missing functions */	777	/* work around various missing functions */
486		778
487	#if !HAVE_PREADWRITE	779	#if !HAVE_PREADWRITE
		780	# undef pread
		781	# undef pwrite
488	# define pread eio__pread	782	# define pread eio__pread
489	# define pwrite eio__pwrite	783	# define pwrite eio__pwrite
490
491	/*
492	* make our pread/pwrite safe against themselves, but not against
493	* normal read/write by using a mutex. slows down execution a lot,
494	* but that's your problem, not mine.
495	*/
496	static mutex_t preadwritelock = X_MUTEX_INIT;
497		784
498	static ssize_t	785	static ssize_t
499	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)
500	{	787	{
501	ssize_t res;	788	ssize_t res;
…		…
519		806
520	X_LOCK (preadwritelock);	807	X_LOCK (preadwritelock);
521	ooffset = lseek (fd, 0, SEEK_CUR);	808	ooffset = lseek (fd, 0, SEEK_CUR);
522	lseek (fd, offset, SEEK_SET);	809	lseek (fd, offset, SEEK_SET);
523	res = write (fd, buf, count);	810	res = write (fd, buf, count);
524	lseek (fd, offset, SEEK_SET);	811	lseek (fd, ooffset, SEEK_SET);
525	X_UNLOCK (preadwritelock);	812	X_UNLOCK (preadwritelock);
526		813
527	return res;	814	return res;
528	}	815	}
529	#endif	816	#endif
530		817
531	#ifndef HAVE_FUTIMES	818	#ifndef HAVE_FUTIMES
532		819
		820	# undef utimes
		821	# undef futimes
533	# define utimes(path,times) eio__utimes (path, times)	822	# define utimes(path,times) eio__utimes (path, times)
534	# define futimes(fd,times) eio__futimes (fd, times)	823	# define futimes(fd,times) eio__futimes (fd, times)
535		824
536	static int	825	static int
537	eio__utimes (const char *filename, const struct timeval times[2])	826	eio__utimes (const char *filename, const struct timeval times[2])
…		…
556	}	845	}
557		846
558	#endif	847	#endif
559		848
560	#if !HAVE_FDATASYNC	849	#if !HAVE_FDATASYNC
		850	# undef fdatasync
561	# define fdatasync fsync	851	# define fdatasync(fd) fsync (fd)
562	#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	}
563		881
564	#if !HAVE_READAHEAD	882	#if !HAVE_READAHEAD
		883	# undef readahead
565	# define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)	884	# define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)
566		885
567	static ssize_t	886	static ssize_t
568	eio__readahead (int fd, off_t offset, size_t count, worker *self)	887	eio__readahead (int fd, off_t offset, size_t count, etp_worker *self)
569	{	888	{
570	size_t todo = count;	889	size_t todo = count;
571	dBUF;	890	dBUF;
572		891
573	while (todo > 0)	892	while (todo > 0)
…		…
583	return count;	902	return count;
584	}	903	}
585		904
586	#endif	905	#endif
587		906
588	#if !HAVE_READDIR_R
589	# define readdir_r eio__readdir_r
590
591	static mutex_t readdirlock = X_MUTEX_INIT;
592
593	static int
594	eio__readdir_r (DIR *dirp, EIO_STRUCT_DIRENT *ent, EIO_STRUCT_DIRENT **res)
595	{
596	EIO_STRUCT_DIRENT *e;
597	int errorno;
598
599	X_LOCK (readdirlock);
600
601	e = readdir (dirp);
602	errorno = errno;
603
604	if (e)
605	{
606	*res = ent;
607	strcpy (ent->d_name, e->d_name);
608	}
609	else
610	*res = 0;
611
612	X_UNLOCK (readdirlock);
613
614	errno = errorno;
615	return e ? 0 : -1;
616	}
617	#endif
618
619	/* sendfile always needs emulation */	907	/* sendfile always needs emulation */
620	static ssize_t	908	static ssize_t
621	eio__sendfile (int ofd, int ifd, off_t offset, size_t count, worker *self)	909	eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self)
622	{	910	{
623	ssize_t res;	911	ssize_t res;
624		912
625	if (!count)	913	if (!count)
626	return 0;	914	return 0;
627		915
628	#if HAVE_SENDFILE	916	#if HAVE_SENDFILE
629	# if __linux	917	# if __linux
630	res = sendfile (ofd, ifd, &offset, count);	918	res = sendfile (ofd, ifd, &offset, count);
631		919
632	# elif __freebsd	920	# elif __FreeBSD__
633	/*	921	/*
634	* 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
635	* wasted on making it similar to other I/O functions.	923	* wasted on making it similar to other I/O functions.
636	*/	924	*/
637	{	925	{
638	off_t sbytes;	926	off_t sbytes;
639	res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);	927	res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
640		928
641	if (res < 0 && sbytes)	929	#if 0 /* according to the manpage, this is correct, but broken behaviour */
642	/* 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)
643	res = sbytes;	950	res = sbytes;
644	}	951	}
645		952
646	# elif __hpux	953	# elif __hpux
647	res = sendfile (ofd, ifd, offset, count, 0, 0);	954	res = sendfile (ofd, ifd, offset, count, 0, 0);
…		…
661	if (res < 0 && sbytes)	968	if (res < 0 && sbytes)
662	res = sbytes;	969	res = sbytes;
663	}	970	}
664		971
665	# 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
666	#else	983	#else
667	res = -1;	984	res = -1;
668	errno = ENOSYS;	985	errno = ENOSYS;
669	#endif	986	#endif
670		987
671	if (res < 0	988	if (res < 0
672	&& (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 */
673	#if __solaris	995	#if __solaris
674	|| errno == EAFNOSUPPORT || errno == EPROTOTYPE	996	|| errno == EAFNOSUPPORT || errno == EPROTOTYPE
675	#endif	997	#endif
676	)	998	)
677	)	999	)
…		…
708	}	1030	}
709		1031
710	return res;	1032	return res;
711	}	1033	}
712		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
713	/* read a full directory */	1198	/* read a full directory */
714	static void	1199	static void
715	eio__scandir (eio_req *req, worker *self)	1200	eio__scandir (eio_req *req, etp_worker *self)
716	{	1201	{
717	DIR *dirp;	1202	DIR *dirp;
718	union
719	{
720	EIO_STRUCT_DIRENT d;
721	char b [offsetof (EIO_STRUCT_DIRENT, d_name) + NAME_MAX + 1];
722	} *u;
723	EIO_STRUCT_DIRENT *entp;	1203	EIO_STRUCT_DIRENT *entp;
724	char *name, *names;	1204	char *name, *names;
725	int memlen = 4096;	1205	int namesalloc = 4096;
726	int memofs = 0;	1206	int namesoffs = 0;
		1207	int flags = req->int1;
		1208	eio_dirent *dents = 0;
		1209	int dentalloc = 128;
727	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);
728		1217
729	X_LOCK (wrklock);	1218	X_LOCK (wrklock);
		1219	/* the corresponding closedir is in ETP_WORKER_CLEAR */
730	self->dirp = dirp = opendir (req->ptr1);	1220	self->dirp = dirp = opendir (req->ptr1);
731	self->dbuf = u = malloc (sizeof (*u));
732	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;
733	req->ptr2 = names = malloc (memlen);	1223	req->ptr2 = names = malloc (namesalloc);
734	X_UNLOCK (wrklock);	1224	X_UNLOCK (wrklock);
735		1225
736	if (dirp && u && names)	1226	if (dirp && names && (!flags || dents))
737	for (;;)	1227	for (;;)
738	{	1228	{
739	errno = 0;	1229	errno = 0;
740	readdir_r (dirp, &u->d, &entp);	1230	entp = readdir (dirp);
741		1231
742	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
743	break;	1271	break;
		1272	}
744		1273
		1274	/* now add the entry to our list(s) */
745	name = entp->d_name;	1275	name = entp->d_name;
746		1276
		1277	/* skip . and .. entries */
747	if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))	1278	if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
748	{	1279	{
749	int len = strlen (name) + 1;	1280	int len = D_NAMLEN (entp) + 1;
750		1281
751	res++;	1282	while (expect_false (namesoffs + len > namesalloc))
752
753	while (memofs + len > memlen)
754	{	1283	{
755	memlen *= 2;	1284	namesalloc *= 2;
756	X_LOCK (wrklock);	1285	X_LOCK (wrklock);
757	req->ptr2 = names = realloc (names, memlen);	1286	req->ptr2 = names = realloc (names, namesalloc);
758	X_UNLOCK (wrklock);	1287	X_UNLOCK (wrklock);
759		1288
760	if (!names)	1289	if (!names)
761	break;	1290	break;
762	}	1291	}
763		1292
764	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
765	memofs += len;	1385	namesoffs += len;
		1386	++dentoffs;
		1387	}
		1388
		1389	if (EIO_CANCELLED (req))
		1390	{
		1391	errno = ECANCELED;
		1392	break;
766	}	1393	}
767	}	1394	}
		1395	}
768		1396
769	if (errno)	1397	#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
770	res = -1;	1398	# define eio__msync(a,b,c) ((errno = ENOSYS), -1)
771		1399	#else
772	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;
773	}	1443	}
774		1444
775	/*****************************************************************************/	1445	/*****************************************************************************/
776		1446
777	#define ALLOC(len) \	1447	#define ALLOC(len) \
…		…
787	req->result = -1; \	1457	req->result = -1; \
788	break; \	1458	break; \
789	} \	1459	} \
790	}	1460	}
791		1461
792	X_THREAD_PROC (eio_proc)	1462	X_THREAD_PROC (etp_proc)
793	{	1463	{
794	eio_req *req;	1464	ETP_REQ *req;
795	struct timespec ts;	1465	struct timespec ts;
796	worker *self = (worker *)thr_arg;	1466	etp_worker *self = (etp_worker *)thr_arg;
797		1467
798	/* try to distribute timeouts somewhat randomly */	1468	/* try to distribute timeouts somewhat randomly */
799	ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);	1469	ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
800		1470
801	for (;;)	1471	for (;;)
802	{	1472	{
803	ts.tv_sec = time (0) + IDLE_TIMEOUT;
804
805	X_LOCK (reqlock);	1473	X_LOCK (reqlock);
806		1474
807	for (;;)	1475	for (;;)
808	{	1476	{
809	self->req = req = reqq_shift (&req_queue);	1477	self->req = req = reqq_shift (&req_queue);
…		…
811	if (req)	1479	if (req)
812	break;	1480	break;
813		1481
814	++idle;	1482	++idle;
815		1483
		1484	ts.tv_sec = time (0) + IDLE_TIMEOUT;
816	if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)	1485	if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
817	{	1486	{
818	if (idle > max_idle)	1487	if (idle > max_idle)
819	{	1488	{
820	--idle;	1489	--idle;
…		…
825	goto quit;	1494	goto quit;
826	}	1495	}
827		1496
828	/* we are allowed to idle, so do so without any timeout */	1497	/* we are allowed to idle, so do so without any timeout */
829	X_COND_WAIT (reqwait, reqlock);	1498	X_COND_WAIT (reqwait, reqlock);
830	ts.tv_sec = time (0) + IDLE_TIMEOUT;
831	}	1499	}
832		1500
833	--idle;	1501	--idle;
834	}	1502	}
835		1503
836	--nready;	1504	--nready;
837		1505
838	X_UNLOCK (reqlock);	1506	X_UNLOCK (reqlock);
839		1507
840	errno = 0; /* strictly unnecessary */	1508	if (req->type < 0)
		1509	goto quit;
841		1510
842	if (!EIO_CANCELLED (req))	1511	if (!EIO_CANCELLED (req))
843	switch (req->type)	1512	ETP_EXECUTE (self, req);
844	{
845	case EIO_READ: ALLOC (req->size);
846	req->result = req->offs >= 0
847	? pread (req->int1, req->ptr2, req->size, req->offs)
848	: read (req->int1, req->ptr2, req->size); break;
849	case EIO_WRITE: req->result = req->offs >= 0
850	? pwrite (req->int1, req->ptr2, req->size, req->offs)
851	: write (req->int1, req->ptr2, req->size); break;
852
853	case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
854	case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break;
855
856	case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
857	req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
858	case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
859	req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
860	case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
861	req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
862
863	case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
864	case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
865	case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
866	case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
867	case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
868	case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
869
870	case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
871	case EIO_CLOSE: req->result = close (req->int1); break;
872	case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
873	case EIO_UNLINK: req->result = unlink (req->ptr1); break;
874	case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
875	case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
876	case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
877	case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
878	case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
879	case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
880
881	case EIO_READLINK: ALLOC (NAME_MAX);
882	req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break;
883
884	case EIO_SYNC: req->result = 0; sync (); break;
885	case EIO_FSYNC: req->result = fsync (req->int1); break;
886	case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
887
888	case EIO_READDIR: eio__scandir (req, self); break;
889
890	case EIO_BUSY:
891	#ifdef _WIN32
892	Sleep (req->nv1 * 1000.);
893	#else
894	{
895	struct timeval tv;
896
897	tv.tv_sec = req->nv1;
898	tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.;
899
900	req->result = select (0, 0, 0, 0, &tv);
901	}
902	#endif
903	break;
904
905	case EIO_UTIME:
906	case EIO_FUTIME:
907	{
908	struct timeval tv[2];
909	struct timeval *times;
910
911	if (req->nv1 != -1. || req->nv2 != -1.)
912	{
913	tv[0].tv_sec = req->nv1;
914	tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
915	tv[1].tv_sec = req->nv2;
916	tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
917
918	times = tv;
919	}
920	else
921	times = 0;
922
923
924	req->result = req->type == EIO_FUTIME
925	? futimes (req->int1, times)
926	: utimes (req->ptr1, times);
927	}
928
929	case EIO_GROUP:
930	case EIO_NOP:
931	req->result = 0;
932	break;
933
934	case EIO_QUIT:
935	goto quit;
936
937	default:
938	req->result = -1;
939	break;
940	}
941
942	req->errorno = errno;
943		1513
944	X_LOCK (reslock);	1514	X_LOCK (reslock);
945		1515
946	++npending;	1516	++npending;
947		1517
948	if (!reqq_push (&res_queue, req) && want_poll_cb)	1518	if (!reqq_push (&res_queue, req) && want_poll_cb)
949	want_poll_cb ();	1519	want_poll_cb ();
950		1520
951	self->req = 0;	1521	self->req = 0;
952	worker_clear (self);	1522	etp_worker_clear (self);
953		1523
954	X_UNLOCK (reslock);	1524	X_UNLOCK (reslock);
955	}	1525	}
956		1526
957	quit:	1527	quit:
958	X_LOCK (wrklock);	1528	X_LOCK (wrklock);
959	worker_free (self);	1529	etp_worker_free (self);
960	X_UNLOCK (wrklock);	1530	X_UNLOCK (wrklock);
961		1531
962	return 0;	1532	return 0;
963	}	1533	}
964		1534
965	/*****************************************************************************/	1535	/*****************************************************************************/
966		1536
967	static void eio_atfork_prepare (void)
968	{
969	X_LOCK (wrklock);
970	X_LOCK (reqlock);
971	X_LOCK (reslock);
972	#if !HAVE_PREADWRITE
973	X_LOCK (preadwritelock);
974	#endif
975	#if !HAVE_READDIR_R
976	X_LOCK (readdirlock);
977	#endif
978	}
979
980	static void eio_atfork_parent (void)
981	{
982	#if !HAVE_READDIR_R
983	X_UNLOCK (readdirlock);
984	#endif
985	#if !HAVE_PREADWRITE
986	X_UNLOCK (preadwritelock);
987	#endif
988	X_UNLOCK (reslock);
989	X_UNLOCK (reqlock);
990	X_UNLOCK (wrklock);
991	}
992
993	static void eio_atfork_child (void)
994	{
995	eio_req *prv;
996
997	while (prv = reqq_shift (&req_queue))
998	eio_destroy (prv);
999
1000	while (prv = reqq_shift (&res_queue))
1001	eio_destroy (prv);
1002
1003	while (wrk_first.next != &wrk_first)
1004	{
1005	worker *wrk = wrk_first.next;
1006
1007	if (wrk->req)
1008	eio_destroy (wrk->req);
1009
1010	worker_clear (wrk);
1011	worker_free (wrk);
1012	}
1013
1014	started = 0;
1015	idle = 0;
1016	nreqs = 0;
1017	nready = 0;
1018	npending = 0;
1019
1020	eio_atfork_parent ();
1021	}
1022
1023	int eio_init (void (*want_poll)(void), void (*done_poll)(void))	1537	int eio_init (void (*want_poll)(void), void (*done_poll)(void))
1024	{	1538	{
1025	want_poll_cb = want_poll;	1539	return etp_init (want_poll, done_poll);
1026	done_poll_cb = done_poll;
1027
1028	#ifdef _WIN32
1029	X_MUTEX_CHECK (wrklock);
1030	X_MUTEX_CHECK (reslock);
1031	X_MUTEX_CHECK (reqlock);
1032	X_MUTEX_CHECK (reqwait);
1033	X_MUTEX_CHECK (preadwritelock);
1034	X_MUTEX_CHECK (readdirlock);
1035
1036	X_COND_CHECK (reqwait);
1037	#endif
1038
1039	X_THREAD_ATFORK (eio_atfork_prepare, eio_atfork_parent, eio_atfork_child);
1040	}	1540	}
1041		1541
1042	static void eio_api_destroy (eio_req *req)	1542	static void eio_api_destroy (eio_req *req)
1043	{	1543	{
1044	free (req);	1544	free (req);
…		…
1049	\	1549	\
1050	req = (eio_req *)calloc (1, sizeof *req); \	1550	req = (eio_req *)calloc (1, sizeof *req); \
1051	if (!req) \	1551	if (!req) \
1052	return 0; \	1552	return 0; \
1053	\	1553	\
1054	req->type = rtype; \	1554	req->type = rtype; \
1055	req->pri = EIO_DEFAULT_PRI + EIO_PRI_BIAS; \	1555	req->pri = pri; \
1056	req->finish = cb; \	1556	req->finish = cb; \
		1557	req->data = data; \
1057	req->destroy = eio_api_destroy;	1558	req->destroy = eio_api_destroy;
1058		1559
1059	#define SEND eio_submit (req); return req	1560	#define SEND eio_submit (req); return req
1060		1561
1061	#define PATH \	1562	#define PATH \
…		…
1065	{ \	1566	{ \
1066	eio_api_destroy (req); \	1567	eio_api_destroy (req); \
1067	return 0; \	1568	return 0; \
1068	}	1569	}
1069		1570
		1571	static void eio_execute (etp_worker *self, eio_req *req)
		1572	{
		1573	errno = 0;
		1574
		1575	switch (req->type)
		1576	{
		1577	case EIO_READ: ALLOC (req->size);
		1578	req->result = req->offs >= 0
		1579	? pread (req->int1, req->ptr2, req->size, req->offs)
		1580	: read (req->int1, req->ptr2, req->size); break;
		1581	case EIO_WRITE: req->result = req->offs >= 0
		1582	? pwrite (req->int1, req->ptr2, req->size, req->offs)
		1583	: write (req->int1, req->ptr2, req->size); break;
		1584
		1585	case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
		1586	case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break;
		1587
		1588	case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
		1589	req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
		1590	case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
		1591	req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
		1592	case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
		1593	req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
		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
		1600	case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
		1601	case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
		1602	case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
		1603	case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
		1604	case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
		1605	case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
		1606
		1607	case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
		1608	case EIO_CLOSE: req->result = close (req->int1); break;
		1609	case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
		1610	case EIO_UNLINK: req->result = unlink (req->ptr1); break;
		1611	case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
		1612	case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
		1613	case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
		1614	case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
		1615	case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
		1616	case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break;
		1617
		1618	case EIO_READLINK: ALLOC (PATH_MAX);
		1619	req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break;
		1620
		1621	case EIO_SYNC: req->result = 0; sync (); break;
		1622	case EIO_FSYNC: req->result = fsync (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;
		1627
		1628	case EIO_READDIR: eio__scandir (req, self); break;
		1629
		1630	case EIO_BUSY:
		1631	#ifdef _WIN32
		1632	Sleep (req->nv1 * 1000.);
		1633	#else
		1634	{
		1635	struct timeval tv;
		1636
		1637	tv.tv_sec = req->nv1;
		1638	tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.;
		1639
		1640	req->result = select (0, 0, 0, 0, &tv);
		1641	}
		1642	#endif
		1643	break;
		1644
		1645	case EIO_UTIME:
		1646	case EIO_FUTIME:
		1647	{
		1648	struct timeval tv[2];
		1649	struct timeval *times;
		1650
		1651	if (req->nv1 != -1. || req->nv2 != -1.)
		1652	{
		1653	tv[0].tv_sec = req->nv1;
		1654	tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
		1655	tv[1].tv_sec = req->nv2;
		1656	tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
		1657
		1658	times = tv;
		1659	}
		1660	else
		1661	times = 0;
		1662
		1663
		1664	req->result = req->type == EIO_FUTIME
		1665	? futimes (req->int1, times)
		1666	: utimes (req->ptr1, times);
		1667	}
		1668	break;
		1669
		1670	case EIO_GROUP:
		1671	abort (); /* handled in eio_request */
		1672
		1673	case EIO_NOP:
		1674	req->result = 0;
		1675	break;
		1676
		1677	case EIO_CUSTOM:
		1678	((void (*)(eio_req *))req->feed) (req);
		1679	break;
		1680
		1681	default:
		1682	req->result = -1;
		1683	break;
		1684	}
		1685
		1686	req->errorno = errno;
		1687	}
		1688
		1689	#ifndef EIO_NO_WRAPPERS
		1690
1070	eio_req *eio_nop (int pri, eio_cb cb, void *data)	1691	eio_req *eio_nop (int pri, eio_cb cb, void *data)
1071	{	1692	{
1072	REQ (EIO_NOP); SEND;	1693	REQ (EIO_NOP); SEND;
1073	}	1694	}
1074		1695
…		…
1085	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)
1086	{	1707	{
1087	REQ (EIO_FSYNC); req->int1 = fd; SEND;	1708	REQ (EIO_FSYNC); req->int1 = fd; SEND;
1088	}	1709	}
1089		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
1090	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)
1091	{	1727	{
1092	REQ (EIO_FDATASYNC); req->int1 = fd; SEND;	1728	REQ (EIO_FDATASYNC); req->int1 = fd; SEND;
1093	}	1729	}
1094		1730
…		…
1113	}	1749	}
1114		1750
1115	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)
1116	{	1752	{
1117	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;
1118	}	1759	}
1119		1760
1120	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)
1121	{	1762	{
1122	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;
…		…
1196	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)
1197	{	1838	{
1198	return eio__1path (EIO_LSTAT, path, pri, cb, data);	1839	return eio__1path (EIO_LSTAT, path, pri, cb, data);
1199	}	1840	}
1200		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
1201	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)
1202	{	1848	{
1203	return eio__1path (EIO_UNLINK, path, pri, cb, data);	1849	return eio__1path (EIO_UNLINK, path, pri, cb, data);
1204	}	1850	}
1205		1851
1206	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)
1207	{	1853	{
1208	return eio__1path (EIO_RMDIR, path, pri, cb, data);	1854	return eio__1path (EIO_RMDIR, path, pri, cb, data);
1209	}	1855	}
1210		1856
1211	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)
1212	{	1858	{
1213	return eio__1path (EIO_READDIR, path, pri, cb, data);	1859	REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
1214	}	1860	}
1215		1861
1216	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)
1217	{	1863	{
1218	REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int2 = (long)dev; SEND;	1864	REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND;
1219	}	1865	}
1220		1866
1221	static eio_req *	1867	static eio_req *
1222	eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)	1868	eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1223	{	1869	{
…		…
1247	eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)	1893	eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1248	{	1894	{
1249	return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);	1895	return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
1250	}	1896	}
1251		1897
		1898	eio_req *eio_custom (eio_cb execute, int pri, eio_cb cb, void *data)
		1899	{
		1900	REQ (EIO_CUSTOM); req->feed = (void (*)(eio_req *))execute; SEND;
		1901	}
		1902
		1903	#endif
		1904
1252	eio_req *eio_grp (eio_cb cb, void *data)	1905	eio_req *eio_grp (eio_cb cb, void *data)
1253	{	1906	{
1254	const int pri = EIO_PRI_MAX;	1907	const int pri = EIO_PRI_MAX;
1255		1908
1256	REQ (EIO_GROUP); SEND;	1909	REQ (EIO_GROUP); SEND;
…		…
1280		1933
1281	void eio_grp_add (eio_req *grp, eio_req *req)	1934	void eio_grp_add (eio_req *grp, eio_req *req)
1282	{	1935	{
1283	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));
1284		1937
		1938	grp->flags |= EIO_FLAG_GROUPADD;
		1939
1285	++grp->size;	1940	++grp->size;
1286	req->grp = grp;	1941	req->grp = grp;
1287		1942
1288	req->grp_prev = 0;	1943	req->grp_prev = 0;
1289	req->grp_next = grp->grp_first;	1944	req->grp_next = grp->grp_first;
…		…
1297	/*****************************************************************************/	1952	/*****************************************************************************/
1298	/* misc garbage */	1953	/* misc garbage */
1299		1954
1300	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)
1301	{	1956	{
1302	worker wrk;	1957	etp_worker wrk;
		1958	ssize_t ret;
1303		1959
1304	wrk.dbuf = 0;	1960	wrk.dbuf = 0;
1305		1961
1306	eio__sendfile (ofd, ifd, offset, count, &wrk);	1962	ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
1307		1963
1308	if (wrk.dbuf)	1964	if (wrk.dbuf)
1309	free (wrk.dbuf);	1965	free (wrk.dbuf);
1310	}
1311		1966
		1967	return ret;
		1968	}
		1969

Diff Legend

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