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