|
|
1 | /* |
|
|
2 | * libeio implementation |
|
|
3 | * |
|
|
4 | * Copyright (c) 2007,2008,2009,2010,2011,2012,2013,2016 Marc Alexander Lehmann <libeio@schmorp.de> |
|
|
5 | * All rights reserved. |
|
|
6 | * |
|
|
7 | * Redistribution and use in source and binary forms, with or without modifica- |
|
|
8 | * tion, are permitted provided that the following conditions are met: |
|
|
9 | * |
|
|
10 | * 1. Redistributions of source code must retain the above copyright notice, |
|
|
11 | * this list of conditions and the following disclaimer. |
|
|
12 | * |
|
|
13 | * 2. Redistributions in binary form must reproduce the above copyright |
|
|
14 | * notice, this list of conditions and the following disclaimer in the |
|
|
15 | * documentation and/or other materials provided with the distribution. |
|
|
16 | * |
|
|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
|
|
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
|
|
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
|
|
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
|
|
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
|
|
22 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
|
|
23 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
|
|
24 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- |
|
|
25 | * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
|
|
26 | * OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
27 | * |
|
|
28 | * Alternatively, the contents of this file may be used under the terms of |
|
|
29 | * the GNU General Public License ("GPL") version 2 or any later version, |
|
|
30 | * in which case the provisions of the GPL are applicable instead of |
|
|
31 | * the above. If you wish to allow the use of your version of this file |
|
|
32 | * only under the terms of the GPL and not to allow others to use your |
|
|
33 | * version of this file under the BSD license, indicate your decision |
|
|
34 | * by deleting the provisions above and replace them with the notice |
|
|
35 | * and other provisions required by the GPL. If you do not delete the |
|
|
36 | * provisions above, a recipient may use your version of this file under |
|
|
37 | * either the BSD or the GPL. |
|
|
38 | */ |
|
|
39 | |
|
|
40 | #ifndef _WIN32 |
|
|
41 | # include "config.h" |
|
|
42 | #endif |
|
|
43 | |
1 | #include "eio.h" |
44 | #include "eio.h" |
2 | #include "xthread.h" |
45 | #include "ecb.h" |
3 | |
46 | |
4 | #include <errno.h> |
47 | #include <errno.h> |
5 | #include <stddef.h> |
48 | #include <stddef.h> |
6 | #include <stdlib.h> |
49 | #include <stdlib.h> |
7 | #include <string.h> |
50 | #include <string.h> |
8 | #include <errno.h> |
51 | #include <errno.h> |
9 | #include <sys/types.h> |
52 | #include <sys/types.h> |
10 | #include <sys/stat.h> |
53 | #include <sys/stat.h> |
11 | #include <limits.h> |
54 | #include <limits.h> |
12 | #include <fcntl.h> |
55 | #include <fcntl.h> |
13 | #include <sched.h> |
56 | #include <assert.h> |
|
|
57 | |
|
|
58 | /* intptr_t comes from unistd.h, says POSIX/UNIX/tradition */ |
|
|
59 | /* intptr_t only comes from stdint.h, says idiot openbsd coder */ |
|
|
60 | #if HAVE_STDINT_H |
14 | #include <dirent.h> |
61 | # include <stdint.h> |
|
|
62 | #endif |
|
|
63 | |
|
|
64 | #ifndef ECANCELED |
|
|
65 | # define ECANCELED EDOM |
|
|
66 | #endif |
|
|
67 | #ifndef ELOOP |
|
|
68 | # define ELOOP EDOM |
|
|
69 | #endif |
|
|
70 | |
|
|
71 | #if !defined(ENOTSOCK) && defined(WSAENOTSOCK) |
|
|
72 | # define ENOTSOCK WSAENOTSOCK |
|
|
73 | #endif |
|
|
74 | |
|
|
75 | static void eio_destroy (eio_req *req); |
15 | |
76 | |
16 | #ifndef EIO_FINISH |
77 | #ifndef EIO_FINISH |
17 | # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 |
78 | # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 |
18 | #endif |
79 | #endif |
19 | |
80 | |
… | |
… | |
23 | |
84 | |
24 | #ifndef EIO_FEED |
85 | #ifndef EIO_FEED |
25 | # define EIO_FEED(req) do { if ((req)->feed ) (req)->feed (req); } while (0) |
86 | # define EIO_FEED(req) do { if ((req)->feed ) (req)->feed (req); } while (0) |
26 | #endif |
87 | #endif |
27 | |
88 | |
|
|
89 | #ifndef EIO_FD_TO_WIN32_HANDLE |
|
|
90 | # define EIO_FD_TO_WIN32_HANDLE(fd) _get_osfhandle (fd) |
|
|
91 | #endif |
|
|
92 | #ifndef EIO_WIN32_HANDLE_TO_FD |
|
|
93 | # define EIO_WIN32_HANDLE_TO_FD(handle) _open_osfhandle (handle, 0) |
|
|
94 | #endif |
|
|
95 | |
|
|
96 | #define EIO_ERRNO(errval,retval) ((errno = errval), retval) |
|
|
97 | |
|
|
98 | #define EIO_ENOSYS() EIO_ERRNO (ENOSYS, -1) |
|
|
99 | |
28 | #ifdef _WIN32 |
100 | #ifdef _WIN32 |
29 | |
101 | |
30 | /*doh*/ |
102 | #undef PAGESIZE |
|
|
103 | #define PAGESIZE 4096 /* GetSystemInfo? */ |
|
|
104 | |
|
|
105 | /* TODO: look at how perl does stat (non-sloppy), unlink (ro-files), utime, link */ |
|
|
106 | |
|
|
107 | #ifdef EIO_STRUCT_STATI64 |
|
|
108 | /* look at perl's non-sloppy stat */ |
|
|
109 | #define stat(path,buf) _stati64 (path,buf) |
|
|
110 | #define fstat(fd,buf) _fstati64 (fd,buf) |
|
|
111 | #endif |
|
|
112 | #define lstat(path,buf) stat (path,buf) |
|
|
113 | #define fsync(fd) (FlushFileBuffers ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd)) ? 0 : EIO_ERRNO (EBADF, -1)) |
|
|
114 | #define mkdir(path,mode) _mkdir (path) |
|
|
115 | #define link(old,neu) (CreateHardLink (neu, old, 0) ? 0 : EIO_ERRNO (ENOENT, -1)) |
|
|
116 | |
|
|
117 | #define chmod(path,mode) _chmod (path, mode) |
|
|
118 | #define dup(fd) _dup (fd) |
|
|
119 | #define dup2(fd1,fd2) _dup2 (fd1, fd2) |
|
|
120 | #define pipe(fds) _pipe (fds, 4096, O_BINARY) |
|
|
121 | |
|
|
122 | #define fcntl(fd,cmd,arg) EIO_ENOSYS () |
|
|
123 | #define ioctl(fd,cmd,arg) EIO_ENOSYS () |
|
|
124 | #define fchmod(fd,mode) EIO_ENOSYS () |
|
|
125 | #define chown(path,uid,gid) EIO_ENOSYS () |
|
|
126 | #define fchown(fd,uid,gid) EIO_ENOSYS () |
|
|
127 | #define truncate(path,offs) EIO_ENOSYS () /* far-miss: SetEndOfFile */ |
|
|
128 | #define ftruncate(fd,offs) EIO_ENOSYS () /* near-miss: SetEndOfFile */ |
|
|
129 | #define mknod(path,mode,dev) EIO_ENOSYS () |
|
|
130 | #define sync() EIO_ENOSYS () |
|
|
131 | #define readlink(path,buf,s) EIO_ENOSYS () |
|
|
132 | #define statvfs(path,buf) EIO_ENOSYS () |
|
|
133 | #define fstatvfs(fd,buf) EIO_ENOSYS () |
|
|
134 | |
|
|
135 | #define pread(fd,buf,count,offset) eio__pread (fd, buf, count, offset) |
|
|
136 | #define pwrite(fd,buf,count,offset) eio__pwrite (fd, buf, count, offset) |
|
|
137 | |
|
|
138 | #if __GNUC__ |
|
|
139 | typedef long long eio_off_t; /* signed for compatibility to msvc */ |
|
|
140 | #else |
|
|
141 | typedef __int64 eio_off_t; /* unsigned not supported by msvc */ |
|
|
142 | #endif |
|
|
143 | |
|
|
144 | static eio_ssize_t |
|
|
145 | eio__pread (int fd, void *buf, eio_ssize_t count, eio_off_t offset) |
|
|
146 | { |
|
|
147 | OVERLAPPED o = { 0 }; |
|
|
148 | DWORD got; |
|
|
149 | |
|
|
150 | o.Offset = offset; |
|
|
151 | o.OffsetHigh = offset >> 32; |
|
|
152 | |
|
|
153 | return ReadFile ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd), buf, count, &got, &o) |
|
|
154 | ? got : -1; |
|
|
155 | } |
|
|
156 | |
|
|
157 | static eio_ssize_t |
|
|
158 | eio__pwrite (int fd, void *buf, eio_ssize_t count, eio_off_t offset) |
|
|
159 | { |
|
|
160 | OVERLAPPED o = { 0 }; |
|
|
161 | DWORD got; |
|
|
162 | |
|
|
163 | o.Offset = offset; |
|
|
164 | o.OffsetHigh = offset >> 32; |
|
|
165 | |
|
|
166 | return WriteFile ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd), buf, count, &got, &o) |
|
|
167 | ? got : -1; |
|
|
168 | } |
|
|
169 | |
|
|
170 | /* rename() uses MoveFile, which fails to overwrite */ |
|
|
171 | #define rename(old,neu) eio__rename (old, neu) |
|
|
172 | |
|
|
173 | static int |
|
|
174 | eio__rename (const char *old, const char *neu) |
|
|
175 | { |
|
|
176 | if (MoveFileEx (old, neu, MOVEFILE_REPLACE_EXISTING)) |
|
|
177 | return 0; |
|
|
178 | |
|
|
179 | /* should steal _dosmaperr */ |
|
|
180 | switch (GetLastError ()) |
|
|
181 | { |
|
|
182 | case ERROR_FILE_NOT_FOUND: |
|
|
183 | case ERROR_PATH_NOT_FOUND: |
|
|
184 | case ERROR_INVALID_DRIVE: |
|
|
185 | case ERROR_NO_MORE_FILES: |
|
|
186 | case ERROR_BAD_NETPATH: |
|
|
187 | case ERROR_BAD_NET_NAME: |
|
|
188 | case ERROR_BAD_PATHNAME: |
|
|
189 | case ERROR_FILENAME_EXCED_RANGE: |
|
|
190 | errno = ENOENT; |
|
|
191 | break; |
|
|
192 | |
|
|
193 | default: |
|
|
194 | errno = EACCES; |
|
|
195 | break; |
|
|
196 | } |
|
|
197 | |
|
|
198 | return -1; |
|
|
199 | } |
|
|
200 | |
|
|
201 | /* we could even stat and see if it exists */ |
|
|
202 | static int |
|
|
203 | symlink (const char *old, const char *neu) |
|
|
204 | { |
|
|
205 | #if WINVER >= 0x0600 |
|
|
206 | int flags; |
|
|
207 | |
|
|
208 | /* This tries out all combinations of SYMBOLIC_LINK_FLAG_DIRECTORY |
|
|
209 | * and SYMBOLIC_LINK_FLAG_ALLOW_UNPRIVILEGED_CREATE, |
|
|
210 | * with directory first. |
|
|
211 | */ |
|
|
212 | for (flags = 3; flags >= 0; --flags) |
|
|
213 | if (CreateSymbolicLink (neu, old, flags)) |
|
|
214 | return 0; |
|
|
215 | #endif |
|
|
216 | |
|
|
217 | return EIO_ERRNO (ENOENT, -1); |
|
|
218 | } |
|
|
219 | |
|
|
220 | /* POSIX API only, causing trouble for win32 apps */ |
|
|
221 | #define CreateHardLink(neu,old,flags) 0 /* not really creating hardlink, still using relative paths? */ |
|
|
222 | #define CreateSymbolicLink(neu,old,flags) 0 /* vista+ only */ |
|
|
223 | |
|
|
224 | struct statvfs |
|
|
225 | { |
|
|
226 | int dummy; |
|
|
227 | }; |
|
|
228 | |
|
|
229 | #define DT_DIR EIO_DT_DIR |
|
|
230 | #define DT_REG EIO_DT_REG |
|
|
231 | #define D_NAME(entp) entp.cFileName |
|
|
232 | #define D_TYPE(entp) (entp.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY ? DT_DIR : DT_REG) |
31 | |
233 | |
32 | #else |
234 | #else |
33 | |
235 | |
34 | # include "config.h" |
|
|
35 | # include <sys/time.h> |
236 | #include <sys/time.h> |
36 | # include <sys/select.h> |
237 | #include <sys/select.h> |
37 | # include <unistd.h> |
238 | #include <unistd.h> |
|
|
239 | #include <signal.h> |
|
|
240 | #include <dirent.h> |
|
|
241 | |
|
|
242 | #ifdef ANDROID |
|
|
243 | #include <sys/vfs.h> |
|
|
244 | #define statvfs statfs |
|
|
245 | #define fstatvfs fstatfs |
|
|
246 | #include <asm/page.h> /* supposedly limits.h does #define PAGESIZE PAGESIZE */ |
|
|
247 | #else |
|
|
248 | #include <sys/statvfs.h> |
|
|
249 | #endif |
|
|
250 | |
|
|
251 | #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES |
|
|
252 | #include <sys/mman.h> |
|
|
253 | #endif |
|
|
254 | |
|
|
255 | #define D_NAME(entp) entp->d_name |
|
|
256 | |
|
|
257 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
|
|
258 | #if __FreeBSD__ || __NetBSD__ || __OpenBSD__ |
|
|
259 | #define _DIRENT_HAVE_D_TYPE /* sigh */ |
|
|
260 | #define D_INO(de) (de)->d_fileno |
|
|
261 | #define D_NAMLEN(de) (de)->d_namlen |
|
|
262 | #elif __linux || defined d_ino || _XOPEN_SOURCE >= 600 |
|
|
263 | #define D_INO(de) (de)->d_ino |
|
|
264 | #endif |
|
|
265 | |
|
|
266 | #ifdef _D_EXACT_NAMLEN |
|
|
267 | #undef D_NAMLEN |
|
|
268 | #define D_NAMLEN(de) _D_EXACT_NAMLEN (de) |
|
|
269 | #endif |
|
|
270 | |
|
|
271 | #ifdef _DIRENT_HAVE_D_TYPE |
|
|
272 | #define D_TYPE(de) (de)->d_type |
|
|
273 | #endif |
|
|
274 | |
|
|
275 | #ifndef EIO_STRUCT_DIRENT |
|
|
276 | #define EIO_STRUCT_DIRENT struct dirent |
|
|
277 | #endif |
|
|
278 | |
|
|
279 | #endif |
|
|
280 | |
|
|
281 | #if HAVE_UTIMES |
38 | # include <utime.h> |
282 | # include <utime.h> |
39 | # include <signal.h> |
|
|
40 | |
|
|
41 | # ifndef EIO_STRUCT_DIRENT |
|
|
42 | # define EIO_STRUCT_DIRENT struct dirent |
|
|
43 | # endif |
283 | #endif |
44 | |
284 | |
45 | #endif |
285 | #if HAVE_SYS_SYSCALL_H |
46 | |
286 | # include <sys/syscall.h> |
47 | # ifndef EIO_STRUCT_STAT |
|
|
48 | # define EIO_STRUCT_STAT struct stat |
|
|
49 | # endif |
287 | #endif |
50 | |
288 | |
51 | #if HAVE_SENDFILE |
289 | #if HAVE_SENDFILE |
52 | # if __linux |
290 | # if __linux |
53 | # include <sys/sendfile.h> |
291 | # include <sys/sendfile.h> |
54 | # elif __freebsd |
292 | # elif __FreeBSD__ || defined __APPLE__ |
55 | # include <sys/socket.h> |
293 | # include <sys/socket.h> |
56 | # include <sys/uio.h> |
294 | # include <sys/uio.h> |
57 | # elif __hpux |
295 | # elif __hpux |
58 | # include <sys/socket.h> |
296 | # include <sys/socket.h> |
59 | # elif __solaris /* not yet */ |
297 | # elif __solaris |
60 | # include <sys/sendfile.h> |
298 | # include <sys/sendfile.h> |
61 | # else |
299 | # else |
62 | # error sendfile support requested but not available |
300 | # error sendfile support requested but not available |
63 | # endif |
301 | # endif |
64 | #endif |
302 | #endif |
65 | |
303 | |
66 | /* number of seconds after which an idle threads exit */ |
304 | #ifndef D_TYPE |
67 | #define IDLE_TIMEOUT 10 |
305 | # define D_TYPE(de) 0 |
|
|
306 | #endif |
|
|
307 | #ifndef D_INO |
|
|
308 | # define D_INO(de) 0 |
|
|
309 | #endif |
|
|
310 | #ifndef D_NAMLEN |
|
|
311 | # define D_NAMLEN(entp) strlen (D_NAME (entp)) |
|
|
312 | #endif |
68 | |
313 | |
69 | /* used for struct dirent, AIX doesn't provide it */ |
314 | /* used for struct dirent, AIX doesn't provide it */ |
70 | #ifndef NAME_MAX |
315 | #ifndef NAME_MAX |
71 | # define NAME_MAX 4096 |
316 | # define NAME_MAX 4096 |
72 | #endif |
317 | #endif |
73 | |
318 | |
|
|
319 | /* used for readlink etc. */ |
|
|
320 | #ifndef PATH_MAX |
|
|
321 | # define PATH_MAX 0 |
|
|
322 | #endif |
|
|
323 | |
|
|
324 | #ifndef EIO_PATH_MIN |
|
|
325 | # define EIO_PATH_MIN 8160 |
|
|
326 | #endif |
|
|
327 | |
|
|
328 | #define EIO_PATH_MAX (PATH_MAX <= EIO_PATH_MIN ? EIO_PATH_MIN : PATH_MAX) |
|
|
329 | |
74 | /* buffer size for various temporary buffers */ |
330 | /* buffer size for various temporary buffers */ |
75 | #define EIO_BUFSIZE 65536 |
331 | #define EIO_BUFSIZE 65536 |
76 | |
332 | |
77 | #define dBUF \ |
333 | #define dBUF \ |
78 | char *eio_buf; \ |
|
|
79 | X_LOCK (wrklock); \ |
|
|
80 | self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \ |
334 | char *eio_buf = malloc (EIO_BUFSIZE); \ |
81 | X_UNLOCK (wrklock); \ |
335 | errno = ENOMEM; \ |
82 | if (!eio_buf) \ |
336 | if (!eio_buf) \ |
83 | return -1; |
337 | return -1 |
84 | |
338 | |
85 | #define EIO_TICKS ((1000000 + 1023) >> 10) |
339 | #define FUBd \ |
|
|
340 | free (eio_buf) |
86 | |
341 | |
87 | static void (*want_poll_cb) (void); |
342 | /*****************************************************************************/ |
88 | static void (*done_poll_cb) (void); |
|
|
89 | |
343 | |
90 | static unsigned int max_poll_time = 0; |
344 | struct etp_tmpbuf; |
91 | static unsigned int max_poll_reqs = 0; |
|
|
92 | |
345 | |
93 | /* calculcate time difference in ~1/EIO_TICKS of a second */ |
346 | #if _POSIX_VERSION >= 200809L |
94 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
347 | #define HAVE_AT 1 |
95 | { |
348 | #define WD2FD(wd) ((wd) ? (wd)->fd : AT_FDCWD) |
96 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
349 | #ifndef O_SEARCH |
97 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
350 | #define O_SEARCH O_RDONLY |
98 | } |
351 | #endif |
|
|
352 | #else |
|
|
353 | #define HAVE_AT 0 |
|
|
354 | static const char *wd_expand (struct etp_tmpbuf *tmpbuf, eio_wd wd, const char *path); |
|
|
355 | #endif |
99 | |
356 | |
100 | static unsigned int started, idle, wanted; |
357 | struct eio_pwd |
101 | |
|
|
102 | /* worker threads management */ |
|
|
103 | static mutex_t wrklock = X_MUTEX_INIT; |
|
|
104 | |
|
|
105 | typedef struct worker { |
|
|
106 | /* locked by wrklock */ |
|
|
107 | struct worker *prev, *next; |
|
|
108 | |
|
|
109 | thread_t tid; |
|
|
110 | |
|
|
111 | /* locked by reslock, reqlock or wrklock */ |
|
|
112 | eio_req *req; /* currently processed request */ |
|
|
113 | void *dbuf; |
|
|
114 | DIR *dirp; |
|
|
115 | } worker; |
|
|
116 | |
|
|
117 | static worker wrk_first = { &wrk_first, &wrk_first, 0 }; |
|
|
118 | |
|
|
119 | static void worker_clear (worker *wrk) |
|
|
120 | { |
358 | { |
121 | if (wrk->dirp) |
359 | #if HAVE_AT |
122 | { |
360 | int fd; |
123 | closedir (wrk->dirp); |
361 | #endif |
124 | wrk->dirp = 0; |
|
|
125 | } |
|
|
126 | |
|
|
127 | if (wrk->dbuf) |
|
|
128 | { |
|
|
129 | free (wrk->dbuf); |
|
|
130 | wrk->dbuf = 0; |
|
|
131 | } |
|
|
132 | } |
|
|
133 | |
|
|
134 | static void worker_free (worker *wrk) |
|
|
135 | { |
|
|
136 | wrk->next->prev = wrk->prev; |
|
|
137 | wrk->prev->next = wrk->next; |
|
|
138 | |
|
|
139 | free (wrk); |
|
|
140 | } |
|
|
141 | |
|
|
142 | static volatile unsigned int nreqs, nready, npending; |
|
|
143 | static volatile unsigned int max_idle = 4; |
|
|
144 | |
|
|
145 | static mutex_t reslock = X_MUTEX_INIT; |
|
|
146 | static mutex_t reqlock = X_MUTEX_INIT; |
|
|
147 | static cond_t reqwait = X_COND_INIT; |
|
|
148 | |
|
|
149 | unsigned int eio_nreqs (void) |
|
|
150 | { |
|
|
151 | return nreqs; |
|
|
152 | } |
|
|
153 | |
|
|
154 | unsigned int eio_nready (void) |
|
|
155 | { |
|
|
156 | unsigned int retval; |
|
|
157 | |
|
|
158 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
159 | retval = nready; |
|
|
160 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
161 | |
|
|
162 | return retval; |
|
|
163 | } |
|
|
164 | |
|
|
165 | unsigned int eio_npending (void) |
|
|
166 | { |
|
|
167 | unsigned int retval; |
|
|
168 | |
|
|
169 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
170 | retval = npending; |
|
|
171 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
172 | |
|
|
173 | return retval; |
|
|
174 | } |
|
|
175 | |
|
|
176 | unsigned int eio_nthreads (void) |
|
|
177 | { |
|
|
178 | unsigned int retval; |
|
|
179 | |
|
|
180 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
181 | retval = started; |
|
|
182 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
183 | |
|
|
184 | return retval; |
|
|
185 | } |
|
|
186 | |
|
|
187 | /* |
|
|
188 | * a somewhat faster data structure might be nice, but |
|
|
189 | * with 8 priorities this actually needs <20 insns |
|
|
190 | * per shift, the most expensive operation. |
|
|
191 | */ |
|
|
192 | typedef struct { |
|
|
193 | eio_req *qs[EIO_NUM_PRI], *qe[EIO_NUM_PRI]; /* qstart, qend */ |
|
|
194 | int size; |
362 | int len; |
195 | } reqq; |
363 | char str[1]; /* actually, a 0-terminated canonical path */ |
|
|
364 | }; |
196 | |
365 | |
197 | static reqq req_queue; |
366 | /*****************************************************************************/ |
198 | static reqq res_queue; |
|
|
199 | |
367 | |
200 | static int reqq_push (reqq *q, eio_req *req) |
368 | #define ETP_PRI_MIN EIO_PRI_MIN |
201 | { |
369 | #define ETP_PRI_MAX EIO_PRI_MAX |
202 | int pri = req->pri; |
|
|
203 | req->next = 0; |
|
|
204 | |
370 | |
205 | if (q->qe[pri]) |
371 | #define ETP_TYPE_QUIT -1 |
206 | { |
372 | #define ETP_TYPE_GROUP EIO_GROUP |
207 | q->qe[pri]->next = req; |
|
|
208 | q->qe[pri] = req; |
|
|
209 | } |
|
|
210 | else |
|
|
211 | q->qe[pri] = q->qs[pri] = req; |
|
|
212 | |
373 | |
213 | return q->size++; |
374 | static void eio_nop_callback (void) { } |
214 | } |
375 | static void (*eio_want_poll_cb)(void) = eio_nop_callback; |
|
|
376 | static void (*eio_done_poll_cb)(void) = eio_nop_callback; |
215 | |
377 | |
216 | static eio_req *reqq_shift (reqq *q) |
378 | #define ETP_WANT_POLL(pool) eio_want_poll_cb () |
217 | { |
379 | #define ETP_DONE_POLL(pool) eio_done_poll_cb () |
218 | int pri; |
|
|
219 | |
380 | |
220 | if (!q->size) |
381 | struct etp_worker; |
221 | return 0; |
382 | #define ETP_REQ eio_req |
|
|
383 | #define ETP_DESTROY(req) eio_destroy (req) |
|
|
384 | static int eio_finish (eio_req *req); |
|
|
385 | #define ETP_FINISH(req) eio_finish (req) |
|
|
386 | static void eio_execute (struct etp_worker *self, eio_req *req); |
|
|
387 | #define ETP_EXECUTE(wrk,req) eio_execute (wrk, req) |
222 | |
388 | |
223 | --q->size; |
389 | #include "etp.c" |
224 | |
390 | |
225 | for (pri = EIO_NUM_PRI; pri--; ) |
391 | static struct etp_pool eio_pool; |
226 | { |
392 | #define EIO_POOL (&eio_pool) |
227 | eio_req *req = q->qs[pri]; |
|
|
228 | |
393 | |
229 | if (req) |
394 | /*****************************************************************************/ |
230 | { |
|
|
231 | if (!(q->qs[pri] = (eio_req *)req->next)) |
|
|
232 | q->qe[pri] = 0; |
|
|
233 | |
395 | |
234 | return req; |
396 | static void |
235 | } |
|
|
236 | } |
|
|
237 | |
|
|
238 | abort (); |
|
|
239 | } |
|
|
240 | |
|
|
241 | static void grp_try_feed (eio_req *grp) |
397 | grp_try_feed (eio_req *grp) |
242 | { |
398 | { |
243 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
399 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
244 | { |
400 | { |
245 | int old_len = grp->size; |
401 | grp->flags &= ~ETP_FLAG_GROUPADD; |
246 | |
402 | |
247 | EIO_FEED (grp); |
403 | EIO_FEED (grp); |
248 | |
404 | |
249 | /* stop if no progress has been made */ |
405 | /* stop if no progress has been made */ |
250 | if (old_len == grp->size) |
406 | if (!(grp->flags & ETP_FLAG_GROUPADD)) |
251 | { |
407 | { |
252 | grp->feed = 0; |
408 | grp->feed = 0; |
253 | break; |
409 | break; |
254 | } |
410 | } |
255 | } |
411 | } |
256 | } |
412 | } |
257 | |
413 | |
258 | static int eio_finish (eio_req *req); |
414 | static int |
259 | |
|
|
260 | static int grp_dec (eio_req *grp) |
415 | grp_dec (eio_req *grp) |
261 | { |
416 | { |
262 | --grp->size; |
417 | --grp->size; |
263 | |
418 | |
264 | /* call feeder, if applicable */ |
419 | /* call feeder, if applicable */ |
265 | grp_try_feed (grp); |
420 | grp_try_feed (grp); |
266 | |
421 | |
267 | /* finish, if done */ |
422 | /* finish, if done */ |
268 | if (!grp->size && grp->int1) |
423 | if (!grp->size && grp->flags & ETP_FLAG_DELAYED) |
269 | return eio_finish (grp); |
424 | return eio_finish (grp); |
270 | else |
425 | else |
271 | return 0; |
426 | return 0; |
272 | } |
427 | } |
273 | |
428 | |
|
|
429 | static void |
274 | void eio_destroy (eio_req *req) |
430 | eio_destroy (eio_req *req) |
275 | { |
431 | { |
|
|
432 | if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1); |
276 | if ((req)->flags & EIO_FLAG_PTR2_FREE) |
433 | if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2); |
277 | free (req->ptr2); |
|
|
278 | |
434 | |
279 | EIO_DESTROY (req); |
435 | EIO_DESTROY (req); |
280 | } |
436 | } |
281 | |
437 | |
|
|
438 | static int |
282 | static int eio_finish (eio_req *req) |
439 | eio_finish (eio_req *req) |
283 | { |
440 | { |
284 | int res = EIO_FINISH (req); |
441 | int res = EIO_FINISH (req); |
285 | |
442 | |
286 | if (req->grp) |
443 | if (req->grp) |
287 | { |
444 | { |
… | |
… | |
295 | if (grp->grp_first == req) |
452 | if (grp->grp_first == req) |
296 | grp->grp_first = req->grp_next; |
453 | grp->grp_first = req->grp_next; |
297 | |
454 | |
298 | res2 = grp_dec (grp); |
455 | res2 = grp_dec (grp); |
299 | |
456 | |
300 | if (!res && res2) |
457 | if (!res) |
301 | res = res2; |
458 | res = res2; |
302 | } |
459 | } |
303 | |
460 | |
304 | eio_destroy (req); |
461 | eio_destroy (req); |
305 | |
462 | |
306 | return res; |
463 | return res; |
307 | } |
464 | } |
308 | |
465 | |
|
|
466 | void |
309 | void eio_grp_cancel (eio_req *grp) |
467 | eio_grp_cancel (eio_req *grp) |
310 | { |
468 | { |
311 | for (grp = grp->grp_first; grp; grp = grp->grp_next) |
469 | etp_grp_cancel (EIO_POOL, grp); |
312 | eio_cancel (grp); |
|
|
313 | } |
470 | } |
314 | |
471 | |
|
|
472 | void |
315 | void eio_cancel (eio_req *req) |
473 | eio_cancel (eio_req *req) |
316 | { |
474 | { |
317 | req->flags |= EIO_FLAG_CANCELLED; |
475 | etp_cancel (EIO_POOL, req); |
318 | |
|
|
319 | eio_grp_cancel (req); |
|
|
320 | } |
476 | } |
321 | |
477 | |
322 | X_THREAD_PROC (eio_proc); |
478 | void |
323 | |
|
|
324 | static void start_thread (void) |
|
|
325 | { |
|
|
326 | worker *wrk = calloc (1, sizeof (worker)); |
|
|
327 | |
|
|
328 | if (!wrk) |
|
|
329 | croak ("unable to allocate worker thread data"); |
|
|
330 | |
|
|
331 | X_LOCK (wrklock); |
|
|
332 | |
|
|
333 | if (thread_create (&wrk->tid, eio_proc, (void *)wrk)) |
|
|
334 | { |
|
|
335 | wrk->prev = &wrk_first; |
|
|
336 | wrk->next = wrk_first.next; |
|
|
337 | wrk_first.next->prev = wrk; |
|
|
338 | wrk_first.next = wrk; |
|
|
339 | ++started; |
|
|
340 | } |
|
|
341 | else |
|
|
342 | free (wrk); |
|
|
343 | |
|
|
344 | X_UNLOCK (wrklock); |
|
|
345 | } |
|
|
346 | |
|
|
347 | static void maybe_start_thread (void) |
|
|
348 | { |
|
|
349 | if (eio_nthreads () >= wanted) |
|
|
350 | return; |
|
|
351 | |
|
|
352 | /* todo: maybe use idle here, but might be less exact */ |
|
|
353 | if (0 <= (int)eio_nthreads () + (int)eio_npending () - (int)eio_nreqs ()) |
|
|
354 | return; |
|
|
355 | |
|
|
356 | start_thread (); |
|
|
357 | } |
|
|
358 | |
|
|
359 | void eio_submit (eio_req *req) |
479 | eio_submit (eio_req *req) |
360 | { |
480 | { |
361 | ++nreqs; |
481 | etp_submit (EIO_POOL, req); |
362 | |
|
|
363 | X_LOCK (reqlock); |
|
|
364 | ++nready; |
|
|
365 | reqq_push (&req_queue, req); |
|
|
366 | X_COND_SIGNAL (reqwait); |
|
|
367 | X_UNLOCK (reqlock); |
|
|
368 | |
|
|
369 | maybe_start_thread (); |
|
|
370 | } |
482 | } |
371 | |
483 | |
372 | static void end_thread (void) |
484 | unsigned int |
|
|
485 | eio_nreqs (void) |
373 | { |
486 | { |
374 | eio_req *req = calloc (1, sizeof (eio_req)); |
487 | return etp_nreqs (EIO_POOL); |
375 | |
|
|
376 | req->type = EIO_QUIT; |
|
|
377 | req->pri = EIO_PRI_MAX + EIO_PRI_BIAS; |
|
|
378 | |
|
|
379 | X_LOCK (reqlock); |
|
|
380 | reqq_push (&req_queue, req); |
|
|
381 | X_COND_SIGNAL (reqwait); |
|
|
382 | X_UNLOCK (reqlock); |
|
|
383 | |
|
|
384 | X_LOCK (wrklock); |
|
|
385 | --started; |
|
|
386 | X_UNLOCK (wrklock); |
|
|
387 | } |
488 | } |
388 | |
489 | |
|
|
490 | unsigned int |
|
|
491 | eio_nready (void) |
|
|
492 | { |
|
|
493 | return etp_nready (EIO_POOL); |
|
|
494 | } |
|
|
495 | |
|
|
496 | unsigned int |
|
|
497 | eio_npending (void) |
|
|
498 | { |
|
|
499 | return etp_npending (EIO_POOL); |
|
|
500 | } |
|
|
501 | |
|
|
502 | unsigned int ecb_cold |
|
|
503 | eio_nthreads (void) |
|
|
504 | { |
|
|
505 | return etp_nthreads (EIO_POOL); |
|
|
506 | } |
|
|
507 | |
|
|
508 | void ecb_cold |
389 | void eio_set_max_poll_time (double nseconds) |
509 | eio_set_max_poll_time (double nseconds) |
390 | { |
510 | { |
391 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
511 | etp_set_max_poll_time (EIO_POOL, nseconds); |
392 | max_poll_time = nseconds; |
|
|
393 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
394 | } |
512 | } |
395 | |
513 | |
|
|
514 | void ecb_cold |
396 | void eio_set_max_poll_reqs (unsigned int maxreqs) |
515 | eio_set_max_poll_reqs (unsigned int maxreqs) |
397 | { |
516 | { |
398 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
517 | etp_set_max_poll_reqs (EIO_POOL, maxreqs); |
399 | max_poll_reqs = maxreqs; |
|
|
400 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
401 | } |
518 | } |
402 | |
519 | |
|
|
520 | void ecb_cold |
403 | void eio_set_max_idle (unsigned int nthreads) |
521 | eio_set_max_idle (unsigned int nthreads) |
404 | { |
522 | { |
405 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
523 | etp_set_max_idle (EIO_POOL, nthreads); |
406 | max_idle = nthreads <= 0 ? 1 : nthreads; |
|
|
407 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
408 | } |
524 | } |
409 | |
525 | |
|
|
526 | void ecb_cold |
|
|
527 | eio_set_idle_timeout (unsigned int seconds) |
|
|
528 | { |
|
|
529 | etp_set_idle_timeout (EIO_POOL, seconds); |
|
|
530 | } |
|
|
531 | |
|
|
532 | void ecb_cold |
410 | void eio_set_min_parallel (unsigned int nthreads) |
533 | eio_set_min_parallel (unsigned int nthreads) |
411 | { |
534 | { |
412 | if (wanted < nthreads) |
535 | etp_set_min_parallel (EIO_POOL, nthreads); |
413 | wanted = nthreads; |
|
|
414 | } |
536 | } |
415 | |
537 | |
|
|
538 | void ecb_cold |
416 | void eio_set_max_parallel (unsigned int nthreads) |
539 | eio_set_max_parallel (unsigned int nthreads) |
417 | { |
540 | { |
418 | if (wanted > nthreads) |
541 | etp_set_max_parallel (EIO_POOL, nthreads); |
419 | wanted = nthreads; |
|
|
420 | |
|
|
421 | while (started > wanted) |
|
|
422 | end_thread (); |
|
|
423 | } |
542 | } |
424 | |
543 | |
425 | int eio_poll (void) |
544 | int eio_poll (void) |
426 | { |
545 | { |
427 | int maxreqs = max_poll_reqs; |
546 | return etp_poll (EIO_POOL); |
428 | struct timeval tv_start, tv_now; |
|
|
429 | eio_req *req; |
|
|
430 | |
|
|
431 | if (max_poll_time) |
|
|
432 | gettimeofday (&tv_start, 0); |
|
|
433 | |
|
|
434 | for (;;) |
|
|
435 | { |
|
|
436 | maybe_start_thread (); |
|
|
437 | |
|
|
438 | X_LOCK (reslock); |
|
|
439 | req = reqq_shift (&res_queue); |
|
|
440 | |
|
|
441 | if (req) |
|
|
442 | { |
|
|
443 | --npending; |
|
|
444 | |
|
|
445 | if (!res_queue.size && done_poll_cb) |
|
|
446 | done_poll_cb (); |
|
|
447 | } |
|
|
448 | |
|
|
449 | X_UNLOCK (reslock); |
|
|
450 | |
|
|
451 | if (!req) |
|
|
452 | return 0; |
|
|
453 | |
|
|
454 | --nreqs; |
|
|
455 | |
|
|
456 | if (req->type == EIO_GROUP && req->size) |
|
|
457 | { |
|
|
458 | req->int1 = 1; /* mark request as delayed */ |
|
|
459 | continue; |
|
|
460 | } |
|
|
461 | else |
|
|
462 | { |
|
|
463 | int res = eio_finish (req); |
|
|
464 | if (res) |
|
|
465 | return res; |
|
|
466 | } |
|
|
467 | |
|
|
468 | if (maxreqs && !--maxreqs) |
|
|
469 | break; |
|
|
470 | |
|
|
471 | if (max_poll_time) |
|
|
472 | { |
|
|
473 | gettimeofday (&tv_now, 0); |
|
|
474 | |
|
|
475 | if (tvdiff (&tv_start, &tv_now) >= max_poll_time) |
|
|
476 | break; |
|
|
477 | } |
|
|
478 | } |
|
|
479 | |
|
|
480 | errno = EAGAIN; |
|
|
481 | return -1; |
|
|
482 | } |
547 | } |
483 | |
548 | |
484 | /*****************************************************************************/ |
549 | /*****************************************************************************/ |
485 | /* work around various missing functions */ |
550 | /* work around various missing functions */ |
486 | |
551 | |
487 | #if !HAVE_PREADWRITE |
|
|
488 | # define pread aio_pread |
|
|
489 | # define pwrite aio_pwrite |
|
|
490 | |
|
|
491 | /* |
|
|
492 | * make our pread/pwrite safe against themselves, but not against |
|
|
493 | * normal read/write by using a mutex. slows down execution a lot, |
|
|
494 | * but that's your problem, not mine. |
|
|
495 | */ |
|
|
496 | static mutex_t preadwritelock = X_MUTEX_INIT; |
|
|
497 | |
|
|
498 | static ssize_t pread (int fd, void *buf, size_t count, off_t offset) |
|
|
499 | { |
|
|
500 | ssize_t res; |
|
|
501 | off_t ooffset; |
|
|
502 | |
|
|
503 | X_LOCK (preadwritelock); |
|
|
504 | ooffset = lseek (fd, 0, SEEK_CUR); |
|
|
505 | lseek (fd, offset, SEEK_SET); |
|
|
506 | res = read (fd, buf, count); |
|
|
507 | lseek (fd, ooffset, SEEK_SET); |
|
|
508 | X_UNLOCK (preadwritelock); |
|
|
509 | |
|
|
510 | return res; |
|
|
511 | } |
|
|
512 | |
|
|
513 | static ssize_t pwrite (int fd, void *buf, size_t count, off_t offset) |
|
|
514 | { |
|
|
515 | ssize_t res; |
|
|
516 | off_t ooffset; |
|
|
517 | |
|
|
518 | X_LOCK (preadwritelock); |
|
|
519 | ooffset = lseek (fd, 0, SEEK_CUR); |
|
|
520 | lseek (fd, offset, SEEK_SET); |
|
|
521 | res = write (fd, buf, count); |
|
|
522 | lseek (fd, offset, SEEK_SET); |
|
|
523 | X_UNLOCK (preadwritelock); |
|
|
524 | |
|
|
525 | return res; |
|
|
526 | } |
|
|
527 | #endif |
|
|
528 | |
|
|
529 | #ifndef HAVE_FUTIMES |
552 | #ifndef HAVE_UTIMES |
530 | |
553 | |
|
|
554 | # undef utimes |
531 | # define utimes(path,times) aio_utimes (path, times) |
555 | # define utimes(path,times) eio__utimes (path, times) |
532 | # define futimes(fd,times) aio_futimes (fd, times) |
|
|
533 | |
556 | |
|
|
557 | static int |
534 | static int aio_utimes (const char *filename, const struct timeval times[2]) |
558 | eio__utimes (const char *filename, const struct timeval times[2]) |
535 | { |
559 | { |
536 | if (times) |
560 | if (times) |
537 | { |
561 | { |
538 | struct utimbuf buf; |
562 | struct utimbuf buf; |
539 | |
563 | |
… | |
… | |
544 | } |
568 | } |
545 | else |
569 | else |
546 | return utime (filename, 0); |
570 | return utime (filename, 0); |
547 | } |
571 | } |
548 | |
572 | |
|
|
573 | #endif |
|
|
574 | |
|
|
575 | #ifndef HAVE_FUTIMES |
|
|
576 | |
|
|
577 | # undef futimes |
|
|
578 | # define futimes(fd,times) eio__futimes (fd, times) |
|
|
579 | |
|
|
580 | static int |
549 | static int aio_futimes (int fd, const struct timeval tv[2]) |
581 | eio__futimes (int fd, const struct timeval tv[2]) |
550 | { |
582 | { |
551 | errno = ENOSYS; |
583 | errno = ENOSYS; |
552 | return -1; |
584 | return -1; |
553 | } |
585 | } |
554 | |
586 | |
555 | #endif |
587 | #endif |
556 | |
588 | |
557 | #if !HAVE_FDATASYNC |
589 | #if !HAVE_FDATASYNC |
|
|
590 | # undef fdatasync |
558 | # define fdatasync fsync |
591 | # define fdatasync(fd) fsync (fd) |
559 | #endif |
592 | #endif |
|
|
593 | |
|
|
594 | static int |
|
|
595 | eio__syncfs (int fd) |
|
|
596 | { |
|
|
597 | int res; |
|
|
598 | |
|
|
599 | #if HAVE_SYS_SYNCFS |
|
|
600 | res = (int)syscall (__NR_syncfs, (int)(fd)); |
|
|
601 | #else |
|
|
602 | res = EIO_ENOSYS (); |
|
|
603 | #endif |
|
|
604 | |
|
|
605 | if (res < 0 && errno == ENOSYS && fd >= 0) |
|
|
606 | sync (); |
|
|
607 | |
|
|
608 | return res; |
|
|
609 | } |
|
|
610 | |
|
|
611 | /* sync_file_range always needs emulation */ |
|
|
612 | static int |
|
|
613 | eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags) |
|
|
614 | { |
|
|
615 | #if HAVE_SYNC_FILE_RANGE |
|
|
616 | int res; |
|
|
617 | |
|
|
618 | if (EIO_SYNC_FILE_RANGE_WAIT_BEFORE != SYNC_FILE_RANGE_WAIT_BEFORE |
|
|
619 | || EIO_SYNC_FILE_RANGE_WRITE != SYNC_FILE_RANGE_WRITE |
|
|
620 | || EIO_SYNC_FILE_RANGE_WAIT_AFTER != SYNC_FILE_RANGE_WAIT_AFTER) |
|
|
621 | { |
|
|
622 | flags = 0 |
|
|
623 | | (flags & EIO_SYNC_FILE_RANGE_WAIT_BEFORE ? SYNC_FILE_RANGE_WAIT_BEFORE : 0) |
|
|
624 | | (flags & EIO_SYNC_FILE_RANGE_WRITE ? SYNC_FILE_RANGE_WRITE : 0) |
|
|
625 | | (flags & EIO_SYNC_FILE_RANGE_WAIT_AFTER ? SYNC_FILE_RANGE_WAIT_AFTER : 0); |
|
|
626 | } |
|
|
627 | |
|
|
628 | res = sync_file_range (fd, offset, nbytes, flags); |
|
|
629 | |
|
|
630 | if (!res || errno != ENOSYS) |
|
|
631 | return res; |
|
|
632 | #endif |
|
|
633 | |
|
|
634 | /* even though we could play tricks with the flags, it's better to always |
|
|
635 | * call fdatasync, as that matches the expectation of its users best */ |
|
|
636 | return fdatasync (fd); |
|
|
637 | } |
|
|
638 | |
|
|
639 | static int |
|
|
640 | eio__fallocate (int fd, int mode, off_t offset, size_t len) |
|
|
641 | { |
|
|
642 | #if HAVE_LINUX_FALLOCATE |
|
|
643 | return fallocate (fd, mode, offset, len); |
|
|
644 | #else |
|
|
645 | return EIO_ENOSYS (); |
|
|
646 | #endif |
|
|
647 | } |
560 | |
648 | |
561 | #if !HAVE_READAHEAD |
649 | #if !HAVE_READAHEAD |
|
|
650 | # undef readahead |
562 | # define readahead(fd,offset,count) aio_readahead (fd, offset, count, self) |
651 | # define readahead(fd,offset,count) eio__readahead (fd, offset, count, self) |
563 | |
652 | |
|
|
653 | static eio_ssize_t |
564 | static ssize_t aio_readahead (int fd, off_t offset, size_t count, worker *self) |
654 | eio__readahead (int fd, off_t offset, size_t count, etp_worker *self) |
565 | { |
655 | { |
566 | size_t todo = count; |
656 | size_t todo = count; |
567 | dBUF; |
657 | dBUF; |
568 | |
658 | |
569 | while (todo > 0) |
659 | while (todo > 0) |
… | |
… | |
573 | pread (fd, eio_buf, len, offset); |
663 | pread (fd, eio_buf, len, offset); |
574 | offset += len; |
664 | offset += len; |
575 | todo -= len; |
665 | todo -= len; |
576 | } |
666 | } |
577 | |
667 | |
578 | errno = 0; |
668 | FUBd; |
|
|
669 | |
|
|
670 | /* linux's readahead basically only fails for EBADF or EINVAL (not mmappable) */ |
|
|
671 | /* but not for e.g. EIO or eof, so we also never fail */ |
579 | return count; |
672 | return 0; |
580 | } |
673 | } |
581 | |
674 | |
582 | #endif |
|
|
583 | |
|
|
584 | #if !HAVE_READDIR_R |
|
|
585 | # define readdir_r aio_readdir_r |
|
|
586 | |
|
|
587 | static mutex_t readdirlock = X_MUTEX_INIT; |
|
|
588 | |
|
|
589 | static int readdir_r (DIR *dirp, X_DIRENT *ent, X_DIRENT **res) |
|
|
590 | { |
|
|
591 | X_DIRENT *e; |
|
|
592 | int errorno; |
|
|
593 | |
|
|
594 | X_LOCK (readdirlock); |
|
|
595 | |
|
|
596 | e = readdir (dirp); |
|
|
597 | errorno = errno; |
|
|
598 | |
|
|
599 | if (e) |
|
|
600 | { |
|
|
601 | *res = ent; |
|
|
602 | strcpy (ent->d_name, e->d_name); |
|
|
603 | } |
|
|
604 | else |
|
|
605 | *res = 0; |
|
|
606 | |
|
|
607 | X_UNLOCK (readdirlock); |
|
|
608 | |
|
|
609 | errno = errorno; |
|
|
610 | return e ? 0 : -1; |
|
|
611 | } |
|
|
612 | #endif |
675 | #endif |
613 | |
676 | |
614 | /* sendfile always needs emulation */ |
677 | /* sendfile always needs emulation */ |
|
|
678 | static eio_ssize_t |
615 | static ssize_t sendfile_ (int ofd, int ifd, off_t offset, size_t count, worker *self) |
679 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count) |
616 | { |
680 | { |
|
|
681 | eio_ssize_t written = 0; |
617 | ssize_t res; |
682 | eio_ssize_t res; |
618 | |
683 | |
619 | if (!count) |
684 | if (!count) |
620 | return 0; |
685 | return 0; |
621 | |
686 | |
|
|
687 | for (;;) |
|
|
688 | { |
|
|
689 | #ifdef __APPLE__ |
|
|
690 | # undef HAVE_SENDFILE /* broken, as everything on os x */ |
|
|
691 | #endif |
622 | #if HAVE_SENDFILE |
692 | #if HAVE_SENDFILE |
623 | # if __linux |
693 | # if __linux |
|
|
694 | off_t soffset = offset; |
624 | res = sendfile (ofd, ifd, &offset, count); |
695 | res = sendfile (ofd, ifd, &soffset, count); |
625 | |
696 | |
626 | # elif __freebsd |
697 | # elif __FreeBSD__ |
627 | /* |
698 | /* |
628 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
699 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
629 | * wasted on making it similar to other I/O functions. |
700 | * wasted on making it similar to other I/O functions. |
630 | */ |
701 | */ |
631 | { |
|
|
632 | off_t sbytes; |
702 | off_t sbytes; |
633 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
703 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
634 | |
704 | |
635 | if (res < 0 && sbytes) |
705 | #if 0 /* according to the manpage, this is correct, but broken behaviour */ |
636 | /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ |
706 | /* freebsd' sendfile will return 0 on success */ |
|
|
707 | /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */ |
|
|
708 | /* not on e.g. EIO or EPIPE - sounds broken */ |
|
|
709 | if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0) |
637 | res = sbytes; |
710 | res = sbytes; |
638 | } |
711 | #endif |
|
|
712 | |
|
|
713 | /* according to source inspection, this is correct, and useful behaviour */ |
|
|
714 | if (sbytes) |
|
|
715 | res = sbytes; |
|
|
716 | |
|
|
717 | # elif defined __APPLE__ |
|
|
718 | off_t sbytes = count; |
|
|
719 | res = sendfile (ifd, ofd, offset, &sbytes, 0, 0); |
|
|
720 | |
|
|
721 | /* according to the manpage, sbytes is always valid */ |
|
|
722 | if (sbytes) |
|
|
723 | res = sbytes; |
639 | |
724 | |
640 | # elif __hpux |
725 | # elif __hpux |
641 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
726 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
642 | |
727 | |
643 | # elif __solaris |
728 | # elif __solaris |
644 | { |
|
|
645 | struct sendfilevec vec; |
729 | struct sendfilevec vec; |
646 | size_t sbytes; |
730 | size_t sbytes; |
647 | |
731 | |
648 | vec.sfv_fd = ifd; |
732 | vec.sfv_fd = ifd; |
649 | vec.sfv_flag = 0; |
733 | vec.sfv_flag = 0; |
650 | vec.sfv_off = offset; |
734 | vec.sfv_off = offset; |
651 | vec.sfv_len = count; |
735 | vec.sfv_len = count; |
652 | |
736 | |
653 | res = sendfilev (ofd, &vec, 1, &sbytes); |
737 | res = sendfilev (ofd, &vec, 1, &sbytes); |
654 | |
738 | |
655 | if (res < 0 && sbytes) |
739 | if (res < 0 && sbytes) |
656 | res = sbytes; |
740 | res = sbytes; |
657 | } |
|
|
658 | |
741 | |
659 | # endif |
742 | # endif |
|
|
743 | |
|
|
744 | #elif defined (_WIN32) && 0 |
|
|
745 | /* does not work, just for documentation of what would need to be done */ |
|
|
746 | /* actually, cannot be done like this, as TransmitFile changes the file offset, */ |
|
|
747 | /* libeio guarantees that the file offset does not change, and windows */ |
|
|
748 | /* has no way to get an independent handle to the same file description */ |
|
|
749 | HANDLE h = TO_SOCKET (ifd); |
|
|
750 | SetFilePointer (h, offset, 0, FILE_BEGIN); |
|
|
751 | res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0); |
|
|
752 | |
660 | #else |
753 | #else |
661 | res = -1; |
754 | res = EIO_ENOSYS (); |
662 | errno = ENOSYS; |
|
|
663 | #endif |
755 | #endif |
664 | |
756 | |
|
|
757 | /* we assume sendfile can copy at least 128mb in one go */ |
|
|
758 | if (res <= 128 * 1024 * 1024) |
|
|
759 | { |
|
|
760 | if (res > 0) |
|
|
761 | written += res; |
|
|
762 | |
|
|
763 | if (written) |
|
|
764 | return written; |
|
|
765 | |
|
|
766 | break; |
|
|
767 | } |
|
|
768 | else |
|
|
769 | { |
|
|
770 | /* if we requested more, then probably the kernel was lazy */ |
|
|
771 | written += res; |
|
|
772 | offset += res; |
|
|
773 | count -= res; |
|
|
774 | |
|
|
775 | if (!count) |
|
|
776 | return written; |
|
|
777 | } |
|
|
778 | } |
|
|
779 | |
665 | if (res < 0 |
780 | if (res < 0 |
666 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
781 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
|
|
782 | /* BSDs */ |
|
|
783 | #ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */ |
|
|
784 | || errno == ENOTSUP |
|
|
785 | #endif |
|
|
786 | #ifdef EOPNOTSUPP /* windows */ |
|
|
787 | || errno == EOPNOTSUPP /* BSDs */ |
|
|
788 | #endif |
667 | #if __solaris |
789 | #if __solaris |
668 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
790 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
669 | #endif |
791 | #endif |
670 | ) |
792 | ) |
671 | ) |
793 | ) |
… | |
… | |
675 | |
797 | |
676 | res = 0; |
798 | res = 0; |
677 | |
799 | |
678 | while (count) |
800 | while (count) |
679 | { |
801 | { |
680 | ssize_t cnt; |
802 | eio_ssize_t cnt; |
681 | |
803 | |
682 | cnt = pread (ifd, eio_buf, count > EIO_BUFSIZE ? EIO_BUFSIZE : count, offset); |
804 | cnt = pread (ifd, eio_buf, count > EIO_BUFSIZE ? EIO_BUFSIZE : count, offset); |
683 | |
805 | |
684 | if (cnt <= 0) |
806 | if (cnt <= 0) |
685 | { |
807 | { |
… | |
… | |
697 | |
819 | |
698 | offset += cnt; |
820 | offset += cnt; |
699 | res += cnt; |
821 | res += cnt; |
700 | count -= cnt; |
822 | count -= cnt; |
701 | } |
823 | } |
|
|
824 | |
|
|
825 | FUBd; |
702 | } |
826 | } |
703 | |
827 | |
704 | return res; |
828 | return res; |
705 | } |
829 | } |
706 | |
830 | |
707 | /* read a full directory */ |
831 | #ifdef PAGESIZE |
708 | static void scandir_ (eio_req *req, worker *self) |
832 | # define eio_pagesize() PAGESIZE |
|
|
833 | #else |
|
|
834 | static intptr_t |
|
|
835 | eio_pagesize (void) |
709 | { |
836 | { |
710 | DIR *dirp; |
837 | static intptr_t page; |
711 | union |
|
|
712 | { |
|
|
713 | EIO_STRUCT_DIRENT d; |
|
|
714 | char b [offsetof (EIO_STRUCT_DIRENT, d_name) + NAME_MAX + 1]; |
|
|
715 | } *u; |
|
|
716 | EIO_STRUCT_DIRENT *entp; |
|
|
717 | char *name, *names; |
|
|
718 | int memlen = 4096; |
|
|
719 | int memofs = 0; |
|
|
720 | int res = 0; |
|
|
721 | |
838 | |
722 | X_LOCK (wrklock); |
839 | if (!page) |
723 | self->dirp = dirp = opendir (req->ptr1); |
840 | page = sysconf (_SC_PAGESIZE); |
724 | self->dbuf = u = malloc (sizeof (*u)); |
|
|
725 | req->flags |= EIO_FLAG_PTR2_FREE; |
|
|
726 | req->ptr2 = names = malloc (memlen); |
|
|
727 | X_UNLOCK (wrklock); |
|
|
728 | |
841 | |
729 | if (dirp && u && names) |
842 | return page; |
730 | for (;;) |
843 | } |
|
|
844 | #endif |
|
|
845 | |
|
|
846 | static void |
|
|
847 | eio_page_align (void **addr, size_t *length) |
|
|
848 | { |
|
|
849 | intptr_t mask = eio_pagesize () - 1; |
|
|
850 | |
|
|
851 | /* round down addr */ |
|
|
852 | intptr_t adj = mask & (intptr_t)*addr; |
|
|
853 | |
|
|
854 | *addr = (void *)((intptr_t)*addr - adj); |
|
|
855 | *length += adj; |
|
|
856 | |
|
|
857 | /* round up length */ |
|
|
858 | *length = (*length + mask) & ~mask; |
|
|
859 | } |
|
|
860 | |
|
|
861 | #if !_POSIX_MEMLOCK |
|
|
862 | # define eio__mlockall(a) EIO_ENOSYS () |
|
|
863 | #else |
|
|
864 | |
|
|
865 | static int |
|
|
866 | eio__mlockall (int flags) |
|
|
867 | { |
|
|
868 | #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7 |
|
|
869 | extern int mallopt (int, int); |
|
|
870 | mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */ |
|
|
871 | #endif |
|
|
872 | |
|
|
873 | if (EIO_MCL_CURRENT != MCL_CURRENT |
|
|
874 | || EIO_MCL_FUTURE != MCL_FUTURE) |
|
|
875 | { |
|
|
876 | flags = 0 |
|
|
877 | | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0) |
|
|
878 | | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0); |
|
|
879 | } |
|
|
880 | |
|
|
881 | return mlockall (flags); |
|
|
882 | } |
|
|
883 | #endif |
|
|
884 | |
|
|
885 | #if !_POSIX_MEMLOCK_RANGE |
|
|
886 | # define eio__mlock(a,b) EIO_ENOSYS () |
|
|
887 | #else |
|
|
888 | |
|
|
889 | static int |
|
|
890 | eio__mlock (void *addr, size_t length) |
|
|
891 | { |
|
|
892 | eio_page_align (&addr, &length); |
|
|
893 | |
|
|
894 | return mlock (addr, length); |
|
|
895 | } |
|
|
896 | |
|
|
897 | #endif |
|
|
898 | |
|
|
899 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
|
|
900 | # define eio__msync(a,b,c) EIO_ENOSYS () |
|
|
901 | #else |
|
|
902 | |
|
|
903 | static int |
|
|
904 | eio__msync (void *mem, size_t len, int flags) |
|
|
905 | { |
|
|
906 | eio_page_align (&mem, &len); |
|
|
907 | |
|
|
908 | if (EIO_MS_ASYNC != MS_SYNC |
|
|
909 | || EIO_MS_INVALIDATE != MS_INVALIDATE |
|
|
910 | || EIO_MS_SYNC != MS_SYNC) |
|
|
911 | { |
|
|
912 | flags = 0 |
|
|
913 | | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0) |
|
|
914 | | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0) |
|
|
915 | | (flags & EIO_MS_SYNC ? MS_SYNC : 0); |
|
|
916 | } |
|
|
917 | |
|
|
918 | return msync (mem, len, flags); |
|
|
919 | } |
|
|
920 | |
|
|
921 | #endif |
|
|
922 | |
|
|
923 | static int |
|
|
924 | eio__mtouch (eio_req *req) |
|
|
925 | { |
|
|
926 | void *mem = req->ptr2; |
|
|
927 | size_t len = req->size; |
|
|
928 | int flags = req->int1; |
|
|
929 | |
|
|
930 | eio_page_align (&mem, &len); |
|
|
931 | |
|
|
932 | { |
|
|
933 | intptr_t addr = (intptr_t)mem; |
|
|
934 | intptr_t end = addr + len; |
|
|
935 | intptr_t page = eio_pagesize (); |
|
|
936 | |
|
|
937 | if (addr < end) |
|
|
938 | if (flags & EIO_MT_MODIFY) /* modify */ |
|
|
939 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
|
|
940 | else |
|
|
941 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
|
|
942 | } |
|
|
943 | |
|
|
944 | return 0; |
|
|
945 | } |
|
|
946 | |
|
|
947 | /*****************************************************************************/ |
|
|
948 | /* requests implemented outside eio_execute, because they are so large */ |
|
|
949 | |
|
|
950 | static void |
|
|
951 | eio__lseek (eio_req *req) |
|
|
952 | { |
|
|
953 | /* this usually gets optimised away completely, or your compiler sucks, */ |
|
|
954 | /* or the whence constants really are not 0, 1, 2 */ |
|
|
955 | int whence = req->int2 == EIO_SEEK_SET ? SEEK_SET |
|
|
956 | : req->int2 == EIO_SEEK_CUR ? SEEK_CUR |
|
|
957 | : req->int2 == EIO_SEEK_END ? SEEK_END |
|
|
958 | : req->int2; |
|
|
959 | |
|
|
960 | req->offs = lseek (req->int1, req->offs, whence); |
|
|
961 | req->result = req->offs == (off_t)-1 ? -1 : 0; |
|
|
962 | } |
|
|
963 | |
|
|
964 | /* result will always end up in tmpbuf, there is always space for adding a 0-byte */ |
|
|
965 | static int |
|
|
966 | eio__realpath (struct etp_tmpbuf *tmpbuf, eio_wd wd, const char *path) |
|
|
967 | { |
|
|
968 | char *res; |
|
|
969 | const char *rel = path; |
|
|
970 | char *tmp1, *tmp2; |
|
|
971 | #if SYMLOOP_MAX > 32 |
|
|
972 | int symlinks = SYMLOOP_MAX; |
|
|
973 | #else |
|
|
974 | int symlinks = 32; |
|
|
975 | #endif |
|
|
976 | |
|
|
977 | errno = EINVAL; |
|
|
978 | if (!rel) |
|
|
979 | return -1; |
|
|
980 | |
|
|
981 | errno = ENOENT; |
|
|
982 | if (!*rel) |
|
|
983 | return -1; |
|
|
984 | |
|
|
985 | res = etp_tmpbuf_get (tmpbuf, EIO_PATH_MAX * 3); |
|
|
986 | #ifdef _WIN32 |
|
|
987 | if (_access (rel, 4) != 0) |
|
|
988 | return -1; |
|
|
989 | |
|
|
990 | symlinks = GetFullPathName (rel, EIO_PATH_MAX * 3, res, 0); |
|
|
991 | |
|
|
992 | errno = ENAMETOOLONG; |
|
|
993 | if (symlinks >= EIO_PATH_MAX * 3) |
|
|
994 | return -1; |
|
|
995 | |
|
|
996 | errno = EIO; |
|
|
997 | if (symlinks <= 0) |
|
|
998 | return -1; |
|
|
999 | |
|
|
1000 | return symlinks; |
|
|
1001 | |
|
|
1002 | #else |
|
|
1003 | tmp1 = res + EIO_PATH_MAX; |
|
|
1004 | tmp2 = tmp1 + EIO_PATH_MAX; |
|
|
1005 | |
|
|
1006 | #if 0 /* disabled, the musl way to do things is just too racy */ |
|
|
1007 | #if __linux && defined(O_NONBLOCK) && defined(O_NOATIME) |
|
|
1008 | /* on linux we may be able to ask the kernel */ |
|
|
1009 | { |
|
|
1010 | int fd = open (rel, O_RDONLY | O_NONBLOCK | O_NOCTTY | O_NOATIME); |
|
|
1011 | |
|
|
1012 | if (fd >= 0) |
731 | { |
1013 | { |
|
|
1014 | sprintf (tmp1, "/proc/self/fd/%d", fd); |
|
|
1015 | req->result = readlink (tmp1, res, EIO_PATH_MAX); |
|
|
1016 | /* here we should probably stat the open file and the disk file, to make sure they still match */ |
|
|
1017 | close (fd); |
|
|
1018 | |
|
|
1019 | if (req->result > 0) |
|
|
1020 | goto done; |
|
|
1021 | } |
|
|
1022 | else if (errno == ELOOP || errno == ENAMETOOLONG || errno == ENOENT || errno == ENOTDIR || errno == EIO) |
|
|
1023 | return -1; |
|
|
1024 | } |
|
|
1025 | #endif |
|
|
1026 | #endif |
|
|
1027 | |
|
|
1028 | if (*rel != '/') |
|
|
1029 | { |
|
|
1030 | int len; |
|
|
1031 | |
732 | errno = 0; |
1032 | errno = ENOENT; |
733 | readdir_r (dirp, &u->d, &entp); |
1033 | if (wd == EIO_INVALID_WD) |
|
|
1034 | return -1; |
|
|
1035 | |
|
|
1036 | if (wd == EIO_CWD) |
|
|
1037 | { |
|
|
1038 | if (!getcwd (res, EIO_PATH_MAX)) |
|
|
1039 | return -1; |
734 | |
1040 | |
735 | if (!entp) |
1041 | len = strlen (res); |
|
|
1042 | } |
|
|
1043 | else |
|
|
1044 | memcpy (res, wd->str, len = wd->len); |
|
|
1045 | |
|
|
1046 | if (res [1]) /* only use if not / */ |
|
|
1047 | res += len; |
|
|
1048 | } |
|
|
1049 | |
|
|
1050 | while (*rel) |
|
|
1051 | { |
|
|
1052 | eio_ssize_t len, linklen; |
|
|
1053 | const char *beg = rel; |
|
|
1054 | |
|
|
1055 | while (*rel && *rel != '/') |
|
|
1056 | ++rel; |
|
|
1057 | |
|
|
1058 | len = rel - beg; |
|
|
1059 | |
|
|
1060 | if (!len) /* skip slashes */ |
|
|
1061 | { |
736 | break; |
1062 | ++rel; |
|
|
1063 | continue; |
|
|
1064 | } |
737 | |
1065 | |
738 | name = entp->d_name; |
1066 | if (beg [0] == '.') |
|
|
1067 | { |
|
|
1068 | if (len == 1) |
|
|
1069 | continue; /* . - nop */ |
739 | |
1070 | |
740 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
1071 | if (beg [1] == '.' && len == 2) |
|
|
1072 | { |
|
|
1073 | /* .. - back up one component, if possible */ |
|
|
1074 | |
|
|
1075 | while (res != tmpbuf->ptr) |
|
|
1076 | if (*--res == '/') |
|
|
1077 | break; |
|
|
1078 | |
|
|
1079 | continue; |
|
|
1080 | } |
|
|
1081 | } |
|
|
1082 | |
|
|
1083 | errno = ENAMETOOLONG; |
|
|
1084 | if (res + 1 + len + 1 >= tmp1) |
|
|
1085 | return -1; |
|
|
1086 | |
|
|
1087 | /* copy one component */ |
|
|
1088 | *res = '/'; |
|
|
1089 | memcpy (res + 1, beg, len); |
|
|
1090 | |
|
|
1091 | /* zero-terminate, for readlink */ |
|
|
1092 | res [len + 1] = 0; |
|
|
1093 | |
|
|
1094 | /* now check if it's a symlink */ |
|
|
1095 | linklen = readlink (tmpbuf->ptr, tmp1, EIO_PATH_MAX); |
|
|
1096 | |
|
|
1097 | if (linklen < 0) |
741 | { |
1098 | { |
742 | int len = strlen (name) + 1; |
1099 | if (errno != EINVAL) |
|
|
1100 | return -1; |
743 | |
1101 | |
744 | res++; |
1102 | /* it's a normal directory. hopefully */ |
745 | |
|
|
746 | while (memofs + len > memlen) |
|
|
747 | { |
|
|
748 | memlen *= 2; |
|
|
749 | X_LOCK (wrklock); |
|
|
750 | req->ptr2 = names = realloc (names, memlen); |
|
|
751 | X_UNLOCK (wrklock); |
|
|
752 | |
|
|
753 | if (!names) |
|
|
754 | break; |
|
|
755 | } |
|
|
756 | |
|
|
757 | memcpy (names + memofs, name, len); |
|
|
758 | memofs += len; |
1103 | res += len + 1; |
759 | } |
|
|
760 | } |
|
|
761 | |
|
|
762 | if (errno) |
|
|
763 | res = -1; |
|
|
764 | |
|
|
765 | req->result = res; |
|
|
766 | } |
|
|
767 | |
|
|
768 | /*****************************************************************************/ |
|
|
769 | |
|
|
770 | X_THREAD_PROC (eio_proc) |
|
|
771 | { |
|
|
772 | eio_req *req; |
|
|
773 | struct timespec ts; |
|
|
774 | worker *self = (worker *)thr_arg; |
|
|
775 | |
|
|
776 | /* try to distribute timeouts somewhat randomly */ |
|
|
777 | ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); |
|
|
778 | |
|
|
779 | for (;;) |
|
|
780 | { |
|
|
781 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
|
|
782 | |
|
|
783 | X_LOCK (reqlock); |
|
|
784 | |
|
|
785 | for (;;) |
|
|
786 | { |
|
|
787 | self->req = req = reqq_shift (&req_queue); |
|
|
788 | |
|
|
789 | if (req) |
|
|
790 | break; |
|
|
791 | |
|
|
792 | ++idle; |
|
|
793 | |
|
|
794 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
|
|
795 | { |
|
|
796 | if (idle > max_idle) |
|
|
797 | { |
|
|
798 | --idle; |
|
|
799 | X_UNLOCK (reqlock); |
|
|
800 | X_LOCK (wrklock); |
|
|
801 | --started; |
|
|
802 | X_UNLOCK (wrklock); |
|
|
803 | goto quit; |
|
|
804 | } |
|
|
805 | |
|
|
806 | /* we are allowed to idle, so do so without any timeout */ |
|
|
807 | X_COND_WAIT (reqwait, reqlock); |
|
|
808 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
|
|
809 | } |
|
|
810 | |
|
|
811 | --idle; |
|
|
812 | } |
|
|
813 | |
|
|
814 | --nready; |
|
|
815 | |
|
|
816 | X_UNLOCK (reqlock); |
|
|
817 | |
|
|
818 | errno = 0; /* strictly unnecessary */ |
|
|
819 | |
|
|
820 | if (!EIO_CANCELLED (req)) |
|
|
821 | switch (req->type) |
|
|
822 | { |
|
|
823 | case EIO_READ: req->result = req->offs >= 0 |
|
|
824 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
|
|
825 | : read (req->int1, req->ptr2, req->size); break; |
|
|
826 | case EIO_WRITE: req->result = req->offs >= 0 |
|
|
827 | ? pwrite (req->int1, req->ptr2, req->size, req->offs) |
|
|
828 | : write (req->int1, req->ptr2, req->size); break; |
|
|
829 | |
|
|
830 | case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break; |
|
|
831 | case EIO_SENDFILE: req->result = sendfile_ (req->int1, req->int2, req->offs, req->size, self); break; |
|
|
832 | |
|
|
833 | case EIO_STAT: req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
834 | case EIO_LSTAT: req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
835 | case EIO_FSTAT: req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
836 | |
|
|
837 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
|
|
838 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
|
|
839 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
|
|
840 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
|
|
841 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
|
|
842 | case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break; |
|
|
843 | |
|
|
844 | case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break; |
|
|
845 | case EIO_CLOSE: req->result = close (req->int1); break; |
|
|
846 | case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break; |
|
|
847 | case EIO_UNLINK: req->result = unlink (req->ptr1); break; |
|
|
848 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
|
|
849 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
|
|
850 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
|
|
851 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
|
|
852 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
|
|
853 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
|
|
854 | case EIO_READLINK: req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; |
|
|
855 | |
|
|
856 | case EIO_SYNC: req->result = 0; sync (); break; |
|
|
857 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
|
|
858 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
|
|
859 | |
|
|
860 | case EIO_READDIR: scandir_ (req, self); break; |
|
|
861 | |
|
|
862 | case EIO_BUSY: |
|
|
863 | #ifdef _WIN32 |
|
|
864 | Sleep (req->nv1 * 1000.); |
|
|
865 | #else |
|
|
866 | { |
|
|
867 | struct timeval tv; |
|
|
868 | |
|
|
869 | tv.tv_sec = req->nv1; |
|
|
870 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; |
|
|
871 | |
|
|
872 | req->result = select (0, 0, 0, 0, &tv); |
|
|
873 | } |
|
|
874 | #endif |
|
|
875 | break; |
|
|
876 | |
|
|
877 | case EIO_UTIME: |
|
|
878 | case EIO_FUTIME: |
|
|
879 | { |
|
|
880 | struct timeval tv[2]; |
|
|
881 | struct timeval *times; |
|
|
882 | |
|
|
883 | if (req->nv1 != -1. || req->nv2 != -1.) |
|
|
884 | { |
|
|
885 | tv[0].tv_sec = req->nv1; |
|
|
886 | tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.; |
|
|
887 | tv[1].tv_sec = req->nv2; |
|
|
888 | tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.; |
|
|
889 | |
|
|
890 | times = tv; |
|
|
891 | } |
|
|
892 | else |
|
|
893 | times = 0; |
|
|
894 | |
|
|
895 | |
|
|
896 | req->result = req->type == EIO_FUTIME |
|
|
897 | ? futimes (req->int1, times) |
|
|
898 | : utimes (req->ptr1, times); |
|
|
899 | } |
|
|
900 | |
|
|
901 | case EIO_GROUP: |
|
|
902 | case EIO_NOP: |
|
|
903 | break; |
|
|
904 | |
|
|
905 | case EIO_QUIT: |
|
|
906 | goto quit; |
|
|
907 | |
|
|
908 | default: |
|
|
909 | req->result = -1; |
|
|
910 | break; |
|
|
911 | } |
|
|
912 | |
|
|
913 | req->errorno = errno; |
|
|
914 | |
|
|
915 | X_LOCK (reslock); |
|
|
916 | |
|
|
917 | ++npending; |
|
|
918 | |
|
|
919 | if (!reqq_push (&res_queue, req) && want_poll_cb) |
|
|
920 | want_poll_cb (); |
|
|
921 | |
|
|
922 | self->req = 0; |
|
|
923 | worker_clear (self); |
|
|
924 | |
|
|
925 | X_UNLOCK (reslock); |
|
|
926 | } |
|
|
927 | |
|
|
928 | quit: |
|
|
929 | X_LOCK (wrklock); |
|
|
930 | worker_free (self); |
|
|
931 | X_UNLOCK (wrklock); |
|
|
932 | |
|
|
933 | return 0; |
|
|
934 | } |
|
|
935 | |
|
|
936 | /*****************************************************************************/ |
|
|
937 | |
|
|
938 | static void eio_atfork_prepare (void) |
|
|
939 | { |
|
|
940 | X_LOCK (wrklock); |
|
|
941 | X_LOCK (reqlock); |
|
|
942 | X_LOCK (reslock); |
|
|
943 | #if !HAVE_PREADWRITE |
|
|
944 | X_LOCK (preadwritelock); |
|
|
945 | #endif |
|
|
946 | #if !HAVE_READDIR_R |
|
|
947 | X_LOCK (readdirlock); |
|
|
948 | #endif |
|
|
949 | } |
|
|
950 | |
|
|
951 | static void eio_atfork_parent (void) |
|
|
952 | { |
|
|
953 | #if !HAVE_READDIR_R |
|
|
954 | X_UNLOCK (readdirlock); |
|
|
955 | #endif |
|
|
956 | #if !HAVE_PREADWRITE |
|
|
957 | X_UNLOCK (preadwritelock); |
|
|
958 | #endif |
|
|
959 | X_UNLOCK (reslock); |
|
|
960 | X_UNLOCK (reqlock); |
|
|
961 | X_UNLOCK (wrklock); |
|
|
962 | } |
|
|
963 | |
|
|
964 | static void eio_atfork_child (void) |
|
|
965 | { |
|
|
966 | eio_req *prv; |
|
|
967 | |
|
|
968 | while (prv = reqq_shift (&req_queue)) |
|
|
969 | eio_destroy (prv); |
|
|
970 | |
|
|
971 | while (prv = reqq_shift (&res_queue)) |
|
|
972 | eio_destroy (prv); |
|
|
973 | |
|
|
974 | while (wrk_first.next != &wrk_first) |
|
|
975 | { |
|
|
976 | worker *wrk = wrk_first.next; |
|
|
977 | |
|
|
978 | if (wrk->req) |
|
|
979 | eio_destroy (wrk->req); |
|
|
980 | |
|
|
981 | worker_clear (wrk); |
|
|
982 | worker_free (wrk); |
|
|
983 | } |
|
|
984 | |
|
|
985 | started = 0; |
|
|
986 | idle = 0; |
|
|
987 | nreqs = 0; |
|
|
988 | nready = 0; |
|
|
989 | npending = 0; |
|
|
990 | |
|
|
991 | eio_atfork_parent (); |
|
|
992 | } |
|
|
993 | |
|
|
994 | int eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
|
|
995 | { |
|
|
996 | want_poll_cb = want_poll; |
|
|
997 | done_poll_cb = done_poll; |
|
|
998 | |
|
|
999 | #ifdef _WIN32 |
|
|
1000 | X_MUTEX_CHECK (wrklock); |
|
|
1001 | X_MUTEX_CHECK (reslock); |
|
|
1002 | X_MUTEX_CHECK (reqlock); |
|
|
1003 | X_MUTEX_CHECK (reqwait); |
|
|
1004 | X_MUTEX_CHECK (preadwritelock); |
|
|
1005 | X_MUTEX_CHECK (readdirlock); |
|
|
1006 | |
|
|
1007 | X_COND_CHECK (reqwait); |
|
|
1008 | #endif |
|
|
1009 | |
|
|
1010 | X_THREAD_ATFORK (eio_atfork_prepare, eio_atfork_parent, eio_atfork_child); |
|
|
1011 | } |
|
|
1012 | |
|
|
1013 | #if 0 |
|
|
1014 | |
|
|
1015 | eio_req *eio_fsync (int fd, eio_cb cb); |
|
|
1016 | eio_req *eio_fdatasync (int fd, eio_cb cb); |
|
|
1017 | eio_req *eio_dupclose (int fd, eio_cb cb); |
|
|
1018 | eio_req *eio_readahead (int fd, off_t offset, size_t length, eio_cb cb); |
|
|
1019 | eio_req *eio_read (int fd, off_t offs, size_t length, char *data, eio_cb cb); |
|
|
1020 | eio_req *eio_write (int fd, off_t offs, size_t length, char *data, eio_cb cb); |
|
|
1021 | eio_req *eio_fstat (int fd, eio_cb cb); /* stat buffer=ptr2 allocates dynamically */ |
|
|
1022 | eio_req *eio_futime (int fd, double atime, double mtime, eio_cb cb); |
|
|
1023 | eio_req *eio_ftruncate (int fd, off_t offset, eio_cb cb); |
|
|
1024 | eio_req *eio_fchmod (int fd, mode_t mode, eio_cb cb); |
|
|
1025 | eio_req *eio_fchown (int fd, uid_t uid, gid_t gid, eio_cb cb); |
|
|
1026 | eio_req *eio_dup2 (int fd, int fd2, eio_cb cb); |
|
|
1027 | eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, eio_cb cb); |
|
|
1028 | eio_req *eio_open (const char *path, int flags, mode_t mode, eio_cb cb); |
|
|
1029 | eio_req *eio_readlink (const char *path, eio_cb cb); /* result=ptr2 allocated dynamically */ |
|
|
1030 | eio_req *eio_stat (const char *path, eio_cb cb); /* stat buffer=ptr2 allocates dynamically */ |
|
|
1031 | eio_req *eio_lstat (const char *path, eio_cb cb); /* stat buffer=ptr2 allocates dynamically */ |
|
|
1032 | eio_req *eio_utime (const char *path, double atime, double mtime, eio_cb cb); |
|
|
1033 | eio_req *eio_truncate (const char *path, off_t offset, eio_cb cb); |
|
|
1034 | eio_req *eio_chmod (const char *path, mode_t mode, eio_cb cb); |
|
|
1035 | eio_req *eio_mkdir (const char *path, mode_t mode, eio_cb cb); |
|
|
1036 | eio_req *eio_chown (const char *path, uid_t uid, gid_t gid, eio_cb cb); |
|
|
1037 | eio_req *eio_unlink (const char *path, eio_cb cb); |
|
|
1038 | eio_req *eio_rmdir (const char *path, eio_cb cb); |
|
|
1039 | eio_req *eio_readdir (const char *path, eio_cb cb); /* result=ptr2 allocated dynamically */ |
|
|
1040 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, eio_cb cb); |
|
|
1041 | eio_req *eio_busy (double delay, eio_cb cb); /* ties a thread for this long, simulating busyness */ |
|
|
1042 | eio_req *eio_nop (eio_cb cb); /* does nothing except go through the whole process */ |
|
|
1043 | void |
|
|
1044 | aio_open (SV8 *pathname, int flags, int mode, SV *callback=&PL_sv_undef) |
|
|
1045 | PROTOTYPE: $$$;$ |
|
|
1046 | PPCODE: |
|
|
1047 | { |
|
|
1048 | dREQ; |
|
|
1049 | |
|
|
1050 | req->type = EIO_OPEN; |
|
|
1051 | req->sv1 = newSVsv (pathname); |
|
|
1052 | req->ptr1 = SvPVbyte_nolen (req->sv1); |
|
|
1053 | req->int1 = flags; |
|
|
1054 | req->int2 = mode; |
|
|
1055 | |
|
|
1056 | EIO_SEND; |
|
|
1057 | } |
|
|
1058 | |
|
|
1059 | void |
|
|
1060 | aio_fsync (SV *fh, SV *callback=&PL_sv_undef) |
|
|
1061 | PROTOTYPE: $;$ |
|
|
1062 | ALIAS: |
|
|
1063 | aio_fsync = EIO_FSYNC |
|
|
1064 | aio_fdatasync = EIO_FDATASYNC |
|
|
1065 | PPCODE: |
|
|
1066 | { |
|
|
1067 | dREQ; |
|
|
1068 | |
|
|
1069 | req->type = ix; |
|
|
1070 | req->sv1 = newSVsv (fh); |
|
|
1071 | req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh))); |
|
|
1072 | |
|
|
1073 | EIO_SEND (req); |
|
|
1074 | } |
|
|
1075 | |
|
|
1076 | void |
|
|
1077 | aio_close (SV *fh, SV *callback=&PL_sv_undef) |
|
|
1078 | PROTOTYPE: $;$ |
|
|
1079 | PPCODE: |
|
|
1080 | { |
|
|
1081 | dREQ; |
|
|
1082 | |
|
|
1083 | req->type = EIO_CLOSE; |
|
|
1084 | req->sv1 = newSVsv (fh); |
|
|
1085 | req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh))); |
|
|
1086 | |
|
|
1087 | EIO_SEND (req); |
|
|
1088 | } |
|
|
1089 | |
|
|
1090 | void |
|
|
1091 | aio_read (SV *fh, SV *offset, SV *length, SV8 *data, IV dataoffset, SV *callback=&PL_sv_undef) |
|
|
1092 | ALIAS: |
|
|
1093 | aio_read = EIO_READ |
|
|
1094 | aio_write = EIO_WRITE |
|
|
1095 | PROTOTYPE: $$$$$;$ |
|
|
1096 | PPCODE: |
|
|
1097 | { |
|
|
1098 | STRLEN svlen; |
|
|
1099 | char *svptr = SvPVbyte (data, svlen); |
|
|
1100 | UV len = SvUV (length); |
|
|
1101 | |
|
|
1102 | SvUPGRADE (data, SVt_PV); |
|
|
1103 | SvPOK_on (data); |
|
|
1104 | |
|
|
1105 | if (dataoffset < 0) |
|
|
1106 | dataoffset += svlen; |
|
|
1107 | |
|
|
1108 | if (dataoffset < 0 || dataoffset > svlen) |
|
|
1109 | croak ("dataoffset outside of data scalar"); |
|
|
1110 | |
|
|
1111 | if (ix == EIO_WRITE) |
|
|
1112 | { |
|
|
1113 | /* write: check length and adjust. */ |
|
|
1114 | if (!SvOK (length) || len + dataoffset > svlen) |
|
|
1115 | len = svlen - dataoffset; |
|
|
1116 | } |
1104 | } |
1117 | else |
1105 | else |
1118 | { |
1106 | { |
1119 | /* read: grow scalar as necessary */ |
1107 | /* yay, it was a symlink - build new path in tmp2 */ |
1120 | svptr = SvGROW (data, len + dataoffset + 1); |
1108 | int rellen = strlen (rel); |
|
|
1109 | |
|
|
1110 | errno = ENAMETOOLONG; |
|
|
1111 | if (linklen + 1 + rellen >= EIO_PATH_MAX) /* also catch linklen >= EIO_PATH_MAX */ |
|
|
1112 | return -1; |
|
|
1113 | |
|
|
1114 | errno = ELOOP; |
|
|
1115 | if (!--symlinks) |
|
|
1116 | return -1; |
|
|
1117 | |
|
|
1118 | if (*tmp1 == '/') |
|
|
1119 | res = tmpbuf->ptr; /* symlink resolves to an absolute path */ |
|
|
1120 | |
|
|
1121 | /* we need to be careful, as rel might point into tmp2 already */ |
|
|
1122 | memmove (tmp2 + linklen + 1, rel, rellen + 1); |
|
|
1123 | tmp2 [linklen] = '/'; |
|
|
1124 | memcpy (tmp2, tmp1, linklen); |
|
|
1125 | |
|
|
1126 | rel = tmp2; |
1121 | } |
1127 | } |
|
|
1128 | } |
1122 | |
1129 | |
|
|
1130 | /* special case for the lone root path */ |
|
|
1131 | if (res == tmpbuf->ptr) |
|
|
1132 | *res++ = '/'; |
|
|
1133 | |
|
|
1134 | return res - (char *)tmpbuf->ptr; |
|
|
1135 | #endif |
|
|
1136 | } |
|
|
1137 | |
|
|
1138 | static signed char |
|
|
1139 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
|
|
1140 | { |
|
|
1141 | return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */ |
|
|
1142 | : a->inode < b->inode ? -1 |
|
|
1143 | : a->inode > b->inode ? 1 |
|
|
1144 | : 0; |
|
|
1145 | } |
|
|
1146 | |
|
|
1147 | #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0 |
|
|
1148 | |
|
|
1149 | #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */ |
|
|
1150 | #define EIO_SORT_FAST 60 /* when to only use insertion sort */ |
|
|
1151 | |
|
|
1152 | static void |
|
|
1153 | eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, eio_ino_t inode_bits) |
|
|
1154 | { |
|
|
1155 | unsigned char bits [9 + sizeof (eio_ino_t) * 8]; |
|
|
1156 | unsigned char *bit = bits; |
|
|
1157 | |
|
|
1158 | assert (CHAR_BIT == 8); |
|
|
1159 | assert (sizeof (eio_dirent) * 8 < 256); |
|
|
1160 | assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */ |
|
|
1161 | assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */ |
|
|
1162 | |
|
|
1163 | if (size <= EIO_SORT_FAST) |
|
|
1164 | return; |
|
|
1165 | |
|
|
1166 | /* first prepare an array of bits to test in our radix sort */ |
|
|
1167 | /* try to take endianness into account, as well as differences in eio_ino_t sizes */ |
|
|
1168 | /* inode_bits must contain all inodes ORed together */ |
|
|
1169 | /* which is used to skip bits that are 0 everywhere, which is very common */ |
|
|
1170 | { |
|
|
1171 | eio_ino_t endianness; |
|
|
1172 | int i, j; |
|
|
1173 | |
|
|
1174 | /* we store the byte offset of byte n into byte n of "endianness" */ |
|
|
1175 | for (i = 0; i < sizeof (eio_ino_t); ++i) |
|
|
1176 | ((unsigned char *)&endianness)[i] = i; |
|
|
1177 | |
|
|
1178 | *bit++ = 0; |
|
|
1179 | |
|
|
1180 | for (i = 0; i < sizeof (eio_ino_t); ++i) |
|
|
1181 | { |
|
|
1182 | /* shifting off the byte offsets out of "endianness" */ |
|
|
1183 | int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8; |
|
|
1184 | endianness >>= 8; |
|
|
1185 | |
|
|
1186 | for (j = 0; j < 8; ++j) |
|
|
1187 | if (inode_bits & (((eio_ino_t)1) << (i * 8 + j))) |
|
|
1188 | *bit++ = offs + j; |
|
|
1189 | } |
|
|
1190 | |
|
|
1191 | for (j = 0; j < 8; ++j) |
|
|
1192 | if (score_bits & (1 << j)) |
|
|
1193 | *bit++ = offsetof (eio_dirent, score) * 8 + j; |
|
|
1194 | } |
|
|
1195 | |
|
|
1196 | /* now actually do the sorting (a variant of MSD radix sort) */ |
|
|
1197 | { |
|
|
1198 | eio_dirent *base_stk [9 + sizeof (eio_ino_t) * 8], *base; |
|
|
1199 | eio_dirent *end_stk [9 + sizeof (eio_ino_t) * 8], *end; |
|
|
1200 | unsigned char *bit_stk [9 + sizeof (eio_ino_t) * 8]; |
|
|
1201 | int stk_idx = 0; |
|
|
1202 | |
|
|
1203 | base_stk [stk_idx] = dents; |
|
|
1204 | end_stk [stk_idx] = dents + size; |
|
|
1205 | bit_stk [stk_idx] = bit - 1; |
|
|
1206 | |
|
|
1207 | do |
|
|
1208 | { |
|
|
1209 | base = base_stk [stk_idx]; |
|
|
1210 | end = end_stk [stk_idx]; |
|
|
1211 | bit = bit_stk [stk_idx]; |
|
|
1212 | |
|
|
1213 | for (;;) |
|
|
1214 | { |
|
|
1215 | unsigned char O = *bit >> 3; |
|
|
1216 | unsigned char M = 1 << (*bit & 7); |
|
|
1217 | |
|
|
1218 | eio_dirent *a = base; |
|
|
1219 | eio_dirent *b = end; |
|
|
1220 | |
|
|
1221 | if (b - a < EIO_SORT_CUTOFF) |
|
|
1222 | break; |
|
|
1223 | |
|
|
1224 | /* now bit-partition the array on the bit */ |
|
|
1225 | /* this ugly asymmetric loop seems to perform much better than typical */ |
|
|
1226 | /* partition algos found in the literature */ |
|
|
1227 | do |
|
|
1228 | if (!(((unsigned char *)a)[O] & M)) |
|
|
1229 | ++a; |
|
|
1230 | else if (!(((unsigned char *)--b)[O] & M)) |
|
|
1231 | { |
|
|
1232 | eio_dirent tmp = *a; *a = *b; *b = tmp; |
|
|
1233 | ++a; |
|
|
1234 | } |
|
|
1235 | while (b > a); |
|
|
1236 | |
|
|
1237 | /* next bit, or stop, if no bits left in this path */ |
|
|
1238 | if (!*--bit) |
|
|
1239 | break; |
|
|
1240 | |
|
|
1241 | base_stk [stk_idx] = a; |
|
|
1242 | end_stk [stk_idx] = end; |
|
|
1243 | bit_stk [stk_idx] = bit; |
|
|
1244 | ++stk_idx; |
|
|
1245 | |
|
|
1246 | end = a; |
|
|
1247 | } |
|
|
1248 | } |
|
|
1249 | while (stk_idx--); |
|
|
1250 | } |
|
|
1251 | } |
|
|
1252 | |
|
|
1253 | static void |
|
|
1254 | eio_dent_insertion_sort (eio_dirent *dents, int size) |
|
|
1255 | { |
|
|
1256 | /* first move the smallest element to the front, to act as a sentinel */ |
|
|
1257 | { |
|
|
1258 | int i; |
|
|
1259 | eio_dirent *min = dents; |
|
|
1260 | |
|
|
1261 | /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */ |
|
|
1262 | for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; ) |
|
|
1263 | if (EIO_DENT_CMP (dents [i], <, *min)) |
|
|
1264 | min = &dents [i]; |
|
|
1265 | |
|
|
1266 | /* swap elements 0 and j (minimum) */ |
|
|
1267 | { |
|
|
1268 | eio_dirent tmp = *dents; *dents = *min; *min = tmp; |
|
|
1269 | } |
|
|
1270 | } |
|
|
1271 | |
|
|
1272 | /* then do standard insertion sort, assuming that all elements are >= dents [0] */ |
|
|
1273 | { |
|
|
1274 | eio_dirent *i, *j; |
|
|
1275 | |
|
|
1276 | for (i = dents + 1; i < dents + size; ++i) |
|
|
1277 | { |
|
|
1278 | eio_dirent value = *i; |
|
|
1279 | |
|
|
1280 | for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j) |
|
|
1281 | j [1] = j [0]; |
|
|
1282 | |
|
|
1283 | j [1] = value; |
|
|
1284 | } |
|
|
1285 | } |
|
|
1286 | } |
|
|
1287 | |
|
|
1288 | static void |
|
|
1289 | eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, eio_ino_t inode_bits) |
|
|
1290 | { |
|
|
1291 | if (size <= 1) |
|
|
1292 | return; /* our insertion sort relies on size > 0 */ |
|
|
1293 | |
|
|
1294 | /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */ |
|
|
1295 | /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */ |
|
|
1296 | eio_dent_radix_sort (dents, size, score_bits, inode_bits); |
|
|
1297 | |
|
|
1298 | /* use an insertion sort at the end, or for small arrays, */ |
|
|
1299 | /* as insertion sort is more efficient for small partitions */ |
|
|
1300 | eio_dent_insertion_sort (dents, size); |
|
|
1301 | } |
|
|
1302 | |
|
|
1303 | /* read a full directory */ |
|
|
1304 | static void |
|
|
1305 | eio__scandir (eio_req *req, etp_worker *self) |
|
|
1306 | { |
|
|
1307 | char *name, *names; |
|
|
1308 | int namesalloc = 4096 - sizeof (void *) * 4; |
|
|
1309 | int namesoffs = 0; |
|
|
1310 | int flags = req->int1; |
|
|
1311 | eio_dirent *dents = 0; |
|
|
1312 | int dentalloc = 128; |
|
|
1313 | int dentoffs = 0; |
|
|
1314 | eio_ino_t inode_bits = 0; |
|
|
1315 | #ifdef _WIN32 |
|
|
1316 | HANDLE dirp; |
|
|
1317 | WIN32_FIND_DATA entp; |
|
|
1318 | #else |
|
|
1319 | DIR *dirp; |
|
|
1320 | EIO_STRUCT_DIRENT *entp; |
|
|
1321 | #endif |
|
|
1322 | |
|
|
1323 | req->result = -1; |
|
|
1324 | |
|
|
1325 | if (!(flags & EIO_READDIR_DENTS)) |
|
|
1326 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
|
|
1327 | |
|
|
1328 | #ifdef _WIN32 |
|
|
1329 | { |
|
|
1330 | int len = strlen ((const char *)req->ptr1); |
|
|
1331 | char *path = malloc (MAX_PATH); |
|
|
1332 | const char *fmt; |
|
|
1333 | const char *reqpath = wd_expand (&self->tmpbuf, req->wd, req->ptr1); |
|
|
1334 | |
|
|
1335 | if (!len) |
|
|
1336 | fmt = "./*"; |
|
|
1337 | else if (reqpath[len - 1] == '/' || reqpath[len - 1] == '\\') |
|
|
1338 | fmt = "%s*"; |
|
|
1339 | else |
|
|
1340 | fmt = "%s/*"; |
|
|
1341 | |
|
|
1342 | _snprintf (path, MAX_PATH, fmt, reqpath); |
|
|
1343 | dirp = FindFirstFile (path, &entp); |
|
|
1344 | free (path); |
|
|
1345 | |
|
|
1346 | if (dirp == INVALID_HANDLE_VALUE) |
|
|
1347 | { |
|
|
1348 | /* should steal _dosmaperr */ |
|
|
1349 | switch (GetLastError ()) |
|
|
1350 | { |
|
|
1351 | case ERROR_FILE_NOT_FOUND: |
|
|
1352 | req->result = 0; |
|
|
1353 | break; |
|
|
1354 | |
|
|
1355 | case ERROR_INVALID_NAME: |
|
|
1356 | case ERROR_PATH_NOT_FOUND: |
|
|
1357 | case ERROR_NO_MORE_FILES: |
|
|
1358 | errno = ENOENT; |
|
|
1359 | break; |
|
|
1360 | |
|
|
1361 | case ERROR_NOT_ENOUGH_MEMORY: |
|
|
1362 | errno = ENOMEM; |
|
|
1363 | break; |
|
|
1364 | |
|
|
1365 | default: |
|
|
1366 | errno = EINVAL; |
|
|
1367 | break; |
|
|
1368 | } |
|
|
1369 | |
|
|
1370 | return; |
|
|
1371 | } |
|
|
1372 | } |
|
|
1373 | #else |
|
|
1374 | #if HAVE_AT |
|
|
1375 | if (req->wd) |
|
|
1376 | { |
|
|
1377 | int fd = openat (WD2FD (req->wd), req->ptr1, O_CLOEXEC | O_SEARCH | O_DIRECTORY); |
|
|
1378 | |
1123 | if (len < 0) |
1379 | if (fd < 0) |
1124 | croak ("length must not be negative"); |
1380 | return; |
1125 | |
1381 | |
|
|
1382 | dirp = fdopendir (fd); |
|
|
1383 | |
|
|
1384 | if (!dirp) |
|
|
1385 | close (fd); |
|
|
1386 | } |
|
|
1387 | else |
|
|
1388 | dirp = opendir (req->ptr1); |
|
|
1389 | #else |
|
|
1390 | dirp = opendir (wd_expand (&self->tmpbuf, req->wd, req->ptr1)); |
|
|
1391 | #endif |
|
|
1392 | |
|
|
1393 | if (!dirp) |
|
|
1394 | return; |
|
|
1395 | #endif |
|
|
1396 | |
|
|
1397 | if (req->flags & EIO_FLAG_PTR1_FREE) |
|
|
1398 | free (req->ptr1); |
|
|
1399 | |
|
|
1400 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
|
|
1401 | req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
|
|
1402 | req->ptr2 = names = malloc (namesalloc); |
|
|
1403 | |
|
|
1404 | if (!names || (flags && !dents)) |
|
|
1405 | return; |
|
|
1406 | |
|
|
1407 | for (;;) |
|
|
1408 | { |
|
|
1409 | int done; |
|
|
1410 | |
|
|
1411 | #ifdef _WIN32 |
|
|
1412 | done = !dirp; |
|
|
1413 | #else |
|
|
1414 | errno = 0; |
|
|
1415 | entp = readdir (dirp); |
|
|
1416 | done = !entp; |
|
|
1417 | #endif |
|
|
1418 | |
|
|
1419 | if (done) |
1126 | { |
1420 | { |
1127 | dREQ; |
1421 | #ifndef _WIN32 |
|
|
1422 | int old_errno = errno; |
|
|
1423 | closedir (dirp); |
|
|
1424 | errno = old_errno; |
1128 | |
1425 | |
1129 | req->type = ix; |
1426 | if (errno) |
1130 | req->sv1 = newSVsv (fh); |
1427 | break; |
1131 | req->int1 = PerlIO_fileno (ix == EIO_READ ? IoIFP (sv_2io (fh)) |
1428 | #endif |
1132 | : IoOFP (sv_2io (fh))); |
|
|
1133 | req->offs = SvOK (offset) ? SvVAL64 (offset) : -1; |
|
|
1134 | req->size = len; |
|
|
1135 | req->sv2 = SvREFCNT_inc (data); |
|
|
1136 | req->ptr2 = (char *)svptr + dataoffset; |
|
|
1137 | req->stroffset = dataoffset; |
|
|
1138 | |
1429 | |
1139 | if (!SvREADONLY (data)) |
1430 | /* sort etc. */ |
|
|
1431 | req->int1 = flags; |
|
|
1432 | req->result = dentoffs; |
|
|
1433 | |
|
|
1434 | if (flags & EIO_READDIR_STAT_ORDER) |
|
|
1435 | eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits); |
|
|
1436 | else if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1437 | if (flags & EIO_READDIR_FOUND_UNKNOWN) |
|
|
1438 | eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */ |
|
|
1439 | else |
|
|
1440 | { |
|
|
1441 | /* in this case, all is known, and we just put dirs first and sort them */ |
|
|
1442 | eio_dirent *oth = dents + dentoffs; |
|
|
1443 | eio_dirent *dir = dents; |
|
|
1444 | |
|
|
1445 | /* now partition dirs to the front, and non-dirs to the back */ |
|
|
1446 | /* by walking from both sides and swapping if necessary */ |
|
|
1447 | while (oth > dir) |
|
|
1448 | { |
|
|
1449 | if (dir->type == EIO_DT_DIR) |
|
|
1450 | ++dir; |
|
|
1451 | else if ((--oth)->type == EIO_DT_DIR) |
|
|
1452 | { |
|
|
1453 | eio_dirent tmp = *dir; *dir = *oth; *oth = tmp; |
|
|
1454 | |
|
|
1455 | ++dir; |
|
|
1456 | } |
|
|
1457 | } |
|
|
1458 | |
|
|
1459 | /* now sort the dirs only (dirs all have the same score) */ |
|
|
1460 | eio_dent_sort (dents, dir - dents, 0, inode_bits); |
|
|
1461 | } |
|
|
1462 | |
|
|
1463 | break; |
|
|
1464 | } |
|
|
1465 | |
|
|
1466 | /* now add the entry to our list(s) */ |
|
|
1467 | name = D_NAME (entp); |
|
|
1468 | |
|
|
1469 | /* skip . and .. entries */ |
|
|
1470 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
|
|
1471 | { |
|
|
1472 | int len = D_NAMLEN (entp) + 1; |
|
|
1473 | |
|
|
1474 | while (ecb_expect_false (namesoffs + len > namesalloc)) |
1140 | { |
1475 | { |
1141 | SvREADONLY_on (data); |
1476 | namesalloc *= 2; |
1142 | req->flags |= FLAG_SV2_RO_OFF; |
1477 | req->ptr2 = names = realloc (names, namesalloc); |
|
|
1478 | |
|
|
1479 | if (!names) |
|
|
1480 | break; |
1143 | } |
1481 | } |
1144 | |
1482 | |
1145 | EIO_SEND; |
1483 | memcpy (names + namesoffs, name, len); |
|
|
1484 | |
|
|
1485 | if (dents) |
|
|
1486 | { |
|
|
1487 | struct eio_dirent *ent; |
|
|
1488 | |
|
|
1489 | if (ecb_expect_false (dentoffs == dentalloc)) |
|
|
1490 | { |
|
|
1491 | dentalloc *= 2; |
|
|
1492 | req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
|
|
1493 | |
|
|
1494 | if (!dents) |
|
|
1495 | break; |
|
|
1496 | } |
|
|
1497 | |
|
|
1498 | ent = dents + dentoffs; |
|
|
1499 | |
|
|
1500 | ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */ |
|
|
1501 | ent->namelen = len - 1; |
|
|
1502 | ent->inode = D_INO (entp); |
|
|
1503 | |
|
|
1504 | inode_bits |= ent->inode; |
|
|
1505 | |
|
|
1506 | switch (D_TYPE (entp)) |
|
|
1507 | { |
|
|
1508 | default: |
|
|
1509 | ent->type = EIO_DT_UNKNOWN; |
|
|
1510 | flags |= EIO_READDIR_FOUND_UNKNOWN; |
|
|
1511 | break; |
|
|
1512 | |
|
|
1513 | #ifdef DT_FIFO |
|
|
1514 | case DT_FIFO: ent->type = EIO_DT_FIFO; break; |
|
|
1515 | #endif |
|
|
1516 | #ifdef DT_CHR |
|
|
1517 | case DT_CHR: ent->type = EIO_DT_CHR; break; |
|
|
1518 | #endif |
|
|
1519 | #ifdef DT_MPC |
|
|
1520 | case DT_MPC: ent->type = EIO_DT_MPC; break; |
|
|
1521 | #endif |
|
|
1522 | #ifdef DT_DIR |
|
|
1523 | case DT_DIR: ent->type = EIO_DT_DIR; break; |
|
|
1524 | #endif |
|
|
1525 | #ifdef DT_NAM |
|
|
1526 | case DT_NAM: ent->type = EIO_DT_NAM; break; |
|
|
1527 | #endif |
|
|
1528 | #ifdef DT_BLK |
|
|
1529 | case DT_BLK: ent->type = EIO_DT_BLK; break; |
|
|
1530 | #endif |
|
|
1531 | #ifdef DT_MPB |
|
|
1532 | case DT_MPB: ent->type = EIO_DT_MPB; break; |
|
|
1533 | #endif |
|
|
1534 | #ifdef DT_REG |
|
|
1535 | case DT_REG: ent->type = EIO_DT_REG; break; |
|
|
1536 | #endif |
|
|
1537 | #ifdef DT_NWK |
|
|
1538 | case DT_NWK: ent->type = EIO_DT_NWK; break; |
|
|
1539 | #endif |
|
|
1540 | #ifdef DT_CMP |
|
|
1541 | case DT_CMP: ent->type = EIO_DT_CMP; break; |
|
|
1542 | #endif |
|
|
1543 | #ifdef DT_LNK |
|
|
1544 | case DT_LNK: ent->type = EIO_DT_LNK; break; |
|
|
1545 | #endif |
|
|
1546 | #ifdef DT_SOCK |
|
|
1547 | case DT_SOCK: ent->type = EIO_DT_SOCK; break; |
|
|
1548 | #endif |
|
|
1549 | #ifdef DT_DOOR |
|
|
1550 | case DT_DOOR: ent->type = EIO_DT_DOOR; break; |
|
|
1551 | #endif |
|
|
1552 | #ifdef DT_WHT |
|
|
1553 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
|
|
1554 | #endif |
|
|
1555 | } |
|
|
1556 | |
|
|
1557 | ent->score = 7; |
|
|
1558 | |
|
|
1559 | if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1560 | { |
|
|
1561 | if (ent->type == EIO_DT_UNKNOWN) |
|
|
1562 | { |
|
|
1563 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
|
|
1564 | ent->score = 1; |
|
|
1565 | else if (!strchr (name, '.')) /* absence of dots indicate likely dirs */ |
|
|
1566 | ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */ |
|
|
1567 | } |
|
|
1568 | else if (ent->type == EIO_DT_DIR) |
|
|
1569 | ent->score = 0; |
|
|
1570 | } |
|
|
1571 | } |
|
|
1572 | |
|
|
1573 | namesoffs += len; |
|
|
1574 | ++dentoffs; |
1146 | } |
1575 | } |
|
|
1576 | |
|
|
1577 | if (EIO_CANCELLED (req)) |
|
|
1578 | { |
|
|
1579 | errno = ECANCELED; |
|
|
1580 | break; |
|
|
1581 | } |
|
|
1582 | |
|
|
1583 | #ifdef _WIN32 |
|
|
1584 | if (!FindNextFile (dirp, &entp)) |
|
|
1585 | { |
|
|
1586 | FindClose (dirp); |
|
|
1587 | dirp = 0; |
|
|
1588 | } |
|
|
1589 | #endif |
|
|
1590 | } |
|
|
1591 | } |
|
|
1592 | |
|
|
1593 | /*****************************************************************************/ |
|
|
1594 | /* working directory stuff */ |
|
|
1595 | /* various deficiencies in the posix 2008 api force us to */ |
|
|
1596 | /* keep the absolute path in string form at all times */ |
|
|
1597 | /* fuck yeah. */ |
|
|
1598 | |
|
|
1599 | #if !HAVE_AT |
|
|
1600 | |
|
|
1601 | /* a bit like realpath, but usually faster because it doesn'T have to return */ |
|
|
1602 | /* an absolute or canonical path */ |
|
|
1603 | static const char * |
|
|
1604 | wd_expand (struct etp_tmpbuf *tmpbuf, eio_wd wd, const char *path) |
|
|
1605 | { |
|
|
1606 | if (!wd || *path == '/') |
|
|
1607 | return path; |
|
|
1608 | |
|
|
1609 | if (path [0] == '.' && !path [1]) |
|
|
1610 | return wd->str; |
|
|
1611 | |
|
|
1612 | { |
|
|
1613 | int l1 = wd->len; |
|
|
1614 | int l2 = strlen (path); |
|
|
1615 | |
|
|
1616 | char *res = etp_tmpbuf_get (tmpbuf, l1 + l2 + 2); |
|
|
1617 | |
|
|
1618 | memcpy (res, wd->str, l1); |
|
|
1619 | res [l1] = '/'; |
|
|
1620 | memcpy (res + l1 + 1, path, l2 + 1); |
|
|
1621 | |
|
|
1622 | return res; |
|
|
1623 | } |
|
|
1624 | } |
|
|
1625 | |
|
|
1626 | #endif |
|
|
1627 | |
|
|
1628 | static eio_wd |
|
|
1629 | eio__wd_open_sync (struct etp_tmpbuf *tmpbuf, eio_wd wd, const char *path) |
|
|
1630 | { |
|
|
1631 | int fd; |
|
|
1632 | eio_wd res; |
|
|
1633 | int len = eio__realpath (tmpbuf, wd, path); |
|
|
1634 | |
|
|
1635 | if (len < 0) |
|
|
1636 | return EIO_INVALID_WD; |
|
|
1637 | |
|
|
1638 | #if HAVE_AT |
|
|
1639 | fd = openat (WD2FD (wd), path, O_CLOEXEC | O_SEARCH | O_DIRECTORY); |
|
|
1640 | |
|
|
1641 | if (fd < 0) |
|
|
1642 | return EIO_INVALID_WD; |
|
|
1643 | #endif |
|
|
1644 | |
|
|
1645 | res = malloc (sizeof (*res) + len); /* one extra 0-byte */ |
|
|
1646 | |
|
|
1647 | #if HAVE_AT |
|
|
1648 | res->fd = fd; |
|
|
1649 | #endif |
|
|
1650 | |
|
|
1651 | res->len = len; |
|
|
1652 | memcpy (res->str, tmpbuf->ptr, len); |
|
|
1653 | res->str [len] = 0; |
|
|
1654 | |
|
|
1655 | return res; |
|
|
1656 | } |
|
|
1657 | |
|
|
1658 | eio_wd |
|
|
1659 | eio_wd_open_sync (eio_wd wd, const char *path) |
|
|
1660 | { |
|
|
1661 | struct etp_tmpbuf tmpbuf = { }; |
|
|
1662 | wd = eio__wd_open_sync (&tmpbuf, wd, path); |
|
|
1663 | free (tmpbuf.ptr); |
|
|
1664 | |
|
|
1665 | return wd; |
1147 | } |
1666 | } |
1148 | |
1667 | |
1149 | void |
1668 | void |
1150 | aio_readlink (SV8 *path, SV *callback=&PL_sv_undef) |
1669 | eio_wd_close_sync (eio_wd wd) |
1151 | PROTOTYPE: $$;$ |
|
|
1152 | PPCODE: |
|
|
1153 | { |
1670 | { |
1154 | SV *data; |
1671 | if (wd != EIO_INVALID_WD && wd != EIO_CWD) |
1155 | dREQ; |
1672 | { |
1156 | |
1673 | #if HAVE_AT |
1157 | data = newSV (NAME_MAX); |
1674 | close (wd->fd); |
1158 | SvPOK_on (data); |
1675 | #endif |
1159 | |
1676 | free (wd); |
1160 | req->type = EIO_READLINK; |
1677 | } |
1161 | req->sv1 = newSVsv (path); |
|
|
1162 | req->ptr1 = SvPVbyte_nolen (req->sv1); |
|
|
1163 | req->sv2 = data; |
|
|
1164 | req->ptr2 = SvPVbyte_nolen (data); |
|
|
1165 | |
|
|
1166 | EIO_SEND; |
|
|
1167 | } |
1678 | } |
|
|
1679 | |
|
|
1680 | #if HAVE_AT |
|
|
1681 | |
|
|
1682 | /* they forgot these */ |
|
|
1683 | |
|
|
1684 | static int |
|
|
1685 | eio__truncateat (int dirfd, const char *path, off_t length) |
|
|
1686 | { |
|
|
1687 | int fd = openat (dirfd, path, O_WRONLY | O_CLOEXEC); |
|
|
1688 | int res; |
|
|
1689 | |
|
|
1690 | if (fd < 0) |
|
|
1691 | return fd; |
|
|
1692 | |
|
|
1693 | res = ftruncate (fd, length); |
|
|
1694 | close (fd); |
|
|
1695 | return res; |
|
|
1696 | } |
|
|
1697 | |
|
|
1698 | static int |
|
|
1699 | eio__statvfsat (int dirfd, const char *path, struct statvfs *buf) |
|
|
1700 | { |
|
|
1701 | int fd = openat (dirfd, path, O_SEARCH | O_CLOEXEC); |
|
|
1702 | int res; |
|
|
1703 | |
|
|
1704 | if (fd < 0) |
|
|
1705 | return fd; |
|
|
1706 | |
|
|
1707 | res = fstatvfs (fd, buf); |
|
|
1708 | close (fd); |
|
|
1709 | return res; |
|
|
1710 | |
|
|
1711 | } |
|
|
1712 | |
|
|
1713 | #endif |
|
|
1714 | |
|
|
1715 | /*****************************************************************************/ |
|
|
1716 | |
|
|
1717 | #define ALLOC(len) \ |
|
|
1718 | if (!req->ptr2) \ |
|
|
1719 | { \ |
|
|
1720 | X_LOCK (EIO_POOL->wrklock); \ |
|
|
1721 | req->flags |= EIO_FLAG_PTR2_FREE; \ |
|
|
1722 | X_UNLOCK (EIO_POOL->wrklock); \ |
|
|
1723 | req->ptr2 = malloc (len); \ |
|
|
1724 | if (!req->ptr2) \ |
|
|
1725 | { \ |
|
|
1726 | errno = ENOMEM; \ |
|
|
1727 | req->result = -1; \ |
|
|
1728 | break; \ |
|
|
1729 | } \ |
|
|
1730 | } |
|
|
1731 | |
|
|
1732 | /*****************************************************************************/ |
|
|
1733 | |
|
|
1734 | int ecb_cold |
|
|
1735 | eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
|
|
1736 | { |
|
|
1737 | eio_want_poll_cb = want_poll; |
|
|
1738 | eio_done_poll_cb = done_poll; |
|
|
1739 | |
|
|
1740 | return etp_init (EIO_POOL, 0, 0, 0); |
|
|
1741 | } |
|
|
1742 | |
|
|
1743 | ecb_inline void |
|
|
1744 | eio_api_destroy (eio_req *req) |
|
|
1745 | { |
|
|
1746 | free (req); |
|
|
1747 | } |
|
|
1748 | |
|
|
1749 | #define REQ(rtype) \ |
|
|
1750 | eio_req *req; \ |
|
|
1751 | \ |
|
|
1752 | req = (eio_req *)calloc (1, sizeof *req); \ |
|
|
1753 | if (!req) \ |
|
|
1754 | return 0; \ |
|
|
1755 | \ |
|
|
1756 | req->type = rtype; \ |
|
|
1757 | req->pri = pri; \ |
|
|
1758 | req->finish = cb; \ |
|
|
1759 | req->data = data; \ |
|
|
1760 | req->destroy = eio_api_destroy; |
|
|
1761 | |
|
|
1762 | #define SEND eio_submit (req); return req |
|
|
1763 | |
|
|
1764 | #define PATH \ |
|
|
1765 | req->flags |= EIO_FLAG_PTR1_FREE; \ |
|
|
1766 | req->ptr1 = strdup (path); \ |
|
|
1767 | if (!req->ptr1) \ |
|
|
1768 | { \ |
|
|
1769 | eio_api_destroy (req); \ |
|
|
1770 | return 0; \ |
|
|
1771 | } |
|
|
1772 | |
|
|
1773 | #define SINGLEDOT(ptr) (0[(char *)(ptr)] == '.' && !1[(char *)(ptr)]) |
|
|
1774 | |
|
|
1775 | static void |
|
|
1776 | eio_execute (etp_worker *self, eio_req *req) |
|
|
1777 | { |
|
|
1778 | #if HAVE_AT |
|
|
1779 | int dirfd; |
|
|
1780 | #else |
|
|
1781 | const char *path; |
|
|
1782 | #endif |
|
|
1783 | |
|
|
1784 | if (ecb_expect_false (EIO_CANCELLED (req))) |
|
|
1785 | { |
|
|
1786 | req->result = -1; |
|
|
1787 | req->errorno = ECANCELED; |
|
|
1788 | return; |
|
|
1789 | } |
|
|
1790 | |
|
|
1791 | if (ecb_expect_false (req->wd == EIO_INVALID_WD)) |
|
|
1792 | { |
|
|
1793 | req->result = -1; |
|
|
1794 | req->errorno = ENOENT; |
|
|
1795 | return; |
|
|
1796 | } |
|
|
1797 | |
|
|
1798 | if (req->type >= EIO_OPEN) |
|
|
1799 | { |
|
|
1800 | #if HAVE_AT |
|
|
1801 | dirfd = WD2FD (req->wd); |
|
|
1802 | #else |
|
|
1803 | path = wd_expand (&self->tmpbuf, req->wd, req->ptr1); |
|
|
1804 | #endif |
|
|
1805 | } |
|
|
1806 | |
|
|
1807 | switch (req->type) |
|
|
1808 | { |
|
|
1809 | case EIO_WD_OPEN: req->wd = eio__wd_open_sync (&self->tmpbuf, req->wd, req->ptr1); |
|
|
1810 | req->result = req->wd == EIO_INVALID_WD ? -1 : 0; |
|
|
1811 | break; |
|
|
1812 | case EIO_WD_CLOSE: req->result = 0; |
|
|
1813 | eio_wd_close_sync (req->wd); break; |
|
|
1814 | |
|
|
1815 | case EIO_SEEK: eio__lseek (req); break; |
|
|
1816 | case EIO_READ: ALLOC (req->size); |
|
|
1817 | req->result = req->offs >= 0 |
|
|
1818 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
|
|
1819 | : read (req->int1, req->ptr2, req->size); break; |
|
|
1820 | case EIO_WRITE: req->result = req->offs >= 0 |
|
|
1821 | ? pwrite (req->int1, req->ptr2, req->size, req->offs) |
|
|
1822 | : write (req->int1, req->ptr2, req->size); break; |
|
|
1823 | |
|
|
1824 | case EIO_FCNTL: req->result = fcntl (req->int1, (int) req->int2, req->ptr2); break; |
|
|
1825 | case EIO_IOCTL: req->result = ioctl (req->int1, (unsigned long)req->int2, req->ptr2); break; |
|
|
1826 | |
|
|
1827 | case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break; |
|
|
1828 | case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size); break; |
|
|
1829 | |
|
|
1830 | #if HAVE_AT |
|
|
1831 | |
|
|
1832 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1833 | req->result = fstatat (dirfd, req->ptr1, (EIO_STRUCT_STAT *)req->ptr2, 0); break; |
|
|
1834 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1835 | req->result = fstatat (dirfd, req->ptr1, (EIO_STRUCT_STAT *)req->ptr2, AT_SYMLINK_NOFOLLOW); break; |
|
|
1836 | case EIO_CHOWN: req->result = fchownat (dirfd, req->ptr1, req->int2, req->int3, 0); break; |
|
|
1837 | case EIO_CHMOD: req->result = fchmodat (dirfd, req->ptr1, (mode_t)req->int2, 0); break; |
|
|
1838 | case EIO_TRUNCATE: req->result = eio__truncateat (dirfd, req->ptr1, req->offs); break; |
|
|
1839 | case EIO_OPEN: req->result = openat (dirfd, req->ptr1, req->int1, (mode_t)req->int2); break; |
|
|
1840 | |
|
|
1841 | case EIO_UNLINK: req->result = unlinkat (dirfd, req->ptr1, 0); break; |
|
|
1842 | case EIO_RMDIR: /* complications arise because "." cannot be removed, so we might have to expand */ |
|
|
1843 | req->result = req->wd && SINGLEDOT (req->ptr1) |
|
|
1844 | ? rmdir (req->wd->str) |
|
|
1845 | : unlinkat (dirfd, req->ptr1, AT_REMOVEDIR); break; |
|
|
1846 | case EIO_MKDIR: req->result = mkdirat (dirfd, req->ptr1, (mode_t)req->int2); break; |
|
|
1847 | case EIO_RENAME: /* complications arise because "." cannot be renamed, so we might have to expand */ |
|
|
1848 | req->result = req->wd && SINGLEDOT (req->ptr1) |
|
|
1849 | ? rename (req->wd->str, req->ptr2) |
|
|
1850 | : renameat (dirfd, req->ptr1, WD2FD ((eio_wd)req->int3), req->ptr2); break; |
|
|
1851 | case EIO_LINK: req->result = linkat (dirfd, req->ptr1, WD2FD ((eio_wd)req->int3), req->ptr2, 0); break; |
|
|
1852 | case EIO_SYMLINK: req->result = symlinkat (req->ptr1, dirfd, req->ptr2); break; |
|
|
1853 | case EIO_MKNOD: req->result = mknodat (dirfd, req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
|
|
1854 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1855 | req->result = eio__statvfsat (dirfd, req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1856 | case EIO_READLINK: ALLOC (EIO_PATH_MAX); |
|
|
1857 | req->result = readlinkat (dirfd, req->ptr1, req->ptr2, EIO_PATH_MAX); |
|
|
1858 | if (req->result == EIO_PATH_MAX) |
|
|
1859 | { |
|
|
1860 | req->result = -1; |
|
|
1861 | errno = ENAMETOOLONG; |
|
|
1862 | } |
|
|
1863 | break; |
|
|
1864 | case EIO_UTIME: |
|
|
1865 | case EIO_FUTIME: |
|
|
1866 | { |
|
|
1867 | struct timespec ts[2]; |
|
|
1868 | struct timespec *times; |
|
|
1869 | |
|
|
1870 | if (req->nv1 != -1. || req->nv2 != -1.) |
|
|
1871 | { |
|
|
1872 | ts[0].tv_sec = req->nv1; |
|
|
1873 | ts[0].tv_nsec = (req->nv1 - ts[0].tv_sec) * 1e9; |
|
|
1874 | ts[1].tv_sec = req->nv2; |
|
|
1875 | ts[1].tv_nsec = (req->nv2 - ts[1].tv_sec) * 1e9; |
|
|
1876 | |
|
|
1877 | times = ts; |
|
|
1878 | } |
|
|
1879 | else |
|
|
1880 | times = 0; |
|
|
1881 | |
|
|
1882 | req->result = req->type == EIO_FUTIME |
|
|
1883 | ? futimens (req->int1, times) |
|
|
1884 | : utimensat (dirfd, req->ptr1, times, 0); |
|
|
1885 | } |
|
|
1886 | break; |
|
|
1887 | |
|
|
1888 | #else |
|
|
1889 | |
|
|
1890 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1891 | req->result = stat (path , (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1892 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1893 | req->result = lstat (path , (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1894 | case EIO_CHOWN: req->result = chown (path , req->int2, req->int3); break; |
|
|
1895 | case EIO_CHMOD: req->result = chmod (path , (mode_t)req->int2); break; |
|
|
1896 | case EIO_TRUNCATE: req->result = truncate (path , req->offs); break; |
|
|
1897 | case EIO_OPEN: req->result = open (path , req->int1, (mode_t)req->int2); break; |
|
|
1898 | |
|
|
1899 | case EIO_UNLINK: req->result = unlink (path ); break; |
|
|
1900 | case EIO_RMDIR: req->result = rmdir (path ); break; |
|
|
1901 | case EIO_MKDIR: req->result = mkdir (path , (mode_t)req->int2); break; |
|
|
1902 | case EIO_RENAME: req->result = rename (path , req->ptr2); break; |
|
|
1903 | case EIO_LINK: req->result = link (path , req->ptr2); break; |
|
|
1904 | case EIO_SYMLINK: req->result = symlink (path , req->ptr2); break; |
|
|
1905 | case EIO_MKNOD: req->result = mknod (path , (mode_t)req->int2, (dev_t)req->offs); break; |
|
|
1906 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1907 | req->result = statvfs (path , (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1908 | case EIO_READLINK: ALLOC (EIO_PATH_MAX); |
|
|
1909 | req->result = readlink (path, req->ptr2, EIO_PATH_MAX); |
|
|
1910 | if (req->result == EIO_PATH_MAX) |
|
|
1911 | { |
|
|
1912 | req->result = -1; |
|
|
1913 | errno = ENAMETOOLONG; |
|
|
1914 | } |
|
|
1915 | break; |
|
|
1916 | |
|
|
1917 | case EIO_UTIME: |
|
|
1918 | case EIO_FUTIME: |
|
|
1919 | { |
|
|
1920 | struct timeval tv[2]; |
|
|
1921 | struct timeval *times; |
|
|
1922 | |
|
|
1923 | if (req->nv1 != -1. || req->nv2 != -1.) |
|
|
1924 | { |
|
|
1925 | tv[0].tv_sec = req->nv1; |
|
|
1926 | tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1e6; |
|
|
1927 | tv[1].tv_sec = req->nv2; |
|
|
1928 | tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1e6; |
|
|
1929 | |
|
|
1930 | times = tv; |
|
|
1931 | } |
|
|
1932 | else |
|
|
1933 | times = 0; |
|
|
1934 | |
|
|
1935 | req->result = req->type == EIO_FUTIME |
|
|
1936 | ? futimes (req->int1, times) |
|
|
1937 | : utimes (req->ptr1, times); |
|
|
1938 | } |
|
|
1939 | break; |
|
|
1940 | |
|
|
1941 | #endif |
|
|
1942 | |
|
|
1943 | case EIO_REALPATH: if (0 <= (req->result = eio__realpath (&self->tmpbuf, req->wd, req->ptr1))) |
|
|
1944 | { |
|
|
1945 | ALLOC (req->result); |
|
|
1946 | memcpy (req->ptr2, self->tmpbuf.ptr, req->result); |
|
|
1947 | } |
|
|
1948 | break; |
|
|
1949 | |
|
|
1950 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1951 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1952 | |
|
|
1953 | case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1954 | req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1955 | |
|
|
1956 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
|
|
1957 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
|
|
1958 | case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break; |
|
|
1959 | |
|
|
1960 | case EIO_CLOSE: req->result = close (req->int1); break; |
|
|
1961 | case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break; |
|
|
1962 | case EIO_SYNC: req->result = 0; sync (); break; |
|
|
1963 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
|
|
1964 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
|
|
1965 | case EIO_SYNCFS: req->result = eio__syncfs (req->int1); break; |
|
|
1966 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
|
|
1967 | case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break; |
|
|
1968 | case EIO_MTOUCH: req->result = eio__mtouch (req); break; |
|
|
1969 | case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break; |
|
|
1970 | case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break; |
|
|
1971 | case EIO_FALLOCATE: req->result = eio__fallocate (req->int1, req->int2, req->offs, req->size); break; |
|
|
1972 | |
|
|
1973 | case EIO_READDIR: eio__scandir (req, self); break; |
|
|
1974 | |
|
|
1975 | case EIO_BUSY: |
|
|
1976 | #ifdef _WIN32 |
|
|
1977 | Sleep (req->nv1 * 1e3); |
|
|
1978 | #else |
|
|
1979 | { |
|
|
1980 | struct timeval tv; |
|
|
1981 | |
|
|
1982 | tv.tv_sec = req->nv1; |
|
|
1983 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6; |
|
|
1984 | |
|
|
1985 | req->result = select (0, 0, 0, 0, &tv); |
|
|
1986 | } |
|
|
1987 | #endif |
|
|
1988 | break; |
|
|
1989 | |
|
|
1990 | #if 0 |
|
|
1991 | case EIO_GROUP: |
|
|
1992 | abort (); /* handled in eio_request */ |
|
|
1993 | #endif |
|
|
1994 | |
|
|
1995 | case EIO_NOP: |
|
|
1996 | req->result = 0; |
|
|
1997 | break; |
|
|
1998 | |
|
|
1999 | case EIO_CUSTOM: |
|
|
2000 | req->feed (req); |
|
|
2001 | break; |
|
|
2002 | |
|
|
2003 | default: |
|
|
2004 | req->result = EIO_ENOSYS (); |
|
|
2005 | break; |
|
|
2006 | } |
|
|
2007 | |
|
|
2008 | req->errorno = errno; |
|
|
2009 | } |
|
|
2010 | |
|
|
2011 | #ifndef EIO_NO_WRAPPERS |
|
|
2012 | |
|
|
2013 | eio_req *eio_wd_open (const char *path, int pri, eio_cb cb, void *data) |
|
|
2014 | { |
|
|
2015 | REQ (EIO_WD_OPEN); PATH; SEND; |
|
|
2016 | } |
|
|
2017 | |
|
|
2018 | eio_req *eio_wd_close (eio_wd wd, int pri, eio_cb cb, void *data) |
|
|
2019 | { |
|
|
2020 | REQ (EIO_WD_CLOSE); req->wd = wd; SEND; |
|
|
2021 | } |
|
|
2022 | |
|
|
2023 | eio_req *eio_nop (int pri, eio_cb cb, void *data) |
|
|
2024 | { |
|
|
2025 | REQ (EIO_NOP); SEND; |
|
|
2026 | } |
|
|
2027 | |
|
|
2028 | eio_req *eio_busy (double delay, int pri, eio_cb cb, void *data) |
|
|
2029 | { |
|
|
2030 | REQ (EIO_BUSY); req->nv1 = delay; SEND; |
|
|
2031 | } |
|
|
2032 | |
|
|
2033 | eio_req *eio_sync (int pri, eio_cb cb, void *data) |
|
|
2034 | { |
|
|
2035 | REQ (EIO_SYNC); SEND; |
|
|
2036 | } |
|
|
2037 | |
|
|
2038 | eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data) |
|
|
2039 | { |
|
|
2040 | REQ (EIO_FSYNC); req->int1 = fd; SEND; |
|
|
2041 | } |
|
|
2042 | |
|
|
2043 | eio_req *eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
|
|
2044 | { |
|
|
2045 | REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
|
|
2046 | } |
|
|
2047 | |
|
|
2048 | eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data) |
|
|
2049 | { |
|
|
2050 | REQ (EIO_FDATASYNC); req->int1 = fd; SEND; |
|
|
2051 | } |
|
|
2052 | |
|
|
2053 | eio_req *eio_syncfs (int fd, int pri, eio_cb cb, void *data) |
|
|
2054 | { |
|
|
2055 | REQ (EIO_SYNCFS); req->int1 = fd; SEND; |
|
|
2056 | } |
|
|
2057 | |
|
|
2058 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
|
|
2059 | { |
|
|
2060 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
|
|
2061 | } |
|
|
2062 | |
|
|
2063 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
|
|
2064 | { |
|
|
2065 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
|
|
2066 | } |
|
|
2067 | |
|
|
2068 | eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data) |
|
|
2069 | { |
|
|
2070 | REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND; |
|
|
2071 | } |
|
|
2072 | |
|
|
2073 | eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data) |
|
|
2074 | { |
|
|
2075 | REQ (EIO_MLOCKALL); req->int1 = flags; SEND; |
|
|
2076 | } |
|
|
2077 | |
|
|
2078 | eio_req *eio_fallocate (int fd, int mode, off_t offset, size_t len, int pri, eio_cb cb, void *data) |
|
|
2079 | { |
|
|
2080 | REQ (EIO_FALLOCATE); req->int1 = fd; req->int2 = mode; req->offs = offset; req->size = len; SEND; |
|
|
2081 | } |
|
|
2082 | |
|
|
2083 | eio_req *eio_close (int fd, int pri, eio_cb cb, void *data) |
|
|
2084 | { |
|
|
2085 | REQ (EIO_CLOSE); req->int1 = fd; SEND; |
|
|
2086 | } |
|
|
2087 | |
|
|
2088 | eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data) |
|
|
2089 | { |
|
|
2090 | REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND; |
|
|
2091 | } |
|
|
2092 | |
|
|
2093 | eio_req *eio_seek (int fd, off_t offset, int whence, int pri, eio_cb cb, void *data) |
|
|
2094 | { |
|
|
2095 | REQ (EIO_SEEK); req->int1 = fd; req->offs = offset; req->int2 = whence; SEND; |
|
|
2096 | } |
|
|
2097 | |
|
|
2098 | eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data) |
|
|
2099 | { |
|
|
2100 | REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND; |
|
|
2101 | } |
|
|
2102 | |
|
|
2103 | eio_req *eio_write (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data) |
|
|
2104 | { |
|
|
2105 | REQ (EIO_WRITE); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND; |
|
|
2106 | } |
|
|
2107 | |
|
|
2108 | eio_req *eio_fcntl (int fd, int cmd, void *arg, int pri, eio_cb cb, void *data) |
|
|
2109 | { |
|
|
2110 | REQ (EIO_IOCTL); req->int1 = fd; req->int2 = cmd; req->ptr2 = arg; SEND; |
|
|
2111 | } |
|
|
2112 | |
|
|
2113 | eio_req *eio_ioctl (int fd, unsigned long request, void *buf, int pri, eio_cb cb, void *data) |
|
|
2114 | { |
|
|
2115 | REQ (EIO_IOCTL); req->int1 = fd; req->int2 = request; req->ptr2 = buf; SEND; |
|
|
2116 | } |
|
|
2117 | |
|
|
2118 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
|
|
2119 | { |
|
|
2120 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
|
|
2121 | } |
|
|
2122 | |
|
|
2123 | eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data) |
|
|
2124 | { |
|
|
2125 | REQ (EIO_FSTATVFS); req->int1 = fd; SEND; |
|
|
2126 | } |
|
|
2127 | |
|
|
2128 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
|
|
2129 | { |
|
|
2130 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
|
|
2131 | } |
|
|
2132 | |
|
|
2133 | eio_req *eio_ftruncate (int fd, off_t offset, int pri, eio_cb cb, void *data) |
|
|
2134 | { |
|
|
2135 | REQ (EIO_FTRUNCATE); req->int1 = fd; req->offs = offset; SEND; |
|
|
2136 | } |
|
|
2137 | |
|
|
2138 | eio_req *eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data) |
|
|
2139 | { |
|
|
2140 | REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND; |
|
|
2141 | } |
|
|
2142 | |
|
|
2143 | eio_req *eio_fchown (int fd, eio_uid_t uid, eio_gid_t gid, int pri, eio_cb cb, void *data) |
|
|
2144 | { |
|
|
2145 | REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND; |
|
|
2146 | } |
|
|
2147 | |
|
|
2148 | eio_req *eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data) |
|
|
2149 | { |
|
|
2150 | REQ (EIO_DUP2); req->int1 = fd; req->int2 = fd2; SEND; |
|
|
2151 | } |
|
|
2152 | |
|
|
2153 | eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, int pri, eio_cb cb, void *data) |
|
|
2154 | { |
|
|
2155 | REQ (EIO_SENDFILE); req->int1 = out_fd; req->int2 = in_fd; req->offs = in_offset; req->size = length; SEND; |
|
|
2156 | } |
|
|
2157 | |
|
|
2158 | eio_req *eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data) |
|
|
2159 | { |
|
|
2160 | REQ (EIO_OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND; |
|
|
2161 | } |
|
|
2162 | |
|
|
2163 | eio_req *eio_utime (const char *path, double atime, double mtime, int pri, eio_cb cb, void *data) |
|
|
2164 | { |
|
|
2165 | REQ (EIO_UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND; |
|
|
2166 | } |
|
|
2167 | |
|
|
2168 | eio_req *eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data) |
|
|
2169 | { |
|
|
2170 | REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND; |
|
|
2171 | } |
|
|
2172 | |
|
|
2173 | eio_req *eio_chown (const char *path, eio_uid_t uid, eio_gid_t gid, int pri, eio_cb cb, void *data) |
|
|
2174 | { |
|
|
2175 | REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND; |
|
|
2176 | } |
|
|
2177 | |
|
|
2178 | eio_req *eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data) |
|
|
2179 | { |
|
|
2180 | REQ (EIO_CHMOD); PATH; req->int2 = (long)mode; SEND; |
|
|
2181 | } |
|
|
2182 | |
|
|
2183 | eio_req *eio_mkdir (const char *path, mode_t mode, int pri, eio_cb cb, void *data) |
|
|
2184 | { |
|
|
2185 | REQ (EIO_MKDIR); PATH; req->int2 = (long)mode; SEND; |
|
|
2186 | } |
|
|
2187 | |
|
|
2188 | static eio_req * |
|
|
2189 | eio__1path (int type, const char *path, int pri, eio_cb cb, void *data) |
|
|
2190 | { |
|
|
2191 | REQ (type); PATH; SEND; |
|
|
2192 | } |
|
|
2193 | |
|
|
2194 | eio_req *eio_readlink (const char *path, int pri, eio_cb cb, void *data) |
|
|
2195 | { |
|
|
2196 | return eio__1path (EIO_READLINK, path, pri, cb, data); |
|
|
2197 | } |
|
|
2198 | |
|
|
2199 | eio_req *eio_realpath (const char *path, int pri, eio_cb cb, void *data) |
|
|
2200 | { |
|
|
2201 | return eio__1path (EIO_REALPATH, path, pri, cb, data); |
|
|
2202 | } |
|
|
2203 | |
|
|
2204 | eio_req *eio_stat (const char *path, int pri, eio_cb cb, void *data) |
|
|
2205 | { |
|
|
2206 | return eio__1path (EIO_STAT, path, pri, cb, data); |
|
|
2207 | } |
|
|
2208 | |
|
|
2209 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
|
|
2210 | { |
|
|
2211 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
|
|
2212 | } |
|
|
2213 | |
|
|
2214 | eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data) |
|
|
2215 | { |
|
|
2216 | return eio__1path (EIO_STATVFS, path, pri, cb, data); |
|
|
2217 | } |
|
|
2218 | |
|
|
2219 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
|
|
2220 | { |
|
|
2221 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
|
|
2222 | } |
|
|
2223 | |
|
|
2224 | eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data) |
|
|
2225 | { |
|
|
2226 | return eio__1path (EIO_RMDIR, path, pri, cb, data); |
|
|
2227 | } |
|
|
2228 | |
|
|
2229 | eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data) |
|
|
2230 | { |
|
|
2231 | REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; |
|
|
2232 | } |
|
|
2233 | |
|
|
2234 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
|
|
2235 | { |
|
|
2236 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND; |
|
|
2237 | } |
|
|
2238 | |
|
|
2239 | static eio_req * |
|
|
2240 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
|
|
2241 | { |
|
|
2242 | REQ (type); PATH; |
|
|
2243 | |
|
|
2244 | req->flags |= EIO_FLAG_PTR2_FREE; |
|
|
2245 | req->ptr2 = strdup (new_path); |
|
|
2246 | if (!req->ptr2) |
|
|
2247 | { |
|
|
2248 | eio_api_destroy (req); |
|
|
2249 | return 0; |
|
|
2250 | } |
|
|
2251 | |
|
|
2252 | SEND; |
|
|
2253 | } |
|
|
2254 | |
|
|
2255 | eio_req *eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
|
|
2256 | { |
|
|
2257 | return eio__2path (EIO_LINK, path, new_path, pri, cb, data); |
|
|
2258 | } |
|
|
2259 | |
|
|
2260 | eio_req *eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
|
|
2261 | { |
|
|
2262 | return eio__2path (EIO_SYMLINK, path, new_path, pri, cb, data); |
|
|
2263 | } |
|
|
2264 | |
|
|
2265 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
|
|
2266 | { |
|
|
2267 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
|
|
2268 | } |
|
|
2269 | |
|
|
2270 | eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data) |
|
|
2271 | { |
|
|
2272 | REQ (EIO_CUSTOM); req->feed = execute; SEND; |
|
|
2273 | } |
|
|
2274 | |
|
|
2275 | #endif |
|
|
2276 | |
|
|
2277 | eio_req *eio_grp (eio_cb cb, void *data) |
|
|
2278 | { |
|
|
2279 | const int pri = EIO_PRI_MAX; |
|
|
2280 | |
|
|
2281 | REQ (EIO_GROUP); SEND; |
|
|
2282 | } |
|
|
2283 | |
|
|
2284 | #undef REQ |
|
|
2285 | #undef PATH |
|
|
2286 | #undef SEND |
|
|
2287 | |
|
|
2288 | /*****************************************************************************/ |
|
|
2289 | /* grp functions */ |
1168 | |
2290 | |
1169 | void |
2291 | void |
1170 | aio_sendfile (SV *out_fh, SV *in_fh, SV *in_offset, UV length, SV *callback=&PL_sv_undef) |
|
|
1171 | PROTOTYPE: $$$$;$ |
|
|
1172 | PPCODE: |
|
|
1173 | { |
|
|
1174 | dREQ; |
|
|
1175 | |
|
|
1176 | req->type = EIO_SENDFILE; |
|
|
1177 | req->sv1 = newSVsv (out_fh); |
|
|
1178 | req->int1 = PerlIO_fileno (IoIFP (sv_2io (out_fh))); |
|
|
1179 | req->sv2 = newSVsv (in_fh); |
|
|
1180 | req->int2 = PerlIO_fileno (IoIFP (sv_2io (in_fh))); |
|
|
1181 | req->offs = SvVAL64 (in_offset); |
|
|
1182 | req->size = length; |
|
|
1183 | |
|
|
1184 | EIO_SEND; |
|
|
1185 | } |
|
|
1186 | |
|
|
1187 | void |
|
|
1188 | aio_readahead (SV *fh, SV *offset, IV length, SV *callback=&PL_sv_undef) |
|
|
1189 | PROTOTYPE: $$$;$ |
|
|
1190 | PPCODE: |
|
|
1191 | { |
|
|
1192 | dREQ; |
|
|
1193 | |
|
|
1194 | req->type = EIO_READAHEAD; |
|
|
1195 | req->sv1 = newSVsv (fh); |
|
|
1196 | req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh))); |
|
|
1197 | req->offs = SvVAL64 (offset); |
|
|
1198 | req->size = length; |
|
|
1199 | |
|
|
1200 | EIO_SEND; |
|
|
1201 | } |
|
|
1202 | |
|
|
1203 | void |
|
|
1204 | aio_stat (SV8 *fh_or_path, SV *callback=&PL_sv_undef) |
|
|
1205 | ALIAS: |
|
|
1206 | aio_stat = EIO_STAT |
|
|
1207 | aio_lstat = EIO_LSTAT |
|
|
1208 | PPCODE: |
|
|
1209 | { |
|
|
1210 | dREQ; |
|
|
1211 | |
|
|
1212 | req->ptr2 = malloc (sizeof (EIO_STRUCT_STAT)); |
|
|
1213 | if (!req->ptr2) |
|
|
1214 | { |
|
|
1215 | req_destroy (req); |
|
|
1216 | croak ("out of memory during aio_stat statdata allocation"); |
|
|
1217 | } |
|
|
1218 | |
|
|
1219 | req->flags |= FLAG_PTR2_FREE; |
|
|
1220 | req->sv1 = newSVsv (fh_or_path); |
|
|
1221 | |
|
|
1222 | if (SvPOK (fh_or_path)) |
|
|
1223 | { |
|
|
1224 | req->type = ix; |
|
|
1225 | req->ptr1 = SvPVbyte_nolen (req->sv1); |
|
|
1226 | } |
|
|
1227 | else |
|
|
1228 | { |
|
|
1229 | req->type = EIO_FSTAT; |
|
|
1230 | req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path))); |
|
|
1231 | } |
|
|
1232 | |
|
|
1233 | EIO_SEND; |
|
|
1234 | } |
|
|
1235 | |
|
|
1236 | void |
|
|
1237 | aio_utime (SV8 *fh_or_path, SV *atime, SV *mtime, SV *callback=&PL_sv_undef) |
|
|
1238 | PPCODE: |
|
|
1239 | { |
|
|
1240 | dREQ; |
|
|
1241 | |
|
|
1242 | req->nv1 = SvOK (atime) ? SvNV (atime) : -1.; |
|
|
1243 | req->nv2 = SvOK (mtime) ? SvNV (mtime) : -1.; |
|
|
1244 | req->sv1 = newSVsv (fh_or_path); |
|
|
1245 | |
|
|
1246 | if (SvPOK (fh_or_path)) |
|
|
1247 | { |
|
|
1248 | req->type = EIO_UTIME; |
|
|
1249 | req->ptr1 = SvPVbyte_nolen (req->sv1); |
|
|
1250 | } |
|
|
1251 | else |
|
|
1252 | { |
|
|
1253 | req->type = EIO_FUTIME; |
|
|
1254 | req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path))); |
|
|
1255 | } |
|
|
1256 | |
|
|
1257 | EIO_SEND; |
|
|
1258 | } |
|
|
1259 | |
|
|
1260 | void |
|
|
1261 | aio_truncate (SV8 *fh_or_path, SV *offset, SV *callback=&PL_sv_undef) |
|
|
1262 | PPCODE: |
|
|
1263 | { |
|
|
1264 | dREQ; |
|
|
1265 | |
|
|
1266 | req->sv1 = newSVsv (fh_or_path); |
|
|
1267 | req->offs = SvOK (offset) ? SvVAL64 (offset) : -1; |
|
|
1268 | |
|
|
1269 | if (SvPOK (fh_or_path)) |
|
|
1270 | { |
|
|
1271 | req->type = EIO_TRUNCATE; |
|
|
1272 | req->ptr1 = SvPVbyte_nolen (req->sv1); |
|
|
1273 | } |
|
|
1274 | else |
|
|
1275 | { |
|
|
1276 | req->type = EIO_FTRUNCATE; |
|
|
1277 | req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path))); |
|
|
1278 | } |
|
|
1279 | |
|
|
1280 | EIO_SEND; |
|
|
1281 | } |
|
|
1282 | |
|
|
1283 | void |
|
|
1284 | aio_chmod (SV8 *fh_or_path, int mode, SV *callback=&PL_sv_undef) |
|
|
1285 | ALIAS: |
|
|
1286 | aio_chmod = EIO_CHMOD |
|
|
1287 | aio_fchmod = EIO_FCHMOD |
|
|
1288 | aio_mkdir = EIO_MKDIR |
|
|
1289 | PPCODE: |
|
|
1290 | { |
|
|
1291 | dREQ; |
|
|
1292 | |
|
|
1293 | req->type = type; |
|
|
1294 | req->int2 = mode; |
|
|
1295 | req->sv1 = newSVsv (fh_or_path); |
|
|
1296 | |
|
|
1297 | if (ix == EIO_FCHMOD) |
|
|
1298 | req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path))); |
|
|
1299 | else |
|
|
1300 | req->ptr1 = SvPVbyte_nolen (req->sv1); |
|
|
1301 | |
|
|
1302 | EIO_SEND; |
|
|
1303 | } |
|
|
1304 | |
|
|
1305 | void |
|
|
1306 | aio_chown (SV8 *fh_or_path, SV *uid, SV *gid, SV *callback=&PL_sv_undef) |
|
|
1307 | PPCODE: |
|
|
1308 | { |
|
|
1309 | dREQ; |
|
|
1310 | |
|
|
1311 | req->int2 = SvOK (uid) ? SvIV (uid) : -1; |
|
|
1312 | req->int3 = SvOK (gid) ? SvIV (gid) : -1; |
|
|
1313 | req->sv1 = newSVsv (fh_or_path); |
|
|
1314 | |
|
|
1315 | if (SvPOK (fh_or_path)) |
|
|
1316 | { |
|
|
1317 | req->type = EIO_CHOWN; |
|
|
1318 | req->ptr1 = SvPVbyte_nolen (req->sv1); |
|
|
1319 | } |
|
|
1320 | else |
|
|
1321 | { |
|
|
1322 | req->type = EIO_FCHOWN; |
|
|
1323 | req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path))); |
|
|
1324 | } |
|
|
1325 | |
|
|
1326 | EIO_SEND; |
|
|
1327 | } |
|
|
1328 | |
|
|
1329 | void |
|
|
1330 | aio_unlink (SV8 *pathname, SV *callback=&PL_sv_undef) |
|
|
1331 | ALIAS: |
|
|
1332 | aio_unlink = EIO_UNLINK |
|
|
1333 | aio_rmdir = EIO_RMDIR |
|
|
1334 | aio_readdir = EIO_READDIR |
|
|
1335 | PPCODE: |
|
|
1336 | { |
|
|
1337 | dREQ; |
|
|
1338 | |
|
|
1339 | req->type = ix; |
|
|
1340 | req->sv1 = newSVsv (pathname); |
|
|
1341 | req->ptr1 = SvPVbyte_nolen (req->sv1); |
|
|
1342 | |
|
|
1343 | EIO_SEND; |
|
|
1344 | } |
|
|
1345 | |
|
|
1346 | void |
|
|
1347 | aio_link (SV8 *oldpath, SV8 *newpath, SV *callback=&PL_sv_undef) |
|
|
1348 | ALIAS: |
|
|
1349 | aio_link = EIO_LINK |
|
|
1350 | aio_symlink = EIO_SYMLINK |
|
|
1351 | aio_rename = EIO_RENAME |
|
|
1352 | PPCODE: |
|
|
1353 | { |
|
|
1354 | dREQ; |
|
|
1355 | |
|
|
1356 | req->type = ix; |
|
|
1357 | req->sv1 = newSVsv (oldpath); |
|
|
1358 | req->ptr1 = SvPVbyte_nolen (req->sv1); |
|
|
1359 | req->sv2 = newSVsv (newpath); |
|
|
1360 | req->ptr2 = SvPVbyte_nolen (req->sv2); |
|
|
1361 | |
|
|
1362 | EIO_SEND; |
|
|
1363 | } |
|
|
1364 | |
|
|
1365 | void |
|
|
1366 | aio_mknod (SV8 *pathname, int mode, UV dev, SV *callback=&PL_sv_undef) |
|
|
1367 | PPCODE: |
|
|
1368 | { |
|
|
1369 | dREQ; |
|
|
1370 | |
|
|
1371 | req->type = EIO_MKNOD; |
|
|
1372 | req->sv1 = newSVsv (pathname); |
|
|
1373 | req->ptr1 = SvPVbyte_nolen (req->sv1); |
|
|
1374 | req->int2 = (mode_t)mode; |
|
|
1375 | req->offs = dev; |
|
|
1376 | |
|
|
1377 | EIO_SEND; |
|
|
1378 | } |
|
|
1379 | |
|
|
1380 | void |
|
|
1381 | aio_busy (double delay, SV *callback=&PL_sv_undef) |
|
|
1382 | PPCODE: |
|
|
1383 | { |
|
|
1384 | dREQ; |
|
|
1385 | |
|
|
1386 | req->type = EIO_BUSY; |
|
|
1387 | req->nv1 = delay < 0. ? 0. : delay; |
|
|
1388 | |
|
|
1389 | EIO_SEND; |
|
|
1390 | } |
|
|
1391 | |
|
|
1392 | void |
|
|
1393 | aio_group (SV *callback=&PL_sv_undef) |
|
|
1394 | PROTOTYPE: ;$ |
|
|
1395 | PPCODE: |
|
|
1396 | { |
|
|
1397 | dREQ; |
|
|
1398 | |
|
|
1399 | req->type = EIO_GROUP; |
|
|
1400 | |
|
|
1401 | req_send (req); |
|
|
1402 | XPUSHs (req_sv (req, AIO_GRP_KLASS)); |
|
|
1403 | } |
|
|
1404 | |
|
|
1405 | void |
|
|
1406 | aio_nop (SV *callback=&PL_sv_undef) |
|
|
1407 | ALIAS: |
|
|
1408 | aio_nop = EIO_NOP |
|
|
1409 | aio_sync = EIO_SYNC |
|
|
1410 | PPCODE: |
|
|
1411 | { |
|
|
1412 | dREQ; |
|
|
1413 | |
|
|
1414 | #endif |
|
|
1415 | |
|
|
1416 | void eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit) |
2292 | eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit) |
1417 | { |
2293 | { |
1418 | grp->int2 = limit; |
2294 | grp->int2 = limit; |
1419 | grp->feed = feed; |
2295 | grp->feed = feed; |
1420 | |
2296 | |
1421 | grp_try_feed (grp); |
2297 | grp_try_feed (grp); |
1422 | } |
2298 | } |
1423 | |
2299 | |
|
|
2300 | void |
1424 | void eio_grp_limit (eio_req *grp, int limit) |
2301 | eio_grp_limit (eio_req *grp, int limit) |
1425 | { |
2302 | { |
1426 | grp->int2 = limit; |
2303 | grp->int2 = limit; |
1427 | |
2304 | |
1428 | grp_try_feed (grp); |
2305 | grp_try_feed (grp); |
1429 | } |
2306 | } |
1430 | |
2307 | |
|
|
2308 | void |
1431 | void eio_grp_add (eio_req *grp, eio_req *req) |
2309 | eio_grp_add (eio_req *grp, eio_req *req) |
1432 | { |
2310 | { |
1433 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
2311 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
|
|
2312 | |
|
|
2313 | grp->flags |= ETP_FLAG_GROUPADD; |
1434 | |
2314 | |
1435 | ++grp->size; |
2315 | ++grp->size; |
1436 | req->grp = grp; |
2316 | req->grp = grp; |
1437 | |
2317 | |
1438 | req->grp_prev = 0; |
2318 | req->grp_prev = 0; |
… | |
… | |
1442 | grp->grp_first->grp_prev = req; |
2322 | grp->grp_first->grp_prev = req; |
1443 | |
2323 | |
1444 | grp->grp_first = req; |
2324 | grp->grp_first = req; |
1445 | } |
2325 | } |
1446 | |
2326 | |
|
|
2327 | /*****************************************************************************/ |
|
|
2328 | /* misc garbage */ |
1447 | |
2329 | |
|
|
2330 | eio_ssize_t |
|
|
2331 | eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
|
|
2332 | { |
|
|
2333 | return eio__sendfile (ofd, ifd, offset, count); |
|
|
2334 | } |
|
|
2335 | |