ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/cvsroot/libeio/eio.c
(Generate patch)

Comparing cvsroot/libeio/eio.c (file contents):
Revision 1.38 by root, Fri Jun 12 20:01:42 2009 UTC vs.
Revision 1.81 by root, Tue Jul 5 20:34:42 2011 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines