ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.105
Committed: Mon Sep 26 18:23:18 2011 UTC (12 years, 8 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.104: +62 -26 lines
Log Message:
more

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