ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.78
Committed: Tue Jul 5 14:38:53 2011 UTC (12 years, 11 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.77: +31 -2 lines
Log Message:
*** empty log message ***

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