ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.82
Committed: Thu Jul 7 15:44:44 2011 UTC (12 years, 11 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.81: +4 -1 lines
Log Message:
fix sendfile on darwin differently

File Contents

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