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