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