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