1 | /* |
1 | /* |
2 | * libeio implementation |
2 | * libeio implementation |
3 | * |
3 | * |
4 | * Copyright (c) 2007,2008 Marc Alexander Lehmann <libeio@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libeio@schmorp.de> |
5 | * All rights reserved. |
5 | * All rights reserved. |
6 | * |
6 | * |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
8 | * tion, are permitted provided that the following conditions are met: |
8 | * tion, are permitted provided that the following conditions are met: |
9 | * |
9 | * |
… | |
… | |
35 | * and other provisions required by the GPL. If you do not delete the |
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 |
36 | * provisions above, a recipient may use your version of this file under |
37 | * either the BSD or the GPL. |
37 | * either the BSD or the GPL. |
38 | */ |
38 | */ |
39 | |
39 | |
|
|
40 | #ifndef _WIN32 |
|
|
41 | # include "config.h" |
|
|
42 | #endif |
|
|
43 | |
40 | #include "eio.h" |
44 | #include "eio.h" |
|
|
45 | |
|
|
46 | #ifdef EIO_STACKSIZE |
|
|
47 | # define XTHREAD_STACKSIZE EIO_STACKSIZE |
|
|
48 | #endif |
41 | #include "xthread.h" |
49 | #include "xthread.h" |
42 | |
50 | |
43 | #include <errno.h> |
51 | #include <errno.h> |
44 | #include <stddef.h> |
52 | #include <stddef.h> |
45 | #include <stdlib.h> |
53 | #include <stdlib.h> |
46 | #include <string.h> |
54 | #include <string.h> |
47 | #include <errno.h> |
55 | #include <errno.h> |
48 | #include <sys/types.h> |
56 | #include <sys/types.h> |
49 | #include <sys/stat.h> |
57 | #include <sys/stat.h> |
|
|
58 | #include <sys/statvfs.h> |
50 | #include <limits.h> |
59 | #include <limits.h> |
51 | #include <fcntl.h> |
60 | #include <fcntl.h> |
52 | #include <assert.h> |
61 | #include <assert.h> |
53 | |
62 | |
|
|
63 | /* intptr_t comes from unistd.h, says POSIX/UNIX/tradition */ |
|
|
64 | /* intptr_t only comes form stdint.h, says idiot openbsd coder */ |
|
|
65 | #if HAVE_STDINT_H |
|
|
66 | # include <stdint.h> |
|
|
67 | #endif |
|
|
68 | |
54 | #ifndef EIO_FINISH |
69 | #ifndef EIO_FINISH |
55 | # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 |
70 | # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 |
56 | #endif |
71 | #endif |
57 | |
72 | |
58 | #ifndef EIO_DESTROY |
73 | #ifndef EIO_DESTROY |
… | |
… | |
64 | #endif |
79 | #endif |
65 | |
80 | |
66 | #ifdef _WIN32 |
81 | #ifdef _WIN32 |
67 | |
82 | |
68 | /*doh*/ |
83 | /*doh*/ |
69 | |
|
|
70 | #else |
84 | #else |
71 | |
85 | |
72 | # include "config.h" |
|
|
73 | # include <sys/time.h> |
86 | # include <sys/time.h> |
74 | # include <sys/select.h> |
87 | # include <sys/select.h> |
75 | # include <unistd.h> |
88 | # include <unistd.h> |
76 | # include <utime.h> |
89 | # include <utime.h> |
77 | # include <signal.h> |
90 | # include <signal.h> |
78 | # include <dirent.h> |
91 | # include <dirent.h> |
79 | |
92 | |
|
|
93 | #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES |
|
|
94 | # include <sys/mman.h> |
|
|
95 | #endif |
|
|
96 | |
|
|
97 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
|
|
98 | # if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__ |
|
|
99 | # define _DIRENT_HAVE_D_TYPE /* sigh */ |
|
|
100 | # define D_INO(de) (de)->d_fileno |
|
|
101 | # define D_NAMLEN(de) (de)->d_namlen |
|
|
102 | # elif __linux || defined d_ino || _XOPEN_SOURCE >= 600 |
|
|
103 | # define D_INO(de) (de)->d_ino |
|
|
104 | # endif |
|
|
105 | |
|
|
106 | #ifdef _D_EXACT_NAMLEN |
|
|
107 | # undef D_NAMLEN |
|
|
108 | # define D_NAMLEN(de) _D_EXACT_NAMLEN (de) |
|
|
109 | #endif |
|
|
110 | |
|
|
111 | # ifdef _DIRENT_HAVE_D_TYPE |
|
|
112 | # define D_TYPE(de) (de)->d_type |
|
|
113 | # endif |
|
|
114 | |
80 | # ifndef EIO_STRUCT_DIRENT |
115 | # ifndef EIO_STRUCT_DIRENT |
81 | # define EIO_STRUCT_DIRENT struct dirent |
116 | # define EIO_STRUCT_DIRENT struct dirent |
82 | # endif |
117 | # endif |
83 | |
118 | |
84 | #endif |
119 | #endif |
85 | |
120 | |
86 | #if HAVE_SENDFILE |
121 | #if HAVE_SENDFILE |
87 | # if __linux |
122 | # if __linux |
88 | # include <sys/sendfile.h> |
123 | # include <sys/sendfile.h> |
89 | # elif __freebsd |
124 | # elif __FreeBSD__ || defined __APPLE__ |
90 | # include <sys/socket.h> |
125 | # include <sys/socket.h> |
91 | # include <sys/uio.h> |
126 | # include <sys/uio.h> |
92 | # elif __hpux |
127 | # elif __hpux |
93 | # include <sys/socket.h> |
128 | # include <sys/socket.h> |
94 | # elif __solaris /* not yet */ |
129 | # elif __solaris |
95 | # include <sys/sendfile.h> |
130 | # include <sys/sendfile.h> |
96 | # else |
131 | # else |
97 | # error sendfile support requested but not available |
132 | # error sendfile support requested but not available |
98 | # endif |
133 | # endif |
99 | #endif |
134 | #endif |
100 | |
135 | |
101 | /* number of seconds after which an idle threads exit */ |
136 | #ifndef D_TYPE |
102 | #define IDLE_TIMEOUT 10 |
137 | # define D_TYPE(de) 0 |
|
|
138 | #endif |
|
|
139 | #ifndef D_INO |
|
|
140 | # define D_INO(de) 0 |
|
|
141 | #endif |
|
|
142 | #ifndef D_NAMLEN |
|
|
143 | # define D_NAMLEN(de) strlen ((de)->d_name) |
|
|
144 | #endif |
103 | |
145 | |
104 | /* used for struct dirent, AIX doesn't provide it */ |
146 | /* used for struct dirent, AIX doesn't provide it */ |
105 | #ifndef NAME_MAX |
147 | #ifndef NAME_MAX |
106 | # define NAME_MAX 4096 |
148 | # define NAME_MAX 4096 |
|
|
149 | #endif |
|
|
150 | |
|
|
151 | /* used for readlink etc. */ |
|
|
152 | #ifndef PATH_MAX |
|
|
153 | # define PATH_MAX 4096 |
107 | #endif |
154 | #endif |
108 | |
155 | |
109 | /* buffer size for various temporary buffers */ |
156 | /* buffer size for various temporary buffers */ |
110 | #define EIO_BUFSIZE 65536 |
157 | #define EIO_BUFSIZE 65536 |
111 | |
158 | |
… | |
… | |
155 | if (wrk->dirp) \ |
202 | if (wrk->dirp) \ |
156 | { \ |
203 | { \ |
157 | closedir (wrk->dirp); \ |
204 | closedir (wrk->dirp); \ |
158 | wrk->dirp = 0; \ |
205 | wrk->dirp = 0; \ |
159 | } |
206 | } |
|
|
207 | |
160 | #define ETP_WORKER_COMMON \ |
208 | #define ETP_WORKER_COMMON \ |
161 | void *dbuf; \ |
209 | void *dbuf; \ |
162 | DIR *dirp; |
210 | DIR *dirp; |
163 | |
211 | |
164 | /*****************************************************************************/ |
212 | /*****************************************************************************/ |
165 | |
213 | |
166 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
214 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
167 | |
215 | |
168 | /* calculcate time difference in ~1/EIO_TICKS of a second */ |
216 | /* calculate time difference in ~1/EIO_TICKS of a second */ |
169 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
217 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
170 | { |
218 | { |
171 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
219 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
172 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
220 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
173 | } |
221 | } |
… | |
… | |
181 | static unsigned int max_poll_reqs; /* reslock */ |
229 | static unsigned int max_poll_reqs; /* reslock */ |
182 | |
230 | |
183 | static volatile unsigned int nreqs; /* reqlock */ |
231 | static volatile unsigned int nreqs; /* reqlock */ |
184 | static volatile unsigned int nready; /* reqlock */ |
232 | static volatile unsigned int nready; /* reqlock */ |
185 | static volatile unsigned int npending; /* reqlock */ |
233 | static volatile unsigned int npending; /* reqlock */ |
186 | static volatile unsigned int max_idle = 4; |
234 | static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */ |
|
|
235 | static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */ |
187 | |
236 | |
188 | static mutex_t wrklock = X_MUTEX_INIT; |
237 | static xmutex_t wrklock; |
189 | static mutex_t reslock = X_MUTEX_INIT; |
238 | static xmutex_t reslock; |
190 | static mutex_t reqlock = X_MUTEX_INIT; |
239 | static xmutex_t reqlock; |
191 | static cond_t reqwait = X_COND_INIT; |
240 | static xcond_t reqwait; |
192 | |
241 | |
193 | #if !HAVE_PREADWRITE |
242 | #if !HAVE_PREADWRITE |
194 | /* |
243 | /* |
195 | * make our pread/pwrite emulation safe against themselves, but not against |
244 | * make our pread/pwrite emulation safe against themselves, but not against |
196 | * normal read/write by using a mutex. slows down execution a lot, |
245 | * normal read/write by using a mutex. slows down execution a lot, |
197 | * but that's your problem, not mine. |
246 | * but that's your problem, not mine. |
198 | */ |
247 | */ |
199 | static mutex_t preadwritelock = X_MUTEX_INIT; |
248 | static xmutex_t preadwritelock = X_MUTEX_INIT; |
200 | #endif |
249 | #endif |
201 | |
250 | |
202 | typedef struct etp_worker |
251 | typedef struct etp_worker |
203 | { |
252 | { |
204 | /* locked by wrklock */ |
253 | /* locked by wrklock */ |
205 | struct etp_worker *prev, *next; |
254 | struct etp_worker *prev, *next; |
206 | |
255 | |
207 | thread_t tid; |
256 | xthread_t tid; |
208 | |
257 | |
209 | /* locked by reslock, reqlock or wrklock */ |
258 | /* locked by reslock, reqlock or wrklock */ |
210 | ETP_REQ *req; /* currently processed request */ |
259 | ETP_REQ *req; /* currently processed request */ |
211 | |
260 | |
212 | ETP_WORKER_COMMON |
261 | ETP_WORKER_COMMON |
… | |
… | |
326 | } |
375 | } |
327 | |
376 | |
328 | abort (); |
377 | abort (); |
329 | } |
378 | } |
330 | |
379 | |
|
|
380 | static void etp_thread_init (void) |
|
|
381 | { |
|
|
382 | X_MUTEX_CREATE (wrklock); |
|
|
383 | X_MUTEX_CREATE (reslock); |
|
|
384 | X_MUTEX_CREATE (reqlock); |
|
|
385 | X_COND_CREATE (reqwait); |
|
|
386 | } |
|
|
387 | |
331 | static void etp_atfork_prepare (void) |
388 | static void etp_atfork_prepare (void) |
332 | { |
389 | { |
333 | X_LOCK (wrklock); |
390 | X_LOCK (wrklock); |
334 | X_LOCK (reqlock); |
391 | X_LOCK (reqlock); |
335 | X_LOCK (reslock); |
392 | X_LOCK (reslock); |
… | |
… | |
373 | idle = 0; |
430 | idle = 0; |
374 | nreqs = 0; |
431 | nreqs = 0; |
375 | nready = 0; |
432 | nready = 0; |
376 | npending = 0; |
433 | npending = 0; |
377 | |
434 | |
378 | etp_atfork_parent (); |
435 | etp_thread_init (); |
379 | } |
436 | } |
380 | |
437 | |
381 | static void |
438 | static void |
382 | etp_once_init (void) |
439 | etp_once_init (void) |
383 | { |
440 | { |
|
|
441 | etp_thread_init (); |
384 | X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); |
442 | X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); |
385 | } |
443 | } |
386 | |
444 | |
387 | static int |
445 | static int |
388 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
446 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
… | |
… | |
565 | } |
623 | } |
566 | |
624 | |
567 | static void etp_set_max_poll_time (double nseconds) |
625 | static void etp_set_max_poll_time (double nseconds) |
568 | { |
626 | { |
569 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
627 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
570 | max_poll_time = nseconds; |
628 | max_poll_time = nseconds * EIO_TICKS; |
571 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
629 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
572 | } |
630 | } |
573 | |
631 | |
574 | static void etp_set_max_poll_reqs (unsigned int maxreqs) |
632 | static void etp_set_max_poll_reqs (unsigned int maxreqs) |
575 | { |
633 | { |
… | |
… | |
579 | } |
637 | } |
580 | |
638 | |
581 | static void etp_set_max_idle (unsigned int nthreads) |
639 | static void etp_set_max_idle (unsigned int nthreads) |
582 | { |
640 | { |
583 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
641 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
584 | max_idle = nthreads <= 0 ? 1 : nthreads; |
642 | max_idle = nthreads; |
|
|
643 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
644 | } |
|
|
645 | |
|
|
646 | static void etp_set_idle_timeout (unsigned int seconds) |
|
|
647 | { |
|
|
648 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
649 | idle_timeout = seconds; |
585 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
650 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
586 | } |
651 | } |
587 | |
652 | |
588 | static void etp_set_min_parallel (unsigned int nthreads) |
653 | static void etp_set_min_parallel (unsigned int nthreads) |
589 | { |
654 | { |
… | |
… | |
604 | |
669 | |
605 | static void grp_try_feed (eio_req *grp) |
670 | static void grp_try_feed (eio_req *grp) |
606 | { |
671 | { |
607 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
672 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
608 | { |
673 | { |
609 | int old_len = grp->size; |
674 | grp->flags &= ~EIO_FLAG_GROUPADD; |
610 | |
675 | |
611 | EIO_FEED (grp); |
676 | EIO_FEED (grp); |
612 | |
677 | |
613 | /* stop if no progress has been made */ |
678 | /* stop if no progress has been made */ |
614 | if (old_len == grp->size) |
679 | if (!(grp->flags & EIO_FLAG_GROUPADD)) |
615 | { |
680 | { |
616 | grp->feed = 0; |
681 | grp->feed = 0; |
617 | break; |
682 | break; |
618 | } |
683 | } |
619 | } |
684 | } |
… | |
… | |
717 | void eio_set_max_idle (unsigned int nthreads) |
782 | void eio_set_max_idle (unsigned int nthreads) |
718 | { |
783 | { |
719 | etp_set_max_idle (nthreads); |
784 | etp_set_max_idle (nthreads); |
720 | } |
785 | } |
721 | |
786 | |
|
|
787 | void eio_set_idle_timeout (unsigned int seconds) |
|
|
788 | { |
|
|
789 | etp_set_idle_timeout (seconds); |
|
|
790 | } |
|
|
791 | |
722 | void eio_set_min_parallel (unsigned int nthreads) |
792 | void eio_set_min_parallel (unsigned int nthreads) |
723 | { |
793 | { |
724 | etp_set_min_parallel (nthreads); |
794 | etp_set_min_parallel (nthreads); |
725 | } |
795 | } |
726 | |
796 | |
… | |
… | |
736 | |
806 | |
737 | /*****************************************************************************/ |
807 | /*****************************************************************************/ |
738 | /* work around various missing functions */ |
808 | /* work around various missing functions */ |
739 | |
809 | |
740 | #if !HAVE_PREADWRITE |
810 | #if !HAVE_PREADWRITE |
|
|
811 | # undef pread |
|
|
812 | # undef pwrite |
741 | # define pread eio__pread |
813 | # define pread eio__pread |
742 | # define pwrite eio__pwrite |
814 | # define pwrite eio__pwrite |
743 | |
815 | |
744 | static ssize_t |
816 | static ssize_t |
745 | eio__pread (int fd, void *buf, size_t count, off_t offset) |
817 | eio__pread (int fd, void *buf, size_t count, off_t offset) |
… | |
… | |
765 | |
837 | |
766 | X_LOCK (preadwritelock); |
838 | X_LOCK (preadwritelock); |
767 | ooffset = lseek (fd, 0, SEEK_CUR); |
839 | ooffset = lseek (fd, 0, SEEK_CUR); |
768 | lseek (fd, offset, SEEK_SET); |
840 | lseek (fd, offset, SEEK_SET); |
769 | res = write (fd, buf, count); |
841 | res = write (fd, buf, count); |
770 | lseek (fd, offset, SEEK_SET); |
842 | lseek (fd, ooffset, SEEK_SET); |
771 | X_UNLOCK (preadwritelock); |
843 | X_UNLOCK (preadwritelock); |
772 | |
844 | |
773 | return res; |
845 | return res; |
774 | } |
846 | } |
775 | #endif |
847 | #endif |
776 | |
848 | |
777 | #ifndef HAVE_FUTIMES |
849 | #ifndef HAVE_UTIMES |
778 | |
850 | |
|
|
851 | # undef utimes |
779 | # define utimes(path,times) eio__utimes (path, times) |
852 | # define utimes(path,times) eio__utimes (path, times) |
780 | # define futimes(fd,times) eio__futimes (fd, times) |
|
|
781 | |
853 | |
782 | static int |
854 | static int |
783 | eio__utimes (const char *filename, const struct timeval times[2]) |
855 | eio__utimes (const char *filename, const struct timeval times[2]) |
784 | { |
856 | { |
785 | if (times) |
857 | if (times) |
… | |
… | |
793 | } |
865 | } |
794 | else |
866 | else |
795 | return utime (filename, 0); |
867 | return utime (filename, 0); |
796 | } |
868 | } |
797 | |
869 | |
|
|
870 | #endif |
|
|
871 | |
|
|
872 | #ifndef HAVE_FUTIMES |
|
|
873 | |
|
|
874 | # undef futimes |
|
|
875 | # define futimes(fd,times) eio__futimes (fd, times) |
|
|
876 | |
798 | static int eio__futimes (int fd, const struct timeval tv[2]) |
877 | static int eio__futimes (int fd, const struct timeval tv[2]) |
799 | { |
878 | { |
800 | errno = ENOSYS; |
879 | errno = ENOSYS; |
801 | return -1; |
880 | return -1; |
802 | } |
881 | } |
803 | |
882 | |
804 | #endif |
883 | #endif |
805 | |
884 | |
806 | #if !HAVE_FDATASYNC |
885 | #if !HAVE_FDATASYNC |
|
|
886 | # undef fdatasync |
807 | # define fdatasync fsync |
887 | # define fdatasync(fd) fsync (fd) |
808 | #endif |
888 | #endif |
|
|
889 | |
|
|
890 | /* sync_file_range always needs emulation */ |
|
|
891 | int |
|
|
892 | eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags) |
|
|
893 | { |
|
|
894 | #if HAVE_SYNC_FILE_RANGE |
|
|
895 | int res; |
|
|
896 | |
|
|
897 | if (EIO_SYNC_FILE_RANGE_WAIT_BEFORE != SYNC_FILE_RANGE_WAIT_BEFORE |
|
|
898 | || EIO_SYNC_FILE_RANGE_WRITE != SYNC_FILE_RANGE_WRITE |
|
|
899 | || EIO_SYNC_FILE_RANGE_WAIT_AFTER != SYNC_FILE_RANGE_WAIT_AFTER) |
|
|
900 | { |
|
|
901 | flags = 0 |
|
|
902 | | (flags & EIO_SYNC_FILE_RANGE_WAIT_BEFORE ? SYNC_FILE_RANGE_WAIT_BEFORE : 0) |
|
|
903 | | (flags & EIO_SYNC_FILE_RANGE_WRITE ? SYNC_FILE_RANGE_WRITE : 0) |
|
|
904 | | (flags & EIO_SYNC_FILE_RANGE_WAIT_AFTER ? SYNC_FILE_RANGE_WAIT_AFTER : 0); |
|
|
905 | } |
|
|
906 | |
|
|
907 | res = sync_file_range (fd, offset, nbytes, flags); |
|
|
908 | |
|
|
909 | if (!res || errno != ENOSYS) |
|
|
910 | return res; |
|
|
911 | #endif |
|
|
912 | |
|
|
913 | /* even though we could play tricks with the flags, it's better to always |
|
|
914 | * call fdatasync, as that matches the expectation of its users best */ |
|
|
915 | return fdatasync (fd); |
|
|
916 | } |
809 | |
917 | |
810 | #if !HAVE_READAHEAD |
918 | #if !HAVE_READAHEAD |
|
|
919 | # undef readahead |
811 | # define readahead(fd,offset,count) eio__readahead (fd, offset, count, self) |
920 | # define readahead(fd,offset,count) eio__readahead (fd, offset, count, self) |
812 | |
921 | |
813 | static ssize_t |
922 | static ssize_t |
814 | eio__readahead (int fd, off_t offset, size_t count, etp_worker *self) |
923 | eio__readahead (int fd, off_t offset, size_t count, etp_worker *self) |
815 | { |
924 | { |
… | |
… | |
833 | |
942 | |
834 | /* sendfile always needs emulation */ |
943 | /* sendfile always needs emulation */ |
835 | static ssize_t |
944 | static ssize_t |
836 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self) |
945 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self) |
837 | { |
946 | { |
|
|
947 | ssize_t written = 0; |
838 | ssize_t res; |
948 | ssize_t res; |
839 | |
949 | |
840 | if (!count) |
950 | if (!count) |
841 | return 0; |
951 | return 0; |
842 | |
952 | |
|
|
953 | for (;;) |
|
|
954 | { |
843 | #if HAVE_SENDFILE |
955 | #if HAVE_SENDFILE |
844 | # if __linux |
956 | # if __linux |
|
|
957 | off_t soffset = offset; |
845 | res = sendfile (ofd, ifd, &offset, count); |
958 | res = sendfile (ofd, ifd, &soffset, count); |
846 | |
959 | |
847 | # elif __freebsd |
960 | # elif __FreeBSD__ |
848 | /* |
961 | /* |
849 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
962 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
850 | * wasted on making it similar to other I/O functions. |
963 | * wasted on making it similar to other I/O functions. |
851 | */ |
964 | */ |
852 | { |
|
|
853 | off_t sbytes; |
965 | off_t sbytes; |
854 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
966 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
855 | |
967 | |
856 | if (res < 0 && sbytes) |
968 | #if 0 /* according to the manpage, this is correct, but broken behaviour */ |
857 | /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ |
969 | /* freebsd' sendfile will return 0 on success */ |
|
|
970 | /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */ |
|
|
971 | /* not on e.g. EIO or EPIPE - sounds broken */ |
|
|
972 | if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0) |
858 | res = sbytes; |
973 | res = sbytes; |
859 | } |
974 | #endif |
|
|
975 | |
|
|
976 | /* according to source inspection, this is correct, and useful behaviour */ |
|
|
977 | if (sbytes) |
|
|
978 | res = sbytes; |
|
|
979 | |
|
|
980 | # elif defined (__APPLE__) |
|
|
981 | off_t sbytes = count; |
|
|
982 | res = sendfile (ifd, ofd, offset, &sbytes, 0, 0); |
|
|
983 | |
|
|
984 | /* according to the manpage, sbytes is always valid */ |
|
|
985 | if (sbytes) |
|
|
986 | res = sbytes; |
860 | |
987 | |
861 | # elif __hpux |
988 | # elif __hpux |
862 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
989 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
863 | |
990 | |
864 | # elif __solaris |
991 | # elif __solaris |
865 | { |
|
|
866 | struct sendfilevec vec; |
992 | struct sendfilevec vec; |
867 | size_t sbytes; |
993 | size_t sbytes; |
868 | |
994 | |
869 | vec.sfv_fd = ifd; |
995 | vec.sfv_fd = ifd; |
870 | vec.sfv_flag = 0; |
996 | vec.sfv_flag = 0; |
871 | vec.sfv_off = offset; |
997 | vec.sfv_off = offset; |
872 | vec.sfv_len = count; |
998 | vec.sfv_len = count; |
873 | |
999 | |
874 | res = sendfilev (ofd, &vec, 1, &sbytes); |
1000 | res = sendfilev (ofd, &vec, 1, &sbytes); |
875 | |
1001 | |
876 | if (res < 0 && sbytes) |
1002 | if (res < 0 && sbytes) |
877 | res = sbytes; |
1003 | res = sbytes; |
878 | } |
|
|
879 | |
1004 | |
880 | # endif |
1005 | # endif |
|
|
1006 | |
|
|
1007 | #elif defined (_WIN32) |
|
|
1008 | /* does not work, just for documentation of what would need to be done */ |
|
|
1009 | /* actually, cannot be done like this, as TransmitFile changes the file offset, */ |
|
|
1010 | /* libeio guarantees that the file offset does not change, and windows */ |
|
|
1011 | /* has no way to get an independent handle to the same file description */ |
|
|
1012 | HANDLE h = TO_SOCKET (ifd); |
|
|
1013 | SetFilePointer (h, offset, 0, FILE_BEGIN); |
|
|
1014 | res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0); |
|
|
1015 | |
881 | #else |
1016 | #else |
882 | res = -1; |
1017 | res = -1; |
883 | errno = ENOSYS; |
1018 | errno = ENOSYS; |
884 | #endif |
1019 | #endif |
885 | |
1020 | |
|
|
1021 | /* we assume sendfile can copy at least 128mb in one go */ |
|
|
1022 | if (res <= 128 * 1024 * 1024) |
|
|
1023 | { |
|
|
1024 | if (res > 0) |
|
|
1025 | written += res; |
|
|
1026 | |
|
|
1027 | if (written) |
|
|
1028 | return written; |
|
|
1029 | |
|
|
1030 | break; |
|
|
1031 | } |
|
|
1032 | else |
|
|
1033 | { |
|
|
1034 | /* if we requested more, then probably the kernel was lazy */ |
|
|
1035 | written += res; |
|
|
1036 | offset += res; |
|
|
1037 | count -= res; |
|
|
1038 | |
|
|
1039 | if (!count) |
|
|
1040 | return written; |
|
|
1041 | } |
|
|
1042 | } |
|
|
1043 | |
886 | if (res < 0 |
1044 | if (res < 0 |
887 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
1045 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
|
|
1046 | /* BSDs */ |
|
|
1047 | #ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */ |
|
|
1048 | || errno == ENOTSUP |
|
|
1049 | #endif |
|
|
1050 | || errno == EOPNOTSUPP /* BSDs */ |
888 | #if __solaris |
1051 | #if __solaris |
889 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
1052 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
890 | #endif |
1053 | #endif |
891 | ) |
1054 | ) |
892 | ) |
1055 | ) |
… | |
… | |
923 | } |
1086 | } |
924 | |
1087 | |
925 | return res; |
1088 | return res; |
926 | } |
1089 | } |
927 | |
1090 | |
|
|
1091 | static signed char |
|
|
1092 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
|
|
1093 | { |
|
|
1094 | return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */ |
|
|
1095 | : a->inode < b->inode ? -1 |
|
|
1096 | : a->inode > b->inode ? 1 |
|
|
1097 | : 0; |
|
|
1098 | } |
|
|
1099 | |
|
|
1100 | #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0 |
|
|
1101 | |
|
|
1102 | #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */ |
|
|
1103 | #define EIO_SORT_FAST 60 /* when to only use insertion sort */ |
|
|
1104 | |
|
|
1105 | static void |
|
|
1106 | eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
|
|
1107 | { |
|
|
1108 | unsigned char bits [9 + sizeof (ino_t) * 8]; |
|
|
1109 | unsigned char *bit = bits; |
|
|
1110 | |
|
|
1111 | assert (CHAR_BIT == 8); |
|
|
1112 | assert (sizeof (eio_dirent) * 8 < 256); |
|
|
1113 | assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */ |
|
|
1114 | assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */ |
|
|
1115 | |
|
|
1116 | if (size <= EIO_SORT_FAST) |
|
|
1117 | return; |
|
|
1118 | |
|
|
1119 | /* first prepare an array of bits to test in our radix sort */ |
|
|
1120 | /* try to take endianness into account, as well as differences in ino_t sizes */ |
|
|
1121 | /* inode_bits must contain all inodes ORed together */ |
|
|
1122 | /* which is used to skip bits that are 0 everywhere, which is very common */ |
|
|
1123 | { |
|
|
1124 | ino_t endianness; |
|
|
1125 | int i, j; |
|
|
1126 | |
|
|
1127 | /* we store the byte offset of byte n into byte n of "endianness" */ |
|
|
1128 | for (i = 0; i < sizeof (ino_t); ++i) |
|
|
1129 | ((unsigned char *)&endianness)[i] = i; |
|
|
1130 | |
|
|
1131 | *bit++ = 0; |
|
|
1132 | |
|
|
1133 | for (i = 0; i < sizeof (ino_t); ++i) |
|
|
1134 | { |
|
|
1135 | /* shifting off the byte offsets out of "endianness" */ |
|
|
1136 | int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8; |
|
|
1137 | endianness >>= 8; |
|
|
1138 | |
|
|
1139 | for (j = 0; j < 8; ++j) |
|
|
1140 | if (inode_bits & (((ino_t)1) << (i * 8 + j))) |
|
|
1141 | *bit++ = offs + j; |
|
|
1142 | } |
|
|
1143 | |
|
|
1144 | for (j = 0; j < 8; ++j) |
|
|
1145 | if (score_bits & (1 << j)) |
|
|
1146 | *bit++ = offsetof (eio_dirent, score) * 8 + j; |
|
|
1147 | } |
|
|
1148 | |
|
|
1149 | /* now actually do the sorting (a variant of MSD radix sort) */ |
|
|
1150 | { |
|
|
1151 | eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base; |
|
|
1152 | eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end; |
|
|
1153 | unsigned char *bit_stk [9 + sizeof (ino_t) * 8]; |
|
|
1154 | int stk_idx = 0; |
|
|
1155 | |
|
|
1156 | base_stk [stk_idx] = dents; |
|
|
1157 | end_stk [stk_idx] = dents + size; |
|
|
1158 | bit_stk [stk_idx] = bit - 1; |
|
|
1159 | |
|
|
1160 | do |
|
|
1161 | { |
|
|
1162 | base = base_stk [stk_idx]; |
|
|
1163 | end = end_stk [stk_idx]; |
|
|
1164 | bit = bit_stk [stk_idx]; |
|
|
1165 | |
|
|
1166 | for (;;) |
|
|
1167 | { |
|
|
1168 | unsigned char O = *bit >> 3; |
|
|
1169 | unsigned char M = 1 << (*bit & 7); |
|
|
1170 | |
|
|
1171 | eio_dirent *a = base; |
|
|
1172 | eio_dirent *b = end; |
|
|
1173 | |
|
|
1174 | if (b - a < EIO_SORT_CUTOFF) |
|
|
1175 | break; |
|
|
1176 | |
|
|
1177 | /* now bit-partition the array on the bit */ |
|
|
1178 | /* this ugly asymmetric loop seems to perform much better than typical */ |
|
|
1179 | /* partition algos found in the literature */ |
|
|
1180 | do |
|
|
1181 | if (!(((unsigned char *)a)[O] & M)) |
|
|
1182 | ++a; |
|
|
1183 | else if (!(((unsigned char *)--b)[O] & M)) |
|
|
1184 | { |
|
|
1185 | eio_dirent tmp = *a; *a = *b; *b = tmp; |
|
|
1186 | ++a; |
|
|
1187 | } |
|
|
1188 | while (b > a); |
|
|
1189 | |
|
|
1190 | /* next bit, or stop, if no bits left in this path */ |
|
|
1191 | if (!*--bit) |
|
|
1192 | break; |
|
|
1193 | |
|
|
1194 | base_stk [stk_idx] = a; |
|
|
1195 | end_stk [stk_idx] = end; |
|
|
1196 | bit_stk [stk_idx] = bit; |
|
|
1197 | ++stk_idx; |
|
|
1198 | |
|
|
1199 | end = a; |
|
|
1200 | } |
|
|
1201 | } |
|
|
1202 | while (stk_idx--); |
|
|
1203 | } |
|
|
1204 | } |
|
|
1205 | |
|
|
1206 | static void |
|
|
1207 | eio_dent_insertion_sort (eio_dirent *dents, int size) |
|
|
1208 | { |
|
|
1209 | /* first move the smallest element to the front, to act as a sentinel */ |
|
|
1210 | { |
|
|
1211 | int i; |
|
|
1212 | eio_dirent *min = dents; |
|
|
1213 | |
|
|
1214 | /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */ |
|
|
1215 | for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; ) |
|
|
1216 | if (EIO_DENT_CMP (dents [i], <, *min)) |
|
|
1217 | min = &dents [i]; |
|
|
1218 | |
|
|
1219 | /* swap elements 0 and j (minimum) */ |
|
|
1220 | { |
|
|
1221 | eio_dirent tmp = *dents; *dents = *min; *min = tmp; |
|
|
1222 | } |
|
|
1223 | } |
|
|
1224 | |
|
|
1225 | /* then do standard insertion sort, assuming that all elements are >= dents [0] */ |
|
|
1226 | { |
|
|
1227 | eio_dirent *i, *j; |
|
|
1228 | |
|
|
1229 | for (i = dents + 1; i < dents + size; ++i) |
|
|
1230 | { |
|
|
1231 | eio_dirent value = *i; |
|
|
1232 | |
|
|
1233 | for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j) |
|
|
1234 | j [1] = j [0]; |
|
|
1235 | |
|
|
1236 | j [1] = value; |
|
|
1237 | } |
|
|
1238 | } |
|
|
1239 | } |
|
|
1240 | |
|
|
1241 | static void |
|
|
1242 | eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
|
|
1243 | { |
|
|
1244 | if (size <= 1) |
|
|
1245 | return; /* our insertion sort relies on size > 0 */ |
|
|
1246 | |
|
|
1247 | /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */ |
|
|
1248 | /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */ |
|
|
1249 | eio_dent_radix_sort (dents, size, score_bits, inode_bits); |
|
|
1250 | |
|
|
1251 | /* use an insertion sort at the end, or for small arrays, */ |
|
|
1252 | /* as insertion sort is more efficient for small partitions */ |
|
|
1253 | eio_dent_insertion_sort (dents, size); |
|
|
1254 | } |
|
|
1255 | |
928 | /* read a full directory */ |
1256 | /* read a full directory */ |
929 | static void |
1257 | static void |
930 | eio__scandir (eio_req *req, etp_worker *self) |
1258 | eio__scandir (eio_req *req, etp_worker *self) |
931 | { |
1259 | { |
932 | DIR *dirp; |
1260 | DIR *dirp; |
933 | EIO_STRUCT_DIRENT *entp; |
1261 | EIO_STRUCT_DIRENT *entp; |
934 | char *name, *names; |
1262 | char *name, *names; |
935 | int memlen = 4096; |
1263 | int namesalloc = 4096; |
936 | int memofs = 0; |
1264 | int namesoffs = 0; |
|
|
1265 | int flags = req->int1; |
|
|
1266 | eio_dirent *dents = 0; |
|
|
1267 | int dentalloc = 128; |
937 | int res = 0; |
1268 | int dentoffs = 0; |
|
|
1269 | ino_t inode_bits = 0; |
|
|
1270 | |
|
|
1271 | req->result = -1; |
|
|
1272 | |
|
|
1273 | if (!(flags & EIO_READDIR_DENTS)) |
|
|
1274 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
938 | |
1275 | |
939 | X_LOCK (wrklock); |
1276 | X_LOCK (wrklock); |
940 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
1277 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
941 | self->dirp = dirp = opendir (req->ptr1); |
1278 | self->dirp = dirp = opendir (req->ptr1); |
|
|
1279 | |
942 | req->flags |= EIO_FLAG_PTR2_FREE; |
1280 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
|
|
1281 | req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
943 | req->ptr2 = names = malloc (memlen); |
1282 | req->ptr2 = names = malloc (namesalloc); |
944 | X_UNLOCK (wrklock); |
1283 | X_UNLOCK (wrklock); |
945 | |
1284 | |
946 | if (dirp && names) |
1285 | if (dirp && names && (!flags || dents)) |
947 | for (;;) |
1286 | for (;;) |
948 | { |
1287 | { |
949 | errno = 0; |
1288 | errno = 0; |
950 | entp = readdir (dirp); |
1289 | entp = readdir (dirp); |
951 | |
1290 | |
952 | if (!entp) |
1291 | if (!entp) |
|
|
1292 | { |
|
|
1293 | if (errno) |
|
|
1294 | break; |
|
|
1295 | |
|
|
1296 | /* sort etc. */ |
|
|
1297 | req->int1 = flags; |
|
|
1298 | req->result = dentoffs; |
|
|
1299 | |
|
|
1300 | if (flags & EIO_READDIR_STAT_ORDER) |
|
|
1301 | eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits); |
|
|
1302 | else if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1303 | if (flags & EIO_READDIR_FOUND_UNKNOWN) |
|
|
1304 | eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */ |
|
|
1305 | else |
|
|
1306 | { |
|
|
1307 | /* in this case, all is known, and we just put dirs first and sort them */ |
|
|
1308 | eio_dirent *oth = dents + dentoffs; |
|
|
1309 | eio_dirent *dir = dents; |
|
|
1310 | |
|
|
1311 | /* now partition dirs to the front, and non-dirs to the back */ |
|
|
1312 | /* by walking from both sides and swapping if necessary */ |
|
|
1313 | while (oth > dir) |
|
|
1314 | { |
|
|
1315 | if (dir->type == EIO_DT_DIR) |
|
|
1316 | ++dir; |
|
|
1317 | else if ((--oth)->type == EIO_DT_DIR) |
|
|
1318 | { |
|
|
1319 | eio_dirent tmp = *dir; *dir = *oth; *oth = tmp; |
|
|
1320 | |
|
|
1321 | ++dir; |
|
|
1322 | } |
|
|
1323 | } |
|
|
1324 | |
|
|
1325 | /* now sort the dirs only (dirs all have the same score) */ |
|
|
1326 | eio_dent_sort (dents, dir - dents, 0, inode_bits); |
|
|
1327 | } |
|
|
1328 | |
953 | break; |
1329 | break; |
|
|
1330 | } |
954 | |
1331 | |
|
|
1332 | /* now add the entry to our list(s) */ |
955 | name = entp->d_name; |
1333 | name = entp->d_name; |
956 | |
1334 | |
|
|
1335 | /* skip . and .. entries */ |
957 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
1336 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
958 | { |
1337 | { |
959 | int len = strlen (name) + 1; |
1338 | int len = D_NAMLEN (entp) + 1; |
960 | |
1339 | |
961 | res++; |
1340 | while (expect_false (namesoffs + len > namesalloc)) |
962 | |
|
|
963 | while (memofs + len > memlen) |
|
|
964 | { |
1341 | { |
965 | memlen *= 2; |
1342 | namesalloc *= 2; |
966 | X_LOCK (wrklock); |
1343 | X_LOCK (wrklock); |
967 | req->ptr2 = names = realloc (names, memlen); |
1344 | req->ptr2 = names = realloc (names, namesalloc); |
968 | X_UNLOCK (wrklock); |
1345 | X_UNLOCK (wrklock); |
969 | |
1346 | |
970 | if (!names) |
1347 | if (!names) |
971 | break; |
1348 | break; |
972 | } |
1349 | } |
973 | |
1350 | |
974 | memcpy (names + memofs, name, len); |
1351 | memcpy (names + namesoffs, name, len); |
|
|
1352 | |
|
|
1353 | if (dents) |
|
|
1354 | { |
|
|
1355 | struct eio_dirent *ent; |
|
|
1356 | |
|
|
1357 | if (expect_false (dentoffs == dentalloc)) |
|
|
1358 | { |
|
|
1359 | dentalloc *= 2; |
|
|
1360 | X_LOCK (wrklock); |
|
|
1361 | req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
|
|
1362 | X_UNLOCK (wrklock); |
|
|
1363 | |
|
|
1364 | if (!dents) |
|
|
1365 | break; |
|
|
1366 | } |
|
|
1367 | |
|
|
1368 | ent = dents + dentoffs; |
|
|
1369 | |
|
|
1370 | ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */ |
|
|
1371 | ent->namelen = len - 1; |
|
|
1372 | ent->inode = D_INO (entp); |
|
|
1373 | |
|
|
1374 | inode_bits |= ent->inode; |
|
|
1375 | |
|
|
1376 | switch (D_TYPE (entp)) |
|
|
1377 | { |
|
|
1378 | default: |
|
|
1379 | ent->type = EIO_DT_UNKNOWN; |
|
|
1380 | flags |= EIO_READDIR_FOUND_UNKNOWN; |
|
|
1381 | break; |
|
|
1382 | |
|
|
1383 | #ifdef DT_FIFO |
|
|
1384 | case DT_FIFO: ent->type = EIO_DT_FIFO; break; |
|
|
1385 | #endif |
|
|
1386 | #ifdef DT_CHR |
|
|
1387 | case DT_CHR: ent->type = EIO_DT_CHR; break; |
|
|
1388 | #endif |
|
|
1389 | #ifdef DT_MPC |
|
|
1390 | case DT_MPC: ent->type = EIO_DT_MPC; break; |
|
|
1391 | #endif |
|
|
1392 | #ifdef DT_DIR |
|
|
1393 | case DT_DIR: ent->type = EIO_DT_DIR; break; |
|
|
1394 | #endif |
|
|
1395 | #ifdef DT_NAM |
|
|
1396 | case DT_NAM: ent->type = EIO_DT_NAM; break; |
|
|
1397 | #endif |
|
|
1398 | #ifdef DT_BLK |
|
|
1399 | case DT_BLK: ent->type = EIO_DT_BLK; break; |
|
|
1400 | #endif |
|
|
1401 | #ifdef DT_MPB |
|
|
1402 | case DT_MPB: ent->type = EIO_DT_MPB; break; |
|
|
1403 | #endif |
|
|
1404 | #ifdef DT_REG |
|
|
1405 | case DT_REG: ent->type = EIO_DT_REG; break; |
|
|
1406 | #endif |
|
|
1407 | #ifdef DT_NWK |
|
|
1408 | case DT_NWK: ent->type = EIO_DT_NWK; break; |
|
|
1409 | #endif |
|
|
1410 | #ifdef DT_CMP |
|
|
1411 | case DT_CMP: ent->type = EIO_DT_CMP; break; |
|
|
1412 | #endif |
|
|
1413 | #ifdef DT_LNK |
|
|
1414 | case DT_LNK: ent->type = EIO_DT_LNK; break; |
|
|
1415 | #endif |
|
|
1416 | #ifdef DT_SOCK |
|
|
1417 | case DT_SOCK: ent->type = EIO_DT_SOCK; break; |
|
|
1418 | #endif |
|
|
1419 | #ifdef DT_DOOR |
|
|
1420 | case DT_DOOR: ent->type = EIO_DT_DOOR; break; |
|
|
1421 | #endif |
|
|
1422 | #ifdef DT_WHT |
|
|
1423 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
|
|
1424 | #endif |
|
|
1425 | } |
|
|
1426 | |
|
|
1427 | ent->score = 7; |
|
|
1428 | |
|
|
1429 | if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1430 | { |
|
|
1431 | if (ent->type == EIO_DT_UNKNOWN) |
|
|
1432 | { |
|
|
1433 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
|
|
1434 | ent->score = 1; |
|
|
1435 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
|
|
1436 | ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */ |
|
|
1437 | } |
|
|
1438 | else if (ent->type == EIO_DT_DIR) |
|
|
1439 | ent->score = 0; |
|
|
1440 | } |
|
|
1441 | } |
|
|
1442 | |
975 | memofs += len; |
1443 | namesoffs += len; |
|
|
1444 | ++dentoffs; |
|
|
1445 | } |
|
|
1446 | |
|
|
1447 | if (EIO_CANCELLED (req)) |
|
|
1448 | { |
|
|
1449 | errno = ECANCELED; |
|
|
1450 | break; |
976 | } |
1451 | } |
977 | } |
1452 | } |
978 | |
|
|
979 | if (errno) |
|
|
980 | res = -1; |
|
|
981 | |
|
|
982 | req->result = res; |
|
|
983 | } |
1453 | } |
984 | |
1454 | |
985 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
|
|
986 | # define msync(a,b,c) ENOSYS |
|
|
987 | #endif |
|
|
988 | |
|
|
989 | int |
|
|
990 | eio__mtouch (void *mem, size_t len, int flags) |
|
|
991 | { |
|
|
992 | intptr_t addr = (intptr_t)mem; |
|
|
993 | intptr_t end = addr + len; |
|
|
994 | #ifdef PAGESIZE |
1455 | #ifdef PAGESIZE |
995 | const intptr_t page = PAGESIZE; |
1456 | # define eio_pagesize() PAGESIZE |
996 | #else |
1457 | #else |
|
|
1458 | static intptr_t |
|
|
1459 | eio_pagesize (void) |
|
|
1460 | { |
997 | static intptr_t page; |
1461 | static intptr_t page; |
998 | |
1462 | |
999 | if (!page) |
1463 | if (!page) |
1000 | page = sysconf (_SC_PAGESIZE); |
1464 | page = sysconf (_SC_PAGESIZE); |
|
|
1465 | |
|
|
1466 | return page; |
|
|
1467 | } |
|
|
1468 | #endif |
|
|
1469 | |
|
|
1470 | static void |
|
|
1471 | eio_page_align (void **addr, size_t *length) |
|
|
1472 | { |
|
|
1473 | intptr_t mask = eio_pagesize () - 1; |
|
|
1474 | |
|
|
1475 | /* round down addr */ |
|
|
1476 | intptr_t adj = mask & (intptr_t)*addr; |
|
|
1477 | |
|
|
1478 | *addr = (void *)((intptr_t)*addr - adj); |
|
|
1479 | *length += adj; |
|
|
1480 | |
|
|
1481 | /* round up length */ |
|
|
1482 | *length = (*length + mask) & ~mask; |
|
|
1483 | } |
|
|
1484 | |
|
|
1485 | #if !_POSIX_MEMLOCK |
|
|
1486 | # define eio__mlockall(a) ((errno = ENOSYS), -1) |
|
|
1487 | #else |
|
|
1488 | |
|
|
1489 | static int |
|
|
1490 | eio__mlockall (int flags) |
|
|
1491 | { |
|
|
1492 | #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7 |
|
|
1493 | extern int mallopt (int, int); |
|
|
1494 | mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */ |
1001 | #endif |
1495 | #endif |
1002 | |
1496 | |
1003 | addr &= ~(page - 1); /* assume page size is always a power of two */ |
1497 | if (EIO_MCL_CURRENT != MCL_CURRENT |
|
|
1498 | || EIO_MCL_FUTURE != MCL_FUTURE) |
|
|
1499 | { |
|
|
1500 | flags = 0 |
|
|
1501 | | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0) |
|
|
1502 | | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0); |
|
|
1503 | } |
1004 | |
1504 | |
|
|
1505 | return mlockall (flags); |
|
|
1506 | } |
|
|
1507 | #endif |
|
|
1508 | |
|
|
1509 | #if !_POSIX_MEMLOCK_RANGE |
|
|
1510 | # define eio__mlock(a,b) ((errno = ENOSYS), -1) |
|
|
1511 | #else |
|
|
1512 | |
|
|
1513 | static int |
|
|
1514 | eio__mlock (void *addr, size_t length) |
|
|
1515 | { |
|
|
1516 | eio_page_align (&addr, &length); |
|
|
1517 | |
|
|
1518 | return mlock (addr, length); |
|
|
1519 | } |
|
|
1520 | |
|
|
1521 | #endif |
|
|
1522 | |
|
|
1523 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
|
|
1524 | # define eio__msync(a,b,c) ((errno = ENOSYS), -1) |
|
|
1525 | #else |
|
|
1526 | |
|
|
1527 | int |
|
|
1528 | eio__msync (void *mem, size_t len, int flags) |
|
|
1529 | { |
|
|
1530 | eio_page_align (&mem, &len); |
|
|
1531 | |
|
|
1532 | if (EIO_MS_ASYNC != MS_SYNC |
|
|
1533 | || EIO_MS_INVALIDATE != MS_INVALIDATE |
|
|
1534 | || EIO_MS_SYNC != MS_SYNC) |
|
|
1535 | { |
|
|
1536 | flags = 0 |
|
|
1537 | | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0) |
|
|
1538 | | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0) |
|
|
1539 | | (flags & EIO_MS_SYNC ? MS_SYNC : 0); |
|
|
1540 | } |
|
|
1541 | |
|
|
1542 | return msync (mem, len, flags); |
|
|
1543 | } |
|
|
1544 | |
|
|
1545 | #endif |
|
|
1546 | |
|
|
1547 | int |
|
|
1548 | eio__mtouch (eio_req *req) |
|
|
1549 | { |
|
|
1550 | void *mem = req->ptr2; |
|
|
1551 | size_t len = req->size; |
|
|
1552 | int flags = req->int1; |
|
|
1553 | |
|
|
1554 | eio_page_align (&mem, &len); |
|
|
1555 | |
|
|
1556 | { |
|
|
1557 | intptr_t addr = (intptr_t)mem; |
|
|
1558 | intptr_t end = addr + len; |
|
|
1559 | intptr_t page = eio_pagesize (); |
|
|
1560 | |
1005 | if (addr < end) |
1561 | if (addr < end) |
1006 | if (flags) /* modify */ |
1562 | if (flags & EIO_MT_MODIFY) /* modify */ |
1007 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len); |
1563 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
1008 | else |
1564 | else |
1009 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len); |
1565 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
|
|
1566 | } |
1010 | |
1567 | |
1011 | return 0; |
1568 | return 0; |
1012 | } |
1569 | } |
1013 | |
1570 | |
1014 | /*****************************************************************************/ |
1571 | /*****************************************************************************/ |
… | |
… | |
1048 | if (req) |
1605 | if (req) |
1049 | break; |
1606 | break; |
1050 | |
1607 | |
1051 | ++idle; |
1608 | ++idle; |
1052 | |
1609 | |
1053 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
1610 | ts.tv_sec = time (0) + idle_timeout; |
1054 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
1611 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
1055 | { |
1612 | { |
1056 | if (idle > max_idle) |
1613 | if (idle > max_idle) |
1057 | { |
1614 | { |
1058 | --idle; |
1615 | --idle; |
… | |
… | |
1137 | return 0; \ |
1694 | return 0; \ |
1138 | } |
1695 | } |
1139 | |
1696 | |
1140 | static void eio_execute (etp_worker *self, eio_req *req) |
1697 | static void eio_execute (etp_worker *self, eio_req *req) |
1141 | { |
1698 | { |
1142 | errno = 0; |
|
|
1143 | |
|
|
1144 | switch (req->type) |
1699 | switch (req->type) |
1145 | { |
1700 | { |
1146 | case EIO_READ: ALLOC (req->size); |
1701 | case EIO_READ: ALLOC (req->size); |
1147 | req->result = req->offs >= 0 |
1702 | req->result = req->offs >= 0 |
1148 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
1703 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
… | |
… | |
1159 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1714 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1160 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1715 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1161 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1716 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1162 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1717 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1163 | |
1718 | |
|
|
1719 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1720 | req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1721 | case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1722 | req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1723 | |
1164 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
1724 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
1165 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
1725 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
1166 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
1726 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
1167 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
1727 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
1168 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
1728 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
… | |
… | |
1175 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
1735 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
1176 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
1736 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
1177 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
1737 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
1178 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
1738 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
1179 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
1739 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
1180 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break; |
1740 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
1181 | |
1741 | |
1182 | case EIO_READLINK: ALLOC (NAME_MAX); |
1742 | case EIO_READLINK: ALLOC (PATH_MAX); |
1183 | req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; |
1743 | req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break; |
1184 | |
1744 | |
1185 | case EIO_SYNC: req->result = 0; sync (); break; |
1745 | case EIO_SYNC: req->result = 0; sync (); break; |
1186 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
1746 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
1187 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
1747 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
1188 | case EIO_MSYNC: req->result = msync (req->ptr2, req->size, req->int1); break; |
1748 | case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break; |
|
|
1749 | case EIO_MTOUCH: req->result = eio__mtouch (req); break; |
1189 | case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break; |
1750 | case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break; |
|
|
1751 | case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break; |
|
|
1752 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
1190 | |
1753 | |
1191 | case EIO_READDIR: eio__scandir (req, self); break; |
1754 | case EIO_READDIR: eio__scandir (req, self); break; |
1192 | |
1755 | |
1193 | case EIO_BUSY: |
1756 | case EIO_BUSY: |
1194 | #ifdef _WIN32 |
1757 | #ifdef _WIN32 |
1195 | Sleep (req->nv1 * 1000.); |
1758 | Sleep (req->nv1 * 1e3); |
1196 | #else |
1759 | #else |
1197 | { |
1760 | { |
1198 | struct timeval tv; |
1761 | struct timeval tv; |
1199 | |
1762 | |
1200 | tv.tv_sec = req->nv1; |
1763 | tv.tv_sec = req->nv1; |
1201 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; |
1764 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6; |
1202 | |
1765 | |
1203 | req->result = select (0, 0, 0, 0, &tv); |
1766 | req->result = select (0, 0, 0, 0, &tv); |
1204 | } |
1767 | } |
1205 | #endif |
1768 | #endif |
1206 | break; |
1769 | break; |
… | |
… | |
1221 | times = tv; |
1784 | times = tv; |
1222 | } |
1785 | } |
1223 | else |
1786 | else |
1224 | times = 0; |
1787 | times = 0; |
1225 | |
1788 | |
1226 | |
|
|
1227 | req->result = req->type == EIO_FUTIME |
1789 | req->result = req->type == EIO_FUTIME |
1228 | ? futimes (req->int1, times) |
1790 | ? futimes (req->int1, times) |
1229 | : utimes (req->ptr1, times); |
1791 | : utimes (req->ptr1, times); |
1230 | } |
1792 | } |
1231 | break; |
1793 | break; |
… | |
… | |
1236 | case EIO_NOP: |
1798 | case EIO_NOP: |
1237 | req->result = 0; |
1799 | req->result = 0; |
1238 | break; |
1800 | break; |
1239 | |
1801 | |
1240 | case EIO_CUSTOM: |
1802 | case EIO_CUSTOM: |
1241 | ((void (*)(eio_req *))req->feed) (req); |
1803 | req->feed (req); |
1242 | break; |
1804 | break; |
1243 | |
1805 | |
1244 | default: |
1806 | default: |
|
|
1807 | errno = ENOSYS; |
1245 | req->result = -1; |
1808 | req->result = -1; |
1246 | break; |
1809 | break; |
1247 | } |
1810 | } |
1248 | |
1811 | |
1249 | req->errorno = errno; |
1812 | req->errorno = errno; |
… | |
… | |
1279 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
1842 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
1280 | { |
1843 | { |
1281 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
1844 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
1282 | } |
1845 | } |
1283 | |
1846 | |
|
|
1847 | eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data) |
|
|
1848 | { |
|
|
1849 | REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND; |
|
|
1850 | } |
|
|
1851 | |
|
|
1852 | eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data) |
|
|
1853 | { |
|
|
1854 | REQ (EIO_MLOCKALL); req->int1 = flags; SEND; |
|
|
1855 | } |
|
|
1856 | |
|
|
1857 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
|
|
1858 | { |
|
|
1859 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
|
|
1860 | } |
|
|
1861 | |
1284 | eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data) |
1862 | eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data) |
1285 | { |
1863 | { |
1286 | REQ (EIO_FDATASYNC); req->int1 = fd; SEND; |
1864 | REQ (EIO_FDATASYNC); req->int1 = fd; SEND; |
1287 | } |
1865 | } |
1288 | |
1866 | |
… | |
… | |
1307 | } |
1885 | } |
1308 | |
1886 | |
1309 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
1887 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
1310 | { |
1888 | { |
1311 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
1889 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
|
|
1890 | } |
|
|
1891 | |
|
|
1892 | eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data) |
|
|
1893 | { |
|
|
1894 | REQ (EIO_FSTATVFS); req->int1 = fd; SEND; |
1312 | } |
1895 | } |
1313 | |
1896 | |
1314 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
1897 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
1315 | { |
1898 | { |
1316 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
1899 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
… | |
… | |
1390 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
1973 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
1391 | { |
1974 | { |
1392 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
1975 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
1393 | } |
1976 | } |
1394 | |
1977 | |
|
|
1978 | eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data) |
|
|
1979 | { |
|
|
1980 | return eio__1path (EIO_STATVFS, path, pri, cb, data); |
|
|
1981 | } |
|
|
1982 | |
1395 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
1983 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
1396 | { |
1984 | { |
1397 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
1985 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
1398 | } |
1986 | } |
1399 | |
1987 | |
1400 | eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data) |
1988 | eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data) |
1401 | { |
1989 | { |
1402 | return eio__1path (EIO_RMDIR, path, pri, cb, data); |
1990 | return eio__1path (EIO_RMDIR, path, pri, cb, data); |
1403 | } |
1991 | } |
1404 | |
1992 | |
1405 | eio_req *eio_readdir (const char *path, int pri, eio_cb cb, void *data) |
1993 | eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data) |
1406 | { |
1994 | { |
1407 | return eio__1path (EIO_READDIR, path, pri, cb, data); |
1995 | REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; |
1408 | } |
1996 | } |
1409 | |
1997 | |
1410 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
1998 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
1411 | { |
1999 | { |
1412 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND; |
2000 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND; |
1413 | } |
2001 | } |
1414 | |
2002 | |
1415 | static eio_req * |
2003 | static eio_req * |
1416 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
2004 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1417 | { |
2005 | { |
… | |
… | |
1441 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
2029 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1442 | { |
2030 | { |
1443 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
2031 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
1444 | } |
2032 | } |
1445 | |
2033 | |
1446 | eio_req *eio_custom (eio_cb execute, int pri, eio_cb cb, void *data) |
2034 | eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data) |
1447 | { |
2035 | { |
1448 | REQ (EIO_CUSTOM); req->feed = (void (*)(eio_req *))execute; SEND; |
2036 | REQ (EIO_CUSTOM); req->feed = execute; SEND; |
1449 | } |
2037 | } |
1450 | |
2038 | |
1451 | #endif |
2039 | #endif |
1452 | |
2040 | |
1453 | eio_req *eio_grp (eio_cb cb, void *data) |
2041 | eio_req *eio_grp (eio_cb cb, void *data) |
… | |
… | |
1481 | |
2069 | |
1482 | void eio_grp_add (eio_req *grp, eio_req *req) |
2070 | void eio_grp_add (eio_req *grp, eio_req *req) |
1483 | { |
2071 | { |
1484 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
2072 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
1485 | |
2073 | |
|
|
2074 | grp->flags |= EIO_FLAG_GROUPADD; |
|
|
2075 | |
1486 | ++grp->size; |
2076 | ++grp->size; |
1487 | req->grp = grp; |
2077 | req->grp = grp; |
1488 | |
2078 | |
1489 | req->grp_prev = 0; |
2079 | req->grp_prev = 0; |
1490 | req->grp_next = grp->grp_first; |
2080 | req->grp_next = grp->grp_first; |
… | |
… | |
1499 | /* misc garbage */ |
2089 | /* misc garbage */ |
1500 | |
2090 | |
1501 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
2091 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
1502 | { |
2092 | { |
1503 | etp_worker wrk; |
2093 | etp_worker wrk; |
|
|
2094 | ssize_t ret; |
1504 | |
2095 | |
1505 | wrk.dbuf = 0; |
2096 | wrk.dbuf = 0; |
1506 | |
2097 | |
1507 | eio__sendfile (ofd, ifd, offset, count, &wrk); |
2098 | ret = eio__sendfile (ofd, ifd, offset, count, &wrk); |
1508 | |
2099 | |
1509 | if (wrk.dbuf) |
2100 | if (wrk.dbuf) |
1510 | free (wrk.dbuf); |
2101 | free (wrk.dbuf); |
1511 | } |
|
|
1512 | |
2102 | |
|
|
2103 | return ret; |
|
|
2104 | } |
|
|
2105 | |