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