| 1 | /* |
1 | /* |
| 2 | * libeio implementation |
2 | * libeio implementation |
| 3 | * |
3 | * |
| 4 | * Copyright (c) 2007,2008,2009 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" |
| 41 | |
45 | |
| 42 | #ifdef EIO_STACKSIZE |
46 | #ifdef EIO_STACKSIZE |
| 43 | # define XTHREAD_STACKSIZE EIO_STACKSIZE |
47 | # define XTHREAD_STACKSIZE EIO_STACKSIZE |
| 44 | #endif |
48 | #endif |
| … | |
… | |
| 49 | #include <stdlib.h> |
53 | #include <stdlib.h> |
| 50 | #include <string.h> |
54 | #include <string.h> |
| 51 | #include <errno.h> |
55 | #include <errno.h> |
| 52 | #include <sys/types.h> |
56 | #include <sys/types.h> |
| 53 | #include <sys/stat.h> |
57 | #include <sys/stat.h> |
|
|
58 | #include <sys/statvfs.h> |
| 54 | #include <limits.h> |
59 | #include <limits.h> |
| 55 | #include <fcntl.h> |
60 | #include <fcntl.h> |
| 56 | #include <assert.h> |
61 | #include <assert.h> |
| 57 | |
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 | |
| 58 | #ifndef EIO_FINISH |
69 | #ifndef EIO_FINISH |
| 59 | # 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 |
| 60 | #endif |
71 | #endif |
| 61 | |
72 | |
| 62 | #ifndef EIO_DESTROY |
73 | #ifndef EIO_DESTROY |
| … | |
… | |
| 70 | #ifdef _WIN32 |
81 | #ifdef _WIN32 |
| 71 | |
82 | |
| 72 | /*doh*/ |
83 | /*doh*/ |
| 73 | #else |
84 | #else |
| 74 | |
85 | |
| 75 | # include "config.h" |
|
|
| 76 | # include <sys/time.h> |
86 | # include <sys/time.h> |
| 77 | # include <sys/select.h> |
87 | # include <sys/select.h> |
| 78 | # include <unistd.h> |
88 | # include <unistd.h> |
| 79 | # include <utime.h> |
89 | # include <utime.h> |
| 80 | # include <signal.h> |
90 | # include <signal.h> |
| 81 | # include <dirent.h> |
91 | # include <dirent.h> |
| 82 | |
92 | |
|
|
93 | #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES |
|
|
94 | # include <sys/mman.h> |
|
|
95 | #endif |
|
|
96 | |
| 83 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
97 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
| 84 | # if defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) |
98 | # if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__ |
|
|
99 | # define _DIRENT_HAVE_D_TYPE /* sigh */ |
| 85 | # define D_INO(de) (de)->d_fileno |
100 | # define D_INO(de) (de)->d_fileno |
| 86 | # define _DIRENT_HAVE_D_TYPE /* sigh */ |
101 | # define D_NAMLEN(de) (de)->d_namlen |
| 87 | # elif defined(__linux) || defined(d_ino) || _XOPEN_SOURCE >= 600 |
102 | # elif __linux || defined d_ino || _XOPEN_SOURCE >= 600 |
| 88 | # define D_INO(de) (de)->d_ino |
103 | # define D_INO(de) (de)->d_ino |
| 89 | # endif |
104 | # endif |
|
|
105 | |
|
|
106 | #ifdef _D_EXACT_NAMLEN |
|
|
107 | # undef D_NAMLEN |
|
|
108 | # define D_NAMLEN(de) _D_EXACT_NAMLEN (de) |
|
|
109 | #endif |
| 90 | |
110 | |
| 91 | # ifdef _DIRENT_HAVE_D_TYPE |
111 | # ifdef _DIRENT_HAVE_D_TYPE |
| 92 | # define D_TYPE(de) (de)->d_type |
112 | # define D_TYPE(de) (de)->d_type |
| 93 | # endif |
113 | # endif |
| 94 | |
114 | |
| … | |
… | |
| 99 | #endif |
119 | #endif |
| 100 | |
120 | |
| 101 | #if HAVE_SENDFILE |
121 | #if HAVE_SENDFILE |
| 102 | # if __linux |
122 | # if __linux |
| 103 | # include <sys/sendfile.h> |
123 | # include <sys/sendfile.h> |
| 104 | # elif __freebsd |
124 | # elif __FreeBSD__ || defined __APPLE__ |
| 105 | # include <sys/socket.h> |
125 | # include <sys/socket.h> |
| 106 | # include <sys/uio.h> |
126 | # include <sys/uio.h> |
| 107 | # elif __hpux |
127 | # elif __hpux |
| 108 | # include <sys/socket.h> |
128 | # include <sys/socket.h> |
| 109 | # elif __solaris /* not yet */ |
129 | # elif __solaris |
| 110 | # include <sys/sendfile.h> |
130 | # include <sys/sendfile.h> |
| 111 | # else |
131 | # else |
| 112 | # error sendfile support requested but not available |
132 | # error sendfile support requested but not available |
| 113 | # endif |
133 | # endif |
| 114 | #endif |
134 | #endif |
| 115 | |
135 | |
| 116 | #ifndef D_TYPE |
136 | #ifndef D_TYPE |
| 117 | # define D_TYPE(de) 0 |
137 | # define D_TYPE(de) 0 |
| 118 | #endif |
138 | #endif |
| 119 | |
|
|
| 120 | #ifndef D_INO |
139 | #ifndef D_INO |
| 121 | # define D_INO(de) 0 |
140 | # define D_INO(de) 0 |
| 122 | #endif |
141 | #endif |
| 123 | |
142 | #ifndef D_NAMLEN |
| 124 | /* number of seconds after which an idle threads exit */ |
143 | # define D_NAMLEN(de) strlen ((de)->d_name) |
| 125 | #define IDLE_TIMEOUT 10 |
144 | #endif |
| 126 | |
145 | |
| 127 | /* used for struct dirent, AIX doesn't provide it */ |
146 | /* used for struct dirent, AIX doesn't provide it */ |
| 128 | #ifndef NAME_MAX |
147 | #ifndef NAME_MAX |
| 129 | # 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 |
| 130 | #endif |
154 | #endif |
| 131 | |
155 | |
| 132 | /* buffer size for various temporary buffers */ |
156 | /* buffer size for various temporary buffers */ |
| 133 | #define EIO_BUFSIZE 65536 |
157 | #define EIO_BUFSIZE 65536 |
| 134 | |
158 | |
| … | |
… | |
| 178 | if (wrk->dirp) \ |
202 | if (wrk->dirp) \ |
| 179 | { \ |
203 | { \ |
| 180 | closedir (wrk->dirp); \ |
204 | closedir (wrk->dirp); \ |
| 181 | wrk->dirp = 0; \ |
205 | wrk->dirp = 0; \ |
| 182 | } |
206 | } |
|
|
207 | |
| 183 | #define ETP_WORKER_COMMON \ |
208 | #define ETP_WORKER_COMMON \ |
| 184 | void *dbuf; \ |
209 | void *dbuf; \ |
| 185 | DIR *dirp; |
210 | DIR *dirp; |
| 186 | |
211 | |
| 187 | /*****************************************************************************/ |
212 | /*****************************************************************************/ |
| 188 | |
213 | |
| 189 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
214 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
| 190 | |
215 | |
| 191 | /* calculcate time difference in ~1/EIO_TICKS of a second */ |
216 | /* calculate time difference in ~1/EIO_TICKS of a second */ |
| 192 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
217 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
| 193 | { |
218 | { |
| 194 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
219 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
| 195 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
220 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
| 196 | } |
221 | } |
| … | |
… | |
| 204 | static unsigned int max_poll_reqs; /* reslock */ |
229 | static unsigned int max_poll_reqs; /* reslock */ |
| 205 | |
230 | |
| 206 | static volatile unsigned int nreqs; /* reqlock */ |
231 | static volatile unsigned int nreqs; /* reqlock */ |
| 207 | static volatile unsigned int nready; /* reqlock */ |
232 | static volatile unsigned int nready; /* reqlock */ |
| 208 | static volatile unsigned int npending; /* reqlock */ |
233 | static volatile unsigned int npending; /* reqlock */ |
| 209 | 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 */ |
| 210 | |
236 | |
| 211 | static mutex_t wrklock = X_MUTEX_INIT; |
237 | static xmutex_t wrklock; |
| 212 | static mutex_t reslock = X_MUTEX_INIT; |
238 | static xmutex_t reslock; |
| 213 | static mutex_t reqlock = X_MUTEX_INIT; |
239 | static xmutex_t reqlock; |
| 214 | static cond_t reqwait = X_COND_INIT; |
240 | static xcond_t reqwait; |
| 215 | |
241 | |
| 216 | #if !HAVE_PREADWRITE |
242 | #if !HAVE_PREADWRITE |
| 217 | /* |
243 | /* |
| 218 | * make our pread/pwrite emulation safe against themselves, but not against |
244 | * make our pread/pwrite emulation safe against themselves, but not against |
| 219 | * 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, |
| 220 | * but that's your problem, not mine. |
246 | * but that's your problem, not mine. |
| 221 | */ |
247 | */ |
| 222 | static mutex_t preadwritelock = X_MUTEX_INIT; |
248 | static xmutex_t preadwritelock = X_MUTEX_INIT; |
| 223 | #endif |
249 | #endif |
| 224 | |
250 | |
| 225 | typedef struct etp_worker |
251 | typedef struct etp_worker |
| 226 | { |
252 | { |
| 227 | /* locked by wrklock */ |
253 | /* locked by wrklock */ |
| 228 | struct etp_worker *prev, *next; |
254 | struct etp_worker *prev, *next; |
| 229 | |
255 | |
| 230 | thread_t tid; |
256 | xthread_t tid; |
| 231 | |
257 | |
| 232 | /* locked by reslock, reqlock or wrklock */ |
258 | /* locked by reslock, reqlock or wrklock */ |
| 233 | ETP_REQ *req; /* currently processed request */ |
259 | ETP_REQ *req; /* currently processed request */ |
| 234 | |
260 | |
| 235 | ETP_WORKER_COMMON |
261 | ETP_WORKER_COMMON |
| … | |
… | |
| 349 | } |
375 | } |
| 350 | |
376 | |
| 351 | abort (); |
377 | abort (); |
| 352 | } |
378 | } |
| 353 | |
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 | |
| 354 | static void etp_atfork_prepare (void) |
388 | static void etp_atfork_prepare (void) |
| 355 | { |
389 | { |
| 356 | X_LOCK (wrklock); |
390 | X_LOCK (wrklock); |
| 357 | X_LOCK (reqlock); |
391 | X_LOCK (reqlock); |
| 358 | X_LOCK (reslock); |
392 | X_LOCK (reslock); |
| … | |
… | |
| 396 | idle = 0; |
430 | idle = 0; |
| 397 | nreqs = 0; |
431 | nreqs = 0; |
| 398 | nready = 0; |
432 | nready = 0; |
| 399 | npending = 0; |
433 | npending = 0; |
| 400 | |
434 | |
| 401 | etp_atfork_parent (); |
435 | etp_thread_init (); |
| 402 | } |
436 | } |
| 403 | |
437 | |
| 404 | static void |
438 | static void |
| 405 | etp_once_init (void) |
439 | etp_once_init (void) |
| 406 | { |
440 | { |
|
|
441 | etp_thread_init (); |
| 407 | 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); |
| 408 | } |
443 | } |
| 409 | |
444 | |
| 410 | static int |
445 | static int |
| 411 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
446 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
| … | |
… | |
| 588 | } |
623 | } |
| 589 | |
624 | |
| 590 | static void etp_set_max_poll_time (double nseconds) |
625 | static void etp_set_max_poll_time (double nseconds) |
| 591 | { |
626 | { |
| 592 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
627 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
| 593 | max_poll_time = nseconds; |
628 | max_poll_time = nseconds * EIO_TICKS; |
| 594 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
629 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
| 595 | } |
630 | } |
| 596 | |
631 | |
| 597 | static void etp_set_max_poll_reqs (unsigned int maxreqs) |
632 | static void etp_set_max_poll_reqs (unsigned int maxreqs) |
| 598 | { |
633 | { |
| … | |
… | |
| 602 | } |
637 | } |
| 603 | |
638 | |
| 604 | static void etp_set_max_idle (unsigned int nthreads) |
639 | static void etp_set_max_idle (unsigned int nthreads) |
| 605 | { |
640 | { |
| 606 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
641 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
| 607 | 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; |
| 608 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
650 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
| 609 | } |
651 | } |
| 610 | |
652 | |
| 611 | static void etp_set_min_parallel (unsigned int nthreads) |
653 | static void etp_set_min_parallel (unsigned int nthreads) |
| 612 | { |
654 | { |
| … | |
… | |
| 740 | void eio_set_max_idle (unsigned int nthreads) |
782 | void eio_set_max_idle (unsigned int nthreads) |
| 741 | { |
783 | { |
| 742 | etp_set_max_idle (nthreads); |
784 | etp_set_max_idle (nthreads); |
| 743 | } |
785 | } |
| 744 | |
786 | |
|
|
787 | void eio_set_idle_timeout (unsigned int seconds) |
|
|
788 | { |
|
|
789 | etp_set_idle_timeout (seconds); |
|
|
790 | } |
|
|
791 | |
| 745 | void eio_set_min_parallel (unsigned int nthreads) |
792 | void eio_set_min_parallel (unsigned int nthreads) |
| 746 | { |
793 | { |
| 747 | etp_set_min_parallel (nthreads); |
794 | etp_set_min_parallel (nthreads); |
| 748 | } |
795 | } |
| 749 | |
796 | |
| … | |
… | |
| 797 | |
844 | |
| 798 | return res; |
845 | return res; |
| 799 | } |
846 | } |
| 800 | #endif |
847 | #endif |
| 801 | |
848 | |
| 802 | #ifndef HAVE_FUTIMES |
849 | #ifndef HAVE_UTIMES |
| 803 | |
850 | |
| 804 | # undef utimes |
851 | # undef utimes |
| 805 | # undef futimes |
|
|
| 806 | # define utimes(path,times) eio__utimes (path, times) |
852 | # define utimes(path,times) eio__utimes (path, times) |
| 807 | # define futimes(fd,times) eio__futimes (fd, times) |
|
|
| 808 | |
853 | |
| 809 | static int |
854 | static int |
| 810 | eio__utimes (const char *filename, const struct timeval times[2]) |
855 | eio__utimes (const char *filename, const struct timeval times[2]) |
| 811 | { |
856 | { |
| 812 | if (times) |
857 | if (times) |
| … | |
… | |
| 819 | return utime (filename, &buf); |
864 | return utime (filename, &buf); |
| 820 | } |
865 | } |
| 821 | else |
866 | else |
| 822 | return utime (filename, 0); |
867 | return utime (filename, 0); |
| 823 | } |
868 | } |
|
|
869 | |
|
|
870 | #endif |
|
|
871 | |
|
|
872 | #ifndef HAVE_FUTIMES |
|
|
873 | |
|
|
874 | # undef futimes |
|
|
875 | # define futimes(fd,times) eio__futimes (fd, times) |
| 824 | |
876 | |
| 825 | static int eio__futimes (int fd, const struct timeval tv[2]) |
877 | static int eio__futimes (int fd, const struct timeval tv[2]) |
| 826 | { |
878 | { |
| 827 | errno = ENOSYS; |
879 | errno = ENOSYS; |
| 828 | return -1; |
880 | return -1; |
| … | |
… | |
| 857 | if (!res || errno != ENOSYS) |
909 | if (!res || errno != ENOSYS) |
| 858 | return res; |
910 | return res; |
| 859 | #endif |
911 | #endif |
| 860 | |
912 | |
| 861 | /* even though we could play tricks with the flags, it's better to always |
913 | /* even though we could play tricks with the flags, it's better to always |
| 862 | * call fdatasync, as thta matches the expectation of it's users best */ |
914 | * call fdatasync, as that matches the expectation of its users best */ |
| 863 | return fdatasync (fd); |
915 | return fdatasync (fd); |
| 864 | } |
916 | } |
| 865 | |
917 | |
| 866 | #if !HAVE_READAHEAD |
918 | #if !HAVE_READAHEAD |
| 867 | # undef readahead |
919 | # undef readahead |
| … | |
… | |
| 899 | |
951 | |
| 900 | #if HAVE_SENDFILE |
952 | #if HAVE_SENDFILE |
| 901 | # if __linux |
953 | # if __linux |
| 902 | res = sendfile (ofd, ifd, &offset, count); |
954 | res = sendfile (ofd, ifd, &offset, count); |
| 903 | |
955 | |
| 904 | # elif __freebsd |
956 | # elif __FreeBSD__ |
| 905 | /* |
957 | /* |
| 906 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
958 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
| 907 | * wasted on making it similar to other I/O functions. |
959 | * wasted on making it similar to other I/O functions. |
| 908 | */ |
960 | */ |
| 909 | { |
961 | { |
| 910 | off_t sbytes; |
962 | off_t sbytes; |
| 911 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
963 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
| 912 | |
964 | |
| 913 | if (res < 0 && sbytes) |
965 | #if 0 /* according to the manpage, this is correct, but broken behaviour */ |
| 914 | /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ |
966 | /* freebsd' sendfile will return 0 on success */ |
|
|
967 | /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */ |
|
|
968 | /* not on e.g. EIO or EPIPE - sounds broken */ |
|
|
969 | if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0) |
|
|
970 | res = sbytes; |
|
|
971 | #endif |
|
|
972 | |
|
|
973 | /* according to source inspection, this is correct, and useful behaviour */ |
|
|
974 | if (sbytes) |
|
|
975 | res = sbytes; |
|
|
976 | } |
|
|
977 | |
|
|
978 | # elif defined (__APPLE__) |
|
|
979 | |
|
|
980 | { |
|
|
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) |
| 915 | res = sbytes; |
986 | res = sbytes; |
| 916 | } |
987 | } |
| 917 | |
988 | |
| 918 | # elif __hpux |
989 | # elif __hpux |
| 919 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
990 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
| … | |
… | |
| 933 | if (res < 0 && sbytes) |
1004 | if (res < 0 && sbytes) |
| 934 | res = sbytes; |
1005 | res = sbytes; |
| 935 | } |
1006 | } |
| 936 | |
1007 | |
| 937 | # endif |
1008 | # endif |
|
|
1009 | |
|
|
1010 | #elif defined (_WIN32) |
|
|
1011 | |
|
|
1012 | /* does not work, just for documentation of what would need to be done */ |
|
|
1013 | { |
|
|
1014 | HANDLE h = TO_SOCKET (ifd); |
|
|
1015 | SetFilePointer (h, offset, 0, FILE_BEGIN); |
|
|
1016 | res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0); |
|
|
1017 | } |
|
|
1018 | |
| 938 | #else |
1019 | #else |
| 939 | res = -1; |
1020 | res = -1; |
| 940 | errno = ENOSYS; |
1021 | errno = ENOSYS; |
| 941 | #endif |
1022 | #endif |
| 942 | |
1023 | |
| 943 | if (res < 0 |
1024 | if (res < 0 |
| 944 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
1025 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
|
|
1026 | /* BSDs */ |
|
|
1027 | #ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */ |
|
|
1028 | || errno == ENOTSUP |
|
|
1029 | #endif |
|
|
1030 | || errno == EOPNOTSUPP /* BSDs */ |
| 945 | #if __solaris |
1031 | #if __solaris |
| 946 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
1032 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
| 947 | #endif |
1033 | #endif |
| 948 | ) |
1034 | ) |
| 949 | ) |
1035 | ) |
| … | |
… | |
| 980 | } |
1066 | } |
| 981 | |
1067 | |
| 982 | return res; |
1068 | return res; |
| 983 | } |
1069 | } |
| 984 | |
1070 | |
| 985 | static int |
1071 | static signed char |
| 986 | eio_dent_cmp (const void *a_, const void *b_) |
1072 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
| 987 | { |
1073 | { |
| 988 | const eio_dirent *a = (const eio_dirent *)a_; |
1074 | return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */ |
| 989 | const eio_dirent *b = (const eio_dirent *)b_; |
1075 | : a->inode < b->inode ? -1 |
|
|
1076 | : a->inode > b->inode ? 1 |
|
|
1077 | : 0; |
|
|
1078 | } |
| 990 | |
1079 | |
| 991 | return (int)b->score - (int)a->score ? (int)b->score - (int)a->score |
1080 | #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0 |
| 992 | : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0; /* int might be < ino_t */ |
1081 | |
|
|
1082 | #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */ |
|
|
1083 | #define EIO_SORT_FAST 60 /* when to only use insertion sort */ |
|
|
1084 | |
|
|
1085 | static void |
|
|
1086 | eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
|
|
1087 | { |
|
|
1088 | unsigned char bits [9 + sizeof (ino_t) * 8]; |
|
|
1089 | unsigned char *bit = bits; |
|
|
1090 | |
|
|
1091 | assert (CHAR_BIT == 8); |
|
|
1092 | assert (sizeof (eio_dirent) * 8 < 256); |
|
|
1093 | assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */ |
|
|
1094 | assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */ |
|
|
1095 | |
|
|
1096 | if (size <= EIO_SORT_FAST) |
|
|
1097 | return; |
|
|
1098 | |
|
|
1099 | /* first prepare an array of bits to test in our radix sort */ |
|
|
1100 | /* try to take endianness into account, as well as differences in ino_t sizes */ |
|
|
1101 | /* inode_bits must contain all inodes ORed together */ |
|
|
1102 | /* which is used to skip bits that are 0 everywhere, which is very common */ |
|
|
1103 | { |
|
|
1104 | ino_t endianness; |
|
|
1105 | int i, j; |
|
|
1106 | |
|
|
1107 | /* we store the byte offset of byte n into byte n of "endianness" */ |
|
|
1108 | for (i = 0; i < sizeof (ino_t); ++i) |
|
|
1109 | ((unsigned char *)&endianness)[i] = i; |
|
|
1110 | |
|
|
1111 | *bit++ = 0; |
|
|
1112 | |
|
|
1113 | for (i = 0; i < sizeof (ino_t); ++i) |
|
|
1114 | { |
|
|
1115 | /* shifting off the byte offsets out of "endianness" */ |
|
|
1116 | int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8; |
|
|
1117 | endianness >>= 8; |
|
|
1118 | |
|
|
1119 | for (j = 0; j < 8; ++j) |
|
|
1120 | if (inode_bits & (((ino_t)1) << (i * 8 + j))) |
|
|
1121 | *bit++ = offs + j; |
|
|
1122 | } |
|
|
1123 | |
|
|
1124 | for (j = 0; j < 8; ++j) |
|
|
1125 | if (score_bits & (1 << j)) |
|
|
1126 | *bit++ = offsetof (eio_dirent, score) * 8 + j; |
|
|
1127 | } |
|
|
1128 | |
|
|
1129 | /* now actually do the sorting (a variant of MSD radix sort) */ |
|
|
1130 | { |
|
|
1131 | eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base; |
|
|
1132 | eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end; |
|
|
1133 | unsigned char *bit_stk [9 + sizeof (ino_t) * 8]; |
|
|
1134 | int stk_idx = 0; |
|
|
1135 | |
|
|
1136 | base_stk [stk_idx] = dents; |
|
|
1137 | end_stk [stk_idx] = dents + size; |
|
|
1138 | bit_stk [stk_idx] = bit - 1; |
|
|
1139 | |
|
|
1140 | do |
|
|
1141 | { |
|
|
1142 | base = base_stk [stk_idx]; |
|
|
1143 | end = end_stk [stk_idx]; |
|
|
1144 | bit = bit_stk [stk_idx]; |
|
|
1145 | |
|
|
1146 | for (;;) |
|
|
1147 | { |
|
|
1148 | unsigned char O = *bit >> 3; |
|
|
1149 | unsigned char M = 1 << (*bit & 7); |
|
|
1150 | |
|
|
1151 | eio_dirent *a = base; |
|
|
1152 | eio_dirent *b = end; |
|
|
1153 | |
|
|
1154 | if (b - a < EIO_SORT_CUTOFF) |
|
|
1155 | break; |
|
|
1156 | |
|
|
1157 | /* now bit-partition the array on the bit */ |
|
|
1158 | /* this ugly asymmetric loop seems to perform much better than typical */ |
|
|
1159 | /* partition algos found in the literature */ |
|
|
1160 | do |
|
|
1161 | if (!(((unsigned char *)a)[O] & M)) |
|
|
1162 | ++a; |
|
|
1163 | else if (!(((unsigned char *)--b)[O] & M)) |
|
|
1164 | { |
|
|
1165 | eio_dirent tmp = *a; *a = *b; *b = tmp; |
|
|
1166 | ++a; |
|
|
1167 | } |
|
|
1168 | while (b > a); |
|
|
1169 | |
|
|
1170 | /* next bit, or stop, if no bits left in this path */ |
|
|
1171 | if (!*--bit) |
|
|
1172 | break; |
|
|
1173 | |
|
|
1174 | base_stk [stk_idx] = a; |
|
|
1175 | end_stk [stk_idx] = end; |
|
|
1176 | bit_stk [stk_idx] = bit; |
|
|
1177 | ++stk_idx; |
|
|
1178 | |
|
|
1179 | end = a; |
|
|
1180 | } |
|
|
1181 | } |
|
|
1182 | while (stk_idx--); |
|
|
1183 | } |
|
|
1184 | } |
|
|
1185 | |
|
|
1186 | static void |
|
|
1187 | eio_dent_insertion_sort (eio_dirent *dents, int size) |
|
|
1188 | { |
|
|
1189 | /* first move the smallest element to the front, to act as a sentinel */ |
|
|
1190 | { |
|
|
1191 | int i; |
|
|
1192 | eio_dirent *min = dents; |
|
|
1193 | |
|
|
1194 | /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */ |
|
|
1195 | for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; ) |
|
|
1196 | if (EIO_DENT_CMP (dents [i], <, *min)) |
|
|
1197 | min = &dents [i]; |
|
|
1198 | |
|
|
1199 | /* swap elements 0 and j (minimum) */ |
|
|
1200 | { |
|
|
1201 | eio_dirent tmp = *dents; *dents = *min; *min = tmp; |
|
|
1202 | } |
|
|
1203 | } |
|
|
1204 | |
|
|
1205 | /* then do standard insertion sort, assuming that all elements are >= dents [0] */ |
|
|
1206 | { |
|
|
1207 | eio_dirent *i, *j; |
|
|
1208 | |
|
|
1209 | for (i = dents + 1; i < dents + size; ++i) |
|
|
1210 | { |
|
|
1211 | eio_dirent value = *i; |
|
|
1212 | |
|
|
1213 | for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j) |
|
|
1214 | j [1] = j [0]; |
|
|
1215 | |
|
|
1216 | j [1] = value; |
|
|
1217 | } |
|
|
1218 | } |
|
|
1219 | } |
|
|
1220 | |
|
|
1221 | static void |
|
|
1222 | eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
|
|
1223 | { |
|
|
1224 | if (size <= 1) |
|
|
1225 | return; /* our insertion sort relies on size > 0 */ |
|
|
1226 | |
|
|
1227 | /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */ |
|
|
1228 | /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */ |
|
|
1229 | eio_dent_radix_sort (dents, size, score_bits, inode_bits); |
|
|
1230 | |
|
|
1231 | /* use an insertion sort at the end, or for small arrays, */ |
|
|
1232 | /* as insertion sort is more efficient for small partitions */ |
|
|
1233 | eio_dent_insertion_sort (dents, size); |
| 993 | } |
1234 | } |
| 994 | |
1235 | |
| 995 | /* read a full directory */ |
1236 | /* read a full directory */ |
| 996 | static void |
1237 | static void |
| 997 | eio__scandir (eio_req *req, etp_worker *self) |
1238 | eio__scandir (eio_req *req, etp_worker *self) |
| 998 | { |
1239 | { |
| 999 | DIR *dirp; |
1240 | DIR *dirp; |
| 1000 | EIO_STRUCT_DIRENT *entp; |
1241 | EIO_STRUCT_DIRENT *entp; |
| 1001 | unsigned char *name, *names; |
1242 | char *name, *names; |
| 1002 | int namesalloc = 4096; |
1243 | int namesalloc = 4096; |
| 1003 | int namesoffs = 0; |
1244 | int namesoffs = 0; |
| 1004 | int flags = req->int1; |
1245 | int flags = req->int1; |
| 1005 | eio_dirent *dents = 0; |
1246 | eio_dirent *dents = 0; |
| 1006 | int dentalloc = 128; |
1247 | int dentalloc = 128; |
| 1007 | int dentoffs = 0; |
1248 | int dentoffs = 0; |
|
|
1249 | ino_t inode_bits = 0; |
| 1008 | |
1250 | |
| 1009 | req->result = -1; |
1251 | req->result = -1; |
| 1010 | |
1252 | |
| 1011 | if (!(flags & EIO_READDIR_DENTS)) |
1253 | if (!(flags & EIO_READDIR_DENTS)) |
| 1012 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
1254 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
| 1013 | |
1255 | |
| 1014 | X_LOCK (wrklock); |
1256 | X_LOCK (wrklock); |
| 1015 | |
|
|
| 1016 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
1257 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
| 1017 | self->dirp = dirp = opendir (req->ptr1); |
1258 | self->dirp = dirp = opendir (req->ptr1); |
|
|
1259 | |
| 1018 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1260 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
| 1019 | req->ptr1 = names = malloc (namesalloc); |
|
|
| 1020 | req->ptr2 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
1261 | req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
| 1021 | |
1262 | req->ptr2 = names = malloc (namesalloc); |
| 1022 | X_UNLOCK (wrklock); |
1263 | X_UNLOCK (wrklock); |
| 1023 | |
1264 | |
| 1024 | if (dirp && names && (!flags || dents)) |
1265 | if (dirp && names && (!flags || dents)) |
| 1025 | for (;;) |
1266 | for (;;) |
| 1026 | { |
1267 | { |
| … | |
… | |
| 1034 | |
1275 | |
| 1035 | /* sort etc. */ |
1276 | /* sort etc. */ |
| 1036 | req->int1 = flags; |
1277 | req->int1 = flags; |
| 1037 | req->result = dentoffs; |
1278 | req->result = dentoffs; |
| 1038 | |
1279 | |
| 1039 | if (flags & EIO_READDIR_STAT_ORDER || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN)) |
1280 | if (flags & EIO_READDIR_STAT_ORDER) |
|
|
1281 | eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits); |
|
|
1282 | else if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1283 | if (flags & EIO_READDIR_FOUND_UNKNOWN) |
|
|
1284 | eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */ |
|
|
1285 | else |
| 1040 | { |
1286 | { |
| 1041 | /* pray your qsort doesn't use quicksort */ |
|
|
| 1042 | qsort (dents, dentoffs, sizeof (*dents), eio_dent_cmp); /* score depends of DIRS_FIRST */ |
|
|
| 1043 | } |
|
|
| 1044 | else if (flags & EIO_READDIR_DIRS_FIRST && !(flags & EIO_READDIR_FOUND_UNKNOWN)) |
|
|
| 1045 | { |
|
|
| 1046 | /* in this case, all is known, and we just put dirs first and sort them */ |
1287 | /* in this case, all is known, and we just put dirs first and sort them */ |
| 1047 | eio_dirent *ent = dents + dentoffs; |
1288 | eio_dirent *oth = dents + dentoffs; |
| 1048 | eio_dirent *dir = dents; |
1289 | eio_dirent *dir = dents; |
| 1049 | |
1290 | |
|
|
1291 | /* now partition dirs to the front, and non-dirs to the back */ |
|
|
1292 | /* by walking from both sides and swapping if necessary */ |
| 1050 | while (ent > dir) |
1293 | while (oth > dir) |
| 1051 | { |
1294 | { |
| 1052 | if (dir->type == DT_DIR) |
1295 | if (dir->type == EIO_DT_DIR) |
| 1053 | ++dir; |
1296 | ++dir; |
| 1054 | else |
|
|
| 1055 | { |
|
|
| 1056 | --ent; |
|
|
| 1057 | |
|
|
| 1058 | if (ent->type == DT_DIR) |
1297 | else if ((--oth)->type == EIO_DT_DIR) |
| 1059 | { |
1298 | { |
| 1060 | eio_dirent tmp = *dir; |
1299 | eio_dirent tmp = *dir; *dir = *oth; *oth = tmp; |
| 1061 | *dir = *ent; |
|
|
| 1062 | *ent = tmp; |
|
|
| 1063 | |
1300 | |
| 1064 | ++dir; |
1301 | ++dir; |
| 1065 | } |
1302 | } |
| 1066 | } |
1303 | } |
|
|
1304 | |
|
|
1305 | /* now sort the dirs only (dirs all have the same score) */ |
|
|
1306 | eio_dent_sort (dents, dir - dents, 0, inode_bits); |
| 1067 | } |
1307 | } |
| 1068 | |
|
|
| 1069 | /* now sort the dirs only */ |
|
|
| 1070 | qsort (dents, dir - dents, sizeof (*dents), eio_dent_cmp); |
|
|
| 1071 | } |
|
|
| 1072 | |
|
|
| 1073 | {int i; for(i=0;i<dentoffs;++i){eio_dirent *e=dents+i; printf ("%9ld %3d %s\n", e->inode,e->score,e->name);}}//D |
|
|
| 1074 | |
1308 | |
| 1075 | break; |
1309 | break; |
| 1076 | } |
1310 | } |
| 1077 | |
1311 | |
|
|
1312 | /* now add the entry to our list(s) */ |
| 1078 | name = entp->d_name; |
1313 | name = entp->d_name; |
| 1079 | |
1314 | |
|
|
1315 | /* skip . and .. entries */ |
| 1080 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
1316 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
| 1081 | { |
1317 | { |
| 1082 | int len = strlen (name) + 1; |
1318 | int len = D_NAMLEN (entp) + 1; |
| 1083 | |
1319 | |
| 1084 | while (expect_false (namesoffs + len > namesalloc)) |
1320 | while (expect_false (namesoffs + len > namesalloc)) |
| 1085 | { |
1321 | { |
| 1086 | namesalloc *= 2; |
1322 | namesalloc *= 2; |
| 1087 | X_LOCK (wrklock); |
1323 | X_LOCK (wrklock); |
| 1088 | req->ptr1 = names = realloc (names, namesalloc); |
1324 | req->ptr2 = names = realloc (names, namesalloc); |
| 1089 | X_UNLOCK (wrklock); |
1325 | X_UNLOCK (wrklock); |
| 1090 | |
1326 | |
| 1091 | if (!names) |
1327 | if (!names) |
| 1092 | break; |
1328 | break; |
| 1093 | } |
1329 | } |
| … | |
… | |
| 1100 | |
1336 | |
| 1101 | if (expect_false (dentoffs == dentalloc)) |
1337 | if (expect_false (dentoffs == dentalloc)) |
| 1102 | { |
1338 | { |
| 1103 | dentalloc *= 2; |
1339 | dentalloc *= 2; |
| 1104 | X_LOCK (wrklock); |
1340 | X_LOCK (wrklock); |
| 1105 | req->ptr2 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
1341 | req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
| 1106 | X_UNLOCK (wrklock); |
1342 | X_UNLOCK (wrklock); |
| 1107 | |
1343 | |
| 1108 | if (!dents) |
1344 | if (!dents) |
| 1109 | break; |
1345 | break; |
| 1110 | } |
1346 | } |
| 1111 | |
1347 | |
| 1112 | ent = dents + dentoffs; |
1348 | ent = dents + dentoffs; |
| 1113 | |
1349 | |
| 1114 | ent->name = names + namesoffs; |
1350 | ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */ |
| 1115 | ent->namelen = len - 1; |
1351 | ent->namelen = len - 1; |
| 1116 | ent->inode = D_INO (entp); |
1352 | ent->inode = D_INO (entp); |
|
|
1353 | |
|
|
1354 | inode_bits |= ent->inode; |
| 1117 | |
1355 | |
| 1118 | switch (D_TYPE (entp)) |
1356 | switch (D_TYPE (entp)) |
| 1119 | { |
1357 | { |
| 1120 | default: |
1358 | default: |
| 1121 | ent->type = EIO_DT_UNKNOWN; |
1359 | ent->type = EIO_DT_UNKNOWN; |
| … | |
… | |
| 1126 | case DT_FIFO: ent->type = EIO_DT_FIFO; break; |
1364 | case DT_FIFO: ent->type = EIO_DT_FIFO; break; |
| 1127 | #endif |
1365 | #endif |
| 1128 | #ifdef DT_CHR |
1366 | #ifdef DT_CHR |
| 1129 | case DT_CHR: ent->type = EIO_DT_CHR; break; |
1367 | case DT_CHR: ent->type = EIO_DT_CHR; break; |
| 1130 | #endif |
1368 | #endif |
|
|
1369 | #ifdef DT_MPC |
|
|
1370 | case DT_MPC: ent->type = EIO_DT_MPC; break; |
|
|
1371 | #endif |
| 1131 | #ifdef DT_DIR |
1372 | #ifdef DT_DIR |
| 1132 | case DT_DIR: ent->type = EIO_DT_DIR; break; |
1373 | case DT_DIR: ent->type = EIO_DT_DIR; break; |
| 1133 | #endif |
1374 | #endif |
|
|
1375 | #ifdef DT_NAM |
|
|
1376 | case DT_NAM: ent->type = EIO_DT_NAM; break; |
|
|
1377 | #endif |
| 1134 | #ifdef DT_BLK |
1378 | #ifdef DT_BLK |
| 1135 | case DT_BLK: ent->type = EIO_DT_BLK; break; |
1379 | case DT_BLK: ent->type = EIO_DT_BLK; break; |
| 1136 | #endif |
1380 | #endif |
|
|
1381 | #ifdef DT_MPB |
|
|
1382 | case DT_MPB: ent->type = EIO_DT_MPB; break; |
|
|
1383 | #endif |
| 1137 | #ifdef DT_REG |
1384 | #ifdef DT_REG |
| 1138 | case DT_REG: ent->type = EIO_DT_REG; break; |
1385 | case DT_REG: ent->type = EIO_DT_REG; break; |
| 1139 | #endif |
1386 | #endif |
|
|
1387 | #ifdef DT_NWK |
|
|
1388 | case DT_NWK: ent->type = EIO_DT_NWK; break; |
|
|
1389 | #endif |
|
|
1390 | #ifdef DT_CMP |
|
|
1391 | case DT_CMP: ent->type = EIO_DT_CMP; break; |
|
|
1392 | #endif |
| 1140 | #ifdef DT_LNK |
1393 | #ifdef DT_LNK |
| 1141 | case DT_LNK: ent->type = EIO_DT_LNK; break; |
1394 | case DT_LNK: ent->type = EIO_DT_LNK; break; |
| 1142 | #endif |
1395 | #endif |
| 1143 | #ifdef DT_SOCK |
1396 | #ifdef DT_SOCK |
| 1144 | case DT_SOCK: ent->type = EIO_DT_SOCK; break; |
1397 | case DT_SOCK: ent->type = EIO_DT_SOCK; break; |
| 1145 | #endif |
1398 | #endif |
|
|
1399 | #ifdef DT_DOOR |
|
|
1400 | case DT_DOOR: ent->type = EIO_DT_DOOR; break; |
|
|
1401 | #endif |
| 1146 | #ifdef DT_WHT |
1402 | #ifdef DT_WHT |
| 1147 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
1403 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
| 1148 | #endif |
1404 | #endif |
| 1149 | } |
1405 | } |
| 1150 | |
1406 | |
| 1151 | ent->score = 0; |
1407 | ent->score = 7; |
| 1152 | |
1408 | |
| 1153 | if (flags & EIO_READDIR_DIRS_FIRST) |
1409 | if (flags & EIO_READDIR_DIRS_FIRST) |
| 1154 | { |
1410 | { |
| 1155 | if (ent->type == EIO_DT_UNKNOWN) |
1411 | if (ent->type == EIO_DT_UNKNOWN) |
| 1156 | { |
1412 | { |
| 1157 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
1413 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
| 1158 | ent->score = 98; |
1414 | ent->score = 1; |
| 1159 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
1415 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
| 1160 | ent->score = len <= 4 ? 5 : len <= 7 ? 4 : 1; /* shorter == more likely dir, but avoid too many classes */ |
1416 | ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */ |
| 1161 | } |
1417 | } |
| 1162 | else if (ent->type == DT_DIR) |
1418 | else if (ent->type == EIO_DT_DIR) |
| 1163 | ent->score = 100; |
1419 | ent->score = 0; |
| 1164 | } |
1420 | } |
| 1165 | } |
1421 | } |
| 1166 | |
1422 | |
| 1167 | namesoffs += len; |
1423 | namesoffs += len; |
| 1168 | ++dentoffs; |
1424 | ++dentoffs; |
| 1169 | } |
1425 | } |
|
|
1426 | |
|
|
1427 | if (EIO_CANCELLED (req)) |
|
|
1428 | { |
|
|
1429 | errno = ECANCELED; |
|
|
1430 | break; |
|
|
1431 | } |
| 1170 | } |
1432 | } |
| 1171 | else |
|
|
| 1172 | req->result = -1; |
|
|
| 1173 | |
|
|
| 1174 | /* if user doesn't want the dents, do not provide it */ |
|
|
| 1175 | if (!(flags & EIO_READDIR_DENTS)) |
|
|
| 1176 | { |
|
|
| 1177 | X_LOCK (wrklock); |
|
|
| 1178 | free (dents); |
|
|
| 1179 | req->ptr2 = req->ptr1; |
|
|
| 1180 | req->ptr1 = 0; |
|
|
| 1181 | X_UNLOCK (wrklock); |
|
|
| 1182 | } |
|
|
| 1183 | } |
1433 | } |
| 1184 | |
1434 | |
| 1185 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
|
|
| 1186 | # undef msync |
|
|
| 1187 | # define msync(a,b,c) ((errno = ENOSYS), -1) |
|
|
| 1188 | #endif |
|
|
| 1189 | |
|
|
| 1190 | int |
|
|
| 1191 | eio__mtouch (void *mem, size_t len, int flags) |
|
|
| 1192 | { |
|
|
| 1193 | intptr_t addr = (intptr_t)mem; |
|
|
| 1194 | intptr_t end = addr + len; |
|
|
| 1195 | #ifdef PAGESIZE |
1435 | #ifdef PAGESIZE |
| 1196 | const intptr_t page = PAGESIZE; |
1436 | # define eio_pagesize() PAGESIZE |
| 1197 | #else |
1437 | #else |
|
|
1438 | static intptr_t |
|
|
1439 | eio_pagesize (void) |
|
|
1440 | { |
| 1198 | static intptr_t page; |
1441 | static intptr_t page; |
| 1199 | |
1442 | |
| 1200 | if (!page) |
1443 | if (!page) |
| 1201 | page = sysconf (_SC_PAGESIZE); |
1444 | page = sysconf (_SC_PAGESIZE); |
|
|
1445 | |
|
|
1446 | return page; |
|
|
1447 | } |
|
|
1448 | #endif |
|
|
1449 | |
|
|
1450 | static void |
|
|
1451 | eio_page_align (void **addr, size_t *length) |
|
|
1452 | { |
|
|
1453 | intptr_t mask = eio_pagesize () - 1; |
|
|
1454 | |
|
|
1455 | /* round down addr */ |
|
|
1456 | intptr_t adj = mask & (intptr_t)*addr; |
|
|
1457 | |
|
|
1458 | *addr = (void *)((intptr_t)*addr - adj); |
|
|
1459 | *length += adj; |
|
|
1460 | |
|
|
1461 | /* round up length */ |
|
|
1462 | *length = (*length + mask) & ~mask; |
|
|
1463 | } |
|
|
1464 | |
|
|
1465 | #if !_POSIX_MEMLOCK |
|
|
1466 | # define eio__mlockall(a) ((errno = ENOSYS), -1) |
|
|
1467 | #else |
|
|
1468 | |
|
|
1469 | static int |
|
|
1470 | eio__mlockall (int flags) |
|
|
1471 | { |
|
|
1472 | #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7 |
|
|
1473 | extern int mallopt (int, int); |
|
|
1474 | mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */ |
| 1202 | #endif |
1475 | #endif |
| 1203 | |
1476 | |
| 1204 | addr &= ~(page - 1); /* assume page size is always a power of two */ |
1477 | if (EIO_MCL_CURRENT != MCL_CURRENT |
|
|
1478 | || EIO_MCL_FUTURE != MCL_FUTURE) |
|
|
1479 | { |
|
|
1480 | flags = 0 |
|
|
1481 | | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0) |
|
|
1482 | | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0); |
|
|
1483 | } |
| 1205 | |
1484 | |
|
|
1485 | return mlockall (flags); |
|
|
1486 | } |
|
|
1487 | #endif |
|
|
1488 | |
|
|
1489 | #if !_POSIX_MEMLOCK_RANGE |
|
|
1490 | # define eio__mlock(a,b) ((errno = ENOSYS), -1) |
|
|
1491 | #else |
|
|
1492 | |
|
|
1493 | static int |
|
|
1494 | eio__mlock (void *addr, size_t length) |
|
|
1495 | { |
|
|
1496 | eio_page_align (&addr, &length); |
|
|
1497 | |
|
|
1498 | return mlock (addr, length); |
|
|
1499 | } |
|
|
1500 | |
|
|
1501 | #endif |
|
|
1502 | |
|
|
1503 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
|
|
1504 | # define eio__msync(a,b,c) ((errno = ENOSYS), -1) |
|
|
1505 | #else |
|
|
1506 | |
|
|
1507 | int |
|
|
1508 | eio__msync (void *mem, size_t len, int flags) |
|
|
1509 | { |
|
|
1510 | eio_page_align (&mem, &len); |
|
|
1511 | |
|
|
1512 | if (EIO_MS_ASYNC != MS_SYNC |
|
|
1513 | || EIO_MS_INVALIDATE != MS_INVALIDATE |
|
|
1514 | || EIO_MS_SYNC != MS_SYNC) |
|
|
1515 | { |
|
|
1516 | flags = 0 |
|
|
1517 | | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0) |
|
|
1518 | | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0) |
|
|
1519 | | (flags & EIO_MS_SYNC ? MS_SYNC : 0); |
|
|
1520 | } |
|
|
1521 | |
|
|
1522 | return msync (mem, len, flags); |
|
|
1523 | } |
|
|
1524 | |
|
|
1525 | #endif |
|
|
1526 | |
|
|
1527 | int |
|
|
1528 | eio__mtouch (eio_req *req) |
|
|
1529 | { |
|
|
1530 | void *mem = req->ptr2; |
|
|
1531 | size_t len = req->size; |
|
|
1532 | int flags = req->int1; |
|
|
1533 | |
|
|
1534 | eio_page_align (&mem, &len); |
|
|
1535 | |
|
|
1536 | { |
|
|
1537 | intptr_t addr = (intptr_t)mem; |
|
|
1538 | intptr_t end = addr + len; |
|
|
1539 | intptr_t page = eio_pagesize (); |
|
|
1540 | |
| 1206 | if (addr < end) |
1541 | if (addr < end) |
| 1207 | if (flags) /* modify */ |
1542 | if (flags & EIO_MT_MODIFY) /* modify */ |
| 1208 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len); |
1543 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
| 1209 | else |
1544 | else |
| 1210 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len); |
1545 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
|
|
1546 | } |
| 1211 | |
1547 | |
| 1212 | return 0; |
1548 | return 0; |
| 1213 | } |
1549 | } |
| 1214 | |
1550 | |
| 1215 | /*****************************************************************************/ |
1551 | /*****************************************************************************/ |
| … | |
… | |
| 1249 | if (req) |
1585 | if (req) |
| 1250 | break; |
1586 | break; |
| 1251 | |
1587 | |
| 1252 | ++idle; |
1588 | ++idle; |
| 1253 | |
1589 | |
| 1254 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
1590 | ts.tv_sec = time (0) + idle_timeout; |
| 1255 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
1591 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
| 1256 | { |
1592 | { |
| 1257 | if (idle > max_idle) |
1593 | if (idle > max_idle) |
| 1258 | { |
1594 | { |
| 1259 | --idle; |
1595 | --idle; |
| … | |
… | |
| 1338 | return 0; \ |
1674 | return 0; \ |
| 1339 | } |
1675 | } |
| 1340 | |
1676 | |
| 1341 | static void eio_execute (etp_worker *self, eio_req *req) |
1677 | static void eio_execute (etp_worker *self, eio_req *req) |
| 1342 | { |
1678 | { |
| 1343 | errno = 0; |
|
|
| 1344 | |
|
|
| 1345 | switch (req->type) |
1679 | switch (req->type) |
| 1346 | { |
1680 | { |
| 1347 | case EIO_READ: ALLOC (req->size); |
1681 | case EIO_READ: ALLOC (req->size); |
| 1348 | req->result = req->offs >= 0 |
1682 | req->result = req->offs >= 0 |
| 1349 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
1683 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
| … | |
… | |
| 1360 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1694 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
| 1361 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1695 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
| 1362 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1696 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
| 1363 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1697 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
| 1364 | |
1698 | |
|
|
1699 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1700 | req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1701 | case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1702 | req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1703 | |
| 1365 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
1704 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
| 1366 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
1705 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
| 1367 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
1706 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
| 1368 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
1707 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
| 1369 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
1708 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
| … | |
… | |
| 1376 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
1715 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
| 1377 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
1716 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
| 1378 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
1717 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
| 1379 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
1718 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
| 1380 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
1719 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
| 1381 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break; |
1720 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
| 1382 | |
1721 | |
| 1383 | case EIO_READLINK: ALLOC (NAME_MAX); |
1722 | case EIO_READLINK: ALLOC (PATH_MAX); |
| 1384 | req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; |
1723 | req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break; |
| 1385 | |
1724 | |
| 1386 | case EIO_SYNC: req->result = 0; sync (); break; |
1725 | case EIO_SYNC: req->result = 0; sync (); break; |
| 1387 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
1726 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
| 1388 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
1727 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
| 1389 | case EIO_MSYNC: req->result = msync (req->ptr2, req->size, req->int1); break; |
1728 | case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break; |
|
|
1729 | case EIO_MTOUCH: req->result = eio__mtouch (req); break; |
| 1390 | case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break; |
1730 | case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break; |
|
|
1731 | case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break; |
| 1391 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
1732 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
| 1392 | |
1733 | |
| 1393 | case EIO_READDIR: eio__scandir (req, self); break; |
1734 | case EIO_READDIR: eio__scandir (req, self); break; |
| 1394 | |
1735 | |
| 1395 | case EIO_BUSY: |
1736 | case EIO_BUSY: |
| 1396 | #ifdef _WIN32 |
1737 | #ifdef _WIN32 |
| 1397 | Sleep (req->nv1 * 1000.); |
1738 | Sleep (req->nv1 * 1e3); |
| 1398 | #else |
1739 | #else |
| 1399 | { |
1740 | { |
| 1400 | struct timeval tv; |
1741 | struct timeval tv; |
| 1401 | |
1742 | |
| 1402 | tv.tv_sec = req->nv1; |
1743 | tv.tv_sec = req->nv1; |
| 1403 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; |
1744 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6; |
| 1404 | |
1745 | |
| 1405 | req->result = select (0, 0, 0, 0, &tv); |
1746 | req->result = select (0, 0, 0, 0, &tv); |
| 1406 | } |
1747 | } |
| 1407 | #endif |
1748 | #endif |
| 1408 | break; |
1749 | break; |
| … | |
… | |
| 1423 | times = tv; |
1764 | times = tv; |
| 1424 | } |
1765 | } |
| 1425 | else |
1766 | else |
| 1426 | times = 0; |
1767 | times = 0; |
| 1427 | |
1768 | |
| 1428 | |
|
|
| 1429 | req->result = req->type == EIO_FUTIME |
1769 | req->result = req->type == EIO_FUTIME |
| 1430 | ? futimes (req->int1, times) |
1770 | ? futimes (req->int1, times) |
| 1431 | : utimes (req->ptr1, times); |
1771 | : utimes (req->ptr1, times); |
| 1432 | } |
1772 | } |
| 1433 | break; |
1773 | break; |
| … | |
… | |
| 1438 | case EIO_NOP: |
1778 | case EIO_NOP: |
| 1439 | req->result = 0; |
1779 | req->result = 0; |
| 1440 | break; |
1780 | break; |
| 1441 | |
1781 | |
| 1442 | case EIO_CUSTOM: |
1782 | case EIO_CUSTOM: |
| 1443 | ((void (*)(eio_req *))req->feed) (req); |
1783 | req->feed (req); |
| 1444 | break; |
1784 | break; |
| 1445 | |
1785 | |
| 1446 | default: |
1786 | default: |
|
|
1787 | errno = ENOSYS; |
| 1447 | req->result = -1; |
1788 | req->result = -1; |
| 1448 | break; |
1789 | break; |
| 1449 | } |
1790 | } |
| 1450 | |
1791 | |
| 1451 | req->errorno = errno; |
1792 | req->errorno = errno; |
| … | |
… | |
| 1481 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
1822 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
| 1482 | { |
1823 | { |
| 1483 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
1824 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
| 1484 | } |
1825 | } |
| 1485 | |
1826 | |
|
|
1827 | eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data) |
|
|
1828 | { |
|
|
1829 | REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND; |
|
|
1830 | } |
|
|
1831 | |
|
|
1832 | eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data) |
|
|
1833 | { |
|
|
1834 | REQ (EIO_MLOCKALL); req->int1 = flags; SEND; |
|
|
1835 | } |
|
|
1836 | |
| 1486 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
1837 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
| 1487 | { |
1838 | { |
| 1488 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
1839 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
| 1489 | } |
1840 | } |
| 1490 | |
1841 | |
| … | |
… | |
| 1514 | } |
1865 | } |
| 1515 | |
1866 | |
| 1516 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
1867 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
| 1517 | { |
1868 | { |
| 1518 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
1869 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
|
|
1870 | } |
|
|
1871 | |
|
|
1872 | eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data) |
|
|
1873 | { |
|
|
1874 | REQ (EIO_FSTATVFS); req->int1 = fd; SEND; |
| 1519 | } |
1875 | } |
| 1520 | |
1876 | |
| 1521 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
1877 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
| 1522 | { |
1878 | { |
| 1523 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
1879 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
| … | |
… | |
| 1597 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
1953 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
| 1598 | { |
1954 | { |
| 1599 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
1955 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
| 1600 | } |
1956 | } |
| 1601 | |
1957 | |
|
|
1958 | eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data) |
|
|
1959 | { |
|
|
1960 | return eio__1path (EIO_STATVFS, path, pri, cb, data); |
|
|
1961 | } |
|
|
1962 | |
| 1602 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
1963 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
| 1603 | { |
1964 | { |
| 1604 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
1965 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
| 1605 | } |
1966 | } |
| 1606 | |
1967 | |
| … | |
… | |
| 1614 | REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; |
1975 | REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; |
| 1615 | } |
1976 | } |
| 1616 | |
1977 | |
| 1617 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
1978 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
| 1618 | { |
1979 | { |
| 1619 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND; |
1980 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND; |
| 1620 | } |
1981 | } |
| 1621 | |
1982 | |
| 1622 | static eio_req * |
1983 | static eio_req * |
| 1623 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1984 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
| 1624 | { |
1985 | { |
| … | |
… | |
| 1648 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
2009 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
| 1649 | { |
2010 | { |
| 1650 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
2011 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
| 1651 | } |
2012 | } |
| 1652 | |
2013 | |
| 1653 | eio_req *eio_custom (eio_cb execute, int pri, eio_cb cb, void *data) |
2014 | eio_req *eio_custom (void (*)(eio_req *) execute, int pri, eio_cb cb, void *data); |
| 1654 | { |
2015 | { |
| 1655 | REQ (EIO_CUSTOM); req->feed = (void (*)(eio_req *))execute; SEND; |
2016 | REQ (EIO_CUSTOM); req->feed = execute; SEND; |
| 1656 | } |
2017 | } |
| 1657 | |
2018 | |
| 1658 | #endif |
2019 | #endif |
| 1659 | |
2020 | |
| 1660 | eio_req *eio_grp (eio_cb cb, void *data) |
2021 | eio_req *eio_grp (eio_cb cb, void *data) |
| … | |
… | |
| 1708 | /* misc garbage */ |
2069 | /* misc garbage */ |
| 1709 | |
2070 | |
| 1710 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
2071 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
| 1711 | { |
2072 | { |
| 1712 | etp_worker wrk; |
2073 | etp_worker wrk; |
|
|
2074 | ssize_t ret; |
| 1713 | |
2075 | |
| 1714 | wrk.dbuf = 0; |
2076 | wrk.dbuf = 0; |
| 1715 | |
2077 | |
| 1716 | eio__sendfile (ofd, ifd, offset, count, &wrk); |
2078 | ret = eio__sendfile (ofd, ifd, offset, count, &wrk); |
| 1717 | |
2079 | |
| 1718 | if (wrk.dbuf) |
2080 | if (wrk.dbuf) |
| 1719 | free (wrk.dbuf); |
2081 | free (wrk.dbuf); |
| 1720 | } |
|
|
| 1721 | |
2082 | |
|
|
2083 | return ret; |
|
|
2084 | } |
|
|
2085 | |
