ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/libeio/eio.c

Comparing libeio/eio.c (file contents):
Revision 1.99 by root, Tue Jul 26 11:07:08 2011 UTC vs.
Revision 1.132 by root, Sun Sep 7 14:50:00 2014 UTC

1	/*	1	/*
2	* libeio implementation	2	* libeio implementation
3	*	3	*
4	* Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libeio@schmorp.de>	4	* Copyright (c) 2007,2008,2009,2010,2011,2012,2013 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	*
10	* 1. Redistributions of source code must retain the above copyright notice,	10	* 1. Redistributions of source code must retain the above copyright notice,
11	* this list of conditions and the following disclaimer.	11	* this list of conditions and the following disclaimer.
12	*	12	*
13	* 2. Redistributions in binary form must reproduce the above copyright	13	* 2. Redistributions in binary form must reproduce the above copyright
14	* notice, this list of conditions and the following disclaimer in the	14	* notice, this list of conditions and the following disclaimer in the
15	* documentation and/or other materials provided with the distribution.	15	* documentation and/or other materials provided with the distribution.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED	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-	18	* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19	* CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO	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-	20	* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
21	* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,	21	* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
…		…
43		43
44	#include "eio.h"	44	#include "eio.h"
45	#include "ecb.h"	45	#include "ecb.h"
46		46
47	#ifdef EIO_STACKSIZE	47	#ifdef EIO_STACKSIZE
48	# define XTHREAD_STACKSIZE EIO_STACKSIZE	48	# define X_STACKSIZE EIO_STACKSIZE
49	#endif	49	#endif
50	#include "xthread.h"	50	#include "xthread.h"
51		51
52	#include <errno.h>	52	#include <errno.h>
53	#include <stddef.h>	53	#include <stddef.h>
…		…
105	#ifdef _WIN32	105	#ifdef _WIN32
106		106
107	#undef PAGESIZE	107	#undef PAGESIZE
108	#define PAGESIZE 4096 /* GetSystemInfo? */	108	#define PAGESIZE 4096 /* GetSystemInfo? */
109		109
		110	/* TODO: look at how perl does stat (non-sloppy), unlink (ro-files), utime, link */
		111
110	#ifdef EIO_STRUCT_STATI64	112	#ifdef EIO_STRUCT_STATI64
		113	/* look at perl's non-sloppy stat */
111	#define stat(path,buf) _stati64 (path,buf)	114	#define stat(path,buf) _stati64 (path,buf)
112	#define fstat(fd,buf) _fstati64 (fd,buf)	115	#define fstat(fd,buf) _fstati64 (fd,buf)
113	#endif	116	#endif
114	#define lstat(path,buf) stat (path,buf)	117	#define lstat(path,buf) stat (path,buf)
115	#define fsync(fd) (FlushFileBuffers ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd)) ? 0 : EIO_ERRNO (EBADF, -1))	118	#define fsync(fd) (FlushFileBuffers ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd)) ? 0 : EIO_ERRNO (EBADF, -1))
…		…
128	#define mknod(path,mode,dev) EIO_ENOSYS ()	131	#define mknod(path,mode,dev) EIO_ENOSYS ()
129	#define sync() EIO_ENOSYS ()	132	#define sync() EIO_ENOSYS ()
130	#define readlink(path,buf,s) EIO_ENOSYS ()	133	#define readlink(path,buf,s) EIO_ENOSYS ()
131	#define statvfs(path,buf) EIO_ENOSYS ()	134	#define statvfs(path,buf) EIO_ENOSYS ()
132	#define fstatvfs(fd,buf) EIO_ENOSYS ()	135	#define fstatvfs(fd,buf) EIO_ENOSYS ()
		136
		137	#define pread(fd,buf,count,offset) eio__pread (fd, buf, count, offset)
		138	#define pwrite(fd,buf,count,offset) eio__pwrite (fd, buf, count, offset)
		139
		140	#if __GNUC__
		141	typedef long long eio_off_t; /* signed for compatibility to msvc */
		142	#else
		143	typedef __int64 eio_off_t; /* unsigned not supported by msvc */
		144	#endif
		145
		146	static eio_ssize_t
		147	eio__pread (int fd, void *buf, eio_ssize_t count, eio_off_t offset)
		148	{
		149	OVERLAPPED o = { 0 };
		150	DWORD got;
		151
		152	o.Offset = offset;
		153	o.OffsetHigh = offset >> 32;
		154
		155	return ReadFile ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd), buf, count, &got, &o)
		156	? got : -1;
		157	}
		158
		159	static eio_ssize_t
		160	eio__pwrite (int fd, void *buf, eio_ssize_t count, eio_off_t offset)
		161	{
		162	OVERLAPPED o = { 0 };
		163	DWORD got;
		164
		165	o.Offset = offset;
		166	o.OffsetHigh = offset >> 32;
		167
		168	return WriteFile ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd), buf, count, &got, &o)
		169	? got : -1;
		170	}
133		171
134	/* rename() uses MoveFile, which fails to overwrite */	172	/* rename() uses MoveFile, which fails to overwrite */
135	#define rename(old,neu) eio__rename (old, neu)	173	#define rename(old,neu) eio__rename (old, neu)
136		174
137	static int	175	static int
…		…
175	#endif	213	#endif
176		214
177	return EIO_ERRNO (ENOENT, -1);	215	return EIO_ERRNO (ENOENT, -1);
178	}	216	}
179		217
180	/* POSIX API only */	218	/* POSIX API only, causing trouble for win32 apps */
181	#define CreateHardLink(neu,old,flags) 0	219	#define CreateHardLink(neu,old,flags) 0 /* not really creating hardlink, still using relative paths? */
182	#define CreateSymbolicLink(neu,old,flags) 0	220	#define CreateSymbolicLink(neu,old,flags) 0 /* vista+ only */
183		221
184	struct statvfs	222	struct statvfs
185	{	223	{
186	int dummy;	224	int dummy;
187	};	225	};
…		…
193		231
194	#else	232	#else
195		233
196	#include <sys/time.h>	234	#include <sys/time.h>
197	#include <sys/select.h>	235	#include <sys/select.h>
198	#include <sys/statvfs.h>
199	#include <unistd.h>	236	#include <unistd.h>
200	#include <signal.h>	237	#include <signal.h>
201	#include <dirent.h>	238	#include <dirent.h>
202		239
		240	#ifdef ANDROID
		241	#include <sys/vfs.h>
		242	#define statvfs statfs
		243	#define fstatvfs fstatfs
		244	#include <asm/page.h> /* supposedly limits.h does #define PAGESIZE PAGESIZE */
		245	#else
		246	#include <sys/statvfs.h>
		247	#endif
		248
203	#if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES	249	#if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES
204	#include <sys/mman.h>	250	#include <sys/mman.h>
205	#endif	251	#endif
206		252
207	#define D_NAME(entp) entp->d_name	253	#define D_NAME(entp) entp->d_name
208		254
209	/* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */	255	/* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */
210	#if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__	256	#if __FreeBSD__ || __NetBSD__ || __OpenBSD__
211	#define _DIRENT_HAVE_D_TYPE /* sigh */	257	#define _DIRENT_HAVE_D_TYPE /* sigh */
212	#define D_INO(de) (de)->d_fileno	258	#define D_INO(de) (de)->d_fileno
213	#define D_NAMLEN(de) (de)->d_namlen	259	#define D_NAMLEN(de) (de)->d_namlen
214	#elif __linux || defined d_ino || _XOPEN_SOURCE >= 600	260	#elif __linux || defined d_ino || _XOPEN_SOURCE >= 600
215	#define D_INO(de) (de)->d_ino	261	#define D_INO(de) (de)->d_ino
…		…
278	#endif	324	#endif
279		325
280	/* buffer size for various temporary buffers */	326	/* buffer size for various temporary buffers */
281	#define EIO_BUFSIZE 65536	327	#define EIO_BUFSIZE 65536
282		328
283	#define dBUF \	329	#define dBUF \
284	char *eio_buf = malloc (EIO_BUFSIZE); \	330	char *eio_buf = malloc (EIO_BUFSIZE); \
285	errno = ENOMEM; \	331	errno = ENOMEM; \
286	if (!eio_buf) \	332	if (!eio_buf) \
287	return -1	333	return -1
288		334
289	#define FUBd \	335	#define FUBd \
290	free (eio_buf)	336	free (eio_buf)
291		337
292	#define EIO_TICKS ((1000000 + 1023) >> 10)	338	/*****************************************************************************/
		339
		340	struct tmpbuf
		341	{
		342	void *ptr;
		343	int len;
		344	};
		345
		346	static void *
		347	tmpbuf_get (struct tmpbuf *buf, int len)
		348	{
		349	if (buf->len < len)
		350	{
		351	free (buf->ptr);
		352	buf->ptr = malloc (buf->len = len);
		353	}
		354
		355	return buf->ptr;
		356	}
		357
		358	struct tmpbuf;
		359
		360	#if _POSIX_VERSION >= 200809L
		361	#define HAVE_AT 1
		362	#define WD2FD(wd) ((wd) ? (wd)->fd : AT_FDCWD)
		363	#ifndef O_SEARCH
		364	#define O_SEARCH O_RDONLY
		365	#endif
		366	#else
		367	#define HAVE_AT 0
		368	static const char *wd_expand (struct tmpbuf *tmpbuf, eio_wd wd, const char *path);
		369	#endif
		370
		371	struct eio_pwd
		372	{
		373	#if HAVE_AT
		374	int fd;
		375	#endif
		376	int len;
		377	char str[1]; /* actually, a 0-terminated canonical path */
		378	};
		379
		380	/*****************************************************************************/
