1 | /* |
1 | /* |
2 | * libeio implementation |
2 | * libeio implementation |
3 | * |
3 | * |
4 | * Copyright (c) 2007,2008,2009 Marc Alexander Lehmann <libeio@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libeio@schmorp.de> |
5 | * All rights reserved. |
5 | * All rights reserved. |
6 | * |
6 | * |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
8 | * tion, are permitted provided that the following conditions are met: |
8 | * tion, are permitted provided that the following conditions are met: |
9 | * |
9 | * |
… | |
… | |
35 | * and other provisions required by the GPL. If you do not delete the |
35 | * and other provisions required by the GPL. If you do not delete the |
36 | * provisions above, a recipient may use your version of this file under |
36 | * provisions above, a recipient may use your version of this file under |
37 | * either the BSD or the GPL. |
37 | * either the BSD or the GPL. |
38 | */ |
38 | */ |
39 | |
39 | |
|
|
40 | #ifndef _WIN32 |
|
|
41 | # include "config.h" |
|
|
42 | #endif |
|
|
43 | |
40 | #include "eio.h" |
44 | #include "eio.h" |
|
|
45 | #include "ecb.h" |
41 | |
46 | |
42 | #ifdef EIO_STACKSIZE |
47 | #ifdef EIO_STACKSIZE |
43 | # define XTHREAD_STACKSIZE EIO_STACKSIZE |
48 | # define XTHREAD_STACKSIZE EIO_STACKSIZE |
44 | #endif |
49 | #endif |
45 | #include "xthread.h" |
50 | #include "xthread.h" |
… | |
… | |
49 | #include <stdlib.h> |
54 | #include <stdlib.h> |
50 | #include <string.h> |
55 | #include <string.h> |
51 | #include <errno.h> |
56 | #include <errno.h> |
52 | #include <sys/types.h> |
57 | #include <sys/types.h> |
53 | #include <sys/stat.h> |
58 | #include <sys/stat.h> |
|
|
59 | #include <sys/statvfs.h> |
54 | #include <limits.h> |
60 | #include <limits.h> |
55 | #include <fcntl.h> |
61 | #include <fcntl.h> |
56 | #include <assert.h> |
62 | #include <assert.h> |
57 | |
63 | |
|
|
64 | /* intptr_t comes from unistd.h, says POSIX/UNIX/tradition */ |
|
|
65 | /* intptr_t only comes form stdint.h, says idiot openbsd coder */ |
|
|
66 | #if HAVE_STDINT_H |
|
|
67 | # include <stdint.h> |
|
|
68 | #endif |
|
|
69 | |
58 | #ifndef EIO_FINISH |
70 | #ifndef EIO_FINISH |
59 | # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 |
71 | # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 |
60 | #endif |
72 | #endif |
61 | |
73 | |
62 | #ifndef EIO_DESTROY |
74 | #ifndef EIO_DESTROY |
… | |
… | |
70 | #ifdef _WIN32 |
82 | #ifdef _WIN32 |
71 | |
83 | |
72 | /*doh*/ |
84 | /*doh*/ |
73 | #else |
85 | #else |
74 | |
86 | |
75 | # include "config.h" |
|
|
76 | # include <sys/time.h> |
87 | # include <sys/time.h> |
77 | # include <sys/select.h> |
88 | # include <sys/select.h> |
78 | # include <sys/mman.h> |
|
|
79 | # include <unistd.h> |
89 | # include <unistd.h> |
80 | # include <utime.h> |
90 | # include <utime.h> |
81 | # include <signal.h> |
91 | # include <signal.h> |
82 | # include <dirent.h> |
92 | # include <dirent.h> |
83 | |
93 | |
|
|
94 | #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES |
|
|
95 | # include <sys/mman.h> |
|
|
96 | #endif |
|
|
97 | |
84 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
98 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
85 | # if defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) |
99 | # if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__ |
86 | # define _DIRENT_HAVE_D_TYPE /* sigh */ |
100 | # define _DIRENT_HAVE_D_TYPE /* sigh */ |
87 | # define D_INO(de) (de)->d_fileno |
101 | # define D_INO(de) (de)->d_fileno |
88 | # define D_NAMLEN(de) (de)->d_namlen |
102 | # define D_NAMLEN(de) (de)->d_namlen |
89 | # elif defined(__linux) || defined(d_ino) || _XOPEN_SOURCE >= 600 |
103 | # elif __linux || defined d_ino || _XOPEN_SOURCE >= 600 |
90 | # define D_INO(de) (de)->d_ino |
104 | # define D_INO(de) (de)->d_ino |
91 | # endif |
105 | # endif |
92 | |
106 | |
93 | #ifdef _D_EXACT_NAMLEN |
107 | #ifdef _D_EXACT_NAMLEN |
94 | # undef D_NAMLEN |
108 | # undef D_NAMLEN |
… | |
… | |
106 | #endif |
120 | #endif |
107 | |
121 | |
108 | #if HAVE_SENDFILE |
122 | #if HAVE_SENDFILE |
109 | # if __linux |
123 | # if __linux |
110 | # include <sys/sendfile.h> |
124 | # include <sys/sendfile.h> |
111 | # elif __freebsd |
125 | # elif __FreeBSD__ || defined __APPLE__ |
112 | # include <sys/socket.h> |
126 | # include <sys/socket.h> |
113 | # include <sys/uio.h> |
127 | # include <sys/uio.h> |
114 | # elif __hpux |
128 | # elif __hpux |
115 | # include <sys/socket.h> |
129 | # include <sys/socket.h> |
116 | # elif __solaris /* not yet */ |
130 | # elif __solaris |
117 | # include <sys/sendfile.h> |
131 | # include <sys/sendfile.h> |
118 | # else |
132 | # else |
119 | # error sendfile support requested but not available |
133 | # error sendfile support requested but not available |
120 | # endif |
134 | # endif |
121 | #endif |
135 | #endif |
… | |
… | |
128 | #endif |
142 | #endif |
129 | #ifndef D_NAMLEN |
143 | #ifndef D_NAMLEN |
130 | # define D_NAMLEN(de) strlen ((de)->d_name) |
144 | # define D_NAMLEN(de) strlen ((de)->d_name) |
131 | #endif |
145 | #endif |
132 | |
146 | |
133 | /* number of seconds after which an idle threads exit */ |
|
|
134 | #define IDLE_TIMEOUT 10 |
|
|
135 | |
|
|
136 | /* used for struct dirent, AIX doesn't provide it */ |
147 | /* used for struct dirent, AIX doesn't provide it */ |
137 | #ifndef NAME_MAX |
148 | #ifndef NAME_MAX |
138 | # define NAME_MAX 4096 |
149 | # define NAME_MAX 4096 |
|
|
150 | #endif |
|
|
151 | |
|
|
152 | /* used for readlink etc. */ |
|
|
153 | #ifndef PATH_MAX |
|
|
154 | # define PATH_MAX 4096 |
139 | #endif |
155 | #endif |
140 | |
156 | |
141 | /* buffer size for various temporary buffers */ |
157 | /* buffer size for various temporary buffers */ |
142 | #define EIO_BUFSIZE 65536 |
158 | #define EIO_BUFSIZE 65536 |
143 | |
159 | |
… | |
… | |
149 | errno = ENOMEM; \ |
165 | errno = ENOMEM; \ |
150 | if (!eio_buf) \ |
166 | if (!eio_buf) \ |
151 | return -1; |
167 | return -1; |
152 | |
168 | |
153 | #define EIO_TICKS ((1000000 + 1023) >> 10) |
169 | #define EIO_TICKS ((1000000 + 1023) >> 10) |
154 | |
|
|
155 | /*****************************************************************************/ |
|
|
156 | |
|
|
157 | #if __GNUC__ >= 3 |
|
|
158 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
159 | #else |
|
|
160 | # define expect(expr,value) (expr) |
|
|
161 | #endif |
|
|
162 | |
|
|
163 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
164 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
165 | |
|
|
166 | /*****************************************************************************/ |
|
|
167 | |
170 | |
168 | #define ETP_PRI_MIN EIO_PRI_MIN |
171 | #define ETP_PRI_MIN EIO_PRI_MIN |
169 | #define ETP_PRI_MAX EIO_PRI_MAX |
172 | #define ETP_PRI_MAX EIO_PRI_MAX |
170 | |
173 | |
171 | struct etp_worker; |
174 | struct etp_worker; |
… | |
… | |
196 | |
199 | |
197 | /*****************************************************************************/ |
200 | /*****************************************************************************/ |
198 | |
201 | |
199 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
202 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
200 | |
203 | |
201 | /* calculcate time difference in ~1/EIO_TICKS of a second */ |
204 | /* calculate time difference in ~1/EIO_TICKS of a second */ |
|
|
205 | ecb_inline int |
202 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
206 | tvdiff (struct timeval *tv1, struct timeval *tv2) |
203 | { |
207 | { |
204 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
208 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
205 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
209 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
206 | } |
210 | } |
207 | |
211 | |
… | |
… | |
214 | static unsigned int max_poll_reqs; /* reslock */ |
218 | static unsigned int max_poll_reqs; /* reslock */ |
215 | |
219 | |
216 | static volatile unsigned int nreqs; /* reqlock */ |
220 | static volatile unsigned int nreqs; /* reqlock */ |
217 | static volatile unsigned int nready; /* reqlock */ |
221 | static volatile unsigned int nready; /* reqlock */ |
218 | static volatile unsigned int npending; /* reqlock */ |
222 | static volatile unsigned int npending; /* reqlock */ |
219 | static volatile unsigned int max_idle = 4; |
223 | static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */ |
|
|
224 | static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */ |
220 | |
225 | |
221 | static mutex_t wrklock = X_MUTEX_INIT; |
226 | static xmutex_t wrklock; |
222 | static mutex_t reslock = X_MUTEX_INIT; |
227 | static xmutex_t reslock; |
223 | static mutex_t reqlock = X_MUTEX_INIT; |
228 | static xmutex_t reqlock; |
224 | static cond_t reqwait = X_COND_INIT; |
229 | static xcond_t reqwait; |
225 | |
230 | |
226 | #if !HAVE_PREADWRITE |
231 | #if !HAVE_PREADWRITE |
227 | /* |
232 | /* |
228 | * make our pread/pwrite emulation safe against themselves, but not against |
233 | * make our pread/pwrite emulation safe against themselves, but not against |
229 | * normal read/write by using a mutex. slows down execution a lot, |
234 | * normal read/write by using a mutex. slows down execution a lot, |
230 | * but that's your problem, not mine. |
235 | * but that's your problem, not mine. |
231 | */ |
236 | */ |
232 | static mutex_t preadwritelock = X_MUTEX_INIT; |
237 | static xmutex_t preadwritelock = X_MUTEX_INIT; |
233 | #endif |
238 | #endif |
234 | |
239 | |
235 | typedef struct etp_worker |
240 | typedef struct etp_worker |
236 | { |
241 | { |
237 | /* locked by wrklock */ |
242 | /* locked by wrklock */ |
238 | struct etp_worker *prev, *next; |
243 | struct etp_worker *prev, *next; |
239 | |
244 | |
240 | thread_t tid; |
245 | xthread_t tid; |
241 | |
246 | |
242 | /* locked by reslock, reqlock or wrklock */ |
247 | /* locked by reslock, reqlock or wrklock */ |
243 | ETP_REQ *req; /* currently processed request */ |
248 | ETP_REQ *req; /* currently processed request */ |
244 | |
249 | |
245 | ETP_WORKER_COMMON |
250 | ETP_WORKER_COMMON |
… | |
… | |
250 | #define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock) |
255 | #define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock) |
251 | #define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock) |
256 | #define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock) |
252 | |
257 | |
253 | /* worker threads management */ |
258 | /* worker threads management */ |
254 | |
259 | |
|
|
260 | static void ecb_cold |
255 | static void etp_worker_clear (etp_worker *wrk) |
261 | etp_worker_clear (etp_worker *wrk) |
256 | { |
262 | { |
257 | ETP_WORKER_CLEAR (wrk); |
263 | ETP_WORKER_CLEAR (wrk); |
258 | } |
264 | } |
259 | |
265 | |
|
|
266 | static void ecb_cold |
260 | static void etp_worker_free (etp_worker *wrk) |
267 | etp_worker_free (etp_worker *wrk) |
261 | { |
268 | { |
262 | wrk->next->prev = wrk->prev; |
269 | wrk->next->prev = wrk->prev; |
263 | wrk->prev->next = wrk->next; |
270 | wrk->prev->next = wrk->next; |
264 | |
271 | |
265 | free (wrk); |
272 | free (wrk); |
266 | } |
273 | } |
267 | |
274 | |
268 | static unsigned int etp_nreqs (void) |
275 | static unsigned int |
|
|
276 | etp_nreqs (void) |
269 | { |
277 | { |
270 | int retval; |
278 | int retval; |
271 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
279 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
272 | retval = nreqs; |
280 | retval = nreqs; |
273 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
281 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
274 | return retval; |
282 | return retval; |
275 | } |
283 | } |
276 | |
284 | |
277 | static unsigned int etp_nready (void) |
285 | static unsigned int |
|
|
286 | etp_nready (void) |
278 | { |
287 | { |
279 | unsigned int retval; |
288 | unsigned int retval; |
280 | |
289 | |
281 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
290 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
282 | retval = nready; |
291 | retval = nready; |
283 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
292 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
284 | |
293 | |
285 | return retval; |
294 | return retval; |
286 | } |
295 | } |
287 | |
296 | |
288 | static unsigned int etp_npending (void) |
297 | static unsigned int |
|
|
298 | etp_npending (void) |
289 | { |
299 | { |
290 | unsigned int retval; |
300 | unsigned int retval; |
291 | |
301 | |
292 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
302 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
293 | retval = npending; |
303 | retval = npending; |
294 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
304 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
295 | |
305 | |
296 | return retval; |
306 | return retval; |
297 | } |
307 | } |
298 | |
308 | |
299 | static unsigned int etp_nthreads (void) |
309 | static unsigned int |
|
|
310 | etp_nthreads (void) |
300 | { |
311 | { |
301 | unsigned int retval; |
312 | unsigned int retval; |
302 | |
313 | |
303 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
314 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
304 | retval = started; |
315 | retval = started; |
… | |
… | |
318 | } etp_reqq; |
329 | } etp_reqq; |
319 | |
330 | |
320 | static etp_reqq req_queue; |
331 | static etp_reqq req_queue; |
321 | static etp_reqq res_queue; |
332 | static etp_reqq res_queue; |
322 | |
333 | |
|
|
334 | static int ecb_noinline |
323 | static int reqq_push (etp_reqq *q, ETP_REQ *req) |
335 | reqq_push (etp_reqq *q, ETP_REQ *req) |
324 | { |
336 | { |
325 | int pri = req->pri; |
337 | int pri = req->pri; |
326 | req->next = 0; |
338 | req->next = 0; |
327 | |
339 | |
328 | if (q->qe[pri]) |
340 | if (q->qe[pri]) |
… | |
… | |
334 | q->qe[pri] = q->qs[pri] = req; |
346 | q->qe[pri] = q->qs[pri] = req; |
335 | |
347 | |
336 | return q->size++; |
348 | return q->size++; |
337 | } |
349 | } |
338 | |
350 | |
|
|
351 | static ETP_REQ * ecb_noinline |
339 | static ETP_REQ *reqq_shift (etp_reqq *q) |
352 | reqq_shift (etp_reqq *q) |
340 | { |
353 | { |
341 | int pri; |
354 | int pri; |
342 | |
355 | |
343 | if (!q->size) |
356 | if (!q->size) |
344 | return 0; |
357 | return 0; |
… | |
… | |
359 | } |
372 | } |
360 | |
373 | |
361 | abort (); |
374 | abort (); |
362 | } |
375 | } |
363 | |
376 | |
|
|
377 | static void ecb_cold |
|
|
378 | etp_thread_init (void) |
|
|
379 | { |
|
|
380 | X_MUTEX_CREATE (wrklock); |
|
|
381 | X_MUTEX_CREATE (reslock); |
|
|
382 | X_MUTEX_CREATE (reqlock); |
|
|
383 | X_COND_CREATE (reqwait); |
|
|
384 | } |
|
|
385 | |
|
|
386 | static void ecb_cold |
364 | static void etp_atfork_prepare (void) |
387 | etp_atfork_prepare (void) |
365 | { |
388 | { |
366 | X_LOCK (wrklock); |
389 | X_LOCK (wrklock); |
367 | X_LOCK (reqlock); |
390 | X_LOCK (reqlock); |
368 | X_LOCK (reslock); |
391 | X_LOCK (reslock); |
369 | #if !HAVE_PREADWRITE |
392 | #if !HAVE_PREADWRITE |
370 | X_LOCK (preadwritelock); |
393 | X_LOCK (preadwritelock); |
371 | #endif |
394 | #endif |
372 | } |
395 | } |
373 | |
396 | |
|
|
397 | static void ecb_cold |
374 | static void etp_atfork_parent (void) |
398 | etp_atfork_parent (void) |
375 | { |
399 | { |
376 | #if !HAVE_PREADWRITE |
400 | #if !HAVE_PREADWRITE |
377 | X_UNLOCK (preadwritelock); |
401 | X_UNLOCK (preadwritelock); |
378 | #endif |
402 | #endif |
379 | X_UNLOCK (reslock); |
403 | X_UNLOCK (reslock); |
380 | X_UNLOCK (reqlock); |
404 | X_UNLOCK (reqlock); |
381 | X_UNLOCK (wrklock); |
405 | X_UNLOCK (wrklock); |
382 | } |
406 | } |
383 | |
407 | |
|
|
408 | static void ecb_cold |
384 | static void etp_atfork_child (void) |
409 | etp_atfork_child (void) |
385 | { |
410 | { |
386 | ETP_REQ *prv; |
411 | ETP_REQ *prv; |
387 | |
412 | |
388 | while ((prv = reqq_shift (&req_queue))) |
413 | while ((prv = reqq_shift (&req_queue))) |
389 | ETP_DESTROY (prv); |
414 | ETP_DESTROY (prv); |
… | |
… | |
406 | idle = 0; |
431 | idle = 0; |
407 | nreqs = 0; |
432 | nreqs = 0; |
408 | nready = 0; |
433 | nready = 0; |
409 | npending = 0; |
434 | npending = 0; |
410 | |
435 | |
411 | etp_atfork_parent (); |
436 | etp_thread_init (); |
412 | } |
437 | } |
413 | |
438 | |
414 | static void |
439 | static void ecb_cold |
415 | etp_once_init (void) |
440 | etp_once_init (void) |
416 | { |
441 | { |
|
|
442 | etp_thread_init (); |
417 | X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); |
443 | X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); |
418 | } |
444 | } |
419 | |
445 | |
420 | static int |
446 | static int ecb_cold |
421 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
447 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
422 | { |
448 | { |
423 | static pthread_once_t doinit = PTHREAD_ONCE_INIT; |
449 | static pthread_once_t doinit = PTHREAD_ONCE_INIT; |
424 | |
450 | |
425 | pthread_once (&doinit, etp_once_init); |
451 | pthread_once (&doinit, etp_once_init); |
… | |
… | |
430 | return 0; |
456 | return 0; |
431 | } |
457 | } |
432 | |
458 | |
433 | X_THREAD_PROC (etp_proc); |
459 | X_THREAD_PROC (etp_proc); |
434 | |
460 | |
|
|
461 | static void ecb_cold |
435 | static void etp_start_thread (void) |
462 | etp_start_thread (void) |
436 | { |
463 | { |
437 | etp_worker *wrk = calloc (1, sizeof (etp_worker)); |
464 | etp_worker *wrk = calloc (1, sizeof (etp_worker)); |
438 | |
465 | |
439 | /*TODO*/ |
466 | /*TODO*/ |
440 | assert (("unable to allocate worker thread data", wrk)); |
467 | assert (("unable to allocate worker thread data", wrk)); |
… | |
… | |
453 | free (wrk); |
480 | free (wrk); |
454 | |
481 | |
455 | X_UNLOCK (wrklock); |
482 | X_UNLOCK (wrklock); |
456 | } |
483 | } |
457 | |
484 | |
|
|
485 | static void |
458 | static void etp_maybe_start_thread (void) |
486 | etp_maybe_start_thread (void) |
459 | { |
487 | { |
460 | if (expect_true (etp_nthreads () >= wanted)) |
488 | if (ecb_expect_true (etp_nthreads () >= wanted)) |
461 | return; |
489 | return; |
462 | |
490 | |
463 | /* todo: maybe use idle here, but might be less exact */ |
491 | /* todo: maybe use idle here, but might be less exact */ |
464 | if (expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ())) |
492 | if (ecb_expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ())) |
465 | return; |
493 | return; |
466 | |
494 | |
467 | etp_start_thread (); |
495 | etp_start_thread (); |
468 | } |
496 | } |
469 | |
497 | |
|
|
498 | static void ecb_cold |
470 | static void etp_end_thread (void) |
499 | etp_end_thread (void) |
471 | { |
500 | { |
472 | eio_req *req = calloc (1, sizeof (eio_req)); |
501 | eio_req *req = calloc (1, sizeof (eio_req)); |
473 | |
502 | |
474 | req->type = -1; |
503 | req->type = -1; |
475 | req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
504 | req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
… | |
… | |
482 | X_LOCK (wrklock); |
511 | X_LOCK (wrklock); |
483 | --started; |
512 | --started; |
484 | X_UNLOCK (wrklock); |
513 | X_UNLOCK (wrklock); |
485 | } |
514 | } |
486 | |
515 | |
487 | static int etp_poll (void) |
516 | static int |
|
|
517 | etp_poll (void) |
488 | { |
518 | { |
489 | unsigned int maxreqs; |
519 | unsigned int maxreqs; |
490 | unsigned int maxtime; |
520 | unsigned int maxtime; |
491 | struct timeval tv_start, tv_now; |
521 | struct timeval tv_start, tv_now; |
492 | |
522 | |
… | |
… | |
522 | |
552 | |
523 | X_LOCK (reqlock); |
553 | X_LOCK (reqlock); |
524 | --nreqs; |
554 | --nreqs; |
525 | X_UNLOCK (reqlock); |
555 | X_UNLOCK (reqlock); |
526 | |
556 | |
527 | if (expect_false (req->type == EIO_GROUP && req->size)) |
557 | if (ecb_expect_false (req->type == EIO_GROUP && req->size)) |
528 | { |
558 | { |
529 | req->int1 = 1; /* mark request as delayed */ |
559 | req->int1 = 1; /* mark request as delayed */ |
530 | continue; |
560 | continue; |
531 | } |
561 | } |
532 | else |
562 | else |
533 | { |
563 | { |
534 | int res = ETP_FINISH (req); |
564 | int res = ETP_FINISH (req); |
535 | if (expect_false (res)) |
565 | if (ecb_expect_false (res)) |
536 | return res; |
566 | return res; |
537 | } |
567 | } |
538 | |
568 | |
539 | if (expect_false (maxreqs && !--maxreqs)) |
569 | if (ecb_expect_false (maxreqs && !--maxreqs)) |
540 | break; |
570 | break; |
541 | |
571 | |
542 | if (maxtime) |
572 | if (maxtime) |
543 | { |
573 | { |
544 | gettimeofday (&tv_now, 0); |
574 | gettimeofday (&tv_now, 0); |
… | |
… | |
550 | |
580 | |
551 | errno = EAGAIN; |
581 | errno = EAGAIN; |
552 | return -1; |
582 | return -1; |
553 | } |
583 | } |
554 | |
584 | |
|
|
585 | static void |
555 | static void etp_cancel (ETP_REQ *req) |
586 | etp_cancel (ETP_REQ *req) |
556 | { |
587 | { |
557 | X_LOCK (wrklock); |
588 | X_LOCK (wrklock); |
558 | req->flags |= EIO_FLAG_CANCELLED; |
589 | req->flags |= EIO_FLAG_CANCELLED; |
559 | X_UNLOCK (wrklock); |
590 | X_UNLOCK (wrklock); |
560 | |
591 | |
561 | eio_grp_cancel (req); |
592 | eio_grp_cancel (req); |
562 | } |
593 | } |
563 | |
594 | |
|
|
595 | static void |
564 | static void etp_submit (ETP_REQ *req) |
596 | etp_submit (ETP_REQ *req) |
565 | { |
597 | { |
566 | req->pri -= ETP_PRI_MIN; |
598 | req->pri -= ETP_PRI_MIN; |
567 | |
599 | |
568 | if (expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN; |
600 | if (ecb_expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN; |
569 | if (expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
601 | if (ecb_expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
570 | |
602 | |
571 | if (expect_false (req->type == EIO_GROUP)) |
603 | if (ecb_expect_false (req->type == EIO_GROUP)) |
572 | { |
604 | { |
573 | /* I hope this is worth it :/ */ |
605 | /* I hope this is worth it :/ */ |
574 | X_LOCK (reqlock); |
606 | X_LOCK (reqlock); |
575 | ++nreqs; |
607 | ++nreqs; |
576 | X_UNLOCK (reqlock); |
608 | X_UNLOCK (reqlock); |
… | |
… | |
595 | |
627 | |
596 | etp_maybe_start_thread (); |
628 | etp_maybe_start_thread (); |
597 | } |
629 | } |
598 | } |
630 | } |
599 | |
631 | |
|
|
632 | static void ecb_cold |
600 | static void etp_set_max_poll_time (double nseconds) |
633 | etp_set_max_poll_time (double nseconds) |
601 | { |
634 | { |
602 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
635 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
603 | max_poll_time = nseconds; |
636 | max_poll_time = nseconds * EIO_TICKS; |
604 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
637 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
605 | } |
638 | } |
606 | |
639 | |
|
|
640 | static void ecb_cold |
607 | static void etp_set_max_poll_reqs (unsigned int maxreqs) |
641 | etp_set_max_poll_reqs (unsigned int maxreqs) |
608 | { |
642 | { |
609 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
643 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
610 | max_poll_reqs = maxreqs; |
644 | max_poll_reqs = maxreqs; |
611 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
645 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
612 | } |
646 | } |
613 | |
647 | |
|
|
648 | static void ecb_cold |
614 | static void etp_set_max_idle (unsigned int nthreads) |
649 | etp_set_max_idle (unsigned int nthreads) |
615 | { |
650 | { |
616 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
651 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
617 | max_idle = nthreads <= 0 ? 1 : nthreads; |
652 | max_idle = nthreads; |
618 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
653 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
619 | } |
654 | } |
620 | |
655 | |
|
|
656 | static void ecb_cold |
|
|
657 | etp_set_idle_timeout (unsigned int seconds) |
|
|
658 | { |
|
|
659 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
660 | idle_timeout = seconds; |
|
|
661 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
662 | } |
|
|
663 | |
|
|
664 | static void ecb_cold |
621 | static void etp_set_min_parallel (unsigned int nthreads) |
665 | etp_set_min_parallel (unsigned int nthreads) |
622 | { |
666 | { |
623 | if (wanted < nthreads) |
667 | if (wanted < nthreads) |
624 | wanted = nthreads; |
668 | wanted = nthreads; |
625 | } |
669 | } |
626 | |
670 | |
|
|
671 | static void ecb_cold |
627 | static void etp_set_max_parallel (unsigned int nthreads) |
672 | etp_set_max_parallel (unsigned int nthreads) |
628 | { |
673 | { |
629 | if (wanted > nthreads) |
674 | if (wanted > nthreads) |
630 | wanted = nthreads; |
675 | wanted = nthreads; |
631 | |
676 | |
632 | while (started > wanted) |
677 | while (started > wanted) |
633 | etp_end_thread (); |
678 | etp_end_thread (); |
634 | } |
679 | } |
635 | |
680 | |
636 | /*****************************************************************************/ |
681 | /*****************************************************************************/ |
637 | |
682 | |
|
|
683 | static void |
638 | static void grp_try_feed (eio_req *grp) |
684 | grp_try_feed (eio_req *grp) |
639 | { |
685 | { |
640 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
686 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
641 | { |
687 | { |
642 | grp->flags &= ~EIO_FLAG_GROUPADD; |
688 | grp->flags &= ~EIO_FLAG_GROUPADD; |
643 | |
689 | |
… | |
… | |
650 | break; |
696 | break; |
651 | } |
697 | } |
652 | } |
698 | } |
653 | } |
699 | } |
654 | |
700 | |
|
|
701 | static int |
655 | static int grp_dec (eio_req *grp) |
702 | grp_dec (eio_req *grp) |
656 | { |
703 | { |
657 | --grp->size; |
704 | --grp->size; |
658 | |
705 | |
659 | /* call feeder, if applicable */ |
706 | /* call feeder, if applicable */ |
660 | grp_try_feed (grp); |
707 | grp_try_feed (grp); |
… | |
… | |
664 | return eio_finish (grp); |
711 | return eio_finish (grp); |
665 | else |
712 | else |
666 | return 0; |
713 | return 0; |
667 | } |
714 | } |
668 | |
715 | |
|
|
716 | void |
669 | void eio_destroy (eio_req *req) |
717 | eio_destroy (eio_req *req) |
670 | { |
718 | { |
671 | if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1); |
719 | if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1); |
672 | if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2); |
720 | if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2); |
673 | |
721 | |
674 | EIO_DESTROY (req); |
722 | EIO_DESTROY (req); |
675 | } |
723 | } |
676 | |
724 | |
|
|
725 | static int |
677 | static int eio_finish (eio_req *req) |
726 | eio_finish (eio_req *req) |
678 | { |
727 | { |
679 | int res = EIO_FINISH (req); |
728 | int res = EIO_FINISH (req); |
680 | |
729 | |
681 | if (req->grp) |
730 | if (req->grp) |
682 | { |
731 | { |
… | |
… | |
699 | eio_destroy (req); |
748 | eio_destroy (req); |
700 | |
749 | |
701 | return res; |
750 | return res; |
702 | } |
751 | } |
703 | |
752 | |
|
|
753 | void |
704 | void eio_grp_cancel (eio_req *grp) |
754 | eio_grp_cancel (eio_req *grp) |
705 | { |
755 | { |
706 | for (grp = grp->grp_first; grp; grp = grp->grp_next) |
756 | for (grp = grp->grp_first; grp; grp = grp->grp_next) |
707 | eio_cancel (grp); |
757 | eio_cancel (grp); |
708 | } |
758 | } |
709 | |
759 | |
|
|
760 | void |
710 | void eio_cancel (eio_req *req) |
761 | eio_cancel (eio_req *req) |
711 | { |
762 | { |
712 | etp_cancel (req); |
763 | etp_cancel (req); |
713 | } |
764 | } |
714 | |
765 | |
|
|
766 | void |
715 | void eio_submit (eio_req *req) |
767 | eio_submit (eio_req *req) |
716 | { |
768 | { |
717 | etp_submit (req); |
769 | etp_submit (req); |
718 | } |
770 | } |
719 | |
771 | |
720 | unsigned int eio_nreqs (void) |
772 | unsigned int |
|
|
773 | eio_nreqs (void) |
721 | { |
774 | { |
722 | return etp_nreqs (); |
775 | return etp_nreqs (); |
723 | } |
776 | } |
724 | |
777 | |
725 | unsigned int eio_nready (void) |
778 | unsigned int |
|
|
779 | eio_nready (void) |
726 | { |
780 | { |
727 | return etp_nready (); |
781 | return etp_nready (); |
728 | } |
782 | } |
729 | |
783 | |
730 | unsigned int eio_npending (void) |
784 | unsigned int |
|
|
785 | eio_npending (void) |
731 | { |
786 | { |
732 | return etp_npending (); |
787 | return etp_npending (); |
733 | } |
788 | } |
734 | |
789 | |
735 | unsigned int eio_nthreads (void) |
790 | unsigned int ecb_cold |
|
|
791 | eio_nthreads (void) |
736 | { |
792 | { |
737 | return etp_nthreads (); |
793 | return etp_nthreads (); |
738 | } |
794 | } |
739 | |
795 | |
|
|
796 | void ecb_cold |
740 | void eio_set_max_poll_time (double nseconds) |
797 | eio_set_max_poll_time (double nseconds) |
741 | { |
798 | { |
742 | etp_set_max_poll_time (nseconds); |
799 | etp_set_max_poll_time (nseconds); |
743 | } |
800 | } |
744 | |
801 | |
|
|
802 | void ecb_cold |
745 | void eio_set_max_poll_reqs (unsigned int maxreqs) |
803 | eio_set_max_poll_reqs (unsigned int maxreqs) |
746 | { |
804 | { |
747 | etp_set_max_poll_reqs (maxreqs); |
805 | etp_set_max_poll_reqs (maxreqs); |
748 | } |
806 | } |
749 | |
807 | |
|
|
808 | void ecb_cold |
750 | void eio_set_max_idle (unsigned int nthreads) |
809 | eio_set_max_idle (unsigned int nthreads) |
751 | { |
810 | { |
752 | etp_set_max_idle (nthreads); |
811 | etp_set_max_idle (nthreads); |
753 | } |
812 | } |
754 | |
813 | |
|
|
814 | void ecb_cold |
|
|
815 | eio_set_idle_timeout (unsigned int seconds) |
|
|
816 | { |
|
|
817 | etp_set_idle_timeout (seconds); |
|
|
818 | } |
|
|
819 | |
|
|
820 | void ecb_cold |
755 | void eio_set_min_parallel (unsigned int nthreads) |
821 | eio_set_min_parallel (unsigned int nthreads) |
756 | { |
822 | { |
757 | etp_set_min_parallel (nthreads); |
823 | etp_set_min_parallel (nthreads); |
758 | } |
824 | } |
759 | |
825 | |
|
|
826 | void ecb_cold |
760 | void eio_set_max_parallel (unsigned int nthreads) |
827 | eio_set_max_parallel (unsigned int nthreads) |
761 | { |
828 | { |
762 | etp_set_max_parallel (nthreads); |
829 | etp_set_max_parallel (nthreads); |
763 | } |
830 | } |
764 | |
831 | |
765 | int eio_poll (void) |
832 | int eio_poll (void) |
… | |
… | |
807 | |
874 | |
808 | return res; |
875 | return res; |
809 | } |
876 | } |
810 | #endif |
877 | #endif |
811 | |
878 | |
812 | #ifndef HAVE_FUTIMES |
879 | #ifndef HAVE_UTIMES |
813 | |
880 | |
814 | # undef utimes |
881 | # undef utimes |
815 | # undef futimes |
|
|
816 | # define utimes(path,times) eio__utimes (path, times) |
882 | # define utimes(path,times) eio__utimes (path, times) |
817 | # define futimes(fd,times) eio__futimes (fd, times) |
|
|
818 | |
883 | |
819 | static int |
884 | static int |
820 | eio__utimes (const char *filename, const struct timeval times[2]) |
885 | eio__utimes (const char *filename, const struct timeval times[2]) |
821 | { |
886 | { |
822 | if (times) |
887 | if (times) |
… | |
… | |
830 | } |
895 | } |
831 | else |
896 | else |
832 | return utime (filename, 0); |
897 | return utime (filename, 0); |
833 | } |
898 | } |
834 | |
899 | |
|
|
900 | #endif |
|
|
901 | |
|
|
902 | #ifndef HAVE_FUTIMES |
|
|
903 | |
|
|
904 | # undef futimes |
|
|
905 | # define futimes(fd,times) eio__futimes (fd, times) |
|
|
906 | |
|
|
907 | static int |
835 | static int eio__futimes (int fd, const struct timeval tv[2]) |
908 | eio__futimes (int fd, const struct timeval tv[2]) |
836 | { |
909 | { |
837 | errno = ENOSYS; |
910 | errno = ENOSYS; |
838 | return -1; |
911 | return -1; |
839 | } |
912 | } |
840 | |
913 | |
… | |
… | |
844 | # undef fdatasync |
917 | # undef fdatasync |
845 | # define fdatasync(fd) fsync (fd) |
918 | # define fdatasync(fd) fsync (fd) |
846 | #endif |
919 | #endif |
847 | |
920 | |
848 | /* sync_file_range always needs emulation */ |
921 | /* sync_file_range always needs emulation */ |
849 | int |
922 | static int |
850 | eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags) |
923 | eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags) |
851 | { |
924 | { |
852 | #if HAVE_SYNC_FILE_RANGE |
925 | #if HAVE_SYNC_FILE_RANGE |
853 | int res; |
926 | int res; |
854 | |
927 | |
… | |
… | |
867 | if (!res || errno != ENOSYS) |
940 | if (!res || errno != ENOSYS) |
868 | return res; |
941 | return res; |
869 | #endif |
942 | #endif |
870 | |
943 | |
871 | /* even though we could play tricks with the flags, it's better to always |
944 | /* even though we could play tricks with the flags, it's better to always |
872 | * call fdatasync, as thta matches the expectation of it's users best */ |
945 | * call fdatasync, as that matches the expectation of its users best */ |
873 | return fdatasync (fd); |
946 | return fdatasync (fd); |
874 | } |
947 | } |
875 | |
948 | |
876 | #if !HAVE_READAHEAD |
949 | #if !HAVE_READAHEAD |
877 | # undef readahead |
950 | # undef readahead |
… | |
… | |
900 | |
973 | |
901 | /* sendfile always needs emulation */ |
974 | /* sendfile always needs emulation */ |
902 | static ssize_t |
975 | static ssize_t |
903 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self) |
976 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self) |
904 | { |
977 | { |
|
|
978 | ssize_t written = 0; |
905 | ssize_t res; |
979 | ssize_t res; |
906 | |
980 | |
907 | if (!count) |
981 | if (!count) |
908 | return 0; |
982 | return 0; |
909 | |
983 | |
|
|
984 | for (;;) |
|
|
985 | { |
910 | #if HAVE_SENDFILE |
986 | #if HAVE_SENDFILE |
911 | # if __linux |
987 | # if __linux |
|
|
988 | off_t soffset = offset; |
912 | res = sendfile (ofd, ifd, &offset, count); |
989 | res = sendfile (ofd, ifd, &soffset, count); |
913 | |
990 | |
914 | # elif __freebsd |
991 | # elif __FreeBSD__ |
915 | /* |
992 | /* |
916 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
993 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
917 | * wasted on making it similar to other I/O functions. |
994 | * wasted on making it similar to other I/O functions. |
918 | */ |
995 | */ |
919 | { |
|
|
920 | off_t sbytes; |
996 | off_t sbytes; |
921 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
997 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
922 | |
998 | |
923 | if (res < 0 && sbytes) |
999 | #if 0 /* according to the manpage, this is correct, but broken behaviour */ |
924 | /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ |
1000 | /* freebsd' sendfile will return 0 on success */ |
|
|
1001 | /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */ |
|
|
1002 | /* not on e.g. EIO or EPIPE - sounds broken */ |
|
|
1003 | if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0) |
925 | res = sbytes; |
1004 | res = sbytes; |
926 | } |
1005 | #endif |
|
|
1006 | |
|
|
1007 | /* according to source inspection, this is correct, and useful behaviour */ |
|
|
1008 | if (sbytes) |
|
|
1009 | res = sbytes; |
|
|
1010 | |
|
|
1011 | # elif defined (__APPLE__) |
|
|
1012 | off_t sbytes = count; |
|
|
1013 | res = sendfile (ifd, ofd, offset, &sbytes, 0, 0); |
|
|
1014 | |
|
|
1015 | /* according to the manpage, sbytes is always valid */ |
|
|
1016 | if (sbytes) |
|
|
1017 | res = sbytes; |
927 | |
1018 | |
928 | # elif __hpux |
1019 | # elif __hpux |
929 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
1020 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
930 | |
1021 | |
931 | # elif __solaris |
1022 | # elif __solaris |
932 | { |
|
|
933 | struct sendfilevec vec; |
1023 | struct sendfilevec vec; |
934 | size_t sbytes; |
1024 | size_t sbytes; |
935 | |
1025 | |
936 | vec.sfv_fd = ifd; |
1026 | vec.sfv_fd = ifd; |
937 | vec.sfv_flag = 0; |
1027 | vec.sfv_flag = 0; |
938 | vec.sfv_off = offset; |
1028 | vec.sfv_off = offset; |
939 | vec.sfv_len = count; |
1029 | vec.sfv_len = count; |
940 | |
1030 | |
941 | res = sendfilev (ofd, &vec, 1, &sbytes); |
1031 | res = sendfilev (ofd, &vec, 1, &sbytes); |
942 | |
1032 | |
943 | if (res < 0 && sbytes) |
1033 | if (res < 0 && sbytes) |
944 | res = sbytes; |
1034 | res = sbytes; |
945 | } |
|
|
946 | |
1035 | |
947 | # endif |
1036 | # endif |
|
|
1037 | |
|
|
1038 | #elif defined (_WIN32) |
|
|
1039 | /* does not work, just for documentation of what would need to be done */ |
|
|
1040 | /* actually, cannot be done like this, as TransmitFile changes the file offset, */ |
|
|
1041 | /* libeio guarantees that the file offset does not change, and windows */ |
|
|
1042 | /* has no way to get an independent handle to the same file description */ |
|
|
1043 | HANDLE h = TO_SOCKET (ifd); |
|
|
1044 | SetFilePointer (h, offset, 0, FILE_BEGIN); |
|
|
1045 | res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0); |
|
|
1046 | |
948 | #else |
1047 | #else |
949 | res = -1; |
1048 | res = -1; |
950 | errno = ENOSYS; |
1049 | errno = ENOSYS; |
951 | #endif |
1050 | #endif |
952 | |
1051 | |
|
|
1052 | /* we assume sendfile can copy at least 128mb in one go */ |
|
|
1053 | if (res <= 128 * 1024 * 1024) |
|
|
1054 | { |
|
|
1055 | if (res > 0) |
|
|
1056 | written += res; |
|
|
1057 | |
|
|
1058 | if (written) |
|
|
1059 | return written; |
|
|
1060 | |
|
|
1061 | break; |
|
|
1062 | } |
|
|
1063 | else |
|
|
1064 | { |
|
|
1065 | /* if we requested more, then probably the kernel was lazy */ |
|
|
1066 | written += res; |
|
|
1067 | offset += res; |
|
|
1068 | count -= res; |
|
|
1069 | |
|
|
1070 | if (!count) |
|
|
1071 | return written; |
|
|
1072 | } |
|
|
1073 | } |
|
|
1074 | |
953 | if (res < 0 |
1075 | if (res < 0 |
954 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
1076 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
|
|
1077 | /* BSDs */ |
|
|
1078 | #ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */ |
|
|
1079 | || errno == ENOTSUP |
|
|
1080 | #endif |
|
|
1081 | || errno == EOPNOTSUPP /* BSDs */ |
955 | #if __solaris |
1082 | #if __solaris |
956 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
1083 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
957 | #endif |
1084 | #endif |
958 | ) |
1085 | ) |
959 | ) |
1086 | ) |
… | |
… | |
993 | } |
1120 | } |
994 | |
1121 | |
995 | static signed char |
1122 | static signed char |
996 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
1123 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
997 | { |
1124 | { |
998 | return b->score - a->score ? b->score - a->score /* works because our signed char is always 0..100 */ |
1125 | return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */ |
999 | : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0; |
1126 | : a->inode < b->inode ? -1 |
|
|
1127 | : a->inode > b->inode ? 1 |
|
|
1128 | : 0; |
1000 | } |
1129 | } |
1001 | |
1130 | |
|
|
1131 | #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0 |
|
|
1132 | |
1002 | #define EIO_QSORT_CUTOFF 20 /* quite high, but performs well on many filesystems */ |
1133 | #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */ |
|
|
1134 | #define EIO_SORT_FAST 60 /* when to only use insertion sort */ |
1003 | |
1135 | |
1004 | static void |
1136 | static void |
1005 | eio_dent_sort (eio_dirent *dents, int size) |
1137 | eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
1006 | { |
1138 | { |
|
|
1139 | unsigned char bits [9 + sizeof (ino_t) * 8]; |
|
|
1140 | unsigned char *bit = bits; |
|
|
1141 | |
|
|
1142 | assert (CHAR_BIT == 8); |
|
|
1143 | assert (sizeof (eio_dirent) * 8 < 256); |
|
|
1144 | assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */ |
|
|
1145 | assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */ |
|
|
1146 | |
|
|
1147 | if (size <= EIO_SORT_FAST) |
|
|
1148 | return; |
|
|
1149 | |
|
|
1150 | /* first prepare an array of bits to test in our radix sort */ |
|
|
1151 | /* try to take endianness into account, as well as differences in ino_t sizes */ |
|
|
1152 | /* inode_bits must contain all inodes ORed together */ |
|
|
1153 | /* which is used to skip bits that are 0 everywhere, which is very common */ |
|
|
1154 | { |
|
|
1155 | ino_t endianness; |
1007 | int i, j; |
1156 | int i, j; |
1008 | |
1157 | |
1009 | if (size > EIO_QSORT_CUTOFF * 3) /* skip quicksort for small directories */ |
1158 | /* we store the byte offset of byte n into byte n of "endianness" */ |
|
|
1159 | for (i = 0; i < sizeof (ino_t); ++i) |
|
|
1160 | ((unsigned char *)&endianness)[i] = i; |
|
|
1161 | |
|
|
1162 | *bit++ = 0; |
|
|
1163 | |
|
|
1164 | for (i = 0; i < sizeof (ino_t); ++i) |
|
|
1165 | { |
|
|
1166 | /* shifting off the byte offsets out of "endianness" */ |
|
|
1167 | int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8; |
|
|
1168 | endianness >>= 8; |
|
|
1169 | |
|
|
1170 | for (j = 0; j < 8; ++j) |
|
|
1171 | if (inode_bits & (((ino_t)1) << (i * 8 + j))) |
|
|
1172 | *bit++ = offs + j; |
|
|
1173 | } |
|
|
1174 | |
|
|
1175 | for (j = 0; j < 8; ++j) |
|
|
1176 | if (score_bits & (1 << j)) |
|
|
1177 | *bit++ = offsetof (eio_dirent, score) * 8 + j; |
|
|
1178 | } |
|
|
1179 | |
|
|
1180 | /* now actually do the sorting (a variant of MSD radix sort) */ |
|
|
1181 | { |
|
|
1182 | eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base; |
|
|
1183 | eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end; |
|
|
1184 | unsigned char *bit_stk [9 + sizeof (ino_t) * 8]; |
|
|
1185 | int stk_idx = 0; |
|
|
1186 | |
|
|
1187 | base_stk [stk_idx] = dents; |
|
|
1188 | end_stk [stk_idx] = dents + size; |
|
|
1189 | bit_stk [stk_idx] = bit - 1; |
|
|
1190 | |
|
|
1191 | do |
|
|
1192 | { |
|
|
1193 | base = base_stk [stk_idx]; |
|
|
1194 | end = end_stk [stk_idx]; |
|
|
1195 | bit = bit_stk [stk_idx]; |
|
|
1196 | |
|
|
1197 | for (;;) |
|
|
1198 | { |
|
|
1199 | unsigned char O = *bit >> 3; |
|
|
1200 | unsigned char M = 1 << (*bit & 7); |
|
|
1201 | |
|
|
1202 | eio_dirent *a = base; |
|
|
1203 | eio_dirent *b = end; |
|
|
1204 | |
|
|
1205 | if (b - a < EIO_SORT_CUTOFF) |
|
|
1206 | break; |
|
|
1207 | |
|
|
1208 | /* now bit-partition the array on the bit */ |
|
|
1209 | /* this ugly asymmetric loop seems to perform much better than typical */ |
|
|
1210 | /* partition algos found in the literature */ |
|
|
1211 | do |
|
|
1212 | if (!(((unsigned char *)a)[O] & M)) |
|
|
1213 | ++a; |
|
|
1214 | else if (!(((unsigned char *)--b)[O] & M)) |
|
|
1215 | { |
|
|
1216 | eio_dirent tmp = *a; *a = *b; *b = tmp; |
|
|
1217 | ++a; |
|
|
1218 | } |
|
|
1219 | while (b > a); |
|
|
1220 | |
|
|
1221 | /* next bit, or stop, if no bits left in this path */ |
|
|
1222 | if (!*--bit) |
|
|
1223 | break; |
|
|
1224 | |
|
|
1225 | base_stk [stk_idx] = a; |
|
|
1226 | end_stk [stk_idx] = end; |
|
|
1227 | bit_stk [stk_idx] = bit; |
|
|
1228 | ++stk_idx; |
|
|
1229 | |
|
|
1230 | end = a; |
|
|
1231 | } |
|
|
1232 | } |
|
|
1233 | while (stk_idx--); |
|
|
1234 | } |
|
|
1235 | } |
|
|
1236 | |
|
|
1237 | static void |
|
|
1238 | eio_dent_insertion_sort (eio_dirent *dents, int size) |
|
|
1239 | { |
|
|
1240 | /* first move the smallest element to the front, to act as a sentinel */ |
|
|
1241 | { |
|
|
1242 | int i; |
|
|
1243 | eio_dirent *min = dents; |
|
|
1244 | |
|
|
1245 | /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */ |
|
|
1246 | for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; ) |
|
|
1247 | if (EIO_DENT_CMP (dents [i], <, *min)) |
|
|
1248 | min = &dents [i]; |
|
|
1249 | |
|
|
1250 | /* swap elements 0 and j (minimum) */ |
1010 | { |
1251 | { |
1011 | /* first, use quicksort */ |
1252 | eio_dirent tmp = *dents; *dents = *min; *min = tmp; |
1012 | /* should be good for 2**31 entries */ |
1253 | } |
1013 | struct rng { int l, r; } rng [32]; |
1254 | } |
1014 | |
1255 | |
1015 | i = 0; |
1256 | /* then do standard insertion sort, assuming that all elements are >= dents [0] */ |
1016 | rng[0].l = 0; |
1257 | { |
1017 | rng[0].r = size; |
1258 | eio_dirent *i, *j; |
1018 | |
1259 | |
1019 | while (expect_true (i >= 0)) |
1260 | for (i = dents + 1; i < dents + size; ++i) |
1020 | { |
1261 | { |
1021 | int L = rng [i].l; |
1262 | eio_dirent value = *i; |
1022 | int R = rng [i].r - 1; |
|
|
1023 | |
1263 | |
1024 | if (expect_false (L + EIO_QSORT_CUTOFF < R)) |
1264 | for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j) |
1025 | { |
1265 | j [1] = j [0]; |
1026 | eio_dirent piv = dents [L]; |
|
|
1027 | |
1266 | |
1028 | while (L < R) |
1267 | j [1] = value; |
1029 | { |
|
|
1030 | while (eio_dent_cmp (&dents [R], &piv) >= 0 && L < R) |
|
|
1031 | --R; |
|
|
1032 | |
|
|
1033 | if (L < R) |
|
|
1034 | dents [L++] = dents [R]; |
|
|
1035 | |
|
|
1036 | while (eio_dent_cmp (&dents [L], &piv) <= 0 && L < R) |
|
|
1037 | ++L; |
|
|
1038 | |
|
|
1039 | if (L < R) |
|
|
1040 | dents [R--] = dents [L]; |
|
|
1041 | } |
|
|
1042 | |
|
|
1043 | dents [L] = piv; |
|
|
1044 | |
|
|
1045 | ++i; |
|
|
1046 | rng [i].l = L + 1; |
|
|
1047 | rng [i].r = rng [i - 1].r; |
|
|
1048 | rng [i - 1].r = L; |
|
|
1049 | |
|
|
1050 | if (rng [i].r - rng [i].l > rng [i - 1].r - rng [i - 1].l) |
|
|
1051 | { |
|
|
1052 | struct rng t; |
|
|
1053 | |
|
|
1054 | t = rng [i]; rng [i] = rng [i - 1]; rng [i - 1] = t; |
|
|
1055 | } |
|
|
1056 | } |
|
|
1057 | else |
|
|
1058 | --i; |
|
|
1059 | } |
1268 | } |
1060 | } |
1269 | } |
|
|
1270 | } |
1061 | |
1271 | |
1062 | /* use a simple insertion sort at the end */ |
1272 | static void |
1063 | for (i = 1; i < size; ++i) |
1273 | eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
1064 | { |
1274 | { |
1065 | eio_dirent value = dents [i]; |
1275 | if (size <= 1) |
|
|
1276 | return; /* our insertion sort relies on size > 0 */ |
1066 | |
1277 | |
1067 | for (j = i - 1; j >= 0 && eio_dent_cmp (&dents [j], &value) > 0; --j) |
1278 | /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */ |
1068 | dents [j + 1] = dents [j]; |
1279 | /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */ |
|
|
1280 | eio_dent_radix_sort (dents, size, score_bits, inode_bits); |
1069 | |
1281 | |
1070 | dents [j + 1] = value; |
1282 | /* use an insertion sort at the end, or for small arrays, */ |
1071 | } |
1283 | /* as insertion sort is more efficient for small partitions */ |
|
|
1284 | eio_dent_insertion_sort (dents, size); |
1072 | } |
1285 | } |
1073 | |
1286 | |
1074 | /* read a full directory */ |
1287 | /* read a full directory */ |
1075 | static void |
1288 | static void |
1076 | eio__scandir (eio_req *req, etp_worker *self) |
1289 | eio__scandir (eio_req *req, etp_worker *self) |
… | |
… | |
1082 | int namesoffs = 0; |
1295 | int namesoffs = 0; |
1083 | int flags = req->int1; |
1296 | int flags = req->int1; |
1084 | eio_dirent *dents = 0; |
1297 | eio_dirent *dents = 0; |
1085 | int dentalloc = 128; |
1298 | int dentalloc = 128; |
1086 | int dentoffs = 0; |
1299 | int dentoffs = 0; |
|
|
1300 | ino_t inode_bits = 0; |
1087 | |
1301 | |
1088 | req->result = -1; |
1302 | req->result = -1; |
1089 | |
1303 | |
1090 | if (!(flags & EIO_READDIR_DENTS)) |
1304 | if (!(flags & EIO_READDIR_DENTS)) |
1091 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
1305 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
1092 | |
1306 | |
1093 | X_LOCK (wrklock); |
1307 | X_LOCK (wrklock); |
1094 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
1308 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
1095 | self->dirp = dirp = opendir (req->ptr1); |
1309 | self->dirp = dirp = opendir (req->ptr1); |
|
|
1310 | |
1096 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1311 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1097 | req->ptr1 = names = malloc (namesalloc); |
|
|
1098 | req->ptr2 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
1312 | req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
|
|
1313 | req->ptr2 = names = malloc (namesalloc); |
1099 | X_UNLOCK (wrklock); |
1314 | X_UNLOCK (wrklock); |
1100 | |
1315 | |
1101 | if (dirp && names && (!flags || dents)) |
1316 | if (dirp && names && (!flags || dents)) |
1102 | for (;;) |
1317 | for (;;) |
1103 | { |
1318 | { |
… | |
… | |
1111 | |
1326 | |
1112 | /* sort etc. */ |
1327 | /* sort etc. */ |
1113 | req->int1 = flags; |
1328 | req->int1 = flags; |
1114 | req->result = dentoffs; |
1329 | req->result = dentoffs; |
1115 | |
1330 | |
1116 | if (dents) |
|
|
1117 | { |
|
|
1118 | eio_dirent *ent = dents + dentoffs; |
|
|
1119 | |
|
|
1120 | while (ent > dents) |
|
|
1121 | (--ent)->name = names + (size_t)ent->name; |
|
|
1122 | } |
|
|
1123 | |
|
|
1124 | if (flags & EIO_READDIR_STAT_ORDER |
1331 | if (flags & EIO_READDIR_STAT_ORDER) |
1125 | || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN))) |
1332 | eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits); |
1126 | eio_dent_sort (dents, dentoffs); /* score depends of DIRS_FIRST */ |
|
|
1127 | else if (flags & EIO_READDIR_DIRS_FIRST) |
1333 | else if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1334 | if (flags & EIO_READDIR_FOUND_UNKNOWN) |
|
|
1335 | eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */ |
|
|
1336 | else |
1128 | { |
1337 | { |
1129 | /* in this case, all is known, and we just put dirs first and sort them */ |
1338 | /* in this case, all is known, and we just put dirs first and sort them */ |
1130 | eio_dirent *ent = dents + dentoffs; |
1339 | eio_dirent *oth = dents + dentoffs; |
1131 | eio_dirent *dir = dents; |
1340 | eio_dirent *dir = dents; |
1132 | |
1341 | |
1133 | /* now move dirs to the front, and non-dirs to the back */ |
1342 | /* now partition dirs to the front, and non-dirs to the back */ |
1134 | /* by walking from both sides and swapping if necessary */ |
1343 | /* by walking from both sides and swapping if necessary */ |
1135 | while (ent > dir) |
1344 | while (oth > dir) |
1136 | { |
1345 | { |
1137 | if (dir->type == DT_DIR) |
1346 | if (dir->type == EIO_DT_DIR) |
1138 | ++dir; |
1347 | ++dir; |
1139 | else |
|
|
1140 | { |
|
|
1141 | --ent; |
|
|
1142 | |
|
|
1143 | if (ent->type == DT_DIR) |
1348 | else if ((--oth)->type == EIO_DT_DIR) |
1144 | { |
1349 | { |
1145 | eio_dirent tmp = *dir; |
1350 | eio_dirent tmp = *dir; *dir = *oth; *oth = tmp; |
1146 | *dir = *ent; |
|
|
1147 | *ent = tmp; |
|
|
1148 | |
1351 | |
1149 | ++dir; |
1352 | ++dir; |
1150 | } |
1353 | } |
1151 | } |
1354 | } |
|
|
1355 | |
|
|
1356 | /* now sort the dirs only (dirs all have the same score) */ |
|
|
1357 | eio_dent_sort (dents, dir - dents, 0, inode_bits); |
1152 | } |
1358 | } |
1153 | |
|
|
1154 | /* now sort the dirs only */ |
|
|
1155 | eio_dent_sort (dents, dir - dents); |
|
|
1156 | } |
|
|
1157 | |
|
|
1158 | /* only provide the names array unless DENTS is specified */ |
|
|
1159 | if (!(flags & EIO_READDIR_DENTS)) |
|
|
1160 | { |
|
|
1161 | X_LOCK (wrklock); |
|
|
1162 | assert (!dents); |
|
|
1163 | req->ptr1 = 0; |
|
|
1164 | req->ptr2 = names; |
|
|
1165 | X_UNLOCK (wrklock); |
|
|
1166 | } |
|
|
1167 | |
1359 | |
1168 | break; |
1360 | break; |
1169 | } |
1361 | } |
1170 | |
1362 | |
1171 | /* now add the entry to our list(s) */ |
1363 | /* now add the entry to our list(s) */ |
… | |
… | |
1174 | /* skip . and .. entries */ |
1366 | /* skip . and .. entries */ |
1175 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
1367 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
1176 | { |
1368 | { |
1177 | int len = D_NAMLEN (entp) + 1; |
1369 | int len = D_NAMLEN (entp) + 1; |
1178 | |
1370 | |
1179 | while (expect_false (namesoffs + len > namesalloc)) |
1371 | while (ecb_expect_false (namesoffs + len > namesalloc)) |
1180 | { |
1372 | { |
1181 | namesalloc *= 2; |
1373 | namesalloc *= 2; |
1182 | X_LOCK (wrklock); |
1374 | X_LOCK (wrklock); |
1183 | req->ptr1 = names = realloc (names, namesalloc); |
1375 | req->ptr2 = names = realloc (names, namesalloc); |
1184 | X_UNLOCK (wrklock); |
1376 | X_UNLOCK (wrklock); |
1185 | |
1377 | |
1186 | if (!names) |
1378 | if (!names) |
1187 | break; |
1379 | break; |
1188 | } |
1380 | } |
… | |
… | |
1191 | |
1383 | |
1192 | if (dents) |
1384 | if (dents) |
1193 | { |
1385 | { |
1194 | struct eio_dirent *ent; |
1386 | struct eio_dirent *ent; |
1195 | |
1387 | |
1196 | if (expect_false (dentoffs == dentalloc)) |
1388 | if (ecb_expect_false (dentoffs == dentalloc)) |
1197 | { |
1389 | { |
1198 | dentalloc *= 2; |
1390 | dentalloc *= 2; |
1199 | X_LOCK (wrklock); |
1391 | X_LOCK (wrklock); |
1200 | req->ptr2 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
1392 | req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
1201 | X_UNLOCK (wrklock); |
1393 | X_UNLOCK (wrklock); |
1202 | |
1394 | |
1203 | if (!dents) |
1395 | if (!dents) |
1204 | break; |
1396 | break; |
1205 | } |
1397 | } |
1206 | |
1398 | |
1207 | ent = dents + dentoffs; |
1399 | ent = dents + dentoffs; |
1208 | |
1400 | |
1209 | ent->name = (char *)(size_t)namesoffs; /* rather dirtily we store the offset in the pointer */ |
1401 | ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */ |
1210 | ent->namelen = len - 1; |
1402 | ent->namelen = len - 1; |
1211 | ent->inode = D_INO (entp); |
1403 | ent->inode = D_INO (entp); |
|
|
1404 | |
|
|
1405 | inode_bits |= ent->inode; |
1212 | |
1406 | |
1213 | switch (D_TYPE (entp)) |
1407 | switch (D_TYPE (entp)) |
1214 | { |
1408 | { |
1215 | default: |
1409 | default: |
1216 | ent->type = EIO_DT_UNKNOWN; |
1410 | ent->type = EIO_DT_UNKNOWN; |
… | |
… | |
1259 | #ifdef DT_WHT |
1453 | #ifdef DT_WHT |
1260 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
1454 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
1261 | #endif |
1455 | #endif |
1262 | } |
1456 | } |
1263 | |
1457 | |
1264 | ent->score = 0; |
1458 | ent->score = 7; |
1265 | |
1459 | |
1266 | if (flags & EIO_READDIR_DIRS_FIRST) |
1460 | if (flags & EIO_READDIR_DIRS_FIRST) |
1267 | { |
1461 | { |
1268 | if (ent->type == EIO_DT_UNKNOWN) |
1462 | if (ent->type == EIO_DT_UNKNOWN) |
1269 | { |
1463 | { |
1270 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
1464 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
1271 | ent->score = 98; |
1465 | ent->score = 1; |
1272 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
1466 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
1273 | ent->score = len <= 2 ? len + 6 : len <= 4 ? 5 : len <= 7 ? 4 : 1; /* shorter == more likely dir, but avoid too many classes */ |
1467 | ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */ |
1274 | } |
1468 | } |
1275 | else if (ent->type == EIO_DT_DIR) |
1469 | else if (ent->type == EIO_DT_DIR) |
1276 | ent->score = 100; |
1470 | ent->score = 0; |
1277 | } |
1471 | } |
1278 | } |
1472 | } |
1279 | |
1473 | |
1280 | namesoffs += len; |
1474 | namesoffs += len; |
1281 | ++dentoffs; |
1475 | ++dentoffs; |
… | |
… | |
1287 | break; |
1481 | break; |
1288 | } |
1482 | } |
1289 | } |
1483 | } |
1290 | } |
1484 | } |
1291 | |
1485 | |
1292 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
|
|
1293 | # undef msync |
|
|
1294 | # define msync(a,b,c) ((errno = ENOSYS), -1) |
|
|
1295 | #endif |
|
|
1296 | |
|
|
1297 | int |
|
|
1298 | eio__mtouch (void *mem, size_t len, int flags) |
|
|
1299 | { |
|
|
1300 | intptr_t addr = (intptr_t)mem; |
|
|
1301 | intptr_t end = addr + len; |
|
|
1302 | #ifdef PAGESIZE |
1486 | #ifdef PAGESIZE |
1303 | const intptr_t page = PAGESIZE; |
1487 | # define eio_pagesize() PAGESIZE |
1304 | #else |
1488 | #else |
|
|
1489 | static intptr_t |
|
|
1490 | eio_pagesize (void) |
|
|
1491 | { |
1305 | static intptr_t page; |
1492 | static intptr_t page; |
1306 | |
1493 | |
1307 | if (!page) |
1494 | if (!page) |
1308 | page = sysconf (_SC_PAGESIZE); |
1495 | page = sysconf (_SC_PAGESIZE); |
|
|
1496 | |
|
|
1497 | return page; |
|
|
1498 | } |
|
|
1499 | #endif |
|
|
1500 | |
|
|
1501 | static void |
|
|
1502 | eio_page_align (void **addr, size_t *length) |
|
|
1503 | { |
|
|
1504 | intptr_t mask = eio_pagesize () - 1; |
|
|
1505 | |
|
|
1506 | /* round down addr */ |
|
|
1507 | intptr_t adj = mask & (intptr_t)*addr; |
|
|
1508 | |
|
|
1509 | *addr = (void *)((intptr_t)*addr - adj); |
|
|
1510 | *length += adj; |
|
|
1511 | |
|
|
1512 | /* round up length */ |
|
|
1513 | *length = (*length + mask) & ~mask; |
|
|
1514 | } |
|
|
1515 | |
|
|
1516 | #if !_POSIX_MEMLOCK |
|
|
1517 | # define eio__mlockall(a) ((errno = ENOSYS), -1) |
|
|
1518 | #else |
|
|
1519 | |
|
|
1520 | static int |
|
|
1521 | eio__mlockall (int flags) |
|
|
1522 | { |
|
|
1523 | #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7 |
|
|
1524 | extern int mallopt (int, int); |
|
|
1525 | mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */ |
1309 | #endif |
1526 | #endif |
1310 | |
1527 | |
1311 | addr &= ~(page - 1); /* assume page size is always a power of two */ |
1528 | if (EIO_MCL_CURRENT != MCL_CURRENT |
|
|
1529 | || EIO_MCL_FUTURE != MCL_FUTURE) |
|
|
1530 | { |
|
|
1531 | flags = 0 |
|
|
1532 | | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0) |
|
|
1533 | | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0); |
|
|
1534 | } |
1312 | |
1535 | |
|
|
1536 | return mlockall (flags); |
|
|
1537 | } |
|
|
1538 | #endif |
|
|
1539 | |
|
|
1540 | #if !_POSIX_MEMLOCK_RANGE |
|
|
1541 | # define eio__mlock(a,b) ((errno = ENOSYS), -1) |
|
|
1542 | #else |
|
|
1543 | |
|
|
1544 | static int |
|
|
1545 | eio__mlock (void *addr, size_t length) |
|
|
1546 | { |
|
|
1547 | eio_page_align (&addr, &length); |
|
|
1548 | |
|
|
1549 | return mlock (addr, length); |
|
|
1550 | } |
|
|
1551 | |
|
|
1552 | #endif |
|
|
1553 | |
|
|
1554 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
|
|
1555 | # define eio__msync(a,b,c) ((errno = ENOSYS), -1) |
|
|
1556 | #else |
|
|
1557 | |
|
|
1558 | static int |
|
|
1559 | eio__msync (void *mem, size_t len, int flags) |
|
|
1560 | { |
|
|
1561 | eio_page_align (&mem, &len); |
|
|
1562 | |
|
|
1563 | if (EIO_MS_ASYNC != MS_SYNC |
|
|
1564 | || EIO_MS_INVALIDATE != MS_INVALIDATE |
|
|
1565 | || EIO_MS_SYNC != MS_SYNC) |
|
|
1566 | { |
|
|
1567 | flags = 0 |
|
|
1568 | | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0) |
|
|
1569 | | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0) |
|
|
1570 | | (flags & EIO_MS_SYNC ? MS_SYNC : 0); |
|
|
1571 | } |
|
|
1572 | |
|
|
1573 | return msync (mem, len, flags); |
|
|
1574 | } |
|
|
1575 | |
|
|
1576 | #endif |
|
|
1577 | |
|
|
1578 | static int |
|
|
1579 | eio__mtouch (eio_req *req) |
|
|
1580 | { |
|
|
1581 | void *mem = req->ptr2; |
|
|
1582 | size_t len = req->size; |
|
|
1583 | int flags = req->int1; |
|
|
1584 | |
|
|
1585 | eio_page_align (&mem, &len); |
|
|
1586 | |
|
|
1587 | { |
|
|
1588 | intptr_t addr = (intptr_t)mem; |
|
|
1589 | intptr_t end = addr + len; |
|
|
1590 | intptr_t page = eio_pagesize (); |
|
|
1591 | |
1313 | if (addr < end) |
1592 | if (addr < end) |
1314 | if (flags) /* modify */ |
1593 | if (flags & EIO_MT_MODIFY) /* modify */ |
1315 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len); |
1594 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
1316 | else |
1595 | else |
1317 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len); |
1596 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
|
|
1597 | } |
1318 | |
1598 | |
1319 | return 0; |
1599 | return 0; |
1320 | } |
1600 | } |
1321 | |
1601 | |
1322 | /*****************************************************************************/ |
1602 | /*****************************************************************************/ |
… | |
… | |
1356 | if (req) |
1636 | if (req) |
1357 | break; |
1637 | break; |
1358 | |
1638 | |
1359 | ++idle; |
1639 | ++idle; |
1360 | |
1640 | |
1361 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
1641 | ts.tv_sec = time (0) + idle_timeout; |
1362 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
1642 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
1363 | { |
1643 | { |
1364 | if (idle > max_idle) |
1644 | if (idle > max_idle) |
1365 | { |
1645 | { |
1366 | --idle; |
1646 | --idle; |
… | |
… | |
1409 | return 0; |
1689 | return 0; |
1410 | } |
1690 | } |
1411 | |
1691 | |
1412 | /*****************************************************************************/ |
1692 | /*****************************************************************************/ |
1413 | |
1693 | |
|
|
1694 | int ecb_cold |
1414 | int eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
1695 | eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
1415 | { |
1696 | { |
1416 | return etp_init (want_poll, done_poll); |
1697 | return etp_init (want_poll, done_poll); |
1417 | } |
1698 | } |
1418 | |
1699 | |
|
|
1700 | ecb_inline void |
1419 | static void eio_api_destroy (eio_req *req) |
1701 | eio_api_destroy (eio_req *req) |
1420 | { |
1702 | { |
1421 | free (req); |
1703 | free (req); |
1422 | } |
1704 | } |
1423 | |
1705 | |
1424 | #define REQ(rtype) \ |
1706 | #define REQ(rtype) \ |
… | |
… | |
1443 | { \ |
1725 | { \ |
1444 | eio_api_destroy (req); \ |
1726 | eio_api_destroy (req); \ |
1445 | return 0; \ |
1727 | return 0; \ |
1446 | } |
1728 | } |
1447 | |
1729 | |
|
|
1730 | static void |
1448 | static void eio_execute (etp_worker *self, eio_req *req) |
1731 | eio_execute (etp_worker *self, eio_req *req) |
1449 | { |
1732 | { |
1450 | errno = 0; |
|
|
1451 | |
|
|
1452 | switch (req->type) |
1733 | switch (req->type) |
1453 | { |
1734 | { |
1454 | case EIO_READ: ALLOC (req->size); |
1735 | case EIO_READ: ALLOC (req->size); |
1455 | req->result = req->offs >= 0 |
1736 | req->result = req->offs >= 0 |
1456 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
1737 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
… | |
… | |
1467 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1748 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1468 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1749 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1469 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1750 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1470 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1751 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1471 | |
1752 | |
|
|
1753 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1754 | req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1755 | case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1756 | req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1757 | |
1472 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
1758 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
1473 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
1759 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
1474 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
1760 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
1475 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
1761 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
1476 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
1762 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
… | |
… | |
1483 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
1769 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
1484 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
1770 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
1485 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
1771 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
1486 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
1772 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
1487 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
1773 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
1488 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break; |
1774 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
1489 | |
1775 | |
1490 | case EIO_READLINK: ALLOC (NAME_MAX); |
1776 | case EIO_READLINK: ALLOC (PATH_MAX); |
1491 | req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; |
1777 | req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break; |
1492 | |
1778 | |
1493 | case EIO_SYNC: req->result = 0; sync (); break; |
1779 | case EIO_SYNC: req->result = 0; sync (); break; |
1494 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
1780 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
1495 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
1781 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
1496 | case EIO_MSYNC: req->result = msync (req->ptr2, req->size, req->int1); break; |
1782 | case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break; |
|
|
1783 | case EIO_MTOUCH: req->result = eio__mtouch (req); break; |
1497 | case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break; |
1784 | case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break; |
|
|
1785 | case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break; |
1498 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
1786 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
1499 | |
1787 | |
1500 | case EIO_READDIR: eio__scandir (req, self); break; |
1788 | case EIO_READDIR: eio__scandir (req, self); break; |
1501 | |
1789 | |
1502 | case EIO_BUSY: |
1790 | case EIO_BUSY: |
1503 | #ifdef _WIN32 |
1791 | #ifdef _WIN32 |
1504 | Sleep (req->nv1 * 1000.); |
1792 | Sleep (req->nv1 * 1e3); |
1505 | #else |
1793 | #else |
1506 | { |
1794 | { |
1507 | struct timeval tv; |
1795 | struct timeval tv; |
1508 | |
1796 | |
1509 | tv.tv_sec = req->nv1; |
1797 | tv.tv_sec = req->nv1; |
1510 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; |
1798 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6; |
1511 | |
1799 | |
1512 | req->result = select (0, 0, 0, 0, &tv); |
1800 | req->result = select (0, 0, 0, 0, &tv); |
1513 | } |
1801 | } |
1514 | #endif |
1802 | #endif |
1515 | break; |
1803 | break; |
… | |
… | |
1530 | times = tv; |
1818 | times = tv; |
1531 | } |
1819 | } |
1532 | else |
1820 | else |
1533 | times = 0; |
1821 | times = 0; |
1534 | |
1822 | |
1535 | |
|
|
1536 | req->result = req->type == EIO_FUTIME |
1823 | req->result = req->type == EIO_FUTIME |
1537 | ? futimes (req->int1, times) |
1824 | ? futimes (req->int1, times) |
1538 | : utimes (req->ptr1, times); |
1825 | : utimes (req->ptr1, times); |
1539 | } |
1826 | } |
1540 | break; |
1827 | break; |
… | |
… | |
1545 | case EIO_NOP: |
1832 | case EIO_NOP: |
1546 | req->result = 0; |
1833 | req->result = 0; |
1547 | break; |
1834 | break; |
1548 | |
1835 | |
1549 | case EIO_CUSTOM: |
1836 | case EIO_CUSTOM: |
1550 | ((void (*)(eio_req *))req->feed) (req); |
1837 | req->feed (req); |
1551 | break; |
1838 | break; |
1552 | |
1839 | |
1553 | default: |
1840 | default: |
|
|
1841 | errno = ENOSYS; |
1554 | req->result = -1; |
1842 | req->result = -1; |
1555 | break; |
1843 | break; |
1556 | } |
1844 | } |
1557 | |
1845 | |
1558 | req->errorno = errno; |
1846 | req->errorno = errno; |
… | |
… | |
1588 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
1876 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
1589 | { |
1877 | { |
1590 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
1878 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
1591 | } |
1879 | } |
1592 | |
1880 | |
|
|
1881 | eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data) |
|
|
1882 | { |
|
|
1883 | REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND; |
|
|
1884 | } |
|
|
1885 | |
|
|
1886 | eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data) |
|
|
1887 | { |
|
|
1888 | REQ (EIO_MLOCKALL); req->int1 = flags; SEND; |
|
|
1889 | } |
|
|
1890 | |
1593 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
1891 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
1594 | { |
1892 | { |
1595 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
1893 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
1596 | } |
1894 | } |
1597 | |
1895 | |
… | |
… | |
1621 | } |
1919 | } |
1622 | |
1920 | |
1623 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
1921 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
1624 | { |
1922 | { |
1625 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
1923 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
|
|
1924 | } |
|
|
1925 | |
|
|
1926 | eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data) |
|
|
1927 | { |
|
|
1928 | REQ (EIO_FSTATVFS); req->int1 = fd; SEND; |
1626 | } |
1929 | } |
1627 | |
1930 | |
1628 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
1931 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
1629 | { |
1932 | { |
1630 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
1933 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
… | |
… | |
1704 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
2007 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
1705 | { |
2008 | { |
1706 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
2009 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
1707 | } |
2010 | } |
1708 | |
2011 | |
|
|
2012 | eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data) |
|
|
2013 | { |
|
|
2014 | return eio__1path (EIO_STATVFS, path, pri, cb, data); |
|
|
2015 | } |
|
|
2016 | |
1709 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
2017 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
1710 | { |
2018 | { |
1711 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
2019 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
1712 | } |
2020 | } |
1713 | |
2021 | |
… | |
… | |
1721 | REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; |
2029 | REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; |
1722 | } |
2030 | } |
1723 | |
2031 | |
1724 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
2032 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
1725 | { |
2033 | { |
1726 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND; |
2034 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND; |
1727 | } |
2035 | } |
1728 | |
2036 | |
1729 | static eio_req * |
2037 | static eio_req * |
1730 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
2038 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1731 | { |
2039 | { |
… | |
… | |
1755 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
2063 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1756 | { |
2064 | { |
1757 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
2065 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
1758 | } |
2066 | } |
1759 | |
2067 | |
1760 | eio_req *eio_custom (eio_cb execute, int pri, eio_cb cb, void *data) |
2068 | eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data) |
1761 | { |
2069 | { |
1762 | REQ (EIO_CUSTOM); req->feed = (void (*)(eio_req *))execute; SEND; |
2070 | REQ (EIO_CUSTOM); req->feed = execute; SEND; |
1763 | } |
2071 | } |
1764 | |
2072 | |
1765 | #endif |
2073 | #endif |
1766 | |
2074 | |
1767 | eio_req *eio_grp (eio_cb cb, void *data) |
2075 | eio_req *eio_grp (eio_cb cb, void *data) |
… | |
… | |
1776 | #undef SEND |
2084 | #undef SEND |
1777 | |
2085 | |
1778 | /*****************************************************************************/ |
2086 | /*****************************************************************************/ |
1779 | /* grp functions */ |
2087 | /* grp functions */ |
1780 | |
2088 | |
|
|
2089 | void |
1781 | void eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit) |
2090 | eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit) |
1782 | { |
2091 | { |
1783 | grp->int2 = limit; |
2092 | grp->int2 = limit; |
1784 | grp->feed = feed; |
2093 | grp->feed = feed; |
1785 | |
2094 | |
1786 | grp_try_feed (grp); |
2095 | grp_try_feed (grp); |
1787 | } |
2096 | } |
1788 | |
2097 | |
|
|
2098 | void |
1789 | void eio_grp_limit (eio_req *grp, int limit) |
2099 | eio_grp_limit (eio_req *grp, int limit) |
1790 | { |
2100 | { |
1791 | grp->int2 = limit; |
2101 | grp->int2 = limit; |
1792 | |
2102 | |
1793 | grp_try_feed (grp); |
2103 | grp_try_feed (grp); |
1794 | } |
2104 | } |
1795 | |
2105 | |
|
|
2106 | void |
1796 | void eio_grp_add (eio_req *grp, eio_req *req) |
2107 | eio_grp_add (eio_req *grp, eio_req *req) |
1797 | { |
2108 | { |
1798 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
2109 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
1799 | |
2110 | |
1800 | grp->flags |= EIO_FLAG_GROUPADD; |
2111 | grp->flags |= EIO_FLAG_GROUPADD; |
1801 | |
2112 | |
… | |
… | |
1812 | } |
2123 | } |
1813 | |
2124 | |
1814 | /*****************************************************************************/ |
2125 | /*****************************************************************************/ |
1815 | /* misc garbage */ |
2126 | /* misc garbage */ |
1816 | |
2127 | |
|
|
2128 | ssize_t |
1817 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
2129 | eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
1818 | { |
2130 | { |
1819 | etp_worker wrk; |
2131 | etp_worker wrk; |
1820 | ssize_t ret; |
2132 | ssize_t ret; |
1821 | |
2133 | |
1822 | wrk.dbuf = 0; |
2134 | wrk.dbuf = 0; |