ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.118
Committed: Mon Apr 2 17:53:27 2012 UTC (12 years, 1 month ago) by root
Content type: text/plain
Branch: MAIN
CVS Tags: rel-4_14
Changes since 1.117: +2 -2 lines
Log Message:
*** empty log message ***

File Contents

# Content
1 /*
2 * libeio implementation
3 *
4 * Copyright (c) 2007,2008,2009,2010,2011,2012 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__ || __NetBSD__ || __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 static void
1389 eio__lseek (eio_req *req)
1390 {
1391 /* this usually gets optimised away completely, or your compiler sucks, */
1392 /* or the whence constants really are not 0, 1, 2 */
1393 int whence = req->int2 == EIO_SEEK_SET ? SEEK_SET
1394 : req->int2 == EIO_SEEK_CUR ? SEEK_CUR
1395 : req->int2 == EIO_SEEK_END ? SEEK_END
1396 : req->int2;
1397
1398 req->offs = lseek (req->int1, req->offs, whence);
1399 req->result = req->offs == (off_t)-1 ? -1 : 0;
1400 }
1401
1402 /* result will always end up in tmpbuf, there is always space for adding a 0-byte */
1403 static int
1404 eio__realpath (struct tmpbuf *tmpbuf, eio_wd wd, const char *path)
1405 {
1406 const char *rel = path;
1407 char *res;
1408 char *tmp1, *tmp2;
1409 #if SYMLOOP_MAX > 32
1410 int symlinks = SYMLOOP_MAX;
1411 #else
1412 int symlinks = 32;
1413 #endif
1414
1415 errno = EINVAL;
1416 if (!rel)
1417 return -1;
1418
1419 errno = ENOENT;
1420 if (!*rel)
1421 return -1;
1422
1423 res = tmpbuf_get (tmpbuf, PATH_MAX * 3);
1424 tmp1 = res + PATH_MAX;
1425 tmp2 = tmp1 + PATH_MAX;
1426
1427 #if 0 /* disabled, the musl way to do things is just too racy */
1428 #if __linux && defined(O_NONBLOCK) && defined(O_NOATIME)
1429 /* on linux we may be able to ask the kernel */
1430 {
1431 int fd = open (rel, O_RDONLY | O_NONBLOCK | O_NOCTTY | O_NOATIME);
1432
1433 if (fd >= 0)
1434 {
1435 sprintf (tmp1, "/proc/self/fd/%d", fd);
1436 req->result = readlink (tmp1, res, PATH_MAX);
1437 close (fd);
1438
1439 /* here we should probably stat the open file and the disk file, to make sure they still match */
1440
1441 if (req->result > 0)
1442 goto done;
1443 }
1444 else if (errno == ELOOP || errno == ENAMETOOLONG || errno == ENOENT || errno == ENOTDIR || errno == EIO)
1445 return;
1446 }
1447 #endif
1448 #endif
1449
1450 if (*rel != '/')
1451 {
1452 int len;
1453
1454 errno = ENOENT;
1455 if (wd == EIO_INVALID_WD)
1456 return -1;
1457
1458 if (wd == EIO_CWD)
1459 {
1460 if (!getcwd (res, PATH_MAX))
1461 return -1;
1462
1463 len = strlen (res);
1464 }
1465 else
1466 memcpy (res, wd->str, len = wd->len);
1467
1468 if (res [1]) /* only use if not / */
1469 res += len;
1470 }
1471
1472 while (*rel)
1473 {
1474 eio_ssize_t len, linklen;
1475 const char *beg = rel;
1476
1477 while (*rel && *rel != '/')
1478 ++rel;
1479
1480 len = rel - beg;
1481
1482 if (!len) /* skip slashes */
1483 {
1484 ++rel;
1485 continue;
1486 }
1487
1488 if (beg [0] == '.')
1489 {
1490 if (len == 1)
1491 continue; /* . - nop */
1492
1493 if (beg [1] == '.' && len == 2)
1494 {
1495 /* .. - back up one component, if possible */
1496
1497 while (res != tmpbuf->ptr)
1498 if (*--res == '/')
1499 break;
1500
1501 continue;
1502 }
1503 }
1504
1505 errno = ENAMETOOLONG;
1506 if (res + 1 + len + 1 >= tmp1)
1507 return -1;
1508
1509 /* copy one component */
1510 *res = '/';
1511 memcpy (res + 1, beg, len);
1512
1513 /* zero-terminate, for readlink */
1514 res [len + 1] = 0;
1515
1516 /* now check if it's a symlink */
1517 linklen = readlink (tmpbuf->ptr, tmp1, PATH_MAX);
1518
1519 if (linklen < 0)
1520 {
1521 if (errno != EINVAL)
1522 return -1;
1523
1524 /* it's a normal directory. hopefully */
1525 res += len + 1;
1526 }
1527 else
1528 {
1529 /* yay, it was a symlink - build new path in tmp2 */
1530 int rellen = strlen (rel);
1531
1532 errno = ENAMETOOLONG;
1533 if (linklen + 1 + rellen >= PATH_MAX)
1534 return -1;
1535
1536 errno = ELOOP;
1537 if (!--symlinks)
1538 return -1;
1539
1540 if (*tmp1 == '/')
1541 res = tmpbuf->ptr; /* symlink resolves to an absolute path */
1542
1543 /* we need to be careful, as rel might point into tmp2 already */
1544 memmove (tmp2 + linklen + 1, rel, rellen + 1);
1545 tmp2 [linklen] = '/';
1546 memcpy (tmp2, tmp1, linklen);
1547
1548 rel = tmp2;
1549 }
1550 }
1551
1552 /* special case for the lone root path */
1553 if (res == tmpbuf->ptr)
1554 *res++ = '/';
1555
1556 return res - (char *)tmpbuf->ptr;
1557 }
1558
1559 static signed char
1560 eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
1561 {
1562 return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
1563 : a->inode < b->inode ? -1
1564 : a->inode > b->inode ? 1
1565 : 0;
1566 }
1567
1568 #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1569
1570 #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1571 #define EIO_SORT_FAST 60 /* when to only use insertion sort */
1572
1573 static void
1574 eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, eio_ino_t inode_bits)
1575 {
1576 unsigned char bits [9 + sizeof (eio_ino_t) * 8];
1577 unsigned char *bit = bits;
1578
1579 assert (CHAR_BIT == 8);
1580 assert (sizeof (eio_dirent) * 8 < 256);
1581 assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */
1582 assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */
1583
1584 if (size <= EIO_SORT_FAST)
1585 return;
1586
1587 /* first prepare an array of bits to test in our radix sort */
1588 /* try to take endianness into account, as well as differences in eio_ino_t sizes */
1589 /* inode_bits must contain all inodes ORed together */
1590 /* which is used to skip bits that are 0 everywhere, which is very common */
1591 {
1592 eio_ino_t endianness;
1593 int i, j;
1594
1595 /* we store the byte offset of byte n into byte n of "endianness" */
1596 for (i = 0; i < sizeof (eio_ino_t); ++i)
1597 ((unsigned char *)&endianness)[i] = i;
1598
1599 *bit++ = 0;
1600
1601 for (i = 0; i < sizeof (eio_ino_t); ++i)
1602 {
1603 /* shifting off the byte offsets out of "endianness" */
1604 int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1605 endianness >>= 8;
1606
1607 for (j = 0; j < 8; ++j)
1608 if (inode_bits & (((eio_ino_t)1) << (i * 8 + j)))
1609 *bit++ = offs + j;
1610 }
1611
1612 for (j = 0; j < 8; ++j)
1613 if (score_bits & (1 << j))
1614 *bit++ = offsetof (eio_dirent, score) * 8 + j;
1615 }
1616
1617 /* now actually do the sorting (a variant of MSD radix sort) */
1618 {
1619 eio_dirent *base_stk [9 + sizeof (eio_ino_t) * 8], *base;
1620 eio_dirent *end_stk [9 + sizeof (eio_ino_t) * 8], *end;
1621 unsigned char *bit_stk [9 + sizeof (eio_ino_t) * 8];
1622 int stk_idx = 0;
1623
1624 base_stk [stk_idx] = dents;
1625 end_stk [stk_idx] = dents + size;
1626 bit_stk [stk_idx] = bit - 1;
1627
1628 do
1629 {
1630 base = base_stk [stk_idx];
1631 end = end_stk [stk_idx];
1632 bit = bit_stk [stk_idx];
1633
1634 for (;;)
1635 {
1636 unsigned char O = *bit >> 3;
1637 unsigned char M = 1 << (*bit & 7);
1638
1639 eio_dirent *a = base;
1640 eio_dirent *b = end;
1641
1642 if (b - a < EIO_SORT_CUTOFF)
1643 break;
1644
1645 /* now bit-partition the array on the bit */
1646 /* this ugly asymmetric loop seems to perform much better than typical */
1647 /* partition algos found in the literature */
1648 do
1649 if (!(((unsigned char *)a)[O] & M))
1650 ++a;
1651 else if (!(((unsigned char *)--b)[O] & M))
1652 {
1653 eio_dirent tmp = *a; *a = *b; *b = tmp;
1654 ++a;
1655 }
1656 while (b > a);
1657
1658 /* next bit, or stop, if no bits left in this path */
1659 if (!*--bit)
1660 break;
1661
1662 base_stk [stk_idx] = a;
1663 end_stk [stk_idx] = end;
1664 bit_stk [stk_idx] = bit;
1665 ++stk_idx;
1666
1667 end = a;
1668 }
1669 }
1670 while (stk_idx--);
1671 }
1672 }
1673
1674 static void
1675 eio_dent_insertion_sort (eio_dirent *dents, int size)
1676 {
1677 /* first move the smallest element to the front, to act as a sentinel */
1678 {
1679 int i;
1680 eio_dirent *min = dents;
1681
1682 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1683 for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1684 if (EIO_DENT_CMP (dents [i], <, *min))
1685 min = &dents [i];
1686
1687 /* swap elements 0 and j (minimum) */
1688 {
1689 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1690 }
1691 }
1692
1693 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1694 {
1695 eio_dirent *i, *j;
1696
1697 for (i = dents + 1; i < dents + size; ++i)
1698 {
1699 eio_dirent value = *i;
1700
1701 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1702 j [1] = j [0];
1703
1704 j [1] = value;
1705 }
1706 }
1707 }
1708
1709 static void
1710 eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, eio_ino_t inode_bits)
1711 {
1712 if (size <= 1)
1713 return; /* our insertion sort relies on size > 0 */
1714
1715 /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1716 /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1717 eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1718
1719 /* use an insertion sort at the end, or for small arrays, */
1720 /* as insertion sort is more efficient for small partitions */
1721 eio_dent_insertion_sort (dents, size);
1722 }
1723
1724 /* read a full directory */
1725 static void
1726 eio__scandir (eio_req *req, etp_worker *self)
1727 {
1728 char *name, *names;
1729 int namesalloc = 4096 - sizeof (void *) * 4;
1730 int namesoffs = 0;
1731 int flags = req->int1;
1732 eio_dirent *dents = 0;
1733 int dentalloc = 128;
1734 int dentoffs = 0;
1735 eio_ino_t inode_bits = 0;
1736 #ifdef _WIN32
1737 HANDLE dirp;
1738 WIN32_FIND_DATA entp;
1739 #else
1740 DIR *dirp;
1741 EIO_STRUCT_DIRENT *entp;
1742 #endif
1743
1744 req->result = -1;
1745
1746 if (!(flags & EIO_READDIR_DENTS))
1747 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
1748
1749 #ifdef _WIN32
1750 {
1751 int len = strlen ((const char *)req->ptr1);
1752 char *path = malloc (MAX_PATH);
1753 const char *fmt;
1754 const char *reqpath = wd_expand (&self->tmpbuf, req->wd, req->ptr1);
1755
1756 if (!len)
1757 fmt = "./*";
1758 else if (reqpath[len - 1] == '/' || reqpath[len - 1] == '\\')
1759 fmt = "%s*";
1760 else
1761 fmt = "%s/*";
1762
1763 _snprintf (path, MAX_PATH, fmt, reqpath);
1764 dirp = FindFirstFile (path, &entp);
1765 free (path);
1766
1767 if (dirp == INVALID_HANDLE_VALUE)
1768 {
1769 /* should steal _dosmaperr */
1770 switch (GetLastError ())
1771 {
1772 case ERROR_FILE_NOT_FOUND:
1773 req->result = 0;
1774 break;
1775
1776 case ERROR_INVALID_NAME:
1777 case ERROR_PATH_NOT_FOUND:
1778 case ERROR_NO_MORE_FILES:
1779 errno = ENOENT;
1780 break;
1781
1782 case ERROR_NOT_ENOUGH_MEMORY:
1783 errno = ENOMEM;
1784 break;
1785
1786 default:
1787 errno = EINVAL;
1788 break;
1789 }
1790
1791 return;
1792 }
1793 }
1794 #else
1795 #if HAVE_AT
1796 if (req->wd)
1797 {
1798 int fd = openat (WD2FD (req->wd), req->ptr1, O_CLOEXEC | O_SEARCH | O_DIRECTORY);
1799
1800 if (fd < 0)
1801 return;
1802
1803 dirp = fdopendir (fd);
1804
1805 if (!dirp)
1806 close (fd);
1807 }
1808 else
1809 dirp = opendir (req->ptr1);
1810 #else
1811 dirp = opendir (wd_expand (&self->tmpbuf, req->wd, req->ptr1));
1812 #endif
1813
1814 if (!dirp)
1815 return;
1816 #endif
1817
1818 if (req->flags & EIO_FLAG_PTR1_FREE)
1819 free (req->ptr1);
1820
1821 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1822 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
1823 req->ptr2 = names = malloc (namesalloc);
1824
1825 if (!names || (flags && !dents))
1826 return;
1827
1828 for (;;)
1829 {
1830 int done;
1831
1832 #ifdef _WIN32
1833 done = !dirp;
1834 #else
1835 errno = 0;
1836 entp = readdir (dirp);
1837 done = !entp;
1838 #endif
1839
1840 if (done)
1841 {
1842 #ifndef _WIN32
1843 int old_errno = errno;
1844 closedir (dirp);
1845 errno = old_errno;
1846
1847 if (errno)
1848 break;
1849 #endif
1850
1851 /* sort etc. */
1852 req->int1 = flags;
1853 req->result = dentoffs;
1854
1855 if (flags & EIO_READDIR_STAT_ORDER)
1856 eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits);
1857 else if (flags & EIO_READDIR_DIRS_FIRST)
1858 if (flags & EIO_READDIR_FOUND_UNKNOWN)
1859 eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1860 else
1861 {
1862 /* in this case, all is known, and we just put dirs first and sort them */
1863 eio_dirent *oth = dents + dentoffs;
1864 eio_dirent *dir = dents;
1865
1866 /* now partition dirs to the front, and non-dirs to the back */
1867 /* by walking from both sides and swapping if necessary */
1868 while (oth > dir)
1869 {
1870 if (dir->type == EIO_DT_DIR)
1871 ++dir;
1872 else if ((--oth)->type == EIO_DT_DIR)
1873 {
1874 eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1875
1876 ++dir;
1877 }
1878 }
1879
1880 /* now sort the dirs only (dirs all have the same score) */
1881 eio_dent_sort (dents, dir - dents, 0, inode_bits);
1882 }
1883
1884 break;
1885 }
1886
1887 /* now add the entry to our list(s) */
1888 name = D_NAME (entp);
1889
1890 /* skip . and .. entries */
1891 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
1892 {
1893 int len = D_NAMLEN (entp) + 1;
1894
1895 while (ecb_expect_false (namesoffs + len > namesalloc))
1896 {
1897 namesalloc *= 2;
1898 req->ptr2 = names = realloc (names, namesalloc);
1899
1900 if (!names)
1901 break;
1902 }
1903
1904 memcpy (names + namesoffs, name, len);
1905
1906 if (dents)
1907 {
1908 struct eio_dirent *ent;
1909
1910 if (ecb_expect_false (dentoffs == dentalloc))
1911 {
1912 dentalloc *= 2;
1913 req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1914
1915 if (!dents)
1916 break;
1917 }
1918
1919 ent = dents + dentoffs;
1920
1921 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1922 ent->namelen = len - 1;
1923 ent->inode = D_INO (entp);
1924
1925 inode_bits |= ent->inode;
1926
1927 switch (D_TYPE (entp))
1928 {
1929 default:
1930 ent->type = EIO_DT_UNKNOWN;
1931 flags |= EIO_READDIR_FOUND_UNKNOWN;
1932 break;
1933
1934 #ifdef DT_FIFO
1935 case DT_FIFO: ent->type = EIO_DT_FIFO; break;
1936 #endif
1937 #ifdef DT_CHR
1938 case DT_CHR: ent->type = EIO_DT_CHR; break;
1939 #endif
1940 #ifdef DT_MPC
1941 case DT_MPC: ent->type = EIO_DT_MPC; break;
1942 #endif
1943 #ifdef DT_DIR
1944 case DT_DIR: ent->type = EIO_DT_DIR; break;
1945 #endif
1946 #ifdef DT_NAM
1947 case DT_NAM: ent->type = EIO_DT_NAM; break;
1948 #endif
1949 #ifdef DT_BLK
1950 case DT_BLK: ent->type = EIO_DT_BLK; break;
1951 #endif
1952 #ifdef DT_MPB
1953 case DT_MPB: ent->type = EIO_DT_MPB; break;
1954 #endif
1955 #ifdef DT_REG
1956 case DT_REG: ent->type = EIO_DT_REG; break;
1957 #endif
1958 #ifdef DT_NWK
1959 case DT_NWK: ent->type = EIO_DT_NWK; break;
1960 #endif
1961 #ifdef DT_CMP
1962 case DT_CMP: ent->type = EIO_DT_CMP; break;
1963 #endif
1964 #ifdef DT_LNK
1965 case DT_LNK: ent->type = EIO_DT_LNK; break;
1966 #endif
1967 #ifdef DT_SOCK
1968 case DT_SOCK: ent->type = EIO_DT_SOCK; break;
1969 #endif
1970 #ifdef DT_DOOR
1971 case DT_DOOR: ent->type = EIO_DT_DOOR; break;
1972 #endif
1973 #ifdef DT_WHT
1974 case DT_WHT: ent->type = EIO_DT_WHT; break;
1975 #endif
1976 }
1977
1978 ent->score = 7;
1979
1980 if (flags & EIO_READDIR_DIRS_FIRST)
1981 {
1982 if (ent->type == EIO_DT_UNKNOWN)
1983 {
1984 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1985 ent->score = 1;
1986 else if (!strchr (name, '.')) /* absence of dots indicate likely dirs */
1987 ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1988 }
1989 else if (ent->type == EIO_DT_DIR)
1990 ent->score = 0;
1991 }
1992 }
1993
1994 namesoffs += len;
1995 ++dentoffs;
1996 }
1997
1998 if (EIO_CANCELLED (req))
1999 {
2000 errno = ECANCELED;
2001 break;
2002 }
2003
2004 #ifdef _WIN32
2005 if (!FindNextFile (dirp, &entp))
2006 {
2007 FindClose (dirp);
2008 dirp = 0;
2009 }
2010 #endif
2011 }
2012 }
2013
2014 /*****************************************************************************/
2015 /* working directory stuff */
2016 /* various deficiencies in the posix 2008 api force us to */
2017 /* keep the absolute path in string form at all times */
2018 /* fuck yeah. */
2019
2020 #if !HAVE_AT
2021
2022 /* a bit like realpath, but usually faster because it doesn'T have to return */
2023 /* an absolute or canonical path */
2024 static const char *
2025 wd_expand (struct tmpbuf *tmpbuf, eio_wd wd, const char *path)
2026 {
2027 if (!wd || *path == '/')
2028 return path;
2029
2030 if (path [0] == '.' && !path [1])
2031 return wd->str;
2032
2033 {
2034 int l1 = wd->len;
2035 int l2 = strlen (path);
2036
2037 char *res = tmpbuf_get (tmpbuf, l1 + l2 + 2);
2038
2039 memcpy (res, wd->str, l1);
2040 res [l1] = '/';
2041 memcpy (res + l1 + 1, path, l2 + 1);
2042
2043 return res;
2044 }
2045 }
2046
2047 #endif
2048
2049 static eio_wd
2050 eio__wd_open_sync (struct tmpbuf *tmpbuf, eio_wd wd, const char *path)
2051 {
2052 int fd;
2053 eio_wd res;
2054 int len = eio__realpath (tmpbuf, wd, path);
2055
2056 if (len < 0)
2057 return EIO_INVALID_WD;
2058
2059 #if HAVE_AT
2060 fd = openat (WD2FD (wd), path, O_CLOEXEC | O_SEARCH | O_DIRECTORY);
2061
2062 if (fd < 0)
2063 return EIO_INVALID_WD;
2064 #endif
2065
2066 res = malloc (sizeof (*res) + len); /* one extra 0-byte */
2067
2068 #if HAVE_AT
2069 res->fd = fd;
2070 #endif
2071
2072 res->len = len;
2073 memcpy (res->str, tmpbuf->ptr, len);
2074 res->str [len] = 0;
2075
2076 return res;
2077 }
2078
2079 eio_wd
2080 eio_wd_open_sync (eio_wd wd, const char *path)
2081 {
2082 struct tmpbuf tmpbuf = { 0 };
2083 wd = eio__wd_open_sync (&tmpbuf, wd, path);
2084 free (tmpbuf.ptr);
2085
2086 return wd;
2087 }
2088
2089 void
2090 eio_wd_close_sync (eio_wd wd)
2091 {
2092 if (wd != EIO_INVALID_WD && wd != EIO_CWD)
2093 {
2094 #if HAVE_AT
2095 close (wd->fd);
2096 #endif
2097 free (wd);
2098 }
2099 }
2100
2101 #if HAVE_AT
2102
2103 /* they forgot these */
2104
2105 static int
2106 eio__truncateat (int dirfd, const char *path, off_t length)
2107 {
2108 int fd = openat (dirfd, path, O_WRONLY | O_CLOEXEC);
2109 int res;
2110
2111 if (fd < 0)
2112 return fd;
2113
2114 res = ftruncate (fd, length);
2115 close (fd);
2116 return res;
2117 }
2118
2119 static int
2120 eio__statvfsat (int dirfd, const char *path, struct statvfs *buf)
2121 {
2122 int fd = openat (dirfd, path, O_SEARCH | O_CLOEXEC);
2123 int res;
2124
2125 if (fd < 0)
2126 return fd;
2127
2128 res = fstatvfs (fd, buf);
2129 close (fd);
2130 return res;
2131
2132 }
2133
2134 #endif
2135
2136 /*****************************************************************************/
2137
2138 #define ALLOC(len) \
2139 if (!req->ptr2) \
2140 { \
2141 X_LOCK (wrklock); \
2142 req->flags |= EIO_FLAG_PTR2_FREE; \
2143 X_UNLOCK (wrklock); \
2144 req->ptr2 = malloc (len); \
2145 if (!req->ptr2) \
2146 { \
2147 errno = ENOMEM; \
2148 req->result = -1; \
2149 break; \
2150 } \
2151 }
2152
2153 static void ecb_noinline ecb_cold
2154 etp_proc_init (void)
2155 {
2156 #if HAVE_PRCTL_SET_NAME
2157 /* provide a more sensible "thread name" */
2158 char name[16 + 1];
2159 const int namelen = sizeof (name) - 1;
2160 int len;
2161
2162 prctl (PR_GET_NAME, (unsigned long)name, 0, 0, 0);
2163 name [namelen] = 0;
2164 len = strlen (name);
2165 strcpy (name + (len <= namelen - 4 ? len : namelen - 4), "/eio");
2166 prctl (PR_SET_NAME, (unsigned long)name, 0, 0, 0);
2167 #endif
2168 }
2169
2170 X_THREAD_PROC (etp_proc)
2171 {
2172 ETP_REQ *req;
2173 struct timespec ts;
2174 etp_worker *self = (etp_worker *)thr_arg;
2175
2176 etp_proc_init ();
2177
2178 /* try to distribute timeouts somewhat evenly */
2179 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
2180
2181 for (;;)
2182 {
2183 ts.tv_sec = 0;
2184
2185 X_LOCK (reqlock);
2186
2187 for (;;)
2188 {
2189 req = reqq_shift (&req_queue);
2190
2191 if (req)
2192 break;
2193
2194 if (ts.tv_sec == 1) /* no request, but timeout detected, let's quit */
2195 {
2196 X_UNLOCK (reqlock);
2197 X_LOCK (wrklock);
2198 --started;
2199 X_UNLOCK (wrklock);
2200 goto quit;
2201 }
2202
2203 ++idle;
2204
2205 if (idle <= max_idle)
2206 /* we are allowed to idle, so do so without any timeout */
2207 X_COND_WAIT (reqwait, reqlock);
2208 else
2209 {
2210 /* initialise timeout once */
2211 if (!ts.tv_sec)
2212 ts.tv_sec = time (0) + idle_timeout;
2213
2214 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
2215 ts.tv_sec = 1; /* assuming this is not a value computed above.,.. */
2216 }
2217
2218 --idle;
2219 }
2220
2221 --nready;
2222
2223 X_UNLOCK (reqlock);
2224
2225 if (req->type < 0)
2226 goto quit;
2227
2228 ETP_EXECUTE (self, req);
2229
2230 X_LOCK (reslock);
2231
2232 ++npending;
2233
2234 if (!reqq_push (&res_queue, req) && want_poll_cb)
2235 want_poll_cb ();
2236
2237 etp_worker_clear (self);
2238
2239 X_UNLOCK (reslock);
2240 }
2241
2242 quit:
2243 free (req);
2244
2245 X_LOCK (wrklock);
2246 etp_worker_free (self);
2247 X_UNLOCK (wrklock);
2248
2249 return 0;
2250 }
2251
2252 /*****************************************************************************/
2253
2254 int ecb_cold
2255 eio_init (void (*want_poll)(void), void (*done_poll)(void))
2256 {
2257 #if !HAVE_PREADWRITE
2258 X_MUTEX_CREATE (preadwritelock);
2259 #endif
2260
2261 return etp_init (want_poll, done_poll);
2262 }
2263
2264 ecb_inline void
2265 eio_api_destroy (eio_req *req)
2266 {
2267 free (req);
2268 }
2269
2270 #define REQ(rtype) \
2271 eio_req *req; \
2272 \
2273 req = (eio_req *)calloc (1, sizeof *req); \
2274 if (!req) \
2275 return 0; \
2276 \
2277 req->type = rtype; \
2278 req->pri = pri; \
2279 req->finish = cb; \
2280 req->data = data; \
2281 req->destroy = eio_api_destroy;
2282
2283 #define SEND eio_submit (req); return req
2284
2285 #define PATH \
2286 req->flags |= EIO_FLAG_PTR1_FREE; \
2287 req->ptr1 = strdup (path); \
2288 if (!req->ptr1) \
2289 { \
2290 eio_api_destroy (req); \
2291 return 0; \
2292 }
2293
2294 static void
2295 eio_execute (etp_worker *self, eio_req *req)
2296 {
2297 #if HAVE_AT
2298 int dirfd;
2299 #else
2300 const char *path;
2301 #endif
2302
2303 if (ecb_expect_false (EIO_CANCELLED (req)))
2304 {
2305 req->result = -1;
2306 req->errorno = ECANCELED;
2307 return;
2308 }
2309
2310 if (ecb_expect_false (req->wd == EIO_INVALID_WD))
2311 {
2312 req->result = -1;
2313 req->errorno = ENOENT;
2314 return;
2315 }
2316
2317 if (req->type >= EIO_OPEN)
2318 {
2319 #if HAVE_AT
2320 dirfd = WD2FD (req->wd);
2321 #else
2322 path = wd_expand (&self->tmpbuf, req->wd, req->ptr1);
2323 #endif
2324 }
2325
2326 switch (req->type)
2327 {
2328 case EIO_WD_OPEN: req->wd = eio__wd_open_sync (&self->tmpbuf, req->wd, req->ptr1);
2329 req->result = req->wd == EIO_INVALID_WD ? -1 : 0;
2330 break;
2331 case EIO_WD_CLOSE: req->result = 0;
2332 eio_wd_close_sync (req->wd); break;
2333
2334 case EIO_SEEK: eio__lseek (req); break;
2335 case EIO_READ: ALLOC (req->size);
2336 req->result = req->offs >= 0
2337 ? pread (req->int1, req->ptr2, req->size, req->offs)
2338 : read (req->int1, req->ptr2, req->size); break;
2339 case EIO_WRITE: req->result = req->offs >= 0
2340 ? pwrite (req->int1, req->ptr2, req->size, req->offs)
2341 : write (req->int1, req->ptr2, req->size); break;
2342
2343 case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
2344 case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size); break;
2345
2346 #if HAVE_AT
2347
2348 case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2349 req->result = fstatat (dirfd, req->ptr1, (EIO_STRUCT_STAT *)req->ptr2, 0); break;
2350 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2351 req->result = fstatat (dirfd, req->ptr1, (EIO_STRUCT_STAT *)req->ptr2, AT_SYMLINK_NOFOLLOW); break;
2352 case EIO_CHOWN: req->result = fchownat (dirfd, req->ptr1, req->int2, req->int3, 0); break;
2353 case EIO_CHMOD: req->result = fchmodat (dirfd, req->ptr1, (mode_t)req->int2, 0); break;
2354 case EIO_TRUNCATE: req->result = eio__truncateat (dirfd, req->ptr1, req->offs); break;
2355 case EIO_OPEN: req->result = openat (dirfd, req->ptr1, req->int1, (mode_t)req->int2); break;
2356
2357 case EIO_UNLINK: req->result = unlinkat (dirfd, req->ptr1, 0); break;
2358 case EIO_RMDIR: req->result = unlinkat (dirfd, req->ptr1, AT_REMOVEDIR); break;
2359 case EIO_MKDIR: req->result = mkdirat (dirfd, req->ptr1, (mode_t)req->int2); break;
2360 case EIO_RENAME: req->result = renameat (dirfd, req->ptr1, WD2FD ((eio_wd)req->int3), req->ptr2); break;
2361 case EIO_LINK: req->result = linkat (dirfd, req->ptr1, WD2FD ((eio_wd)req->int3), req->ptr2, 0); break;
2362 case EIO_SYMLINK: req->result = symlinkat (req->ptr1, dirfd, req->ptr2); break;
2363 case EIO_MKNOD: req->result = mknodat (dirfd, req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
2364 case EIO_READLINK: ALLOC (PATH_MAX);
2365 req->result = readlinkat (dirfd, req->ptr1, req->ptr2, PATH_MAX); break;
2366 case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
2367 req->result = eio__statvfsat (dirfd, req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
2368 case EIO_UTIME:
2369 case EIO_FUTIME:
2370 {
2371 struct timespec ts[2];
2372 struct timespec *times;
2373
2374 if (req->nv1 != -1. || req->nv2 != -1.)
2375 {
2376 ts[0].tv_sec = req->nv1;
2377 ts[0].tv_nsec = (req->nv1 - ts[0].tv_sec) * 1e9;
2378 ts[1].tv_sec = req->nv2;
2379 ts[1].tv_nsec = (req->nv2 - ts[1].tv_sec) * 1e9;
2380
2381 times = ts;
2382 }
2383 else
2384 times = 0;
2385
2386 req->result = req->type == EIO_FUTIME
2387 ? futimens (req->int1, times)
2388 : utimensat (dirfd, req->ptr1, times, 0);
2389 }
2390 break;
2391
2392 #else
2393
2394 case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2395 req->result = stat (path , (EIO_STRUCT_STAT *)req->ptr2); break;
2396 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2397 req->result = lstat (path , (EIO_STRUCT_STAT *)req->ptr2); break;
2398 case EIO_CHOWN: req->result = chown (path , req->int2, req->int3); break;
2399 case EIO_CHMOD: req->result = chmod (path , (mode_t)req->int2); break;
2400 case EIO_TRUNCATE: req->result = truncate (path , req->offs); break;
2401 case EIO_OPEN: req->result = open (path , req->int1, (mode_t)req->int2); break;
2402
2403 case EIO_UNLINK: req->result = unlink (path ); break;
2404 case EIO_RMDIR: req->result = rmdir (path ); break;
2405 case EIO_MKDIR: req->result = mkdir (path , (mode_t)req->int2); break;
2406 case EIO_RENAME: req->result = rename (path , req->ptr2); break;
2407 case EIO_LINK: req->result = link (path , req->ptr2); break;
2408 case EIO_SYMLINK: req->result = symlink (path , req->ptr2); break;
2409 case EIO_MKNOD: req->result = mknod (path , (mode_t)req->int2, (dev_t)req->offs); break;
2410 case EIO_READLINK: ALLOC (PATH_MAX);
2411 req->result = readlink (path, req->ptr2, PATH_MAX); break;
2412 case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
2413 req->result = statvfs (path , (EIO_STRUCT_STATVFS *)req->ptr2); break;
2414
2415 case EIO_UTIME:
2416 case EIO_FUTIME:
2417 {
2418 struct timeval tv[2];
2419 struct timeval *times;
2420
2421 if (req->nv1 != -1. || req->nv2 != -1.)
2422 {
2423 tv[0].tv_sec = req->nv1;
2424 tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1e6;
2425 tv[1].tv_sec = req->nv2;
2426 tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1e6;
2427
2428 times = tv;
2429 }
2430 else
2431 times = 0;
2432
2433 req->result = req->type == EIO_FUTIME
2434 ? futimes (req->int1, times)
2435 : utimes (req->ptr1, times);
2436 }
2437 break;
2438
2439 #endif
2440
2441 case EIO_REALPATH: if (0 <= (req->result = eio__realpath (&self->tmpbuf, req->wd, req->ptr1)))
2442 {
2443 ALLOC (req->result);
2444 memcpy (req->ptr2, self->tmpbuf.ptr, req->result);
2445 }
2446 break;
2447
2448 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2449 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
2450
2451 case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
2452 req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
2453
2454 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
2455 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
2456 case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
2457
2458 case EIO_CLOSE: req->result = close (req->int1); break;
2459 case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
2460 case EIO_SYNC: req->result = 0; sync (); break;
2461 case EIO_FSYNC: req->result = fsync (req->int1); break;
2462 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
2463 case EIO_SYNCFS: req->result = eio__syncfs (req->int1); break;
2464 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
2465 case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break;
2466 case EIO_MTOUCH: req->result = eio__mtouch (req); break;
2467 case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break;
2468 case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break;
2469 case EIO_FALLOCATE: req->result = eio__fallocate (req->int1, req->int2, req->offs, req->size); break;
2470
2471 case EIO_READDIR: eio__scandir (req, self); break;
2472
2473 case EIO_BUSY:
2474 #ifdef _WIN32
2475 Sleep (req->nv1 * 1e3);
2476 #else
2477 {
2478 struct timeval tv;
2479
2480 tv.tv_sec = req->nv1;
2481 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6;
2482
2483 req->result = select (0, 0, 0, 0, &tv);
2484 }
2485 #endif
2486 break;
2487
2488 case EIO_GROUP:
2489 abort (); /* handled in eio_request */
2490
2491 case EIO_NOP:
2492 req->result = 0;
2493 break;
2494
2495 case EIO_CUSTOM:
2496 req->feed (req);
2497 break;
2498
2499 default:
2500 errno = ENOSYS;
2501 req->result = -1;
2502 break;
2503 }
2504
2505 req->errorno = errno;
2506 }
2507
2508 #ifndef EIO_NO_WRAPPERS
2509
2510 eio_req *eio_wd_open (const char *path, int pri, eio_cb cb, void *data)
2511 {
2512 REQ (EIO_WD_OPEN); PATH; SEND;
2513 }
2514
2515 eio_req *eio_wd_close (eio_wd wd, int pri, eio_cb cb, void *data)
2516 {
2517 REQ (EIO_WD_CLOSE); req->wd = wd; SEND;
2518 }
2519
2520 eio_req *eio_nop (int pri, eio_cb cb, void *data)
2521 {
2522 REQ (EIO_NOP); SEND;
2523 }
2524
2525 eio_req *eio_busy (double delay, int pri, eio_cb cb, void *data)
2526 {
2527 REQ (EIO_BUSY); req->nv1 = delay; SEND;
2528 }
2529
2530 eio_req *eio_sync (int pri, eio_cb cb, void *data)
2531 {
2532 REQ (EIO_SYNC); SEND;
2533 }
2534
2535 eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data)
2536 {
2537 REQ (EIO_FSYNC); req->int1 = fd; SEND;
2538 }
2539
2540 eio_req *eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
2541 {
2542 REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
2543 }
2544
2545 eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data)
2546 {
2547 REQ (EIO_FDATASYNC); req->int1 = fd; SEND;
2548 }
2549
2550 eio_req *eio_syncfs (int fd, int pri, eio_cb cb, void *data)
2551 {
2552 REQ (EIO_SYNCFS); req->int1 = fd; SEND;
2553 }
2554
2555 eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
2556 {
2557 REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND;
2558 }
2559
2560 eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
2561 {
2562 REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
2563 }
2564
2565 eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data)
2566 {
2567 REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND;
2568 }
2569
2570 eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data)
2571 {
2572 REQ (EIO_MLOCKALL); req->int1 = flags; SEND;
2573 }
2574
2575 eio_req *eio_fallocate (int fd, int mode, off_t offset, size_t len, int pri, eio_cb cb, void *data)
2576 {
2577 REQ (EIO_FALLOCATE); req->int1 = fd; req->int2 = mode; req->offs = offset; req->size = len; SEND;
2578 }
2579
2580 eio_req *eio_close (int fd, int pri, eio_cb cb, void *data)
2581 {
2582 REQ (EIO_CLOSE); req->int1 = fd; SEND;
2583 }
2584
2585 eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data)
2586 {
2587 REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND;
2588 }
2589
2590 eio_req *eio_seek (int fd, off_t offset, int whence, int pri, eio_cb cb, void *data)
2591 {
2592 REQ (EIO_SEEK); req->int1 = fd; req->offs = offset; req->int2 = whence; SEND;
2593 }
2594
2595 eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
2596 {
2597 REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
2598 }
2599
2600 eio_req *eio_write (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
2601 {
2602 REQ (EIO_WRITE); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
2603 }
2604
2605 eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
2606 {
2607 REQ (EIO_FSTAT); req->int1 = fd; SEND;
2608 }
2609
2610 eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data)
2611 {
2612 REQ (EIO_FSTATVFS); req->int1 = fd; SEND;
2613 }
2614
2615 eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data)
2616 {
2617 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
2618 }
2619
2620 eio_req *eio_ftruncate (int fd, off_t offset, int pri, eio_cb cb, void *data)
2621 {
2622 REQ (EIO_FTRUNCATE); req->int1 = fd; req->offs = offset; SEND;
2623 }
2624
2625 eio_req *eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data)
2626 {
2627 REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND;
2628 }
2629
2630 eio_req *eio_fchown (int fd, eio_uid_t uid, eio_gid_t gid, int pri, eio_cb cb, void *data)
2631 {
2632 REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
2633 }
2634
2635 eio_req *eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data)
2636 {
2637 REQ (EIO_DUP2); req->int1 = fd; req->int2 = fd2; SEND;
2638 }
2639
2640 eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, int pri, eio_cb cb, void *data)
2641 {
2642 REQ (EIO_SENDFILE); req->int1 = out_fd; req->int2 = in_fd; req->offs = in_offset; req->size = length; SEND;
2643 }
2644
2645 eio_req *eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data)
2646 {
2647 REQ (EIO_OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND;
2648 }
2649
2650 eio_req *eio_utime (const char *path, double atime, double mtime, int pri, eio_cb cb, void *data)
2651 {
2652 REQ (EIO_UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND;
2653 }
2654
2655 eio_req *eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data)
2656 {
2657 REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND;
2658 }
2659
2660 eio_req *eio_chown (const char *path, eio_uid_t uid, eio_gid_t gid, int pri, eio_cb cb, void *data)
2661 {
2662 REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
2663 }
2664
2665 eio_req *eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
2666 {
2667 REQ (EIO_CHMOD); PATH; req->int2 = (long)mode; SEND;
2668 }
2669
2670 eio_req *eio_mkdir (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
2671 {
2672 REQ (EIO_MKDIR); PATH; req->int2 = (long)mode; SEND;
2673 }
2674
2675 static eio_req *
2676 eio__1path (int type, const char *path, int pri, eio_cb cb, void *data)
2677 {
2678 REQ (type); PATH; SEND;
2679 }
2680
2681 eio_req *eio_readlink (const char *path, int pri, eio_cb cb, void *data)
2682 {
2683 return eio__1path (EIO_READLINK, path, pri, cb, data);
2684 }
2685
2686 eio_req *eio_realpath (const char *path, int pri, eio_cb cb, void *data)
2687 {
2688 return eio__1path (EIO_REALPATH, path, pri, cb, data);
2689 }
2690
2691 eio_req *eio_stat (const char *path, int pri, eio_cb cb, void *data)
2692 {
2693 return eio__1path (EIO_STAT, path, pri, cb, data);
2694 }
2695
2696 eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data)
2697 {
2698 return eio__1path (EIO_LSTAT, path, pri, cb, data);
2699 }
2700
2701 eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data)
2702 {
2703 return eio__1path (EIO_STATVFS, path, pri, cb, data);
2704 }
2705
2706 eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data)
2707 {
2708 return eio__1path (EIO_UNLINK, path, pri, cb, data);
2709 }
2710
2711 eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
2712 {
2713 return eio__1path (EIO_RMDIR, path, pri, cb, data);
2714 }
2715
2716 eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data)
2717 {
2718 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
2719 }
2720
2721 eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
2722 {
2723 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND;
2724 }
2725
2726 static eio_req *
2727 eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2728 {
2729 REQ (type); PATH;
2730
2731 req->flags |= EIO_FLAG_PTR2_FREE;
2732 req->ptr2 = strdup (new_path);
2733 if (!req->ptr2)
2734 {
2735 eio_api_destroy (req);
2736 return 0;
2737 }
2738
2739 SEND;
2740 }
2741
2742 eio_req *eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2743 {
2744 return eio__2path (EIO_LINK, path, new_path, pri, cb, data);
2745 }
2746
2747 eio_req *eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2748 {
2749 return eio__2path (EIO_SYMLINK, path, new_path, pri, cb, data);
2750 }
2751
2752 eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2753 {
2754 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
2755 }
2756
2757 eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data)
2758 {
2759 REQ (EIO_CUSTOM); req->feed = execute; SEND;
2760 }
2761
2762 #endif
2763
2764 eio_req *eio_grp (eio_cb cb, void *data)
2765 {
2766 const int pri = EIO_PRI_MAX;
2767
2768 REQ (EIO_GROUP); SEND;
2769 }
2770
2771 #undef REQ
2772 #undef PATH
2773 #undef SEND
2774
2775 /*****************************************************************************/
2776 /* grp functions */
2777
2778 void
2779 eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit)
2780 {
2781 grp->int2 = limit;
2782 grp->feed = feed;
2783
2784 grp_try_feed (grp);
2785 }
2786
2787 void
2788 eio_grp_limit (eio_req *grp, int limit)
2789 {
2790 grp->int2 = limit;
2791
2792 grp_try_feed (grp);
2793 }
2794
2795 void
2796 eio_grp_add (eio_req *grp, eio_req *req)
2797 {
2798 assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2));
2799
2800 grp->flags |= EIO_FLAG_GROUPADD;
2801
2802 ++grp->size;
2803 req->grp = grp;
2804
2805 req->grp_prev = 0;
2806 req->grp_next = grp->grp_first;
2807
2808 if (grp->grp_first)
2809 grp->grp_first->grp_prev = req;
2810
2811 grp->grp_first = req;
2812 }
2813
2814 /*****************************************************************************/
2815 /* misc garbage */
2816
2817 eio_ssize_t
2818 eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
2819 {
2820 return eio__sendfile (ofd, ifd, offset, count);
2821 }
2822