1 | /* |
1 | /* |
2 | * libeio implementation |
2 | * libeio implementation |
3 | * |
3 | * |
4 | * Copyright (c) 2007,2008,2009 Marc Alexander Lehmann <libeio@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libeio@schmorp.de> |
5 | * All rights reserved. |
5 | * All rights reserved. |
6 | * |
6 | * |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
8 | * tion, are permitted provided that the following conditions are met: |
8 | * tion, are permitted provided that the following conditions are met: |
9 | * |
9 | * |
… | |
… | |
35 | * and other provisions required by the GPL. If you do not delete the |
35 | * and other provisions required by the GPL. If you do not delete the |
36 | * provisions above, a recipient may use your version of this file under |
36 | * provisions above, a recipient may use your version of this file under |
37 | * either the BSD or the GPL. |
37 | * either the BSD or the GPL. |
38 | */ |
38 | */ |
39 | |
39 | |
|
|
40 | #ifndef _WIN32 |
|
|
41 | # include "config.h" |
|
|
42 | #endif |
|
|
43 | |
40 | #include "eio.h" |
44 | #include "eio.h" |
|
|
45 | #include "ecb.h" |
41 | |
46 | |
42 | #ifdef EIO_STACKSIZE |
47 | #ifdef EIO_STACKSIZE |
43 | # define XTHREAD_STACKSIZE EIO_STACKSIZE |
48 | # define XTHREAD_STACKSIZE EIO_STACKSIZE |
44 | #endif |
49 | #endif |
45 | #include "xthread.h" |
50 | #include "xthread.h" |
… | |
… | |
53 | #include <sys/stat.h> |
58 | #include <sys/stat.h> |
54 | #include <limits.h> |
59 | #include <limits.h> |
55 | #include <fcntl.h> |
60 | #include <fcntl.h> |
56 | #include <assert.h> |
61 | #include <assert.h> |
57 | |
62 | |
|
|
63 | /* intptr_t comes from unistd.h, says POSIX/UNIX/tradition */ |
|
|
64 | /* intptr_t only comes from stdint.h, says idiot openbsd coder */ |
|
|
65 | #if HAVE_STDINT_H |
|
|
66 | # include <stdint.h> |
|
|
67 | #endif |
|
|
68 | |
|
|
69 | #ifndef ECANCELED |
|
|
70 | # define ECANCELED EDOM |
|
|
71 | #endif |
|
|
72 | #ifndef ELOOP |
|
|
73 | # define ELOOP EDOM |
|
|
74 | #endif |
|
|
75 | |
|
|
76 | #if !defined(ENOTSOCK) && defined(WSAENOTSOCK) |
|
|
77 | # define ENOTSOCK WSAENOTSOCK |
|
|
78 | #endif |
|
|
79 | |
|
|
80 | static void eio_destroy (eio_req *req); |
|
|
81 | |
58 | #ifndef EIO_FINISH |
82 | #ifndef EIO_FINISH |
59 | # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 |
83 | # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 |
60 | #endif |
84 | #endif |
61 | |
85 | |
62 | #ifndef EIO_DESTROY |
86 | #ifndef EIO_DESTROY |
… | |
… | |
65 | |
89 | |
66 | #ifndef EIO_FEED |
90 | #ifndef EIO_FEED |
67 | # define EIO_FEED(req) do { if ((req)->feed ) (req)->feed (req); } while (0) |
91 | # define EIO_FEED(req) do { if ((req)->feed ) (req)->feed (req); } while (0) |
68 | #endif |
92 | #endif |
69 | |
93 | |
|
|
94 | #ifndef EIO_FD_TO_WIN32_HANDLE |
|
|
95 | # define EIO_FD_TO_WIN32_HANDLE(fd) _get_osfhandle (fd) |
|
|
96 | #endif |
|
|
97 | #ifndef EIO_WIN32_HANDLE_TO_FD |
|
|
98 | # define EIO_WIN32_HANDLE_TO_FD(handle) _open_osfhandle (handle, 0) |
|
|
99 | #endif |
|
|
100 | |
|
|
101 | #define EIO_ERRNO(errval,retval) ((errno = errval), retval) |
|
|
102 | |
|
|
103 | #define EIO_ENOSYS() EIO_ERRNO (ENOSYS, -1) |
|
|
104 | |
70 | #ifdef _WIN32 |
105 | #ifdef _WIN32 |
71 | |
106 | |
72 | /*doh*/ |
107 | #undef PAGESIZE |
|
|
108 | #define PAGESIZE 4096 /* GetSystemInfo? */ |
|
|
109 | |
|
|
110 | #ifdef EIO_STRUCT_STATI64 |
|
|
111 | #define stat(path,buf) _stati64 (path,buf) |
|
|
112 | #define fstat(fd,buf) _fstati64 (fd,buf) |
|
|
113 | #endif |
|
|
114 | #define lstat(path,buf) stat (path,buf) |
|
|
115 | #define fsync(fd) (FlushFileBuffers ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd)) ? 0 : EIO_ERRNO (EBADF, -1)) |
|
|
116 | #define mkdir(path,mode) _mkdir (path) |
|
|
117 | #define link(old,neu) (CreateHardLink (neu, old, 0) ? 0 : EIO_ERRNO (ENOENT, -1)) |
|
|
118 | |
|
|
119 | #define chmod(path,mode) _chmod (path, mode) |
|
|
120 | #define dup(fd) _dup (fd) |
|
|
121 | #define dup2(fd1,fd2) _dup2 (fd1, fd2) |
|
|
122 | |
|
|
123 | #define fchmod(fd,mode) EIO_ENOSYS () |
|
|
124 | #define chown(path,uid,gid) EIO_ENOSYS () |
|
|
125 | #define fchown(fd,uid,gid) EIO_ENOSYS () |
|
|
126 | #define truncate(path,offs) EIO_ENOSYS () /* far-miss: SetEndOfFile */ |
|
|
127 | #define ftruncate(fd,offs) EIO_ENOSYS () /* near-miss: SetEndOfFile */ |
|
|
128 | #define mknod(path,mode,dev) EIO_ENOSYS () |
|
|
129 | #define sync() EIO_ENOSYS () |
|
|
130 | #define readlink(path,buf,s) EIO_ENOSYS () |
|
|
131 | #define statvfs(path,buf) EIO_ENOSYS () |
|
|
132 | #define fstatvfs(fd,buf) EIO_ENOSYS () |
|
|
133 | |
|
|
134 | /* rename() uses MoveFile, which fails to overwrite */ |
|
|
135 | #define rename(old,neu) eio__rename (old, neu) |
|
|
136 | |
|
|
137 | static int |
|
|
138 | eio__rename (const char *old, const char *neu) |
|
|
139 | { |
|
|
140 | if (MoveFileEx (old, neu, MOVEFILE_REPLACE_EXISTING)) |
|
|
141 | return 0; |
|
|
142 | |
|
|
143 | /* should steal _dosmaperr */ |
|
|
144 | switch (GetLastError ()) |
|
|
145 | { |
|
|
146 | case ERROR_FILE_NOT_FOUND: |
|
|
147 | case ERROR_PATH_NOT_FOUND: |
|
|
148 | case ERROR_INVALID_DRIVE: |
|
|
149 | case ERROR_NO_MORE_FILES: |
|
|
150 | case ERROR_BAD_NETPATH: |
|
|
151 | case ERROR_BAD_NET_NAME: |
|
|
152 | case ERROR_BAD_PATHNAME: |
|
|
153 | case ERROR_FILENAME_EXCED_RANGE: |
|
|
154 | errno = ENOENT; |
|
|
155 | break; |
|
|
156 | |
|
|
157 | default: |
|
|
158 | errno = EACCES; |
|
|
159 | break; |
|
|
160 | } |
|
|
161 | |
|
|
162 | return -1; |
|
|
163 | } |
|
|
164 | |
|
|
165 | /* we could even stat and see if it exists */ |
|
|
166 | static int |
|
|
167 | symlink (const char *old, const char *neu) |
|
|
168 | { |
|
|
169 | #if WINVER >= 0x0600 |
|
|
170 | if (CreateSymbolicLink (neu, old, 1)) |
|
|
171 | return 0; |
|
|
172 | |
|
|
173 | if (CreateSymbolicLink (neu, old, 0)) |
|
|
174 | return 0; |
|
|
175 | #endif |
|
|
176 | |
|
|
177 | return EIO_ERRNO (ENOENT, -1); |
|
|
178 | } |
|
|
179 | |
|
|
180 | /* POSIX API only */ |
|
|
181 | #define CreateHardLink(neu,old,flags) 0 |
|
|
182 | #define CreateSymbolicLink(neu,old,flags) 0 |
|
|
183 | |
|
|
184 | struct statvfs |
|
|
185 | { |
|
|
186 | int dummy; |
|
|
187 | }; |
|
|
188 | |
|
|
189 | #define DT_DIR EIO_DT_DIR |
|
|
190 | #define DT_REG EIO_DT_REG |
|
|
191 | #define D_NAME(entp) entp.cFileName |
|
|
192 | #define D_TYPE(entp) (entp.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY ? DT_DIR : DT_REG) |
|
|
193 | |
73 | #else |
194 | #else |
74 | |
195 | |
75 | # include "config.h" |
|
|
76 | # include <sys/time.h> |
196 | #include <sys/time.h> |
77 | # include <sys/select.h> |
197 | #include <sys/select.h> |
|
|
198 | #include <sys/statvfs.h> |
78 | # include <unistd.h> |
199 | #include <unistd.h> |
|
|
200 | #include <signal.h> |
|
|
201 | #include <dirent.h> |
|
|
202 | |
|
|
203 | #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES |
|
|
204 | #include <sys/mman.h> |
|
|
205 | #endif |
|
|
206 | |
|
|
207 | #define D_NAME(entp) entp->d_name |
|
|
208 | |
|
|
209 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
|
|
210 | #if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__ |
|
|
211 | #define _DIRENT_HAVE_D_TYPE /* sigh */ |
|
|
212 | #define D_INO(de) (de)->d_fileno |
|
|
213 | #define D_NAMLEN(de) (de)->d_namlen |
|
|
214 | #elif __linux || defined d_ino || _XOPEN_SOURCE >= 600 |
|
|
215 | #define D_INO(de) (de)->d_ino |
|
|
216 | #endif |
|
|
217 | |
|
|
218 | #ifdef _D_EXACT_NAMLEN |
|
|
219 | #undef D_NAMLEN |
|
|
220 | #define D_NAMLEN(de) _D_EXACT_NAMLEN (de) |
|
|
221 | #endif |
|
|
222 | |
|
|
223 | #ifdef _DIRENT_HAVE_D_TYPE |
|
|
224 | #define D_TYPE(de) (de)->d_type |
|
|
225 | #endif |
|
|
226 | |
|
|
227 | #ifndef EIO_STRUCT_DIRENT |
|
|
228 | #define EIO_STRUCT_DIRENT struct dirent |
|
|
229 | #endif |
|
|
230 | |
|
|
231 | #endif |
|
|
232 | |
|
|
233 | #if HAVE_UTIMES |
79 | # include <utime.h> |
234 | # include <utime.h> |
80 | # include <signal.h> |
|
|
81 | # include <dirent.h> |
|
|
82 | |
|
|
83 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
|
|
84 | # if defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) |
|
|
85 | # define _DIRENT_HAVE_D_TYPE /* sigh */ |
|
|
86 | # define D_INO(de) (de)->d_fileno |
|
|
87 | # define D_NAMLEN(de) (de)->d_namlen |
|
|
88 | # elif defined(__linux) || defined(d_ino) || _XOPEN_SOURCE >= 600 |
|
|
89 | # define D_INO(de) (de)->d_ino |
|
|
90 | # endif |
235 | #endif |
91 | |
236 | |
92 | #ifdef _D_EXACT_NAMLEN |
237 | #if HAVE_SYS_SYSCALL_H |
93 | # undef D_NAMLEN |
238 | # include <sys/syscall.h> |
94 | # define D_NAMLEN(de) _D_EXACT_NAMLEN (de) |
|
|
95 | #endif |
|
|
96 | |
|
|
97 | # ifdef _DIRENT_HAVE_D_TYPE |
|
|
98 | # define D_TYPE(de) (de)->d_type |
|
|
99 | # endif |
239 | #endif |
100 | |
240 | |
101 | # ifndef EIO_STRUCT_DIRENT |
241 | #if HAVE_SYS_PRCTL_H |
102 | # define EIO_STRUCT_DIRENT struct dirent |
242 | # include <sys/prctl.h> |
103 | # endif |
|
|
104 | |
|
|
105 | #endif |
243 | #endif |
106 | |
244 | |
107 | #if HAVE_SENDFILE |
245 | #if HAVE_SENDFILE |
108 | # if __linux |
246 | # if __linux |
109 | # include <sys/sendfile.h> |
247 | # include <sys/sendfile.h> |
110 | # elif __freebsd |
248 | # elif __FreeBSD__ || defined __APPLE__ |
111 | # include <sys/socket.h> |
249 | # include <sys/socket.h> |
112 | # include <sys/uio.h> |
250 | # include <sys/uio.h> |
113 | # elif __hpux |
251 | # elif __hpux |
114 | # include <sys/socket.h> |
252 | # include <sys/socket.h> |
115 | # elif __solaris /* not yet */ |
253 | # elif __solaris |
116 | # include <sys/sendfile.h> |
254 | # include <sys/sendfile.h> |
117 | # else |
255 | # else |
118 | # error sendfile support requested but not available |
256 | # error sendfile support requested but not available |
119 | # endif |
257 | # endif |
120 | #endif |
258 | #endif |
… | |
… | |
124 | #endif |
262 | #endif |
125 | #ifndef D_INO |
263 | #ifndef D_INO |
126 | # define D_INO(de) 0 |
264 | # define D_INO(de) 0 |
127 | #endif |
265 | #endif |
128 | #ifndef D_NAMLEN |
266 | #ifndef D_NAMLEN |
129 | # define D_NAMLEN(de) strlen ((de)->d_name) |
267 | # define D_NAMLEN(entp) strlen (D_NAME (entp)) |
130 | #endif |
268 | #endif |
131 | |
|
|
132 | /* number of seconds after which an idle threads exit */ |
|
|
133 | #define IDLE_TIMEOUT 10 |
|
|
134 | |
269 | |
135 | /* used for struct dirent, AIX doesn't provide it */ |
270 | /* used for struct dirent, AIX doesn't provide it */ |
136 | #ifndef NAME_MAX |
271 | #ifndef NAME_MAX |
137 | # define NAME_MAX 4096 |
272 | # define NAME_MAX 4096 |
138 | #endif |
273 | #endif |
139 | |
274 | |
|
|
275 | /* used for readlink etc. */ |
|
|
276 | #ifndef PATH_MAX |
|
|
277 | # define PATH_MAX 4096 |
|
|
278 | #endif |
|
|
279 | |
140 | /* buffer size for various temporary buffers */ |
280 | /* buffer size for various temporary buffers */ |
141 | #define EIO_BUFSIZE 65536 |
281 | #define EIO_BUFSIZE 65536 |
142 | |
282 | |
143 | #define dBUF \ |
283 | #define dBUF \ |
144 | char *eio_buf; \ |
|
|
145 | ETP_WORKER_LOCK (self); \ |
|
|
146 | self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \ |
284 | char *eio_buf = malloc (EIO_BUFSIZE); \ |
147 | ETP_WORKER_UNLOCK (self); \ |
|
|
148 | errno = ENOMEM; \ |
285 | errno = ENOMEM; \ |
149 | if (!eio_buf) \ |
286 | if (!eio_buf) \ |
150 | return -1; |
287 | return -1 |
|
|
288 | |
|
|
289 | #define FUBd \ |
|
|
290 | free (eio_buf) |
151 | |
291 | |
152 | #define EIO_TICKS ((1000000 + 1023) >> 10) |
292 | #define EIO_TICKS ((1000000 + 1023) >> 10) |
153 | |
|
|
154 | /*****************************************************************************/ |
|
|
155 | |
|
|
156 | #if __GNUC__ >= 3 |
|
|
157 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
158 | #else |
|
|
159 | # define expect(expr,value) (expr) |
|
|
160 | #endif |
|
|
161 | |
|
|
162 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
163 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
164 | |
|
|
165 | /*****************************************************************************/ |
|
|
166 | |
293 | |
167 | #define ETP_PRI_MIN EIO_PRI_MIN |
294 | #define ETP_PRI_MIN EIO_PRI_MIN |
168 | #define ETP_PRI_MAX EIO_PRI_MAX |
295 | #define ETP_PRI_MAX EIO_PRI_MAX |
169 | |
296 | |
170 | struct etp_worker; |
297 | struct etp_worker; |
… | |
… | |
174 | static int eio_finish (eio_req *req); |
301 | static int eio_finish (eio_req *req); |
175 | #define ETP_FINISH(req) eio_finish (req) |
302 | #define ETP_FINISH(req) eio_finish (req) |
176 | static void eio_execute (struct etp_worker *self, eio_req *req); |
303 | static void eio_execute (struct etp_worker *self, eio_req *req); |
177 | #define ETP_EXECUTE(wrk,req) eio_execute (wrk,req) |
304 | #define ETP_EXECUTE(wrk,req) eio_execute (wrk,req) |
178 | |
305 | |
179 | #define ETP_WORKER_CLEAR(req) \ |
|
|
180 | if (wrk->dbuf) \ |
|
|
181 | { \ |
|
|
182 | free (wrk->dbuf); \ |
|
|
183 | wrk->dbuf = 0; \ |
|
|
184 | } \ |
|
|
185 | \ |
|
|
186 | if (wrk->dirp) \ |
|
|
187 | { \ |
|
|
188 | closedir (wrk->dirp); \ |
|
|
189 | wrk->dirp = 0; \ |
|
|
190 | } |
|
|
191 | |
|
|
192 | #define ETP_WORKER_COMMON \ |
|
|
193 | void *dbuf; \ |
|
|
194 | DIR *dirp; |
|
|
195 | |
|
|
196 | /*****************************************************************************/ |
306 | /*****************************************************************************/ |
197 | |
307 | |
198 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
308 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
199 | |
309 | |
200 | /* calculcate time difference in ~1/EIO_TICKS of a second */ |
310 | /* calculate time difference in ~1/EIO_TICKS of a second */ |
|
|
311 | ecb_inline int |
201 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
312 | tvdiff (struct timeval *tv1, struct timeval *tv2) |
202 | { |
313 | { |
203 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
314 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
204 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
315 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
205 | } |
316 | } |
206 | |
317 | |
… | |
… | |
213 | static unsigned int max_poll_reqs; /* reslock */ |
324 | static unsigned int max_poll_reqs; /* reslock */ |
214 | |
325 | |
215 | static volatile unsigned int nreqs; /* reqlock */ |
326 | static volatile unsigned int nreqs; /* reqlock */ |
216 | static volatile unsigned int nready; /* reqlock */ |
327 | static volatile unsigned int nready; /* reqlock */ |
217 | static volatile unsigned int npending; /* reqlock */ |
328 | static volatile unsigned int npending; /* reqlock */ |
218 | static volatile unsigned int max_idle = 4; |
329 | static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */ |
|
|
330 | static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */ |
219 | |
331 | |
220 | static mutex_t wrklock = X_MUTEX_INIT; |
332 | static xmutex_t wrklock; |
221 | static mutex_t reslock = X_MUTEX_INIT; |
333 | static xmutex_t reslock; |
222 | static mutex_t reqlock = X_MUTEX_INIT; |
334 | static xmutex_t reqlock; |
223 | static cond_t reqwait = X_COND_INIT; |
335 | static xcond_t reqwait; |
224 | |
336 | |
225 | #if !HAVE_PREADWRITE |
337 | #if !HAVE_PREADWRITE |
226 | /* |
338 | /* |
227 | * make our pread/pwrite emulation safe against themselves, but not against |
339 | * make our pread/pwrite emulation safe against themselves, but not against |
228 | * normal read/write by using a mutex. slows down execution a lot, |
340 | * normal read/write by using a mutex. slows down execution a lot, |
229 | * but that's your problem, not mine. |
341 | * but that's your problem, not mine. |
230 | */ |
342 | */ |
231 | static mutex_t preadwritelock = X_MUTEX_INIT; |
343 | static xmutex_t preadwritelock; |
232 | #endif |
344 | #endif |
233 | |
345 | |
234 | typedef struct etp_worker |
346 | typedef struct etp_worker |
235 | { |
347 | { |
236 | /* locked by wrklock */ |
348 | /* locked by wrklock */ |
237 | struct etp_worker *prev, *next; |
349 | struct etp_worker *prev, *next; |
238 | |
350 | |
239 | thread_t tid; |
351 | xthread_t tid; |
240 | |
352 | |
241 | /* locked by reslock, reqlock or wrklock */ |
353 | /* locked by reslock, reqlock or wrklock */ |
242 | ETP_REQ *req; /* currently processed request */ |
354 | ETP_REQ *req; /* currently processed request */ |
243 | |
355 | |
|
|
356 | #ifdef ETP_WORKER_COMMON |
244 | ETP_WORKER_COMMON |
357 | ETP_WORKER_COMMON |
|
|
358 | #endif |
245 | } etp_worker; |
359 | } etp_worker; |
246 | |
360 | |
247 | static etp_worker wrk_first = { &wrk_first, &wrk_first, 0 }; /* NOT etp */ |
361 | static etp_worker wrk_first; /* NOT etp */ |
248 | |
362 | |
249 | #define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock) |
363 | #define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock) |
250 | #define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock) |
364 | #define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock) |
251 | |
365 | |
252 | /* worker threads management */ |
366 | /* worker threads management */ |
253 | |
367 | |
|
|
368 | static void ecb_cold |
254 | static void etp_worker_clear (etp_worker *wrk) |
369 | etp_worker_clear (etp_worker *wrk) |
255 | { |
370 | { |
256 | ETP_WORKER_CLEAR (wrk); |
|
|
257 | } |
371 | } |
258 | |
372 | |
|
|
373 | static void ecb_cold |
259 | static void etp_worker_free (etp_worker *wrk) |
374 | etp_worker_free (etp_worker *wrk) |
260 | { |
375 | { |
261 | wrk->next->prev = wrk->prev; |
376 | wrk->next->prev = wrk->prev; |
262 | wrk->prev->next = wrk->next; |
377 | wrk->prev->next = wrk->next; |
263 | |
378 | |
264 | free (wrk); |
379 | free (wrk); |
265 | } |
380 | } |
266 | |
381 | |
267 | static unsigned int etp_nreqs (void) |
382 | static unsigned int |
|
|
383 | etp_nreqs (void) |
268 | { |
384 | { |
269 | int retval; |
385 | int retval; |
270 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
386 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
271 | retval = nreqs; |
387 | retval = nreqs; |
272 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
388 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
273 | return retval; |
389 | return retval; |
274 | } |
390 | } |
275 | |
391 | |
276 | static unsigned int etp_nready (void) |
392 | static unsigned int |
|
|
393 | etp_nready (void) |
277 | { |
394 | { |
278 | unsigned int retval; |
395 | unsigned int retval; |
279 | |
396 | |
280 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
397 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
281 | retval = nready; |
398 | retval = nready; |
282 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
399 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
283 | |
400 | |
284 | return retval; |
401 | return retval; |
285 | } |
402 | } |
286 | |
403 | |
287 | static unsigned int etp_npending (void) |
404 | static unsigned int |
|
|
405 | etp_npending (void) |
288 | { |
406 | { |
289 | unsigned int retval; |
407 | unsigned int retval; |
290 | |
408 | |
291 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
409 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
292 | retval = npending; |
410 | retval = npending; |
293 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
411 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
294 | |
412 | |
295 | return retval; |
413 | return retval; |
296 | } |
414 | } |
297 | |
415 | |
298 | static unsigned int etp_nthreads (void) |
416 | static unsigned int |
|
|
417 | etp_nthreads (void) |
299 | { |
418 | { |
300 | unsigned int retval; |
419 | unsigned int retval; |
301 | |
420 | |
302 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
421 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
303 | retval = started; |
422 | retval = started; |
… | |
… | |
317 | } etp_reqq; |
436 | } etp_reqq; |
318 | |
437 | |
319 | static etp_reqq req_queue; |
438 | static etp_reqq req_queue; |
320 | static etp_reqq res_queue; |
439 | static etp_reqq res_queue; |
321 | |
440 | |
|
|
441 | static void ecb_noinline ecb_cold |
|
|
442 | reqq_init (etp_reqq *q) |
|
|
443 | { |
|
|
444 | int pri; |
|
|
445 | |
|
|
446 | for (pri = 0; pri < ETP_NUM_PRI; ++pri) |
|
|
447 | q->qs[pri] = q->qe[pri] = 0; |
|
|
448 | |
|
|
449 | q->size = 0; |
|
|
450 | } |
|
|
451 | |
|
|
452 | static int ecb_noinline |
322 | static int reqq_push (etp_reqq *q, ETP_REQ *req) |
453 | reqq_push (etp_reqq *q, ETP_REQ *req) |
323 | { |
454 | { |
324 | int pri = req->pri; |
455 | int pri = req->pri; |
325 | req->next = 0; |
456 | req->next = 0; |
326 | |
457 | |
327 | if (q->qe[pri]) |
458 | if (q->qe[pri]) |
… | |
… | |
333 | q->qe[pri] = q->qs[pri] = req; |
464 | q->qe[pri] = q->qs[pri] = req; |
334 | |
465 | |
335 | return q->size++; |
466 | return q->size++; |
336 | } |
467 | } |
337 | |
468 | |
|
|
469 | static ETP_REQ * ecb_noinline |
338 | static ETP_REQ *reqq_shift (etp_reqq *q) |
470 | reqq_shift (etp_reqq *q) |
339 | { |
471 | { |
340 | int pri; |
472 | int pri; |
341 | |
473 | |
342 | if (!q->size) |
474 | if (!q->size) |
343 | return 0; |
475 | return 0; |
… | |
… | |
358 | } |
490 | } |
359 | |
491 | |
360 | abort (); |
492 | abort (); |
361 | } |
493 | } |
362 | |
494 | |
363 | static void etp_atfork_prepare (void) |
495 | static int ecb_cold |
|
|
496 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
364 | { |
497 | { |
365 | X_LOCK (wrklock); |
498 | X_MUTEX_CREATE (wrklock); |
366 | X_LOCK (reqlock); |
499 | X_MUTEX_CREATE (reslock); |
367 | X_LOCK (reslock); |
500 | X_MUTEX_CREATE (reqlock); |
368 | #if !HAVE_PREADWRITE |
501 | X_COND_CREATE (reqwait); |
369 | X_LOCK (preadwritelock); |
|
|
370 | #endif |
|
|
371 | } |
|
|
372 | |
502 | |
373 | static void etp_atfork_parent (void) |
503 | reqq_init (&req_queue); |
374 | { |
504 | reqq_init (&res_queue); |
375 | #if !HAVE_PREADWRITE |
|
|
376 | X_UNLOCK (preadwritelock); |
|
|
377 | #endif |
|
|
378 | X_UNLOCK (reslock); |
|
|
379 | X_UNLOCK (reqlock); |
|
|
380 | X_UNLOCK (wrklock); |
|
|
381 | } |
|
|
382 | |
505 | |
383 | static void etp_atfork_child (void) |
506 | wrk_first.next = |
384 | { |
507 | wrk_first.prev = &wrk_first; |
385 | ETP_REQ *prv; |
|
|
386 | |
|
|
387 | while ((prv = reqq_shift (&req_queue))) |
|
|
388 | ETP_DESTROY (prv); |
|
|
389 | |
|
|
390 | while ((prv = reqq_shift (&res_queue))) |
|
|
391 | ETP_DESTROY (prv); |
|
|
392 | |
|
|
393 | while (wrk_first.next != &wrk_first) |
|
|
394 | { |
|
|
395 | etp_worker *wrk = wrk_first.next; |
|
|
396 | |
|
|
397 | if (wrk->req) |
|
|
398 | ETP_DESTROY (wrk->req); |
|
|
399 | |
|
|
400 | etp_worker_clear (wrk); |
|
|
401 | etp_worker_free (wrk); |
|
|
402 | } |
|
|
403 | |
508 | |
404 | started = 0; |
509 | started = 0; |
405 | idle = 0; |
510 | idle = 0; |
406 | nreqs = 0; |
511 | nreqs = 0; |
407 | nready = 0; |
512 | nready = 0; |
408 | npending = 0; |
513 | npending = 0; |
409 | |
514 | |
410 | etp_atfork_parent (); |
|
|
411 | } |
|
|
412 | |
|
|
413 | static void |
|
|
414 | etp_once_init (void) |
|
|
415 | { |
|
|
416 | X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); |
|
|
417 | } |
|
|
418 | |
|
|
419 | static int |
|
|
420 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
|
|
421 | { |
|
|
422 | static pthread_once_t doinit = PTHREAD_ONCE_INIT; |
|
|
423 | |
|
|
424 | pthread_once (&doinit, etp_once_init); |
|
|
425 | |
|
|
426 | want_poll_cb = want_poll; |
515 | want_poll_cb = want_poll; |
427 | done_poll_cb = done_poll; |
516 | done_poll_cb = done_poll; |
428 | |
517 | |
429 | return 0; |
518 | return 0; |
430 | } |
519 | } |
431 | |
520 | |
432 | X_THREAD_PROC (etp_proc); |
521 | X_THREAD_PROC (etp_proc); |
433 | |
522 | |
|
|
523 | static void ecb_cold |
434 | static void etp_start_thread (void) |
524 | etp_start_thread (void) |
435 | { |
525 | { |
436 | etp_worker *wrk = calloc (1, sizeof (etp_worker)); |
526 | etp_worker *wrk = calloc (1, sizeof (etp_worker)); |
437 | |
527 | |
438 | /*TODO*/ |
528 | /*TODO*/ |
439 | assert (("unable to allocate worker thread data", wrk)); |
529 | assert (("unable to allocate worker thread data", wrk)); |
… | |
… | |
452 | free (wrk); |
542 | free (wrk); |
453 | |
543 | |
454 | X_UNLOCK (wrklock); |
544 | X_UNLOCK (wrklock); |
455 | } |
545 | } |
456 | |
546 | |
|
|
547 | static void |
457 | static void etp_maybe_start_thread (void) |
548 | etp_maybe_start_thread (void) |
458 | { |
549 | { |
459 | if (expect_true (etp_nthreads () >= wanted)) |
550 | if (ecb_expect_true (etp_nthreads () >= wanted)) |
460 | return; |
551 | return; |
461 | |
552 | |
462 | /* todo: maybe use idle here, but might be less exact */ |
553 | /* todo: maybe use idle here, but might be less exact */ |
463 | if (expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ())) |
554 | if (ecb_expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ())) |
464 | return; |
555 | return; |
465 | |
556 | |
466 | etp_start_thread (); |
557 | etp_start_thread (); |
467 | } |
558 | } |
468 | |
559 | |
|
|
560 | static void ecb_cold |
469 | static void etp_end_thread (void) |
561 | etp_end_thread (void) |
470 | { |
562 | { |
471 | eio_req *req = calloc (1, sizeof (eio_req)); |
563 | eio_req *req = calloc (1, sizeof (eio_req)); |
472 | |
564 | |
473 | req->type = -1; |
565 | req->type = -1; |
474 | req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
566 | req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
… | |
… | |
481 | X_LOCK (wrklock); |
573 | X_LOCK (wrklock); |
482 | --started; |
574 | --started; |
483 | X_UNLOCK (wrklock); |
575 | X_UNLOCK (wrklock); |
484 | } |
576 | } |
485 | |
577 | |
486 | static int etp_poll (void) |
578 | static int |
|
|
579 | etp_poll (void) |
487 | { |
580 | { |
488 | unsigned int maxreqs; |
581 | unsigned int maxreqs; |
489 | unsigned int maxtime; |
582 | unsigned int maxtime; |
490 | struct timeval tv_start, tv_now; |
583 | struct timeval tv_start, tv_now; |
491 | |
584 | |
… | |
… | |
521 | |
614 | |
522 | X_LOCK (reqlock); |
615 | X_LOCK (reqlock); |
523 | --nreqs; |
616 | --nreqs; |
524 | X_UNLOCK (reqlock); |
617 | X_UNLOCK (reqlock); |
525 | |
618 | |
526 | if (expect_false (req->type == EIO_GROUP && req->size)) |
619 | if (ecb_expect_false (req->type == EIO_GROUP && req->size)) |
527 | { |
620 | { |
528 | req->int1 = 1; /* mark request as delayed */ |
621 | req->int1 = 1; /* mark request as delayed */ |
529 | continue; |
622 | continue; |
530 | } |
623 | } |
531 | else |
624 | else |
532 | { |
625 | { |
533 | int res = ETP_FINISH (req); |
626 | int res = ETP_FINISH (req); |
534 | if (expect_false (res)) |
627 | if (ecb_expect_false (res)) |
535 | return res; |
628 | return res; |
536 | } |
629 | } |
537 | |
630 | |
538 | if (expect_false (maxreqs && !--maxreqs)) |
631 | if (ecb_expect_false (maxreqs && !--maxreqs)) |
539 | break; |
632 | break; |
540 | |
633 | |
541 | if (maxtime) |
634 | if (maxtime) |
542 | { |
635 | { |
543 | gettimeofday (&tv_now, 0); |
636 | gettimeofday (&tv_now, 0); |
… | |
… | |
549 | |
642 | |
550 | errno = EAGAIN; |
643 | errno = EAGAIN; |
551 | return -1; |
644 | return -1; |
552 | } |
645 | } |
553 | |
646 | |
|
|
647 | static void |
554 | static void etp_cancel (ETP_REQ *req) |
648 | etp_cancel (ETP_REQ *req) |
555 | { |
649 | { |
556 | X_LOCK (wrklock); |
650 | req->cancelled = 1; |
557 | req->flags |= EIO_FLAG_CANCELLED; |
|
|
558 | X_UNLOCK (wrklock); |
|
|
559 | |
651 | |
560 | eio_grp_cancel (req); |
652 | eio_grp_cancel (req); |
561 | } |
653 | } |
562 | |
654 | |
|
|
655 | static void |
563 | static void etp_submit (ETP_REQ *req) |
656 | etp_submit (ETP_REQ *req) |
564 | { |
657 | { |
565 | req->pri -= ETP_PRI_MIN; |
658 | req->pri -= ETP_PRI_MIN; |
566 | |
659 | |
567 | if (expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN; |
660 | if (ecb_expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN; |
568 | if (expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
661 | if (ecb_expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
569 | |
662 | |
570 | if (expect_false (req->type == EIO_GROUP)) |
663 | if (ecb_expect_false (req->type == EIO_GROUP)) |
571 | { |
664 | { |
572 | /* I hope this is worth it :/ */ |
665 | /* I hope this is worth it :/ */ |
573 | X_LOCK (reqlock); |
666 | X_LOCK (reqlock); |
574 | ++nreqs; |
667 | ++nreqs; |
575 | X_UNLOCK (reqlock); |
668 | X_UNLOCK (reqlock); |
… | |
… | |
594 | |
687 | |
595 | etp_maybe_start_thread (); |
688 | etp_maybe_start_thread (); |
596 | } |
689 | } |
597 | } |
690 | } |
598 | |
691 | |
|
|
692 | static void ecb_cold |
599 | static void etp_set_max_poll_time (double nseconds) |
693 | etp_set_max_poll_time (double nseconds) |
600 | { |
694 | { |
601 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
695 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
602 | max_poll_time = nseconds; |
696 | max_poll_time = nseconds * EIO_TICKS; |
603 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
697 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
604 | } |
698 | } |
605 | |
699 | |
|
|
700 | static void ecb_cold |
606 | static void etp_set_max_poll_reqs (unsigned int maxreqs) |
701 | etp_set_max_poll_reqs (unsigned int maxreqs) |
607 | { |
702 | { |
608 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
703 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
609 | max_poll_reqs = maxreqs; |
704 | max_poll_reqs = maxreqs; |
610 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
705 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
611 | } |
706 | } |
612 | |
707 | |
|
|
708 | static void ecb_cold |
613 | static void etp_set_max_idle (unsigned int nthreads) |
709 | etp_set_max_idle (unsigned int nthreads) |
614 | { |
710 | { |
615 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
711 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
616 | max_idle = nthreads <= 0 ? 1 : nthreads; |
712 | max_idle = nthreads; |
617 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
713 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
618 | } |
714 | } |
619 | |
715 | |
|
|
716 | static void ecb_cold |
|
|
717 | etp_set_idle_timeout (unsigned int seconds) |
|
|
718 | { |
|
|
719 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
720 | idle_timeout = seconds; |
|
|
721 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
722 | } |
|
|
723 | |
|
|
724 | static void ecb_cold |
620 | static void etp_set_min_parallel (unsigned int nthreads) |
725 | etp_set_min_parallel (unsigned int nthreads) |
621 | { |
726 | { |
622 | if (wanted < nthreads) |
727 | if (wanted < nthreads) |
623 | wanted = nthreads; |
728 | wanted = nthreads; |
624 | } |
729 | } |
625 | |
730 | |
|
|
731 | static void ecb_cold |
626 | static void etp_set_max_parallel (unsigned int nthreads) |
732 | etp_set_max_parallel (unsigned int nthreads) |
627 | { |
733 | { |
628 | if (wanted > nthreads) |
734 | if (wanted > nthreads) |
629 | wanted = nthreads; |
735 | wanted = nthreads; |
630 | |
736 | |
631 | while (started > wanted) |
737 | while (started > wanted) |
632 | etp_end_thread (); |
738 | etp_end_thread (); |
633 | } |
739 | } |
634 | |
740 | |
635 | /*****************************************************************************/ |
741 | /*****************************************************************************/ |
636 | |
742 | |
|
|
743 | static void |
637 | static void grp_try_feed (eio_req *grp) |
744 | grp_try_feed (eio_req *grp) |
638 | { |
745 | { |
639 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
746 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
640 | { |
747 | { |
641 | grp->flags &= ~EIO_FLAG_GROUPADD; |
748 | grp->flags &= ~EIO_FLAG_GROUPADD; |
642 | |
749 | |
… | |
… | |
649 | break; |
756 | break; |
650 | } |
757 | } |
651 | } |
758 | } |
652 | } |
759 | } |
653 | |
760 | |
|
|
761 | static int |
654 | static int grp_dec (eio_req *grp) |
762 | grp_dec (eio_req *grp) |
655 | { |
763 | { |
656 | --grp->size; |
764 | --grp->size; |
657 | |
765 | |
658 | /* call feeder, if applicable */ |
766 | /* call feeder, if applicable */ |
659 | grp_try_feed (grp); |
767 | grp_try_feed (grp); |
… | |
… | |
663 | return eio_finish (grp); |
771 | return eio_finish (grp); |
664 | else |
772 | else |
665 | return 0; |
773 | return 0; |
666 | } |
774 | } |
667 | |
775 | |
|
|
776 | static void |
668 | void eio_destroy (eio_req *req) |
777 | eio_destroy (eio_req *req) |
669 | { |
778 | { |
670 | if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1); |
779 | if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1); |
671 | if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2); |
780 | if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2); |
672 | |
781 | |
673 | EIO_DESTROY (req); |
782 | EIO_DESTROY (req); |
674 | } |
783 | } |
675 | |
784 | |
|
|
785 | static int |
676 | static int eio_finish (eio_req *req) |
786 | eio_finish (eio_req *req) |
677 | { |
787 | { |
678 | int res = EIO_FINISH (req); |
788 | int res = EIO_FINISH (req); |
679 | |
789 | |
680 | if (req->grp) |
790 | if (req->grp) |
681 | { |
791 | { |
… | |
… | |
689 | if (grp->grp_first == req) |
799 | if (grp->grp_first == req) |
690 | grp->grp_first = req->grp_next; |
800 | grp->grp_first = req->grp_next; |
691 | |
801 | |
692 | res2 = grp_dec (grp); |
802 | res2 = grp_dec (grp); |
693 | |
803 | |
694 | if (!res && res2) |
804 | if (!res) |
695 | res = res2; |
805 | res = res2; |
696 | } |
806 | } |
697 | |
807 | |
698 | eio_destroy (req); |
808 | eio_destroy (req); |
699 | |
809 | |
700 | return res; |
810 | return res; |
701 | } |
811 | } |
702 | |
812 | |
|
|
813 | void |
703 | void eio_grp_cancel (eio_req *grp) |
814 | eio_grp_cancel (eio_req *grp) |
704 | { |
815 | { |
705 | for (grp = grp->grp_first; grp; grp = grp->grp_next) |
816 | for (grp = grp->grp_first; grp; grp = grp->grp_next) |
706 | eio_cancel (grp); |
817 | eio_cancel (grp); |
707 | } |
818 | } |
708 | |
819 | |
|
|
820 | void |
709 | void eio_cancel (eio_req *req) |
821 | eio_cancel (eio_req *req) |
710 | { |
822 | { |
711 | etp_cancel (req); |
823 | etp_cancel (req); |
712 | } |
824 | } |
713 | |
825 | |
|
|
826 | void |
714 | void eio_submit (eio_req *req) |
827 | eio_submit (eio_req *req) |
715 | { |
828 | { |
716 | etp_submit (req); |
829 | etp_submit (req); |
717 | } |
830 | } |
718 | |
831 | |
719 | unsigned int eio_nreqs (void) |
832 | unsigned int |
|
|
833 | eio_nreqs (void) |
720 | { |
834 | { |
721 | return etp_nreqs (); |
835 | return etp_nreqs (); |
722 | } |
836 | } |
723 | |
837 | |
724 | unsigned int eio_nready (void) |
838 | unsigned int |
|
|
839 | eio_nready (void) |
725 | { |
840 | { |
726 | return etp_nready (); |
841 | return etp_nready (); |
727 | } |
842 | } |
728 | |
843 | |
729 | unsigned int eio_npending (void) |
844 | unsigned int |
|
|
845 | eio_npending (void) |
730 | { |
846 | { |
731 | return etp_npending (); |
847 | return etp_npending (); |
732 | } |
848 | } |
733 | |
849 | |
734 | unsigned int eio_nthreads (void) |
850 | unsigned int ecb_cold |
|
|
851 | eio_nthreads (void) |
735 | { |
852 | { |
736 | return etp_nthreads (); |
853 | return etp_nthreads (); |
737 | } |
854 | } |
738 | |
855 | |
|
|
856 | void ecb_cold |
739 | void eio_set_max_poll_time (double nseconds) |
857 | eio_set_max_poll_time (double nseconds) |
740 | { |
858 | { |
741 | etp_set_max_poll_time (nseconds); |
859 | etp_set_max_poll_time (nseconds); |
742 | } |
860 | } |
743 | |
861 | |
|
|
862 | void ecb_cold |
744 | void eio_set_max_poll_reqs (unsigned int maxreqs) |
863 | eio_set_max_poll_reqs (unsigned int maxreqs) |
745 | { |
864 | { |
746 | etp_set_max_poll_reqs (maxreqs); |
865 | etp_set_max_poll_reqs (maxreqs); |
747 | } |
866 | } |
748 | |
867 | |
|
|
868 | void ecb_cold |
749 | void eio_set_max_idle (unsigned int nthreads) |
869 | eio_set_max_idle (unsigned int nthreads) |
750 | { |
870 | { |
751 | etp_set_max_idle (nthreads); |
871 | etp_set_max_idle (nthreads); |
752 | } |
872 | } |
753 | |
873 | |
|
|
874 | void ecb_cold |
|
|
875 | eio_set_idle_timeout (unsigned int seconds) |
|
|
876 | { |
|
|
877 | etp_set_idle_timeout (seconds); |
|
|
878 | } |
|
|
879 | |
|
|
880 | void ecb_cold |
754 | void eio_set_min_parallel (unsigned int nthreads) |
881 | eio_set_min_parallel (unsigned int nthreads) |
755 | { |
882 | { |
756 | etp_set_min_parallel (nthreads); |
883 | etp_set_min_parallel (nthreads); |
757 | } |
884 | } |
758 | |
885 | |
|
|
886 | void ecb_cold |
759 | void eio_set_max_parallel (unsigned int nthreads) |
887 | eio_set_max_parallel (unsigned int nthreads) |
760 | { |
888 | { |
761 | etp_set_max_parallel (nthreads); |
889 | etp_set_max_parallel (nthreads); |
762 | } |
890 | } |
763 | |
891 | |
764 | int eio_poll (void) |
892 | int eio_poll (void) |
… | |
… | |
773 | # undef pread |
901 | # undef pread |
774 | # undef pwrite |
902 | # undef pwrite |
775 | # define pread eio__pread |
903 | # define pread eio__pread |
776 | # define pwrite eio__pwrite |
904 | # define pwrite eio__pwrite |
777 | |
905 | |
778 | static ssize_t |
906 | static eio_ssize_t |
779 | eio__pread (int fd, void *buf, size_t count, off_t offset) |
907 | eio__pread (int fd, void *buf, size_t count, off_t offset) |
780 | { |
908 | { |
781 | ssize_t res; |
909 | eio_ssize_t res; |
782 | off_t ooffset; |
910 | off_t ooffset; |
783 | |
911 | |
784 | X_LOCK (preadwritelock); |
912 | X_LOCK (preadwritelock); |
785 | ooffset = lseek (fd, 0, SEEK_CUR); |
913 | ooffset = lseek (fd, 0, SEEK_CUR); |
786 | lseek (fd, offset, SEEK_SET); |
914 | lseek (fd, offset, SEEK_SET); |
… | |
… | |
789 | X_UNLOCK (preadwritelock); |
917 | X_UNLOCK (preadwritelock); |
790 | |
918 | |
791 | return res; |
919 | return res; |
792 | } |
920 | } |
793 | |
921 | |
794 | static ssize_t |
922 | static eio_ssize_t |
795 | eio__pwrite (int fd, void *buf, size_t count, off_t offset) |
923 | eio__pwrite (int fd, void *buf, size_t count, off_t offset) |
796 | { |
924 | { |
797 | ssize_t res; |
925 | eio_ssize_t res; |
798 | off_t ooffset; |
926 | off_t ooffset; |
799 | |
927 | |
800 | X_LOCK (preadwritelock); |
928 | X_LOCK (preadwritelock); |
801 | ooffset = lseek (fd, 0, SEEK_CUR); |
929 | ooffset = lseek (fd, 0, SEEK_CUR); |
802 | lseek (fd, offset, SEEK_SET); |
930 | lseek (fd, offset, SEEK_SET); |
… | |
… | |
806 | |
934 | |
807 | return res; |
935 | return res; |
808 | } |
936 | } |
809 | #endif |
937 | #endif |
810 | |
938 | |
811 | #ifndef HAVE_FUTIMES |
939 | #ifndef HAVE_UTIMES |
812 | |
940 | |
813 | # undef utimes |
941 | # undef utimes |
814 | # undef futimes |
|
|
815 | # define utimes(path,times) eio__utimes (path, times) |
942 | # define utimes(path,times) eio__utimes (path, times) |
816 | # define futimes(fd,times) eio__futimes (fd, times) |
|
|
817 | |
943 | |
818 | static int |
944 | static int |
819 | eio__utimes (const char *filename, const struct timeval times[2]) |
945 | eio__utimes (const char *filename, const struct timeval times[2]) |
820 | { |
946 | { |
821 | if (times) |
947 | if (times) |
… | |
… | |
829 | } |
955 | } |
830 | else |
956 | else |
831 | return utime (filename, 0); |
957 | return utime (filename, 0); |
832 | } |
958 | } |
833 | |
959 | |
|
|
960 | #endif |
|
|
961 | |
|
|
962 | #ifndef HAVE_FUTIMES |
|
|
963 | |
|
|
964 | # undef futimes |
|
|
965 | # define futimes(fd,times) eio__futimes (fd, times) |
|
|
966 | |
|
|
967 | static int |
834 | static int eio__futimes (int fd, const struct timeval tv[2]) |
968 | eio__futimes (int fd, const struct timeval tv[2]) |
835 | { |
969 | { |
836 | errno = ENOSYS; |
970 | errno = ENOSYS; |
837 | return -1; |
971 | return -1; |
838 | } |
972 | } |
839 | |
973 | |
… | |
… | |
842 | #if !HAVE_FDATASYNC |
976 | #if !HAVE_FDATASYNC |
843 | # undef fdatasync |
977 | # undef fdatasync |
844 | # define fdatasync(fd) fsync (fd) |
978 | # define fdatasync(fd) fsync (fd) |
845 | #endif |
979 | #endif |
846 | |
980 | |
|
|
981 | static int |
|
|
982 | eio__syncfs (int fd) |
|
|
983 | { |
|
|
984 | int res; |
|
|
985 | |
|
|
986 | #if HAVE_SYS_SYNCFS |
|
|
987 | res = (int)syscall (__NR_syncfs, (int)(fd)); |
|
|
988 | #else |
|
|
989 | res = -1; |
|
|
990 | errno = ENOSYS; |
|
|
991 | #endif |
|
|
992 | |
|
|
993 | if (res < 0 && errno == ENOSYS && fd >= 0) |
|
|
994 | sync (); |
|
|
995 | |
|
|
996 | return res; |
|
|
997 | } |
|
|
998 | |
847 | /* sync_file_range always needs emulation */ |
999 | /* sync_file_range always needs emulation */ |
848 | int |
1000 | static int |
849 | eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags) |
1001 | eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags) |
850 | { |
1002 | { |
851 | #if HAVE_SYNC_FILE_RANGE |
1003 | #if HAVE_SYNC_FILE_RANGE |
852 | int res; |
1004 | int res; |
853 | |
1005 | |
… | |
… | |
866 | if (!res || errno != ENOSYS) |
1018 | if (!res || errno != ENOSYS) |
867 | return res; |
1019 | return res; |
868 | #endif |
1020 | #endif |
869 | |
1021 | |
870 | /* even though we could play tricks with the flags, it's better to always |
1022 | /* even though we could play tricks with the flags, it's better to always |
871 | * call fdatasync, as thta matches the expectation of it's users best */ |
1023 | * call fdatasync, as that matches the expectation of its users best */ |
872 | return fdatasync (fd); |
1024 | return fdatasync (fd); |
|
|
1025 | } |
|
|
1026 | |
|
|
1027 | static int |
|
|
1028 | eio__fallocate (int fd, int mode, off_t offset, size_t len) |
|
|
1029 | { |
|
|
1030 | #if HAVE_FALLOCATE |
|
|
1031 | return fallocate (fd, mode, offset, len); |
|
|
1032 | #else |
|
|
1033 | errno = ENOSYS; |
|
|
1034 | return -1; |
|
|
1035 | #endif |
873 | } |
1036 | } |
874 | |
1037 | |
875 | #if !HAVE_READAHEAD |
1038 | #if !HAVE_READAHEAD |
876 | # undef readahead |
1039 | # undef readahead |
877 | # define readahead(fd,offset,count) eio__readahead (fd, offset, count, self) |
1040 | # define readahead(fd,offset,count) eio__readahead (fd, offset, count, self) |
878 | |
1041 | |
879 | static ssize_t |
1042 | static eio_ssize_t |
880 | eio__readahead (int fd, off_t offset, size_t count, etp_worker *self) |
1043 | eio__readahead (int fd, off_t offset, size_t count, etp_worker *self) |
881 | { |
1044 | { |
882 | size_t todo = count; |
1045 | size_t todo = count; |
883 | dBUF; |
1046 | dBUF; |
884 | |
1047 | |
… | |
… | |
889 | pread (fd, eio_buf, len, offset); |
1052 | pread (fd, eio_buf, len, offset); |
890 | offset += len; |
1053 | offset += len; |
891 | todo -= len; |
1054 | todo -= len; |
892 | } |
1055 | } |
893 | |
1056 | |
|
|
1057 | FUBd; |
|
|
1058 | |
894 | errno = 0; |
1059 | errno = 0; |
895 | return count; |
1060 | return count; |
896 | } |
1061 | } |
897 | |
1062 | |
898 | #endif |
1063 | #endif |
899 | |
1064 | |
900 | /* sendfile always needs emulation */ |
1065 | /* sendfile always needs emulation */ |
901 | static ssize_t |
1066 | static eio_ssize_t |
902 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self) |
1067 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count) |
903 | { |
1068 | { |
|
|
1069 | eio_ssize_t written = 0; |
904 | ssize_t res; |
1070 | eio_ssize_t res; |
905 | |
1071 | |
906 | if (!count) |
1072 | if (!count) |
907 | return 0; |
1073 | return 0; |
908 | |
1074 | |
|
|
1075 | for (;;) |
|
|
1076 | { |
|
|
1077 | #ifdef __APPLE__ |
|
|
1078 | # undef HAVE_SENDFILE /* broken, as everything on os x */ |
|
|
1079 | #endif |
909 | #if HAVE_SENDFILE |
1080 | #if HAVE_SENDFILE |
910 | # if __linux |
1081 | # if __linux |
|
|
1082 | off_t soffset = offset; |
911 | res = sendfile (ofd, ifd, &offset, count); |
1083 | res = sendfile (ofd, ifd, &soffset, count); |
912 | |
1084 | |
913 | # elif __freebsd |
1085 | # elif __FreeBSD__ |
914 | /* |
1086 | /* |
915 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
1087 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
916 | * wasted on making it similar to other I/O functions. |
1088 | * wasted on making it similar to other I/O functions. |
917 | */ |
1089 | */ |
918 | { |
|
|
919 | off_t sbytes; |
1090 | off_t sbytes; |
920 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
1091 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
921 | |
1092 | |
922 | if (res < 0 && sbytes) |
1093 | #if 0 /* according to the manpage, this is correct, but broken behaviour */ |
923 | /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ |
1094 | /* freebsd' sendfile will return 0 on success */ |
|
|
1095 | /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */ |
|
|
1096 | /* not on e.g. EIO or EPIPE - sounds broken */ |
|
|
1097 | if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0) |
924 | res = sbytes; |
1098 | res = sbytes; |
925 | } |
1099 | #endif |
|
|
1100 | |
|
|
1101 | /* according to source inspection, this is correct, and useful behaviour */ |
|
|
1102 | if (sbytes) |
|
|
1103 | res = sbytes; |
|
|
1104 | |
|
|
1105 | # elif defined (__APPLE__) |
|
|
1106 | off_t sbytes = count; |
|
|
1107 | res = sendfile (ifd, ofd, offset, &sbytes, 0, 0); |
|
|
1108 | |
|
|
1109 | /* according to the manpage, sbytes is always valid */ |
|
|
1110 | if (sbytes) |
|
|
1111 | res = sbytes; |
926 | |
1112 | |
927 | # elif __hpux |
1113 | # elif __hpux |
928 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
1114 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
929 | |
1115 | |
930 | # elif __solaris |
1116 | # elif __solaris |
931 | { |
|
|
932 | struct sendfilevec vec; |
1117 | struct sendfilevec vec; |
933 | size_t sbytes; |
1118 | size_t sbytes; |
934 | |
1119 | |
935 | vec.sfv_fd = ifd; |
1120 | vec.sfv_fd = ifd; |
936 | vec.sfv_flag = 0; |
1121 | vec.sfv_flag = 0; |
937 | vec.sfv_off = offset; |
1122 | vec.sfv_off = offset; |
938 | vec.sfv_len = count; |
1123 | vec.sfv_len = count; |
939 | |
1124 | |
940 | res = sendfilev (ofd, &vec, 1, &sbytes); |
1125 | res = sendfilev (ofd, &vec, 1, &sbytes); |
941 | |
1126 | |
942 | if (res < 0 && sbytes) |
1127 | if (res < 0 && sbytes) |
943 | res = sbytes; |
1128 | res = sbytes; |
944 | } |
|
|
945 | |
1129 | |
946 | # endif |
1130 | # endif |
|
|
1131 | |
|
|
1132 | #elif defined (_WIN32) && 0 |
|
|
1133 | /* does not work, just for documentation of what would need to be done */ |
|
|
1134 | /* actually, cannot be done like this, as TransmitFile changes the file offset, */ |
|
|
1135 | /* libeio guarantees that the file offset does not change, and windows */ |
|
|
1136 | /* has no way to get an independent handle to the same file description */ |
|
|
1137 | HANDLE h = TO_SOCKET (ifd); |
|
|
1138 | SetFilePointer (h, offset, 0, FILE_BEGIN); |
|
|
1139 | res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0); |
|
|
1140 | |
947 | #else |
1141 | #else |
948 | res = -1; |
1142 | res = -1; |
949 | errno = ENOSYS; |
1143 | errno = ENOSYS; |
950 | #endif |
1144 | #endif |
951 | |
1145 | |
|
|
1146 | /* we assume sendfile can copy at least 128mb in one go */ |
|
|
1147 | if (res <= 128 * 1024 * 1024) |
|
|
1148 | { |
|
|
1149 | if (res > 0) |
|
|
1150 | written += res; |
|
|
1151 | |
|
|
1152 | if (written) |
|
|
1153 | return written; |
|
|
1154 | |
|
|
1155 | break; |
|
|
1156 | } |
|
|
1157 | else |
|
|
1158 | { |
|
|
1159 | /* if we requested more, then probably the kernel was lazy */ |
|
|
1160 | written += res; |
|
|
1161 | offset += res; |
|
|
1162 | count -= res; |
|
|
1163 | |
|
|
1164 | if (!count) |
|
|
1165 | return written; |
|
|
1166 | } |
|
|
1167 | } |
|
|
1168 | |
952 | if (res < 0 |
1169 | if (res < 0 |
953 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
1170 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
|
|
1171 | /* BSDs */ |
|
|
1172 | #ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */ |
|
|
1173 | || errno == ENOTSUP |
|
|
1174 | #endif |
|
|
1175 | #ifdef EOPNOTSUPP /* windows */ |
|
|
1176 | || errno == EOPNOTSUPP /* BSDs */ |
|
|
1177 | #endif |
954 | #if __solaris |
1178 | #if __solaris |
955 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
1179 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
956 | #endif |
1180 | #endif |
957 | ) |
1181 | ) |
958 | ) |
1182 | ) |
… | |
… | |
962 | |
1186 | |
963 | res = 0; |
1187 | res = 0; |
964 | |
1188 | |
965 | while (count) |
1189 | while (count) |
966 | { |
1190 | { |
967 | ssize_t cnt; |
1191 | eio_ssize_t cnt; |
968 | |
1192 | |
969 | cnt = pread (ifd, eio_buf, count > EIO_BUFSIZE ? EIO_BUFSIZE : count, offset); |
1193 | cnt = pread (ifd, eio_buf, count > EIO_BUFSIZE ? EIO_BUFSIZE : count, offset); |
970 | |
1194 | |
971 | if (cnt <= 0) |
1195 | if (cnt <= 0) |
972 | { |
1196 | { |
… | |
… | |
984 | |
1208 | |
985 | offset += cnt; |
1209 | offset += cnt; |
986 | res += cnt; |
1210 | res += cnt; |
987 | count -= cnt; |
1211 | count -= cnt; |
988 | } |
1212 | } |
|
|
1213 | |
|
|
1214 | FUBd; |
989 | } |
1215 | } |
990 | |
1216 | |
991 | return res; |
1217 | return res; |
992 | } |
1218 | } |
993 | |
1219 | |
|
|
1220 | #ifdef PAGESIZE |
|
|
1221 | # define eio_pagesize() PAGESIZE |
|
|
1222 | #else |
|
|
1223 | static intptr_t |
|
|
1224 | eio_pagesize (void) |
|
|
1225 | { |
|
|
1226 | static intptr_t page; |
|
|
1227 | |
|
|
1228 | if (!page) |
|
|
1229 | page = sysconf (_SC_PAGESIZE); |
|
|
1230 | |
|
|
1231 | return page; |
|
|
1232 | } |
|
|
1233 | #endif |
|
|
1234 | |
|
|
1235 | static void |
|
|
1236 | eio_page_align (void **addr, size_t *length) |
|
|
1237 | { |
|
|
1238 | intptr_t mask = eio_pagesize () - 1; |
|
|
1239 | |
|
|
1240 | /* round down addr */ |
|
|
1241 | intptr_t adj = mask & (intptr_t)*addr; |
|
|
1242 | |
|
|
1243 | *addr = (void *)((intptr_t)*addr - adj); |
|
|
1244 | *length += adj; |
|
|
1245 | |
|
|
1246 | /* round up length */ |
|
|
1247 | *length = (*length + mask) & ~mask; |
|
|
1248 | } |
|
|
1249 | |
|
|
1250 | #if !_POSIX_MEMLOCK |
|
|
1251 | # define eio__mlockall(a) EIO_ENOSYS () |
|
|
1252 | #else |
|
|
1253 | |
994 | static int |
1254 | static int |
|
|
1255 | eio__mlockall (int flags) |
|
|
1256 | { |
|
|
1257 | #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7 |
|
|
1258 | extern int mallopt (int, int); |
|
|
1259 | mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */ |
|
|
1260 | #endif |
|
|
1261 | |
|
|
1262 | if (EIO_MCL_CURRENT != MCL_CURRENT |
|
|
1263 | || EIO_MCL_FUTURE != MCL_FUTURE) |
|
|
1264 | { |
|
|
1265 | flags = 0 |
|
|
1266 | | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0) |
|
|
1267 | | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0); |
|
|
1268 | } |
|
|
1269 | |
|
|
1270 | return mlockall (flags); |
|
|
1271 | } |
|
|
1272 | #endif |
|
|
1273 | |
|
|
1274 | #if !_POSIX_MEMLOCK_RANGE |
|
|
1275 | # define eio__mlock(a,b) EIO_ENOSYS () |
|
|
1276 | #else |
|
|
1277 | |
|
|
1278 | static int |
|
|
1279 | eio__mlock (void *addr, size_t length) |
|
|
1280 | { |
|
|
1281 | eio_page_align (&addr, &length); |
|
|
1282 | |
|
|
1283 | return mlock (addr, length); |
|
|
1284 | } |
|
|
1285 | |
|
|
1286 | #endif |
|
|
1287 | |
|
|
1288 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
|
|
1289 | # define eio__msync(a,b,c) EIO_ENOSYS () |
|
|
1290 | #else |
|
|
1291 | |
|
|
1292 | static int |
|
|
1293 | eio__msync (void *mem, size_t len, int flags) |
|
|
1294 | { |
|
|
1295 | eio_page_align (&mem, &len); |
|
|
1296 | |
|
|
1297 | if (EIO_MS_ASYNC != MS_SYNC |
|
|
1298 | || EIO_MS_INVALIDATE != MS_INVALIDATE |
|
|
1299 | || EIO_MS_SYNC != MS_SYNC) |
|
|
1300 | { |
|
|
1301 | flags = 0 |
|
|
1302 | | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0) |
|
|
1303 | | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0) |
|
|
1304 | | (flags & EIO_MS_SYNC ? MS_SYNC : 0); |
|
|
1305 | } |
|
|
1306 | |
|
|
1307 | return msync (mem, len, flags); |
|
|
1308 | } |
|
|
1309 | |
|
|
1310 | #endif |
|
|
1311 | |
|
|
1312 | static int |
|
|
1313 | eio__mtouch (eio_req *req) |
|
|
1314 | { |
|
|
1315 | void *mem = req->ptr2; |
|
|
1316 | size_t len = req->size; |
|
|
1317 | int flags = req->int1; |
|
|
1318 | |
|
|
1319 | eio_page_align (&mem, &len); |
|
|
1320 | |
|
|
1321 | { |
|
|
1322 | intptr_t addr = (intptr_t)mem; |
|
|
1323 | intptr_t end = addr + len; |
|
|
1324 | intptr_t page = eio_pagesize (); |
|
|
1325 | |
|
|
1326 | if (addr < end) |
|
|
1327 | if (flags & EIO_MT_MODIFY) /* modify */ |
|
|
1328 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
|
|
1329 | else |
|
|
1330 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
|
|
1331 | } |
|
|
1332 | |
|
|
1333 | return 0; |
|
|
1334 | } |
|
|
1335 | |
|
|
1336 | /*****************************************************************************/ |
|
|
1337 | /* requests implemented outside eio_execute, because they are so large */ |
|
|
1338 | |
|
|
1339 | static void |
|
|
1340 | eio__realpath (eio_req *req, etp_worker *self) |
|
|
1341 | { |
|
|
1342 | char *rel = req->ptr1; |
|
|
1343 | char *res; |
|
|
1344 | char *tmp1, *tmp2; |
|
|
1345 | #if SYMLOOP_MAX > 32 |
|
|
1346 | int symlinks = SYMLOOP_MAX; |
|
|
1347 | #else |
|
|
1348 | int symlinks = 32; |
|
|
1349 | #endif |
|
|
1350 | |
|
|
1351 | req->result = -1; |
|
|
1352 | |
|
|
1353 | errno = EINVAL; |
|
|
1354 | if (!rel) |
|
|
1355 | return; |
|
|
1356 | |
|
|
1357 | errno = ENOENT; |
|
|
1358 | if (!*rel) |
|
|
1359 | return; |
|
|
1360 | |
|
|
1361 | if (!req->ptr2) |
|
|
1362 | { |
|
|
1363 | X_LOCK (wrklock); |
|
|
1364 | req->flags |= EIO_FLAG_PTR2_FREE; |
|
|
1365 | X_UNLOCK (wrklock); |
|
|
1366 | req->ptr2 = malloc (PATH_MAX * 3); |
|
|
1367 | |
|
|
1368 | errno = ENOMEM; |
|
|
1369 | if (!req->ptr2) |
|
|
1370 | return; |
|
|
1371 | } |
|
|
1372 | |
|
|
1373 | res = req->ptr2; |
|
|
1374 | tmp1 = res + PATH_MAX; |
|
|
1375 | tmp2 = tmp1 + PATH_MAX; |
|
|
1376 | |
|
|
1377 | #if 0 /* disabled, the musl way to do things is just too racy */ |
|
|
1378 | #if __linux && defined(O_NONBLOCK) && defined(O_NOATIME) |
|
|
1379 | /* on linux we may be able to ask the kernel */ |
|
|
1380 | { |
|
|
1381 | int fd = open (rel, O_RDONLY | O_NONBLOCK | O_NOCTTY | O_NOATIME); |
|
|
1382 | |
|
|
1383 | if (fd >= 0) |
|
|
1384 | { |
|
|
1385 | sprintf (tmp1, "/proc/self/fd/%d", fd); |
|
|
1386 | req->result = readlink (tmp1, res, PATH_MAX); |
|
|
1387 | close (fd); |
|
|
1388 | |
|
|
1389 | /* here we should probably stat the open file and the disk file, to make sure they still match */ |
|
|
1390 | |
|
|
1391 | if (req->result > 0) |
|
|
1392 | goto done; |
|
|
1393 | } |
|
|
1394 | else if (errno == ELOOP || errno == ENAMETOOLONG || errno == ENOENT || errno == ENOTDIR || errno == EIO) |
|
|
1395 | return; |
|
|
1396 | } |
|
|
1397 | #endif |
|
|
1398 | #endif |
|
|
1399 | |
|
|
1400 | if (*rel != '/') |
|
|
1401 | { |
|
|
1402 | if (!getcwd (res, PATH_MAX)) |
|
|
1403 | return; |
|
|
1404 | |
|
|
1405 | if (res [1]) /* only use if not / */ |
|
|
1406 | res += strlen (res); |
|
|
1407 | } |
|
|
1408 | |
|
|
1409 | while (*rel) |
|
|
1410 | { |
|
|
1411 | eio_ssize_t len, linklen; |
|
|
1412 | char *beg = rel; |
|
|
1413 | |
|
|
1414 | while (*rel && *rel != '/') |
|
|
1415 | ++rel; |
|
|
1416 | |
|
|
1417 | len = rel - beg; |
|
|
1418 | |
|
|
1419 | if (!len) /* skip slashes */ |
|
|
1420 | { |
|
|
1421 | ++rel; |
|
|
1422 | continue; |
|
|
1423 | } |
|
|
1424 | |
|
|
1425 | if (beg [0] == '.') |
|
|
1426 | { |
|
|
1427 | if (len == 1) |
|
|
1428 | continue; /* . - nop */ |
|
|
1429 | |
|
|
1430 | if (beg [1] == '.' && len == 2) |
|
|
1431 | { |
|
|
1432 | /* .. - back up one component, if possible */ |
|
|
1433 | |
|
|
1434 | while (res != req->ptr2) |
|
|
1435 | if (*--res == '/') |
|
|
1436 | break; |
|
|
1437 | |
|
|
1438 | continue; |
|
|
1439 | } |
|
|
1440 | } |
|
|
1441 | |
|
|
1442 | errno = ENAMETOOLONG; |
|
|
1443 | if (res + 1 + len + 1 >= tmp1) |
|
|
1444 | return; |
|
|
1445 | |
|
|
1446 | /* copy one component */ |
|
|
1447 | *res = '/'; |
|
|
1448 | memcpy (res + 1, beg, len); |
|
|
1449 | |
|
|
1450 | /* zero-terminate, for readlink */ |
|
|
1451 | res [len + 1] = 0; |
|
|
1452 | |
|
|
1453 | /* now check if it's a symlink */ |
|
|
1454 | linklen = readlink (req->ptr2, tmp1, PATH_MAX); |
|
|
1455 | |
|
|
1456 | if (linklen < 0) |
|
|
1457 | { |
|
|
1458 | if (errno != EINVAL) |
|
|
1459 | return; |
|
|
1460 | |
|
|
1461 | /* it's a normal directory. hopefully */ |
|
|
1462 | res += len + 1; |
|
|
1463 | } |
|
|
1464 | else |
|
|
1465 | { |
|
|
1466 | /* yay, it was a symlink - build new path in tmp2 */ |
|
|
1467 | int rellen = strlen (rel); |
|
|
1468 | |
|
|
1469 | errno = ENAMETOOLONG; |
|
|
1470 | if (linklen + 1 + rellen >= PATH_MAX) |
|
|
1471 | return; |
|
|
1472 | |
|
|
1473 | errno = ELOOP; |
|
|
1474 | if (!--symlinks) |
|
|
1475 | return; |
|
|
1476 | |
|
|
1477 | if (*tmp1 == '/') |
|
|
1478 | res = req->ptr2; /* symlink resolves to an absolute path */ |
|
|
1479 | |
|
|
1480 | /* we need to be careful, as rel might point into tmp2 already */ |
|
|
1481 | memmove (tmp2 + linklen + 1, rel, rellen + 1); |
|
|
1482 | tmp2 [linklen] = '/'; |
|
|
1483 | memcpy (tmp2, tmp1, linklen); |
|
|
1484 | |
|
|
1485 | rel = tmp2; |
|
|
1486 | } |
|
|
1487 | } |
|
|
1488 | |
|
|
1489 | /* special case for the lone root path */ |
|
|
1490 | if (res == req->ptr2) |
|
|
1491 | *res++ = '/'; |
|
|
1492 | |
|
|
1493 | req->result = res - (char *)req->ptr2; |
|
|
1494 | |
|
|
1495 | done: |
|
|
1496 | req->ptr2 = realloc (req->ptr2, req->result); /* trade time for space savings */ |
|
|
1497 | } |
|
|
1498 | |
|
|
1499 | static signed char |
995 | eio_dent_cmp (const void *a_, const void *b_) |
1500 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
996 | { |
1501 | { |
997 | const eio_dirent *a = (const eio_dirent *)a_; |
1502 | return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */ |
998 | const eio_dirent *b = (const eio_dirent *)b_; |
1503 | : a->inode < b->inode ? -1 |
|
|
1504 | : a->inode > b->inode ? 1 |
|
|
1505 | : 0; |
|
|
1506 | } |
999 | |
1507 | |
1000 | return (int)b->score - (int)a->score ? (int)b->score - (int)a->score |
1508 | #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0 |
1001 | : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0; /* int might be < ino_t */ |
1509 | |
|
|
1510 | #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */ |
|
|
1511 | #define EIO_SORT_FAST 60 /* when to only use insertion sort */ |
|
|
1512 | |
|
|
1513 | static void |
|
|
1514 | eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, eio_ino_t inode_bits) |
|
|
1515 | { |
|
|
1516 | unsigned char bits [9 + sizeof (eio_ino_t) * 8]; |
|
|
1517 | unsigned char *bit = bits; |
|
|
1518 | |
|
|
1519 | assert (CHAR_BIT == 8); |
|
|
1520 | assert (sizeof (eio_dirent) * 8 < 256); |
|
|
1521 | assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */ |
|
|
1522 | assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */ |
|
|
1523 | |
|
|
1524 | if (size <= EIO_SORT_FAST) |
|
|
1525 | return; |
|
|
1526 | |
|
|
1527 | /* first prepare an array of bits to test in our radix sort */ |
|
|
1528 | /* try to take endianness into account, as well as differences in eio_ino_t sizes */ |
|
|
1529 | /* inode_bits must contain all inodes ORed together */ |
|
|
1530 | /* which is used to skip bits that are 0 everywhere, which is very common */ |
|
|
1531 | { |
|
|
1532 | eio_ino_t endianness; |
|
|
1533 | int i, j; |
|
|
1534 | |
|
|
1535 | /* we store the byte offset of byte n into byte n of "endianness" */ |
|
|
1536 | for (i = 0; i < sizeof (eio_ino_t); ++i) |
|
|
1537 | ((unsigned char *)&endianness)[i] = i; |
|
|
1538 | |
|
|
1539 | *bit++ = 0; |
|
|
1540 | |
|
|
1541 | for (i = 0; i < sizeof (eio_ino_t); ++i) |
|
|
1542 | { |
|
|
1543 | /* shifting off the byte offsets out of "endianness" */ |
|
|
1544 | int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8; |
|
|
1545 | endianness >>= 8; |
|
|
1546 | |
|
|
1547 | for (j = 0; j < 8; ++j) |
|
|
1548 | if (inode_bits & (((eio_ino_t)1) << (i * 8 + j))) |
|
|
1549 | *bit++ = offs + j; |
|
|
1550 | } |
|
|
1551 | |
|
|
1552 | for (j = 0; j < 8; ++j) |
|
|
1553 | if (score_bits & (1 << j)) |
|
|
1554 | *bit++ = offsetof (eio_dirent, score) * 8 + j; |
|
|
1555 | } |
|
|
1556 | |
|
|
1557 | /* now actually do the sorting (a variant of MSD radix sort) */ |
|
|
1558 | { |
|
|
1559 | eio_dirent *base_stk [9 + sizeof (eio_ino_t) * 8], *base; |
|
|
1560 | eio_dirent *end_stk [9 + sizeof (eio_ino_t) * 8], *end; |
|
|
1561 | unsigned char *bit_stk [9 + sizeof (eio_ino_t) * 8]; |
|
|
1562 | int stk_idx = 0; |
|
|
1563 | |
|
|
1564 | base_stk [stk_idx] = dents; |
|
|
1565 | end_stk [stk_idx] = dents + size; |
|
|
1566 | bit_stk [stk_idx] = bit - 1; |
|
|
1567 | |
|
|
1568 | do |
|
|
1569 | { |
|
|
1570 | base = base_stk [stk_idx]; |
|
|
1571 | end = end_stk [stk_idx]; |
|
|
1572 | bit = bit_stk [stk_idx]; |
|
|
1573 | |
|
|
1574 | for (;;) |
|
|
1575 | { |
|
|
1576 | unsigned char O = *bit >> 3; |
|
|
1577 | unsigned char M = 1 << (*bit & 7); |
|
|
1578 | |
|
|
1579 | eio_dirent *a = base; |
|
|
1580 | eio_dirent *b = end; |
|
|
1581 | |
|
|
1582 | if (b - a < EIO_SORT_CUTOFF) |
|
|
1583 | break; |
|
|
1584 | |
|
|
1585 | /* now bit-partition the array on the bit */ |
|
|
1586 | /* this ugly asymmetric loop seems to perform much better than typical */ |
|
|
1587 | /* partition algos found in the literature */ |
|
|
1588 | do |
|
|
1589 | if (!(((unsigned char *)a)[O] & M)) |
|
|
1590 | ++a; |
|
|
1591 | else if (!(((unsigned char *)--b)[O] & M)) |
|
|
1592 | { |
|
|
1593 | eio_dirent tmp = *a; *a = *b; *b = tmp; |
|
|
1594 | ++a; |
|
|
1595 | } |
|
|
1596 | while (b > a); |
|
|
1597 | |
|
|
1598 | /* next bit, or stop, if no bits left in this path */ |
|
|
1599 | if (!*--bit) |
|
|
1600 | break; |
|
|
1601 | |
|
|
1602 | base_stk [stk_idx] = a; |
|
|
1603 | end_stk [stk_idx] = end; |
|
|
1604 | bit_stk [stk_idx] = bit; |
|
|
1605 | ++stk_idx; |
|
|
1606 | |
|
|
1607 | end = a; |
|
|
1608 | } |
|
|
1609 | } |
|
|
1610 | while (stk_idx--); |
|
|
1611 | } |
|
|
1612 | } |
|
|
1613 | |
|
|
1614 | static void |
|
|
1615 | eio_dent_insertion_sort (eio_dirent *dents, int size) |
|
|
1616 | { |
|
|
1617 | /* first move the smallest element to the front, to act as a sentinel */ |
|
|
1618 | { |
|
|
1619 | int i; |
|
|
1620 | eio_dirent *min = dents; |
|
|
1621 | |
|
|
1622 | /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */ |
|
|
1623 | for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; ) |
|
|
1624 | if (EIO_DENT_CMP (dents [i], <, *min)) |
|
|
1625 | min = &dents [i]; |
|
|
1626 | |
|
|
1627 | /* swap elements 0 and j (minimum) */ |
|
|
1628 | { |
|
|
1629 | eio_dirent tmp = *dents; *dents = *min; *min = tmp; |
|
|
1630 | } |
|
|
1631 | } |
|
|
1632 | |
|
|
1633 | /* then do standard insertion sort, assuming that all elements are >= dents [0] */ |
|
|
1634 | { |
|
|
1635 | eio_dirent *i, *j; |
|
|
1636 | |
|
|
1637 | for (i = dents + 1; i < dents + size; ++i) |
|
|
1638 | { |
|
|
1639 | eio_dirent value = *i; |
|
|
1640 | |
|
|
1641 | for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j) |
|
|
1642 | j [1] = j [0]; |
|
|
1643 | |
|
|
1644 | j [1] = value; |
|
|
1645 | } |
|
|
1646 | } |
|
|
1647 | } |
|
|
1648 | |
|
|
1649 | static void |
|
|
1650 | eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, eio_ino_t inode_bits) |
|
|
1651 | { |
|
|
1652 | if (size <= 1) |
|
|
1653 | return; /* our insertion sort relies on size > 0 */ |
|
|
1654 | |
|
|
1655 | /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */ |
|
|
1656 | /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */ |
|
|
1657 | eio_dent_radix_sort (dents, size, score_bits, inode_bits); |
|
|
1658 | |
|
|
1659 | /* use an insertion sort at the end, or for small arrays, */ |
|
|
1660 | /* as insertion sort is more efficient for small partitions */ |
|
|
1661 | eio_dent_insertion_sort (dents, size); |
1002 | } |
1662 | } |
1003 | |
1663 | |
1004 | /* read a full directory */ |
1664 | /* read a full directory */ |
1005 | static void |
1665 | static void |
1006 | eio__scandir (eio_req *req, etp_worker *self) |
1666 | eio__scandir (eio_req *req, etp_worker *self) |
1007 | { |
1667 | { |
1008 | DIR *dirp; |
|
|
1009 | EIO_STRUCT_DIRENT *entp; |
|
|
1010 | unsigned char *name, *names; |
1668 | char *name, *names; |
1011 | int namesalloc = 4096; |
1669 | int namesalloc = 4096 - sizeof (void *) * 4; |
1012 | int namesoffs = 0; |
1670 | int namesoffs = 0; |
1013 | int flags = req->int1; |
1671 | int flags = req->int1; |
1014 | eio_dirent *dents = 0; |
1672 | eio_dirent *dents = 0; |
1015 | int dentalloc = 128; |
1673 | int dentalloc = 128; |
1016 | int dentoffs = 0; |
1674 | int dentoffs = 0; |
|
|
1675 | eio_ino_t inode_bits = 0; |
|
|
1676 | #ifdef _WIN32 |
|
|
1677 | HANDLE dirp; |
|
|
1678 | WIN32_FIND_DATA entp; |
|
|
1679 | #else |
|
|
1680 | DIR *dirp; |
|
|
1681 | EIO_STRUCT_DIRENT *entp; |
|
|
1682 | #endif |
1017 | |
1683 | |
1018 | req->result = -1; |
1684 | req->result = -1; |
1019 | |
1685 | |
1020 | if (!(flags & EIO_READDIR_DENTS)) |
1686 | if (!(flags & EIO_READDIR_DENTS)) |
1021 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
1687 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
1022 | |
1688 | |
1023 | X_LOCK (wrklock); |
1689 | #ifdef _WIN32 |
1024 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
1690 | { |
|
|
1691 | int len = strlen ((const char *)req->ptr1); |
|
|
1692 | char *path = malloc (MAX_PATH); |
|
|
1693 | const char *fmt; |
|
|
1694 | |
|
|
1695 | if (!len) |
|
|
1696 | fmt = "./*"; |
|
|
1697 | else if (((const char *)req->ptr1)[len - 1] == '/' || ((const char *)req->ptr1)[len - 1] == '\\') |
|
|
1698 | fmt = "%s*"; |
|
|
1699 | else |
|
|
1700 | fmt = "%s/*"; |
|
|
1701 | |
|
|
1702 | _snprintf (path, MAX_PATH, fmt, (const char *)req->ptr1); |
|
|
1703 | dirp = FindFirstFile (path, &entp); |
|
|
1704 | free (path); |
|
|
1705 | |
|
|
1706 | if (dirp == INVALID_HANDLE_VALUE) |
|
|
1707 | { |
|
|
1708 | dirp = 0; |
|
|
1709 | |
|
|
1710 | /* should steal _dosmaperr */ |
|
|
1711 | switch (GetLastError ()) |
|
|
1712 | { |
|
|
1713 | case ERROR_FILE_NOT_FOUND: |
|
|
1714 | req->result = 0; |
|
|
1715 | break; |
|
|
1716 | |
|
|
1717 | case ERROR_INVALID_NAME: |
|
|
1718 | case ERROR_PATH_NOT_FOUND: |
|
|
1719 | case ERROR_NO_MORE_FILES: |
|
|
1720 | errno = ENOENT; |
|
|
1721 | break; |
|
|
1722 | |
|
|
1723 | case ERROR_NOT_ENOUGH_MEMORY: |
|
|
1724 | errno = ENOMEM; |
|
|
1725 | break; |
|
|
1726 | |
|
|
1727 | default: |
|
|
1728 | errno = EINVAL; |
|
|
1729 | break; |
|
|
1730 | } |
|
|
1731 | } |
|
|
1732 | } |
|
|
1733 | #else |
1025 | self->dirp = dirp = opendir (req->ptr1); |
1734 | dirp = opendir (req->ptr1); |
|
|
1735 | #endif |
|
|
1736 | |
|
|
1737 | if (req->flags & EIO_FLAG_PTR1_FREE) |
|
|
1738 | free (req->ptr1); |
|
|
1739 | |
1026 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1740 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1027 | req->ptr1 = names = malloc (namesalloc); |
|
|
1028 | req->ptr2 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
1741 | req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
1029 | X_UNLOCK (wrklock); |
1742 | req->ptr2 = names = malloc (namesalloc); |
1030 | |
1743 | |
1031 | if (dirp && names && (!flags || dents)) |
1744 | if (dirp && names && (!flags || dents)) |
1032 | for (;;) |
1745 | for (;;) |
1033 | { |
1746 | { |
|
|
1747 | int done; |
|
|
1748 | |
|
|
1749 | #ifdef _WIN32 |
|
|
1750 | done = !dirp; |
|
|
1751 | #else |
1034 | errno = 0; |
1752 | errno = 0; |
1035 | entp = readdir (dirp); |
1753 | entp = readdir (dirp); |
|
|
1754 | done = !entp; |
|
|
1755 | #endif |
1036 | |
1756 | |
1037 | if (!entp) |
1757 | if (done) |
1038 | { |
1758 | { |
|
|
1759 | #ifndef _WIN32 |
|
|
1760 | int old_errno = errno; |
|
|
1761 | closedir (dirp); |
|
|
1762 | errno = old_errno; |
|
|
1763 | |
1039 | if (errno) |
1764 | if (errno) |
1040 | break; |
1765 | break; |
|
|
1766 | #endif |
1041 | |
1767 | |
1042 | /* sort etc. */ |
1768 | /* sort etc. */ |
1043 | req->int1 = flags; |
1769 | req->int1 = flags; |
1044 | req->result = dentoffs; |
1770 | req->result = dentoffs; |
1045 | |
1771 | |
1046 | if (dents) |
|
|
1047 | { |
|
|
1048 | eio_dirent *ent = dents + dentoffs; |
|
|
1049 | |
|
|
1050 | while (ent > dents) |
|
|
1051 | (--ent)->name = names + (size_t)ent->name; |
|
|
1052 | } |
|
|
1053 | |
|
|
1054 | if (flags & EIO_READDIR_STAT_ORDER |
1772 | if (flags & EIO_READDIR_STAT_ORDER) |
1055 | || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN))) |
1773 | eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits); |
1056 | { |
|
|
1057 | /* pray your qsort doesn't use quicksort */ |
|
|
1058 | qsort (dents, dentoffs, sizeof (*dents), eio_dent_cmp); /* score depends of DIRS_FIRST */ |
|
|
1059 | } |
|
|
1060 | else if (flags & EIO_READDIR_DIRS_FIRST) |
1774 | else if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1775 | if (flags & EIO_READDIR_FOUND_UNKNOWN) |
|
|
1776 | eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */ |
|
|
1777 | else |
1061 | { |
1778 | { |
1062 | /* in this case, all is known, and we just put dirs first and sort them */ |
1779 | /* in this case, all is known, and we just put dirs first and sort them */ |
1063 | eio_dirent *ent = dents + dentoffs; |
1780 | eio_dirent *oth = dents + dentoffs; |
1064 | eio_dirent *dir = dents; |
1781 | eio_dirent *dir = dents; |
1065 | |
1782 | |
1066 | /* now move dirs to the front, and non-dirs to the back */ |
1783 | /* now partition dirs to the front, and non-dirs to the back */ |
1067 | /* by walkign from both sides and swapping if necessary */ |
1784 | /* by walking from both sides and swapping if necessary */ |
1068 | while (ent > dir) |
1785 | while (oth > dir) |
1069 | { |
1786 | { |
1070 | if (dir->type == DT_DIR) |
1787 | if (dir->type == EIO_DT_DIR) |
1071 | ++dir; |
1788 | ++dir; |
1072 | else |
|
|
1073 | { |
|
|
1074 | --ent; |
|
|
1075 | |
|
|
1076 | if (ent->type == DT_DIR) |
1789 | else if ((--oth)->type == EIO_DT_DIR) |
1077 | { |
1790 | { |
1078 | eio_dirent tmp = *dir; |
1791 | eio_dirent tmp = *dir; *dir = *oth; *oth = tmp; |
1079 | *dir = *ent; |
|
|
1080 | *ent = tmp; |
|
|
1081 | |
1792 | |
1082 | ++dir; |
1793 | ++dir; |
1083 | } |
1794 | } |
1084 | } |
1795 | } |
|
|
1796 | |
|
|
1797 | /* now sort the dirs only (dirs all have the same score) */ |
|
|
1798 | eio_dent_sort (dents, dir - dents, 0, inode_bits); |
1085 | } |
1799 | } |
1086 | |
|
|
1087 | /* now sort the dirs only */ |
|
|
1088 | qsort (dents, dir - dents, sizeof (*dents), eio_dent_cmp); |
|
|
1089 | } |
|
|
1090 | |
|
|
1091 | /* only provide the names array unless DENTS is specified */ |
|
|
1092 | if (!(flags & EIO_READDIR_DENTS)) |
|
|
1093 | { |
|
|
1094 | X_LOCK (wrklock); |
|
|
1095 | assert (!dents); |
|
|
1096 | req->ptr1 = 0; |
|
|
1097 | req->ptr2 = names; |
|
|
1098 | X_UNLOCK (wrklock); |
|
|
1099 | } |
|
|
1100 | |
1800 | |
1101 | break; |
1801 | break; |
1102 | } |
1802 | } |
1103 | |
1803 | |
1104 | /* now add the entry to our list(s) */ |
1804 | /* now add the entry to our list(s) */ |
1105 | name = entp->d_name; |
1805 | name = D_NAME (entp); |
1106 | |
1806 | |
1107 | /* skip . and .. entries */ |
1807 | /* skip . and .. entries */ |
1108 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
1808 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
1109 | { |
1809 | { |
1110 | int len = D_NAMLEN (entp) + 1; |
1810 | int len = D_NAMLEN (entp) + 1; |
1111 | |
1811 | |
1112 | while (expect_false (namesoffs + len > namesalloc)) |
1812 | while (ecb_expect_false (namesoffs + len > namesalloc)) |
1113 | { |
1813 | { |
1114 | namesalloc *= 2; |
1814 | namesalloc *= 2; |
1115 | X_LOCK (wrklock); |
|
|
1116 | req->ptr1 = names = realloc (names, namesalloc); |
1815 | req->ptr2 = names = realloc (names, namesalloc); |
1117 | X_UNLOCK (wrklock); |
|
|
1118 | |
1816 | |
1119 | if (!names) |
1817 | if (!names) |
1120 | break; |
1818 | break; |
1121 | } |
1819 | } |
1122 | |
1820 | |
… | |
… | |
1124 | |
1822 | |
1125 | if (dents) |
1823 | if (dents) |
1126 | { |
1824 | { |
1127 | struct eio_dirent *ent; |
1825 | struct eio_dirent *ent; |
1128 | |
1826 | |
1129 | if (expect_false (dentoffs == dentalloc)) |
1827 | if (ecb_expect_false (dentoffs == dentalloc)) |
1130 | { |
1828 | { |
1131 | dentalloc *= 2; |
1829 | dentalloc *= 2; |
1132 | X_LOCK (wrklock); |
|
|
1133 | req->ptr2 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
1830 | req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
1134 | X_UNLOCK (wrklock); |
|
|
1135 | |
1831 | |
1136 | if (!dents) |
1832 | if (!dents) |
1137 | break; |
1833 | break; |
1138 | } |
1834 | } |
1139 | |
1835 | |
1140 | ent = dents + dentoffs; |
1836 | ent = dents + dentoffs; |
1141 | |
1837 | |
1142 | ent->name = (char *)(size_t)namesoffs; /* rather dirtily we store the offset in the pointer */ |
1838 | ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */ |
1143 | ent->namelen = len - 1; |
1839 | ent->namelen = len - 1; |
1144 | ent->inode = D_INO (entp); |
1840 | ent->inode = D_INO (entp); |
|
|
1841 | |
|
|
1842 | inode_bits |= ent->inode; |
1145 | |
1843 | |
1146 | switch (D_TYPE (entp)) |
1844 | switch (D_TYPE (entp)) |
1147 | { |
1845 | { |
1148 | default: |
1846 | default: |
1149 | ent->type = EIO_DT_UNKNOWN; |
1847 | ent->type = EIO_DT_UNKNOWN; |
… | |
… | |
1192 | #ifdef DT_WHT |
1890 | #ifdef DT_WHT |
1193 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
1891 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
1194 | #endif |
1892 | #endif |
1195 | } |
1893 | } |
1196 | |
1894 | |
1197 | ent->score = 0; |
1895 | ent->score = 7; |
1198 | |
1896 | |
1199 | if (flags & EIO_READDIR_DIRS_FIRST) |
1897 | if (flags & EIO_READDIR_DIRS_FIRST) |
1200 | { |
1898 | { |
1201 | if (ent->type == EIO_DT_UNKNOWN) |
1899 | if (ent->type == EIO_DT_UNKNOWN) |
1202 | { |
1900 | { |
1203 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
1901 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
1204 | ent->score = 98; |
1902 | ent->score = 1; |
1205 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
1903 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
1206 | ent->score = len <= 2 ? len + 6 : len <= 4 ? 5 : len <= 7 ? 4 : 1; /* shorter == more likely dir, but avoid too many classes */ |
1904 | ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */ |
1207 | } |
1905 | } |
1208 | else if (ent->type == EIO_DT_DIR) |
1906 | else if (ent->type == EIO_DT_DIR) |
1209 | ent->score = 100; |
1907 | ent->score = 0; |
1210 | } |
1908 | } |
1211 | } |
1909 | } |
1212 | |
1910 | |
1213 | namesoffs += len; |
1911 | namesoffs += len; |
1214 | ++dentoffs; |
1912 | ++dentoffs; |
… | |
… | |
1217 | if (EIO_CANCELLED (req)) |
1915 | if (EIO_CANCELLED (req)) |
1218 | { |
1916 | { |
1219 | errno = ECANCELED; |
1917 | errno = ECANCELED; |
1220 | break; |
1918 | break; |
1221 | } |
1919 | } |
|
|
1920 | |
|
|
1921 | #ifdef _WIN32 |
|
|
1922 | if (!FindNextFile (dirp, &entp)) |
|
|
1923 | { |
|
|
1924 | FindClose (dirp); |
|
|
1925 | dirp = 0; |
|
|
1926 | } |
|
|
1927 | #endif |
1222 | } |
1928 | } |
1223 | } |
|
|
1224 | |
|
|
1225 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
|
|
1226 | # undef msync |
|
|
1227 | # define msync(a,b,c) ((errno = ENOSYS), -1) |
|
|
1228 | #endif |
|
|
1229 | |
|
|
1230 | int |
|
|
1231 | eio__mtouch (void *mem, size_t len, int flags) |
|
|
1232 | { |
|
|
1233 | intptr_t addr = (intptr_t)mem; |
|
|
1234 | intptr_t end = addr + len; |
|
|
1235 | #ifdef PAGESIZE |
|
|
1236 | const intptr_t page = PAGESIZE; |
|
|
1237 | #else |
|
|
1238 | static intptr_t page; |
|
|
1239 | |
|
|
1240 | if (!page) |
|
|
1241 | page = sysconf (_SC_PAGESIZE); |
|
|
1242 | #endif |
|
|
1243 | |
|
|
1244 | addr &= ~(page - 1); /* assume page size is always a power of two */ |
|
|
1245 | |
|
|
1246 | if (addr < end) |
|
|
1247 | if (flags) /* modify */ |
|
|
1248 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len); |
|
|
1249 | else |
|
|
1250 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len); |
|
|
1251 | |
|
|
1252 | return 0; |
|
|
1253 | } |
1929 | } |
1254 | |
1930 | |
1255 | /*****************************************************************************/ |
1931 | /*****************************************************************************/ |
1256 | |
1932 | |
1257 | #define ALLOC(len) \ |
1933 | #define ALLOC(len) \ |
… | |
… | |
1273 | { |
1949 | { |
1274 | ETP_REQ *req; |
1950 | ETP_REQ *req; |
1275 | struct timespec ts; |
1951 | struct timespec ts; |
1276 | etp_worker *self = (etp_worker *)thr_arg; |
1952 | etp_worker *self = (etp_worker *)thr_arg; |
1277 | |
1953 | |
|
|
1954 | #if HAVE_PRCTL_SET_NAME |
|
|
1955 | prctl (PR_SET_NAME, (unsigned long)"eio_thread", 0, 0, 0); |
|
|
1956 | #endif |
|
|
1957 | |
1278 | /* try to distribute timeouts somewhat randomly */ |
1958 | /* try to distribute timeouts somewhat evenly */ |
1279 | ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); |
1959 | ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); |
1280 | |
1960 | |
1281 | for (;;) |
1961 | for (;;) |
1282 | { |
1962 | { |
|
|
1963 | ts.tv_sec = 0; |
|
|
1964 | |
1283 | X_LOCK (reqlock); |
1965 | X_LOCK (reqlock); |
1284 | |
1966 | |
1285 | for (;;) |
1967 | for (;;) |
1286 | { |
1968 | { |
1287 | self->req = req = reqq_shift (&req_queue); |
1969 | self->req = req = reqq_shift (&req_queue); |
1288 | |
1970 | |
1289 | if (req) |
1971 | if (req) |
1290 | break; |
1972 | break; |
1291 | |
1973 | |
|
|
1974 | if (ts.tv_sec == 1) /* no request, but timeout detected, let's quit */ |
|
|
1975 | { |
|
|
1976 | X_UNLOCK (reqlock); |
|
|
1977 | X_LOCK (wrklock); |
|
|
1978 | --started; |
|
|
1979 | X_UNLOCK (wrklock); |
|
|
1980 | goto quit; |
|
|
1981 | } |
|
|
1982 | |
1292 | ++idle; |
1983 | ++idle; |
1293 | |
1984 | |
1294 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
1985 | if (idle <= max_idle) |
1295 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
1986 | /* we are allowed to idle, so do so without any timeout */ |
|
|
1987 | X_COND_WAIT (reqwait, reqlock); |
|
|
1988 | else |
1296 | { |
1989 | { |
1297 | if (idle > max_idle) |
1990 | /* initialise timeout once */ |
1298 | { |
1991 | if (!ts.tv_sec) |
1299 | --idle; |
1992 | ts.tv_sec = time (0) + idle_timeout; |
1300 | X_UNLOCK (reqlock); |
|
|
1301 | X_LOCK (wrklock); |
|
|
1302 | --started; |
|
|
1303 | X_UNLOCK (wrklock); |
|
|
1304 | goto quit; |
|
|
1305 | } |
|
|
1306 | |
1993 | |
1307 | /* we are allowed to idle, so do so without any timeout */ |
|
|
1308 | X_COND_WAIT (reqwait, reqlock); |
1994 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
|
|
1995 | ts.tv_sec = 1; /* assuming this is not a value computed above.,.. */ |
1309 | } |
1996 | } |
1310 | |
1997 | |
1311 | --idle; |
1998 | --idle; |
1312 | } |
1999 | } |
1313 | |
2000 | |
… | |
… | |
1316 | X_UNLOCK (reqlock); |
2003 | X_UNLOCK (reqlock); |
1317 | |
2004 | |
1318 | if (req->type < 0) |
2005 | if (req->type < 0) |
1319 | goto quit; |
2006 | goto quit; |
1320 | |
2007 | |
1321 | if (!EIO_CANCELLED (req)) |
|
|
1322 | ETP_EXECUTE (self, req); |
2008 | ETP_EXECUTE (self, req); |
1323 | |
2009 | |
1324 | X_LOCK (reslock); |
2010 | X_LOCK (reslock); |
1325 | |
2011 | |
1326 | ++npending; |
2012 | ++npending; |
1327 | |
2013 | |
… | |
… | |
1342 | return 0; |
2028 | return 0; |
1343 | } |
2029 | } |
1344 | |
2030 | |
1345 | /*****************************************************************************/ |
2031 | /*****************************************************************************/ |
1346 | |
2032 | |
|
|
2033 | int ecb_cold |
1347 | int eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
2034 | eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
1348 | { |
2035 | { |
|
|
2036 | #if !HAVE_PREADWRITE |
|
|
2037 | X_MUTEX_CREATE (preadwritelock); |
|
|
2038 | #endif |
|
|
2039 | |
1349 | return etp_init (want_poll, done_poll); |
2040 | return etp_init (want_poll, done_poll); |
1350 | } |
2041 | } |
1351 | |
2042 | |
|
|
2043 | ecb_inline void |
1352 | static void eio_api_destroy (eio_req *req) |
2044 | eio_api_destroy (eio_req *req) |
1353 | { |
2045 | { |
1354 | free (req); |
2046 | free (req); |
1355 | } |
2047 | } |
1356 | |
2048 | |
1357 | #define REQ(rtype) \ |
2049 | #define REQ(rtype) \ |
… | |
… | |
1376 | { \ |
2068 | { \ |
1377 | eio_api_destroy (req); \ |
2069 | eio_api_destroy (req); \ |
1378 | return 0; \ |
2070 | return 0; \ |
1379 | } |
2071 | } |
1380 | |
2072 | |
|
|
2073 | static void |
1381 | static void eio_execute (etp_worker *self, eio_req *req) |
2074 | eio_execute (etp_worker *self, eio_req *req) |
1382 | { |
2075 | { |
1383 | errno = 0; |
2076 | if (ecb_expect_false (EIO_CANCELLED (req))) |
|
|
2077 | { |
|
|
2078 | req->result = -1; |
|
|
2079 | req->errorno = ECANCELED; |
|
|
2080 | return; |
|
|
2081 | } |
1384 | |
2082 | |
1385 | switch (req->type) |
2083 | switch (req->type) |
1386 | { |
2084 | { |
1387 | case EIO_READ: ALLOC (req->size); |
2085 | case EIO_READ: ALLOC (req->size); |
1388 | req->result = req->offs >= 0 |
2086 | req->result = req->offs >= 0 |
… | |
… | |
1391 | case EIO_WRITE: req->result = req->offs >= 0 |
2089 | case EIO_WRITE: req->result = req->offs >= 0 |
1392 | ? pwrite (req->int1, req->ptr2, req->size, req->offs) |
2090 | ? pwrite (req->int1, req->ptr2, req->size, req->offs) |
1393 | : write (req->int1, req->ptr2, req->size); break; |
2091 | : write (req->int1, req->ptr2, req->size); break; |
1394 | |
2092 | |
1395 | case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break; |
2093 | case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break; |
1396 | case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break; |
2094 | case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size); break; |
1397 | |
2095 | |
1398 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
2096 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1399 | req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
2097 | req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1400 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
2098 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1401 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
2099 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1402 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
2100 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1403 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
2101 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
2102 | |
|
|
2103 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
2104 | req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
2105 | case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
2106 | req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
1404 | |
2107 | |
1405 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
2108 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
1406 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
2109 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
1407 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
2110 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
1408 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
2111 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
… | |
… | |
1416 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
2119 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
1417 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
2120 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
1418 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
2121 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
1419 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
2122 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
1420 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
2123 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
1421 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break; |
2124 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
1422 | |
2125 | |
|
|
2126 | case EIO_REALPATH: eio__realpath (req, self); break; |
|
|
2127 | |
1423 | case EIO_READLINK: ALLOC (NAME_MAX); |
2128 | case EIO_READLINK: ALLOC (PATH_MAX); |
1424 | req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; |
2129 | req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break; |
1425 | |
2130 | |
1426 | case EIO_SYNC: req->result = 0; sync (); break; |
2131 | case EIO_SYNC: req->result = 0; sync (); break; |
1427 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
2132 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
1428 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
2133 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
1429 | case EIO_MSYNC: req->result = msync (req->ptr2, req->size, req->int1); break; |
2134 | case EIO_SYNCFS: req->result = eio__syncfs (req->int1); break; |
1430 | case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break; |
|
|
1431 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
2135 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
|
|
2136 | case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break; |
|
|
2137 | case EIO_MTOUCH: req->result = eio__mtouch (req); break; |
|
|
2138 | case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break; |
|
|
2139 | case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break; |
|
|
2140 | case EIO_FALLOCATE: req->result = eio__fallocate (req->int1, req->int2, req->offs, req->size); break; |
1432 | |
2141 | |
1433 | case EIO_READDIR: eio__scandir (req, self); break; |
2142 | case EIO_READDIR: eio__scandir (req, self); break; |
1434 | |
2143 | |
1435 | case EIO_BUSY: |
2144 | case EIO_BUSY: |
1436 | #ifdef _WIN32 |
2145 | #ifdef _WIN32 |
1437 | Sleep (req->nv1 * 1000.); |
2146 | Sleep (req->nv1 * 1e3); |
1438 | #else |
2147 | #else |
1439 | { |
2148 | { |
1440 | struct timeval tv; |
2149 | struct timeval tv; |
1441 | |
2150 | |
1442 | tv.tv_sec = req->nv1; |
2151 | tv.tv_sec = req->nv1; |
1443 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; |
2152 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6; |
1444 | |
2153 | |
1445 | req->result = select (0, 0, 0, 0, &tv); |
2154 | req->result = select (0, 0, 0, 0, &tv); |
1446 | } |
2155 | } |
1447 | #endif |
2156 | #endif |
1448 | break; |
2157 | break; |
… | |
… | |
1463 | times = tv; |
2172 | times = tv; |
1464 | } |
2173 | } |
1465 | else |
2174 | else |
1466 | times = 0; |
2175 | times = 0; |
1467 | |
2176 | |
1468 | |
|
|
1469 | req->result = req->type == EIO_FUTIME |
2177 | req->result = req->type == EIO_FUTIME |
1470 | ? futimes (req->int1, times) |
2178 | ? futimes (req->int1, times) |
1471 | : utimes (req->ptr1, times); |
2179 | : utimes (req->ptr1, times); |
1472 | } |
2180 | } |
1473 | break; |
2181 | break; |
… | |
… | |
1478 | case EIO_NOP: |
2186 | case EIO_NOP: |
1479 | req->result = 0; |
2187 | req->result = 0; |
1480 | break; |
2188 | break; |
1481 | |
2189 | |
1482 | case EIO_CUSTOM: |
2190 | case EIO_CUSTOM: |
1483 | ((void (*)(eio_req *))req->feed) (req); |
2191 | req->feed (req); |
1484 | break; |
2192 | break; |
1485 | |
2193 | |
1486 | default: |
2194 | default: |
|
|
2195 | errno = ENOSYS; |
1487 | req->result = -1; |
2196 | req->result = -1; |
1488 | break; |
2197 | break; |
1489 | } |
2198 | } |
1490 | |
2199 | |
1491 | req->errorno = errno; |
2200 | req->errorno = errno; |
… | |
… | |
1516 | eio_req *eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
2225 | eio_req *eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
1517 | { |
2226 | { |
1518 | REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
2227 | REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
1519 | } |
2228 | } |
1520 | |
2229 | |
|
|
2230 | eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data) |
|
|
2231 | { |
|
|
2232 | REQ (EIO_FDATASYNC); req->int1 = fd; SEND; |
|
|
2233 | } |
|
|
2234 | |
|
|
2235 | eio_req *eio_syncfs (int fd, int pri, eio_cb cb, void *data) |
|
|
2236 | { |
|
|
2237 | REQ (EIO_SYNCFS); req->int1 = fd; SEND; |
|
|
2238 | } |
|
|
2239 | |
|
|
2240 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
|
|
2241 | { |
|
|
2242 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
|
|
2243 | } |
|
|
2244 | |
1521 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
2245 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
1522 | { |
2246 | { |
1523 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
2247 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
1524 | } |
2248 | } |
1525 | |
2249 | |
1526 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
2250 | eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data) |
1527 | { |
2251 | { |
1528 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
2252 | REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND; |
1529 | } |
2253 | } |
1530 | |
2254 | |
1531 | eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data) |
2255 | eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data) |
1532 | { |
2256 | { |
1533 | REQ (EIO_FDATASYNC); req->int1 = fd; SEND; |
2257 | REQ (EIO_MLOCKALL); req->int1 = flags; SEND; |
|
|
2258 | } |
|
|
2259 | |
|
|
2260 | eio_req *eio_fallocate (int fd, int mode, off_t offset, size_t len, int pri, eio_cb cb, void *data) |
|
|
2261 | { |
|
|
2262 | REQ (EIO_FALLOCATE); req->int1 = fd; req->int2 = mode; req->offs = offset; req->size = len; SEND; |
1534 | } |
2263 | } |
1535 | |
2264 | |
1536 | eio_req *eio_close (int fd, int pri, eio_cb cb, void *data) |
2265 | eio_req *eio_close (int fd, int pri, eio_cb cb, void *data) |
1537 | { |
2266 | { |
1538 | REQ (EIO_CLOSE); req->int1 = fd; SEND; |
2267 | REQ (EIO_CLOSE); req->int1 = fd; SEND; |
… | |
… | |
1556 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
2285 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
1557 | { |
2286 | { |
1558 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
2287 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
1559 | } |
2288 | } |
1560 | |
2289 | |
|
|
2290 | eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data) |
|
|
2291 | { |
|
|
2292 | REQ (EIO_FSTATVFS); req->int1 = fd; SEND; |
|
|
2293 | } |
|
|
2294 | |
1561 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
2295 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
1562 | { |
2296 | { |
1563 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
2297 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
1564 | } |
2298 | } |
1565 | |
2299 | |
… | |
… | |
1571 | eio_req *eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data) |
2305 | eio_req *eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data) |
1572 | { |
2306 | { |
1573 | REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND; |
2307 | REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND; |
1574 | } |
2308 | } |
1575 | |
2309 | |
1576 | eio_req *eio_fchown (int fd, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data) |
2310 | eio_req *eio_fchown (int fd, eio_uid_t uid, eio_gid_t gid, int pri, eio_cb cb, void *data) |
1577 | { |
2311 | { |
1578 | REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND; |
2312 | REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND; |
1579 | } |
2313 | } |
1580 | |
2314 | |
1581 | eio_req *eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data) |
2315 | eio_req *eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data) |
… | |
… | |
1601 | eio_req *eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data) |
2335 | eio_req *eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data) |
1602 | { |
2336 | { |
1603 | REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND; |
2337 | REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND; |
1604 | } |
2338 | } |
1605 | |
2339 | |
1606 | eio_req *eio_chown (const char *path, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data) |
2340 | eio_req *eio_chown (const char *path, eio_uid_t uid, eio_gid_t gid, int pri, eio_cb cb, void *data) |
1607 | { |
2341 | { |
1608 | REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND; |
2342 | REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND; |
1609 | } |
2343 | } |
1610 | |
2344 | |
1611 | eio_req *eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data) |
2345 | eio_req *eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data) |
… | |
… | |
1627 | eio_req *eio_readlink (const char *path, int pri, eio_cb cb, void *data) |
2361 | eio_req *eio_readlink (const char *path, int pri, eio_cb cb, void *data) |
1628 | { |
2362 | { |
1629 | return eio__1path (EIO_READLINK, path, pri, cb, data); |
2363 | return eio__1path (EIO_READLINK, path, pri, cb, data); |
1630 | } |
2364 | } |
1631 | |
2365 | |
|
|
2366 | eio_req *eio_realpath (const char *path, int pri, eio_cb cb, void *data) |
|
|
2367 | { |
|
|
2368 | return eio__1path (EIO_REALPATH, path, pri, cb, data); |
|
|
2369 | } |
|
|
2370 | |
1632 | eio_req *eio_stat (const char *path, int pri, eio_cb cb, void *data) |
2371 | eio_req *eio_stat (const char *path, int pri, eio_cb cb, void *data) |
1633 | { |
2372 | { |
1634 | return eio__1path (EIO_STAT, path, pri, cb, data); |
2373 | return eio__1path (EIO_STAT, path, pri, cb, data); |
1635 | } |
2374 | } |
1636 | |
2375 | |
1637 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
2376 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
1638 | { |
2377 | { |
1639 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
2378 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
1640 | } |
2379 | } |
1641 | |
2380 | |
|
|
2381 | eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data) |
|
|
2382 | { |
|
|
2383 | return eio__1path (EIO_STATVFS, path, pri, cb, data); |
|
|
2384 | } |
|
|
2385 | |
1642 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
2386 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
1643 | { |
2387 | { |
1644 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
2388 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
1645 | } |
2389 | } |
1646 | |
2390 | |
… | |
… | |
1654 | REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; |
2398 | REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; |
1655 | } |
2399 | } |
1656 | |
2400 | |
1657 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
2401 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
1658 | { |
2402 | { |
1659 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND; |
2403 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND; |
1660 | } |
2404 | } |
1661 | |
2405 | |
1662 | static eio_req * |
2406 | static eio_req * |
1663 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
2407 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1664 | { |
2408 | { |
… | |
… | |
1688 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
2432 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1689 | { |
2433 | { |
1690 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
2434 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
1691 | } |
2435 | } |
1692 | |
2436 | |
1693 | eio_req *eio_custom (eio_cb execute, int pri, eio_cb cb, void *data) |
2437 | eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data) |
1694 | { |
2438 | { |
1695 | REQ (EIO_CUSTOM); req->feed = (void (*)(eio_req *))execute; SEND; |
2439 | REQ (EIO_CUSTOM); req->feed = execute; SEND; |
1696 | } |
2440 | } |
1697 | |
2441 | |
1698 | #endif |
2442 | #endif |
1699 | |
2443 | |
1700 | eio_req *eio_grp (eio_cb cb, void *data) |
2444 | eio_req *eio_grp (eio_cb cb, void *data) |
… | |
… | |
1709 | #undef SEND |
2453 | #undef SEND |
1710 | |
2454 | |
1711 | /*****************************************************************************/ |
2455 | /*****************************************************************************/ |
1712 | /* grp functions */ |
2456 | /* grp functions */ |
1713 | |
2457 | |
|
|
2458 | void |
1714 | void eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit) |
2459 | eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit) |
1715 | { |
2460 | { |
1716 | grp->int2 = limit; |
2461 | grp->int2 = limit; |
1717 | grp->feed = feed; |
2462 | grp->feed = feed; |
1718 | |
2463 | |
1719 | grp_try_feed (grp); |
2464 | grp_try_feed (grp); |
1720 | } |
2465 | } |
1721 | |
2466 | |
|
|
2467 | void |
1722 | void eio_grp_limit (eio_req *grp, int limit) |
2468 | eio_grp_limit (eio_req *grp, int limit) |
1723 | { |
2469 | { |
1724 | grp->int2 = limit; |
2470 | grp->int2 = limit; |
1725 | |
2471 | |
1726 | grp_try_feed (grp); |
2472 | grp_try_feed (grp); |
1727 | } |
2473 | } |
1728 | |
2474 | |
|
|
2475 | void |
1729 | void eio_grp_add (eio_req *grp, eio_req *req) |
2476 | eio_grp_add (eio_req *grp, eio_req *req) |
1730 | { |
2477 | { |
1731 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
2478 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
1732 | |
2479 | |
1733 | grp->flags |= EIO_FLAG_GROUPADD; |
2480 | grp->flags |= EIO_FLAG_GROUPADD; |
1734 | |
2481 | |
… | |
… | |
1745 | } |
2492 | } |
1746 | |
2493 | |
1747 | /*****************************************************************************/ |
2494 | /*****************************************************************************/ |
1748 | /* misc garbage */ |
2495 | /* misc garbage */ |
1749 | |
2496 | |
|
|
2497 | eio_ssize_t |
1750 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
2498 | eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
1751 | { |
2499 | { |
1752 | etp_worker wrk; |
|
|
1753 | |
|
|
1754 | wrk.dbuf = 0; |
|
|
1755 | |
|
|
1756 | eio__sendfile (ofd, ifd, offset, count, &wrk); |
2500 | return eio__sendfile (ofd, ifd, offset, count); |
1757 | |
|
|
1758 | if (wrk.dbuf) |
|
|
1759 | free (wrk.dbuf); |
|
|
1760 | } |
2501 | } |
1761 | |
2502 | |