| 1 |
/* solaris */ |
| 2 |
#define _POSIX_PTHREAD_SEMANTICS 1 |
| 3 |
|
| 4 |
#if __linux && !defined(_GNU_SOURCE) |
| 5 |
# define _GNU_SOURCE |
| 6 |
#endif |
| 7 |
|
| 8 |
/* just in case */ |
| 9 |
#define _REENTRANT 1 |
| 10 |
|
| 11 |
#include <errno.h> |
| 12 |
|
| 13 |
#include "EXTERN.h" |
| 14 |
#include "perl.h" |
| 15 |
#include "XSUB.h" |
| 16 |
|
| 17 |
#include "autoconf/config.h" |
| 18 |
|
| 19 |
#include <pthread.h> |
| 20 |
|
| 21 |
#include <stddef.h> |
| 22 |
#include <errno.h> |
| 23 |
#include <sys/time.h> |
| 24 |
#include <sys/select.h> |
| 25 |
#include <sys/types.h> |
| 26 |
#include <sys/stat.h> |
| 27 |
#include <limits.h> |
| 28 |
#include <unistd.h> |
| 29 |
#include <fcntl.h> |
| 30 |
#include <signal.h> |
| 31 |
#include <sched.h> |
| 32 |
|
| 33 |
#if HAVE_SENDFILE |
| 34 |
# if __linux |
| 35 |
# include <sys/sendfile.h> |
| 36 |
# elif __freebsd |
| 37 |
# include <sys/socket.h> |
| 38 |
# include <sys/uio.h> |
| 39 |
# elif __hpux |
| 40 |
# include <sys/socket.h> |
| 41 |
# elif __solaris /* not yet */ |
| 42 |
# include <sys/sendfile.h> |
| 43 |
# else |
| 44 |
# error sendfile support requested but not available |
| 45 |
# endif |
| 46 |
#endif |
| 47 |
|
| 48 |
/* used for struct dirent, AIX doesn't provide it */ |
| 49 |
#ifndef NAME_MAX |
| 50 |
# define NAME_MAX 4096 |
| 51 |
#endif |
| 52 |
|
| 53 |
#ifndef PTHREAD_STACK_MIN |
| 54 |
/* care for broken platforms, e.g. windows */ |
| 55 |
# define PTHREAD_STACK_MIN 16384 |
| 56 |
#endif |
| 57 |
|
| 58 |
#if __ia64 |
| 59 |
# define STACKSIZE 65536 |
| 60 |
#elif __i386 || __x86_64 /* 16k is unreasonably high :( */ |
| 61 |
# define STACKSIZE PTHREAD_STACK_MIN |
| 62 |
#else |
| 63 |
# define STACKSIZE 16384 |
| 64 |
#endif |
| 65 |
|
| 66 |
/* wether word reads are potentially non-atomic. |
| 67 |
* this is conservatice, likely most arches this runs |
| 68 |
* on have atomic word read/writes. |
| 69 |
*/ |
| 70 |
#ifndef WORDREAD_UNSAFE |
| 71 |
# if __i386 || __x86_64 |
| 72 |
# define WORDREAD_UNSAFE 0 |
| 73 |
# else |
| 74 |
# define WORDREAD_UNSAFE 1 |
| 75 |
# endif |
| 76 |
#endif |
| 77 |
|
| 78 |
/* buffer size for various temporary buffers */ |
| 79 |
#define AIO_BUFSIZE 65536 |
| 80 |
|
| 81 |
#define dBUF \ |
| 82 |
char *aio_buf; \ |
| 83 |
LOCK (wrklock); \ |
| 84 |
self->dbuf = aio_buf = malloc (AIO_BUFSIZE); \ |
| 85 |
UNLOCK (wrklock); \ |
| 86 |
if (!aio_buf) \ |
| 87 |
return -1; |
| 88 |
|
| 89 |
enum { |
| 90 |
REQ_QUIT, |
| 91 |
REQ_OPEN, REQ_CLOSE, |
| 92 |
REQ_READ, REQ_WRITE, REQ_READAHEAD, |
| 93 |
REQ_SENDFILE, |
| 94 |
REQ_STAT, REQ_LSTAT, REQ_FSTAT, |
| 95 |
REQ_FSYNC, REQ_FDATASYNC, |
| 96 |
REQ_UNLINK, REQ_RMDIR, REQ_RENAME, |
| 97 |
REQ_READDIR, |
| 98 |
REQ_LINK, REQ_SYMLINK, |
| 99 |
REQ_GROUP, REQ_NOP, |
| 100 |
REQ_BUSY, |
| 101 |
}; |
| 102 |
|
| 103 |
#define AIO_REQ_KLASS "IO::AIO::REQ" |
| 104 |
#define AIO_GRP_KLASS "IO::AIO::GRP" |
| 105 |
|
| 106 |
typedef struct aio_cb |
| 107 |
{ |
| 108 |
struct aio_cb *volatile next; |
| 109 |
|
| 110 |
SV *data, *callback; |
| 111 |
SV *fh, *fh2; |
| 112 |
void *dataptr, *data2ptr; |
| 113 |
Stat_t *statdata; |
| 114 |
off_t offset; |
| 115 |
size_t length; |
| 116 |
ssize_t result; |
| 117 |
|
| 118 |
STRLEN dataoffset; |
| 119 |
int type; |
| 120 |
int fd, fd2; |
| 121 |
int errorno; |
| 122 |
mode_t mode; /* open */ |
| 123 |
|
| 124 |
unsigned char flags; |
| 125 |
unsigned char pri; |
| 126 |
|
| 127 |
SV *self; /* the perl counterpart of this request, if any */ |
| 128 |
struct aio_cb *grp, *grp_prev, *grp_next, *grp_first; |
| 129 |
} aio_cb; |
| 130 |
|
| 131 |
enum { |
| 132 |
FLAG_CANCELLED = 0x01, |
| 133 |
}; |
| 134 |
|
| 135 |
typedef aio_cb *aio_req; |
| 136 |
typedef aio_cb *aio_req_ornot; |
| 137 |
|
| 138 |
enum { |
| 139 |
PRI_MIN = -4, |
| 140 |
PRI_MAX = 4, |
| 141 |
|
| 142 |
DEFAULT_PRI = 0, |
| 143 |
PRI_BIAS = -PRI_MIN, |
| 144 |
NUM_PRI = PRI_MAX + PRI_BIAS + 1, |
| 145 |
}; |
| 146 |
|
| 147 |
static int next_pri = DEFAULT_PRI + PRI_BIAS; |
| 148 |
|
| 149 |
static unsigned int started, wanted; |
| 150 |
static volatile unsigned int nreqs, nready, npending; |
| 151 |
static volatile unsigned int max_outstanding = 0xffffffff; |
| 152 |
static int respipe [2]; |
| 153 |
|
| 154 |
#if __linux && defined (PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP) |
| 155 |
# define AIO_MUTEX_INIT PTHREAD_ADAPTIVE_MUTEX_INITIALIZER_NP |
| 156 |
#else |
| 157 |
# define AIO_MUTEX_INIT PTHREAD_MUTEX_INITIALIZER |
| 158 |
#endif |
| 159 |
|
| 160 |
#define LOCK(mutex) pthread_mutex_lock (&(mutex)) |
| 161 |
#define UNLOCK(mutex) pthread_mutex_unlock (&(mutex)) |
| 162 |
|
| 163 |
/* worker threads management */ |
| 164 |
static pthread_mutex_t wrklock = AIO_MUTEX_INIT; |
| 165 |
|
| 166 |
typedef struct worker { |
| 167 |
/* locked by wrklock */ |
| 168 |
struct worker *prev, *next; |
| 169 |
|
| 170 |
pthread_t tid; |
| 171 |
|
| 172 |
/* locked by reslock, reqlock or wrklock */ |
| 173 |
aio_req req; /* currently processed request */ |
| 174 |
void *dbuf; |
| 175 |
DIR *dirp; |
| 176 |
} worker; |
| 177 |
|
| 178 |
static worker wrk_first = { &wrk_first, &wrk_first, 0 }; |
| 179 |
|
| 180 |
static void worker_clear (worker *wrk) |
| 181 |
{ |
| 182 |
if (wrk->dirp) |
| 183 |
{ |
| 184 |
closedir (wrk->dirp); |
| 185 |
wrk->dirp = 0; |
| 186 |
} |
| 187 |
|
| 188 |
if (wrk->dbuf) |
| 189 |
{ |
| 190 |
free (wrk->dbuf); |
| 191 |
wrk->dbuf = 0; |
| 192 |
} |
| 193 |
} |
| 194 |
|
| 195 |
static void worker_free (worker *wrk) |
| 196 |
{ |
| 197 |
wrk->next->prev = wrk->prev; |
| 198 |
wrk->prev->next = wrk->next; |
| 199 |
|
| 200 |
free (wrk); |
| 201 |
} |
| 202 |
|
| 203 |
static pthread_mutex_t reslock = AIO_MUTEX_INIT; |
| 204 |
static pthread_mutex_t reqlock = AIO_MUTEX_INIT; |
| 205 |
static pthread_cond_t reqwait = PTHREAD_COND_INITIALIZER; |
| 206 |
|
| 207 |
/* |
| 208 |
* a somewhat faster data structure might be nice, but |
| 209 |
* with 8 priorities this actually needs <20 insns |
| 210 |
* per shift, the most expensive operation. |
| 211 |
*/ |
| 212 |
typedef struct { |
| 213 |
aio_req qs[NUM_PRI], qe[NUM_PRI]; /* qstart, qend */ |
| 214 |
int size; |
| 215 |
} reqq; |
| 216 |
|
| 217 |
static reqq req_queue; |
| 218 |
static reqq res_queue; |
| 219 |
|
| 220 |
int reqq_push (reqq *q, aio_req req) |
| 221 |
{ |
| 222 |
int pri = req->pri; |
| 223 |
req->next = 0; |
| 224 |
|
| 225 |
if (q->qe[pri]) |
| 226 |
{ |
| 227 |
q->qe[pri]->next = req; |
| 228 |
q->qe[pri] = req; |
| 229 |
} |
| 230 |
else |
| 231 |
q->qe[pri] = q->qs[pri] = req; |
| 232 |
|
| 233 |
return q->size++; |
| 234 |
} |
| 235 |
|
| 236 |
aio_req reqq_shift (reqq *q) |
| 237 |
{ |
| 238 |
int pri; |
| 239 |
|
| 240 |
if (!q->size) |
| 241 |
return 0; |
| 242 |
|
| 243 |
--q->size; |
| 244 |
|
| 245 |
for (pri = NUM_PRI; pri--; ) |
| 246 |
{ |
| 247 |
aio_req req = q->qs[pri]; |
| 248 |
|
| 249 |
if (req) |
| 250 |
{ |
| 251 |
if (!(q->qs[pri] = req->next)) |
| 252 |
q->qe[pri] = 0; |
| 253 |
|
| 254 |
return req; |
| 255 |
} |
| 256 |
} |
| 257 |
|
| 258 |
abort (); |
| 259 |
} |
| 260 |
|
| 261 |
static int poll_cb (int max); |
| 262 |
static void req_invoke (aio_req req); |
| 263 |
static void req_free (aio_req req); |
| 264 |
static void req_cancel (aio_req req); |
| 265 |
|
| 266 |
/* must be called at most once */ |
| 267 |
static SV *req_sv (aio_req req, const char *klass) |
| 268 |
{ |
| 269 |
if (!req->self) |
| 270 |
{ |
| 271 |
req->self = (SV *)newHV (); |
| 272 |
sv_magic (req->self, 0, PERL_MAGIC_ext, (char *)req, 0); |
| 273 |
} |
| 274 |
|
| 275 |
return sv_2mortal (sv_bless (newRV_inc (req->self), gv_stashpv (klass, 1))); |
| 276 |
} |
| 277 |
|
| 278 |
static aio_req SvAIO_REQ (SV *sv) |
| 279 |
{ |
| 280 |
MAGIC *mg; |
| 281 |
|
| 282 |
if (!sv_derived_from (sv, AIO_REQ_KLASS) || !SvROK (sv)) |
| 283 |
croak ("object of class " AIO_REQ_KLASS " expected"); |
| 284 |
|
| 285 |
mg = mg_find (SvRV (sv), PERL_MAGIC_ext); |
| 286 |
|
| 287 |
return mg ? (aio_req)mg->mg_ptr : 0; |
| 288 |
} |
| 289 |
|
| 290 |
static void aio_grp_feed (aio_req grp) |
| 291 |
{ |
| 292 |
while (grp->length < grp->fd2 && !(grp->flags & FLAG_CANCELLED)) |
| 293 |
{ |
| 294 |
int old_len = grp->length; |
| 295 |
|
| 296 |
if (grp->fh2 && SvOK (grp->fh2)) |
| 297 |
{ |
| 298 |
dSP; |
| 299 |
|
| 300 |
ENTER; |
| 301 |
SAVETMPS; |
| 302 |
PUSHMARK (SP); |
| 303 |
XPUSHs (req_sv (grp, AIO_GRP_KLASS)); |
| 304 |
PUTBACK; |
| 305 |
call_sv (grp->fh2, G_VOID | G_EVAL | G_KEEPERR); |
| 306 |
SPAGAIN; |
| 307 |
FREETMPS; |
| 308 |
LEAVE; |
| 309 |
} |
| 310 |
|
| 311 |
/* stop if no progress has been made */ |
| 312 |
if (old_len == grp->length) |
| 313 |
{ |
| 314 |
SvREFCNT_dec (grp->fh2); |
| 315 |
grp->fh2 = 0; |
| 316 |
break; |
| 317 |
} |
| 318 |
} |
| 319 |
} |
| 320 |
|
| 321 |
static void aio_grp_dec (aio_req grp) |
| 322 |
{ |
| 323 |
--grp->length; |
| 324 |
|
| 325 |
/* call feeder, if applicable */ |
| 326 |
aio_grp_feed (grp); |
| 327 |
|
| 328 |
/* finish, if done */ |
| 329 |
if (!grp->length && grp->fd) |
| 330 |
{ |
| 331 |
req_invoke (grp); |
| 332 |
req_free (grp); |
| 333 |
} |
| 334 |
} |
| 335 |
|
| 336 |
static void poll_wait () |
| 337 |
{ |
| 338 |
fd_set rfd; |
| 339 |
|
| 340 |
while (nreqs) |
| 341 |
{ |
| 342 |
int size; |
| 343 |
if (WORDREAD_UNSAFE) LOCK (reslock); |
| 344 |
size = res_queue.size; |
| 345 |
if (WORDREAD_UNSAFE) UNLOCK (reslock); |
| 346 |
|
| 347 |
if (size) |
| 348 |
return; |
| 349 |
|
| 350 |
FD_ZERO(&rfd); |
| 351 |
FD_SET(respipe [0], &rfd); |
| 352 |
|
| 353 |
select (respipe [0] + 1, &rfd, 0, 0, 0); |
| 354 |
} |
| 355 |
} |
| 356 |
|
| 357 |
static void req_invoke (aio_req req) |
| 358 |
{ |
| 359 |
dSP; |
| 360 |
|
| 361 |
if (!(req->flags & FLAG_CANCELLED) && SvOK (req->callback)) |
| 362 |
{ |
| 363 |
ENTER; |
| 364 |
SAVETMPS; |
| 365 |
PUSHMARK (SP); |
| 366 |
EXTEND (SP, 1); |
| 367 |
|
| 368 |
switch (req->type) |
| 369 |
{ |
| 370 |
case REQ_READDIR: |
| 371 |
{ |
| 372 |
SV *rv = &PL_sv_undef; |
| 373 |
|
| 374 |
if (req->result >= 0) |
| 375 |
{ |
| 376 |
int i; |
| 377 |
char *buf = req->data2ptr; |
| 378 |
AV *av = newAV (); |
| 379 |
|
| 380 |
av_extend (av, req->result - 1); |
| 381 |
|
| 382 |
for (i = 0; i < req->result; ++i) |
| 383 |
{ |
| 384 |
SV *sv = newSVpv (buf, 0); |
| 385 |
|
| 386 |
av_store (av, i, sv); |
| 387 |
buf += SvCUR (sv) + 1; |
| 388 |
} |
| 389 |
|
| 390 |
rv = sv_2mortal (newRV_noinc ((SV *)av)); |
| 391 |
} |
| 392 |
|
| 393 |
PUSHs (rv); |
| 394 |
} |
| 395 |
break; |
| 396 |
|
| 397 |
case REQ_OPEN: |
| 398 |
{ |
| 399 |
/* convert fd to fh */ |
| 400 |
SV *fh; |
| 401 |
|
| 402 |
PUSHs (sv_2mortal (newSViv (req->result))); |
| 403 |
PUTBACK; |
| 404 |
call_pv ("IO::AIO::_fd2fh", G_SCALAR | G_EVAL); |
| 405 |
SPAGAIN; |
| 406 |
|
| 407 |
fh = SvREFCNT_inc (POPs); |
| 408 |
|
| 409 |
PUSHMARK (SP); |
| 410 |
XPUSHs (sv_2mortal (fh)); |
| 411 |
} |
| 412 |
break; |
| 413 |
|
| 414 |
case REQ_GROUP: |
| 415 |
req->fd = 2; /* mark group as finished */ |
| 416 |
|
| 417 |
if (req->data) |
| 418 |
{ |
| 419 |
int i; |
| 420 |
AV *av = (AV *)req->data; |
| 421 |
|
| 422 |
EXTEND (SP, AvFILL (av) + 1); |
| 423 |
for (i = 0; i <= AvFILL (av); ++i) |
| 424 |
PUSHs (*av_fetch (av, i, 0)); |
| 425 |
} |
| 426 |
break; |
| 427 |
|
| 428 |
case REQ_NOP: |
| 429 |
case REQ_BUSY: |
| 430 |
break; |
| 431 |
|
| 432 |
default: |
| 433 |
PUSHs (sv_2mortal (newSViv (req->result))); |
| 434 |
break; |
| 435 |
} |
| 436 |
|
| 437 |
errno = req->errorno; |
| 438 |
|
| 439 |
PUTBACK; |
| 440 |
call_sv (req->callback, G_VOID | G_EVAL); |
| 441 |
SPAGAIN; |
| 442 |
|
| 443 |
FREETMPS; |
| 444 |
LEAVE; |
| 445 |
} |
| 446 |
|
| 447 |
if (req->grp) |
| 448 |
{ |
| 449 |
aio_req grp = req->grp; |
| 450 |
|
| 451 |
/* unlink request */ |
| 452 |
if (req->grp_next) req->grp_next->grp_prev = req->grp_prev; |
| 453 |
if (req->grp_prev) req->grp_prev->grp_next = req->grp_next; |
| 454 |
|
| 455 |
if (grp->grp_first == req) |
| 456 |
grp->grp_first = req->grp_next; |
| 457 |
|
| 458 |
aio_grp_dec (grp); |
| 459 |
} |
| 460 |
|
| 461 |
if (SvTRUE (ERRSV)) |
| 462 |
{ |
| 463 |
req_free (req); |
| 464 |
croak (0); |
| 465 |
} |
| 466 |
} |
| 467 |
|
| 468 |
static void req_free (aio_req req) |
| 469 |
{ |
| 470 |
if (req->self) |
| 471 |
{ |
| 472 |
sv_unmagic (req->self, PERL_MAGIC_ext); |
| 473 |
SvREFCNT_dec (req->self); |
| 474 |
} |
| 475 |
|
| 476 |
SvREFCNT_dec (req->data); |
| 477 |
SvREFCNT_dec (req->fh); |
| 478 |
SvREFCNT_dec (req->fh2); |
| 479 |
SvREFCNT_dec (req->callback); |
| 480 |
Safefree (req->statdata); |
| 481 |
|
| 482 |
if (req->type == REQ_READDIR) |
| 483 |
free (req->data2ptr); |
| 484 |
|
| 485 |
Safefree (req); |
| 486 |
} |
| 487 |
|
| 488 |
static void req_cancel_subs (aio_req grp) |
| 489 |
{ |
| 490 |
aio_req sub; |
| 491 |
|
| 492 |
if (grp->type != REQ_GROUP) |
| 493 |
return; |
| 494 |
|
| 495 |
SvREFCNT_dec (grp->fh2); |
| 496 |
grp->fh2 = 0; |
| 497 |
|
| 498 |
for (sub = grp->grp_first; sub; sub = sub->grp_next) |
| 499 |
req_cancel (sub); |
| 500 |
} |
| 501 |
|
| 502 |
static void req_cancel (aio_req req) |
| 503 |
{ |
| 504 |
req->flags |= FLAG_CANCELLED; |
| 505 |
|
| 506 |
req_cancel_subs (req); |
| 507 |
} |
| 508 |
|
| 509 |
static int poll_cb (int max) |
| 510 |
{ |
| 511 |
dSP; |
| 512 |
int count = 0; |
| 513 |
int do_croak = 0; |
| 514 |
aio_req req; |
| 515 |
|
| 516 |
for (;;) |
| 517 |
{ |
| 518 |
while (max <= 0 || count < max) |
| 519 |
{ |
| 520 |
LOCK (reslock); |
| 521 |
req = reqq_shift (&res_queue); |
| 522 |
|
| 523 |
if (req) |
| 524 |
{ |
| 525 |
--npending; |
| 526 |
|
| 527 |
if (!res_queue.size) |
| 528 |
{ |
| 529 |
/* read any signals sent by the worker threads */ |
| 530 |
char buf [32]; |
| 531 |
while (read (respipe [0], buf, 32) == 32) |
| 532 |
; |
| 533 |
} |
| 534 |
} |
| 535 |
|
| 536 |
UNLOCK (reslock); |
| 537 |
|
| 538 |
if (!req) |
| 539 |
break; |
| 540 |
|
| 541 |
--nreqs; |
| 542 |
|
| 543 |
if (req->type == REQ_QUIT) |
| 544 |
--started; |
| 545 |
else if (req->type == REQ_GROUP && req->length) |
| 546 |
{ |
| 547 |
req->fd = 1; /* mark request as delayed */ |
| 548 |
continue; |
| 549 |
} |
| 550 |
else |
| 551 |
{ |
| 552 |
if (req->type == REQ_READ) |
| 553 |
SvCUR_set (req->data, req->dataoffset + (req->result > 0 ? req->result : 0)); |
| 554 |
|
| 555 |
if (req->data2ptr && (req->type == REQ_READ || req->type == REQ_WRITE)) |
| 556 |
SvREADONLY_off (req->data); |
| 557 |
|
| 558 |
if (req->statdata) |
| 559 |
{ |
| 560 |
PL_laststype = req->type == REQ_LSTAT ? OP_LSTAT : OP_STAT; |
| 561 |
PL_laststatval = req->result; |
| 562 |
PL_statcache = *(req->statdata); |
| 563 |
} |
| 564 |
|
| 565 |
req_invoke (req); |
| 566 |
|
| 567 |
count++; |
| 568 |
} |
| 569 |
|
| 570 |
req_free (req); |
| 571 |
} |
| 572 |
|
| 573 |
if (nreqs <= max_outstanding) |
| 574 |
break; |
| 575 |
|
| 576 |
poll_wait (); |
| 577 |
|
| 578 |
max = 0; |
| 579 |
} |
| 580 |
|
| 581 |
return count; |
| 582 |
} |
| 583 |
|
| 584 |
static void *aio_proc(void *arg); |
| 585 |
|
| 586 |
static void start_thread (void) |
| 587 |
{ |
| 588 |
sigset_t fullsigset, oldsigset; |
| 589 |
pthread_attr_t attr; |
| 590 |
|
| 591 |
worker *wrk = calloc (1, sizeof (worker)); |
| 592 |
|
| 593 |
if (!wrk) |
| 594 |
croak ("unable to allocate worker thread data"); |
| 595 |
|
| 596 |
pthread_attr_init (&attr); |
| 597 |
pthread_attr_setstacksize (&attr, STACKSIZE); |
| 598 |
pthread_attr_setdetachstate (&attr, PTHREAD_CREATE_DETACHED); |
| 599 |
|
| 600 |
sigfillset (&fullsigset); |
| 601 |
|
| 602 |
LOCK (wrklock); |
| 603 |
sigprocmask (SIG_SETMASK, &fullsigset, &oldsigset); |
| 604 |
|
| 605 |
if (pthread_create (&wrk->tid, &attr, aio_proc, (void *)wrk) == 0) |
| 606 |
{ |
| 607 |
wrk->prev = &wrk_first; |
| 608 |
wrk->next = wrk_first.next; |
| 609 |
wrk_first.next->prev = wrk; |
| 610 |
wrk_first.next = wrk; |
| 611 |
++started; |
| 612 |
} |
| 613 |
else |
| 614 |
free (wrk); |
| 615 |
|
| 616 |
sigprocmask (SIG_SETMASK, &oldsigset, 0); |
| 617 |
UNLOCK (wrklock); |
| 618 |
} |
| 619 |
|
| 620 |
static void req_send (aio_req req) |
| 621 |
{ |
| 622 |
while (started < wanted && nreqs >= started) |
| 623 |
start_thread (); |
| 624 |
|
| 625 |
++nreqs; |
| 626 |
|
| 627 |
LOCK (reqlock); |
| 628 |
++nready; |
| 629 |
reqq_push (&req_queue, req); |
| 630 |
pthread_cond_signal (&reqwait); |
| 631 |
UNLOCK (reqlock); |
| 632 |
} |
| 633 |
|
| 634 |
static void end_thread (void) |
| 635 |
{ |
| 636 |
aio_req req; |
| 637 |
|
| 638 |
Newz (0, req, 1, aio_cb); |
| 639 |
|
| 640 |
req->type = REQ_QUIT; |
| 641 |
req->pri = PRI_MAX + PRI_BIAS; |
| 642 |
|
| 643 |
req_send (req); |
| 644 |
} |
| 645 |
|
| 646 |
static void min_parallel (int nthreads) |
| 647 |
{ |
| 648 |
if (wanted < nthreads) |
| 649 |
wanted = nthreads; |
| 650 |
} |
| 651 |
|
| 652 |
static void max_parallel (int nthreads) |
| 653 |
{ |
| 654 |
int cur = started; |
| 655 |
|
| 656 |
if (wanted > nthreads) |
| 657 |
wanted = nthreads; |
| 658 |
|
| 659 |
while (cur > wanted) |
| 660 |
{ |
| 661 |
end_thread (); |
| 662 |
cur--; |
| 663 |
} |
| 664 |
|
| 665 |
while (started > wanted) |
| 666 |
{ |
| 667 |
poll_wait (); |
| 668 |
poll_cb (0); |
| 669 |
} |
| 670 |
} |
| 671 |
|
| 672 |
static void create_pipe () |
| 673 |
{ |
| 674 |
if (pipe (respipe)) |
| 675 |
croak ("unable to initialize result pipe"); |
| 676 |
|
| 677 |
if (fcntl (respipe [0], F_SETFL, O_NONBLOCK)) |
| 678 |
croak ("cannot set result pipe to nonblocking mode"); |
| 679 |
|
| 680 |
if (fcntl (respipe [1], F_SETFL, O_NONBLOCK)) |
| 681 |
croak ("cannot set result pipe to nonblocking mode"); |
| 682 |
} |
| 683 |
|
| 684 |
/*****************************************************************************/ |
| 685 |
/* work around various missing functions */ |
| 686 |
|
| 687 |
#if !HAVE_PREADWRITE |
| 688 |
# define pread aio_pread |
| 689 |
# define pwrite aio_pwrite |
| 690 |
|
| 691 |
/* |
| 692 |
* make our pread/pwrite safe against themselves, but not against |
| 693 |
* normal read/write by using a mutex. slows down execution a lot, |
| 694 |
* but that's your problem, not mine. |
| 695 |
*/ |
| 696 |
static pthread_mutex_t preadwritelock = PTHREAD_MUTEX_INITIALIZER; |
| 697 |
|
| 698 |
static ssize_t pread (int fd, void *buf, size_t count, off_t offset) |
| 699 |
{ |
| 700 |
ssize_t res; |
| 701 |
off_t ooffset; |
| 702 |
|
| 703 |
LOCK (preadwritelock); |
| 704 |
ooffset = lseek (fd, 0, SEEK_CUR); |
| 705 |
lseek (fd, offset, SEEK_SET); |
| 706 |
res = read (fd, buf, count); |
| 707 |
lseek (fd, ooffset, SEEK_SET); |
| 708 |
UNLOCK (preadwritelock); |
| 709 |
|
| 710 |
return res; |
| 711 |
} |
| 712 |
|
| 713 |
static ssize_t pwrite (int fd, void *buf, size_t count, off_t offset) |
| 714 |
{ |
| 715 |
ssize_t res; |
| 716 |
off_t ooffset; |
| 717 |
|
| 718 |
LOCK (preadwritelock); |
| 719 |
ooffset = lseek (fd, 0, SEEK_CUR); |
| 720 |
lseek (fd, offset, SEEK_SET); |
| 721 |
res = write (fd, buf, count); |
| 722 |
lseek (fd, offset, SEEK_SET); |
| 723 |
UNLOCK (preadwritelock); |
| 724 |
|
| 725 |
return res; |
| 726 |
} |
| 727 |
#endif |
| 728 |
|
| 729 |
#if !HAVE_FDATASYNC |
| 730 |
# define fdatasync fsync |
| 731 |
#endif |
| 732 |
|
| 733 |
#if !HAVE_READAHEAD |
| 734 |
# define readahead(fd,offset,count) aio_readahead (fd, offset, count, self) |
| 735 |
|
| 736 |
static ssize_t aio_readahead (int fd, off_t offset, size_t count, worker *self) |
| 737 |
{ |
| 738 |
dBUF; |
| 739 |
|
| 740 |
while (count > 0) |
| 741 |
{ |
| 742 |
size_t len = count < AIO_BUFSIZE ? count : AIO_BUFSIZE; |
| 743 |
|
| 744 |
pread (fd, aio_buf, len, offset); |
| 745 |
offset += len; |
| 746 |
count -= len; |
| 747 |
} |
| 748 |
|
| 749 |
errno = 0; |
| 750 |
} |
| 751 |
|
| 752 |
#endif |
| 753 |
|
| 754 |
#if !HAVE_READDIR_R |
| 755 |
# define readdir_r aio_readdir_r |
| 756 |
|
| 757 |
static pthread_mutex_t readdirlock = PTHREAD_MUTEX_INITIALIZER; |
| 758 |
|
| 759 |
static int readdir_r (DIR *dirp, struct dirent *ent, struct dirent **res) |
| 760 |
{ |
| 761 |
struct dirent *e; |
| 762 |
int errorno; |
| 763 |
|
| 764 |
LOCK (readdirlock); |
| 765 |
|
| 766 |
e = readdir (dirp); |
| 767 |
errorno = errno; |
| 768 |
|
| 769 |
if (e) |
| 770 |
{ |
| 771 |
*res = ent; |
| 772 |
strcpy (ent->d_name, e->d_name); |
| 773 |
} |
| 774 |
else |
| 775 |
*res = 0; |
| 776 |
|
| 777 |
UNLOCK (readdirlock); |
| 778 |
|
| 779 |
errno = errorno; |
| 780 |
return e ? 0 : -1; |
| 781 |
} |
| 782 |
#endif |
| 783 |
|
| 784 |
/* sendfile always needs emulation */ |
| 785 |
static ssize_t sendfile_ (int ofd, int ifd, off_t offset, size_t count, worker *self) |
| 786 |
{ |
| 787 |
ssize_t res; |
| 788 |
|
| 789 |
if (!count) |
| 790 |
return 0; |
| 791 |
|
| 792 |
#if HAVE_SENDFILE |
| 793 |
# if __linux |
| 794 |
res = sendfile (ofd, ifd, &offset, count); |
| 795 |
|
| 796 |
# elif __freebsd |
| 797 |
/* |
| 798 |
* Of course, the freebsd sendfile is a dire hack with no thoughts |
| 799 |
* wasted on making it similar to other I/O functions. |
| 800 |
*/ |
| 801 |
{ |
| 802 |
off_t sbytes; |
| 803 |
res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
| 804 |
|
| 805 |
if (res < 0 && sbytes) |
| 806 |
/* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ |
| 807 |
res = sbytes; |
| 808 |
} |
| 809 |
|
| 810 |
# elif __hpux |
| 811 |
res = sendfile (ofd, ifd, offset, count, 0, 0); |
| 812 |
|
| 813 |
# elif __solaris |
| 814 |
{ |
| 815 |
struct sendfilevec vec; |
| 816 |
size_t sbytes; |
| 817 |
|
| 818 |
vec.sfv_fd = ifd; |
| 819 |
vec.sfv_flag = 0; |
| 820 |
vec.sfv_off = offset; |
| 821 |
vec.sfv_len = count; |
| 822 |
|
| 823 |
res = sendfilev (ofd, &vec, 1, &sbytes); |
| 824 |
|
| 825 |
if (res < 0 && sbytes) |
| 826 |
res = sbytes; |
| 827 |
} |
| 828 |
|
| 829 |
# endif |
| 830 |
#else |
| 831 |
res = -1; |
| 832 |
errno = ENOSYS; |
| 833 |
#endif |
| 834 |
|
| 835 |
if (res < 0 |
| 836 |
&& (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
| 837 |
#if __solaris |
| 838 |
|| errno == EAFNOSUPPORT || errno == EPROTOTYPE |
| 839 |
#endif |
| 840 |
) |
| 841 |
) |
| 842 |
{ |
| 843 |
/* emulate sendfile. this is a major pain in the ass */ |
| 844 |
dBUF; |
| 845 |
|
| 846 |
res = 0; |
| 847 |
|
| 848 |
while (count) |
| 849 |
{ |
| 850 |
ssize_t cnt; |
| 851 |
|
| 852 |
cnt = pread (ifd, aio_buf, count > AIO_BUFSIZE ? AIO_BUFSIZE : count, offset); |
| 853 |
|
| 854 |
if (cnt <= 0) |
| 855 |
{ |
| 856 |
if (cnt && !res) res = -1; |
| 857 |
break; |
| 858 |
} |
| 859 |
|
| 860 |
cnt = write (ofd, aio_buf, cnt); |
| 861 |
|
| 862 |
if (cnt <= 0) |
| 863 |
{ |
| 864 |
if (cnt && !res) res = -1; |
| 865 |
break; |
| 866 |
} |
| 867 |
|
| 868 |
offset += cnt; |
| 869 |
res += cnt; |
| 870 |
count -= cnt; |
| 871 |
} |
| 872 |
} |
| 873 |
|
| 874 |
return res; |
| 875 |
} |
| 876 |
|
| 877 |
/* read a full directory */ |
| 878 |
static void scandir_ (aio_req req, worker *self) |
| 879 |
{ |
| 880 |
DIR *dirp; |
| 881 |
union |
| 882 |
{ |
| 883 |
struct dirent d; |
| 884 |
char b [offsetof (struct dirent, d_name) + NAME_MAX + 1]; |
| 885 |
} *u; |
| 886 |
struct dirent *entp; |
| 887 |
char *name, *names; |
| 888 |
int memlen = 4096; |
| 889 |
int memofs = 0; |
| 890 |
int res = 0; |
| 891 |
int errorno; |
| 892 |
|
| 893 |
LOCK (wrklock); |
| 894 |
self->dirp = dirp = opendir (req->dataptr); |
| 895 |
self->dbuf = u = malloc (sizeof (*u)); |
| 896 |
req->data2ptr = names = malloc (memlen); |
| 897 |
UNLOCK (wrklock); |
| 898 |
|
| 899 |
if (dirp && u && names) |
| 900 |
for (;;) |
| 901 |
{ |
| 902 |
errno = 0; |
| 903 |
readdir_r (dirp, &u->d, &entp); |
| 904 |
|
| 905 |
if (!entp) |
| 906 |
break; |
| 907 |
|
| 908 |
name = entp->d_name; |
| 909 |
|
| 910 |
if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
| 911 |
{ |
| 912 |
int len = strlen (name) + 1; |
| 913 |
|
| 914 |
res++; |
| 915 |
|
| 916 |
while (memofs + len > memlen) |
| 917 |
{ |
| 918 |
memlen *= 2; |
| 919 |
LOCK (wrklock); |
| 920 |
req->data2ptr = names = realloc (names, memlen); |
| 921 |
UNLOCK (wrklock); |
| 922 |
|
| 923 |
if (!names) |
| 924 |
break; |
| 925 |
} |
| 926 |
|
| 927 |
memcpy (names + memofs, name, len); |
| 928 |
memofs += len; |
| 929 |
} |
| 930 |
} |
| 931 |
|
| 932 |
if (errno) |
| 933 |
res = -1; |
| 934 |
|
| 935 |
req->result = res; |
| 936 |
} |
| 937 |
|
| 938 |
/*****************************************************************************/ |
| 939 |
|
| 940 |
static void *aio_proc (void *thr_arg) |
| 941 |
{ |
| 942 |
aio_req req; |
| 943 |
int type; |
| 944 |
worker *self = (worker *)thr_arg; |
| 945 |
|
| 946 |
do |
| 947 |
{ |
| 948 |
LOCK (reqlock); |
| 949 |
|
| 950 |
for (;;) |
| 951 |
{ |
| 952 |
self->req = req = reqq_shift (&req_queue); |
| 953 |
|
| 954 |
if (req) |
| 955 |
break; |
| 956 |
|
| 957 |
pthread_cond_wait (&reqwait, &reqlock); |
| 958 |
} |
| 959 |
|
| 960 |
--nready; |
| 961 |
|
| 962 |
UNLOCK (reqlock); |
| 963 |
|
| 964 |
errno = 0; /* strictly unnecessary */ |
| 965 |
type = req->type; /* remember type for QUIT check */ |
| 966 |
|
| 967 |
if (!(req->flags & FLAG_CANCELLED)) |
| 968 |
switch (type) |
| 969 |
{ |
| 970 |
case REQ_READ: req->result = pread (req->fd, req->dataptr, req->length, req->offset); break; |
| 971 |
case REQ_WRITE: req->result = pwrite (req->fd, req->dataptr, req->length, req->offset); break; |
| 972 |
|
| 973 |
case REQ_READAHEAD: req->result = readahead (req->fd, req->offset, req->length); break; |
| 974 |
case REQ_SENDFILE: req->result = sendfile_ (req->fd, req->fd2, req->offset, req->length, self); break; |
| 975 |
|
| 976 |
case REQ_STAT: req->result = stat (req->dataptr, req->statdata); break; |
| 977 |
case REQ_LSTAT: req->result = lstat (req->dataptr, req->statdata); break; |
| 978 |
case REQ_FSTAT: req->result = fstat (req->fd , req->statdata); break; |
| 979 |
|
| 980 |
case REQ_OPEN: req->result = open (req->dataptr, req->fd, req->mode); break; |
| 981 |
case REQ_CLOSE: req->result = close (req->fd); break; |
| 982 |
case REQ_UNLINK: req->result = unlink (req->dataptr); break; |
| 983 |
case REQ_RMDIR: req->result = rmdir (req->dataptr); break; |
| 984 |
case REQ_RENAME: req->result = rename (req->data2ptr, req->dataptr); break; |
| 985 |
case REQ_LINK: req->result = link (req->data2ptr, req->dataptr); break; |
| 986 |
case REQ_SYMLINK: req->result = symlink (req->data2ptr, req->dataptr); break; |
| 987 |
|
| 988 |
case REQ_FDATASYNC: req->result = fdatasync (req->fd); break; |
| 989 |
case REQ_FSYNC: req->result = fsync (req->fd); break; |
| 990 |
case REQ_READDIR: scandir_ (req, self); break; |
| 991 |
|
| 992 |
case REQ_BUSY: |
| 993 |
{ |
| 994 |
struct timeval tv; |
| 995 |
|
| 996 |
tv.tv_sec = req->fd; |
| 997 |
tv.tv_usec = req->fd2; |
| 998 |
|
| 999 |
req->result = select (0, 0, 0, 0, &tv); |
| 1000 |
} |
| 1001 |
|
| 1002 |
case REQ_GROUP: |
| 1003 |
case REQ_NOP: |
| 1004 |
case REQ_QUIT: |
| 1005 |
break; |
| 1006 |
|
| 1007 |
default: |
| 1008 |
req->result = ENOSYS; |
| 1009 |
break; |
| 1010 |
} |
| 1011 |
|
| 1012 |
req->errorno = errno; |
| 1013 |
|
| 1014 |
LOCK (reslock); |
| 1015 |
|
| 1016 |
++npending; |
| 1017 |
|
| 1018 |
if (!reqq_push (&res_queue, req)) |
| 1019 |
/* write a dummy byte to the pipe so fh becomes ready */ |
| 1020 |
write (respipe [1], &respipe, 1); |
| 1021 |
|
| 1022 |
self->req = 0; |
| 1023 |
worker_clear (self); |
| 1024 |
|
| 1025 |
UNLOCK (reslock); |
| 1026 |
} |
| 1027 |
while (type != REQ_QUIT); |
| 1028 |
|
| 1029 |
LOCK (wrklock); |
| 1030 |
worker_free (self); |
| 1031 |
UNLOCK (wrklock); |
| 1032 |
|
| 1033 |
return 0; |
| 1034 |
} |
| 1035 |
|
| 1036 |
/*****************************************************************************/ |
| 1037 |
|
| 1038 |
static void atfork_prepare (void) |
| 1039 |
{ |
| 1040 |
LOCK (wrklock); |
| 1041 |
LOCK (reqlock); |
| 1042 |
LOCK (reslock); |
| 1043 |
#if !HAVE_PREADWRITE |
| 1044 |
LOCK (preadwritelock); |
| 1045 |
#endif |
| 1046 |
#if !HAVE_READDIR_R |
| 1047 |
LOCK (readdirlock); |
| 1048 |
#endif |
| 1049 |
} |
| 1050 |
|
| 1051 |
static void atfork_parent (void) |
| 1052 |
{ |
| 1053 |
#if !HAVE_READDIR_R |
| 1054 |
UNLOCK (readdirlock); |
| 1055 |
#endif |
| 1056 |
#if !HAVE_PREADWRITE |
| 1057 |
UNLOCK (preadwritelock); |
| 1058 |
#endif |
| 1059 |
UNLOCK (reslock); |
| 1060 |
UNLOCK (reqlock); |
| 1061 |
UNLOCK (wrklock); |
| 1062 |
} |
| 1063 |
|
| 1064 |
static void atfork_child (void) |
| 1065 |
{ |
| 1066 |
aio_req prv; |
| 1067 |
|
| 1068 |
while (prv = reqq_shift (&req_queue)) |
| 1069 |
req_free (prv); |
| 1070 |
|
| 1071 |
while (prv = reqq_shift (&res_queue)) |
| 1072 |
req_free (prv); |
| 1073 |
|
| 1074 |
while (wrk_first.next != &wrk_first) |
| 1075 |
{ |
| 1076 |
worker *wrk = wrk_first.next; |
| 1077 |
|
| 1078 |
if (wrk->req) |
| 1079 |
req_free (wrk->req); |
| 1080 |
|
| 1081 |
worker_clear (wrk); |
| 1082 |
worker_free (wrk); |
| 1083 |
} |
| 1084 |
|
| 1085 |
started = 0; |
| 1086 |
nreqs = 0; |
| 1087 |
|
| 1088 |
close (respipe [0]); |
| 1089 |
close (respipe [1]); |
| 1090 |
create_pipe (); |
| 1091 |
|
| 1092 |
atfork_parent (); |
| 1093 |
} |
| 1094 |
|
| 1095 |
#define dREQ \ |
| 1096 |
aio_req req; \ |
| 1097 |
int req_pri = next_pri; \ |
| 1098 |
next_pri = DEFAULT_PRI + PRI_BIAS; \ |
| 1099 |
\ |
| 1100 |
if (SvOK (callback) && !SvROK (callback)) \ |
| 1101 |
croak ("callback must be undef or of reference type"); \ |
| 1102 |
\ |
| 1103 |
Newz (0, req, 1, aio_cb); \ |
| 1104 |
if (!req) \ |
| 1105 |
croak ("out of memory during aio_req allocation"); \ |
| 1106 |
\ |
| 1107 |
req->callback = newSVsv (callback); \ |
| 1108 |
req->pri = req_pri |
| 1109 |
|
| 1110 |
#define REQ_SEND \ |
| 1111 |
req_send (req); \ |
| 1112 |
\ |
| 1113 |
if (GIMME_V != G_VOID) \ |
| 1114 |
XPUSHs (req_sv (req, AIO_REQ_KLASS)); |
| 1115 |
|
| 1116 |
MODULE = IO::AIO PACKAGE = IO::AIO |
| 1117 |
|
| 1118 |
PROTOTYPES: ENABLE |
| 1119 |
|
| 1120 |
BOOT: |
| 1121 |
{ |
| 1122 |
HV *stash = gv_stashpv ("IO::AIO", 1); |
| 1123 |
newCONSTSUB (stash, "EXDEV", newSViv (EXDEV)); |
| 1124 |
newCONSTSUB (stash, "O_RDONLY", newSViv (O_RDONLY)); |
| 1125 |
newCONSTSUB (stash, "O_WRONLY", newSViv (O_WRONLY)); |
| 1126 |
|
| 1127 |
create_pipe (); |
| 1128 |
pthread_atfork (atfork_prepare, atfork_parent, atfork_child); |
| 1129 |
} |
| 1130 |
|
| 1131 |
void |
| 1132 |
min_parallel (int nthreads) |
| 1133 |
PROTOTYPE: $ |
| 1134 |
|
| 1135 |
void |
| 1136 |
max_parallel (int nthreads) |
| 1137 |
PROTOTYPE: $ |
| 1138 |
|
| 1139 |
int |
| 1140 |
max_outstanding (int maxreqs) |
| 1141 |
PROTOTYPE: $ |
| 1142 |
CODE: |
| 1143 |
RETVAL = max_outstanding; |
| 1144 |
max_outstanding = maxreqs; |
| 1145 |
OUTPUT: |
| 1146 |
RETVAL |
| 1147 |
|
| 1148 |
void |
| 1149 |
aio_open (pathname,flags,mode,callback=&PL_sv_undef) |
| 1150 |
SV * pathname |
| 1151 |
int flags |
| 1152 |
int mode |
| 1153 |
SV * callback |
| 1154 |
PROTOTYPE: $$$;$ |
| 1155 |
PPCODE: |
| 1156 |
{ |
| 1157 |
dREQ; |
| 1158 |
|
| 1159 |
req->type = REQ_OPEN; |
| 1160 |
req->data = newSVsv (pathname); |
| 1161 |
req->dataptr = SvPVbyte_nolen (req->data); |
| 1162 |
req->fd = flags; |
| 1163 |
req->mode = mode; |
| 1164 |
|
| 1165 |
REQ_SEND; |
| 1166 |
} |
| 1167 |
|
| 1168 |
void |
| 1169 |
aio_close (fh,callback=&PL_sv_undef) |
| 1170 |
SV * fh |
| 1171 |
SV * callback |
| 1172 |
PROTOTYPE: $;$ |
| 1173 |
ALIAS: |
| 1174 |
aio_close = REQ_CLOSE |
| 1175 |
aio_fsync = REQ_FSYNC |
| 1176 |
aio_fdatasync = REQ_FDATASYNC |
| 1177 |
PPCODE: |
| 1178 |
{ |
| 1179 |
dREQ; |
| 1180 |
|
| 1181 |
req->type = ix; |
| 1182 |
req->fh = newSVsv (fh); |
| 1183 |
req->fd = PerlIO_fileno (IoIFP (sv_2io (fh))); |
| 1184 |
|
| 1185 |
REQ_SEND (req); |
| 1186 |
} |
| 1187 |
|
| 1188 |
void |
| 1189 |
aio_read (fh,offset,length,data,dataoffset,callback=&PL_sv_undef) |
| 1190 |
SV * fh |
| 1191 |
UV offset |
| 1192 |
UV length |
| 1193 |
SV * data |
| 1194 |
UV dataoffset |
| 1195 |
SV * callback |
| 1196 |
ALIAS: |
| 1197 |
aio_read = REQ_READ |
| 1198 |
aio_write = REQ_WRITE |
| 1199 |
PROTOTYPE: $$$$$;$ |
| 1200 |
PPCODE: |
| 1201 |
{ |
| 1202 |
aio_req req; |
| 1203 |
STRLEN svlen; |
| 1204 |
char *svptr = SvPVbyte (data, svlen); |
| 1205 |
|
| 1206 |
SvUPGRADE (data, SVt_PV); |
| 1207 |
SvPOK_on (data); |
| 1208 |
|
| 1209 |
if (dataoffset < 0) |
| 1210 |
dataoffset += svlen; |
| 1211 |
|
| 1212 |
if (dataoffset < 0 || dataoffset > svlen) |
| 1213 |
croak ("data offset outside of string"); |
| 1214 |
|
| 1215 |
if (ix == REQ_WRITE) |
| 1216 |
{ |
| 1217 |
/* write: check length and adjust. */ |
| 1218 |
if (length < 0 || length + dataoffset > svlen) |
| 1219 |
length = svlen - dataoffset; |
| 1220 |
} |
| 1221 |
else |
| 1222 |
{ |
| 1223 |
/* read: grow scalar as necessary */ |
| 1224 |
svptr = SvGROW (data, length + dataoffset); |
| 1225 |
} |
| 1226 |
|
| 1227 |
if (length < 0) |
| 1228 |
croak ("length must not be negative"); |
| 1229 |
|
| 1230 |
{ |
| 1231 |
dREQ; |
| 1232 |
|
| 1233 |
req->type = ix; |
| 1234 |
req->fh = newSVsv (fh); |
| 1235 |
req->fd = PerlIO_fileno (ix == REQ_READ ? IoIFP (sv_2io (fh)) |
| 1236 |
: IoOFP (sv_2io (fh))); |
| 1237 |
req->offset = offset; |
| 1238 |
req->length = length; |
| 1239 |
req->data = SvREFCNT_inc (data); |
| 1240 |
req->dataptr = (char *)svptr + dataoffset; |
| 1241 |
|
| 1242 |
if (!SvREADONLY (data)) |
| 1243 |
{ |
| 1244 |
SvREADONLY_on (data); |
| 1245 |
req->data2ptr = (void *)data; |
| 1246 |
} |
| 1247 |
|
| 1248 |
REQ_SEND; |
| 1249 |
} |
| 1250 |
} |
| 1251 |
|
| 1252 |
void |
| 1253 |
aio_sendfile (out_fh,in_fh,in_offset,length,callback=&PL_sv_undef) |
| 1254 |
SV * out_fh |
| 1255 |
SV * in_fh |
| 1256 |
UV in_offset |
| 1257 |
UV length |
| 1258 |
SV * callback |
| 1259 |
PROTOTYPE: $$$$;$ |
| 1260 |
PPCODE: |
| 1261 |
{ |
| 1262 |
dREQ; |
| 1263 |
|
| 1264 |
req->type = REQ_SENDFILE; |
| 1265 |
req->fh = newSVsv (out_fh); |
| 1266 |
req->fd = PerlIO_fileno (IoIFP (sv_2io (out_fh))); |
| 1267 |
req->fh2 = newSVsv (in_fh); |
| 1268 |
req->fd2 = PerlIO_fileno (IoIFP (sv_2io (in_fh))); |
| 1269 |
req->offset = in_offset; |
| 1270 |
req->length = length; |
| 1271 |
|
| 1272 |
REQ_SEND; |
| 1273 |
} |
| 1274 |
|
| 1275 |
void |
| 1276 |
aio_readahead (fh,offset,length,callback=&PL_sv_undef) |
| 1277 |
SV * fh |
| 1278 |
UV offset |
| 1279 |
IV length |
| 1280 |
SV * callback |
| 1281 |
PROTOTYPE: $$$;$ |
| 1282 |
PPCODE: |
| 1283 |
{ |
| 1284 |
dREQ; |
| 1285 |
|
| 1286 |
req->type = REQ_READAHEAD; |
| 1287 |
req->fh = newSVsv (fh); |
| 1288 |
req->fd = PerlIO_fileno (IoIFP (sv_2io (fh))); |
| 1289 |
req->offset = offset; |
| 1290 |
req->length = length; |
| 1291 |
|
| 1292 |
REQ_SEND; |
| 1293 |
} |
| 1294 |
|
| 1295 |
void |
| 1296 |
aio_stat (fh_or_path,callback=&PL_sv_undef) |
| 1297 |
SV * fh_or_path |
| 1298 |
SV * callback |
| 1299 |
ALIAS: |
| 1300 |
aio_stat = REQ_STAT |
| 1301 |
aio_lstat = REQ_LSTAT |
| 1302 |
PPCODE: |
| 1303 |
{ |
| 1304 |
dREQ; |
| 1305 |
|
| 1306 |
New (0, req->statdata, 1, Stat_t); |
| 1307 |
if (!req->statdata) |
| 1308 |
{ |
| 1309 |
req_free (req); |
| 1310 |
croak ("out of memory during aio_req->statdata allocation"); |
| 1311 |
} |
| 1312 |
|
| 1313 |
if (SvPOK (fh_or_path)) |
| 1314 |
{ |
| 1315 |
req->type = ix; |
| 1316 |
req->data = newSVsv (fh_or_path); |
| 1317 |
req->dataptr = SvPVbyte_nolen (req->data); |
| 1318 |
} |
| 1319 |
else |
| 1320 |
{ |
| 1321 |
req->type = REQ_FSTAT; |
| 1322 |
req->fh = newSVsv (fh_or_path); |
| 1323 |
req->fd = PerlIO_fileno (IoIFP (sv_2io (fh_or_path))); |
| 1324 |
} |
| 1325 |
|
| 1326 |
REQ_SEND; |
| 1327 |
} |
| 1328 |
|
| 1329 |
void |
| 1330 |
aio_unlink (pathname,callback=&PL_sv_undef) |
| 1331 |
SV * pathname |
| 1332 |
SV * callback |
| 1333 |
ALIAS: |
| 1334 |
aio_unlink = REQ_UNLINK |
| 1335 |
aio_rmdir = REQ_RMDIR |
| 1336 |
aio_readdir = REQ_READDIR |
| 1337 |
PPCODE: |
| 1338 |
{ |
| 1339 |
dREQ; |
| 1340 |
|
| 1341 |
req->type = ix; |
| 1342 |
req->data = newSVsv (pathname); |
| 1343 |
req->dataptr = SvPVbyte_nolen (req->data); |
| 1344 |
|
| 1345 |
REQ_SEND; |
| 1346 |
} |
| 1347 |
|
| 1348 |
void |
| 1349 |
aio_link (oldpath,newpath,callback=&PL_sv_undef) |
| 1350 |
SV * oldpath |
| 1351 |
SV * newpath |
| 1352 |
SV * callback |
| 1353 |
ALIAS: |
| 1354 |
aio_link = REQ_LINK |
| 1355 |
aio_symlink = REQ_SYMLINK |
| 1356 |
aio_rename = REQ_RENAME |
| 1357 |
PPCODE: |
| 1358 |
{ |
| 1359 |
dREQ; |
| 1360 |
|
| 1361 |
req->type = ix; |
| 1362 |
req->fh = newSVsv (oldpath); |
| 1363 |
req->data2ptr = SvPVbyte_nolen (req->fh); |
| 1364 |
req->data = newSVsv (newpath); |
| 1365 |
req->dataptr = SvPVbyte_nolen (req->data); |
| 1366 |
|
| 1367 |
REQ_SEND; |
| 1368 |
} |
| 1369 |
|
| 1370 |
void |
| 1371 |
aio_busy (delay,callback=&PL_sv_undef) |
| 1372 |
double delay |
| 1373 |
SV * callback |
| 1374 |
PPCODE: |
| 1375 |
{ |
| 1376 |
dREQ; |
| 1377 |
|
| 1378 |
req->type = REQ_BUSY; |
| 1379 |
req->fd = delay < 0. ? 0 : delay; |
| 1380 |
req->fd2 = delay < 0. ? 0 : 1000. * (delay - req->fd); |
| 1381 |
|
| 1382 |
REQ_SEND; |
| 1383 |
} |
| 1384 |
|
| 1385 |
void |
| 1386 |
aio_group (callback=&PL_sv_undef) |
| 1387 |
SV * callback |
| 1388 |
PROTOTYPE: ;$ |
| 1389 |
PPCODE: |
| 1390 |
{ |
| 1391 |
dREQ; |
| 1392 |
|
| 1393 |
req->type = REQ_GROUP; |
| 1394 |
req_send (req); |
| 1395 |
|
| 1396 |
XPUSHs (req_sv (req, AIO_GRP_KLASS)); |
| 1397 |
} |
| 1398 |
|
| 1399 |
void |
| 1400 |
aio_nop (callback=&PL_sv_undef) |
| 1401 |
SV * callback |
| 1402 |
PPCODE: |
| 1403 |
{ |
| 1404 |
dREQ; |
| 1405 |
|
| 1406 |
req->type = REQ_NOP; |
| 1407 |
|
| 1408 |
REQ_SEND; |
| 1409 |
} |
| 1410 |
|
| 1411 |
int |
| 1412 |
aioreq_pri (int pri = 0) |
| 1413 |
PROTOTYPE: ;$ |
| 1414 |
CODE: |
| 1415 |
RETVAL = next_pri - PRI_BIAS; |
| 1416 |
if (items > 0) |
| 1417 |
{ |
| 1418 |
if (pri < PRI_MIN) pri = PRI_MIN; |
| 1419 |
if (pri > PRI_MAX) pri = PRI_MAX; |
| 1420 |
next_pri = pri + PRI_BIAS; |
| 1421 |
} |
| 1422 |
OUTPUT: |
| 1423 |
RETVAL |
| 1424 |
|
| 1425 |
void |
| 1426 |
aioreq_nice (int nice = 0) |
| 1427 |
CODE: |
| 1428 |
nice = next_pri - nice; |
| 1429 |
if (nice < PRI_MIN) nice = PRI_MIN; |
| 1430 |
if (nice > PRI_MAX) nice = PRI_MAX; |
| 1431 |
next_pri = nice + PRI_BIAS; |
| 1432 |
|
| 1433 |
void |
| 1434 |
flush () |
| 1435 |
PROTOTYPE: |
| 1436 |
CODE: |
| 1437 |
while (nreqs) |
| 1438 |
{ |
| 1439 |
poll_wait (); |
| 1440 |
poll_cb (0); |
| 1441 |
} |
| 1442 |
|
| 1443 |
void |
| 1444 |
poll() |
| 1445 |
PROTOTYPE: |
| 1446 |
CODE: |
| 1447 |
if (nreqs) |
| 1448 |
{ |
| 1449 |
poll_wait (); |
| 1450 |
poll_cb (0); |
| 1451 |
} |
| 1452 |
|
| 1453 |
int |
| 1454 |
poll_fileno() |
| 1455 |
PROTOTYPE: |
| 1456 |
CODE: |
| 1457 |
RETVAL = respipe [0]; |
| 1458 |
OUTPUT: |
| 1459 |
RETVAL |
| 1460 |
|
| 1461 |
int |
| 1462 |
poll_cb(...) |
| 1463 |
PROTOTYPE: |
| 1464 |
CODE: |
| 1465 |
RETVAL = poll_cb (0); |
| 1466 |
OUTPUT: |
| 1467 |
RETVAL |
| 1468 |
|
| 1469 |
int |
| 1470 |
poll_some(int max = 0) |
| 1471 |
PROTOTYPE: $ |
| 1472 |
CODE: |
| 1473 |
RETVAL = poll_cb (max); |
| 1474 |
OUTPUT: |
| 1475 |
RETVAL |
| 1476 |
|
| 1477 |
void |
| 1478 |
poll_wait() |
| 1479 |
PROTOTYPE: |
| 1480 |
CODE: |
| 1481 |
if (nreqs) |
| 1482 |
poll_wait (); |
| 1483 |
|
| 1484 |
int |
| 1485 |
nreqs() |
| 1486 |
PROTOTYPE: |
| 1487 |
CODE: |
| 1488 |
RETVAL = nreqs; |
| 1489 |
OUTPUT: |
| 1490 |
RETVAL |
| 1491 |
|
| 1492 |
int |
| 1493 |
nready() |
| 1494 |
PROTOTYPE: |
| 1495 |
CODE: |
| 1496 |
if (WORDREAD_UNSAFE) LOCK (reqlock); |
| 1497 |
RETVAL = nready; |
| 1498 |
if (WORDREAD_UNSAFE) UNLOCK (reqlock); |
| 1499 |
OUTPUT: |
| 1500 |
RETVAL |
| 1501 |
|
| 1502 |
int |
| 1503 |
npending() |
| 1504 |
PROTOTYPE: |
| 1505 |
CODE: |
| 1506 |
if (WORDREAD_UNSAFE) LOCK (reslock); |
| 1507 |
RETVAL = npending; |
| 1508 |
if (WORDREAD_UNSAFE) UNLOCK (reslock); |
| 1509 |
OUTPUT: |
| 1510 |
RETVAL |
| 1511 |
|
| 1512 |
PROTOTYPES: DISABLE |
| 1513 |
|
| 1514 |
MODULE = IO::AIO PACKAGE = IO::AIO::REQ |
| 1515 |
|
| 1516 |
void |
| 1517 |
cancel (aio_req_ornot req) |
| 1518 |
CODE: |
| 1519 |
req_cancel (req); |
| 1520 |
|
| 1521 |
void |
| 1522 |
cb (aio_req_ornot req, SV *callback=&PL_sv_undef) |
| 1523 |
CODE: |
| 1524 |
SvREFCNT_dec (req->callback); |
| 1525 |
req->callback = newSVsv (callback); |
| 1526 |
|
| 1527 |
MODULE = IO::AIO PACKAGE = IO::AIO::GRP |
| 1528 |
|
| 1529 |
void |
| 1530 |
add (aio_req grp, ...) |
| 1531 |
PPCODE: |
| 1532 |
{ |
| 1533 |
int i; |
| 1534 |
aio_req req; |
| 1535 |
|
| 1536 |
if (grp->fd == 2) |
| 1537 |
croak ("cannot add requests to IO::AIO::GRP after the group finished"); |
| 1538 |
|
| 1539 |
for (i = 1; i < items; ++i ) |
| 1540 |
{ |
| 1541 |
if (GIMME_V != G_VOID) |
| 1542 |
XPUSHs (sv_2mortal (newSVsv (ST (i)))); |
| 1543 |
|
| 1544 |
req = SvAIO_REQ (ST (i)); |
| 1545 |
|
| 1546 |
if (req) |
| 1547 |
{ |
| 1548 |
++grp->length; |
| 1549 |
req->grp = grp; |
| 1550 |
|
| 1551 |
req->grp_prev = 0; |
| 1552 |
req->grp_next = grp->grp_first; |
| 1553 |
|
| 1554 |
if (grp->grp_first) |
| 1555 |
grp->grp_first->grp_prev = req; |
| 1556 |
|
| 1557 |
grp->grp_first = req; |
| 1558 |
} |
| 1559 |
} |
| 1560 |
} |
| 1561 |
|
| 1562 |
void |
| 1563 |
cancel_subs (aio_req_ornot req) |
| 1564 |
CODE: |
| 1565 |
req_cancel_subs (req); |
| 1566 |
|
| 1567 |
void |
| 1568 |
result (aio_req grp, ...) |
| 1569 |
CODE: |
| 1570 |
{ |
| 1571 |
int i; |
| 1572 |
AV *av; |
| 1573 |
|
| 1574 |
grp->errorno = errno; |
| 1575 |
|
| 1576 |
av = newAV (); |
| 1577 |
|
| 1578 |
for (i = 1; i < items; ++i ) |
| 1579 |
av_push (av, newSVsv (ST (i))); |
| 1580 |
|
| 1581 |
SvREFCNT_dec (grp->data); |
| 1582 |
grp->data = (SV *)av; |
| 1583 |
} |
| 1584 |
|
| 1585 |
void |
| 1586 |
errno (aio_req grp, int errorno = errno) |
| 1587 |
CODE: |
| 1588 |
grp->errorno = errorno; |
| 1589 |
|
| 1590 |
void |
| 1591 |
limit (aio_req grp, int limit) |
| 1592 |
CODE: |
| 1593 |
grp->fd2 = limit; |
| 1594 |
aio_grp_feed (grp); |
| 1595 |
|
| 1596 |
void |
| 1597 |
feed (aio_req grp, SV *callback=&PL_sv_undef) |
| 1598 |
CODE: |
| 1599 |
{ |
| 1600 |
SvREFCNT_dec (grp->fh2); |
| 1601 |
grp->fh2 = newSVsv (callback); |
| 1602 |
|
| 1603 |
if (grp->fd2 <= 0) |
| 1604 |
grp->fd2 = 2; |
| 1605 |
|
| 1606 |
aio_grp_feed (grp); |
| 1607 |
} |
| 1608 |
|
