ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.54
Committed: Tue Feb 23 14:32:45 2010 UTC (14 years, 3 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.53: +7 -2 lines
Log Message:
*** empty log message ***

File Contents

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