ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.89
Committed: Thu Jul 14 22:36:17 2011 UTC (12 years, 10 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.88: +1 -2 lines
Log Message:
*** empty log message ***

File Contents

# User Rev Content
1 root 1.14 /*
2     * libeio implementation
3     *
4 root 1.61 * Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libeio@schmorp.de>
5 root 1.14 * 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    
40 root 1.65 #ifndef _WIN32
41     # include "config.h"
42     #endif
43    
44 root 1.1 #include "eio.h"
45 root 1.72 #include "ecb.h"
46 root 1.29
47     #ifdef EIO_STACKSIZE
48     # define XTHREAD_STACKSIZE EIO_STACKSIZE
49     #endif
50 root 1.1 #include "xthread.h"
51    
52     #include <errno.h>
53     #include <stddef.h>
54     #include <stdlib.h>
55 root 1.3 #include <string.h>
56 root 1.1 #include <errno.h>
57     #include <sys/types.h>
58     #include <sys/stat.h>
59     #include <limits.h>
60     #include <fcntl.h>
61 root 1.8 #include <assert.h>
62 root 1.1
63 root 1.66 /* intptr_t comes from unistd.h, says POSIX/UNIX/tradition */
64 root 1.80 /* intptr_t only comes from stdint.h, says idiot openbsd coder */
65 root 1.66 #if HAVE_STDINT_H
66     # include <stdint.h>
67     #endif
68    
69 root 1.80 #ifndef ECANCELED
70     # define ECANCELED EDOM
71     #endif
72    
73     static void eio_destroy (eio_req *req);
74    
75 root 1.1 #ifndef EIO_FINISH
76     # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0
77     #endif
78    
79     #ifndef EIO_DESTROY
80     # define EIO_DESTROY(req) do { if ((req)->destroy) (req)->destroy (req); } while (0)
81     #endif
82    
83     #ifndef EIO_FEED
84     # define EIO_FEED(req) do { if ((req)->feed ) (req)->feed (req); } while (0)
85     #endif
86    
87 root 1.86 #ifndef EIO_FD_TO_WIN32_HANDLE
88     # define EIO_FD_TO_WIN32_HANDLE(fd) _get_osfhandle (fd)
89     #endif
90     #ifndef EIO_WIN32_HANDLE_TO_FD
91     # define EIO_WIN32_HANDLE_TO_FD(handle) _open_osfhandle (handle, 0)
92     #endif
93    
94     #define EIO_ERRNO(errval,retval) ((errno = errval), retval)
95    
96     #define EIO_ENOSYS() EIO_ERRNO (ENOSYS, -1)
97    
98 root 1.1 #ifdef _WIN32
99    
100 root 1.86 #define PAGESIZE 4096 /* GetSystemInfo? */
101    
102 root 1.87 #ifdef EIO_STRUCT_STATI64
103     #define stat(path,buf) _stati64 (path,buf)
104     #define fstat(fd,buf) _fstati64 (path,buf)
105     #endif
106 root 1.86 #define lstat(path,buf) stat (path,buf)
107     #define fsync(fd) (FlushFileBuffers (EIO_FD_TO_WIN32_HANDLE (fd)) ? 0 : EIO_ERRNO (EBADF, -1))
108     #define mkdir(path,mode) _mkdir (path)
109     #define link(old,neu) (CreateHardLink (neu, old, 0) ? 0 : EIO_ERRNO (ENOENT, -1))
110    
111     #define chown(path,uid,gid) EIO_ENOSYS ()
112     #define fchown(fd,uid,gid) EIO_ENOSYS ()
113     #define truncate(path,offs) EIO_ENOSYS () /* far-miss: SetEndOfFile */
114     #define ftruncate(fd,offs) EIO_ENOSYS () /* near-miss: SetEndOfFile */
115     #define mknod(path,mode,dev) EIO_ENOSYS ()
116     #define sync() EIO_ENOSYS ()
117    
118     /* we could even stat and see if it exists */
119     static int
120     symlink (const char *old, const char *neu)
121     {
122     if (CreateSymbolicLink (neu, old, 1))
123     return 0;
124    
125     if (CreateSymbolicLink (neu, old, 0))
126     return 0;
127    
128     return EIO_ERRNO (ENOENT, -1);
129     }
130    
131 root 1.1 #else
132    
133 root 1.86 #include <sys/time.h>
134     #include <sys/select.h>
135     #include <sys/statvfs.h>
136     #include <unistd.h>
137     #include <utime.h>
138     #include <signal.h>
139     #include <dirent.h>
140    
141     #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES
142     #include <sys/mman.h>
143     #endif
144    
145     /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */
146     #if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__
147     #define _DIRENT_HAVE_D_TYPE /* sigh */
148     #define D_INO(de) (de)->d_fileno
149     #define D_NAMLEN(de) (de)->d_namlen
150     #elif __linux || defined d_ino || _XOPEN_SOURCE >= 600
151     #define D_INO(de) (de)->d_ino
152     #endif
153 root 1.31
154 root 1.86 #ifdef _D_EXACT_NAMLEN
155     #undef D_NAMLEN
156     #define D_NAMLEN(de) _D_EXACT_NAMLEN (de)
157     #endif
158 root 1.33
159 root 1.86 #ifdef _DIRENT_HAVE_D_TYPE
160     #define D_TYPE(de) (de)->d_type
161     #endif
162 root 1.31
163 root 1.86 #ifndef EIO_STRUCT_DIRENT
164     #define EIO_STRUCT_DIRENT struct dirent
165     #endif
166 root 1.1
167     #endif
168    
169     #if HAVE_SENDFILE
170     # if __linux
171     # include <sys/sendfile.h>
172 root 1.50 # elif __FreeBSD__ || defined __APPLE__
173 root 1.1 # include <sys/socket.h>
174     # include <sys/uio.h>
175     # elif __hpux
176     # include <sys/socket.h>
177 root 1.45 # elif __solaris
178 root 1.1 # include <sys/sendfile.h>
179     # else
180     # error sendfile support requested but not available
181     # endif
182     #endif
183    
184 root 1.31 #ifndef D_TYPE
185     # define D_TYPE(de) 0
186     #endif
187     #ifndef D_INO
188     # define D_INO(de) 0
189     #endif
190 root 1.33 #ifndef D_NAMLEN
191     # define D_NAMLEN(de) strlen ((de)->d_name)
192     #endif
193 root 1.31
194 root 1.1 /* used for struct dirent, AIX doesn't provide it */
195     #ifndef NAME_MAX
196     # define NAME_MAX 4096
197     #endif
198    
199 root 1.54 /* used for readlink etc. */
200     #ifndef PATH_MAX
201     # define PATH_MAX 4096
202     #endif
203    
204 root 1.1 /* buffer size for various temporary buffers */
205     #define EIO_BUFSIZE 65536
206    
207     #define dBUF \
208     char *eio_buf; \
209 root 1.14 ETP_WORKER_LOCK (self); \
210 root 1.1 self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \
211 root 1.14 ETP_WORKER_UNLOCK (self); \
212 root 1.9 errno = ENOMEM; \
213 root 1.1 if (!eio_buf) \
214     return -1;
215    
216     #define EIO_TICKS ((1000000 + 1023) >> 10)
217    
218 root 1.14 #define ETP_PRI_MIN EIO_PRI_MIN
219     #define ETP_PRI_MAX EIO_PRI_MAX
220    
221 root 1.15 struct etp_worker;
222    
223 root 1.14 #define ETP_REQ eio_req
224     #define ETP_DESTROY(req) eio_destroy (req)
225     static int eio_finish (eio_req *req);
226     #define ETP_FINISH(req) eio_finish (req)
227 root 1.15 static void eio_execute (struct etp_worker *self, eio_req *req);
228     #define ETP_EXECUTE(wrk,req) eio_execute (wrk,req)
229 root 1.14
230     #define ETP_WORKER_CLEAR(req) \
231     if (wrk->dbuf) \
232     { \
233     free (wrk->dbuf); \
234     wrk->dbuf = 0; \
235     } \
236     \
237     if (wrk->dirp) \
238     { \
239     closedir (wrk->dirp); \
240     wrk->dirp = 0; \
241     }
242 root 1.32
243 root 1.14 #define ETP_WORKER_COMMON \
244     void *dbuf; \
245     DIR *dirp;
246    
247     /*****************************************************************************/
248    
249     #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
250    
251 root 1.44 /* calculate time difference in ~1/EIO_TICKS of a second */
252 root 1.73 ecb_inline int
253 root 1.72 tvdiff (struct timeval *tv1, struct timeval *tv2)
254 root 1.1 {
255     return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
256     + ((tv2->tv_usec - tv1->tv_usec) >> 10);
257     }
258    
259 root 1.9 static unsigned int started, idle, wanted = 4;
260 root 1.1
261 root 1.14 static void (*want_poll_cb) (void);
262     static void (*done_poll_cb) (void);
263 root 1.13
264 root 1.14 static unsigned int max_poll_time; /* reslock */
265     static unsigned int max_poll_reqs; /* reslock */
266 root 1.13
267 root 1.14 static volatile unsigned int nreqs; /* reqlock */
268     static volatile unsigned int nready; /* reqlock */
269     static volatile unsigned int npending; /* reqlock */
270 root 1.62 static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */
271     static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */
272 root 1.13
273 root 1.62 static xmutex_t wrklock;
274     static xmutex_t reslock;
275     static xmutex_t reqlock;
276     static xcond_t reqwait;
277 root 1.1
278 root 1.22 #if !HAVE_PREADWRITE
279     /*
280     * make our pread/pwrite emulation safe against themselves, but not against
281     * normal read/write by using a mutex. slows down execution a lot,
282     * but that's your problem, not mine.
283     */
284 root 1.55 static xmutex_t preadwritelock = X_MUTEX_INIT;
285 root 1.22 #endif
286    
287 root 1.14 typedef struct etp_worker
288 root 1.9 {
289 root 1.14 /* locked by wrklock */
290     struct etp_worker *prev, *next;
291 root 1.1
292 root 1.55 xthread_t tid;
293 root 1.1
294 root 1.14 /* locked by reslock, reqlock or wrklock */
295     ETP_REQ *req; /* currently processed request */
296    
297     ETP_WORKER_COMMON
298     } etp_worker;
299    
300     static etp_worker wrk_first = { &wrk_first, &wrk_first, 0 }; /* NOT etp */
301 root 1.1
302 root 1.14 #define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock)
303     #define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock)
304 root 1.13
305     /* worker threads management */
306 root 1.1
307 root 1.72 static void ecb_cold
308     etp_worker_clear (etp_worker *wrk)
309 root 1.1 {
310 root 1.14 ETP_WORKER_CLEAR (wrk);
311 root 1.1 }
312    
313 root 1.72 static void ecb_cold
314     etp_worker_free (etp_worker *wrk)
315 root 1.1 {
316     wrk->next->prev = wrk->prev;
317     wrk->prev->next = wrk->next;
318    
319     free (wrk);
320     }
321    
322 root 1.72 static unsigned int
323     etp_nreqs (void)
324 root 1.1 {
325 root 1.14 int retval;
326     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
327     retval = nreqs;
328     if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
329     return retval;
330 root 1.1 }
331    
332 root 1.72 static unsigned int
333     etp_nready (void)
334 root 1.1 {
335     unsigned int retval;
336    
337     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
338     retval = nready;
339     if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
340    
341     return retval;
342     }
343    
344 root 1.72 static unsigned int
345     etp_npending (void)
346 root 1.1 {
347     unsigned int retval;
348    
349     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
350     retval = npending;
351     if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
352    
353     return retval;
354     }
355    
356 root 1.72 static unsigned int
357     etp_nthreads (void)
358 root 1.1 {
359     unsigned int retval;
360    
361     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
362     retval = started;
363     if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
364    
365     return retval;
366     }
367    
368     /*
369     * a somewhat faster data structure might be nice, but
370     * with 8 priorities this actually needs <20 insns
371     * per shift, the most expensive operation.
372     */
373     typedef struct {
374 root 1.14 ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */
375 root 1.1 int size;
376 root 1.14 } etp_reqq;
377 root 1.1
378 root 1.14 static etp_reqq req_queue;
379     static etp_reqq res_queue;
380 root 1.1
381 root 1.72 static int ecb_noinline
382     reqq_push (etp_reqq *q, ETP_REQ *req)
383 root 1.1 {
384     int pri = req->pri;
385     req->next = 0;
386    
387     if (q->qe[pri])
388     {
389     q->qe[pri]->next = req;
390     q->qe[pri] = req;
391     }
392     else
393     q->qe[pri] = q->qs[pri] = req;
394    
395     return q->size++;
396     }
397    
398 root 1.72 static ETP_REQ * ecb_noinline
399     reqq_shift (etp_reqq *q)
400 root 1.1 {
401     int pri;
402    
403     if (!q->size)
404     return 0;
405    
406     --q->size;
407    
408 root 1.14 for (pri = ETP_NUM_PRI; pri--; )
409 root 1.1 {
410     eio_req *req = q->qs[pri];
411    
412     if (req)
413     {
414     if (!(q->qs[pri] = (eio_req *)req->next))
415     q->qe[pri] = 0;
416    
417     return req;
418     }
419     }
420    
421     abort ();
422     }
423    
424 root 1.72 static void ecb_cold
425     etp_thread_init (void)
426 root 1.62 {
427 root 1.85 #if !HAVE_PREADWRITE
428     X_MUTEX_CREATE (preadwritelock);
429     #endif
430 root 1.62 X_MUTEX_CREATE (wrklock);
431     X_MUTEX_CREATE (reslock);
432     X_MUTEX_CREATE (reqlock);
433     X_COND_CREATE (reqwait);
434     }
435    
436 root 1.72 static void ecb_cold
437     etp_atfork_prepare (void)
438 root 1.13 {
439     }
440    
441 root 1.72 static void ecb_cold
442     etp_atfork_parent (void)
443 root 1.13 {
444     }
445    
446 root 1.72 static void ecb_cold
447     etp_atfork_child (void)
448 root 1.13 {
449 root 1.14 ETP_REQ *prv;
450 root 1.13
451 root 1.21 while ((prv = reqq_shift (&req_queue)))
452 root 1.14 ETP_DESTROY (prv);
453 root 1.13
454 root 1.21 while ((prv = reqq_shift (&res_queue)))
455 root 1.14 ETP_DESTROY (prv);
456 root 1.13
457     while (wrk_first.next != &wrk_first)
458     {
459 root 1.14 etp_worker *wrk = wrk_first.next;
460 root 1.13
461     if (wrk->req)
462 root 1.14 ETP_DESTROY (wrk->req);
463 root 1.13
464 root 1.14 etp_worker_clear (wrk);
465     etp_worker_free (wrk);
466 root 1.13 }
467    
468     started = 0;
469     idle = 0;
470     nreqs = 0;
471     nready = 0;
472     npending = 0;
473    
474 root 1.62 etp_thread_init ();
475 root 1.13 }
476    
477 root 1.72 static void ecb_cold
478 root 1.13 etp_once_init (void)
479 root 1.62 {
480     etp_thread_init ();
481 root 1.13 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child);
482     }
483    
484 root 1.72 static int ecb_cold
485 root 1.14 etp_init (void (*want_poll)(void), void (*done_poll)(void))
486 root 1.13 {
487     static pthread_once_t doinit = PTHREAD_ONCE_INIT;
488    
489     pthread_once (&doinit, etp_once_init);
490    
491 root 1.14 want_poll_cb = want_poll;
492     done_poll_cb = done_poll;
493 root 1.19
494     return 0;
495 root 1.14 }
496    
497     X_THREAD_PROC (etp_proc);
498    
499 root 1.72 static void ecb_cold
500     etp_start_thread (void)
501 root 1.14 {
502     etp_worker *wrk = calloc (1, sizeof (etp_worker));
503    
504     /*TODO*/
505     assert (("unable to allocate worker thread data", wrk));
506    
507     X_LOCK (wrklock);
508    
509     if (thread_create (&wrk->tid, etp_proc, (void *)wrk))
510     {
511     wrk->prev = &wrk_first;
512     wrk->next = wrk_first.next;
513     wrk_first.next->prev = wrk;
514     wrk_first.next = wrk;
515     ++started;
516     }
517     else
518     free (wrk);
519    
520     X_UNLOCK (wrklock);
521     }
522    
523 root 1.72 static void
524     etp_maybe_start_thread (void)
525 root 1.14 {
526 root 1.72 if (ecb_expect_true (etp_nthreads () >= wanted))
527 root 1.14 return;
528    
529     /* todo: maybe use idle here, but might be less exact */
530 root 1.72 if (ecb_expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ()))
531 root 1.14 return;
532    
533     etp_start_thread ();
534     }
535    
536 root 1.72 static void ecb_cold
537     etp_end_thread (void)
538 root 1.14 {
539     eio_req *req = calloc (1, sizeof (eio_req));
540    
541     req->type = -1;
542     req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
543    
544     X_LOCK (reqlock);
545     reqq_push (&req_queue, req);
546     X_COND_SIGNAL (reqwait);
547     X_UNLOCK (reqlock);
548    
549     X_LOCK (wrklock);
550     --started;
551     X_UNLOCK (wrklock);
552     }
553    
554 root 1.72 static int
555     etp_poll (void)
556 root 1.14 {
557     unsigned int maxreqs;
558     unsigned int maxtime;
559     struct timeval tv_start, tv_now;
560    
561     X_LOCK (reslock);
562     maxreqs = max_poll_reqs;
563     maxtime = max_poll_time;
564     X_UNLOCK (reslock);
565    
566     if (maxtime)
567     gettimeofday (&tv_start, 0);
568    
569     for (;;)
570     {
571     ETP_REQ *req;
572    
573     etp_maybe_start_thread ();
574    
575     X_LOCK (reslock);
576     req = reqq_shift (&res_queue);
577    
578     if (req)
579     {
580     --npending;
581    
582     if (!res_queue.size && done_poll_cb)
583     done_poll_cb ();
584     }
585    
586     X_UNLOCK (reslock);
587    
588     if (!req)
589     return 0;
590    
591     X_LOCK (reqlock);
592     --nreqs;
593     X_UNLOCK (reqlock);
594    
595 root 1.72 if (ecb_expect_false (req->type == EIO_GROUP && req->size))
596 root 1.14 {
597     req->int1 = 1; /* mark request as delayed */
598     continue;
599     }
600     else
601     {
602     int res = ETP_FINISH (req);
603 root 1.72 if (ecb_expect_false (res))
604 root 1.14 return res;
605     }
606    
607 root 1.72 if (ecb_expect_false (maxreqs && !--maxreqs))
608 root 1.14 break;
609    
610     if (maxtime)
611     {
612     gettimeofday (&tv_now, 0);
613    
614     if (tvdiff (&tv_start, &tv_now) >= maxtime)
615     break;
616     }
617     }
618    
619     errno = EAGAIN;
620     return -1;
621     }
622    
623 root 1.72 static void
624     etp_cancel (ETP_REQ *req)
625 root 1.14 {
626 root 1.81 req->cancelled = 1;
627 root 1.14
628     eio_grp_cancel (req);
629     }
630    
631 root 1.72 static void
632     etp_submit (ETP_REQ *req)
633 root 1.14 {
634     req->pri -= ETP_PRI_MIN;
635    
636 root 1.72 if (ecb_expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN;
637     if (ecb_expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
638 root 1.24
639 root 1.72 if (ecb_expect_false (req->type == EIO_GROUP))
640 root 1.24 {
641     /* I hope this is worth it :/ */
642     X_LOCK (reqlock);
643     ++nreqs;
644     X_UNLOCK (reqlock);
645    
646     X_LOCK (reslock);
647    
648     ++npending;
649    
650     if (!reqq_push (&res_queue, req) && want_poll_cb)
651     want_poll_cb ();
652 root 1.14
653 root 1.24 X_UNLOCK (reslock);
654     }
655     else
656     {
657     X_LOCK (reqlock);
658     ++nreqs;
659     ++nready;
660     reqq_push (&req_queue, req);
661     X_COND_SIGNAL (reqwait);
662     X_UNLOCK (reqlock);
663 root 1.14
664 root 1.24 etp_maybe_start_thread ();
665     }
666 root 1.14 }
667    
668 root 1.72 static void ecb_cold
669     etp_set_max_poll_time (double nseconds)
670 root 1.14 {
671     if (WORDACCESS_UNSAFE) X_LOCK (reslock);
672 root 1.44 max_poll_time = nseconds * EIO_TICKS;
673 root 1.14 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
674     }
675    
676 root 1.72 static void ecb_cold
677     etp_set_max_poll_reqs (unsigned int maxreqs)
678 root 1.14 {
679     if (WORDACCESS_UNSAFE) X_LOCK (reslock);
680     max_poll_reqs = maxreqs;
681     if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
682     }
683 root 1.13
684 root 1.72 static void ecb_cold
685     etp_set_max_idle (unsigned int nthreads)
686 root 1.14 {
687     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
688 root 1.62 max_idle = nthreads;
689     if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
690     }
691    
692 root 1.72 static void ecb_cold
693     etp_set_idle_timeout (unsigned int seconds)
694 root 1.62 {
695     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
696     idle_timeout = seconds;
697 root 1.14 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
698 root 1.13 }
699    
700 root 1.72 static void ecb_cold
701     etp_set_min_parallel (unsigned int nthreads)
702 root 1.14 {
703     if (wanted < nthreads)
704     wanted = nthreads;
705     }
706    
707 root 1.72 static void ecb_cold
708     etp_set_max_parallel (unsigned int nthreads)
709 root 1.14 {
710     if (wanted > nthreads)
711     wanted = nthreads;
712    
713     while (started > wanted)
714     etp_end_thread ();
715     }
716 root 1.13
717     /*****************************************************************************/
718    
719 root 1.72 static void
720     grp_try_feed (eio_req *grp)
721 root 1.1 {
722     while (grp->size < grp->int2 && !EIO_CANCELLED (grp))
723     {
724 root 1.26 grp->flags &= ~EIO_FLAG_GROUPADD;
725 root 1.1
726     EIO_FEED (grp);
727    
728     /* stop if no progress has been made */
729 root 1.26 if (!(grp->flags & EIO_FLAG_GROUPADD))
730 root 1.1 {
731     grp->feed = 0;
732 root 1.2 break;
733 root 1.1 }
734     }
735     }
736    
737 root 1.72 static int
738     grp_dec (eio_req *grp)
739 root 1.1 {
740     --grp->size;
741    
742     /* call feeder, if applicable */
743 root 1.2 grp_try_feed (grp);
744 root 1.1
745     /* finish, if done */
746     if (!grp->size && grp->int1)
747 root 1.2 return eio_finish (grp);
748 root 1.1 else
749     return 0;
750     }
751    
752 root 1.80 static void
753 root 1.72 eio_destroy (eio_req *req)
754 root 1.1 {
755 root 1.6 if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1);
756     if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
757 root 1.1
758     EIO_DESTROY (req);
759     }
760    
761 root 1.72 static int
762     eio_finish (eio_req *req)
763 root 1.1 {
764     int res = EIO_FINISH (req);
765    
766     if (req->grp)
767     {
768     int res2;
769     eio_req *grp = req->grp;
770    
771     /* unlink request */
772     if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
773     if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
774    
775     if (grp->grp_first == req)
776     grp->grp_first = req->grp_next;
777    
778     res2 = grp_dec (grp);
779    
780 root 1.79 if (!res)
781 root 1.1 res = res2;
782     }
783    
784     eio_destroy (req);
785    
786     return res;
787     }
788    
789 root 1.72 void
790     eio_grp_cancel (eio_req *grp)
791 root 1.1 {
792     for (grp = grp->grp_first; grp; grp = grp->grp_next)
793     eio_cancel (grp);
794     }
795    
796 root 1.72 void
797     eio_cancel (eio_req *req)
798 root 1.1 {
799 root 1.14 etp_cancel (req);
800     }
801 root 1.1
802 root 1.72 void
803     eio_submit (eio_req *req)
804 root 1.14 {
805     etp_submit (req);
806 root 1.1 }
807    
808 root 1.72 unsigned int
809     eio_nreqs (void)
810 root 1.1 {
811 root 1.14 return etp_nreqs ();
812 root 1.1 }
813    
814 root 1.72 unsigned int
815     eio_nready (void)
816 root 1.1 {
817 root 1.14 return etp_nready ();
818 root 1.1 }
819    
820 root 1.72 unsigned int
821     eio_npending (void)
822 root 1.1 {
823 root 1.14 return etp_npending ();
824 root 1.1 }
825    
826 root 1.72 unsigned int ecb_cold
827     eio_nthreads (void)
828 root 1.1 {
829 root 1.14 return etp_nthreads ();
830 root 1.1 }
831    
832 root 1.72 void ecb_cold
833     eio_set_max_poll_time (double nseconds)
834 root 1.1 {
835 root 1.14 etp_set_max_poll_time (nseconds);
836 root 1.1 }
837    
838 root 1.72 void ecb_cold
839     eio_set_max_poll_reqs (unsigned int maxreqs)
840 root 1.1 {
841 root 1.14 etp_set_max_poll_reqs (maxreqs);
842 root 1.1 }
843    
844 root 1.72 void ecb_cold
845     eio_set_max_idle (unsigned int nthreads)
846 root 1.1 {
847 root 1.14 etp_set_max_idle (nthreads);
848 root 1.1 }
849    
850 root 1.72 void ecb_cold
851     eio_set_idle_timeout (unsigned int seconds)
852 root 1.62 {
853     etp_set_idle_timeout (seconds);
854     }
855    
856 root 1.72 void ecb_cold
857     eio_set_min_parallel (unsigned int nthreads)
858 root 1.1 {
859 root 1.14 etp_set_min_parallel (nthreads);
860 root 1.1 }
861    
862 root 1.72 void ecb_cold
863     eio_set_max_parallel (unsigned int nthreads)
864 root 1.1 {
865 root 1.14 etp_set_max_parallel (nthreads);
866 root 1.1 }
867    
868     int eio_poll (void)
869     {
870 root 1.14 return etp_poll ();
871 root 1.1 }
872    
873     /*****************************************************************************/
874     /* work around various missing functions */
875    
876     #if !HAVE_PREADWRITE
877 root 1.27 # undef pread
878     # undef pwrite
879 root 1.9 # define pread eio__pread
880     # define pwrite eio__pwrite
881 root 1.1
882 root 1.88 static eio_ssize_t
883 root 1.9 eio__pread (int fd, void *buf, size_t count, off_t offset)
884 root 1.1 {
885 root 1.88 eio_ssize_t res;
886 root 1.1 off_t ooffset;
887    
888     X_LOCK (preadwritelock);
889     ooffset = lseek (fd, 0, SEEK_CUR);
890     lseek (fd, offset, SEEK_SET);
891     res = read (fd, buf, count);
892     lseek (fd, ooffset, SEEK_SET);
893     X_UNLOCK (preadwritelock);
894    
895     return res;
896     }
897    
898 root 1.88 static eio_ssize_t
899 root 1.9 eio__pwrite (int fd, void *buf, size_t count, off_t offset)
900 root 1.1 {
901 root 1.88 eio_ssize_t res;
902 root 1.1 off_t ooffset;
903    
904     X_LOCK (preadwritelock);
905     ooffset = lseek (fd, 0, SEEK_CUR);
906     lseek (fd, offset, SEEK_SET);
907     res = write (fd, buf, count);
908 root 1.30 lseek (fd, ooffset, SEEK_SET);
909 root 1.1 X_UNLOCK (preadwritelock);
910    
911     return res;
912     }
913     #endif
914    
915 root 1.59 #ifndef HAVE_UTIMES
916 root 1.1
917 root 1.27 # undef utimes
918 root 1.59 # define utimes(path,times) eio__utimes (path, times)
919 root 1.1
920 root 1.9 static int
921     eio__utimes (const char *filename, const struct timeval times[2])
922 root 1.1 {
923     if (times)
924     {
925     struct utimbuf buf;
926    
927     buf.actime = times[0].tv_sec;
928     buf.modtime = times[1].tv_sec;
929    
930     return utime (filename, &buf);
931     }
932     else
933     return utime (filename, 0);
934     }
935    
936 root 1.59 #endif
937    
938     #ifndef HAVE_FUTIMES
939    
940     # undef futimes
941     # define futimes(fd,times) eio__futimes (fd, times)
942    
943 root 1.72 static int
944     eio__futimes (int fd, const struct timeval tv[2])
945 root 1.1 {
946     errno = ENOSYS;
947     return -1;
948     }
949    
950     #endif
951    
952     #if !HAVE_FDATASYNC
953 root 1.27 # undef fdatasync
954     # define fdatasync(fd) fsync (fd)
955 root 1.1 #endif
956    
957 root 1.27 /* sync_file_range always needs emulation */
958 root 1.72 static int
959 root 1.27 eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags)
960     {
961     #if HAVE_SYNC_FILE_RANGE
962     int res;
963    
964     if (EIO_SYNC_FILE_RANGE_WAIT_BEFORE != SYNC_FILE_RANGE_WAIT_BEFORE
965     || EIO_SYNC_FILE_RANGE_WRITE != SYNC_FILE_RANGE_WRITE
966     || EIO_SYNC_FILE_RANGE_WAIT_AFTER != SYNC_FILE_RANGE_WAIT_AFTER)
967     {
968     flags = 0
969     | (flags & EIO_SYNC_FILE_RANGE_WAIT_BEFORE ? SYNC_FILE_RANGE_WAIT_BEFORE : 0)
970     | (flags & EIO_SYNC_FILE_RANGE_WRITE ? SYNC_FILE_RANGE_WRITE : 0)
971     | (flags & EIO_SYNC_FILE_RANGE_WAIT_AFTER ? SYNC_FILE_RANGE_WAIT_AFTER : 0);
972     }
973    
974     res = sync_file_range (fd, offset, nbytes, flags);
975    
976 root 1.28 if (!res || errno != ENOSYS)
977 root 1.27 return res;
978     #endif
979    
980     /* even though we could play tricks with the flags, it's better to always
981 root 1.43 * call fdatasync, as that matches the expectation of its users best */
982 root 1.27 return fdatasync (fd);
983     }
984    
985 root 1.83 static int
986 root 1.84 eio__fallocate (int fd, int mode, off_t offset, size_t len)
987 root 1.83 {
988     #if HAVE_FALLOCATE
989 root 1.84 return fallocate (fd, mode, offset, len);
990 root 1.83 #else
991     errno = ENOSYS;
992     return -1;
993     #endif
994     }
995    
996 root 1.1 #if !HAVE_READAHEAD
997 root 1.27 # undef readahead
998 root 1.9 # define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)
999 root 1.1
1000 root 1.88 static eio_ssize_t
1001 root 1.17 eio__readahead (int fd, off_t offset, size_t count, etp_worker *self)
1002 root 1.1 {
1003     size_t todo = count;
1004     dBUF;
1005    
1006     while (todo > 0)
1007     {
1008     size_t len = todo < EIO_BUFSIZE ? todo : EIO_BUFSIZE;
1009    
1010 root 1.3 pread (fd, eio_buf, len, offset);
1011 root 1.1 offset += len;
1012     todo -= len;
1013     }
1014    
1015     errno = 0;
1016     return count;
1017     }
1018    
1019     #endif
1020    
1021     /* sendfile always needs emulation */
1022 root 1.88 static eio_ssize_t
1023 root 1.14 eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self)
1024 root 1.1 {
1025 root 1.88 eio_ssize_t written = 0;
1026     eio_ssize_t res;
1027 root 1.1
1028     if (!count)
1029     return 0;
1030    
1031 root 1.69 for (;;)
1032     {
1033 root 1.82 #ifdef __APPLE__
1034     # undef HAVE_SENDFILE /* broken, as everything on os x */
1035     #endif
1036 root 1.1 #if HAVE_SENDFILE
1037     # if __linux
1038 root 1.69 off_t soffset = offset;
1039     res = sendfile (ofd, ifd, &soffset, count);
1040 root 1.1
1041 root 1.50 # elif __FreeBSD__
1042 root 1.69 /*
1043     * Of course, the freebsd sendfile is a dire hack with no thoughts
1044     * wasted on making it similar to other I/O functions.
1045     */
1046     off_t sbytes;
1047     res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
1048    
1049     #if 0 /* according to the manpage, this is correct, but broken behaviour */
1050     /* freebsd' sendfile will return 0 on success */
1051     /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */
1052     /* not on e.g. EIO or EPIPE - sounds broken */
1053     if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0)
1054     res = sbytes;
1055     #endif
1056    
1057     /* according to source inspection, this is correct, and useful behaviour */
1058     if (sbytes)
1059     res = sbytes;
1060 root 1.1
1061 root 1.82 # elif defined (__APPLE__)
1062 root 1.69 off_t sbytes = count;
1063     res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
1064 root 1.45
1065 root 1.69 /* according to the manpage, sbytes is always valid */
1066     if (sbytes)
1067     res = sbytes;
1068 root 1.45
1069 root 1.1 # elif __hpux
1070 root 1.69 res = sendfile (ofd, ifd, offset, count, 0, 0);
1071 root 1.1
1072     # elif __solaris
1073 root 1.69 struct sendfilevec vec;
1074     size_t sbytes;
1075 root 1.1
1076 root 1.69 vec.sfv_fd = ifd;
1077     vec.sfv_flag = 0;
1078     vec.sfv_off = offset;
1079     vec.sfv_len = count;
1080 root 1.1
1081 root 1.69 res = sendfilev (ofd, &vec, 1, &sbytes);
1082 root 1.1
1083 root 1.69 if (res < 0 && sbytes)
1084     res = sbytes;
1085 root 1.1
1086     # endif
1087 root 1.46
1088 root 1.86 #elif defined (_WIN32) && 0
1089 root 1.69 /* does not work, just for documentation of what would need to be done */
1090 root 1.70 /* actually, cannot be done like this, as TransmitFile changes the file offset, */
1091     /* libeio guarantees that the file offset does not change, and windows */
1092     /* has no way to get an independent handle to the same file description */
1093 root 1.69 HANDLE h = TO_SOCKET (ifd);
1094     SetFilePointer (h, offset, 0, FILE_BEGIN);
1095     res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
1096 root 1.45
1097 root 1.1 #else
1098 root 1.69 res = -1;
1099     errno = ENOSYS;
1100 root 1.1 #endif
1101    
1102 root 1.69 /* we assume sendfile can copy at least 128mb in one go */
1103     if (res <= 128 * 1024 * 1024)
1104     {
1105     if (res > 0)
1106     written += res;
1107    
1108     if (written)
1109     return written;
1110    
1111     break;
1112     }
1113     else
1114     {
1115     /* if we requested more, then probably the kernel was lazy */
1116     written += res;
1117     offset += res;
1118     count -= res;
1119    
1120     if (!count)
1121     return written;
1122     }
1123     }
1124    
1125     if (res < 0
1126 root 1.1 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK
1127 root 1.49 /* BSDs */
1128     #ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */
1129     || errno == ENOTSUP
1130     #endif
1131     || errno == EOPNOTSUPP /* BSDs */
1132 root 1.1 #if __solaris
1133     || errno == EAFNOSUPPORT || errno == EPROTOTYPE
1134     #endif
1135     )
1136     )
1137     {
1138     /* emulate sendfile. this is a major pain in the ass */
1139     dBUF;
1140    
1141     res = 0;
1142    
1143     while (count)
1144     {
1145 root 1.88 eio_ssize_t cnt;
1146 root 1.1
1147     cnt = pread (ifd, eio_buf, count > EIO_BUFSIZE ? EIO_BUFSIZE : count, offset);
1148    
1149     if (cnt <= 0)
1150     {
1151     if (cnt && !res) res = -1;
1152     break;
1153     }
1154    
1155     cnt = write (ofd, eio_buf, cnt);
1156    
1157     if (cnt <= 0)
1158     {
1159     if (cnt && !res) res = -1;
1160     break;
1161     }
1162    
1163     offset += cnt;
1164     res += cnt;
1165     count -= cnt;
1166     }
1167     }
1168    
1169     return res;
1170     }
1171    
1172 root 1.77 #ifdef PAGESIZE
1173     # define eio_pagesize() PAGESIZE
1174     #else
1175     static intptr_t
1176     eio_pagesize (void)
1177     {
1178     static intptr_t page;
1179    
1180     if (!page)
1181     page = sysconf (_SC_PAGESIZE);
1182    
1183     return page;
1184     }
1185     #endif
1186    
1187     static void
1188     eio_page_align (void **addr, size_t *length)
1189     {
1190     intptr_t mask = eio_pagesize () - 1;
1191    
1192     /* round down addr */
1193     intptr_t adj = mask & (intptr_t)*addr;
1194    
1195     *addr = (void *)((intptr_t)*addr - adj);
1196     *length += adj;
1197    
1198     /* round up length */
1199     *length = (*length + mask) & ~mask;
1200     }
1201    
1202     #if !_POSIX_MEMLOCK
1203 root 1.89 # define eio__mlockall(a) EIO_ENOSYS ()
1204 root 1.77 #else
1205    
1206     static int
1207     eio__mlockall (int flags)
1208     {
1209     #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7
1210     extern int mallopt (int, int);
1211     mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */
1212     #endif
1213    
1214     if (EIO_MCL_CURRENT != MCL_CURRENT
1215     || EIO_MCL_FUTURE != MCL_FUTURE)
1216     {
1217     flags = 0
1218     | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0)
1219     | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0);
1220     }
1221    
1222     return mlockall (flags);
1223     }
1224     #endif
1225    
1226     #if !_POSIX_MEMLOCK_RANGE
1227 root 1.86 # define eio__mlock(a,b) EIO_ENOSYS ()
1228 root 1.77 #else
1229    
1230     static int
1231     eio__mlock (void *addr, size_t length)
1232     {
1233     eio_page_align (&addr, &length);
1234    
1235     return mlock (addr, length);
1236     }
1237    
1238     #endif
1239    
1240     #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1241 root 1.86 # define eio__msync(a,b,c) EIO_ENOSYS ()
1242 root 1.77 #else
1243    
1244     static int
1245     eio__msync (void *mem, size_t len, int flags)
1246     {
1247     eio_page_align (&mem, &len);
1248    
1249     if (EIO_MS_ASYNC != MS_SYNC
1250     || EIO_MS_INVALIDATE != MS_INVALIDATE
1251     || EIO_MS_SYNC != MS_SYNC)
1252     {
1253     flags = 0
1254     | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0)
1255     | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0)
1256     | (flags & EIO_MS_SYNC ? MS_SYNC : 0);
1257     }
1258    
1259     return msync (mem, len, flags);
1260     }
1261    
1262     #endif
1263    
1264     static int
1265     eio__mtouch (eio_req *req)
1266     {
1267     void *mem = req->ptr2;
1268     size_t len = req->size;
1269     int flags = req->int1;
1270    
1271     eio_page_align (&mem, &len);
1272    
1273     {
1274     intptr_t addr = (intptr_t)mem;
1275     intptr_t end = addr + len;
1276     intptr_t page = eio_pagesize ();
1277    
1278     if (addr < end)
1279     if (flags & EIO_MT_MODIFY) /* modify */
1280     do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req));
1281     else
1282     do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req));
1283     }
1284    
1285     return 0;
1286     }
1287    
1288     /*****************************************************************************/
1289     /* requests implemented outside eio_execute, because they are so large */
1290    
1291     static void
1292     eio__realpath (eio_req *req, etp_worker *self)
1293     {
1294     char *rel = req->ptr1;
1295     char *res;
1296     char *tmp1, *tmp2;
1297     #if SYMLOOP_MAX > 32
1298 root 1.78 int symlinks = SYMLOOP_MAX;
1299 root 1.77 #else
1300 root 1.78 int symlinks = 32;
1301 root 1.77 #endif
1302    
1303     req->result = -1;
1304    
1305     errno = EINVAL;
1306     if (!rel)
1307     return;
1308    
1309     errno = ENOENT;
1310     if (!*rel)
1311     return;
1312    
1313     if (!req->ptr2)
1314     {
1315     X_LOCK (wrklock);
1316     req->flags |= EIO_FLAG_PTR2_FREE;
1317     X_UNLOCK (wrklock);
1318     req->ptr2 = malloc (PATH_MAX * 3);
1319    
1320     errno = ENOMEM;
1321     if (!req->ptr2)
1322     return;
1323     }
1324    
1325     res = req->ptr2;
1326     tmp1 = res + PATH_MAX;
1327     tmp2 = tmp1 + PATH_MAX;
1328    
1329 root 1.78 #if 0 /* disabled, the musl way to do things is just too racy */
1330     #if __linux && defined(O_NONBLOCK) && defined(O_NOATIME)
1331     /* on linux we may be able to ask the kernel */
1332     {
1333     int fd = open (rel, O_RDONLY | O_NONBLOCK | O_NOCTTY | O_NOATIME);
1334    
1335     if (fd >= 0)
1336     {
1337     sprintf (tmp1, "/proc/self/fd/%d", fd);
1338     req->result = readlink (tmp1, res, PATH_MAX);
1339     close (fd);
1340    
1341     /* here we should probably stat the open file and the disk file, to make sure they still match */
1342    
1343     if (req->result > 0)
1344     goto done;
1345     }
1346     else if (errno == ELOOP || errno == ENAMETOOLONG || errno == ENOENT || errno == ENOTDIR || errno == EIO)
1347     return;
1348     }
1349     #endif
1350     #endif
1351    
1352 root 1.77 if (*rel != '/')
1353     {
1354     if (!getcwd (res, PATH_MAX))
1355     return;
1356    
1357     if (res [1]) /* only use if not / */
1358     res += strlen (res);
1359     }
1360    
1361     while (*rel)
1362     {
1363 root 1.88 eio_ssize_t len, linklen;
1364 root 1.77 char *beg = rel;
1365    
1366     while (*rel && *rel != '/')
1367     ++rel;
1368    
1369     len = rel - beg;
1370    
1371     if (!len) /* skip slashes */
1372     {
1373     ++rel;
1374     continue;
1375     }
1376    
1377     if (beg [0] == '.')
1378     {
1379     if (len == 1)
1380     continue; /* . - nop */
1381    
1382     if (beg [1] == '.' && len == 2)
1383     {
1384     /* .. - back up one component, if possible */
1385    
1386     while (res != req->ptr2)
1387     if (*--res == '/')
1388     break;
1389    
1390     continue;
1391     }
1392     }
1393    
1394     errno = ENAMETOOLONG;
1395     if (res + 1 + len + 1 >= tmp1)
1396     return;
1397    
1398     /* copy one component */
1399     *res = '/';
1400     memcpy (res + 1, beg, len);
1401    
1402     /* zero-terminate, for readlink */
1403     res [len + 1] = 0;
1404    
1405     /* now check if it's a symlink */
1406     linklen = readlink (req->ptr2, tmp1, PATH_MAX);
1407    
1408     if (linklen < 0)
1409     {
1410     if (errno != EINVAL)
1411     return;
1412    
1413     /* it's a normal directory. hopefully */
1414     res += len + 1;
1415     }
1416     else
1417     {
1418     /* yay, it was a symlink - build new path in tmp2 */
1419     int rellen = strlen (rel);
1420    
1421     errno = ENAMETOOLONG;
1422     if (linklen + 1 + rellen >= PATH_MAX)
1423     return;
1424    
1425 root 1.78 errno = ELOOP;
1426     if (!--symlinks)
1427     return;
1428    
1429 root 1.77 if (*tmp1 == '/')
1430     res = req->ptr2; /* symlink resolves to an absolute path */
1431    
1432     /* we need to be careful, as rel might point into tmp2 already */
1433     memmove (tmp2 + linklen + 1, rel, rellen + 1);
1434     tmp2 [linklen] = '/';
1435     memcpy (tmp2, tmp1, linklen);
1436    
1437     rel = tmp2;
1438     }
1439     }
1440    
1441     /* special case for the lone root path */
1442     if (res == req->ptr2)
1443     *res++ = '/';
1444    
1445     req->result = res - (char *)req->ptr2;
1446 root 1.78
1447     done:
1448 root 1.77 req->ptr2 = realloc (req->ptr2, req->result); /* trade time for space savings */
1449     }
1450    
1451 root 1.37 static signed char
1452     eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
1453     {
1454 root 1.63 return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
1455     : a->inode < b->inode ? -1
1456     : a->inode > b->inode ? 1
1457     : 0;
1458 root 1.37 }
1459    
1460 root 1.39 #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1461    
1462 root 1.42 #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1463     #define EIO_SORT_FAST 60 /* when to only use insertion sort */
1464 root 1.37
1465     static void
1466 root 1.42 eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1467 root 1.31 {
1468 root 1.42 unsigned char bits [9 + sizeof (ino_t) * 8];
1469     unsigned char *bit = bits;
1470    
1471     assert (CHAR_BIT == 8);
1472     assert (sizeof (eio_dirent) * 8 < 256);
1473 root 1.63 assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */
1474     assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */
1475 root 1.42
1476     if (size <= EIO_SORT_FAST)
1477     return;
1478    
1479     /* first prepare an array of bits to test in our radix sort */
1480     /* try to take endianness into account, as well as differences in ino_t sizes */
1481     /* inode_bits must contain all inodes ORed together */
1482     /* which is used to skip bits that are 0 everywhere, which is very common */
1483     {
1484     ino_t endianness;
1485     int i, j;
1486 root 1.39
1487 root 1.42 /* we store the byte offset of byte n into byte n of "endianness" */
1488     for (i = 0; i < sizeof (ino_t); ++i)
1489     ((unsigned char *)&endianness)[i] = i;
1490 root 1.37
1491 root 1.42 *bit++ = 0;
1492 root 1.37
1493 root 1.42 for (i = 0; i < sizeof (ino_t); ++i)
1494     {
1495     /* shifting off the byte offsets out of "endianness" */
1496     int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1497     endianness >>= 8;
1498    
1499     for (j = 0; j < 8; ++j)
1500     if (inode_bits & (((ino_t)1) << (i * 8 + j)))
1501     *bit++ = offs + j;
1502     }
1503 root 1.38
1504 root 1.42 for (j = 0; j < 8; ++j)
1505     if (score_bits & (1 << j))
1506     *bit++ = offsetof (eio_dirent, score) * 8 + j;
1507     }
1508 root 1.37
1509 root 1.42 /* now actually do the sorting (a variant of MSD radix sort) */
1510     {
1511     eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base;
1512     eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end;
1513     unsigned char *bit_stk [9 + sizeof (ino_t) * 8];
1514     int stk_idx = 0;
1515    
1516     base_stk [stk_idx] = dents;
1517     end_stk [stk_idx] = dents + size;
1518     bit_stk [stk_idx] = bit - 1;
1519 root 1.37
1520 root 1.42 do
1521     {
1522     base = base_stk [stk_idx];
1523     end = end_stk [stk_idx];
1524     bit = bit_stk [stk_idx];
1525 root 1.37
1526 root 1.42 for (;;)
1527     {
1528     unsigned char O = *bit >> 3;
1529     unsigned char M = 1 << (*bit & 7);
1530 root 1.31
1531 root 1.42 eio_dirent *a = base;
1532     eio_dirent *b = end;
1533 root 1.37
1534 root 1.42 if (b - a < EIO_SORT_CUTOFF)
1535     break;
1536 root 1.37
1537 root 1.42 /* now bit-partition the array on the bit */
1538     /* this ugly asymmetric loop seems to perform much better than typical */
1539     /* partition algos found in the literature */
1540     do
1541     if (!(((unsigned char *)a)[O] & M))
1542     ++a;
1543     else if (!(((unsigned char *)--b)[O] & M))
1544 root 1.38 {
1545 root 1.42 eio_dirent tmp = *a; *a = *b; *b = tmp;
1546     ++a;
1547     }
1548     while (b > a);
1549    
1550     /* next bit, or stop, if no bits left in this path */
1551     if (!*--bit)
1552     break;
1553 root 1.37
1554 root 1.42 base_stk [stk_idx] = a;
1555     end_stk [stk_idx] = end;
1556     bit_stk [stk_idx] = bit;
1557     ++stk_idx;
1558    
1559     end = a;
1560     }
1561     }
1562     while (stk_idx--);
1563     }
1564     }
1565 root 1.37
1566 root 1.42 static void
1567     eio_dent_insertion_sort (eio_dirent *dents, int size)
1568     {
1569 root 1.39 /* first move the smallest element to the front, to act as a sentinel */
1570     {
1571 root 1.41 int i;
1572     eio_dirent *min = dents;
1573    
1574 root 1.42 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1575     for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1576 root 1.41 if (EIO_DENT_CMP (dents [i], <, *min))
1577     min = &dents [i];
1578 root 1.39
1579     /* swap elements 0 and j (minimum) */
1580     {
1581 root 1.41 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1582 root 1.39 }
1583     }
1584    
1585 root 1.42 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1586 root 1.41 {
1587     eio_dirent *i, *j;
1588    
1589     for (i = dents + 1; i < dents + size; ++i)
1590     {
1591     eio_dirent value = *i;
1592 root 1.37
1593 root 1.41 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1594     j [1] = j [0];
1595 root 1.37
1596 root 1.41 j [1] = value;
1597     }
1598     }
1599 root 1.31 }
1600    
1601 root 1.42 static void
1602     eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1603     {
1604     if (size <= 1)
1605     return; /* our insertion sort relies on size > 0 */
1606    
1607     /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1608     /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1609     eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1610    
1611     /* use an insertion sort at the end, or for small arrays, */
1612     /* as insertion sort is more efficient for small partitions */
1613     eio_dent_insertion_sort (dents, size);
1614     }
1615    
1616 root 1.1 /* read a full directory */
1617 root 1.9 static void
1618 root 1.14 eio__scandir (eio_req *req, etp_worker *self)
1619 root 1.1 {
1620     DIR *dirp;
1621     EIO_STRUCT_DIRENT *entp;
1622 root 1.37 char *name, *names;
1623 root 1.31 int namesalloc = 4096;
1624     int namesoffs = 0;
1625     int flags = req->int1;
1626     eio_dirent *dents = 0;
1627     int dentalloc = 128;
1628     int dentoffs = 0;
1629 root 1.42 ino_t inode_bits = 0;
1630 root 1.31
1631     req->result = -1;
1632    
1633     if (!(flags & EIO_READDIR_DENTS))
1634     flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
1635 root 1.1
1636 root 1.14 X_LOCK (wrklock);
1637 root 1.20 /* the corresponding closedir is in ETP_WORKER_CLEAR */
1638 root 1.1 self->dirp = dirp = opendir (req->ptr1);
1639 root 1.63
1640 root 1.74 if (req->flags & EIO_FLAG_PTR1_FREE)
1641     free (req->ptr1);
1642    
1643 root 1.31 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1644 root 1.42 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
1645     req->ptr2 = names = malloc (namesalloc);
1646 root 1.14 X_UNLOCK (wrklock);
1647 root 1.1
1648 root 1.31 if (dirp && names && (!flags || dents))
1649 root 1.1 for (;;)
1650     {
1651     errno = 0;
1652 root 1.16 entp = readdir (dirp);
1653 root 1.1
1654     if (!entp)
1655 root 1.31 {
1656     if (errno)
1657     break;
1658    
1659     /* sort etc. */
1660     req->int1 = flags;
1661     req->result = dentoffs;
1662    
1663 root 1.42 if (flags & EIO_READDIR_STAT_ORDER)
1664 root 1.63 eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits);
1665 root 1.32 else if (flags & EIO_READDIR_DIRS_FIRST)
1666 root 1.42 if (flags & EIO_READDIR_FOUND_UNKNOWN)
1667     eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1668     else
1669     {
1670     /* in this case, all is known, and we just put dirs first and sort them */
1671     eio_dirent *oth = dents + dentoffs;
1672     eio_dirent *dir = dents;
1673    
1674     /* now partition dirs to the front, and non-dirs to the back */
1675     /* by walking from both sides and swapping if necessary */
1676     while (oth > dir)
1677     {
1678     if (dir->type == EIO_DT_DIR)
1679 root 1.41 ++dir;
1680 root 1.42 else if ((--oth)->type == EIO_DT_DIR)
1681     {
1682     eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1683    
1684     ++dir;
1685     }
1686     }
1687 root 1.31
1688 root 1.64 /* now sort the dirs only (dirs all have the same score) */
1689 root 1.42 eio_dent_sort (dents, dir - dents, 0, inode_bits);
1690     }
1691 root 1.31
1692     break;
1693     }
1694 root 1.1
1695 root 1.32 /* now add the entry to our list(s) */
1696 root 1.1 name = entp->d_name;
1697    
1698 root 1.32 /* skip . and .. entries */
1699 root 1.1 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
1700     {
1701 root 1.33 int len = D_NAMLEN (entp) + 1;
1702 root 1.1
1703 root 1.72 while (ecb_expect_false (namesoffs + len > namesalloc))
1704 root 1.1 {
1705 root 1.31 namesalloc *= 2;
1706 root 1.14 X_LOCK (wrklock);
1707 root 1.42 req->ptr2 = names = realloc (names, namesalloc);
1708 root 1.14 X_UNLOCK (wrklock);
1709 root 1.1
1710     if (!names)
1711     break;
1712     }
1713    
1714 root 1.31 memcpy (names + namesoffs, name, len);
1715    
1716     if (dents)
1717     {
1718     struct eio_dirent *ent;
1719    
1720 root 1.72 if (ecb_expect_false (dentoffs == dentalloc))
1721 root 1.31 {
1722     dentalloc *= 2;
1723     X_LOCK (wrklock);
1724 root 1.42 req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1725 root 1.31 X_UNLOCK (wrklock);
1726    
1727     if (!dents)
1728     break;
1729     }
1730    
1731     ent = dents + dentoffs;
1732    
1733 root 1.42 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1734 root 1.31 ent->namelen = len - 1;
1735 root 1.42 ent->inode = D_INO (entp);
1736    
1737     inode_bits |= ent->inode;
1738 root 1.31
1739     switch (D_TYPE (entp))
1740     {
1741     default:
1742     ent->type = EIO_DT_UNKNOWN;
1743     flags |= EIO_READDIR_FOUND_UNKNOWN;
1744     break;
1745    
1746     #ifdef DT_FIFO
1747     case DT_FIFO: ent->type = EIO_DT_FIFO; break;
1748     #endif
1749     #ifdef DT_CHR
1750     case DT_CHR: ent->type = EIO_DT_CHR; break;
1751     #endif
1752 root 1.33 #ifdef DT_MPC
1753     case DT_MPC: ent->type = EIO_DT_MPC; break;
1754     #endif
1755 root 1.32 #ifdef DT_DIR
1756 root 1.31 case DT_DIR: ent->type = EIO_DT_DIR; break;
1757     #endif
1758 root 1.33 #ifdef DT_NAM
1759     case DT_NAM: ent->type = EIO_DT_NAM; break;
1760     #endif
1761 root 1.32 #ifdef DT_BLK
1762 root 1.31 case DT_BLK: ent->type = EIO_DT_BLK; break;
1763     #endif
1764 root 1.33 #ifdef DT_MPB
1765     case DT_MPB: ent->type = EIO_DT_MPB; break;
1766     #endif
1767 root 1.32 #ifdef DT_REG
1768 root 1.31 case DT_REG: ent->type = EIO_DT_REG; break;
1769     #endif
1770 root 1.33 #ifdef DT_NWK
1771     case DT_NWK: ent->type = EIO_DT_NWK; break;
1772     #endif
1773     #ifdef DT_CMP
1774     case DT_CMP: ent->type = EIO_DT_CMP; break;
1775     #endif
1776 root 1.32 #ifdef DT_LNK
1777 root 1.31 case DT_LNK: ent->type = EIO_DT_LNK; break;
1778     #endif
1779     #ifdef DT_SOCK
1780     case DT_SOCK: ent->type = EIO_DT_SOCK; break;
1781     #endif
1782 root 1.33 #ifdef DT_DOOR
1783     case DT_DOOR: ent->type = EIO_DT_DOOR; break;
1784     #endif
1785 root 1.31 #ifdef DT_WHT
1786     case DT_WHT: ent->type = EIO_DT_WHT; break;
1787     #endif
1788     }
1789    
1790 root 1.42 ent->score = 7;
1791 root 1.31
1792     if (flags & EIO_READDIR_DIRS_FIRST)
1793     {
1794     if (ent->type == EIO_DT_UNKNOWN)
1795     {
1796     if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1797 root 1.42 ent->score = 1;
1798 root 1.31 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1799 root 1.42 ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1800 root 1.31 }
1801 root 1.33 else if (ent->type == EIO_DT_DIR)
1802 root 1.42 ent->score = 0;
1803 root 1.31 }
1804     }
1805    
1806     namesoffs += len;
1807     ++dentoffs;
1808 root 1.1 }
1809 root 1.36
1810     if (EIO_CANCELLED (req))
1811     {
1812     errno = ECANCELED;
1813     break;
1814     }
1815 root 1.1 }
1816     }
1817    
1818     /*****************************************************************************/
1819    
1820 root 1.6 #define ALLOC(len) \
1821     if (!req->ptr2) \
1822     { \
1823 root 1.14 X_LOCK (wrklock); \
1824 root 1.7 req->flags |= EIO_FLAG_PTR2_FREE; \
1825 root 1.14 X_UNLOCK (wrklock); \
1826 root 1.7 req->ptr2 = malloc (len); \
1827     if (!req->ptr2) \
1828     { \
1829     errno = ENOMEM; \
1830     req->result = -1; \
1831     break; \
1832     } \
1833 root 1.6 }
1834    
1835 root 1.14 X_THREAD_PROC (etp_proc)
1836 root 1.1 {
1837 root 1.14 ETP_REQ *req;
1838 root 1.1 struct timespec ts;
1839 root 1.14 etp_worker *self = (etp_worker *)thr_arg;
1840 root 1.85 int timeout;
1841 root 1.1
1842 root 1.85 /* try to distribute timeouts somewhat evenly */
1843 root 1.1 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
1844    
1845     for (;;)
1846     {
1847 root 1.85 ts.tv_sec = 0;
1848    
1849 root 1.1 X_LOCK (reqlock);
1850    
1851     for (;;)
1852     {
1853     self->req = req = reqq_shift (&req_queue);
1854    
1855     if (req)
1856     break;
1857    
1858 root 1.85 if (ts.tv_sec == 1) /* no request, but timeout detected, let's quit */
1859     {
1860     X_UNLOCK (reqlock);
1861     X_LOCK (wrklock);
1862     --started;
1863     X_UNLOCK (wrklock);
1864     goto quit;
1865     }
1866    
1867 root 1.1 ++idle;
1868    
1869 root 1.85 if (idle <= max_idle)
1870     /* we are allowed to idle, so do so without any timeout */
1871     X_COND_WAIT (reqwait, reqlock);
1872     else
1873 root 1.1 {
1874 root 1.85 /* initialise timeout once */
1875     if (!ts.tv_sec)
1876     ts.tv_sec = time (0) + idle_timeout;
1877 root 1.1
1878 root 1.85 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
1879     ts.tv_sec = 1; /* assuming this is not a value computed above.,.. */
1880 root 1.1 }
1881    
1882     --idle;
1883     }
1884    
1885     --nready;
1886    
1887     X_UNLOCK (reqlock);
1888    
1889 root 1.15 if (req->type < 0)
1890     goto quit;
1891 root 1.1
1892 root 1.80 ETP_EXECUTE (self, req);
1893 root 1.1
1894     X_LOCK (reslock);
1895    
1896     ++npending;
1897    
1898 root 1.14 if (!reqq_push (&res_queue, req) && want_poll_cb)
1899     want_poll_cb ();
1900 root 1.1
1901     self->req = 0;
1902 root 1.14 etp_worker_clear (self);
1903 root 1.1
1904     X_UNLOCK (reslock);
1905     }
1906    
1907     quit:
1908 root 1.14 X_LOCK (wrklock);
1909     etp_worker_free (self);
1910     X_UNLOCK (wrklock);
1911 root 1.1
1912     return 0;
1913     }
1914    
1915     /*****************************************************************************/
1916    
1917 root 1.72 int ecb_cold
1918     eio_init (void (*want_poll)(void), void (*done_poll)(void))
1919 root 1.1 {
1920 root 1.19 return etp_init (want_poll, done_poll);
1921 root 1.1 }
1922    
1923 root 1.73 ecb_inline void
1924 root 1.72 eio_api_destroy (eio_req *req)
1925 root 1.6 {
1926     free (req);
1927     }
1928    
1929     #define REQ(rtype) \
1930     eio_req *req; \
1931     \
1932     req = (eio_req *)calloc (1, sizeof *req); \
1933     if (!req) \
1934     return 0; \
1935     \
1936 root 1.11 req->type = rtype; \
1937     req->pri = pri; \
1938     req->finish = cb; \
1939     req->data = data; \
1940 root 1.6 req->destroy = eio_api_destroy;
1941    
1942     #define SEND eio_submit (req); return req
1943    
1944 root 1.9 #define PATH \
1945     req->flags |= EIO_FLAG_PTR1_FREE; \
1946     req->ptr1 = strdup (path); \
1947     if (!req->ptr1) \
1948     { \
1949     eio_api_destroy (req); \
1950     return 0; \
1951     }
1952    
1953 root 1.72 static void
1954     eio_execute (etp_worker *self, eio_req *req)
1955 root 1.15 {
1956 root 1.80 if (ecb_expect_false (EIO_CANCELLED (req)))
1957     {
1958     req->result = -1;
1959     req->errorno = ECANCELED;
1960     return;
1961     }
1962    
1963 root 1.15 switch (req->type)
1964     {
1965     case EIO_READ: ALLOC (req->size);
1966     req->result = req->offs >= 0
1967     ? pread (req->int1, req->ptr2, req->size, req->offs)
1968     : read (req->int1, req->ptr2, req->size); break;
1969     case EIO_WRITE: req->result = req->offs >= 0
1970     ? pwrite (req->int1, req->ptr2, req->size, req->offs)
1971     : write (req->int1, req->ptr2, req->size); break;
1972    
1973     case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
1974     case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break;
1975    
1976     case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1977     req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1978     case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1979     req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1980     case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1981     req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
1982    
1983 root 1.51 case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1984     req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1985     case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1986     req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1987    
1988 root 1.15 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
1989     case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
1990     case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
1991     case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
1992     case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
1993     case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
1994    
1995     case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
1996     case EIO_CLOSE: req->result = close (req->int1); break;
1997     case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
1998     case EIO_UNLINK: req->result = unlink (req->ptr1); break;
1999     case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
2000     case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
2001     case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
2002     case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
2003     case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
2004 root 1.61 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
2005 root 1.15
2006 root 1.77 case EIO_REALPATH: eio__realpath (req, self); break;
2007 root 1.76
2008 root 1.54 case EIO_READLINK: ALLOC (PATH_MAX);
2009     req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break;
2010 root 1.15
2011     case EIO_SYNC: req->result = 0; sync (); break;
2012     case EIO_FSYNC: req->result = fsync (req->int1); break;
2013     case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
2014 root 1.48 case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break;
2015 root 1.67 case EIO_MTOUCH: req->result = eio__mtouch (req); break;
2016 root 1.56 case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break;
2017     case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break;
2018 root 1.27 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
2019 root 1.83 case EIO_FALLOCATE: req->result = eio__fallocate (req->int1, req->int2, req->offs, req->size); break;
2020 root 1.15
2021     case EIO_READDIR: eio__scandir (req, self); break;
2022    
2023     case EIO_BUSY:
2024     #ifdef _WIN32
2025 root 1.57 Sleep (req->nv1 * 1e3);
2026 root 1.15 #else
2027     {
2028     struct timeval tv;
2029    
2030     tv.tv_sec = req->nv1;
2031 root 1.57 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6;
2032 root 1.15
2033     req->result = select (0, 0, 0, 0, &tv);
2034     }
2035     #endif
2036     break;
2037    
2038     case EIO_UTIME:
2039     case EIO_FUTIME:
2040     {
2041     struct timeval tv[2];
2042     struct timeval *times;
2043    
2044     if (req->nv1 != -1. || req->nv2 != -1.)
2045     {
2046     tv[0].tv_sec = req->nv1;
2047     tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
2048     tv[1].tv_sec = req->nv2;
2049     tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
2050    
2051     times = tv;
2052     }
2053     else
2054     times = 0;
2055    
2056     req->result = req->type == EIO_FUTIME
2057     ? futimes (req->int1, times)
2058     : utimes (req->ptr1, times);
2059     }
2060 root 1.25 break;
2061 root 1.15
2062     case EIO_GROUP:
2063 root 1.24 abort (); /* handled in eio_request */
2064    
2065 root 1.15 case EIO_NOP:
2066     req->result = 0;
2067     break;
2068    
2069     case EIO_CUSTOM:
2070 root 1.68 req->feed (req);
2071 root 1.15 break;
2072    
2073     default:
2074 root 1.58 errno = ENOSYS;
2075 root 1.15 req->result = -1;
2076     break;
2077     }
2078    
2079     req->errorno = errno;
2080     }
2081    
2082 root 1.12 #ifndef EIO_NO_WRAPPERS
2083    
2084 root 1.10 eio_req *eio_nop (int pri, eio_cb cb, void *data)
2085 root 1.9 {
2086     REQ (EIO_NOP); SEND;
2087     }
2088    
2089 root 1.10 eio_req *eio_busy (double delay, int pri, eio_cb cb, void *data)
2090 root 1.9 {
2091     REQ (EIO_BUSY); req->nv1 = delay; SEND;
2092     }
2093    
2094 root 1.10 eio_req *eio_sync (int pri, eio_cb cb, void *data)
2095 root 1.9 {
2096     REQ (EIO_SYNC); SEND;
2097     }
2098 root 1.6
2099 root 1.10 eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data)
2100 root 1.6 {
2101 root 1.9 REQ (EIO_FSYNC); req->int1 = fd; SEND;
2102 root 1.6 }
2103    
2104 root 1.23 eio_req *eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
2105     {
2106     REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
2107     }
2108    
2109     eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
2110     {
2111     REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
2112     }
2113    
2114 root 1.56 eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data)
2115     {
2116     REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND;
2117     }
2118    
2119     eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data)
2120     {
2121     REQ (EIO_MLOCKALL); req->int1 = flags; SEND;
2122     }
2123    
2124 root 1.27 eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
2125     {
2126     REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND;
2127     }
2128    
2129 root 1.83 eio_req *eio_fallocate (int fd, int mode, off_t offset, size_t len, int pri, eio_cb cb, void *data)
2130     {
2131     REQ (EIO_FALLOCATE); req->int1 = fd; req->int2 = mode; req->offs = offset; req->size = len; SEND;
2132     }
2133    
2134 root 1.10 eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data)
2135 root 1.6 {
2136 root 1.9 REQ (EIO_FDATASYNC); req->int1 = fd; SEND;
2137     }
2138    
2139 root 1.10 eio_req *eio_close (int fd, int pri, eio_cb cb, void *data)
2140 root 1.9 {
2141     REQ (EIO_CLOSE); req->int1 = fd; SEND;
2142 root 1.6 }
2143    
2144 root 1.10 eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data)
2145 root 1.6 {
2146 root 1.9 REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND;
2147 root 1.6 }
2148    
2149 root 1.10 eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
2150 root 1.6 {
2151 root 1.10 REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
2152 root 1.6 }
2153    
2154 root 1.10 eio_req *eio_write (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
2155 root 1.6 {
2156 root 1.10 REQ (EIO_WRITE); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
2157 root 1.6 }
2158    
2159 root 1.10 eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
2160 root 1.6 {
2161 root 1.9 REQ (EIO_FSTAT); req->int1 = fd; SEND;
2162 root 1.6 }
2163    
2164 root 1.51 eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data)
2165     {
2166     REQ (EIO_FSTATVFS); req->int1 = fd; SEND;
2167     }
2168    
2169 root 1.10 eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data)
2170 root 1.6 {
2171 root 1.9 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
2172 root 1.6 }
2173    
2174 root 1.10 eio_req *eio_ftruncate (int fd, off_t offset, int pri, eio_cb cb, void *data)
2175 root 1.6 {
2176 root 1.9 REQ (EIO_FTRUNCATE); req->int1 = fd; req->offs = offset; SEND;
2177 root 1.6 }
2178    
2179 root 1.10 eio_req *eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data)
2180 root 1.6 {
2181 root 1.9 REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND;
2182 root 1.6 }
2183    
2184 root 1.88 eio_req *eio_fchown (int fd, eio_uid_t uid, eio_gid_t gid, int pri, eio_cb cb, void *data)
2185 root 1.6 {
2186 root 1.9 REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
2187 root 1.6 }
2188    
2189 root 1.10 eio_req *eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data)
2190 root 1.6 {
2191 root 1.9 REQ (EIO_DUP2); req->int1 = fd; req->int2 = fd2; SEND;
2192 root 1.6 }
2193    
2194 root 1.10 eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, int pri, eio_cb cb, void *data)
2195 root 1.6 {
2196 root 1.9 REQ (EIO_SENDFILE); req->int1 = out_fd; req->int2 = in_fd; req->offs = in_offset; req->size = length; SEND;
2197 root 1.6 }
2198    
2199 root 1.10 eio_req *eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data)
2200 root 1.6 {
2201 root 1.9 REQ (EIO_OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND;
2202 root 1.6 }
2203    
2204 root 1.10 eio_req *eio_utime (const char *path, double atime, double mtime, int pri, eio_cb cb, void *data)
2205 root 1.6 {
2206 root 1.9 REQ (EIO_UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND;
2207 root 1.6 }
2208    
2209 root 1.10 eio_req *eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data)
2210 root 1.6 {
2211 root 1.9 REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND;
2212 root 1.6 }
2213    
2214 root 1.88 eio_req *eio_chown (const char *path, eio_uid_t uid, eio_gid_t gid, int pri, eio_cb cb, void *data)
2215 root 1.6 {
2216 root 1.9 REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
2217 root 1.6 }
2218    
2219 root 1.10 eio_req *eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
2220 root 1.6 {
2221 root 1.9 REQ (EIO_CHMOD); PATH; req->int2 = (long)mode; SEND;
2222 root 1.6 }
2223    
2224 root 1.10 eio_req *eio_mkdir (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
2225 root 1.6 {
2226 root 1.9 REQ (EIO_MKDIR); PATH; req->int2 = (long)mode; SEND;
2227 root 1.6 }
2228    
2229 root 1.9 static eio_req *
2230 root 1.10 eio__1path (int type, const char *path, int pri, eio_cb cb, void *data)
2231 root 1.6 {
2232 root 1.9 REQ (type); PATH; SEND;
2233 root 1.6 }
2234    
2235 root 1.10 eio_req *eio_readlink (const char *path, int pri, eio_cb cb, void *data)
2236 root 1.6 {
2237 root 1.10 return eio__1path (EIO_READLINK, path, pri, cb, data);
2238 root 1.6 }
2239    
2240 root 1.76 eio_req *eio_realpath (const char *path, int pri, eio_cb cb, void *data)
2241     {
2242     return eio__1path (EIO_REALPATH, path, pri, cb, data);
2243     }
2244    
2245 root 1.10 eio_req *eio_stat (const char *path, int pri, eio_cb cb, void *data)
2246 root 1.6 {
2247 root 1.10 return eio__1path (EIO_STAT, path, pri, cb, data);
2248 root 1.6 }
2249    
2250 root 1.10 eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data)
2251 root 1.6 {
2252 root 1.10 return eio__1path (EIO_LSTAT, path, pri, cb, data);
2253 root 1.6 }
2254    
2255 root 1.51 eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data)
2256     {
2257     return eio__1path (EIO_STATVFS, path, pri, cb, data);
2258     }
2259    
2260 root 1.10 eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data)
2261 root 1.6 {
2262 root 1.10 return eio__1path (EIO_UNLINK, path, pri, cb, data);
2263 root 1.6 }
2264    
2265 root 1.10 eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
2266 root 1.6 {
2267 root 1.10 return eio__1path (EIO_RMDIR, path, pri, cb, data);
2268 root 1.6 }
2269    
2270 root 1.31 eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data)
2271 root 1.1 {
2272 root 1.31 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
2273 root 1.1 }
2274    
2275 root 1.10 eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
2276 root 1.1 {
2277 root 1.61 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND;
2278 root 1.1 }
2279    
2280 root 1.9 static eio_req *
2281 root 1.10 eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2282 root 1.1 {
2283 root 1.9 REQ (type); PATH;
2284 root 1.1
2285 root 1.9 req->flags |= EIO_FLAG_PTR2_FREE;
2286     req->ptr2 = strdup (new_path);
2287     if (!req->ptr2)
2288     {
2289     eio_api_destroy (req);
2290     return 0;
2291     }
2292 root 1.1
2293 root 1.9 SEND;
2294 root 1.1 }
2295    
2296 root 1.10 eio_req *eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2297 root 1.1 {
2298 root 1.10 return eio__2path (EIO_LINK, path, new_path, pri, cb, data);
2299 root 1.1 }
2300    
2301 root 1.10 eio_req *eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2302 root 1.1 {
2303 root 1.10 return eio__2path (EIO_SYMLINK, path, new_path, pri, cb, data);
2304 root 1.1 }
2305    
2306 root 1.10 eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2307 root 1.1 {
2308 root 1.10 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
2309     }
2310    
2311 root 1.71 eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data)
2312 root 1.15 {
2313 root 1.68 REQ (EIO_CUSTOM); req->feed = execute; SEND;
2314 root 1.15 }
2315    
2316 root 1.12 #endif
2317    
2318 root 1.10 eio_req *eio_grp (eio_cb cb, void *data)
2319     {
2320     const int pri = EIO_PRI_MAX;
2321    
2322     REQ (EIO_GROUP); SEND;
2323 root 1.1 }
2324    
2325 root 1.9 #undef REQ
2326     #undef PATH
2327     #undef SEND
2328 root 1.1
2329 root 1.9 /*****************************************************************************/
2330     /* grp functions */
2331 root 1.1
2332 root 1.72 void
2333     eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit)
2334 root 1.1 {
2335     grp->int2 = limit;
2336     grp->feed = feed;
2337 root 1.2
2338     grp_try_feed (grp);
2339     }
2340    
2341 root 1.72 void
2342     eio_grp_limit (eio_req *grp, int limit)
2343 root 1.2 {
2344     grp->int2 = limit;
2345    
2346     grp_try_feed (grp);
2347 root 1.1 }
2348    
2349 root 1.72 void
2350     eio_grp_add (eio_req *grp, eio_req *req)
2351 root 1.1 {
2352     assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2));
2353    
2354 root 1.26 grp->flags |= EIO_FLAG_GROUPADD;
2355    
2356 root 1.1 ++grp->size;
2357     req->grp = grp;
2358    
2359     req->grp_prev = 0;
2360     req->grp_next = grp->grp_first;
2361    
2362     if (grp->grp_first)
2363     grp->grp_first->grp_prev = req;
2364    
2365     grp->grp_first = req;
2366     }
2367    
2368 root 1.9 /*****************************************************************************/
2369     /* misc garbage */
2370    
2371 root 1.88 eio_ssize_t
2372 root 1.72 eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
2373 root 1.9 {
2374 root 1.14 etp_worker wrk;
2375 root 1.88 eio_ssize_t ret;
2376 root 1.9
2377     wrk.dbuf = 0;
2378    
2379 root 1.37 ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
2380 root 1.9
2381     if (wrk.dbuf)
2382     free (wrk.dbuf);
2383 root 1.37
2384     return ret;
2385 root 1.9 }
2386 root 1.1