1 | #if __linux |
1 | /* solaris */ |
|
|
2 | #define _POSIX_PTHREAD_SEMANTICS 1 |
|
|
3 | |
|
|
4 | #if __linux && !defined(_GNU_SOURCE) |
2 | # define _GNU_SOURCE |
5 | # define _GNU_SOURCE |
3 | #endif |
6 | #endif |
4 | |
7 | |
|
|
8 | /* just in case */ |
5 | #define _REENTRANT 1 |
9 | #define _REENTRANT 1 |
6 | |
10 | |
7 | #include <errno.h> |
11 | #include <errno.h> |
8 | |
12 | |
9 | #include "EXTERN.h" |
13 | #include "EXTERN.h" |
… | |
… | |
39 | # else |
43 | # else |
40 | # error sendfile support requested but not available |
44 | # error sendfile support requested but not available |
41 | # endif |
45 | # endif |
42 | #endif |
46 | #endif |
43 | |
47 | |
|
|
48 | /* number of seconds after which idle threads exit */ |
|
|
49 | #define IDLE_TIMEOUT 10 |
|
|
50 | |
44 | /* used for struct dirent, AIX doesn't provide it */ |
51 | /* used for struct dirent, AIX doesn't provide it */ |
45 | #ifndef NAME_MAX |
52 | #ifndef NAME_MAX |
46 | # define NAME_MAX 4096 |
53 | # define NAME_MAX 4096 |
|
|
54 | #endif |
|
|
55 | |
|
|
56 | #ifndef PTHREAD_STACK_MIN |
|
|
57 | /* care for broken platforms, e.g. windows */ |
|
|
58 | # define PTHREAD_STACK_MIN 16384 |
47 | #endif |
59 | #endif |
48 | |
60 | |
49 | #if __ia64 |
61 | #if __ia64 |
50 | # define STACKSIZE 65536 |
62 | # define STACKSIZE 65536 |
51 | #elif __i386 || __x86_64 /* 16k is unreasonably high :( */ |
63 | #elif __i386 || __x86_64 /* 16k is unreasonably high :( */ |
52 | # define STACKSIZE PTHREAD_STACK_MIN |
64 | # define STACKSIZE PTHREAD_STACK_MIN |
53 | #else |
65 | #else |
54 | # define STACKSIZE 16384 |
66 | # define STACKSIZE 16384 |
55 | #endif |
67 | #endif |
56 | |
68 | |
|
|
69 | /* wether word reads are potentially non-atomic. |
|
|
70 | * this is conservatice, likely most arches this runs |
|
|
71 | * on have atomic word read/writes. |
|
|
72 | */ |
|
|
73 | #ifndef WORDACCESS_UNSAFE |
|
|
74 | # if __i386 || __x86_64 |
|
|
75 | # define WORDACCESS_UNSAFE 0 |
|
|
76 | # else |
|
|
77 | # define WORDACCESS_UNSAFE 1 |
|
|
78 | # endif |
|
|
79 | #endif |
|
|
80 | |
57 | /* buffer size for various temporary buffers */ |
81 | /* buffer size for various temporary buffers */ |
58 | #define AIO_BUFSIZE 65536 |
82 | #define AIO_BUFSIZE 65536 |
59 | |
83 | |
60 | #define dBUF \ |
84 | #define dBUF \ |
|
|
85 | char *aio_buf; \ |
|
|
86 | LOCK (wrklock); \ |
61 | char *aio_buf = malloc (AIO_BUFSIZE); \ |
87 | self->dbuf = aio_buf = malloc (AIO_BUFSIZE); \ |
|
|
88 | UNLOCK (wrklock); \ |
62 | if (!aio_buf) \ |
89 | if (!aio_buf) \ |
63 | return -1; |
90 | return -1; |
64 | |
|
|
65 | #define fBUF free (aio_buf) |
|
|
66 | |
91 | |
67 | enum { |
92 | enum { |
68 | REQ_QUIT, |
93 | REQ_QUIT, |
69 | REQ_OPEN, REQ_CLOSE, |
94 | REQ_OPEN, REQ_CLOSE, |
70 | REQ_READ, REQ_WRITE, REQ_READAHEAD, |
95 | REQ_READ, REQ_WRITE, REQ_READAHEAD, |
71 | REQ_SENDFILE, |
96 | REQ_SENDFILE, |
72 | REQ_STAT, REQ_LSTAT, REQ_FSTAT, |
97 | REQ_STAT, REQ_LSTAT, REQ_FSTAT, |
73 | REQ_FSYNC, REQ_FDATASYNC, |
98 | REQ_FSYNC, REQ_FDATASYNC, |
74 | REQ_UNLINK, REQ_RMDIR, REQ_RENAME, |
99 | REQ_UNLINK, REQ_RMDIR, REQ_RENAME, |
75 | REQ_READDIR, |
100 | REQ_MKNOD, REQ_READDIR, |
76 | REQ_LINK, REQ_SYMLINK, |
101 | REQ_LINK, REQ_SYMLINK, |
77 | REQ_GROUP, REQ_NOP, |
102 | REQ_GROUP, REQ_NOP, |
78 | REQ_BUSY, |
103 | REQ_BUSY, |
79 | }; |
104 | }; |
80 | |
105 | |
… | |
… | |
120 | DEFAULT_PRI = 0, |
145 | DEFAULT_PRI = 0, |
121 | PRI_BIAS = -PRI_MIN, |
146 | PRI_BIAS = -PRI_MIN, |
122 | NUM_PRI = PRI_MAX + PRI_BIAS + 1, |
147 | NUM_PRI = PRI_MAX + PRI_BIAS + 1, |
123 | }; |
148 | }; |
124 | |
149 | |
|
|
150 | #define AIO_TICKS ((1000000 + 1023) >> 10) |
|
|
151 | |
|
|
152 | static unsigned int max_poll_time = 0; |
|
|
153 | static unsigned int max_poll_reqs = 0; |
|
|
154 | |
|
|
155 | /* calculcate time difference in ~1/AIO_TICKS of a second */ |
|
|
156 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
|
|
157 | { |
|
|
158 | return (tv2->tv_sec - tv1->tv_sec ) * AIO_TICKS |
|
|
159 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
|
|
160 | } |
|
|
161 | |
125 | static int next_pri = DEFAULT_PRI + PRI_BIAS; |
162 | static int next_pri = DEFAULT_PRI + PRI_BIAS; |
126 | |
163 | |
127 | static int started, wanted; |
164 | static unsigned int started, idle, wanted; |
128 | static volatile int nreqs; |
|
|
129 | static int max_outstanding = 1<<30; |
|
|
130 | static int respipe [2]; |
|
|
131 | |
165 | |
132 | #if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP) |
166 | #if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP) |
133 | # define AIO_MUTEX_INIT PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP |
167 | # define AIO_MUTEX_INIT PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP |
134 | #else |
168 | #else |
135 | # define AIO_MUTEX_INIT PTHREAD_MUTEX_INITIALIZER |
169 | # define AIO_MUTEX_INIT PTHREAD_MUTEX_INITIALIZER |
136 | #endif |
170 | #endif |
137 | |
171 | |
|
|
172 | #define LOCK(mutex) pthread_mutex_lock (&(mutex)) |
|
|
173 | #define UNLOCK(mutex) pthread_mutex_unlock (&(mutex)) |
|
|
174 | |
|
|
175 | /* worker threads management */ |
|
|
176 | static pthread_mutex_t wrklock = AIO_MUTEX_INIT; |
|
|
177 | |
|
|
178 | typedef struct worker { |
|
|
179 | /* locked by wrklock */ |
|
|
180 | struct worker *prev, *next; |
|
|
181 | |
|
|
182 | pthread_t tid; |
|
|
183 | |
|
|
184 | /* locked by reslock, reqlock or wrklock */ |
|
|
185 | aio_req req; /* currently processed request */ |
|
|
186 | void *dbuf; |
|
|
187 | DIR *dirp; |
|
|
188 | } worker; |
|
|
189 | |
|
|
190 | static worker wrk_first = { &wrk_first, &wrk_first, 0 }; |
|
|
191 | |
|
|
192 | static void worker_clear (worker *wrk) |
|
|
193 | { |
|
|
194 | if (wrk->dirp) |
|
|
195 | { |
|
|
196 | closedir (wrk->dirp); |
|
|
197 | wrk->dirp = 0; |
|
|
198 | } |
|
|
199 | |
|
|
200 | if (wrk->dbuf) |
|
|
201 | { |
|
|
202 | free (wrk->dbuf); |
|
|
203 | wrk->dbuf = 0; |
|
|
204 | } |
|
|
205 | } |
|
|
206 | |
|
|
207 | static void worker_free (worker *wrk) |
|
|
208 | { |
|
|
209 | wrk->next->prev = wrk->prev; |
|
|
210 | wrk->prev->next = wrk->next; |
|
|
211 | |
|
|
212 | free (wrk); |
|
|
213 | } |
|
|
214 | |
|
|
215 | static volatile unsigned int nreqs, nready, npending; |
|
|
216 | static volatile unsigned int max_idle = 4; |
|
|
217 | static volatile unsigned int max_outstanding = 0xffffffff; |
|
|
218 | static int respipe [2]; |
|
|
219 | |
138 | static pthread_mutex_t reslock = AIO_MUTEX_INIT; |
220 | static pthread_mutex_t reslock = AIO_MUTEX_INIT; |
139 | static pthread_mutex_t reqlock = AIO_MUTEX_INIT; |
221 | static pthread_mutex_t reqlock = AIO_MUTEX_INIT; |
140 | static pthread_cond_t reqwait = PTHREAD_COND_INITIALIZER; |
222 | static pthread_cond_t reqwait = PTHREAD_COND_INITIALIZER; |
|
|
223 | |
|
|
224 | #if WORDACCESS_UNSAFE |
|
|
225 | |
|
|
226 | static unsigned int get_nready () |
|
|
227 | { |
|
|
228 | unsigned int retval; |
|
|
229 | |
|
|
230 | LOCK (reqlock); |
|
|
231 | retval = nready; |
|
|
232 | UNLOCK (reqlock); |
|
|
233 | |
|
|
234 | return retval; |
|
|
235 | } |
|
|
236 | |
|
|
237 | static unsigned int get_npending () |
|
|
238 | { |
|
|
239 | unsigned int retval; |
|
|
240 | |
|
|
241 | LOCK (reslock); |
|
|
242 | retval = npending; |
|
|
243 | UNLOCK (reslock); |
|
|
244 | |
|
|
245 | return retval; |
|
|
246 | } |
|
|
247 | |
|
|
248 | static unsigned int get_nthreads () |
|
|
249 | { |
|
|
250 | unsigned int retval; |
|
|
251 | |
|
|
252 | LOCK (wrklock); |
|
|
253 | retval = started; |
|
|
254 | UNLOCK (wrklock); |
|
|
255 | |
|
|
256 | return retval; |
|
|
257 | } |
|
|
258 | |
|
|
259 | #else |
|
|
260 | |
|
|
261 | # define get_nready() nready |
|
|
262 | # define get_npending() npending |
|
|
263 | # define get_nthreads() started |
|
|
264 | |
|
|
265 | #endif |
141 | |
266 | |
142 | /* |
267 | /* |
143 | * a somewhat faster data structure might be nice, but |
268 | * a somewhat faster data structure might be nice, but |
144 | * with 8 priorities this actually needs <20 insns |
269 | * with 8 priorities this actually needs <20 insns |
145 | * per shift, the most expensive operation. |
270 | * per shift, the most expensive operation. |
… | |
… | |
191 | } |
316 | } |
192 | |
317 | |
193 | abort (); |
318 | abort (); |
194 | } |
319 | } |
195 | |
320 | |
|
|
321 | static int poll_cb (); |
196 | static void req_invoke (aio_req req); |
322 | static void req_invoke (aio_req req); |
197 | static void req_free (aio_req req); |
323 | static void req_free (aio_req req); |
|
|
324 | static void req_cancel (aio_req req); |
198 | |
325 | |
199 | /* must be called at most once */ |
326 | /* must be called at most once */ |
200 | static SV *req_sv (aio_req req, const char *klass) |
327 | static SV *req_sv (aio_req req, const char *klass) |
201 | { |
328 | { |
202 | if (!req->self) |
329 | if (!req->self) |
… | |
… | |
264 | req_invoke (grp); |
391 | req_invoke (grp); |
265 | req_free (grp); |
392 | req_free (grp); |
266 | } |
393 | } |
267 | } |
394 | } |
268 | |
395 | |
269 | static void poll_wait () |
|
|
270 | { |
|
|
271 | fd_set rfd; |
|
|
272 | |
|
|
273 | while (nreqs) |
|
|
274 | { |
|
|
275 | int size; |
|
|
276 | #if !(__i386 || __x86_64) /* safe without sempahore on this archs */ |
|
|
277 | pthread_mutex_lock (&reslock); |
|
|
278 | #endif |
|
|
279 | size = res_queue.size; |
|
|
280 | #if !(__i386 || __x86_64) /* safe without sempahore on this archs */ |
|
|
281 | pthread_mutex_unlock (&reslock); |
|
|
282 | #endif |
|
|
283 | |
|
|
284 | if (size) |
|
|
285 | return; |
|
|
286 | |
|
|
287 | FD_ZERO(&rfd); |
|
|
288 | FD_SET(respipe [0], &rfd); |
|
|
289 | |
|
|
290 | select (respipe [0] + 1, &rfd, 0, 0, 0); |
|
|
291 | } |
|
|
292 | } |
|
|
293 | |
|
|
294 | static void req_invoke (aio_req req) |
396 | static void req_invoke (aio_req req) |
295 | { |
397 | { |
296 | dSP; |
398 | dSP; |
297 | |
399 | |
298 | if (!(req->flags & FLAG_CANCELLED) && SvOK (req->callback)) |
400 | if (!(req->flags & FLAG_CANCELLED) && SvOK (req->callback)) |
299 | { |
401 | { |
300 | errno = req->errorno; |
|
|
301 | |
|
|
302 | ENTER; |
402 | ENTER; |
303 | SAVETMPS; |
403 | SAVETMPS; |
304 | PUSHMARK (SP); |
404 | PUSHMARK (SP); |
305 | EXTEND (SP, 1); |
405 | EXTEND (SP, 1); |
306 | |
406 | |
… | |
… | |
310 | { |
410 | { |
311 | SV *rv = &PL_sv_undef; |
411 | SV *rv = &PL_sv_undef; |
312 | |
412 | |
313 | if (req->result >= 0) |
413 | if (req->result >= 0) |
314 | { |
414 | { |
|
|
415 | int i; |
315 | char *buf = req->data2ptr; |
416 | char *buf = req->data2ptr; |
316 | AV *av = newAV (); |
417 | AV *av = newAV (); |
317 | |
418 | |
318 | while (req->result) |
419 | av_extend (av, req->result - 1); |
|
|
420 | |
|
|
421 | for (i = 0; i < req->result; ++i) |
319 | { |
422 | { |
320 | SV *sv = newSVpv (buf, 0); |
423 | SV *sv = newSVpv (buf, 0); |
321 | |
424 | |
322 | av_push (av, sv); |
425 | av_store (av, i, sv); |
323 | buf += SvCUR (sv) + 1; |
426 | buf += SvCUR (sv) + 1; |
324 | req->result--; |
|
|
325 | } |
427 | } |
326 | |
428 | |
327 | rv = sv_2mortal (newRV_noinc ((SV *)av)); |
429 | rv = sv_2mortal (newRV_noinc ((SV *)av)); |
328 | } |
430 | } |
329 | |
431 | |
… | |
… | |
369 | default: |
471 | default: |
370 | PUSHs (sv_2mortal (newSViv (req->result))); |
472 | PUSHs (sv_2mortal (newSViv (req->result))); |
371 | break; |
473 | break; |
372 | } |
474 | } |
373 | |
475 | |
|
|
476 | errno = req->errorno; |
374 | |
477 | |
375 | PUTBACK; |
478 | PUTBACK; |
376 | call_sv (req->callback, G_VOID | G_EVAL); |
479 | call_sv (req->callback, G_VOID | G_EVAL); |
377 | SPAGAIN; |
480 | SPAGAIN; |
378 | |
481 | |
… | |
… | |
413 | SvREFCNT_dec (req->fh); |
516 | SvREFCNT_dec (req->fh); |
414 | SvREFCNT_dec (req->fh2); |
517 | SvREFCNT_dec (req->fh2); |
415 | SvREFCNT_dec (req->callback); |
518 | SvREFCNT_dec (req->callback); |
416 | Safefree (req->statdata); |
519 | Safefree (req->statdata); |
417 | |
520 | |
418 | if (req->type == REQ_READDIR && req->result >= 0) |
521 | if (req->type == REQ_READDIR) |
419 | free (req->data2ptr); |
522 | free (req->data2ptr); |
420 | |
523 | |
421 | Safefree (req); |
524 | Safefree (req); |
422 | } |
525 | } |
423 | |
526 | |
|
|
527 | static void req_cancel_subs (aio_req grp) |
|
|
528 | { |
|
|
529 | aio_req sub; |
|
|
530 | |
|
|
531 | if (grp->type != REQ_GROUP) |
|
|
532 | return; |
|
|
533 | |
|
|
534 | SvREFCNT_dec (grp->fh2); |
|
|
535 | grp->fh2 = 0; |
|
|
536 | |
|
|
537 | for (sub = grp->grp_first; sub; sub = sub->grp_next) |
|
|
538 | req_cancel (sub); |
|
|
539 | } |
|
|
540 | |
424 | static void req_cancel (aio_req req) |
541 | static void req_cancel (aio_req req) |
425 | { |
542 | { |
426 | req->flags |= FLAG_CANCELLED; |
543 | req->flags |= FLAG_CANCELLED; |
427 | |
544 | |
428 | if (req->type == REQ_GROUP) |
545 | req_cancel_subs (req); |
429 | { |
|
|
430 | aio_req sub; |
|
|
431 | |
|
|
432 | for (sub = req->grp_first; sub; sub = sub->grp_next) |
|
|
433 | req_cancel (sub); |
|
|
434 | } |
|
|
435 | } |
|
|
436 | |
|
|
437 | static int poll_cb () |
|
|
438 | { |
|
|
439 | dSP; |
|
|
440 | int count = 0; |
|
|
441 | int do_croak = 0; |
|
|
442 | aio_req req; |
|
|
443 | |
|
|
444 | for (;;) |
|
|
445 | { |
|
|
446 | pthread_mutex_lock (&reslock); |
|
|
447 | req = reqq_shift (&res_queue); |
|
|
448 | |
|
|
449 | if (req) |
|
|
450 | { |
|
|
451 | if (!res_queue.size) |
|
|
452 | { |
|
|
453 | /* read any signals sent by the worker threads */ |
|
|
454 | char buf [32]; |
|
|
455 | while (read (respipe [0], buf, 32) == 32) |
|
|
456 | ; |
|
|
457 | } |
|
|
458 | } |
|
|
459 | |
|
|
460 | pthread_mutex_unlock (&reslock); |
|
|
461 | |
|
|
462 | if (!req) |
|
|
463 | break; |
|
|
464 | |
|
|
465 | --nreqs; |
|
|
466 | |
|
|
467 | if (req->type == REQ_QUIT) |
|
|
468 | started--; |
|
|
469 | else if (req->type == REQ_GROUP && req->length) |
|
|
470 | { |
|
|
471 | req->fd = 1; /* mark request as delayed */ |
|
|
472 | continue; |
|
|
473 | } |
|
|
474 | else |
|
|
475 | { |
|
|
476 | if (req->type == REQ_READ) |
|
|
477 | SvCUR_set (req->data, req->dataoffset + (req->result > 0 ? req->result : 0)); |
|
|
478 | |
|
|
479 | if (req->data2ptr && (req->type == REQ_READ || req->type == REQ_WRITE)) |
|
|
480 | SvREADONLY_off (req->data); |
|
|
481 | |
|
|
482 | if (req->statdata) |
|
|
483 | { |
|
|
484 | PL_laststype = req->type == REQ_LSTAT ? OP_LSTAT : OP_STAT; |
|
|
485 | PL_laststatval = req->result; |
|
|
486 | PL_statcache = *(req->statdata); |
|
|
487 | } |
|
|
488 | |
|
|
489 | req_invoke (req); |
|
|
490 | |
|
|
491 | count++; |
|
|
492 | } |
|
|
493 | |
|
|
494 | req_free (req); |
|
|
495 | } |
|
|
496 | |
|
|
497 | return count; |
|
|
498 | } |
546 | } |
499 | |
547 | |
500 | static void *aio_proc(void *arg); |
548 | static void *aio_proc(void *arg); |
501 | |
549 | |
502 | static void start_thread (void) |
550 | static void start_thread (void) |
503 | { |
551 | { |
504 | sigset_t fullsigset, oldsigset; |
552 | sigset_t fullsigset, oldsigset; |
505 | pthread_t tid; |
|
|
506 | pthread_attr_t attr; |
553 | pthread_attr_t attr; |
|
|
554 | |
|
|
555 | worker *wrk = calloc (1, sizeof (worker)); |
|
|
556 | |
|
|
557 | if (!wrk) |
|
|
558 | croak ("unable to allocate worker thread data"); |
507 | |
559 | |
508 | pthread_attr_init (&attr); |
560 | pthread_attr_init (&attr); |
509 | pthread_attr_setstacksize (&attr, STACKSIZE); |
561 | pthread_attr_setstacksize (&attr, STACKSIZE); |
510 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
562 | pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
|
|
563 | #ifdef PTHREAD_SCOPE_PROCESS |
|
|
564 | pthread_attr_setscope (&attr, PTHREAD_SCOPE_PROCESS); |
|
|
565 | #endif |
511 | |
566 | |
512 | sigfillset (&fullsigset); |
567 | sigfillset (&fullsigset); |
|
|
568 | |
|
|
569 | LOCK (wrklock); |
513 | sigprocmask (SIG_SETMASK, &fullsigset, &oldsigset); |
570 | sigprocmask (SIG_SETMASK, &fullsigset, &oldsigset); |
514 | |
571 | |
515 | if (pthread_create (&tid, &attr, aio_proc, 0) == 0) |
572 | if (pthread_create (&wrk->tid, &attr, aio_proc, (void *)wrk) == 0) |
|
|
573 | { |
|
|
574 | wrk->prev = &wrk_first; |
|
|
575 | wrk->next = wrk_first.next; |
|
|
576 | wrk_first.next->prev = wrk; |
|
|
577 | wrk_first.next = wrk; |
516 | started++; |
578 | ++started; |
|
|
579 | } |
|
|
580 | else |
|
|
581 | free (wrk); |
517 | |
582 | |
518 | sigprocmask (SIG_SETMASK, &oldsigset, 0); |
583 | sigprocmask (SIG_SETMASK, &oldsigset, 0); |
|
|
584 | UNLOCK (wrklock); |
|
|
585 | } |
|
|
586 | |
|
|
587 | static void maybe_start_thread () |
|
|
588 | { |
|
|
589 | if (get_nthreads () >= wanted) |
|
|
590 | return; |
|
|
591 | |
|
|
592 | /* todo: maybe use idle here, but might be less exact */ |
|
|
593 | if (0 <= (int)get_nthreads () + (int)get_npending () - (int)nreqs) |
|
|
594 | return; |
|
|
595 | |
|
|
596 | start_thread (); |
519 | } |
597 | } |
520 | |
598 | |
521 | static void req_send (aio_req req) |
599 | static void req_send (aio_req req) |
522 | { |
600 | { |
523 | while (started < wanted && nreqs >= started) |
|
|
524 | start_thread (); |
|
|
525 | |
|
|
526 | ++nreqs; |
601 | ++nreqs; |
527 | |
602 | |
528 | pthread_mutex_lock (&reqlock); |
603 | LOCK (reqlock); |
|
|
604 | ++nready; |
529 | reqq_push (&req_queue, req); |
605 | reqq_push (&req_queue, req); |
530 | pthread_cond_signal (&reqwait); |
606 | pthread_cond_signal (&reqwait); |
531 | pthread_mutex_unlock (&reqlock); |
607 | UNLOCK (reqlock); |
532 | |
608 | |
533 | if (nreqs > max_outstanding) |
609 | maybe_start_thread (); |
534 | for (;;) |
|
|
535 | { |
|
|
536 | poll_cb (); |
|
|
537 | |
|
|
538 | if (nreqs <= max_outstanding) |
|
|
539 | break; |
|
|
540 | |
|
|
541 | poll_wait (); |
|
|
542 | } |
|
|
543 | } |
610 | } |
544 | |
611 | |
545 | static void end_thread (void) |
612 | static void end_thread (void) |
546 | { |
613 | { |
547 | aio_req req; |
614 | aio_req req; |
… | |
… | |
549 | Newz (0, req, 1, aio_cb); |
616 | Newz (0, req, 1, aio_cb); |
550 | |
617 | |
551 | req->type = REQ_QUIT; |
618 | req->type = REQ_QUIT; |
552 | req->pri = PRI_MAX + PRI_BIAS; |
619 | req->pri = PRI_MAX + PRI_BIAS; |
553 | |
620 | |
554 | req_send (req); |
621 | LOCK (reqlock); |
|
|
622 | reqq_push (&req_queue, req); |
|
|
623 | pthread_cond_signal (&reqwait); |
|
|
624 | UNLOCK (reqlock); |
|
|
625 | |
|
|
626 | LOCK (wrklock); |
|
|
627 | --started; |
|
|
628 | UNLOCK (wrklock); |
|
|
629 | } |
|
|
630 | |
|
|
631 | static void set_max_idle (int nthreads) |
|
|
632 | { |
|
|
633 | if (WORDACCESS_UNSAFE) LOCK (reqlock); |
|
|
634 | max_idle = nthreads <= 0 ? 1 : nthreads; |
|
|
635 | if (WORDACCESS_UNSAFE) UNLOCK (reqlock); |
555 | } |
636 | } |
556 | |
637 | |
557 | static void min_parallel (int nthreads) |
638 | static void min_parallel (int nthreads) |
558 | { |
639 | { |
559 | if (wanted < nthreads) |
640 | if (wanted < nthreads) |
560 | wanted = nthreads; |
641 | wanted = nthreads; |
561 | } |
642 | } |
562 | |
643 | |
563 | static void max_parallel (int nthreads) |
644 | static void max_parallel (int nthreads) |
564 | { |
645 | { |
565 | int cur = started; |
|
|
566 | |
|
|
567 | if (wanted > nthreads) |
646 | if (wanted > nthreads) |
568 | wanted = nthreads; |
647 | wanted = nthreads; |
569 | |
648 | |
570 | while (cur > wanted) |
|
|
571 | { |
|
|
572 | end_thread (); |
|
|
573 | cur--; |
|
|
574 | } |
|
|
575 | |
|
|
576 | while (started > wanted) |
649 | while (started > wanted) |
|
|
650 | end_thread (); |
|
|
651 | } |
|
|
652 | |
|
|
653 | static void poll_wait () |
|
|
654 | { |
|
|
655 | fd_set rfd; |
|
|
656 | |
|
|
657 | while (nreqs) |
|
|
658 | { |
|
|
659 | int size; |
|
|
660 | if (WORDACCESS_UNSAFE) LOCK (reslock); |
|
|
661 | size = res_queue.size; |
|
|
662 | if (WORDACCESS_UNSAFE) UNLOCK (reslock); |
|
|
663 | |
|
|
664 | if (size) |
|
|
665 | return; |
|
|
666 | |
|
|
667 | maybe_start_thread (); |
|
|
668 | |
|
|
669 | FD_ZERO(&rfd); |
|
|
670 | FD_SET(respipe [0], &rfd); |
|
|
671 | |
|
|
672 | select (respipe [0] + 1, &rfd, 0, 0, 0); |
577 | { |
673 | } |
|
|
674 | } |
|
|
675 | |
|
|
676 | static int poll_cb () |
|
|
677 | { |
|
|
678 | dSP; |
|
|
679 | int count = 0; |
|
|
680 | int maxreqs = max_poll_reqs; |
|
|
681 | int do_croak = 0; |
|
|
682 | struct timeval tv_start, tv_now; |
|
|
683 | aio_req req; |
|
|
684 | |
|
|
685 | if (max_poll_time) |
|
|
686 | gettimeofday (&tv_start, 0); |
|
|
687 | |
|
|
688 | for (;;) |
|
|
689 | { |
|
|
690 | for (;;) |
|
|
691 | { |
|
|
692 | maybe_start_thread (); |
|
|
693 | |
|
|
694 | LOCK (reslock); |
|
|
695 | req = reqq_shift (&res_queue); |
|
|
696 | |
|
|
697 | if (req) |
|
|
698 | { |
|
|
699 | --npending; |
|
|
700 | |
|
|
701 | if (!res_queue.size) |
|
|
702 | { |
|
|
703 | /* read any signals sent by the worker threads */ |
|
|
704 | char buf [32]; |
|
|
705 | while (read (respipe [0], buf, 32) == 32) |
|
|
706 | ; |
|
|
707 | } |
|
|
708 | } |
|
|
709 | |
|
|
710 | UNLOCK (reslock); |
|
|
711 | |
|
|
712 | if (!req) |
|
|
713 | break; |
|
|
714 | |
|
|
715 | --nreqs; |
|
|
716 | |
|
|
717 | if (req->type == REQ_GROUP && req->length) |
|
|
718 | { |
|
|
719 | req->fd = 1; /* mark request as delayed */ |
|
|
720 | continue; |
|
|
721 | } |
|
|
722 | else |
|
|
723 | { |
|
|
724 | if (req->type == REQ_READ) |
|
|
725 | SvCUR_set (req->data, req->dataoffset + (req->result > 0 ? req->result : 0)); |
|
|
726 | |
|
|
727 | if (req->data2ptr && (req->type == REQ_READ || req->type == REQ_WRITE)) |
|
|
728 | SvREADONLY_off (req->data); |
|
|
729 | |
|
|
730 | if (req->statdata) |
|
|
731 | { |
|
|
732 | PL_laststype = req->type == REQ_LSTAT ? OP_LSTAT : OP_STAT; |
|
|
733 | PL_laststatval = req->result; |
|
|
734 | PL_statcache = *(req->statdata); |
|
|
735 | } |
|
|
736 | |
|
|
737 | req_invoke (req); |
|
|
738 | |
|
|
739 | count++; |
|
|
740 | } |
|
|
741 | |
|
|
742 | req_free (req); |
|
|
743 | |
|
|
744 | if (maxreqs && !--maxreqs) |
|
|
745 | break; |
|
|
746 | |
|
|
747 | if (max_poll_time) |
|
|
748 | { |
|
|
749 | gettimeofday (&tv_now, 0); |
|
|
750 | |
|
|
751 | if (tvdiff (&tv_start, &tv_now) >= max_poll_time) |
|
|
752 | break; |
|
|
753 | } |
|
|
754 | } |
|
|
755 | |
|
|
756 | if (nreqs <= max_outstanding) |
|
|
757 | break; |
|
|
758 | |
578 | poll_wait (); |
759 | poll_wait (); |
579 | poll_cb (); |
760 | |
|
|
761 | ++maxreqs; |
580 | } |
762 | } |
|
|
763 | |
|
|
764 | return count; |
581 | } |
765 | } |
582 | |
766 | |
583 | static void create_pipe () |
767 | static void create_pipe () |
584 | { |
768 | { |
585 | if (pipe (respipe)) |
769 | if (pipe (respipe)) |
… | |
… | |
609 | static ssize_t pread (int fd, void *buf, size_t count, off_t offset) |
793 | static ssize_t pread (int fd, void *buf, size_t count, off_t offset) |
610 | { |
794 | { |
611 | ssize_t res; |
795 | ssize_t res; |
612 | off_t ooffset; |
796 | off_t ooffset; |
613 | |
797 | |
614 | pthread_mutex_lock (&preadwritelock); |
798 | LOCK (preadwritelock); |
615 | ooffset = lseek (fd, 0, SEEK_CUR); |
799 | ooffset = lseek (fd, 0, SEEK_CUR); |
616 | lseek (fd, offset, SEEK_SET); |
800 | lseek (fd, offset, SEEK_SET); |
617 | res = read (fd, buf, count); |
801 | res = read (fd, buf, count); |
618 | lseek (fd, ooffset, SEEK_SET); |
802 | lseek (fd, ooffset, SEEK_SET); |
619 | pthread_mutex_unlock (&preadwritelock); |
803 | UNLOCK (preadwritelock); |
620 | |
804 | |
621 | return res; |
805 | return res; |
622 | } |
806 | } |
623 | |
807 | |
624 | static ssize_t pwrite (int fd, void *buf, size_t count, off_t offset) |
808 | static ssize_t pwrite (int fd, void *buf, size_t count, off_t offset) |
625 | { |
809 | { |
626 | ssize_t res; |
810 | ssize_t res; |
627 | off_t ooffset; |
811 | off_t ooffset; |
628 | |
812 | |
629 | pthread_mutex_lock (&preadwritelock); |
813 | LOCK (preadwritelock); |
630 | ooffset = lseek (fd, 0, SEEK_CUR); |
814 | ooffset = lseek (fd, 0, SEEK_CUR); |
631 | lseek (fd, offset, SEEK_SET); |
815 | lseek (fd, offset, SEEK_SET); |
632 | res = write (fd, buf, count); |
816 | res = write (fd, buf, count); |
633 | lseek (fd, offset, SEEK_SET); |
817 | lseek (fd, offset, SEEK_SET); |
634 | pthread_mutex_unlock (&preadwritelock); |
818 | UNLOCK (preadwritelock); |
635 | |
819 | |
636 | return res; |
820 | return res; |
637 | } |
821 | } |
638 | #endif |
822 | #endif |
639 | |
823 | |
640 | #if !HAVE_FDATASYNC |
824 | #if !HAVE_FDATASYNC |
641 | # define fdatasync fsync |
825 | # define fdatasync fsync |
642 | #endif |
826 | #endif |
643 | |
827 | |
644 | #if !HAVE_READAHEAD |
828 | #if !HAVE_READAHEAD |
645 | # define readahead aio_readahead |
829 | # define readahead(fd,offset,count) aio_readahead (fd, offset, count, self) |
646 | |
830 | |
647 | static ssize_t readahead (int fd, off_t offset, size_t count) |
831 | static ssize_t aio_readahead (int fd, off_t offset, size_t count, worker *self) |
648 | { |
832 | { |
649 | dBUF; |
833 | dBUF; |
650 | |
834 | |
651 | while (count > 0) |
835 | while (count > 0) |
652 | { |
836 | { |
… | |
… | |
655 | pread (fd, aio_buf, len, offset); |
839 | pread (fd, aio_buf, len, offset); |
656 | offset += len; |
840 | offset += len; |
657 | count -= len; |
841 | count -= len; |
658 | } |
842 | } |
659 | |
843 | |
660 | fBUF; |
|
|
661 | |
|
|
662 | errno = 0; |
844 | errno = 0; |
663 | } |
845 | } |
|
|
846 | |
664 | #endif |
847 | #endif |
665 | |
848 | |
666 | #if !HAVE_READDIR_R |
849 | #if !HAVE_READDIR_R |
667 | # define readdir_r aio_readdir_r |
850 | # define readdir_r aio_readdir_r |
668 | |
851 | |
… | |
… | |
671 | static int readdir_r (DIR *dirp, struct dirent *ent, struct dirent **res) |
854 | static int readdir_r (DIR *dirp, struct dirent *ent, struct dirent **res) |
672 | { |
855 | { |
673 | struct dirent *e; |
856 | struct dirent *e; |
674 | int errorno; |
857 | int errorno; |
675 | |
858 | |
676 | pthread_mutex_lock (&readdirlock); |
859 | LOCK (readdirlock); |
677 | |
860 | |
678 | e = readdir (dirp); |
861 | e = readdir (dirp); |
679 | errorno = errno; |
862 | errorno = errno; |
680 | |
863 | |
681 | if (e) |
864 | if (e) |
… | |
… | |
684 | strcpy (ent->d_name, e->d_name); |
867 | strcpy (ent->d_name, e->d_name); |
685 | } |
868 | } |
686 | else |
869 | else |
687 | *res = 0; |
870 | *res = 0; |
688 | |
871 | |
689 | pthread_mutex_unlock (&readdirlock); |
872 | UNLOCK (readdirlock); |
690 | |
873 | |
691 | errno = errorno; |
874 | errno = errorno; |
692 | return e ? 0 : -1; |
875 | return e ? 0 : -1; |
693 | } |
876 | } |
694 | #endif |
877 | #endif |
695 | |
878 | |
696 | /* sendfile always needs emulation */ |
879 | /* sendfile always needs emulation */ |
697 | static ssize_t sendfile_ (int ofd, int ifd, off_t offset, size_t count) |
880 | static ssize_t sendfile_ (int ofd, int ifd, off_t offset, size_t count, worker *self) |
698 | { |
881 | { |
699 | ssize_t res; |
882 | ssize_t res; |
700 | |
883 | |
701 | if (!count) |
884 | if (!count) |
702 | return 0; |
885 | return 0; |
… | |
… | |
713 | { |
896 | { |
714 | off_t sbytes; |
897 | off_t sbytes; |
715 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
898 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
716 | |
899 | |
717 | if (res < 0 && sbytes) |
900 | if (res < 0 && sbytes) |
718 | /* maybe only on EAGAIN only: as usual, the manpage leaves you guessing */ |
901 | /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ |
719 | res = sbytes; |
902 | res = sbytes; |
720 | } |
903 | } |
721 | |
904 | |
722 | # elif __hpux |
905 | # elif __hpux |
723 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
906 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
… | |
… | |
779 | |
962 | |
780 | offset += cnt; |
963 | offset += cnt; |
781 | res += cnt; |
964 | res += cnt; |
782 | count -= cnt; |
965 | count -= cnt; |
783 | } |
966 | } |
784 | |
|
|
785 | fBUF; |
|
|
786 | } |
967 | } |
787 | |
968 | |
788 | return res; |
969 | return res; |
789 | } |
970 | } |
790 | |
971 | |
791 | /* read a full directory */ |
972 | /* read a full directory */ |
792 | static int scandir_ (const char *path, void **namesp) |
973 | static void scandir_ (aio_req req, worker *self) |
793 | { |
974 | { |
794 | DIR *dirp; |
975 | DIR *dirp; |
795 | union |
976 | union |
796 | { |
977 | { |
797 | struct dirent d; |
978 | struct dirent d; |
… | |
… | |
802 | int memlen = 4096; |
983 | int memlen = 4096; |
803 | int memofs = 0; |
984 | int memofs = 0; |
804 | int res = 0; |
985 | int res = 0; |
805 | int errorno; |
986 | int errorno; |
806 | |
987 | |
807 | dirp = opendir (path); |
988 | LOCK (wrklock); |
808 | if (!dirp) |
989 | self->dirp = dirp = opendir (req->dataptr); |
809 | return -1; |
|
|
810 | |
|
|
811 | u = malloc (sizeof (*u)); |
990 | self->dbuf = u = malloc (sizeof (*u)); |
812 | names = malloc (memlen); |
991 | req->data2ptr = names = malloc (memlen); |
|
|
992 | UNLOCK (wrklock); |
813 | |
993 | |
814 | if (u && names) |
994 | if (dirp && u && names) |
815 | for (;;) |
995 | for (;;) |
816 | { |
996 | { |
817 | errno = 0; |
997 | errno = 0; |
818 | readdir_r (dirp, &u->d, &entp); |
998 | readdir_r (dirp, &u->d, &entp); |
819 | |
999 | |
… | |
… | |
829 | res++; |
1009 | res++; |
830 | |
1010 | |
831 | while (memofs + len > memlen) |
1011 | while (memofs + len > memlen) |
832 | { |
1012 | { |
833 | memlen *= 2; |
1013 | memlen *= 2; |
|
|
1014 | LOCK (wrklock); |
834 | names = realloc (names, memlen); |
1015 | req->data2ptr = names = realloc (names, memlen); |
|
|
1016 | UNLOCK (wrklock); |
|
|
1017 | |
835 | if (!names) |
1018 | if (!names) |
836 | break; |
1019 | break; |
837 | } |
1020 | } |
838 | |
1021 | |
839 | memcpy (names + memofs, name, len); |
1022 | memcpy (names + memofs, name, len); |
840 | memofs += len; |
1023 | memofs += len; |
841 | } |
1024 | } |
842 | } |
1025 | } |
843 | |
1026 | |
844 | errorno = errno; |
|
|
845 | free (u); |
|
|
846 | closedir (dirp); |
|
|
847 | |
|
|
848 | if (errorno) |
1027 | if (errno) |
849 | { |
|
|
850 | free (names); |
|
|
851 | errno = errorno; |
|
|
852 | res = -1; |
1028 | res = -1; |
853 | } |
1029 | |
854 | |
1030 | req->result = res; |
855 | *namesp = (void *)names; |
|
|
856 | return res; |
|
|
857 | } |
1031 | } |
858 | |
1032 | |
859 | /*****************************************************************************/ |
1033 | /*****************************************************************************/ |
860 | |
1034 | |
861 | static void *aio_proc (void *thr_arg) |
1035 | static void *aio_proc (void *thr_arg) |
862 | { |
1036 | { |
863 | aio_req req; |
1037 | aio_req req; |
864 | int type; |
1038 | struct timespec ts; |
|
|
1039 | worker *self = (worker *)thr_arg; |
865 | |
1040 | |
866 | do |
1041 | /* try to distribute timeouts somewhat evenly */ |
|
|
1042 | ts.tv_nsec = (((unsigned long)self + (unsigned long)ts.tv_sec) & 1023UL) |
|
|
1043 | * (1000000000UL / 1024UL); |
|
|
1044 | |
|
|
1045 | for (;;) |
867 | { |
1046 | { |
868 | pthread_mutex_lock (&reqlock); |
1047 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
|
|
1048 | |
|
|
1049 | LOCK (reqlock); |
869 | |
1050 | |
870 | for (;;) |
1051 | for (;;) |
871 | { |
1052 | { |
872 | req = reqq_shift (&req_queue); |
1053 | self->req = req = reqq_shift (&req_queue); |
873 | |
1054 | |
874 | if (req) |
1055 | if (req) |
875 | break; |
1056 | break; |
876 | |
1057 | |
|
|
1058 | ++idle; |
|
|
1059 | |
|
|
1060 | if (pthread_cond_timedwait (&reqwait, &reqlock, &ts) |
|
|
1061 | == ETIMEDOUT) |
|
|
1062 | { |
|
|
1063 | if (idle > max_idle) |
|
|
1064 | { |
|
|
1065 | --idle; |
|
|
1066 | UNLOCK (reqlock); |
|
|
1067 | LOCK (wrklock); |
|
|
1068 | --started; |
|
|
1069 | UNLOCK (wrklock); |
|
|
1070 | goto quit; |
|
|
1071 | } |
|
|
1072 | |
|
|
1073 | /* we are allowed to idle, so do so without any timeout */ |
877 | pthread_cond_wait (&reqwait, &reqlock); |
1074 | pthread_cond_wait (&reqwait, &reqlock); |
|
|
1075 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
|
|
1076 | } |
|
|
1077 | |
|
|
1078 | --idle; |
878 | } |
1079 | } |
879 | |
1080 | |
880 | pthread_mutex_unlock (&reqlock); |
1081 | --nready; |
|
|
1082 | |
|
|
1083 | UNLOCK (reqlock); |
881 | |
1084 | |
882 | errno = 0; /* strictly unnecessary */ |
1085 | errno = 0; /* strictly unnecessary */ |
883 | type = req->type; /* remember type for QUIT check */ |
|
|
884 | |
1086 | |
885 | if (!(req->flags & FLAG_CANCELLED)) |
1087 | if (!(req->flags & FLAG_CANCELLED)) |
886 | switch (type) |
1088 | switch (req->type) |
887 | { |
1089 | { |
888 | case REQ_READ: req->result = pread (req->fd, req->dataptr, req->length, req->offset); break; |
1090 | case REQ_READ: req->result = pread (req->fd, req->dataptr, req->length, req->offset); break; |
889 | case REQ_WRITE: req->result = pwrite (req->fd, req->dataptr, req->length, req->offset); break; |
1091 | case REQ_WRITE: req->result = pwrite (req->fd, req->dataptr, req->length, req->offset); break; |
890 | |
1092 | |
891 | case REQ_READAHEAD: req->result = readahead (req->fd, req->offset, req->length); break; |
1093 | case REQ_READAHEAD: req->result = readahead (req->fd, req->offset, req->length); break; |
892 | case REQ_SENDFILE: req->result = sendfile_ (req->fd, req->fd2, req->offset, req->length); break; |
1094 | case REQ_SENDFILE: req->result = sendfile_ (req->fd, req->fd2, req->offset, req->length, self); break; |
893 | |
1095 | |
894 | case REQ_STAT: req->result = stat (req->dataptr, req->statdata); break; |
1096 | case REQ_STAT: req->result = stat (req->dataptr, req->statdata); break; |
895 | case REQ_LSTAT: req->result = lstat (req->dataptr, req->statdata); break; |
1097 | case REQ_LSTAT: req->result = lstat (req->dataptr, req->statdata); break; |
896 | case REQ_FSTAT: req->result = fstat (req->fd , req->statdata); break; |
1098 | case REQ_FSTAT: req->result = fstat (req->fd , req->statdata); break; |
897 | |
1099 | |
… | |
… | |
900 | case REQ_UNLINK: req->result = unlink (req->dataptr); break; |
1102 | case REQ_UNLINK: req->result = unlink (req->dataptr); break; |
901 | case REQ_RMDIR: req->result = rmdir (req->dataptr); break; |
1103 | case REQ_RMDIR: req->result = rmdir (req->dataptr); break; |
902 | case REQ_RENAME: req->result = rename (req->data2ptr, req->dataptr); break; |
1104 | case REQ_RENAME: req->result = rename (req->data2ptr, req->dataptr); break; |
903 | case REQ_LINK: req->result = link (req->data2ptr, req->dataptr); break; |
1105 | case REQ_LINK: req->result = link (req->data2ptr, req->dataptr); break; |
904 | case REQ_SYMLINK: req->result = symlink (req->data2ptr, req->dataptr); break; |
1106 | case REQ_SYMLINK: req->result = symlink (req->data2ptr, req->dataptr); break; |
|
|
1107 | case REQ_MKNOD: req->result = mknod (req->data2ptr, req->mode, (dev_t)req->offset); break; |
905 | |
1108 | |
906 | case REQ_FDATASYNC: req->result = fdatasync (req->fd); break; |
1109 | case REQ_FDATASYNC: req->result = fdatasync (req->fd); break; |
907 | case REQ_FSYNC: req->result = fsync (req->fd); break; |
1110 | case REQ_FSYNC: req->result = fsync (req->fd); break; |
908 | case REQ_READDIR: req->result = scandir_ (req->dataptr, &req->data2ptr); break; |
1111 | case REQ_READDIR: scandir_ (req, self); break; |
909 | |
1112 | |
910 | case REQ_BUSY: |
1113 | case REQ_BUSY: |
911 | { |
1114 | { |
912 | struct timeval tv; |
1115 | struct timeval tv; |
913 | |
1116 | |
… | |
… | |
917 | req->result = select (0, 0, 0, 0, &tv); |
1120 | req->result = select (0, 0, 0, 0, &tv); |
918 | } |
1121 | } |
919 | |
1122 | |
920 | case REQ_GROUP: |
1123 | case REQ_GROUP: |
921 | case REQ_NOP: |
1124 | case REQ_NOP: |
|
|
1125 | break; |
|
|
1126 | |
922 | case REQ_QUIT: |
1127 | case REQ_QUIT: |
923 | break; |
1128 | goto quit; |
924 | |
1129 | |
925 | default: |
1130 | default: |
926 | req->result = ENOSYS; |
1131 | req->result = ENOSYS; |
927 | break; |
1132 | break; |
928 | } |
1133 | } |
929 | |
1134 | |
930 | req->errorno = errno; |
1135 | req->errorno = errno; |
931 | |
1136 | |
932 | pthread_mutex_lock (&reslock); |
1137 | LOCK (reslock); |
|
|
1138 | |
|
|
1139 | ++npending; |
933 | |
1140 | |
934 | if (!reqq_push (&res_queue, req)) |
1141 | if (!reqq_push (&res_queue, req)) |
935 | /* write a dummy byte to the pipe so fh becomes ready */ |
1142 | /* write a dummy byte to the pipe so fh becomes ready */ |
936 | write (respipe [1], &respipe, 1); |
1143 | write (respipe [1], &respipe, 1); |
937 | |
1144 | |
938 | pthread_mutex_unlock (&reslock); |
1145 | self->req = 0; |
|
|
1146 | worker_clear (self); |
|
|
1147 | |
|
|
1148 | UNLOCK (reslock); |
939 | } |
1149 | } |
940 | while (type != REQ_QUIT); |
1150 | |
|
|
1151 | quit: |
|
|
1152 | LOCK (wrklock); |
|
|
1153 | worker_free (self); |
|
|
1154 | UNLOCK (wrklock); |
941 | |
1155 | |
942 | return 0; |
1156 | return 0; |
943 | } |
1157 | } |
944 | |
1158 | |
945 | /*****************************************************************************/ |
1159 | /*****************************************************************************/ |
946 | |
1160 | |
947 | static void atfork_prepare (void) |
1161 | static void atfork_prepare (void) |
948 | { |
1162 | { |
949 | pthread_mutex_lock (&reqlock); |
1163 | LOCK (wrklock); |
950 | pthread_mutex_lock (&reslock); |
1164 | LOCK (reqlock); |
|
|
1165 | LOCK (reslock); |
951 | #if !HAVE_PREADWRITE |
1166 | #if !HAVE_PREADWRITE |
952 | pthread_mutex_lock (&preadwritelock); |
1167 | LOCK (preadwritelock); |
953 | #endif |
1168 | #endif |
954 | #if !HAVE_READDIR_R |
1169 | #if !HAVE_READDIR_R |
955 | pthread_mutex_lock (&readdirlock); |
1170 | LOCK (readdirlock); |
956 | #endif |
1171 | #endif |
957 | } |
1172 | } |
958 | |
1173 | |
959 | static void atfork_parent (void) |
1174 | static void atfork_parent (void) |
960 | { |
1175 | { |
961 | #if !HAVE_READDIR_R |
1176 | #if !HAVE_READDIR_R |
962 | pthread_mutex_unlock (&readdirlock); |
1177 | UNLOCK (readdirlock); |
963 | #endif |
1178 | #endif |
964 | #if !HAVE_PREADWRITE |
1179 | #if !HAVE_PREADWRITE |
965 | pthread_mutex_unlock (&preadwritelock); |
1180 | UNLOCK (preadwritelock); |
966 | #endif |
1181 | #endif |
967 | pthread_mutex_unlock (&reslock); |
1182 | UNLOCK (reslock); |
968 | pthread_mutex_unlock (&reqlock); |
1183 | UNLOCK (reqlock); |
|
|
1184 | UNLOCK (wrklock); |
969 | } |
1185 | } |
970 | |
1186 | |
971 | static void atfork_child (void) |
1187 | static void atfork_child (void) |
972 | { |
1188 | { |
973 | aio_req prv; |
1189 | aio_req prv; |
974 | |
|
|
975 | started = 0; |
|
|
976 | |
1190 | |
977 | while (prv = reqq_shift (&req_queue)) |
1191 | while (prv = reqq_shift (&req_queue)) |
978 | req_free (prv); |
1192 | req_free (prv); |
979 | |
1193 | |
980 | while (prv = reqq_shift (&res_queue)) |
1194 | while (prv = reqq_shift (&res_queue)) |
981 | req_free (prv); |
1195 | req_free (prv); |
982 | |
1196 | |
|
|
1197 | while (wrk_first.next != &wrk_first) |
|
|
1198 | { |
|
|
1199 | worker *wrk = wrk_first.next; |
|
|
1200 | |
|
|
1201 | if (wrk->req) |
|
|
1202 | req_free (wrk->req); |
|
|
1203 | |
|
|
1204 | worker_clear (wrk); |
|
|
1205 | worker_free (wrk); |
|
|
1206 | } |
|
|
1207 | |
|
|
1208 | started = 0; |
|
|
1209 | idle = 0; |
|
|
1210 | nreqs = 0; |
|
|
1211 | nready = 0; |
|
|
1212 | npending = 0; |
|
|
1213 | |
983 | close (respipe [0]); |
1214 | close (respipe [0]); |
984 | close (respipe [1]); |
1215 | close (respipe [1]); |
985 | create_pipe (); |
1216 | create_pipe (); |
986 | |
1217 | |
987 | atfork_parent (); |
1218 | atfork_parent (); |
… | |
… | |
1013 | PROTOTYPES: ENABLE |
1244 | PROTOTYPES: ENABLE |
1014 | |
1245 | |
1015 | BOOT: |
1246 | BOOT: |
1016 | { |
1247 | { |
1017 | HV *stash = gv_stashpv ("IO::AIO", 1); |
1248 | HV *stash = gv_stashpv ("IO::AIO", 1); |
|
|
1249 | |
1018 | newCONSTSUB (stash, "EXDEV", newSViv (EXDEV)); |
1250 | newCONSTSUB (stash, "EXDEV", newSViv (EXDEV)); |
1019 | newCONSTSUB (stash, "O_RDONLY", newSViv (O_RDONLY)); |
1251 | newCONSTSUB (stash, "O_RDONLY", newSViv (O_RDONLY)); |
1020 | newCONSTSUB (stash, "O_WRONLY", newSViv (O_WRONLY)); |
1252 | newCONSTSUB (stash, "O_WRONLY", newSViv (O_WRONLY)); |
|
|
1253 | newCONSTSUB (stash, "O_CREAT", newSViv (O_CREAT)); |
|
|
1254 | newCONSTSUB (stash, "O_TRUNC", newSViv (O_TRUNC)); |
|
|
1255 | newCONSTSUB (stash, "S_IFIFO", newSViv (S_IFIFO)); |
1021 | |
1256 | |
1022 | create_pipe (); |
1257 | create_pipe (); |
1023 | pthread_atfork (atfork_prepare, atfork_parent, atfork_child); |
1258 | pthread_atfork (atfork_prepare, atfork_parent, atfork_child); |
1024 | } |
1259 | } |
1025 | |
1260 | |
1026 | void |
1261 | void |
1027 | min_parallel (nthreads) |
1262 | max_poll_reqs (int nreqs) |
1028 | int nthreads |
|
|
1029 | PROTOTYPE: $ |
1263 | PROTOTYPE: $ |
|
|
1264 | CODE: |
|
|
1265 | max_poll_reqs = nreqs; |
1030 | |
1266 | |
1031 | void |
1267 | void |
1032 | max_parallel (nthreads) |
1268 | max_poll_time (double nseconds) |
1033 | int nthreads |
|
|
1034 | PROTOTYPE: $ |
1269 | PROTOTYPE: $ |
|
|
1270 | CODE: |
|
|
1271 | max_poll_time = nseconds * AIO_TICKS; |
|
|
1272 | |
|
|
1273 | void |
|
|
1274 | min_parallel (int nthreads) |
|
|
1275 | PROTOTYPE: $ |
|
|
1276 | |
|
|
1277 | void |
|
|
1278 | max_parallel (int nthreads) |
|
|
1279 | PROTOTYPE: $ |
|
|
1280 | |
|
|
1281 | void |
|
|
1282 | max_idle (int nthreads) |
|
|
1283 | PROTOTYPE: $ |
|
|
1284 | CODE: |
|
|
1285 | set_max_idle (nthreads); |
1035 | |
1286 | |
1036 | int |
1287 | int |
1037 | max_outstanding (nreqs) |
1288 | max_outstanding (int maxreqs) |
1038 | int nreqs |
1289 | PROTOTYPE: $ |
1039 | PROTOTYPE: $ |
|
|
1040 | CODE: |
1290 | CODE: |
1041 | RETVAL = max_outstanding; |
1291 | RETVAL = max_outstanding; |
1042 | max_outstanding = nreqs; |
1292 | max_outstanding = maxreqs; |
|
|
1293 | OUTPUT: |
|
|
1294 | RETVAL |
1043 | |
1295 | |
1044 | void |
1296 | void |
1045 | aio_open (pathname,flags,mode,callback=&PL_sv_undef) |
1297 | aio_open (pathname,flags,mode,callback=&PL_sv_undef) |
1046 | SV * pathname |
1298 | SV * pathname |
1047 | int flags |
1299 | int flags |
… | |
… | |
1262 | |
1514 | |
1263 | REQ_SEND; |
1515 | REQ_SEND; |
1264 | } |
1516 | } |
1265 | |
1517 | |
1266 | void |
1518 | void |
|
|
1519 | aio_mknod (pathname,mode,dev,callback=&PL_sv_undef) |
|
|
1520 | SV * pathname |
|
|
1521 | SV * callback |
|
|
1522 | UV mode |
|
|
1523 | UV dev |
|
|
1524 | PPCODE: |
|
|
1525 | { |
|
|
1526 | dREQ; |
|
|
1527 | |
|
|
1528 | req->type = REQ_MKNOD; |
|
|
1529 | req->data = newSVsv (pathname); |
|
|
1530 | req->dataptr = SvPVbyte_nolen (req->data); |
|
|
1531 | req->mode = (mode_t)mode; |
|
|
1532 | req->offset = dev; |
|
|
1533 | |
|
|
1534 | REQ_SEND; |
|
|
1535 | } |
|
|
1536 | |
|
|
1537 | void |
1267 | aio_busy (delay,callback=&PL_sv_undef) |
1538 | aio_busy (delay,callback=&PL_sv_undef) |
1268 | double delay |
1539 | double delay |
1269 | SV * callback |
1540 | SV * callback |
1270 | PPCODE: |
1541 | PPCODE: |
1271 | { |
1542 | { |
… | |
… | |
1302 | req->type = REQ_NOP; |
1573 | req->type = REQ_NOP; |
1303 | |
1574 | |
1304 | REQ_SEND; |
1575 | REQ_SEND; |
1305 | } |
1576 | } |
1306 | |
1577 | |
1307 | void |
1578 | int |
1308 | aioreq_pri (int pri = DEFAULT_PRI) |
1579 | aioreq_pri (int pri = 0) |
1309 | CODE: |
1580 | PROTOTYPE: ;$ |
|
|
1581 | CODE: |
|
|
1582 | RETVAL = next_pri - PRI_BIAS; |
|
|
1583 | if (items > 0) |
|
|
1584 | { |
1310 | if (pri < PRI_MIN) pri = PRI_MIN; |
1585 | if (pri < PRI_MIN) pri = PRI_MIN; |
1311 | if (pri > PRI_MAX) pri = PRI_MAX; |
1586 | if (pri > PRI_MAX) pri = PRI_MAX; |
1312 | next_pri = pri + PRI_BIAS; |
1587 | next_pri = pri + PRI_BIAS; |
|
|
1588 | } |
|
|
1589 | OUTPUT: |
|
|
1590 | RETVAL |
1313 | |
1591 | |
1314 | void |
1592 | void |
1315 | aioreq_nice (int nice = 0) |
1593 | aioreq_nice (int nice = 0) |
1316 | CODE: |
1594 | CODE: |
1317 | nice = next_pri - nice; |
1595 | nice = next_pri - nice; |
1318 | if (nice < PRI_MIN) nice = PRI_MIN; |
1596 | if (nice < PRI_MIN) nice = PRI_MIN; |
1319 | if (nice > PRI_MAX) nice = PRI_MAX; |
1597 | if (nice > PRI_MAX) nice = PRI_MAX; |
1320 | next_pri = nice + PRI_BIAS; |
1598 | next_pri = nice + PRI_BIAS; |
1321 | |
1599 | |
1322 | void |
1600 | void |
1323 | flush () |
1601 | flush () |
1324 | PROTOTYPE: |
1602 | PROTOTYPE: |
1325 | CODE: |
1603 | CODE: |
1326 | while (nreqs) |
1604 | while (nreqs) |
1327 | { |
1605 | { |
1328 | poll_wait (); |
1606 | poll_wait (); |
1329 | poll_cb (); |
1607 | poll_cb (0); |
1330 | } |
1608 | } |
1331 | |
1609 | |
1332 | void |
1610 | void |
1333 | poll() |
1611 | poll() |
1334 | PROTOTYPE: |
1612 | PROTOTYPE: |
1335 | CODE: |
1613 | CODE: |
1336 | if (nreqs) |
1614 | if (nreqs) |
1337 | { |
1615 | { |
1338 | poll_wait (); |
1616 | poll_wait (); |
1339 | poll_cb (); |
1617 | poll_cb (0); |
1340 | } |
1618 | } |
1341 | |
1619 | |
1342 | int |
1620 | int |
1343 | poll_fileno() |
1621 | poll_fileno() |
1344 | PROTOTYPE: |
1622 | PROTOTYPE: |
… | |
… | |
1368 | CODE: |
1646 | CODE: |
1369 | RETVAL = nreqs; |
1647 | RETVAL = nreqs; |
1370 | OUTPUT: |
1648 | OUTPUT: |
1371 | RETVAL |
1649 | RETVAL |
1372 | |
1650 | |
|
|
1651 | int |
|
|
1652 | nready() |
|
|
1653 | PROTOTYPE: |
|
|
1654 | CODE: |
|
|
1655 | RETVAL = get_nready (); |
|
|
1656 | OUTPUT: |
|
|
1657 | RETVAL |
|
|
1658 | |
|
|
1659 | int |
|
|
1660 | npending() |
|
|
1661 | PROTOTYPE: |
|
|
1662 | CODE: |
|
|
1663 | RETVAL = get_npending (); |
|
|
1664 | OUTPUT: |
|
|
1665 | RETVAL |
|
|
1666 | |
|
|
1667 | int |
|
|
1668 | nthreads() |
|
|
1669 | PROTOTYPE: |
|
|
1670 | CODE: |
|
|
1671 | if (WORDACCESS_UNSAFE) LOCK (wrklock); |
|
|
1672 | RETVAL = started; |
|
|
1673 | if (WORDACCESS_UNSAFE) UNLOCK (wrklock); |
|
|
1674 | OUTPUT: |
|
|
1675 | RETVAL |
|
|
1676 | |
1373 | PROTOTYPES: DISABLE |
1677 | PROTOTYPES: DISABLE |
1374 | |
1678 | |
1375 | MODULE = IO::AIO PACKAGE = IO::AIO::REQ |
1679 | MODULE = IO::AIO PACKAGE = IO::AIO::REQ |
1376 | |
1680 | |
1377 | void |
1681 | void |
… | |
… | |
1419 | } |
1723 | } |
1420 | } |
1724 | } |
1421 | } |
1725 | } |
1422 | |
1726 | |
1423 | void |
1727 | void |
|
|
1728 | cancel_subs (aio_req_ornot req) |
|
|
1729 | CODE: |
|
|
1730 | req_cancel_subs (req); |
|
|
1731 | |
|
|
1732 | void |
1424 | result (aio_req grp, ...) |
1733 | result (aio_req grp, ...) |
1425 | CODE: |
1734 | CODE: |
1426 | { |
1735 | { |
1427 | int i; |
1736 | int i; |
|
|
1737 | AV *av; |
|
|
1738 | |
|
|
1739 | grp->errorno = errno; |
|
|
1740 | |
1428 | AV *av = newAV (); |
1741 | av = newAV (); |
1429 | |
1742 | |
1430 | for (i = 1; i < items; ++i ) |
1743 | for (i = 1; i < items; ++i ) |
1431 | av_push (av, newSVsv (ST (i))); |
1744 | av_push (av, newSVsv (ST (i))); |
1432 | |
1745 | |
1433 | SvREFCNT_dec (grp->data); |
1746 | SvREFCNT_dec (grp->data); |
1434 | grp->data = (SV *)av; |
1747 | grp->data = (SV *)av; |
1435 | } |
1748 | } |
|
|
1749 | |
|
|
1750 | void |
|
|
1751 | errno (aio_req grp, int errorno = errno) |
|
|
1752 | CODE: |
|
|
1753 | grp->errorno = errorno; |
1436 | |
1754 | |
1437 | void |
1755 | void |
1438 | limit (aio_req grp, int limit) |
1756 | limit (aio_req grp, int limit) |
1439 | CODE: |
1757 | CODE: |
1440 | grp->fd2 = limit; |
1758 | grp->fd2 = limit; |