293		381
294	#define ETP_PRI_MIN EIO_PRI_MIN	382	#define ETP_PRI_MIN EIO_PRI_MIN
295	#define ETP_PRI_MAX EIO_PRI_MAX	383	#define ETP_PRI_MAX EIO_PRI_MAX
		384
		385	#define ETP_TYPE_QUIT -1
		386	#define ETP_TYPE_GROUP EIO_GROUP
296		387
297	struct etp_worker;	388	struct etp_worker;
298		389
299	#define ETP_REQ eio_req	390	#define ETP_REQ eio_req
300	#define ETP_DESTROY(req) eio_destroy (req)	391	#define ETP_DESTROY(req) eio_destroy (req)
301	static int eio_finish (eio_req *req);	392	static int eio_finish (eio_req *req);
302	#define ETP_FINISH(req) eio_finish (req)	393	#define ETP_FINISH(req) eio_finish (req)
303	static void eio_execute (struct etp_worker *self, eio_req *req);	394	static void eio_execute (struct etp_worker *self, eio_req *req);
304	#define ETP_EXECUTE(wrk,req) eio_execute (wrk,req)	395	#define ETP_EXECUTE(wrk,req) eio_execute (wrk, req)
305		396
306	/*****************************************************************************/	397	#include "etp.c"
307
308	#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
309
310	/* calculate time difference in ~1/EIO_TICKS of a second */
311	ecb_inline int
312	tvdiff (struct timeval *tv1, struct timeval *tv2)
313	{
314	return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
315	+ ((tv2->tv_usec - tv1->tv_usec) >> 10);
316	}
317
318	static unsigned int started, idle, wanted = 4;
319
320	static void (*want_poll_cb) (void);
321	static void (*done_poll_cb) (void);
322
323	static unsigned int max_poll_time; /* reslock */
324	static unsigned int max_poll_reqs; /* reslock */
325
326	static volatile unsigned int nreqs; /* reqlock */
327	static volatile unsigned int nready; /* reqlock */
328	static volatile unsigned int npending; /* reqlock */
329	static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */
330	static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */
331
332	static xmutex_t wrklock;
333	static xmutex_t reslock;
334	static xmutex_t reqlock;
335	static xcond_t reqwait;
336
337	#if !HAVE_PREADWRITE
338	/*
339	* make our pread/pwrite emulation safe against themselves, but not against
340	* normal read/write by using a mutex. slows down execution a lot,
341	* but that's your problem, not mine.
342	*/
343	static xmutex_t preadwritelock;
344	#endif
345
346	typedef struct etp_worker
347	{
348	/* locked by wrklock */
349	struct etp_worker *prev, *next;
350
351	xthread_t tid;
352
353	/* locked by reslock, reqlock or wrklock */
354	ETP_REQ *req; /* currently processed request */
355
356	#ifdef ETP_WORKER_COMMON
357	ETP_WORKER_COMMON
358	#endif
359	} etp_worker;
360
361	static etp_worker wrk_first; /* NOT etp */
362
363	#define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock)
364	#define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock)
365
366	/* worker threads management */
367
368	static void ecb_cold
369	etp_worker_clear (etp_worker *wrk)
370	{
371	}
372
373	static void ecb_cold
374	etp_worker_free (etp_worker *wrk)
375	{
376	wrk->next->prev = wrk->prev;
377	wrk->prev->next = wrk->next;
378
379	free (wrk);
380	}
381
382	static unsigned int
383	etp_nreqs (void)
384	{
385	int retval;
386	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
387	retval = nreqs;
388	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
389	return retval;
390	}
391
392	static unsigned int
393	etp_nready (void)
394	{
395	unsigned int retval;
396
397	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
398	retval = nready;
399	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
400
401	return retval;
402	}
403
404	static unsigned int
405	etp_npending (void)
406	{
407	unsigned int retval;
408
409	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
410	retval = npending;
411	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
412
413	return retval;
414	}
415
416	static unsigned int
417	etp_nthreads (void)
418	{
419	unsigned int retval;
420
421	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
422	retval = started;
423	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
424
425	return retval;
426	}
427
428	/*
429	* a somewhat faster data structure might be nice, but
430	* with 8 priorities this actually needs <20 insns
431	* per shift, the most expensive operation.
432	*/
433	typedef struct {
434	ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */
435	int size;
436	} etp_reqq;
437
438	static etp_reqq req_queue;
439	static etp_reqq res_queue;
440
441	static void ecb_noinline ecb_cold
442	reqq_init (etp_reqq *q)
443	{
444	int pri;
445
446	for (pri = 0; pri < ETP_NUM_PRI; ++pri)
447	q->qs[pri] = q->qe[pri] = 0;
448
449	q->size = 0;
450	}
451
452	static int ecb_noinline
453	reqq_push (etp_reqq *q, ETP_REQ *req)
454	{
455	int pri = req->pri;
456	req->next = 0;
457
458	if (q->qe[pri])
459	{
460	q->qe[pri]->next = req;
461	q->qe[pri] = req;
462	}
463	else
464	q->qe[pri] = q->qs[pri] = req;
465
466	return q->size++;
467	}
468
469	static ETP_REQ * ecb_noinline
470	reqq_shift (etp_reqq *q)
471	{
472	int pri;
473
474	if (!q->size)
475	return 0;
476
477	--q->size;
478
479	for (pri = ETP_NUM_PRI; pri--; )
480	{
481	eio_req *req = q->qs[pri];
482
483	if (req)
484	{
485	if (!(q->qs[pri] = (eio_req *)req->next))
486	q->qe[pri] = 0;
487
488	return req;
489	}
490	}
491
492	abort ();
493	}
494
495	static int ecb_cold
496	etp_init (void (*want_poll)(void), void (*done_poll)(void))
497	{
498	X_MUTEX_CREATE (wrklock);
499	X_MUTEX_CREATE (reslock);
500	X_MUTEX_CREATE (reqlock);
501	X_COND_CREATE (reqwait);
502
503	reqq_init (&req_queue);
504	reqq_init (&res_queue);
505
506	wrk_first.next =
507	wrk_first.prev = &wrk_first;
508
509	started = 0;
510	idle = 0;
511	nreqs = 0;
512	nready = 0;
513	npending = 0;
514
515	want_poll_cb = want_poll;
516	done_poll_cb = done_poll;
517
518	return 0;
519	}
520
521	X_THREAD_PROC (etp_proc);
522
523	static void ecb_cold
524	etp_start_thread (void)
525	{
526	etp_worker *wrk = calloc (1, sizeof (etp_worker));
527
528	/*TODO*/
529	assert (("unable to allocate worker thread data", wrk));
530
531	X_LOCK (wrklock);
532
533	if (thread_create (&wrk->tid, etp_proc, (void *)wrk))
534	{
535	wrk->prev = &wrk_first;
536	wrk->next = wrk_first.next;
537	wrk_first.next->prev = wrk;
538	wrk_first.next = wrk;
539	++started;
540	}
541	else
542	free (wrk);
543
544	X_UNLOCK (wrklock);
545	}
546
547	static void
548	etp_maybe_start_thread (void)
549	{
550	if (ecb_expect_true (etp_nthreads () >= wanted))
551	return;
552
553	/* todo: maybe use idle here, but might be less exact */
554	if (ecb_expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ()))
555	return;
556
557	etp_start_thread ();
558	}
559
560	static void ecb_cold
561	etp_end_thread (void)
562	{
563	eio_req *req = calloc (1, sizeof (eio_req));
564
565	req->type = -1;
566	req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
567
568	X_LOCK (reqlock);
569	reqq_push (&req_queue, req);
570	X_COND_SIGNAL (reqwait);
571	X_UNLOCK (reqlock);
572
573	X_LOCK (wrklock);
574	--started;
575	X_UNLOCK (wrklock);
576	}
577
578	static int
579	etp_poll (void)
580	{
581	unsigned int maxreqs;
582	unsigned int maxtime;
583	struct timeval tv_start, tv_now;
584
585	X_LOCK (reslock);
586	maxreqs = max_poll_reqs;
587	maxtime = max_poll_time;
588	X_UNLOCK (reslock);
589
590	if (maxtime)
591	gettimeofday (&tv_start, 0);
592
593	for (;;)
594	{
595	ETP_REQ *req;
596
597	etp_maybe_start_thread ();
598
599	X_LOCK (reslock);
600	req = reqq_shift (&res_queue);
601
602	if (req)
603	{
604	--npending;
605
606	if (!res_queue.size && done_poll_cb)
607	done_poll_cb ();
608	}
609
610	X_UNLOCK (reslock);
611
612	if (!req)
613	return 0;
614
615	X_LOCK (reqlock);
616	--nreqs;
617	X_UNLOCK (reqlock);
618
619	if (ecb_expect_false (req->type == EIO_GROUP && req->size))
620	{
621	req->int1 = 1; /* mark request as delayed */
622	continue;
623	}
624	else
625	{
626	int res = ETP_FINISH (req);
627	if (ecb_expect_false (res))
628	return res;
629	}
630
631	if (ecb_expect_false (maxreqs && !--maxreqs))
632	break;
633
634	if (maxtime)
635	{
636	gettimeofday (&tv_now, 0);
637
638	if (tvdiff (&tv_start, &tv_now) >= maxtime)
639	break;
640	}
641	}
642
643	errno = EAGAIN;
644	return -1;
645	}
646
647	static void
648	etp_cancel (ETP_REQ *req)
649	{
650	req->cancelled = 1;
651
652	eio_grp_cancel (req);
653	}
654
655	static void
656	etp_submit (ETP_REQ *req)
657	{
658	req->pri -= ETP_PRI_MIN;
659
660	if (ecb_expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN;
661	if (ecb_expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
662
663	if (ecb_expect_false (req->type == EIO_GROUP))
664	{
665	/* I hope this is worth it :/ */
666	X_LOCK (reqlock);
667	++nreqs;
668	X_UNLOCK (reqlock);
669
670	X_LOCK (reslock);
671
672	++npending;
673
674	if (!reqq_push (&res_queue, req) && want_poll_cb)
675	want_poll_cb ();
676
677	X_UNLOCK (reslock);
678	}
679	else
680	{
681	X_LOCK (reqlock);
682	++nreqs;
683	++nready;
684	reqq_push (&req_queue, req);
685	X_COND_SIGNAL (reqwait);
686	X_UNLOCK (reqlock);
687
688	etp_maybe_start_thread ();
689	}
690	}
691
692	static void ecb_cold
693	etp_set_max_poll_time (double nseconds)
694	{
695	if (WORDACCESS_UNSAFE) X_LOCK (reslock);
696	max_poll_time = nseconds * EIO_TICKS;
697	if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
698	}
699
700	static void ecb_cold
701	etp_set_max_poll_reqs (unsigned int maxreqs)
702	{
703	if (WORDACCESS_UNSAFE) X_LOCK (reslock);
704	max_poll_reqs = maxreqs;
705	if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
706	}
707
708	static void ecb_cold
709	etp_set_max_idle (unsigned int nthreads)
710	{
711	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
712	max_idle = nthreads;
713	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
714	}
715
716	static void ecb_cold
717	etp_set_idle_timeout (unsigned int seconds)
718	{
719	if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
720	idle_timeout = seconds;
721	if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
722	}
723
724	static void ecb_cold
725	etp_set_min_parallel (unsigned int nthreads)
726	{
727	if (wanted < nthreads)
728	wanted = nthreads;
729	}
730
731	static void ecb_cold
732	etp_set_max_parallel (unsigned int nthreads)
733	{
734	if (wanted > nthreads)
735	wanted = nthreads;
736
737	while (started > wanted)
738	etp_end_thread ();
739	}
740		398
741	/*****************************************************************************/	399	/*****************************************************************************/
742		400
743	static void	401	static void
744	grp_try_feed (eio_req *grp)	402	grp_try_feed (eio_req *grp)
…		…
811	}	469	}
812		470
813	void	471	void
814	eio_grp_cancel (eio_req *grp)	472	eio_grp_cancel (eio_req *grp)
815	{	473	{
816	for (grp = grp->grp_first; grp; grp = grp->grp_next)
817	eio_cancel (grp);	474	etp_grp_cancel (grp);
818	}	475	}
819		476
820	void	477	void
821	eio_cancel (eio_req *req)	478	eio_cancel (eio_req *req)
822	{	479	{
…		…
894	return etp_poll ();	551	return etp_poll ();
895	}	552	}
896		553
897	/*****************************************************************************/	554	/*****************************************************************************/
898	/* work around various missing functions */	555	/* work around various missing functions */
899
900	#if !HAVE_PREADWRITE
901	# undef pread
902	# undef pwrite
903	# define pread eio__pread
904	# define pwrite eio__pwrite
905
906	static eio_ssize_t
907	eio__pread (int fd, void *buf, size_t count, off_t offset)
908	{
909	eio_ssize_t res;
910	off_t ooffset;
911
912	X_LOCK (preadwritelock);
913	ooffset = lseek (fd, 0, SEEK_CUR);
914	lseek (fd, offset, SEEK_SET);
915	res = read (fd, buf, count);
916	lseek (fd, ooffset, SEEK_SET);
917	X_UNLOCK (preadwritelock);
918
919	return res;
920	}
921
922	static eio_ssize_t
923	eio__pwrite (int fd, void *buf, size_t count, off_t offset)
924	{
925	eio_ssize_t res;
926	off_t ooffset;
927
928	X_LOCK (preadwritelock);
929	ooffset = lseek (fd, 0, SEEK_CUR);
930	lseek (fd, offset, SEEK_SET);
931	res = write (fd, buf, count);
932	lseek (fd, ooffset, SEEK_SET);
933	X_UNLOCK (preadwritelock);
934
935	return res;
936	}
937	#endif
938		556
939	#ifndef HAVE_UTIMES	557	#ifndef HAVE_UTIMES
940		558
941	# undef utimes	559	# undef utimes
942	# define utimes(path,times) eio__utimes (path, times)	560	# define utimes(path,times) eio__utimes (path, times)
…		…
984	int res;	602	int res;
985		603
986	#if HAVE_SYS_SYNCFS	604	#if HAVE_SYS_SYNCFS
987	res = (int)syscall (__NR_syncfs, (int)(fd));	605	res = (int)syscall (__NR_syncfs, (int)(fd));
988	#else	606	#else
989	res = -1;	607	res = EIO_ENOSYS ();
990	errno = ENOSYS;
991	#endif	608	#endif
992		609
993	if (res < 0 && errno == ENOSYS && fd >= 0)	610	if (res < 0 && errno == ENOSYS && fd >= 0)
994	sync ();	611	sync ();
995		612
…		…
1025	}	642	}
1026		643
1027	static int	644	static int
1028	eio__fallocate (int fd, int mode, off_t offset, size_t len)	645	eio__fallocate (int fd, int mode, off_t offset, size_t len)
1029	{	646	{
1030	#if HAVE_FALLOCATE	647	#if HAVE_LINUX_FALLOCATE
1031	return fallocate (fd, mode, offset, len);	648	return fallocate (fd, mode, offset, len);
1032	#else	649	#else
1033	errno = ENOSYS;	650	return EIO_ENOSYS ();
1034	return -1;
1035	#endif	651	#endif
1036	}	652	}
1037		653
1038	#if !HAVE_READAHEAD	654	#if !HAVE_READAHEAD
1039	# undef readahead	655	# undef readahead
…		…
1054	todo -= len;	670	todo -= len;
1055	}	671	}
1056		672
1057	FUBd;	673	FUBd;
1058		674
1059	errno = 0;	675	/* linux's readahead basically only fails for EBADF or EINVAL (not mmappable) */
		676	/* but not for e.g. EIO or eof, so we also never fail */
1060	return count;	677	return 0;
1061	}	678	}
1062		679
1063	#endif	680	#endif
1064		681
1065	/* sendfile always needs emulation */	682	/* sendfile always needs emulation */
…		…
1100		717
1101	/* according to source inspection, this is correct, and useful behaviour */	718	/* according to source inspection, this is correct, and useful behaviour */
1102	if (sbytes)	719	if (sbytes)
1103	res = sbytes;	720	res = sbytes;
1104		721
1105	# elif defined (__APPLE__)	722	# elif defined __APPLE__
1106	off_t sbytes = count;	723	off_t sbytes = count;
1107	res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);	724	res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
1108		725
1109	/* according to the manpage, sbytes is always valid */	726	/* according to the manpage, sbytes is always valid */
1110	if (sbytes)	727	if (sbytes)
…		…
1137	HANDLE h = TO_SOCKET (ifd);	754	HANDLE h = TO_SOCKET (ifd);
1138	SetFilePointer (h, offset, 0, FILE_BEGIN);	755	SetFilePointer (h, offset, 0, FILE_BEGIN);
1139	res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);	756	res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
1140		757
1141	#else	758	#else
1142	res = -1;	759	res = EIO_ENOSYS ();
1143	errno = ENOSYS;
1144	#endif	760	#endif
1145		761
1146	/* we assume sendfile can copy at least 128mb in one go */	762	/* we assume sendfile can copy at least 128mb in one go */
1147	if (res <= 128 * 1024 * 1024)	763	if (res <= 128 * 1024 * 1024)
1148	{	764	{
…		…
1335		951
1336	/*****************************************************************************/	952	/*****************************************************************************/
1337	/* requests implemented outside eio_execute, because they are so large */	953	/* requests implemented outside eio_execute, because they are so large */
1338		954
1339	static void	955	static void
1340	eio__realpath (eio_req *req, etp_worker *self)	956	eio__lseek (eio_req *req)
1341	{	957	{
1342	char *rel = req->ptr1;	958	/* this usually gets optimised away completely, or your compiler sucks, */
		959	/* or the whence constants really are not 0, 1, 2 */
		960	int whence = req->int2 == EIO_SEEK_SET ? SEEK_SET
		961	: req->int2 == EIO_SEEK_CUR ? SEEK_CUR
		962	: req->int2 == EIO_SEEK_END ? SEEK_END
		963	: req->int2;
		964
		965	req->offs = lseek (req->int1, req->offs, whence);
		966	req->result = req->offs == (off_t)-1 ? -1 : 0;
		967	}
		968
		969	/* result will always end up in tmpbuf, there is always space for adding a 0-byte */
		970	static int
		971	eio__realpath (struct tmpbuf *tmpbuf, eio_wd wd, const char *path)
		972	{
1343	char *res;	973	char *res;
		974	const char *rel = path;
1344	char *tmp1, *tmp2;	975	char *tmp1, *tmp2;
1345	#if SYMLOOP_MAX > 32	976	#if SYMLOOP_MAX > 32
1346	int symlinks = SYMLOOP_MAX;	977	int symlinks = SYMLOOP_MAX;
1347	#else	978	#else
1348	int symlinks = 32;	979	int symlinks = 32;
1349	#endif	980	#endif
1350		981
1351	req->result = -1;
1352
1353	errno = EINVAL;	982	errno = EINVAL;
1354	if (!rel)	983	if (!rel)
1355	return;	984	return -1;
1356		985
1357	errno = ENOENT;	986	errno = ENOENT;
1358	if (!*rel)	987	if (!*rel)
1359	return;	988	return -1;
1360		989
1361	if (!req->ptr2)	990	res = tmpbuf_get (tmpbuf, PATH_MAX * 3);
1362	{	991	#ifdef _WIN32
1363	X_LOCK (wrklock);	992	if (_access (rel, 4) != 0)
1364	req->flags |= EIO_FLAG_PTR2_FREE;
1365	X_UNLOCK (wrklock);
1366	req->ptr2 = malloc (PATH_MAX * 3);
1367
1368	errno = ENOMEM;
1369	if (!req->ptr2)
1370	return;	993	return -1;
1371	}
1372		994
1373	res = req->ptr2;	995	symlinks = GetFullPathName (rel, PATH_MAX * 3, res, 0);
		996
		997	errno = ENAMETOOLONG;
		998	if (symlinks >= PATH_MAX * 3)
		999	return -1;
		1000
		1001	errno = EIO;
		1002	if (symlinks <= 0)
		1003	return -1;
		1004
		1005	return symlinks;
		1006
		1007	#else
1374	tmp1 = res + PATH_MAX;	1008	tmp1 = res + PATH_MAX;
1375	tmp2 = tmp1 + PATH_MAX;	1009	tmp2 = tmp1 + PATH_MAX;
1376		1010
1377	#if 0 /* disabled, the musl way to do things is just too racy */	1011	#if 0 /* disabled, the musl way to do things is just too racy */
1378	#if __linux && defined(O_NONBLOCK) && defined(O_NOATIME)	1012	#if __linux && defined(O_NONBLOCK) && defined(O_NOATIME)
…		…
1382		1016
1383	if (fd >= 0)	1017	if (fd >= 0)
1384	{	1018	{
1385	sprintf (tmp1, "/proc/self/fd/%d", fd);	1019	sprintf (tmp1, "/proc/self/fd/%d", fd);
1386	req->result = readlink (tmp1, res, PATH_MAX);	1020	req->result = readlink (tmp1, res, PATH_MAX);
		1021	/* here we should probably stat the open file and the disk file, to make sure they still match */
1387	close (fd);	1022	close (fd);
1388
1389	/* here we should probably stat the open file and the disk file, to make sure they still match */
1390		1023
1391	if (req->result > 0)	1024	if (req->result > 0)
1392	goto done;	1025	goto done;
1393	}	1026	}
1394	else if (errno == ELOOP || errno == ENAMETOOLONG || errno == ENOENT || errno == ENOTDIR || errno == EIO)	1027	else if (errno == ELOOP || errno == ENAMETOOLONG || errno == ENOENT || errno == ENOTDIR || errno == EIO)
1395	return;	1028	return -1;
1396	}	1029	}
1397	#endif	1030	#endif
1398	#endif	1031	#endif
1399		1032
1400	if (*rel != '/')	1033	if (*rel != '/')
1401	{	1034	{
		1035	int len;
		1036
		1037	errno = ENOENT;
		1038	if (wd == EIO_INVALID_WD)
		1039	return -1;
		1040
		1041	if (wd == EIO_CWD)
		1042	{
1402	if (!getcwd (res, PATH_MAX))	1043	if (!getcwd (res, PATH_MAX))
1403	return;	1044	return -1;
		1045
		1046	len = strlen (res);
		1047	}
		1048	else
		1049	memcpy (res, wd->str, len = wd->len);
1404		1050
1405	if (res [1]) /* only use if not / */	1051	if (res [1]) /* only use if not / */
1406	res += strlen (res);	1052	res += len;
1407	}	1053	}
1408		1054
1409	while (*rel)	1055	while (*rel)
1410	{	1056	{
1411	eio_ssize_t len, linklen;	1057	eio_ssize_t len, linklen;
1412	char *beg = rel;	1058	const char *beg = rel;
1413		1059
1414	while (*rel && *rel != '/')	1060	while (*rel && *rel != '/')
1415	++rel;	1061	++rel;
1416		1062
1417	len = rel - beg;	1063	len = rel - beg;
…		…
1429		1075
1430	if (beg [1] == '.' && len == 2)	1076	if (beg [1] == '.' && len == 2)
1431	{	1077	{
1432	/* .. - back up one component, if possible */	1078	/* .. - back up one component, if possible */
1433		1079
1434	while (res != req->ptr2)	1080	while (res != tmpbuf->ptr)
1435	if (*--res == '/')	1081	if (*--res == '/')
1436	break;	1082	break;
1437		1083
1438	continue;	1084	continue;
1439	}	1085	}
1440	}	1086	}
1441		1087
1442	errno = ENAMETOOLONG;	1088	errno = ENAMETOOLONG;
1443	if (res + 1 + len + 1 >= tmp1)	1089	if (res + 1 + len + 1 >= tmp1)
1444	return;	1090	return -1;
1445		1091
1446	/* copy one component */	1092	/* copy one component */
1447	*res = '/';	1093	*res = '/';
1448	memcpy (res + 1, beg, len);	1094	memcpy (res + 1, beg, len);
1449		1095
1450	/* zero-terminate, for readlink */	1096	/* zero-terminate, for readlink */
1451	res [len + 1] = 0;	1097	res [len + 1] = 0;
1452		1098
1453	/* now check if it's a symlink */	1099	/* now check if it's a symlink */
1454	linklen = readlink (req->ptr2, tmp1, PATH_MAX);	1100	linklen = readlink (tmpbuf->ptr, tmp1, PATH_MAX);
1455		1101
1456	if (linklen < 0)	1102	if (linklen < 0)
1457	{	1103	{
1458	if (errno != EINVAL)	1104	if (errno != EINVAL)
1459	return;	1105	return -1;
1460		1106
1461	/* it's a normal directory. hopefully */	1107	/* it's a normal directory. hopefully */
1462	res += len + 1;	1108	res += len + 1;
1463	}	1109	}
1464	else	1110	else
…		…
1466	/* yay, it was a symlink - build new path in tmp2 */	1112	/* yay, it was a symlink - build new path in tmp2 */
1467	int rellen = strlen (rel);	1113	int rellen = strlen (rel);
1468		1114
1469	errno = ENAMETOOLONG;	1115	errno = ENAMETOOLONG;
1470	if (linklen + 1 + rellen >= PATH_MAX)	1116	if (linklen + 1 + rellen >= PATH_MAX)
1471	return;	1117	return -1;
1472		1118
1473	errno = ELOOP;	1119	errno = ELOOP;
1474	if (!--symlinks)	1120	if (!--symlinks)
1475	return;	1121	return -1;
1476		1122
1477	if (*tmp1 == '/')	1123	if (*tmp1 == '/')
1478	res = req->ptr2; /* symlink resolves to an absolute path */	1124	res = tmpbuf->ptr; /* symlink resolves to an absolute path */
1479		1125
1480	/* we need to be careful, as rel might point into tmp2 already */	1126	/* we need to be careful, as rel might point into tmp2 already */
1481	memmove (tmp2 + linklen + 1, rel, rellen + 1);	1127	memmove (tmp2 + linklen + 1, rel, rellen + 1);
1482	tmp2 [linklen] = '/';	1128	tmp2 [linklen] = '/';
1483	memcpy (tmp2, tmp1, linklen);	1129	memcpy (tmp2, tmp1, linklen);
…		…
1485	rel = tmp2;	1131	rel = tmp2;
1486	}	1132	}
1487	}	1133	}
1488		1134
1489	/* special case for the lone root path */	1135	/* special case for the lone root path */
1490	if (res == req->ptr2)	1136	if (res == tmpbuf->ptr)
1491	*res++ = '/';	1137	*res++ = '/';
1492		1138
1493	req->result = res - (char *)req->ptr2;	1139	return res - (char *)tmpbuf->ptr;
1494		1140	#endif
1495	done:
1496	req->ptr2 = realloc (req->ptr2, req->result); /* trade time for space savings */
1497	}	1141	}
1498		1142
1499	static signed char	1143	static signed char
1500	eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)	1144	eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
1501	{	1145	{
…		…
1689	#ifdef _WIN32	1333	#ifdef _WIN32
1690	{	1334	{
1691	int len = strlen ((const char *)req->ptr1);	1335	int len = strlen ((const char *)req->ptr1);
1692	char *path = malloc (MAX_PATH);	1336	char *path = malloc (MAX_PATH);
1693	const char *fmt;	1337	const char *fmt;
		1338	const char *reqpath = wd_expand (&self->tmpbuf, req->wd, req->ptr1);
1694		1339
1695	if (!len)	1340	if (!len)
1696	fmt = "./*";	1341	fmt = "./*";
1697	else if (((const char *)req->ptr1)[len - 1] == '/' || ((const char *)req->ptr1)[len - 1] == '\\')	1342	else if (reqpath[len - 1] == '/' || reqpath[len - 1] == '\\')
1698	fmt = "%s*";	1343	fmt = "%s*";
1699	else	1344	else
1700	fmt = "%s/*";	1345	fmt = "%s/*";
1701		1346
1702	_snprintf (path, MAX_PATH, fmt, (const char *)req->ptr1);	1347	_snprintf (path, MAX_PATH, fmt, reqpath);
1703	dirp = FindFirstFile (path, &entp);	1348	dirp = FindFirstFile (path, &entp);
1704	free (path);	1349	free (path);
1705		1350
1706	if (dirp == INVALID_HANDLE_VALUE)	1351	if (dirp == INVALID_HANDLE_VALUE)
1707	{	1352	{
1708	dirp = 0;
1709
1710	/* should steal _dosmaperr */	1353	/* should steal _dosmaperr */
1711	switch (GetLastError ())	1354	switch (GetLastError ())
1712	{	1355	{
1713	case ERROR_FILE_NOT_FOUND:	1356	case ERROR_FILE_NOT_FOUND:
1714	req->result = 0;	1357	req->result = 0;
1715	break;	1358	break;
1716		1359
1717	case ERROR_INVALID_NAME:	1360	case ERROR_INVALID_NAME:
1718	case ERROR_PATH_NOT_FOUND:	1361	case ERROR_PATH_NOT_FOUND:
1719	case ERROR_NO_MORE_FILES:	1362	case ERROR_NO_MORE_FILES:
1720	errno = ENOENT;	1363	errno = ENOENT;
1721	break;	1364	break;
1722		1365
1723	case ERROR_NOT_ENOUGH_MEMORY:	1366	case ERROR_NOT_ENOUGH_MEMORY:
1724	errno = ENOMEM;	1367	errno = ENOMEM;
1725	break;	1368	break;
1726		1369
1727	default:	1370	default:
1728	errno = EINVAL;	1371	errno = EINVAL;
1729	break;	1372	break;
1730	}	1373	}
		1374
		1375	return;
1731	}	1376	}
1732	}	1377	}
1733	#else	1378	#else
		1379	#if HAVE_AT
		1380	if (req->wd)
		1381	{
		1382	int fd = openat (WD2FD (req->wd), req->ptr1, O_CLOEXEC | O_SEARCH | O_DIRECTORY);
		1383
		1384	if (fd < 0)
		1385	return;
		1386
		1387	dirp = fdopendir (fd);
		1388
		1389	if (!dirp)
		1390	close (fd);
		1391	}
		1392	else
1734	dirp = opendir (req->ptr1);	1393	dirp = opendir (req->ptr1);
		1394	#else
		1395	dirp = opendir (wd_expand (&self->tmpbuf, req->wd, req->ptr1));
		1396	#endif
		1397
		1398	if (!dirp)
		1399	return;
1735	#endif	1400	#endif
1736		1401
1737	if (req->flags & EIO_FLAG_PTR1_FREE)	1402	if (req->flags & EIO_FLAG_PTR1_FREE)
1738	free (req->ptr1);	1403	free (req->ptr1);
1739		1404
1740	req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;	1405	req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1741	req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;	1406	req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
1742	req->ptr2 = names = malloc (namesalloc);	1407	req->ptr2 = names = malloc (namesalloc);
1743		1408
1744	if (dirp && names && (!flags || dents))	1409	if (!names || (flags && !dents))
		1410	return;
		1411
1745	for (;;)	1412	for (;;)
1746	{	1413	{
1747	int done;	1414	int done;
1748		1415
1749	#ifdef _WIN32	1416	#ifdef _WIN32
1750	done = !dirp;	1417	done = !dirp;
1751	#else	1418	#else
1752	errno = 0;	1419	errno = 0;
1753	entp = readdir (dirp);	1420	entp = readdir (dirp);
1754	done = !entp;	1421	done = !entp;
1755	#endif	1422	#endif
1756		1423
1757	if (done)	1424	if (done)
1758	{	1425	{
1759	#ifndef _WIN32	1426	#ifndef _WIN32
1760	int old_errno = errno;	1427	int old_errno = errno;
1761	closedir (dirp);	1428	closedir (dirp);
1762	errno = old_errno;	1429	errno = old_errno;
1763		1430
1764	if (errno)	1431	if (errno)
1765	break;	1432	break;
1766	#endif	1433	#endif
1767		1434
1768	/* sort etc. */	1435	/* sort etc. */
1769	req->int1 = flags;	1436	req->int1 = flags;
1770	req->result = dentoffs;	1437	req->result = dentoffs;
1771		1438
1772	if (flags & EIO_READDIR_STAT_ORDER)	1439	if (flags & EIO_READDIR_STAT_ORDER)
1773	eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits);	1440	eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits);
1774	else if (flags & EIO_READDIR_DIRS_FIRST)	1441	else if (flags & EIO_READDIR_DIRS_FIRST)
1775	if (flags & EIO_READDIR_FOUND_UNKNOWN)	1442	if (flags & EIO_READDIR_FOUND_UNKNOWN)
1776	eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */	1443	eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1777	else	1444	else
		1445	{
		1446	/* in this case, all is known, and we just put dirs first and sort them */
		1447	eio_dirent *oth = dents + dentoffs;
		1448	eio_dirent *dir = dents;
		1449
		1450	/* now partition dirs to the front, and non-dirs to the back */
		1451	/* by walking from both sides and swapping if necessary */
		1452	while (oth > dir)
		1453	{
		1454	if (dir->type == EIO_DT_DIR)
		1455	++dir;
		1456	else if ((--oth)->type == EIO_DT_DIR)
		1457	{
		1458	eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
		1459
		1460	++dir;
		1461	}
		1462	}
		1463
		1464	/* now sort the dirs only (dirs all have the same score) */
		1465	eio_dent_sort (dents, dir - dents, 0, inode_bits);
		1466	}
		1467
		1468	break;
		1469	}
		1470
		1471	/* now add the entry to our list(s) */
		1472	name = D_NAME (entp);
		1473
		1474	/* skip . and .. entries */
		1475	if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
		1476	{
		1477	int len = D_NAMLEN (entp) + 1;
		1478
		1479	while (ecb_expect_false (namesoffs + len > namesalloc))
		1480	{
		1481	namesalloc *= 2;
		1482	req->ptr2 = names = realloc (names, namesalloc);
		1483
		1484	if (!names)
		1485	break;
		1486	}
		1487
		1488	memcpy (names + namesoffs, name, len);
		1489
		1490	if (dents)
		1491	{
		1492	struct eio_dirent *ent;
		1493
		1494	if (ecb_expect_false (dentoffs == dentalloc))
1778	{	1495	{
1779	/* in this case, all is known, and we just put dirs first and sort them */	1496	dentalloc *= 2;
		1497	req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
		1498
		1499	if (!dents)
		1500	break;
		1501	}
		1502
1780	eio_dirent *oth = dents + dentoffs;	1503	ent = dents + dentoffs;
1781	eio_dirent *dir = dents;
1782		1504
1783	/* now partition dirs to the front, and non-dirs to the back */	1505	ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1784	/* by walking from both sides and swapping if necessary */	1506	ent->namelen = len - 1;
1785	while (oth > dir)	1507	ent->inode = D_INO (entp);
		1508
		1509	inode_bits |= ent->inode;
		1510
		1511	switch (D_TYPE (entp))
		1512	{
		1513	default:
		1514	ent->type = EIO_DT_UNKNOWN;
		1515	flags |= EIO_READDIR_FOUND_UNKNOWN;
		1516	break;
		1517
		1518	#ifdef DT_FIFO
		1519	case DT_FIFO: ent->type = EIO_DT_FIFO; break;
		1520	#endif
		1521	#ifdef DT_CHR
		1522	case DT_CHR: ent->type = EIO_DT_CHR; break;
		1523	#endif
		1524	#ifdef DT_MPC
		1525	case DT_MPC: ent->type = EIO_DT_MPC; break;
		1526	#endif
		1527	#ifdef DT_DIR
		1528	case DT_DIR: ent->type = EIO_DT_DIR; break;
		1529	#endif
		1530	#ifdef DT_NAM
		1531	case DT_NAM: ent->type = EIO_DT_NAM; break;
		1532	#endif
		1533	#ifdef DT_BLK
		1534	case DT_BLK: ent->type = EIO_DT_BLK; break;
		1535	#endif
		1536	#ifdef DT_MPB
		1537	case DT_MPB: ent->type = EIO_DT_MPB; break;
		1538	#endif
		1539	#ifdef DT_REG
		1540	case DT_REG: ent->type = EIO_DT_REG; break;
		1541	#endif
		1542	#ifdef DT_NWK
		1543	case DT_NWK: ent->type = EIO_DT_NWK; break;
		1544	#endif
		1545	#ifdef DT_CMP
		1546	case DT_CMP: ent->type = EIO_DT_CMP; break;
		1547	#endif
		1548	#ifdef DT_LNK
		1549	case DT_LNK: ent->type = EIO_DT_LNK; break;
		1550	#endif
		1551	#ifdef DT_SOCK
		1552	case DT_SOCK: ent->type = EIO_DT_SOCK; break;
		1553	#endif
		1554	#ifdef DT_DOOR
		1555	case DT_DOOR: ent->type = EIO_DT_DOOR; break;
		1556	#endif
		1557	#ifdef DT_WHT
		1558	case DT_WHT: ent->type = EIO_DT_WHT; break;
		1559	#endif
		1560	}
		1561
		1562	ent->score = 7;
		1563
		1564	if (flags & EIO_READDIR_DIRS_FIRST)
		1565	{
		1566	if (ent->type == EIO_DT_UNKNOWN)
1786	{	1567	{
1787	if (dir->type == EIO_DT_DIR)	1568	if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1788	++dir;	1569	ent->score = 1;
1789	else if ((--oth)->type == EIO_DT_DIR)	1570	else if (!strchr (name, '.')) /* absence of dots indicate likely dirs */
1790	{	1571	ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1791	eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1792
1793	++dir;
1794	}
1795	}	1572	}
1796		1573	else if (ent->type == EIO_DT_DIR)
1797	/* now sort the dirs only (dirs all have the same score) */	1574	ent->score = 0;
1798	eio_dent_sort (dents, dir - dents, 0, inode_bits);
1799	}	1575	}
1800
1801	break;
1802	}
1803
1804	/* now add the entry to our list(s) */
1805	name = D_NAME (entp);
1806
1807	/* skip . and .. entries */
1808	if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
1809	{
1810	int len = D_NAMLEN (entp) + 1;
1811
1812	while (ecb_expect_false (namesoffs + len > namesalloc))
1813	{
1814	namesalloc *= 2;
1815	req->ptr2 = names = realloc (names, namesalloc);
1816
1817	if (!names)
1818	break;
1819	}	1576	}
1820		1577
1821	memcpy (names + namesoffs, name, len);
1822
1823	if (dents)
1824	{
1825	struct eio_dirent *ent;
1826
1827	if (ecb_expect_false (dentoffs == dentalloc))
1828	{
1829	dentalloc *= 2;
1830	req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1831
1832	if (!dents)
1833	break;
1834	}
1835
1836	ent = dents + dentoffs;
1837
1838	ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1839	ent->namelen = len - 1;
1840	ent->inode = D_INO (entp);
1841
1842	inode_bits |= ent->inode;
1843
1844	switch (D_TYPE (entp))
1845	{
1846	default:
1847	ent->type = EIO_DT_UNKNOWN;
1848	flags |= EIO_READDIR_FOUND_UNKNOWN;
1849	break;
1850
1851	#ifdef DT_FIFO
1852	case DT_FIFO: ent->type = EIO_DT_FIFO; break;
1853	#endif
1854	#ifdef DT_CHR
1855	case DT_CHR: ent->type = EIO_DT_CHR; break;
1856	#endif
1857	#ifdef DT_MPC
1858	case DT_MPC: ent->type = EIO_DT_MPC; break;
1859	#endif
1860	#ifdef DT_DIR
1861	case DT_DIR: ent->type = EIO_DT_DIR; break;
1862	#endif
1863	#ifdef DT_NAM
1864	case DT_NAM: ent->type = EIO_DT_NAM; break;
1865	#endif
1866	#ifdef DT_BLK
1867	case DT_BLK: ent->type = EIO_DT_BLK; break;
1868	#endif
1869	#ifdef DT_MPB
1870	case DT_MPB: ent->type = EIO_DT_MPB; break;
1871	#endif
1872	#ifdef DT_REG
1873	case DT_REG: ent->type = EIO_DT_REG; break;
1874	#endif
1875	#ifdef DT_NWK
1876	case DT_NWK: ent->type = EIO_DT_NWK; break;
1877	#endif
1878	#ifdef DT_CMP
1879	case DT_CMP: ent->type = EIO_DT_CMP; break;
1880	#endif
1881	#ifdef DT_LNK
1882	case DT_LNK: ent->type = EIO_DT_LNK; break;
1883	#endif
1884	#ifdef DT_SOCK
1885	case DT_SOCK: ent->type = EIO_DT_SOCK; break;
1886	#endif
1887	#ifdef DT_DOOR
1888	case DT_DOOR: ent->type = EIO_DT_DOOR; break;
1889	#endif
1890	#ifdef DT_WHT
1891	case DT_WHT: ent->type = EIO_DT_WHT; break;
1892	#endif
1893	}
1894
1895	ent->score = 7;
1896
1897	if (flags & EIO_READDIR_DIRS_FIRST)
1898	{
1899	if (ent->type == EIO_DT_UNKNOWN)
1900	{
1901	if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1902	ent->score = 1;
1903	else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1904	ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1905	}
1906	else if (ent->type == EIO_DT_DIR)
1907	ent->score = 0;
1908	}
1909	}
1910
1911	namesoffs += len;	1578	namesoffs += len;
1912	++dentoffs;	1579	++dentoffs;
1913	}	1580	}
1914		1581
1915	if (EIO_CANCELLED (req))	1582	if (EIO_CANCELLED (req))
1916	{	1583	{
1917	errno = ECANCELED;	1584	errno = ECANCELED;
1918	break;	1585	break;
1919	}	1586	}
1920		1587
1921	#ifdef _WIN32	1588	#ifdef _WIN32
1922	if (!FindNextFile (dirp, &entp))	1589	if (!FindNextFile (dirp, &entp))
1923	{	1590	{
1924	FindClose (dirp);	1591	FindClose (dirp);
1925	dirp = 0;	1592	dirp = 0;
1926	}	1593	}
1927	#endif	1594	#endif
1928	}	1595	}
1929	}	1596	}
		1597
		1598	/*****************************************************************************/
		1599	/* working directory stuff */
		1600	/* various deficiencies in the posix 2008 api force us to */
		1601	/* keep the absolute path in string form at all times */
		1602	/* fuck yeah. */
		1603
		1604	#if !HAVE_AT
		1605
		1606	/* a bit like realpath, but usually faster because it doesn'T have to return */
		1607	/* an absolute or canonical path */
		1608	static const char *
		1609	wd_expand (struct tmpbuf *tmpbuf, eio_wd wd, const char *path)
		1610	{
		1611	if (!wd || *path == '/')
		1612	return path;
		1613
		1614	if (path [0] == '.' && !path [1])
		1615	return wd->str;
		1616
		1617	{
		1618	int l1 = wd->len;
		1619	int l2 = strlen (path);
		1620
		1621	char *res = tmpbuf_get (tmpbuf, l1 + l2 + 2);
		1622
		1623	memcpy (res, wd->str, l1);
		1624	res [l1] = '/';
		1625	memcpy (res + l1 + 1, path, l2 + 1);
		1626
		1627	return res;
		1628	}
		1629	}
		1630
		1631	#endif
		1632
		1633	static eio_wd
		1634	eio__wd_open_sync (struct tmpbuf *tmpbuf, eio_wd wd, const char *path)
		1635	{
		1636	int fd;
		1637	eio_wd res;
		1638	int len = eio__realpath (tmpbuf, wd, path);
		1639
		1640	if (len < 0)
		1641	return EIO_INVALID_WD;
		1642
		1643	#if HAVE_AT
		1644	fd = openat (WD2FD (wd), path, O_CLOEXEC | O_SEARCH | O_DIRECTORY);
		1645
		1646	if (fd < 0)
		1647	return EIO_INVALID_WD;
		1648	#endif
		1649
		1650	res = malloc (sizeof (*res) + len); /* one extra 0-byte */
		1651
		1652	#if HAVE_AT
		1653	res->fd = fd;
		1654	#endif
		1655
		1656	res->len = len;
		1657	memcpy (res->str, tmpbuf->ptr, len);
		1658	res->str [len] = 0;
		1659
		1660	return res;
		1661	}
		1662
		1663	eio_wd
		1664	eio_wd_open_sync (eio_wd wd, const char *path)
		1665	{
		1666	struct tmpbuf tmpbuf = { 0 };
		1667	wd = eio__wd_open_sync (&tmpbuf, wd, path);
		1668	free (tmpbuf.ptr);
		1669
		1670	return wd;
		1671	}
		1672
		1673	void
		1674	eio_wd_close_sync (eio_wd wd)
		1675	{
		1676	if (wd != EIO_INVALID_WD && wd != EIO_CWD)
		1677	{
		1678	#if HAVE_AT
		1679	close (wd->fd);
		1680	#endif
		1681	free (wd);
		1682	}
		1683	}
		1684
		1685	#if HAVE_AT
		1686
		1687	/* they forgot these */
		1688
		1689	static int
		1690	eio__truncateat (int dirfd, const char *path, off_t length)
		1691	{
		1692	int fd = openat (dirfd, path, O_WRONLY | O_CLOEXEC);
		1693	int res;
		1694
		1695	if (fd < 0)
		1696	return fd;
		1697
		1698	res = ftruncate (fd, length);
		1699	close (fd);
		1700	return res;
		1701	}
		1702
		1703	static int
		1704	eio__statvfsat (int dirfd, const char *path, struct statvfs *buf)
		1705	{
		1706	int fd = openat (dirfd, path, O_SEARCH | O_CLOEXEC);
		1707	int res;
		1708
		1709	if (fd < 0)
		1710	return fd;
		1711
		1712	res = fstatvfs (fd, buf);
		1713	close (fd);
		1714	return res;
		1715
		1716	}
		1717
		1718	#endif
1930		1719
1931	/*****************************************************************************/	1720	/*****************************************************************************/
1932		1721
1933	#define ALLOC(len) \	1722	#define ALLOC(len) \
1934	if (!req->ptr2) \	1723	if (!req->ptr2) \
…		…
1943	req->result = -1; \	1732	req->result = -1; \
1944	break; \	1733	break; \
1945	} \	1734	} \
1946	}	1735	}
1947		1736
		1737	static void ecb_noinline ecb_cold
		1738	etp_proc_init (void)
		1739	{
		1740	#if HAVE_PRCTL_SET_NAME
		1741	/* provide a more sensible "thread name" */
		1742	char name[16 + 1];
		1743	const int namelen = sizeof (name) - 1;
		1744	int len;
		1745
		1746	prctl (PR_GET_NAME, (unsigned long)name, 0, 0, 0);
		1747	name [namelen] = 0;
		1748	len = strlen (name);
		1749	strcpy (name + (len <= namelen - 4 ? len : namelen - 4), "/eio");
		1750	prctl (PR_SET_NAME, (unsigned long)name, 0, 0, 0);
		1751	#endif
		1752	}
		1753
		1754	/* TODO: move somehow to etp.c */
1948	X_THREAD_PROC (etp_proc)	1755	X_THREAD_PROC (etp_proc)
1949	{	1756	{
1950	ETP_REQ *req;	1757	ETP_REQ *req;
1951	struct timespec ts;	1758	struct timespec ts;
1952	etp_worker *self = (etp_worker *)thr_arg;	1759	etp_worker *self = (etp_worker *)thr_arg;
1953		1760
1954	#if HAVE_PRCTL_SET_NAME	1761	etp_proc_init ();
1955	prctl (PR_SET_NAME, (unsigned long)"eio_thread", 0, 0, 0);
1956	#endif
1957		1762
1958	/* try to distribute timeouts somewhat evenly */	1763	/* try to distribute timeouts somewhat evenly */
1959	ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);	1764	ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
1960		1765
1961	for (;;)	1766	for (;;)
…		…
1964		1769
1965	X_LOCK (reqlock);	1770	X_LOCK (reqlock);
1966		1771
1967	for (;;)	1772	for (;;)
1968	{	1773	{
1969	self->req = req = reqq_shift (&req_queue);	1774	req = reqq_shift (&req_queue);
1970		1775
1971	if (req)	1776	if (req)
1972	break;	1777	break;
1973		1778
1974	if (ts.tv_sec == 1) /* no request, but timeout detected, let's quit */	1779	if (ts.tv_sec == 1) /* no request, but timeout detected, let's quit */
…		…
2000		1805
2001	--nready;	1806	--nready;
2002		1807
2003	X_UNLOCK (reqlock);	1808	X_UNLOCK (reqlock);
2004		1809
2005	if (req->type < 0)	1810	if (req->type == ETP_TYPE_QUIT)
2006	goto quit;	1811	goto quit;
2007		1812
2008	ETP_EXECUTE (self, req);	1813	ETP_EXECUTE (self, req);
2009		1814
2010	X_LOCK (reslock);	1815	X_LOCK (reslock);
…		…
2012	++npending;	1817	++npending;
2013		1818
2014	if (!reqq_push (&res_queue, req) && want_poll_cb)	1819	if (!reqq_push (&res_queue, req) && want_poll_cb)
2015	want_poll_cb ();	1820	want_poll_cb ();
2016		1821
2017	self->req = 0;
2018	etp_worker_clear (self);	1822	etp_worker_clear (self);
2019		1823
2020	X_UNLOCK (reslock);	1824	X_UNLOCK (reslock);
2021	}	1825	}
2022		1826
2023	quit:	1827	quit:
		1828	free (req);
		1829
2024	X_LOCK (wrklock);	1830	X_LOCK (wrklock);
2025	etp_worker_free (self);	1831	etp_worker_free (self);
2026	X_UNLOCK (wrklock);	1832	X_UNLOCK (wrklock);
2027		1833
2028	return 0;	1834	return 0;
…		…
2031	/*****************************************************************************/	1837	/*****************************************************************************/
2032		1838
2033	int ecb_cold	1839	int ecb_cold
2034	eio_init (void (*want_poll)(void), void (*done_poll)(void))	1840	eio_init (void (*want_poll)(void), void (*done_poll)(void))
2035	{	1841	{
2036	#if !HAVE_PREADWRITE
2037	X_MUTEX_CREATE (preadwritelock);
2038	#endif
2039
2040	return etp_init (want_poll, done_poll);	1842	return etp_init (want_poll, done_poll);
2041	}	1843	}
2042		1844
2043	ecb_inline void	1845	ecb_inline void
2044	eio_api_destroy (eio_req *req)	1846	eio_api_destroy (eio_req *req)
2045	{	1847	{
2046	free (req);	1848	free (req);
2047	}	1849	}
2048		1850
2049	#define REQ(rtype) \	1851	#define REQ(rtype) \
2050	eio_req *req; \	1852	eio_req *req; \
2051	\	1853	\
2052	req = (eio_req *)calloc (1, sizeof *req); \	1854	req = (eio_req *)calloc (1, sizeof *req); \
2053	if (!req) \	1855	if (!req) \
2054	return 0; \	1856	return 0; \
…		…
2068	{ \	1870	{ \
2069	eio_api_destroy (req); \	1871	eio_api_destroy (req); \
2070	return 0; \	1872	return 0; \
2071	}	1873	}
2072		1874
		1875	#define SINGLEDOT(ptr) (0[(char *)(ptr)] == '.' && !1[(char *)(ptr)])
		1876
2073	static void	1877	static void
2074	eio_execute (etp_worker *self, eio_req *req)	1878	eio_execute (etp_worker *self, eio_req *req)
2075	{	1879	{
		1880	#if HAVE_AT
		1881	int dirfd;
		1882	#else
		1883	const char *path;
		1884	#endif
		1885
2076	if (ecb_expect_false (EIO_CANCELLED (req)))	1886	if (ecb_expect_false (EIO_CANCELLED (req)))
2077	{	1887	{
2078	req->result = -1;	1888	req->result = -1;
2079	req->errorno = ECANCELED;	1889	req->errorno = ECANCELED;
2080	return;	1890	return;
2081	}	1891	}
2082		1892
		1893	if (ecb_expect_false (req->wd == EIO_INVALID_WD))
		1894	{
		1895	req->result = -1;
		1896	req->errorno = ENOENT;
		1897	return;
		1898	}
		1899
		1900	if (req->type >= EIO_OPEN)
		1901	{
		1902	#if HAVE_AT
		1903	dirfd = WD2FD (req->wd);
		1904	#else
		1905	path = wd_expand (&self->tmpbuf, req->wd, req->ptr1);
		1906	#endif
		1907	}
		1908
2083	switch (req->type)	1909	switch (req->type)
2084	{	1910	{
		1911	case EIO_WD_OPEN: req->wd = eio__wd_open_sync (&self->tmpbuf, req->wd, req->ptr1);
		1912	req->result = req->wd == EIO_INVALID_WD ? -1 : 0;
		1913	break;
		1914	case EIO_WD_CLOSE: req->result = 0;
		1915	eio_wd_close_sync (req->wd); break;
		1916
		1917	case EIO_SEEK: eio__lseek (req); break;
2085	case EIO_READ: ALLOC (req->size);	1918	case EIO_READ: ALLOC (req->size);
2086	req->result = req->offs >= 0	1919	req->result = req->offs >= 0
2087	? pread (req->int1, req->ptr2, req->size, req->offs)	1920	? pread (req->int1, req->ptr2, req->size, req->offs)
2088	: read (req->int1, req->ptr2, req->size); break;	1921	: read (req->int1, req->ptr2, req->size); break;
2089	case EIO_WRITE: req->result = req->offs >= 0	1922	case EIO_WRITE: req->result = req->offs >= 0
…		…
2091	: write (req->int1, req->ptr2, req->size); break;	1924	: write (req->int1, req->ptr2, req->size); break;
2092		1925
2093	case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;	1926	case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
2094	case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size); break;	1927	case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size); break;
2095		1928
		1929	#if HAVE_AT
		1930
2096	case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));	1931	case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2097	req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;	1932	req->result = fstatat (dirfd, req->ptr1, (EIO_STRUCT_STAT *)req->ptr2, 0); break;
2098	case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));	1933	case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
		1934	req->result = fstatat (dirfd, req->ptr1, (EIO_STRUCT_STAT *)req->ptr2, AT_SYMLINK_NOFOLLOW); break;
		1935	case EIO_CHOWN: req->result = fchownat (dirfd, req->ptr1, req->int2, req->int3, 0); break;
		1936	case EIO_CHMOD: req->result = fchmodat (dirfd, req->ptr1, (mode_t)req->int2, 0); break;
		1937	case EIO_TRUNCATE: req->result = eio__truncateat (dirfd, req->ptr1, req->offs); break;
		1938	case EIO_OPEN: req->result = openat (dirfd, req->ptr1, req->int1, (mode_t)req->int2); break;
		1939
		1940	case EIO_UNLINK: req->result = unlinkat (dirfd, req->ptr1, 0); break;
		1941	case EIO_RMDIR: /* complications arise because "." cannot be removed, so we might have to expand */
		1942	req->result = req->wd && SINGLEDOT (req->ptr1)
		1943	? rmdir (req->wd->str)
		1944	: unlinkat (dirfd, req->ptr1, AT_REMOVEDIR); break;
		1945	case EIO_MKDIR: req->result = mkdirat (dirfd, req->ptr1, (mode_t)req->int2); break;
		1946	case EIO_RENAME: /* complications arise because "." cannot be renamed, so we might have to expand */
		1947	req->result = req->wd && SINGLEDOT (req->ptr1)
		1948	? rename (req->wd->str, req->ptr2)
		1949	: renameat (dirfd, req->ptr1, WD2FD ((eio_wd)req->int3), req->ptr2); break;
		1950	case EIO_LINK: req->result = linkat (dirfd, req->ptr1, WD2FD ((eio_wd)req->int3), req->ptr2, 0); break;
		1951	case EIO_SYMLINK: req->result = symlinkat (req->ptr1, dirfd, req->ptr2); break;
		1952	case EIO_MKNOD: req->result = mknodat (dirfd, req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
		1953	case EIO_READLINK: ALLOC (PATH_MAX);
		1954	req->result = readlinkat (dirfd, req->ptr1, req->ptr2, PATH_MAX); break;
		1955	case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
		1956	req->result = eio__statvfsat (dirfd, req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
		1957	case EIO_UTIME:
		1958	case EIO_FUTIME:
		1959	{
		1960	struct timespec ts[2];
		1961	struct timespec *times;
		1962
		1963	if (req->nv1 != -1. || req->nv2 != -1.)
		1964	{
		1965	ts[0].tv_sec = req->nv1;
		1966	ts[0].tv_nsec = (req->nv1 - ts[0].tv_sec) * 1e9;
		1967	ts[1].tv_sec = req->nv2;
		1968	ts[1].tv_nsec = (req->nv2 - ts[1].tv_sec) * 1e9;
		1969
		1970	times = ts;
		1971	}
		1972	else
		1973	times = 0;
		1974
		1975	req->result = req->type == EIO_FUTIME
		1976	? futimens (req->int1, times)
		1977	: utimensat (dirfd, req->ptr1, times, 0);
		1978	}
		1979	break;
		1980
		1981	#else
		1982
		1983	case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
		1984	req->result = stat (path , (EIO_STRUCT_STAT *)req->ptr2); break;
		1985	case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2099	req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;	1986	req->result = lstat (path , (EIO_STRUCT_STAT *)req->ptr2); break;
		1987	case EIO_CHOWN: req->result = chown (path , req->int2, req->int3); break;
		1988	case EIO_CHMOD: req->result = chmod (path , (mode_t)req->int2); break;
		1989	case EIO_TRUNCATE: req->result = truncate (path , req->offs); break;
		1990	case EIO_OPEN: req->result = open (path , req->int1, (mode_t)req->int2); break;
		1991
		1992	case EIO_UNLINK: req->result = unlink (path ); break;
		1993	case EIO_RMDIR: req->result = rmdir (path ); break;
		1994	case EIO_MKDIR: req->result = mkdir (path , (mode_t)req->int2); break;
		1995	case EIO_RENAME: req->result = rename (path , req->ptr2); break;
		1996	case EIO_LINK: req->result = link (path , req->ptr2); break;
		1997	case EIO_SYMLINK: req->result = symlink (path , req->ptr2); break;
		1998	case EIO_MKNOD: req->result = mknod (path , (mode_t)req->int2, (dev_t)req->offs); break;
		1999	case EIO_READLINK: ALLOC (PATH_MAX);
		2000	req->result = readlink (path, req->ptr2, PATH_MAX); break;
		2001	case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
		2002	req->result = statvfs (path , (EIO_STRUCT_STATVFS *)req->ptr2); break;
		2003
		2004	case EIO_UTIME:
		2005	case EIO_FUTIME:
		2006	{
		2007	struct timeval tv[2];
		2008	struct timeval *times;
		2009
		2010	if (req->nv1 != -1. || req->nv2 != -1.)
		2011	{
		2012	tv[0].tv_sec = req->nv1;
		2013	tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1e6;
		2014	tv[1].tv_sec = req->nv2;
		2015	tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1e6;
		2016
		2017	times = tv;
		2018	}
		2019	else
		2020	times = 0;
		2021
		2022	req->result = req->type == EIO_FUTIME
		2023	? futimes (req->int1, times)
		2024	: utimes (req->ptr1, times);
		2025	}
		2026	break;
		2027
		2028	#endif
		2029
		2030	case EIO_REALPATH: if (0 <= (req->result = eio__realpath (&self->tmpbuf, req->wd, req->ptr1)))
		2031	{
		2032	ALLOC (req->result);
		2033	memcpy (req->ptr2, self->tmpbuf.ptr, req->result);
		2034	}
		2035	break;
		2036
2100	case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));	2037	case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2101	req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;	2038	req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
2102		2039
2103	case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
2104	req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
2105	case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));	2040	case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
2106	req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;	2041	req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
2107		2042
2108	case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
2109	case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;	2043	case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
2110	case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
2111	case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;	2044	case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
2112	case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
2113	case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;	2045	case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
2114		2046
2115	case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
2116	case EIO_CLOSE: req->result = close (req->int1); break;	2047	case EIO_CLOSE: req->result = close (req->int1); break;
2117	case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;	2048	case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
2118	case EIO_UNLINK: req->result = unlink (req->ptr1); break;
2119	case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
2120	case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
2121	case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
2122	case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
2123	case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
2124	case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
2125
2126	case EIO_REALPATH: eio__realpath (req, self); break;
2127
2128	case EIO_READLINK: ALLOC (PATH_MAX);
2129	req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break;
2130
2131	case EIO_SYNC: req->result = 0; sync (); break;	2049	case EIO_SYNC: req->result = 0; sync (); break;
2132	case EIO_FSYNC: req->result = fsync (req->int1); break;	2050	case EIO_FSYNC: req->result = fsync (req->int1); break;
2133	case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;	2051	case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
2134	case EIO_SYNCFS: req->result = eio__syncfs (req->int1); break;	2052	case EIO_SYNCFS: req->result = eio__syncfs (req->int1); break;
2135	case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;	2053	case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
…		…
2154	req->result = select (0, 0, 0, 0, &tv);	2072	req->result = select (0, 0, 0, 0, &tv);
2155	}	2073	}
2156	#endif	2074	#endif
2157	break;	2075	break;
2158		2076
2159	case EIO_UTIME:
2160	case EIO_FUTIME:
2161	{
2162	struct timeval tv[2];
2163	struct timeval *times;
2164
2165	if (req->nv1 != -1. || req->nv2 != -1.)
2166	{
2167	tv[0].tv_sec = req->nv1;
2168	tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
2169	tv[1].tv_sec = req->nv2;
2170	tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
2171
2172	times = tv;
2173	}
2174	else
2175	times = 0;
2176
2177	req->result = req->type == EIO_FUTIME
2178	? futimes (req->int1, times)
2179	: utimes (req->ptr1, times);
2180	}
2181	break;
2182
2183	case EIO_GROUP:	2077	case EIO_GROUP:
2184	abort (); /* handled in eio_request */	2078	abort (); /* handled in eio_request */
2185		2079
2186	case EIO_NOP:	2080	case EIO_NOP:
2187	req->result = 0;	2081	req->result = 0;
…		…
2190	case EIO_CUSTOM:	2084	case EIO_CUSTOM:
2191	req->feed (req);	2085	req->feed (req);
2192	break;	2086	break;
2193		2087
2194	default:	2088	default:
2195	errno = ENOSYS;
2196	req->result = -1;	2089	req->result = EIO_ENOSYS ();
2197	break;	2090	break;
2198	}	2091	}
2199		2092
2200	req->errorno = errno;	2093	req->errorno = errno;
2201	}	2094	}
2202		2095
2203	#ifndef EIO_NO_WRAPPERS	2096	#ifndef EIO_NO_WRAPPERS
2204		2097
		2098	eio_req *eio_wd_open (const char *path, int pri, eio_cb cb, void *data)
		2099	{
		2100	REQ (EIO_WD_OPEN); PATH; SEND;
		2101	}
		2102
		2103	eio_req *eio_wd_close (eio_wd wd, int pri, eio_cb cb, void *data)
		2104	{
		2105	REQ (EIO_WD_CLOSE); req->wd = wd; SEND;
		2106	}
		2107
2205	eio_req *eio_nop (int pri, eio_cb cb, void *data)	2108	eio_req *eio_nop (int pri, eio_cb cb, void *data)
2206	{	2109	{
2207	REQ (EIO_NOP); SEND;	2110	REQ (EIO_NOP); SEND;
2208	}	2111	}
2209		2112
…		…
2268	}	2171	}
2269		2172
2270	eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data)	2173	eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data)
2271	{	2174	{
2272	REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND;	2175	REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND;
		2176	}
		2177
		2178	eio_req *eio_seek (int fd, off_t offset, int whence, int pri, eio_cb cb, void *data)
		2179	{
		2180	REQ (EIO_SEEK); req->int1 = fd; req->offs = offset; req->int2 = whence; SEND;
2273	}	2181	}
2274		2182
2275	eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)	2183	eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
2276	{	2184	{
2277	REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;	2185	REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;

Diff Legend

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