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

Comparing libeio/eio.c (file contents):
Revision 1.9 by root, Mon May 12 00:31:43 2008 UTC vs.
Revision 1.56 by root, Sun Sep 12 03:36:28 2010 UTC

1/*
2 * libeio implementation
3 *
4 * Copyright (c) 2007,2008,2009,2010 Marc Alexander Lehmann <libeio@schmorp.de>
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without modifica-
8 * tion, are permitted provided that the following conditions are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
12 *
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
23 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
24 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
25 * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
26 * OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
28 * Alternatively, the contents of this file may be used under the terms of
29 * the GNU General Public License ("GPL") version 2 or any later version,
30 * in which case the provisions of the GPL are applicable instead of
31 * the above. If you wish to allow the use of your version of this file
32 * only under the terms of the GPL and not to allow others to use your
33 * version of this file under the BSD license, indicate your decision
34 * by deleting the provisions above and replace them with the notice
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
37 * either the BSD or the GPL.
38 */
39
1#include "eio.h" 40#include "eio.h"
41
42#ifdef EIO_STACKSIZE
43# define XTHREAD_STACKSIZE EIO_STACKSIZE
44#endif
2#include "xthread.h" 45#include "xthread.h"
3 46
4#include <errno.h> 47#include <errno.h>
5#include <stddef.h> 48#include <stddef.h>
6#include <stdlib.h> 49#include <stdlib.h>
7#include <string.h> 50#include <string.h>
8#include <errno.h> 51#include <errno.h>
9#include <sys/types.h> 52#include <sys/types.h>
10#include <sys/stat.h> 53#include <sys/stat.h>
54#include <sys/statvfs.h>
11#include <limits.h> 55#include <limits.h>
12#include <fcntl.h> 56#include <fcntl.h>
13#include <assert.h> 57#include <assert.h>
14 58
15#ifndef EIO_FINISH 59#ifndef EIO_FINISH
25#endif 69#endif
26 70
27#ifdef _WIN32 71#ifdef _WIN32
28 72
29 /*doh*/ 73 /*doh*/
30
31#else 74#else
32 75
33# include "config.h" 76# include "config.h"
34# include <sys/time.h> 77# include <sys/time.h>
35# include <sys/select.h> 78# include <sys/select.h>
36# include <unistd.h> 79# include <unistd.h>
37# include <utime.h> 80# include <utime.h>
38# include <signal.h> 81# include <signal.h>
39# include <dirent.h> 82# include <dirent.h>
40 83
84#if _POSIX_MEMLOCK || _POSIX_MAPPED_FILES
85# include <sys/mman.h>
86#endif
87
88/* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */
89# if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__
90# define _DIRENT_HAVE_D_TYPE /* sigh */
91# define D_INO(de) (de)->d_fileno
92# define D_NAMLEN(de) (de)->d_namlen
93# elif __linux || defined d_ino || _XOPEN_SOURCE >= 600
94# define D_INO(de) (de)->d_ino
95# endif
96
97#ifdef _D_EXACT_NAMLEN
98# undef D_NAMLEN
99# define D_NAMLEN(de) _D_EXACT_NAMLEN (de)
100#endif
101
102# ifdef _DIRENT_HAVE_D_TYPE
103# define D_TYPE(de) (de)->d_type
104# endif
105
41# ifndef EIO_STRUCT_DIRENT 106# ifndef EIO_STRUCT_DIRENT
42# define EIO_STRUCT_DIRENT struct dirent 107# define EIO_STRUCT_DIRENT struct dirent
43# endif 108# endif
44 109
45#endif 110#endif
46 111
47#if HAVE_SENDFILE 112#if HAVE_SENDFILE
48# if __linux 113# if __linux
49# include <sys/sendfile.h> 114# include <sys/sendfile.h>
50# elif __freebsd 115# elif __FreeBSD__ || defined __APPLE__
51# include <sys/socket.h> 116# include <sys/socket.h>
52# include <sys/uio.h> 117# include <sys/uio.h>
53# elif __hpux 118# elif __hpux
54# include <sys/socket.h> 119# include <sys/socket.h>
55# elif __solaris /* not yet */ 120# elif __solaris
56# include <sys/sendfile.h> 121# include <sys/sendfile.h>
57# else 122# else
58# error sendfile support requested but not available 123# error sendfile support requested but not available
59# endif 124# endif
60#endif 125#endif
61 126
127#ifndef D_TYPE
128# define D_TYPE(de) 0
129#endif
130#ifndef D_INO
131# define D_INO(de) 0
132#endif
133#ifndef D_NAMLEN
134# define D_NAMLEN(de) strlen ((de)->d_name)
135#endif
136
62/* number of seconds after which an idle threads exit */ 137/* number of seconds after which an idle threads exit */
63#define IDLE_TIMEOUT 10 138#define IDLE_TIMEOUT 10
64 139
65/* used for struct dirent, AIX doesn't provide it */ 140/* used for struct dirent, AIX doesn't provide it */
66#ifndef NAME_MAX 141#ifndef NAME_MAX
67# define NAME_MAX 4096 142# define NAME_MAX 4096
68#endif 143#endif
69 144
145/* used for readlink etc. */
146#ifndef PATH_MAX
147# define PATH_MAX 4096
148#endif
149
70/* buffer size for various temporary buffers */ 150/* buffer size for various temporary buffers */
71#define EIO_BUFSIZE 65536 151#define EIO_BUFSIZE 65536
72 152
73#define dBUF \ 153#define dBUF \
74 char *eio_buf; \ 154 char *eio_buf; \
75 X_LOCK (wrklock); \ 155 ETP_WORKER_LOCK (self); \
76 self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \ 156 self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \
77 X_UNLOCK (wrklock); \ 157 ETP_WORKER_UNLOCK (self); \
78 errno = ENOMEM; \ 158 errno = ENOMEM; \
79 if (!eio_buf) \ 159 if (!eio_buf) \
80 return -1; 160 return -1;
81 161
82#define EIO_TICKS ((1000000 + 1023) >> 10) 162#define EIO_TICKS ((1000000 + 1023) >> 10)
83 163
164/*****************************************************************************/
165
166#if __GNUC__ >= 3
167# define expect(expr,value) __builtin_expect ((expr),(value))
168#else
169# define expect(expr,value) (expr)
170#endif
171
172#define expect_false(expr) expect ((expr) != 0, 0)
173#define expect_true(expr) expect ((expr) != 0, 1)
174
175/*****************************************************************************/
176
177#define ETP_PRI_MIN EIO_PRI_MIN
178#define ETP_PRI_MAX EIO_PRI_MAX
179
180struct etp_worker;
181
182#define ETP_REQ eio_req
183#define ETP_DESTROY(req) eio_destroy (req)
184static int eio_finish (eio_req *req);
185#define ETP_FINISH(req) eio_finish (req)
186static void eio_execute (struct etp_worker *self, eio_req *req);
187#define ETP_EXECUTE(wrk,req) eio_execute (wrk,req)
188
189#define ETP_WORKER_CLEAR(req) \
190 if (wrk->dbuf) \
191 { \
192 free (wrk->dbuf); \
193 wrk->dbuf = 0; \
194 } \
195 \
196 if (wrk->dirp) \
197 { \
198 closedir (wrk->dirp); \
199 wrk->dirp = 0; \
200 }
201
202#define ETP_WORKER_COMMON \
203 void *dbuf; \
204 DIR *dirp;
205
206/*****************************************************************************/
207
208#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
209
210/* calculate time difference in ~1/EIO_TICKS of a second */
211static int tvdiff (struct timeval *tv1, struct timeval *tv2)
212{
213 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
214 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
215}
216
217static unsigned int started, idle, wanted = 4;
218
84static void (*want_poll_cb) (void); 219static void (*want_poll_cb) (void);
85static void (*done_poll_cb) (void); 220static void (*done_poll_cb) (void);
86 221
87static unsigned int max_poll_time = 0; 222static unsigned int max_poll_time; /* reslock */
88static unsigned int max_poll_reqs = 0; 223static unsigned int max_poll_reqs; /* reslock */
89 224
90/* calculcate time difference in ~1/EIO_TICKS of a second */ 225static volatile unsigned int nreqs; /* reqlock */
91static int tvdiff (struct timeval *tv1, struct timeval *tv2) 226static volatile unsigned int nready; /* reqlock */
92{ 227static volatile unsigned int npending; /* reqlock */
93 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS 228static volatile unsigned int max_idle = 4;
94 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
95}
96 229
97static unsigned int started, idle, wanted = 4; 230static xmutex_t wrklock = X_MUTEX_INIT;
231static xmutex_t reslock = X_MUTEX_INIT;
232static xmutex_t reqlock = X_MUTEX_INIT;
233static xcond_t reqwait = X_COND_INIT;
234
235#if !HAVE_PREADWRITE
236/*
237 * make our pread/pwrite emulation safe against themselves, but not against
238 * normal read/write by using a mutex. slows down execution a lot,
239 * but that's your problem, not mine.
240 */
241static xmutex_t preadwritelock = X_MUTEX_INIT;
242#endif
243
244typedef struct etp_worker
245{
246 /* locked by wrklock */
247 struct etp_worker *prev, *next;
248
249 xthread_t tid;
250
251 /* locked by reslock, reqlock or wrklock */
252 ETP_REQ *req; /* currently processed request */
253
254 ETP_WORKER_COMMON
255} etp_worker;
256
257static etp_worker wrk_first = { &wrk_first, &wrk_first, 0 }; /* NOT etp */
258
259#define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock)
260#define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock)
98 261
99/* worker threads management */ 262/* worker threads management */
100static mutex_t wrklock = X_MUTEX_INIT;
101 263
102typedef struct worker
103{
104 /* locked by wrklock */
105 struct worker *prev, *next;
106
107 thread_t tid;
108
109 /* locked by reslock, reqlock or wrklock */
110 eio_req *req; /* currently processed request */
111 void *dbuf;
112 DIR *dirp;
113} worker;
114
115static worker wrk_first = { &wrk_first, &wrk_first, 0 };
116
117static void worker_clear (worker *wrk) 264static void etp_worker_clear (etp_worker *wrk)
118{ 265{
119 if (wrk->dirp) 266 ETP_WORKER_CLEAR (wrk);
120 {
121 closedir (wrk->dirp);
122 wrk->dirp = 0;
123 }
124
125 if (wrk->dbuf)
126 {
127 free (wrk->dbuf);
128 wrk->dbuf = 0;
129 }
130} 267}
131 268
132static void worker_free (worker *wrk) 269static void etp_worker_free (etp_worker *wrk)
133{ 270{
134 wrk->next->prev = wrk->prev; 271 wrk->next->prev = wrk->prev;
135 wrk->prev->next = wrk->next; 272 wrk->prev->next = wrk->next;
136 273
137 free (wrk); 274 free (wrk);
138} 275}
139 276
140static volatile unsigned int nreqs, nready, npending;
141static volatile unsigned int max_idle = 4;
142
143static mutex_t reslock = X_MUTEX_INIT;
144static mutex_t reqlock = X_MUTEX_INIT;
145static cond_t reqwait = X_COND_INIT;
146
147unsigned int eio_nreqs (void) 277static unsigned int etp_nreqs (void)
148{ 278{
279 int retval;
280 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
281 retval = nreqs;
282 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
149 return nreqs; 283 return retval;
150} 284}
151 285
152unsigned int eio_nready (void) 286static unsigned int etp_nready (void)
153{ 287{
154 unsigned int retval; 288 unsigned int retval;
155 289
156 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 290 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
157 retval = nready; 291 retval = nready;
158 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 292 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
159 293
160 return retval; 294 return retval;
161} 295}
162 296
163unsigned int eio_npending (void) 297static unsigned int etp_npending (void)
164{ 298{
165 unsigned int retval; 299 unsigned int retval;
166 300
167 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 301 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
168 retval = npending; 302 retval = npending;
169 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 303 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
170 304
171 return retval; 305 return retval;
172} 306}
173 307
174unsigned int eio_nthreads (void) 308static unsigned int etp_nthreads (void)
175{ 309{
176 unsigned int retval; 310 unsigned int retval;
177 311
178 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 312 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
179 retval = started; 313 retval = started;
186 * a somewhat faster data structure might be nice, but 320 * a somewhat faster data structure might be nice, but
187 * with 8 priorities this actually needs <20 insns 321 * with 8 priorities this actually needs <20 insns
188 * per shift, the most expensive operation. 322 * per shift, the most expensive operation.
189 */ 323 */
190typedef struct { 324typedef struct {
191 eio_req *qs[EIO_NUM_PRI], *qe[EIO_NUM_PRI]; /* qstart, qend */ 325 ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */
192 int size; 326 int size;
193} reqq; 327} etp_reqq;
194 328
195static reqq req_queue; 329static etp_reqq req_queue;
196static reqq res_queue; 330static etp_reqq res_queue;
197 331
198static int reqq_push (reqq *q, eio_req *req) 332static int reqq_push (etp_reqq *q, ETP_REQ *req)
199{ 333{
200 int pri = req->pri; 334 int pri = req->pri;
201 req->next = 0; 335 req->next = 0;
202 336
203 if (q->qe[pri]) 337 if (q->qe[pri])
209 q->qe[pri] = q->qs[pri] = req; 343 q->qe[pri] = q->qs[pri] = req;
210 344
211 return q->size++; 345 return q->size++;
212} 346}
213 347
214static eio_req *reqq_shift (reqq *q) 348static ETP_REQ *reqq_shift (etp_reqq *q)
215{ 349{
216 int pri; 350 int pri;
217 351
218 if (!q->size) 352 if (!q->size)
219 return 0; 353 return 0;
220 354
221 --q->size; 355 --q->size;
222 356
223 for (pri = EIO_NUM_PRI; pri--; ) 357 for (pri = ETP_NUM_PRI; pri--; )
224 { 358 {
225 eio_req *req = q->qs[pri]; 359 eio_req *req = q->qs[pri];
226 360
227 if (req) 361 if (req)
228 { 362 {
234 } 368 }
235 369
236 abort (); 370 abort ();
237} 371}
238 372
239static void grp_try_feed (eio_req *grp) 373static void etp_atfork_prepare (void)
240{ 374{
241 while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) 375 X_LOCK (wrklock);
376 X_LOCK (reqlock);
377 X_LOCK (reslock);
378#if !HAVE_PREADWRITE
379 X_LOCK (preadwritelock);
380#endif
381}
382
383static void etp_atfork_parent (void)
384{
385#if !HAVE_PREADWRITE
386 X_UNLOCK (preadwritelock);
387#endif
388 X_UNLOCK (reslock);
389 X_UNLOCK (reqlock);
390 X_UNLOCK (wrklock);
391}
392
393static void etp_atfork_child (void)
394{
395 ETP_REQ *prv;
396
397 while ((prv = reqq_shift (&req_queue)))
398 ETP_DESTROY (prv);
399
400 while ((prv = reqq_shift (&res_queue)))
401 ETP_DESTROY (prv);
402
403 while (wrk_first.next != &wrk_first)
242 { 404 {
243 int old_len = grp->size; 405 etp_worker *wrk = wrk_first.next;
244 406
245 EIO_FEED (grp); 407 if (wrk->req)
408 ETP_DESTROY (wrk->req);
246 409
247 /* stop if no progress has been made */ 410 etp_worker_clear (wrk);
248 if (old_len == grp->size) 411 etp_worker_free (wrk);
249 {
250 grp->feed = 0;
251 break;
252 }
253 } 412 }
254}
255 413
256static int eio_finish (eio_req *req); 414 started = 0;
415 idle = 0;
416 nreqs = 0;
417 nready = 0;
418 npending = 0;
257 419
258static int grp_dec (eio_req *grp) 420 etp_atfork_parent ();
259{ 421}
260 --grp->size;
261 422
262 /* call feeder, if applicable */ 423static void
263 grp_try_feed (grp); 424etp_once_init (void)
425{
426 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child);
427}
264 428
265 /* finish, if done */ 429static int
266 if (!grp->size && grp->int1) 430etp_init (void (*want_poll)(void), void (*done_poll)(void))
267 return eio_finish (grp); 431{
268 else 432 static pthread_once_t doinit = PTHREAD_ONCE_INIT;
433
434 pthread_once (&doinit, etp_once_init);
435
436 want_poll_cb = want_poll;
437 done_poll_cb = done_poll;
438
269 return 0; 439 return 0;
270} 440}
271 441
272void eio_destroy (eio_req *req)
273{
274 if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1);
275 if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
276
277 EIO_DESTROY (req);
278}
279
280static int eio_finish (eio_req *req)
281{
282 int res = EIO_FINISH (req);
283
284 if (req->grp)
285 {
286 int res2;
287 eio_req *grp = req->grp;
288
289 /* unlink request */
290 if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
291 if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
292
293 if (grp->grp_first == req)
294 grp->grp_first = req->grp_next;
295
296 res2 = grp_dec (grp);
297
298 if (!res && res2)
299 res = res2;
300 }
301
302 eio_destroy (req);
303
304 return res;
305}
306
307void eio_grp_cancel (eio_req *grp)
308{
309 for (grp = grp->grp_first; grp; grp = grp->grp_next)
310 eio_cancel (grp);
311}
312
313void eio_cancel (eio_req *req)
314{
315 X_LOCK (wrklock);
316 req->flags |= EIO_FLAG_CANCELLED;
317 X_UNLOCK (wrklock);
318
319 eio_grp_cancel (req);
320}
321
322X_THREAD_PROC (eio_proc); 442X_THREAD_PROC (etp_proc);
323 443
324static void start_thread (void) 444static void etp_start_thread (void)
325{ 445{
326 worker *wrk = calloc (1, sizeof (worker)); 446 etp_worker *wrk = calloc (1, sizeof (etp_worker));
327 447
328 /*TODO*/ 448 /*TODO*/
329 assert (("unable to allocate worker thread data", wrk)); 449 assert (("unable to allocate worker thread data", wrk));
330 450
331 X_LOCK (wrklock); 451 X_LOCK (wrklock);
332 452
333 if (thread_create (&wrk->tid, eio_proc, (void *)wrk)) 453 if (thread_create (&wrk->tid, etp_proc, (void *)wrk))
334 { 454 {
335 wrk->prev = &wrk_first; 455 wrk->prev = &wrk_first;
336 wrk->next = wrk_first.next; 456 wrk->next = wrk_first.next;
337 wrk_first.next->prev = wrk; 457 wrk_first.next->prev = wrk;
338 wrk_first.next = wrk; 458 wrk_first.next = wrk;
342 free (wrk); 462 free (wrk);
343 463
344 X_UNLOCK (wrklock); 464 X_UNLOCK (wrklock);
345} 465}
346 466
347static void maybe_start_thread (void) 467static void etp_maybe_start_thread (void)
348{ 468{
349 if (eio_nthreads () >= wanted) 469 if (expect_true (etp_nthreads () >= wanted))
350 return; 470 return;
351 471
352 /* todo: maybe use idle here, but might be less exact */ 472 /* todo: maybe use idle here, but might be less exact */
353 if (0 <= (int)eio_nthreads () + (int)eio_npending () - (int)eio_nreqs ()) 473 if (expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ()))
354 return; 474 return;
355 475
356 start_thread (); 476 etp_start_thread ();
357} 477}
358 478
359void eio_submit (eio_req *req)
360{
361 ++nreqs;
362
363 X_LOCK (reqlock);
364 ++nready;
365 reqq_push (&req_queue, req);
366 X_COND_SIGNAL (reqwait);
367 X_UNLOCK (reqlock);
368
369 maybe_start_thread ();
370}
371
372static void end_thread (void) 479static void etp_end_thread (void)
373{ 480{
374 eio_req *req = calloc (1, sizeof (eio_req)); 481 eio_req *req = calloc (1, sizeof (eio_req));
375 482
376 req->type = EIO_QUIT; 483 req->type = -1;
377 req->pri = EIO_PRI_MAX + EIO_PRI_BIAS; 484 req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
378 485
379 X_LOCK (reqlock); 486 X_LOCK (reqlock);
380 reqq_push (&req_queue, req); 487 reqq_push (&req_queue, req);
381 X_COND_SIGNAL (reqwait); 488 X_COND_SIGNAL (reqwait);
382 X_UNLOCK (reqlock); 489 X_UNLOCK (reqlock);
384 X_LOCK (wrklock); 491 X_LOCK (wrklock);
385 --started; 492 --started;
386 X_UNLOCK (wrklock); 493 X_UNLOCK (wrklock);
387} 494}
388 495
389void eio_set_max_poll_time (double nseconds)
390{
391 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
392 max_poll_time = nseconds;
393 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
394}
395
396void eio_set_max_poll_reqs (unsigned int maxreqs)
397{
398 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
399 max_poll_reqs = maxreqs;
400 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
401}
402
403void eio_set_max_idle (unsigned int nthreads)
404{
405 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
406 max_idle = nthreads <= 0 ? 1 : nthreads;
407 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
408}
409
410void eio_set_min_parallel (unsigned int nthreads)
411{
412 if (wanted < nthreads)
413 wanted = nthreads;
414}
415
416void eio_set_max_parallel (unsigned int nthreads)
417{
418 if (wanted > nthreads)
419 wanted = nthreads;
420
421 while (started > wanted)
422 end_thread ();
423}
424
425int eio_poll (void) 496static int etp_poll (void)
426{ 497{
427 int maxreqs = max_poll_reqs; 498 unsigned int maxreqs;
499 unsigned int maxtime;
428 struct timeval tv_start, tv_now; 500 struct timeval tv_start, tv_now;
429 eio_req *req;
430 501
502 X_LOCK (reslock);
503 maxreqs = max_poll_reqs;
504 maxtime = max_poll_time;
505 X_UNLOCK (reslock);
506
431 if (max_poll_time) 507 if (maxtime)
432 gettimeofday (&tv_start, 0); 508 gettimeofday (&tv_start, 0);
433 509
434 for (;;) 510 for (;;)
435 { 511 {
512 ETP_REQ *req;
513
436 maybe_start_thread (); 514 etp_maybe_start_thread ();
437 515
438 X_LOCK (reslock); 516 X_LOCK (reslock);
439 req = reqq_shift (&res_queue); 517 req = reqq_shift (&res_queue);
440 518
441 if (req) 519 if (req)
449 X_UNLOCK (reslock); 527 X_UNLOCK (reslock);
450 528
451 if (!req) 529 if (!req)
452 return 0; 530 return 0;
453 531
532 X_LOCK (reqlock);
454 --nreqs; 533 --nreqs;
534 X_UNLOCK (reqlock);
455 535
456 if (req->type == EIO_GROUP && req->size) 536 if (expect_false (req->type == EIO_GROUP && req->size))
457 { 537 {
458 req->int1 = 1; /* mark request as delayed */ 538 req->int1 = 1; /* mark request as delayed */
459 continue; 539 continue;
460 } 540 }
461 else 541 else
462 { 542 {
463 int res = eio_finish (req); 543 int res = ETP_FINISH (req);
464 if (res) 544 if (expect_false (res))
465 return res; 545 return res;
466 } 546 }
467 547
468 if (maxreqs && !--maxreqs) 548 if (expect_false (maxreqs && !--maxreqs))
469 break; 549 break;
470 550
471 if (max_poll_time) 551 if (maxtime)
472 { 552 {
473 gettimeofday (&tv_now, 0); 553 gettimeofday (&tv_now, 0);
474 554
475 if (tvdiff (&tv_start, &tv_now) >= max_poll_time) 555 if (tvdiff (&tv_start, &tv_now) >= maxtime)
476 break; 556 break;
477 } 557 }
478 } 558 }
479 559
480 errno = EAGAIN; 560 errno = EAGAIN;
481 return -1; 561 return -1;
482} 562}
483 563
564static void etp_cancel (ETP_REQ *req)
565{
566 X_LOCK (wrklock);
567 req->flags |= EIO_FLAG_CANCELLED;
568 X_UNLOCK (wrklock);
569
570 eio_grp_cancel (req);
571}
572
573static void etp_submit (ETP_REQ *req)
574{
575 req->pri -= ETP_PRI_MIN;
576
577 if (expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN;
578 if (expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
579
580 if (expect_false (req->type == EIO_GROUP))
581 {
582 /* I hope this is worth it :/ */
583 X_LOCK (reqlock);
584 ++nreqs;
585 X_UNLOCK (reqlock);
586
587 X_LOCK (reslock);
588
589 ++npending;
590
591 if (!reqq_push (&res_queue, req) && want_poll_cb)
592 want_poll_cb ();
593
594 X_UNLOCK (reslock);
595 }
596 else
597 {
598 X_LOCK (reqlock);
599 ++nreqs;
600 ++nready;
601 reqq_push (&req_queue, req);
602 X_COND_SIGNAL (reqwait);
603 X_UNLOCK (reqlock);
604
605 etp_maybe_start_thread ();
606 }
607}
608
609static void etp_set_max_poll_time (double nseconds)
610{
611 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
612 max_poll_time = nseconds * EIO_TICKS;
613 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
614}
615
616static void etp_set_max_poll_reqs (unsigned int maxreqs)
617{
618 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
619 max_poll_reqs = maxreqs;
620 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
621}
622
623static void etp_set_max_idle (unsigned int nthreads)
624{
625 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
626 max_idle = nthreads <= 0 ? 1 : nthreads;
627 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
628}
629
630static void etp_set_min_parallel (unsigned int nthreads)
631{
632 if (wanted < nthreads)
633 wanted = nthreads;
634}
635
636static void etp_set_max_parallel (unsigned int nthreads)
637{
638 if (wanted > nthreads)
639 wanted = nthreads;
640
641 while (started > wanted)
642 etp_end_thread ();
643}
644
645/*****************************************************************************/
646
647static void grp_try_feed (eio_req *grp)
648{
649 while (grp->size < grp->int2 && !EIO_CANCELLED (grp))
650 {
651 grp->flags &= ~EIO_FLAG_GROUPADD;
652
653 EIO_FEED (grp);
654
655 /* stop if no progress has been made */
656 if (!(grp->flags & EIO_FLAG_GROUPADD))
657 {
658 grp->feed = 0;
659 break;
660 }
661 }
662}
663
664static int grp_dec (eio_req *grp)
665{
666 --grp->size;
667
668 /* call feeder, if applicable */
669 grp_try_feed (grp);
670
671 /* finish, if done */
672 if (!grp->size && grp->int1)
673 return eio_finish (grp);
674 else
675 return 0;
676}
677
678void eio_destroy (eio_req *req)
679{
680 if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1);
681 if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
682
683 EIO_DESTROY (req);
684}
685
686static int eio_finish (eio_req *req)
687{
688 int res = EIO_FINISH (req);
689
690 if (req->grp)
691 {
692 int res2;
693 eio_req *grp = req->grp;
694
695 /* unlink request */
696 if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
697 if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
698
699 if (grp->grp_first == req)
700 grp->grp_first = req->grp_next;
701
702 res2 = grp_dec (grp);
703
704 if (!res && res2)
705 res = res2;
706 }
707
708 eio_destroy (req);
709
710 return res;
711}
712
713void eio_grp_cancel (eio_req *grp)
714{
715 for (grp = grp->grp_first; grp; grp = grp->grp_next)
716 eio_cancel (grp);
717}
718
719void eio_cancel (eio_req *req)
720{
721 etp_cancel (req);
722}
723
724void eio_submit (eio_req *req)
725{
726 etp_submit (req);
727}
728
729unsigned int eio_nreqs (void)
730{
731 return etp_nreqs ();
732}
733
734unsigned int eio_nready (void)
735{
736 return etp_nready ();
737}
738
739unsigned int eio_npending (void)
740{
741 return etp_npending ();
742}
743
744unsigned int eio_nthreads (void)
745{
746 return etp_nthreads ();
747}
748
749void eio_set_max_poll_time (double nseconds)
750{
751 etp_set_max_poll_time (nseconds);
752}
753
754void eio_set_max_poll_reqs (unsigned int maxreqs)
755{
756 etp_set_max_poll_reqs (maxreqs);
757}
758
759void eio_set_max_idle (unsigned int nthreads)
760{
761 etp_set_max_idle (nthreads);
762}
763
764void eio_set_min_parallel (unsigned int nthreads)
765{
766 etp_set_min_parallel (nthreads);
767}
768
769void eio_set_max_parallel (unsigned int nthreads)
770{
771 etp_set_max_parallel (nthreads);
772}
773
774int eio_poll (void)
775{
776 return etp_poll ();
777}
778
484/*****************************************************************************/ 779/*****************************************************************************/
485/* work around various missing functions */ 780/* work around various missing functions */
486 781
487#if !HAVE_PREADWRITE 782#if !HAVE_PREADWRITE
783# undef pread
784# undef pwrite
488# define pread eio__pread 785# define pread eio__pread
489# define pwrite eio__pwrite 786# define pwrite eio__pwrite
490
491/*
492 * make our pread/pwrite safe against themselves, but not against
493 * normal read/write by using a mutex. slows down execution a lot,
494 * but that's your problem, not mine.
495 */
496static mutex_t preadwritelock = X_MUTEX_INIT;
497 787
498static ssize_t 788static ssize_t
499eio__pread (int fd, void *buf, size_t count, off_t offset) 789eio__pread (int fd, void *buf, size_t count, off_t offset)
500{ 790{
501 ssize_t res; 791 ssize_t res;
519 809
520 X_LOCK (preadwritelock); 810 X_LOCK (preadwritelock);
521 ooffset = lseek (fd, 0, SEEK_CUR); 811 ooffset = lseek (fd, 0, SEEK_CUR);
522 lseek (fd, offset, SEEK_SET); 812 lseek (fd, offset, SEEK_SET);
523 res = write (fd, buf, count); 813 res = write (fd, buf, count);
524 lseek (fd, offset, SEEK_SET); 814 lseek (fd, ooffset, SEEK_SET);
525 X_UNLOCK (preadwritelock); 815 X_UNLOCK (preadwritelock);
526 816
527 return res; 817 return res;
528} 818}
529#endif 819#endif
530 820
531#ifndef HAVE_FUTIMES 821#ifndef HAVE_FUTIMES
532 822
823# undef utimes
824# undef futimes
533# define utimes(path,times) eio__utimes (path, times) 825# define utimes(path,times) eio__utimes (path, times)
534# define futimes(fd,times) eio__futimes (fd, times) 826# define futimes(fd,times) eio__futimes (fd, times)
535 827
536static int 828static int
537eio__utimes (const char *filename, const struct timeval times[2]) 829eio__utimes (const char *filename, const struct timeval times[2])
556} 848}
557 849
558#endif 850#endif
559 851
560#if !HAVE_FDATASYNC 852#if !HAVE_FDATASYNC
853# undef fdatasync
561# define fdatasync fsync 854# define fdatasync(fd) fsync (fd)
562#endif 855#endif
856
857/* sync_file_range always needs emulation */
858int
859eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags)
860{
861#if HAVE_SYNC_FILE_RANGE
862 int res;
863
864 if (EIO_SYNC_FILE_RANGE_WAIT_BEFORE != SYNC_FILE_RANGE_WAIT_BEFORE
865 || EIO_SYNC_FILE_RANGE_WRITE != SYNC_FILE_RANGE_WRITE
866 || EIO_SYNC_FILE_RANGE_WAIT_AFTER != SYNC_FILE_RANGE_WAIT_AFTER)
867 {
868 flags = 0
869 | (flags & EIO_SYNC_FILE_RANGE_WAIT_BEFORE ? SYNC_FILE_RANGE_WAIT_BEFORE : 0)
870 | (flags & EIO_SYNC_FILE_RANGE_WRITE ? SYNC_FILE_RANGE_WRITE : 0)
871 | (flags & EIO_SYNC_FILE_RANGE_WAIT_AFTER ? SYNC_FILE_RANGE_WAIT_AFTER : 0);
872 }
873
874 res = sync_file_range (fd, offset, nbytes, flags);
875
876 if (!res || errno != ENOSYS)
877 return res;
878#endif
879
880 /* even though we could play tricks with the flags, it's better to always
881 * call fdatasync, as that matches the expectation of its users best */
882 return fdatasync (fd);
883}
563 884
564#if !HAVE_READAHEAD 885#if !HAVE_READAHEAD
886# undef readahead
565# define readahead(fd,offset,count) eio__readahead (fd, offset, count, self) 887# define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)
566 888
567static ssize_t 889static ssize_t
568eio__readahead (int fd, off_t offset, size_t count, worker *self) 890eio__readahead (int fd, off_t offset, size_t count, etp_worker *self)
569{ 891{
570 size_t todo = count; 892 size_t todo = count;
571 dBUF; 893 dBUF;
572 894
573 while (todo > 0) 895 while (todo > 0)
583 return count; 905 return count;
584} 906}
585 907
586#endif 908#endif
587 909
588#if !HAVE_READDIR_R
589# define readdir_r eio__readdir_r
590
591static mutex_t readdirlock = X_MUTEX_INIT;
592
593static int
594eio__readdir_r (DIR *dirp, EIO_STRUCT_DIRENT *ent, EIO_STRUCT_DIRENT **res)
595{
596 EIO_STRUCT_DIRENT *e;
597 int errorno;
598
599 X_LOCK (readdirlock);
600
601 e = readdir (dirp);
602 errorno = errno;
603
604 if (e)
605 {
606 *res = ent;
607 strcpy (ent->d_name, e->d_name);
608 }
609 else
610 *res = 0;
611
612 X_UNLOCK (readdirlock);
613
614 errno = errorno;
615 return e ? 0 : -1;
616}
617#endif
618
619/* sendfile always needs emulation */ 910/* sendfile always needs emulation */
620static ssize_t 911static ssize_t
621eio__sendfile (int ofd, int ifd, off_t offset, size_t count, worker *self) 912eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self)
622{ 913{
623 ssize_t res; 914 ssize_t res;
624 915
625 if (!count) 916 if (!count)
626 return 0; 917 return 0;
627 918
628#if HAVE_SENDFILE 919#if HAVE_SENDFILE
629# if __linux 920# if __linux
630 res = sendfile (ofd, ifd, &offset, count); 921 res = sendfile (ofd, ifd, &offset, count);
631 922
632# elif __freebsd 923# elif __FreeBSD__
633 /* 924 /*
634 * Of course, the freebsd sendfile is a dire hack with no thoughts 925 * Of course, the freebsd sendfile is a dire hack with no thoughts
635 * wasted on making it similar to other I/O functions. 926 * wasted on making it similar to other I/O functions.
636 */ 927 */
637 { 928 {
638 off_t sbytes; 929 off_t sbytes;
639 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); 930 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
640 931
641 if (res < 0 && sbytes) 932 #if 0 /* according to the manpage, this is correct, but broken behaviour */
642 /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ 933 /* freebsd' sendfile will return 0 on success */
934 /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */
935 /* not on e.g. EIO or EPIPE - sounds broken */
936 if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0)
937 res = sbytes;
938 #endif
939
940 /* according to source inspection, this is correct, and useful behaviour */
941 if (sbytes)
942 res = sbytes;
943 }
944
945# elif defined (__APPLE__)
946
947 {
948 off_t sbytes = count;
949 res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
950
951 /* according to the manpage, sbytes is always valid */
952 if (sbytes)
643 res = sbytes; 953 res = sbytes;
644 } 954 }
645 955
646# elif __hpux 956# elif __hpux
647 res = sendfile (ofd, ifd, offset, count, 0, 0); 957 res = sendfile (ofd, ifd, offset, count, 0, 0);
661 if (res < 0 && sbytes) 971 if (res < 0 && sbytes)
662 res = sbytes; 972 res = sbytes;
663 } 973 }
664 974
665# endif 975# endif
976
977#elif defined (_WIN32)
978
979 /* does not work, just for documentation of what would need to be done */
980 {
981 HANDLE h = TO_SOCKET (ifd);
982 SetFilePointer (h, offset, 0, FILE_BEGIN);
983 res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
984 }
985
666#else 986#else
667 res = -1; 987 res = -1;
668 errno = ENOSYS; 988 errno = ENOSYS;
669#endif 989#endif
670 990
671 if (res < 0 991 if (res < 0
672 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK 992 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK
993 /* BSDs */
994#ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */
995 || errno == ENOTSUP
996#endif
997 || errno == EOPNOTSUPP /* BSDs */
673#if __solaris 998#if __solaris
674 || errno == EAFNOSUPPORT || errno == EPROTOTYPE 999 || errno == EAFNOSUPPORT || errno == EPROTOTYPE
675#endif 1000#endif
676 ) 1001 )
677 ) 1002 )
708 } 1033 }
709 1034
710 return res; 1035 return res;
711} 1036}
712 1037
1038static signed char
1039eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
1040{
1041 return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
1042 : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0;
1043}
1044
1045#define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1046
1047#define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1048#define EIO_SORT_FAST 60 /* when to only use insertion sort */
1049
1050static void
1051eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1052{
1053 unsigned char bits [9 + sizeof (ino_t) * 8];
1054 unsigned char *bit = bits;
1055
1056 assert (CHAR_BIT == 8);
1057 assert (sizeof (eio_dirent) * 8 < 256);
1058 assert (offsetof (eio_dirent, inode)); /* we use 0 as sentinel */
1059 assert (offsetof (eio_dirent, score)); /* we use 0 as sentinel */
1060
1061 if (size <= EIO_SORT_FAST)
1062 return;
1063
1064 /* first prepare an array of bits to test in our radix sort */
1065 /* try to take endianness into account, as well as differences in ino_t sizes */
1066 /* inode_bits must contain all inodes ORed together */
1067 /* which is used to skip bits that are 0 everywhere, which is very common */
1068 {
1069 ino_t endianness;
1070 int i, j;
1071
1072 /* we store the byte offset of byte n into byte n of "endianness" */
1073 for (i = 0; i < sizeof (ino_t); ++i)
1074 ((unsigned char *)&endianness)[i] = i;
1075
1076 *bit++ = 0;
1077
1078 for (i = 0; i < sizeof (ino_t); ++i)
1079 {
1080 /* shifting off the byte offsets out of "endianness" */
1081 int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1082 endianness >>= 8;
1083
1084 for (j = 0; j < 8; ++j)
1085 if (inode_bits & (((ino_t)1) << (i * 8 + j)))
1086 *bit++ = offs + j;
1087 }
1088
1089 for (j = 0; j < 8; ++j)
1090 if (score_bits & (1 << j))
1091 *bit++ = offsetof (eio_dirent, score) * 8 + j;
1092 }
1093
1094 /* now actually do the sorting (a variant of MSD radix sort) */
1095 {
1096 eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base;
1097 eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end;
1098 unsigned char *bit_stk [9 + sizeof (ino_t) * 8];
1099 int stk_idx = 0;
1100
1101 base_stk [stk_idx] = dents;
1102 end_stk [stk_idx] = dents + size;
1103 bit_stk [stk_idx] = bit - 1;
1104
1105 do
1106 {
1107 base = base_stk [stk_idx];
1108 end = end_stk [stk_idx];
1109 bit = bit_stk [stk_idx];
1110
1111 for (;;)
1112 {
1113 unsigned char O = *bit >> 3;
1114 unsigned char M = 1 << (*bit & 7);
1115
1116 eio_dirent *a = base;
1117 eio_dirent *b = end;
1118
1119 if (b - a < EIO_SORT_CUTOFF)
1120 break;
1121
1122 /* now bit-partition the array on the bit */
1123 /* this ugly asymmetric loop seems to perform much better than typical */
1124 /* partition algos found in the literature */
1125 do
1126 if (!(((unsigned char *)a)[O] & M))
1127 ++a;
1128 else if (!(((unsigned char *)--b)[O] & M))
1129 {
1130 eio_dirent tmp = *a; *a = *b; *b = tmp;
1131 ++a;
1132 }
1133 while (b > a);
1134
1135 /* next bit, or stop, if no bits left in this path */
1136 if (!*--bit)
1137 break;
1138
1139 base_stk [stk_idx] = a;
1140 end_stk [stk_idx] = end;
1141 bit_stk [stk_idx] = bit;
1142 ++stk_idx;
1143
1144 end = a;
1145 }
1146 }
1147 while (stk_idx--);
1148 }
1149}
1150
1151static void
1152eio_dent_insertion_sort (eio_dirent *dents, int size)
1153{
1154 /* first move the smallest element to the front, to act as a sentinel */
1155 {
1156 int i;
1157 eio_dirent *min = dents;
1158
1159 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1160 for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1161 if (EIO_DENT_CMP (dents [i], <, *min))
1162 min = &dents [i];
1163
1164 /* swap elements 0 and j (minimum) */
1165 {
1166 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1167 }
1168 }
1169
1170 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1171 {
1172 eio_dirent *i, *j;
1173
1174 for (i = dents + 1; i < dents + size; ++i)
1175 {
1176 eio_dirent value = *i;
1177
1178 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1179 j [1] = j [0];
1180
1181 j [1] = value;
1182 }
1183 }
1184}
1185
1186static void
1187eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1188{
1189 if (size <= 1)
1190 return; /* our insertion sort relies on size > 0 */
1191
1192 /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1193 /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1194 eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1195
1196 /* use an insertion sort at the end, or for small arrays, */
1197 /* as insertion sort is more efficient for small partitions */
1198 eio_dent_insertion_sort (dents, size);
1199}
1200
713/* read a full directory */ 1201/* read a full directory */
714static void 1202static void
715eio__scandir (eio_req *req, worker *self) 1203eio__scandir (eio_req *req, etp_worker *self)
716{ 1204{
717 DIR *dirp; 1205 DIR *dirp;
718 union
719 {
720 EIO_STRUCT_DIRENT d;
721 char b [offsetof (EIO_STRUCT_DIRENT, d_name) + NAME_MAX + 1];
722 } *u;
723 EIO_STRUCT_DIRENT *entp; 1206 EIO_STRUCT_DIRENT *entp;
724 char *name, *names; 1207 char *name, *names;
725 int memlen = 4096; 1208 int namesalloc = 4096;
726 int memofs = 0; 1209 int namesoffs = 0;
1210 int flags = req->int1;
1211 eio_dirent *dents = 0;
1212 int dentalloc = 128;
727 int res = 0; 1213 int dentoffs = 0;
1214 ino_t inode_bits = 0;
1215
1216 req->result = -1;
1217
1218 if (!(flags & EIO_READDIR_DENTS))
1219 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
728 1220
729 X_LOCK (wrklock); 1221 X_LOCK (wrklock);
1222 /* the corresponding closedir is in ETP_WORKER_CLEAR */
730 self->dirp = dirp = opendir (req->ptr1); 1223 self->dirp = dirp = opendir (req->ptr1);
731 self->dbuf = u = malloc (sizeof (*u));
732 req->flags |= EIO_FLAG_PTR2_FREE; 1224 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1225 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
733 req->ptr2 = names = malloc (memlen); 1226 req->ptr2 = names = malloc (namesalloc);
734 X_UNLOCK (wrklock); 1227 X_UNLOCK (wrklock);
735 1228
736 if (dirp && u && names) 1229 if (dirp && names && (!flags || dents))
737 for (;;) 1230 for (;;)
738 { 1231 {
739 errno = 0; 1232 errno = 0;
740 readdir_r (dirp, &u->d, &entp); 1233 entp = readdir (dirp);
741 1234
742 if (!entp) 1235 if (!entp)
1236 {
1237 if (errno)
1238 break;
1239
1240 /* sort etc. */
1241 req->int1 = flags;
1242 req->result = dentoffs;
1243
1244 if (flags & EIO_READDIR_STAT_ORDER)
1245 eio_dent_sort (dents, dentoffs, 0, inode_bits); /* sort by inode exclusively */
1246 else if (flags & EIO_READDIR_DIRS_FIRST)
1247 if (flags & EIO_READDIR_FOUND_UNKNOWN)
1248 eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1249 else
1250 {
1251 /* in this case, all is known, and we just put dirs first and sort them */
1252 eio_dirent *oth = dents + dentoffs;
1253 eio_dirent *dir = dents;
1254
1255 /* now partition dirs to the front, and non-dirs to the back */
1256 /* by walking from both sides and swapping if necessary */
1257 /* also clear score, so it doesn't influence sorting */
1258 while (oth > dir)
1259 {
1260 if (dir->type == EIO_DT_DIR)
1261 ++dir;
1262 else if ((--oth)->type == EIO_DT_DIR)
1263 {
1264 eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1265
1266 ++dir;
1267 }
1268 }
1269
1270 /* now sort the dirs only */
1271 eio_dent_sort (dents, dir - dents, 0, inode_bits);
1272 }
1273
743 break; 1274 break;
1275 }
744 1276
1277 /* now add the entry to our list(s) */
745 name = entp->d_name; 1278 name = entp->d_name;
746 1279
1280 /* skip . and .. entries */
747 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) 1281 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
748 { 1282 {
749 int len = strlen (name) + 1; 1283 int len = D_NAMLEN (entp) + 1;
750 1284
751 res++; 1285 while (expect_false (namesoffs + len > namesalloc))
752
753 while (memofs + len > memlen)
754 { 1286 {
755 memlen *= 2; 1287 namesalloc *= 2;
756 X_LOCK (wrklock); 1288 X_LOCK (wrklock);
757 req->ptr2 = names = realloc (names, memlen); 1289 req->ptr2 = names = realloc (names, namesalloc);
758 X_UNLOCK (wrklock); 1290 X_UNLOCK (wrklock);
759 1291
760 if (!names) 1292 if (!names)
761 break; 1293 break;
762 } 1294 }
763 1295
764 memcpy (names + memofs, name, len); 1296 memcpy (names + namesoffs, name, len);
1297
1298 if (dents)
1299 {
1300 struct eio_dirent *ent;
1301
1302 if (expect_false (dentoffs == dentalloc))
1303 {
1304 dentalloc *= 2;
1305 X_LOCK (wrklock);
1306 req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1307 X_UNLOCK (wrklock);
1308
1309 if (!dents)
1310 break;
1311 }
1312
1313 ent = dents + dentoffs;
1314
1315 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1316 ent->namelen = len - 1;
1317 ent->inode = D_INO (entp);
1318
1319 inode_bits |= ent->inode;
1320
1321 switch (D_TYPE (entp))
1322 {
1323 default:
1324 ent->type = EIO_DT_UNKNOWN;
1325 flags |= EIO_READDIR_FOUND_UNKNOWN;
1326 break;
1327
1328 #ifdef DT_FIFO
1329 case DT_FIFO: ent->type = EIO_DT_FIFO; break;
1330 #endif
1331 #ifdef DT_CHR
1332 case DT_CHR: ent->type = EIO_DT_CHR; break;
1333 #endif
1334 #ifdef DT_MPC
1335 case DT_MPC: ent->type = EIO_DT_MPC; break;
1336 #endif
1337 #ifdef DT_DIR
1338 case DT_DIR: ent->type = EIO_DT_DIR; break;
1339 #endif
1340 #ifdef DT_NAM
1341 case DT_NAM: ent->type = EIO_DT_NAM; break;
1342 #endif
1343 #ifdef DT_BLK
1344 case DT_BLK: ent->type = EIO_DT_BLK; break;
1345 #endif
1346 #ifdef DT_MPB
1347 case DT_MPB: ent->type = EIO_DT_MPB; break;
1348 #endif
1349 #ifdef DT_REG
1350 case DT_REG: ent->type = EIO_DT_REG; break;
1351 #endif
1352 #ifdef DT_NWK
1353 case DT_NWK: ent->type = EIO_DT_NWK; break;
1354 #endif
1355 #ifdef DT_CMP
1356 case DT_CMP: ent->type = EIO_DT_CMP; break;
1357 #endif
1358 #ifdef DT_LNK
1359 case DT_LNK: ent->type = EIO_DT_LNK; break;
1360 #endif
1361 #ifdef DT_SOCK
1362 case DT_SOCK: ent->type = EIO_DT_SOCK; break;
1363 #endif
1364 #ifdef DT_DOOR
1365 case DT_DOOR: ent->type = EIO_DT_DOOR; break;
1366 #endif
1367 #ifdef DT_WHT
1368 case DT_WHT: ent->type = EIO_DT_WHT; break;
1369 #endif
1370 }
1371
1372 ent->score = 7;
1373
1374 if (flags & EIO_READDIR_DIRS_FIRST)
1375 {
1376 if (ent->type == EIO_DT_UNKNOWN)
1377 {
1378 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1379 ent->score = 1;
1380 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1381 ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1382 }
1383 else if (ent->type == EIO_DT_DIR)
1384 ent->score = 0;
1385 }
1386 }
1387
765 memofs += len; 1388 namesoffs += len;
1389 ++dentoffs;
1390 }
1391
1392 if (EIO_CANCELLED (req))
1393 {
1394 errno = ECANCELED;
1395 break;
766 } 1396 }
767 } 1397 }
1398}
768 1399
769 if (errno) 1400#ifdef PAGESIZE
770 res = -1; 1401# define eio_pagesize() PAGESIZE
1402#else
1403static intptr_t
1404eio_pagesize (void)
1405{
1406 static intptr_t page;
1407
1408 if (!page)
1409 page = sysconf (_SC_PAGESIZE);
1410
1411 return page;
1412}
1413#endif
1414
1415static void
1416eio_page_align (void **addr, size_t *length)
1417{
1418 intptr_t mask = eio_pagesize () - 1;
1419
1420 /* round down addr */
1421 intptr_t adj = mask & (intptr_t)*addr;
1422
1423 *addr = (void *)((intptr_t)*addr - adj);
1424 *length += adj;
1425
1426 /* round up length */
1427 *length = (*length + mask) & ~mask;
1428}
1429
1430#if !_POSIX_MEMLOCK
1431# define eio__mlock(a,b) ((errno = ENOSYS), -1)
1432# define eio__mlockall(a) ((errno = ENOSYS), -1)
1433#else
1434
1435static int
1436eio__mlock (void *addr, size_t length)
1437{
1438 eio_page_align (&addr, &length);
1439
1440 mlock (addr, length);
1441}
1442
1443static int
1444eio__mlockall (int flags)
1445{
1446 #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7
1447 extern int mallopt (int, int);
1448 mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */
1449 #endif
1450
1451 if (EIO_MCL_CURRENT != MCL_CURRENT
1452 || EIO_MCL_FUTURE != MCL_FUTURE)
1453 {
1454 flags = 0
1455 | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0)
1456 | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0);
1457 }
1458
1459 mlockall (flags);
1460}
1461#endif
1462
1463#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1464# define eio__msync(a,b,c) ((errno = ENOSYS), -1)
1465#else
1466
1467int
1468eio__msync (void *mem, size_t len, int flags)
1469{
1470 eio_page_align (&mem, &len);
1471
1472 if (EIO_MS_ASYNC != MS_SYNC
1473 || EIO_MS_INVALIDATE != MS_INVALIDATE
1474 || EIO_MS_SYNC != MS_SYNC)
1475 {
1476 flags = 0
1477 | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0)
1478 | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0)
1479 | (flags & EIO_MS_SYNC ? MS_SYNC : 0);
1480 }
1481
1482 return msync (mem, len, flags);
1483}
1484
1485#endif
1486
1487int
1488eio__mtouch (void *mem, size_t len, int flags)
1489{
1490 eio_page_align (&mem, &len);
1491
771 1492 {
772 req->result = res; 1493 intptr_t addr = (intptr_t)mem;
1494 intptr_t end = addr + len;
1495 intptr_t page = eio_pagesize ();
1496
1497 if (addr < end)
1498 if (flags & EIO_MT_MODIFY) /* modify */
1499 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len);
1500 else
1501 do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len);
1502 }
1503
1504 return 0;
773} 1505}
774 1506
775/*****************************************************************************/ 1507/*****************************************************************************/
776 1508
777#define ALLOC(len) \ 1509#define ALLOC(len) \
787 req->result = -1; \ 1519 req->result = -1; \
788 break; \ 1520 break; \
789 } \ 1521 } \
790 } 1522 }
791 1523
792X_THREAD_PROC (eio_proc) 1524X_THREAD_PROC (etp_proc)
793{ 1525{
794 eio_req *req; 1526 ETP_REQ *req;
795 struct timespec ts; 1527 struct timespec ts;
796 worker *self = (worker *)thr_arg; 1528 etp_worker *self = (etp_worker *)thr_arg;
797 1529
798 /* try to distribute timeouts somewhat randomly */ 1530 /* try to distribute timeouts somewhat randomly */
799 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); 1531 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
800 1532
801 for (;;) 1533 for (;;)
802 { 1534 {
803 ts.tv_sec = time (0) + IDLE_TIMEOUT;
804
805 X_LOCK (reqlock); 1535 X_LOCK (reqlock);
806 1536
807 for (;;) 1537 for (;;)
808 { 1538 {
809 self->req = req = reqq_shift (&req_queue); 1539 self->req = req = reqq_shift (&req_queue);
811 if (req) 1541 if (req)
812 break; 1542 break;
813 1543
814 ++idle; 1544 ++idle;
815 1545
1546 ts.tv_sec = time (0) + IDLE_TIMEOUT;
816 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) 1547 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
817 { 1548 {
818 if (idle > max_idle) 1549 if (idle > max_idle)
819 { 1550 {
820 --idle; 1551 --idle;
825 goto quit; 1556 goto quit;
826 } 1557 }
827 1558
828 /* we are allowed to idle, so do so without any timeout */ 1559 /* we are allowed to idle, so do so without any timeout */
829 X_COND_WAIT (reqwait, reqlock); 1560 X_COND_WAIT (reqwait, reqlock);
830 ts.tv_sec = time (0) + IDLE_TIMEOUT;
831 } 1561 }
832 1562
833 --idle; 1563 --idle;
834 } 1564 }
835 1565
836 --nready; 1566 --nready;
837 1567
838 X_UNLOCK (reqlock); 1568 X_UNLOCK (reqlock);
839 1569
840 errno = 0; /* strictly unnecessary */ 1570 if (req->type < 0)
1571 goto quit;
841 1572
842 if (!EIO_CANCELLED (req)) 1573 if (!EIO_CANCELLED (req))
843 switch (req->type) 1574 ETP_EXECUTE (self, req);
844 {
845 case EIO_READ: ALLOC (req->size);
846 req->result = req->offs >= 0
847 ? pread (req->int1, req->ptr2, req->size, req->offs)
848 : read (req->int1, req->ptr2, req->size); break;
849 case EIO_WRITE: req->result = req->offs >= 0
850 ? pwrite (req->int1, req->ptr2, req->size, req->offs)
851 : write (req->int1, req->ptr2, req->size); break;
852
853 case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
854 case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break;
855
856 case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
857 req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
858 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
859 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
860 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
861 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
862
863 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
864 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
865 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
866 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
867 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
868 case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
869
870 case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
871 case EIO_CLOSE: req->result = close (req->int1); break;
872 case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
873 case EIO_UNLINK: req->result = unlink (req->ptr1); break;
874 case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
875 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
876 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
877 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
878 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
879 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
880
881 case EIO_READLINK: ALLOC (NAME_MAX);
882 req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break;
883
884 case EIO_SYNC: req->result = 0; sync (); break;
885 case EIO_FSYNC: req->result = fsync (req->int1); break;
886 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
887
888 case EIO_READDIR: eio__scandir (req, self); break;
889
890 case EIO_BUSY:
891#ifdef _WIN32
892 Sleep (req->nv1 * 1000.);
893#else
894 {
895 struct timeval tv;
896
897 tv.tv_sec = req->nv1;
898 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.;
899
900 req->result = select (0, 0, 0, 0, &tv);
901 }
902#endif
903 break;
904
905 case EIO_UTIME:
906 case EIO_FUTIME:
907 {
908 struct timeval tv[2];
909 struct timeval *times;
910
911 if (req->nv1 != -1. || req->nv2 != -1.)
912 {
913 tv[0].tv_sec = req->nv1;
914 tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
915 tv[1].tv_sec = req->nv2;
916 tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
917
918 times = tv;
919 }
920 else
921 times = 0;
922
923
924 req->result = req->type == EIO_FUTIME
925 ? futimes (req->int1, times)
926 : utimes (req->ptr1, times);
927 }
928
929 case EIO_GROUP:
930 case EIO_NOP:
931 req->result = 0;
932 break;
933
934 case EIO_QUIT:
935 goto quit;
936
937 default:
938 req->result = -1;
939 break;
940 }
941
942 req->errorno = errno;
943 1575
944 X_LOCK (reslock); 1576 X_LOCK (reslock);
945 1577
946 ++npending; 1578 ++npending;
947 1579
948 if (!reqq_push (&res_queue, req) && want_poll_cb) 1580 if (!reqq_push (&res_queue, req) && want_poll_cb)
949 want_poll_cb (); 1581 want_poll_cb ();
950 1582
951 self->req = 0; 1583 self->req = 0;
952 worker_clear (self); 1584 etp_worker_clear (self);
953 1585
954 X_UNLOCK (reslock); 1586 X_UNLOCK (reslock);
955 } 1587 }
956 1588
957quit: 1589quit:
958 X_LOCK (wrklock); 1590 X_LOCK (wrklock);
959 worker_free (self); 1591 etp_worker_free (self);
960 X_UNLOCK (wrklock); 1592 X_UNLOCK (wrklock);
961 1593
962 return 0; 1594 return 0;
963} 1595}
964 1596
965/*****************************************************************************/ 1597/*****************************************************************************/
966 1598
967static void eio_atfork_prepare (void)
968{
969 X_LOCK (wrklock);
970 X_LOCK (reqlock);
971 X_LOCK (reslock);
972#if !HAVE_PREADWRITE
973 X_LOCK (preadwritelock);
974#endif
975#if !HAVE_READDIR_R
976 X_LOCK (readdirlock);
977#endif
978}
979
980static void eio_atfork_parent (void)
981{
982#if !HAVE_READDIR_R
983 X_UNLOCK (readdirlock);
984#endif
985#if !HAVE_PREADWRITE
986 X_UNLOCK (preadwritelock);
987#endif
988 X_UNLOCK (reslock);
989 X_UNLOCK (reqlock);
990 X_UNLOCK (wrklock);
991}
992
993static void eio_atfork_child (void)
994{
995 eio_req *prv;
996
997 while (prv = reqq_shift (&req_queue))
998 eio_destroy (prv);
999
1000 while (prv = reqq_shift (&res_queue))
1001 eio_destroy (prv);
1002
1003 while (wrk_first.next != &wrk_first)
1004 {
1005 worker *wrk = wrk_first.next;
1006
1007 if (wrk->req)
1008 eio_destroy (wrk->req);
1009
1010 worker_clear (wrk);
1011 worker_free (wrk);
1012 }
1013
1014 started = 0;
1015 idle = 0;
1016 nreqs = 0;
1017 nready = 0;
1018 npending = 0;
1019
1020 eio_atfork_parent ();
1021}
1022
1023int eio_init (void (*want_poll)(void), void (*done_poll)(void)) 1599int eio_init (void (*want_poll)(void), void (*done_poll)(void))
1024{ 1600{
1025 want_poll_cb = want_poll; 1601 return etp_init (want_poll, done_poll);
1026 done_poll_cb = done_poll;
1027
1028#ifdef _WIN32
1029 X_MUTEX_CHECK (wrklock);
1030 X_MUTEX_CHECK (reslock);
1031 X_MUTEX_CHECK (reqlock);
1032 X_MUTEX_CHECK (reqwait);
1033 X_MUTEX_CHECK (preadwritelock);
1034 X_MUTEX_CHECK (readdirlock);
1035
1036 X_COND_CHECK (reqwait);
1037#endif
1038
1039 X_THREAD_ATFORK (eio_atfork_prepare, eio_atfork_parent, eio_atfork_child);
1040} 1602}
1041 1603
1042static void eio_api_destroy (eio_req *req) 1604static void eio_api_destroy (eio_req *req)
1043{ 1605{
1044 free (req); 1606 free (req);
1049 \ 1611 \
1050 req = (eio_req *)calloc (1, sizeof *req); \ 1612 req = (eio_req *)calloc (1, sizeof *req); \
1051 if (!req) \ 1613 if (!req) \
1052 return 0; \ 1614 return 0; \
1053 \ 1615 \
1054 req->type = rtype; \ 1616 req->type = rtype; \
1055 req->pri = EIO_DEFAULT_PRI + EIO_PRI_BIAS; \ 1617 req->pri = pri; \
1056 req->finish = cb; \ 1618 req->finish = cb; \
1619 req->data = data; \
1057 req->destroy = eio_api_destroy; 1620 req->destroy = eio_api_destroy;
1058 1621
1059#define SEND eio_submit (req); return req 1622#define SEND eio_submit (req); return req
1060 1623
1061#define PATH \ 1624#define PATH \
1065 { \ 1628 { \
1066 eio_api_destroy (req); \ 1629 eio_api_destroy (req); \
1067 return 0; \ 1630 return 0; \
1068 } 1631 }
1069 1632
1070eio_req *eio_nop (eio_cb cb) 1633static void eio_execute (etp_worker *self, eio_req *req)
1634{
1635 errno = 0;
1636
1637 switch (req->type)
1638 {
1639 case EIO_READ: ALLOC (req->size);
1640 req->result = req->offs >= 0
1641 ? pread (req->int1, req->ptr2, req->size, req->offs)
1642 : read (req->int1, req->ptr2, req->size); break;
1643 case EIO_WRITE: req->result = req->offs >= 0
1644 ? pwrite (req->int1, req->ptr2, req->size, req->offs)
1645 : write (req->int1, req->ptr2, req->size); break;
1646
1647 case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
1648 case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break;
1649
1650 case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1651 req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1652 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1653 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1654 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1655 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
1656
1657 case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1658 req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1659 case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1660 req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1661
1662 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
1663 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
1664 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
1665 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
1666 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
1667 case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
1668
1669 case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
1670 case EIO_CLOSE: req->result = close (req->int1); break;
1671 case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
1672 case EIO_UNLINK: req->result = unlink (req->ptr1); break;
1673 case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
1674 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
1675 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
1676 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
1677 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
1678 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break;
1679
1680 case EIO_READLINK: ALLOC (PATH_MAX);
1681 req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break;
1682
1683 case EIO_SYNC: req->result = 0; sync (); break;
1684 case EIO_FSYNC: req->result = fsync (req->int1); break;
1685 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
1686 case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break;
1687 case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break;
1688 case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break;
1689 case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break;
1690 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
1691
1692 case EIO_READDIR: eio__scandir (req, self); break;
1693
1694 case EIO_BUSY:
1695#ifdef _WIN32
1696 Sleep (req->nv1 * 1000.);
1697#else
1698 {
1699 struct timeval tv;
1700
1701 tv.tv_sec = req->nv1;
1702 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.;
1703
1704 req->result = select (0, 0, 0, 0, &tv);
1705 }
1706#endif
1707 break;
1708
1709 case EIO_UTIME:
1710 case EIO_FUTIME:
1711 {
1712 struct timeval tv[2];
1713 struct timeval *times;
1714
1715 if (req->nv1 != -1. || req->nv2 != -1.)
1716 {
1717 tv[0].tv_sec = req->nv1;
1718 tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
1719 tv[1].tv_sec = req->nv2;
1720 tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
1721
1722 times = tv;
1723 }
1724 else
1725 times = 0;
1726
1727
1728 req->result = req->type == EIO_FUTIME
1729 ? futimes (req->int1, times)
1730 : utimes (req->ptr1, times);
1731 }
1732 break;
1733
1734 case EIO_GROUP:
1735 abort (); /* handled in eio_request */
1736
1737 case EIO_NOP:
1738 req->result = 0;
1739 break;
1740
1741 case EIO_CUSTOM:
1742 ((void (*)(eio_req *))req->feed) (req);
1743 break;
1744
1745 default:
1746 req->result = -1;
1747 break;
1748 }
1749
1750 req->errorno = errno;
1751}
1752
1753#ifndef EIO_NO_WRAPPERS
1754
1755eio_req *eio_nop (int pri, eio_cb cb, void *data)
1071{ 1756{
1072 REQ (EIO_NOP); SEND; 1757 REQ (EIO_NOP); SEND;
1073} 1758}
1074 1759
1075eio_req *eio_busy (double delay, eio_cb cb) 1760eio_req *eio_busy (double delay, int pri, eio_cb cb, void *data)
1076{ 1761{
1077 REQ (EIO_BUSY); req->nv1 = delay; SEND; 1762 REQ (EIO_BUSY); req->nv1 = delay; SEND;
1078} 1763}
1079 1764
1080eio_req *eio_sync (eio_cb cb) 1765eio_req *eio_sync (int pri, eio_cb cb, void *data)
1081{ 1766{
1082 REQ (EIO_SYNC); SEND; 1767 REQ (EIO_SYNC); SEND;
1083} 1768}
1084 1769
1085eio_req *eio_fsync (int fd, eio_cb cb) 1770eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data)
1086{ 1771{
1087 REQ (EIO_FSYNC); req->int1 = fd; SEND; 1772 REQ (EIO_FSYNC); req->int1 = fd; SEND;
1088} 1773}
1089 1774
1775eio_req *eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
1776{
1777 REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
1778}
1779
1780eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
1781{
1782 REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
1783}
1784
1785eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data)
1786{
1787 REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND;
1788}
1789
1790eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data)
1791{
1792 REQ (EIO_MLOCKALL); req->int1 = flags; SEND;
1793}
1794
1795eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
1796{
1797 REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND;
1798}
1799
1090eio_req *eio_fdatasync (int fd, eio_cb cb) 1800eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data)
1091{ 1801{
1092 REQ (EIO_FDATASYNC); req->int1 = fd; SEND; 1802 REQ (EIO_FDATASYNC); req->int1 = fd; SEND;
1093} 1803}
1094 1804
1095eio_req *eio_close (int fd, eio_cb cb) 1805eio_req *eio_close (int fd, int pri, eio_cb cb, void *data)
1096{ 1806{
1097 REQ (EIO_CLOSE); req->int1 = fd; SEND; 1807 REQ (EIO_CLOSE); req->int1 = fd; SEND;
1098} 1808}
1099 1809
1100eio_req *eio_readahead (int fd, off_t offset, size_t length, eio_cb cb) 1810eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data)
1101{ 1811{
1102 REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND; 1812 REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND;
1103} 1813}
1104 1814
1105eio_req *eio_read (int fd, void *data, size_t length, off_t offset, eio_cb cb) 1815eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
1106{ 1816{
1107 REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = data; SEND; 1817 REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
1108} 1818}
1109 1819
1110eio_req *eio_write (int fd, void *data, size_t length, off_t offset, eio_cb cb) 1820eio_req *eio_write (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
1111{ 1821{
1112 REQ (EIO_WRITE); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = data; SEND; 1822 REQ (EIO_WRITE); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
1113} 1823}
1114 1824
1115eio_req *eio_fstat (int fd, eio_cb cb) 1825eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
1116{ 1826{
1117 REQ (EIO_FSTAT); req->int1 = fd; SEND; 1827 REQ (EIO_FSTAT); req->int1 = fd; SEND;
1118} 1828}
1119 1829
1830eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data)
1831{
1832 REQ (EIO_FSTATVFS); req->int1 = fd; SEND;
1833}
1834
1120eio_req *eio_futime (int fd, double atime, double mtime, eio_cb cb) 1835eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data)
1121{ 1836{
1122 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; 1837 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
1123} 1838}
1124 1839
1125eio_req *eio_ftruncate (int fd, off_t offset, eio_cb cb) 1840eio_req *eio_ftruncate (int fd, off_t offset, int pri, eio_cb cb, void *data)
1126{ 1841{
1127 REQ (EIO_FTRUNCATE); req->int1 = fd; req->offs = offset; SEND; 1842 REQ (EIO_FTRUNCATE); req->int1 = fd; req->offs = offset; SEND;
1128} 1843}
1129 1844
1130eio_req *eio_fchmod (int fd, mode_t mode, eio_cb cb) 1845eio_req *eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data)
1131{ 1846{
1132 REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND; 1847 REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND;
1133} 1848}
1134 1849
1135eio_req *eio_fchown (int fd, uid_t uid, gid_t gid, eio_cb cb) 1850eio_req *eio_fchown (int fd, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
1136{ 1851{
1137 REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND; 1852 REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
1138} 1853}
1139 1854
1140eio_req *eio_dup2 (int fd, int fd2, eio_cb cb) 1855eio_req *eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data)
1141{ 1856{
1142 REQ (EIO_DUP2); req->int1 = fd; req->int2 = fd2; SEND; 1857 REQ (EIO_DUP2); req->int1 = fd; req->int2 = fd2; SEND;
1143} 1858}
1144 1859
1145eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, eio_cb cb) 1860eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, int pri, eio_cb cb, void *data)
1146{ 1861{
1147 REQ (EIO_SENDFILE); req->int1 = out_fd; req->int2 = in_fd; req->offs = in_offset; req->size = length; SEND; 1862 REQ (EIO_SENDFILE); req->int1 = out_fd; req->int2 = in_fd; req->offs = in_offset; req->size = length; SEND;
1148} 1863}
1149 1864
1150eio_req *eio_open (const char *path, int flags, mode_t mode, eio_cb cb) 1865eio_req *eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data)
1151{ 1866{
1152 REQ (EIO_OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND; 1867 REQ (EIO_OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND;
1153} 1868}
1154 1869
1155eio_req *eio_utime (const char *path, double atime, double mtime, eio_cb cb) 1870eio_req *eio_utime (const char *path, double atime, double mtime, int pri, eio_cb cb, void *data)
1156{ 1871{
1157 REQ (EIO_UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND; 1872 REQ (EIO_UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND;
1158} 1873}
1159 1874
1160eio_req *eio_truncate (const char *path, off_t offset, eio_cb cb) 1875eio_req *eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data)
1161{ 1876{
1162 REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND; 1877 REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND;
1163} 1878}
1164 1879
1165eio_req *eio_chown (const char *path, uid_t uid, gid_t gid, eio_cb cb) 1880eio_req *eio_chown (const char *path, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
1166{ 1881{
1167 REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND; 1882 REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
1168} 1883}
1169 1884
1170eio_req *eio_chmod (const char *path, mode_t mode, eio_cb cb) 1885eio_req *eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
1171{ 1886{
1172 REQ (EIO_CHMOD); PATH; req->int2 = (long)mode; SEND; 1887 REQ (EIO_CHMOD); PATH; req->int2 = (long)mode; SEND;
1173} 1888}
1174 1889
1175eio_req *eio_mkdir (const char *path, mode_t mode, eio_cb cb) 1890eio_req *eio_mkdir (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
1176{ 1891{
1177 REQ (EIO_MKDIR); PATH; req->int2 = (long)mode; SEND; 1892 REQ (EIO_MKDIR); PATH; req->int2 = (long)mode; SEND;
1178} 1893}
1179 1894
1180static eio_req * 1895static eio_req *
1181eio__1path (int type, const char *path, eio_cb cb) 1896eio__1path (int type, const char *path, int pri, eio_cb cb, void *data)
1182{ 1897{
1183 REQ (type); PATH; SEND; 1898 REQ (type); PATH; SEND;
1184} 1899}
1185 1900
1186eio_req *eio_readlink (const char *path, eio_cb cb) 1901eio_req *eio_readlink (const char *path, int pri, eio_cb cb, void *data)
1187{ 1902{
1188 return eio__1path (EIO_READLINK, path, cb); 1903 return eio__1path (EIO_READLINK, path, pri, cb, data);
1189} 1904}
1190 1905
1191eio_req *eio_stat (const char *path, eio_cb cb) 1906eio_req *eio_stat (const char *path, int pri, eio_cb cb, void *data)
1192{ 1907{
1193 return eio__1path (EIO_STAT, path, cb); 1908 return eio__1path (EIO_STAT, path, pri, cb, data);
1194} 1909}
1195 1910
1196eio_req *eio_lstat (const char *path, eio_cb cb) 1911eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data)
1197{ 1912{
1198 return eio__1path (EIO_LSTAT, path, cb); 1913 return eio__1path (EIO_LSTAT, path, pri, cb, data);
1199} 1914}
1200 1915
1916eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data)
1917{
1918 return eio__1path (EIO_STATVFS, path, pri, cb, data);
1919}
1920
1201eio_req *eio_unlink (const char *path, eio_cb cb) 1921eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data)
1202{ 1922{
1203 return eio__1path (EIO_UNLINK, path, cb); 1923 return eio__1path (EIO_UNLINK, path, pri, cb, data);
1204} 1924}
1205 1925
1206eio_req *eio_rmdir (const char *path, eio_cb cb) 1926eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
1207{ 1927{
1208 return eio__1path (EIO_RMDIR, path, cb); 1928 return eio__1path (EIO_RMDIR, path, pri, cb, data);
1209} 1929}
1210 1930
1211eio_req *eio_readdir (const char *path, eio_cb cb) 1931eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data)
1212{ 1932{
1213 return eio__1path (EIO_READDIR, path, cb); 1933 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
1214} 1934}
1215 1935
1216eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, eio_cb cb) 1936eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
1217{ 1937{
1218 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int2 = (long)dev; SEND; 1938 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND;
1219} 1939}
1220 1940
1221static eio_req * 1941static eio_req *
1222eio__2path (int type, const char *path, const char *new_path, eio_cb cb) 1942eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1223{ 1943{
1224 REQ (type); PATH; 1944 REQ (type); PATH;
1225 1945
1226 req->flags |= EIO_FLAG_PTR2_FREE; 1946 req->flags |= EIO_FLAG_PTR2_FREE;
1227 req->ptr2 = strdup (new_path); 1947 req->ptr2 = strdup (new_path);
1232 } 1952 }
1233 1953
1234 SEND; 1954 SEND;
1235} 1955}
1236 1956
1237eio_req *eio_link (const char *path, const char *new_path, eio_cb cb) 1957eio_req *eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1238{ 1958{
1239 return eio__2path (EIO_LINK, path, new_path, cb); 1959 return eio__2path (EIO_LINK, path, new_path, pri, cb, data);
1240} 1960}
1241 1961
1242eio_req *eio_symlink (const char *path, const char *new_path, eio_cb cb) 1962eio_req *eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1243{ 1963{
1244 return eio__2path (EIO_SYMLINK, path, new_path, cb); 1964 return eio__2path (EIO_SYMLINK, path, new_path, pri, cb, data);
1245} 1965}
1246 1966
1247eio_req *eio_rename (const char *path, const char *new_path, eio_cb cb) 1967eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1248{ 1968{
1249 return eio__2path (EIO_RENAME, path, new_path, cb); 1969 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
1970}
1971
1972eio_req *eio_custom (eio_cb execute, int pri, eio_cb cb, void *data)
1973{
1974 REQ (EIO_CUSTOM); req->feed = (void (*)(eio_req *))execute; SEND;
1975}
1976
1977#endif
1978
1979eio_req *eio_grp (eio_cb cb, void *data)
1980{
1981 const int pri = EIO_PRI_MAX;
1982
1983 REQ (EIO_GROUP); SEND;
1250} 1984}
1251 1985
1252#undef REQ 1986#undef REQ
1253#undef PATH 1987#undef PATH
1254#undef SEND 1988#undef SEND
1273 2007
1274void eio_grp_add (eio_req *grp, eio_req *req) 2008void eio_grp_add (eio_req *grp, eio_req *req)
1275{ 2009{
1276 assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); 2010 assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2));
1277 2011
2012 grp->flags |= EIO_FLAG_GROUPADD;
2013
1278 ++grp->size; 2014 ++grp->size;
1279 req->grp = grp; 2015 req->grp = grp;
1280 2016
1281 req->grp_prev = 0; 2017 req->grp_prev = 0;
1282 req->grp_next = grp->grp_first; 2018 req->grp_next = grp->grp_first;
1290/*****************************************************************************/ 2026/*****************************************************************************/
1291/* misc garbage */ 2027/* misc garbage */
1292 2028
1293ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) 2029ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
1294{ 2030{
1295 worker wrk; 2031 etp_worker wrk;
2032 ssize_t ret;
1296 2033
1297 wrk.dbuf = 0; 2034 wrk.dbuf = 0;
1298 2035
1299 eio__sendfile (ofd, ifd, offset, count, &wrk); 2036 ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
1300 2037
1301 if (wrk.dbuf) 2038 if (wrk.dbuf)
1302 free (wrk.dbuf); 2039 free (wrk.dbuf);
1303}
1304 2040
2041 return ret;
2042}
2043

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines