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