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

Comparing libeio/eio.c (file contents):
Revision 1.8 by root, Sun May 11 20:08:37 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# ifndef EIO_STRUCT_STAT
48# define EIO_STRUCT_STAT struct stat
49# endif
50
51#if HAVE_SENDFILE 112#if HAVE_SENDFILE
52# if __linux 113# if __linux
53# include <sys/sendfile.h> 114# include <sys/sendfile.h>
54# elif __freebsd 115# elif __FreeBSD__ || defined __APPLE__
55# include <sys/socket.h> 116# include <sys/socket.h>
56# include <sys/uio.h> 117# include <sys/uio.h>
57# elif __hpux 118# elif __hpux
58# include <sys/socket.h> 119# include <sys/socket.h>
59# elif __solaris /* not yet */ 120# elif __solaris
60# include <sys/sendfile.h> 121# include <sys/sendfile.h>
61# else 122# else
62# error sendfile support requested but not available 123# error sendfile support requested but not available
63# endif 124# endif
64#endif 125#endif
65 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
66/* number of seconds after which an idle threads exit */ 137/* number of seconds after which an idle threads exit */
67#define IDLE_TIMEOUT 10 138#define IDLE_TIMEOUT 10
68 139
69/* used for struct dirent, AIX doesn't provide it */ 140/* used for struct dirent, AIX doesn't provide it */
70#ifndef NAME_MAX 141#ifndef NAME_MAX
71# define NAME_MAX 4096 142# define NAME_MAX 4096
72#endif 143#endif
73 144
145/* used for readlink etc. */
146#ifndef PATH_MAX
147# define PATH_MAX 4096
148#endif
149
74/* buffer size for various temporary buffers */ 150/* buffer size for various temporary buffers */
75#define EIO_BUFSIZE 65536 151#define EIO_BUFSIZE 65536
76 152
77#define dBUF \ 153#define dBUF \
78 char *eio_buf; \ 154 char *eio_buf; \
79 X_LOCK (wrklock); \ 155 ETP_WORKER_LOCK (self); \
80 self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \ 156 self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \
81 X_UNLOCK (wrklock); \ 157 ETP_WORKER_UNLOCK (self); \
158 errno = ENOMEM; \
82 if (!eio_buf) \ 159 if (!eio_buf) \
83 return -1; 160 return -1;
84 161
85#define EIO_TICKS ((1000000 + 1023) >> 10) 162#define EIO_TICKS ((1000000 + 1023) >> 10)
86 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
87static void (*want_poll_cb) (void); 219static void (*want_poll_cb) (void);
88static void (*done_poll_cb) (void); 220static void (*done_poll_cb) (void);
89 221
90static unsigned int max_poll_time = 0; 222static unsigned int max_poll_time; /* reslock */
91static unsigned int max_poll_reqs = 0; 223static unsigned int max_poll_reqs; /* reslock */
92 224
93/* calculcate time difference in ~1/EIO_TICKS of a second */ 225static volatile unsigned int nreqs; /* reqlock */
94static int tvdiff (struct timeval *tv1, struct timeval *tv2) 226static volatile unsigned int nready; /* reqlock */
95{ 227static volatile unsigned int npending; /* reqlock */
96 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS 228static volatile unsigned int max_idle = 4;
97 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
98}
99 229
100static unsigned int started, idle, wanted; 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)
101 261
102/* worker threads management */ 262/* worker threads management */
103static mutex_t wrklock = X_MUTEX_INIT;
104 263
105typedef struct worker {
106 /* locked by wrklock */
107 struct worker *prev, *next;
108
109 thread_t tid;
110
111 /* locked by reslock, reqlock or wrklock */
112 eio_req *req; /* currently processed request */
113 void *dbuf;
114 DIR *dirp;
115} worker;
116
117static worker wrk_first = { &wrk_first, &wrk_first, 0 };
118
119static void worker_clear (worker *wrk) 264static void etp_worker_clear (etp_worker *wrk)
120{ 265{
121 if (wrk->dirp) 266 ETP_WORKER_CLEAR (wrk);
122 {
123 closedir (wrk->dirp);
124 wrk->dirp = 0;
125 }
126
127 if (wrk->dbuf)
128 {
129 free (wrk->dbuf);
130 wrk->dbuf = 0;
131 }
132} 267}
133 268
134static void worker_free (worker *wrk) 269static void etp_worker_free (etp_worker *wrk)
135{ 270{
136 wrk->next->prev = wrk->prev; 271 wrk->next->prev = wrk->prev;
137 wrk->prev->next = wrk->next; 272 wrk->prev->next = wrk->next;
138 273
139 free (wrk); 274 free (wrk);
140} 275}
141 276
142static volatile unsigned int nreqs, nready, npending;
143static volatile unsigned int max_idle = 4;
144
145static mutex_t reslock = X_MUTEX_INIT;
146static mutex_t reqlock = X_MUTEX_INIT;
147static cond_t reqwait = X_COND_INIT;
148
149unsigned int eio_nreqs (void) 277static unsigned int etp_nreqs (void)
150{ 278{
279 int retval;
280 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
281 retval = nreqs;
282 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
151 return nreqs; 283 return retval;
152} 284}
153 285
154unsigned int eio_nready (void) 286static unsigned int etp_nready (void)
155{ 287{
156 unsigned int retval; 288 unsigned int retval;
157 289
158 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 290 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
159 retval = nready; 291 retval = nready;
160 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 292 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
161 293
162 return retval; 294 return retval;
163} 295}
164 296
165unsigned int eio_npending (void) 297static unsigned int etp_npending (void)
166{ 298{
167 unsigned int retval; 299 unsigned int retval;
168 300
169 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 301 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
170 retval = npending; 302 retval = npending;
171 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 303 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
172 304
173 return retval; 305 return retval;
174} 306}
175 307
176unsigned int eio_nthreads (void) 308static unsigned int etp_nthreads (void)
177{ 309{
178 unsigned int retval; 310 unsigned int retval;
179 311
180 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 312 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
181 retval = started; 313 retval = started;
… …
188 * a somewhat faster data structure might be nice, but 320 * a somewhat faster data structure might be nice, but
189 * with 8 priorities this actually needs <20 insns 321 * with 8 priorities this actually needs <20 insns
190 * per shift, the most expensive operation. 322 * per shift, the most expensive operation.
191 */ 323 */
192typedef struct { 324typedef struct {
193 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 */
194 int size; 326 int size;
195} reqq; 327} etp_reqq;
196 328
197static reqq req_queue; 329static etp_reqq req_queue;
198static reqq res_queue; 330static etp_reqq res_queue;
199 331
200static int reqq_push (reqq *q, eio_req *req) 332static int reqq_push (etp_reqq *q, ETP_REQ *req)
201{ 333{
202 int pri = req->pri; 334 int pri = req->pri;
203 req->next = 0; 335 req->next = 0;
204 336
205 if (q->qe[pri]) 337 if (q->qe[pri])
… …
211 q->qe[pri] = q->qs[pri] = req; 343 q->qe[pri] = q->qs[pri] = req;
212 344
213 return q->size++; 345 return q->size++;
214} 346}
215 347
216static eio_req *reqq_shift (reqq *q) 348static ETP_REQ *reqq_shift (etp_reqq *q)
217{ 349{
218 int pri; 350 int pri;
219 351
220 if (!q->size) 352 if (!q->size)
221 return 0; 353 return 0;
222 354
223 --q->size; 355 --q->size;
224 356
225 for (pri = EIO_NUM_PRI; pri--; ) 357 for (pri = ETP_NUM_PRI; pri--; )
226 { 358 {
227 eio_req *req = q->qs[pri]; 359 eio_req *req = q->qs[pri];
228 360
229 if (req) 361 if (req)
230 { 362 {
… …
236 } 368 }
237 369
238 abort (); 370 abort ();
239} 371}
240 372
241static void grp_try_feed (eio_req *grp) 373static void etp_atfork_prepare (void)
242{ 374{
243 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)
244 { 404 {
245 int old_len = grp->size; 405 etp_worker *wrk = wrk_first.next;
246 406
247 EIO_FEED (grp); 407 if (wrk->req)
408 ETP_DESTROY (wrk->req);
248 409
249 /* stop if no progress has been made */ 410 etp_worker_clear (wrk);
250 if (old_len == grp->size) 411 etp_worker_free (wrk);
251 {
252 grp->feed = 0;
253 break;
254 }
255 } 412 }
256}
257 413
258static int eio_finish (eio_req *req); 414 started = 0;
415 idle = 0;
416 nreqs = 0;
417 nready = 0;
418 npending = 0;
259 419
260static int grp_dec (eio_req *grp) 420 etp_atfork_parent ();
261{ 421}
262 --grp->size;
263 422
264 /* call feeder, if applicable */ 423static void
265 grp_try_feed (grp); 424etp_once_init (void)
425{
426 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child);
427}
266 428
267 /* finish, if done */ 429static int
268 if (!grp->size && grp->int1) 430etp_init (void (*want_poll)(void), void (*done_poll)(void))
269 return eio_finish (grp); 431{
270 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
271 return 0; 439 return 0;
272} 440}
273 441
274void eio_destroy (eio_req *req)
275{
276 if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1);
277 if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
278
279 EIO_DESTROY (req);
280}
281
282static int eio_finish (eio_req *req)
283{
284 int res = EIO_FINISH (req);
285
286 if (req->grp)
287 {
288 int res2;
289 eio_req *grp = req->grp;
290
291 /* unlink request */
292 if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
293 if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
294
295 if (grp->grp_first == req)
296 grp->grp_first = req->grp_next;
297
298 res2 = grp_dec (grp);
299
300 if (!res && res2)
301 res = res2;
302 }
303
304 eio_destroy (req);
305
306 return res;
307}
308
309void eio_grp_cancel (eio_req *grp)
310{
311 for (grp = grp->grp_first; grp; grp = grp->grp_next)
312 eio_cancel (grp);
313}
314
315void eio_cancel (eio_req *req)
316{
317 X_LOCK (wrklock);
318 req->flags |= EIO_FLAG_CANCELLED;
319 X_UNLOCK (wrklock);
320
321 eio_grp_cancel (req);
322}
323
324X_THREAD_PROC (eio_proc); 442X_THREAD_PROC (etp_proc);
325 443
326static void start_thread (void) 444static void etp_start_thread (void)
327{ 445{
328 worker *wrk = calloc (1, sizeof (worker)); 446 etp_worker *wrk = calloc (1, sizeof (etp_worker));
329 447
330 /*TODO*/ 448 /*TODO*/
331 assert (("unable to allocate worker thread data", !wrk)); 449 assert (("unable to allocate worker thread data", wrk));
332 450
333 X_LOCK (wrklock); 451 X_LOCK (wrklock);
334 452
335 if (thread_create (&wrk->tid, eio_proc, (void *)wrk)) 453 if (thread_create (&wrk->tid, etp_proc, (void *)wrk))
336 { 454 {
337 wrk->prev = &wrk_first; 455 wrk->prev = &wrk_first;
338 wrk->next = wrk_first.next; 456 wrk->next = wrk_first.next;
339 wrk_first.next->prev = wrk; 457 wrk_first.next->prev = wrk;
340 wrk_first.next = wrk; 458 wrk_first.next = wrk;
… …
344 free (wrk); 462 free (wrk);
345 463
346 X_UNLOCK (wrklock); 464 X_UNLOCK (wrklock);
347} 465}
348 466
349static void maybe_start_thread (void) 467static void etp_maybe_start_thread (void)
350{ 468{
351 if (eio_nthreads () >= wanted) 469 if (expect_true (etp_nthreads () >= wanted))
352 return; 470 return;
353 471
354 /* todo: maybe use idle here, but might be less exact */ 472 /* todo: maybe use idle here, but might be less exact */
355 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 ()))
356 return; 474 return;
357 475
358 start_thread (); 476 etp_start_thread ();
359} 477}
360 478
361void eio_submit (eio_req *req)
362{
363 ++nreqs;
364
365 X_LOCK (reqlock);
366 ++nready;
367 reqq_push (&req_queue, req);
368 X_COND_SIGNAL (reqwait);
369 X_UNLOCK (reqlock);
370
371 maybe_start_thread ();
372}
373
374static void end_thread (void) 479static void etp_end_thread (void)
375{ 480{
376 eio_req *req = calloc (1, sizeof (eio_req)); 481 eio_req *req = calloc (1, sizeof (eio_req));
377 482
378 req->type = EIO_QUIT; 483 req->type = -1;
379 req->pri = EIO_PRI_MAX + EIO_PRI_BIAS; 484 req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
380 485
381 X_LOCK (reqlock); 486 X_LOCK (reqlock);
382 reqq_push (&req_queue, req); 487 reqq_push (&req_queue, req);
383 X_COND_SIGNAL (reqwait); 488 X_COND_SIGNAL (reqwait);
384 X_UNLOCK (reqlock); 489 X_UNLOCK (reqlock);
… …
386 X_LOCK (wrklock); 491 X_LOCK (wrklock);
387 --started; 492 --started;
388 X_UNLOCK (wrklock); 493 X_UNLOCK (wrklock);
389} 494}
390 495
391void eio_set_max_poll_time (double nseconds)
392{
393 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
394 max_poll_time = nseconds;
395 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
396}
397
398void eio_set_max_poll_reqs (unsigned int maxreqs)
399{
400 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
401 max_poll_reqs = maxreqs;
402 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
403}
404
405void eio_set_max_idle (unsigned int nthreads)
406{
407 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
408 max_idle = nthreads <= 0 ? 1 : nthreads;
409 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
410}
411
412void eio_set_min_parallel (unsigned int nthreads)
413{
414 if (wanted < nthreads)
415 wanted = nthreads;
416}
417
418void eio_set_max_parallel (unsigned int nthreads)
419{
420 if (wanted > nthreads)
421 wanted = nthreads;
422
423 while (started > wanted)
424 end_thread ();
425}
426
427int eio_poll (void) 496static int etp_poll (void)
428{ 497{
429 int maxreqs = max_poll_reqs; 498 unsigned int maxreqs;
499 unsigned int maxtime;
430 struct timeval tv_start, tv_now; 500 struct timeval tv_start, tv_now;
431 eio_req *req;
432 501
502 X_LOCK (reslock);
503 maxreqs = max_poll_reqs;
504 maxtime = max_poll_time;
505 X_UNLOCK (reslock);
506
433 if (max_poll_time) 507 if (maxtime)
434 gettimeofday (&tv_start, 0); 508 gettimeofday (&tv_start, 0);
435 509
436 for (;;) 510 for (;;)
437 { 511 {
512 ETP_REQ *req;
513
438 maybe_start_thread (); 514 etp_maybe_start_thread ();
439 515
440 X_LOCK (reslock); 516 X_LOCK (reslock);
441 req = reqq_shift (&res_queue); 517 req = reqq_shift (&res_queue);
442 518
443 if (req) 519 if (req)
… …
451 X_UNLOCK (reslock); 527 X_UNLOCK (reslock);
452 528
453 if (!req) 529 if (!req)
454 return 0; 530 return 0;
455 531
532 X_LOCK (reqlock);
456 --nreqs; 533 --nreqs;
534 X_UNLOCK (reqlock);
457 535
458 if (req->type == EIO_GROUP && req->size) 536 if (expect_false (req->type == EIO_GROUP && req->size))
459 { 537 {
460 req->int1 = 1; /* mark request as delayed */ 538 req->int1 = 1; /* mark request as delayed */
461 continue; 539 continue;
462 } 540 }
463 else 541 else
464 { 542 {
465 int res = eio_finish (req); 543 int res = ETP_FINISH (req);
466 if (res) 544 if (expect_false (res))
467 return res; 545 return res;
468 } 546 }
469 547
470 if (maxreqs && !--maxreqs) 548 if (expect_false (maxreqs && !--maxreqs))
471 break; 549 break;
472 550
473 if (max_poll_time) 551 if (maxtime)
474 { 552 {
475 gettimeofday (&tv_now, 0); 553 gettimeofday (&tv_now, 0);
476 554
477 if (tvdiff (&tv_start, &tv_now) >= max_poll_time) 555 if (tvdiff (&tv_start, &tv_now) >= maxtime)
478 break; 556 break;
479 } 557 }
480 } 558 }
481 559
482 errno = EAGAIN; 560 errno = EAGAIN;
483 return -1; 561 return -1;
484} 562}
485 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
486/*****************************************************************************/ 779/*****************************************************************************/
487/* work around various missing functions */ 780/* work around various missing functions */
488 781
489#if !HAVE_PREADWRITE 782#if !HAVE_PREADWRITE
783# undef pread
784# undef pwrite
490# define pread aio_pread 785# define pread eio__pread
491# define pwrite aio_pwrite 786# define pwrite eio__pwrite
492 787
493/* 788static ssize_t
494 * make our pread/pwrite safe against themselves, but not against 789eio__pread (int fd, void *buf, size_t count, off_t offset)
495 * normal read/write by using a mutex. slows down execution a lot,
496 * but that's your problem, not mine.
497 */
498static mutex_t preadwritelock = X_MUTEX_INIT;
499
500static ssize_t pread (int fd, void *buf, size_t count, off_t offset)
501{ 790{
502 ssize_t res; 791 ssize_t res;
503 off_t ooffset; 792 off_t ooffset;
504 793
505 X_LOCK (preadwritelock); 794 X_LOCK (preadwritelock);
… …
510 X_UNLOCK (preadwritelock); 799 X_UNLOCK (preadwritelock);
511 800
512 return res; 801 return res;
513} 802}
514 803
515static ssize_t pwrite (int fd, void *buf, size_t count, off_t offset) 804static ssize_t
805eio__pwrite (int fd, void *buf, size_t count, off_t offset)
516{ 806{
517 ssize_t res; 807 ssize_t res;
518 off_t ooffset; 808 off_t ooffset;
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) aio_utimes (path, times) 825# define utimes(path,times) eio__utimes (path, times)
534# define futimes(fd,times) aio_futimes (fd, times) 826# define futimes(fd,times) eio__futimes (fd, times)
535 827
828static int
536static int aio_utimes (const char *filename, const struct timeval times[2]) 829eio__utimes (const char *filename, const struct timeval times[2])
537{ 830{
538 if (times) 831 if (times)
539 { 832 {
540 struct utimbuf buf; 833 struct utimbuf buf;
541 834
… …
546 } 839 }
547 else 840 else
548 return utime (filename, 0); 841 return utime (filename, 0);
549} 842}
550 843
551static int aio_futimes (int fd, const struct timeval tv[2]) 844static int eio__futimes (int fd, const struct timeval tv[2])
552{ 845{
553 errno = ENOSYS; 846 errno = ENOSYS;
554 return -1; 847 return -1;
555} 848}
556 849
557#endif 850#endif
558 851
559#if !HAVE_FDATASYNC 852#if !HAVE_FDATASYNC
853# undef fdatasync
560# define fdatasync fsync 854# define fdatasync(fd) fsync (fd)
561#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}
562 884
563#if !HAVE_READAHEAD 885#if !HAVE_READAHEAD
886# undef readahead
564# define readahead(fd,offset,count) aio_readahead (fd, offset, count, self) 887# define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)
565 888
889static ssize_t
566static ssize_t aio_readahead (int fd, off_t offset, size_t count, worker *self) 890eio__readahead (int fd, off_t offset, size_t count, etp_worker *self)
567{ 891{
568 size_t todo = count; 892 size_t todo = count;
569 dBUF; 893 dBUF;
570 894
571 while (todo > 0) 895 while (todo > 0)
… …
581 return count; 905 return count;
582} 906}
583 907
584#endif 908#endif
585 909
586#if !HAVE_READDIR_R
587# define readdir_r aio_readdir_r
588
589static mutex_t readdirlock = X_MUTEX_INIT;
590
591static int readdir_r (DIR *dirp, EIO_STRUCT_DIRENT *ent, EIO_STRUCT_DIRENT **res)
592{
593 EIO_STRUCT_DIRENT *e;
594 int errorno;
595
596 X_LOCK (readdirlock);
597
598 e = readdir (dirp);
599 errorno = errno;
600
601 if (e)
602 {
603 *res = ent;
604 strcpy (ent->d_name, e->d_name);
605 }
606 else
607 *res = 0;
608
609 X_UNLOCK (readdirlock);
610
611 errno = errorno;
612 return e ? 0 : -1;
613}
614#endif
615
616/* sendfile always needs emulation */ 910/* sendfile always needs emulation */
911static ssize_t
617static ssize_t 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)
618{ 913{
619 ssize_t res; 914 ssize_t res;
620 915
621 if (!count) 916 if (!count)
622 return 0; 917 return 0;
623 918
624#if HAVE_SENDFILE 919#if HAVE_SENDFILE
625# if __linux 920# if __linux
626 res = sendfile (ofd, ifd, &offset, count); 921 res = sendfile (ofd, ifd, &offset, count);
627 922
628# elif __freebsd 923# elif __FreeBSD__
629 /* 924 /*
630 * 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
631 * wasted on making it similar to other I/O functions. 926 * wasted on making it similar to other I/O functions.
632 */ 927 */
633 { 928 {
634 off_t sbytes; 929 off_t sbytes;
635 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); 930 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
636 931
637 if (res < 0 && sbytes) 932 #if 0 /* according to the manpage, this is correct, but broken behaviour */
638 /* 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)
639 res = sbytes; 953 res = sbytes;
640 } 954 }
641 955
642# elif __hpux 956# elif __hpux
643 res = sendfile (ofd, ifd, offset, count, 0, 0); 957 res = sendfile (ofd, ifd, offset, count, 0, 0);
… …
657 if (res < 0 && sbytes) 971 if (res < 0 && sbytes)
658 res = sbytes; 972 res = sbytes;
659 } 973 }
660 974
661# 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
662#else 986#else
663 res = -1; 987 res = -1;
664 errno = ENOSYS; 988 errno = ENOSYS;
665#endif 989#endif
666 990
667 if (res < 0 991 if (res < 0
668 && (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 */
669#if __solaris 998#if __solaris
670 || errno == EAFNOSUPPORT || errno == EPROTOTYPE 999 || errno == EAFNOSUPPORT || errno == EPROTOTYPE
671#endif 1000#endif
672 ) 1001 )
673 ) 1002 )
… …
704 } 1033 }
705 1034
706 return res; 1035 return res;
707} 1036}
708 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
709/* read a full directory */ 1201/* read a full directory */
1202static void
710static void scandir_ (eio_req *req, worker *self) 1203eio__scandir (eio_req *req, etp_worker *self)
711{ 1204{
712 DIR *dirp; 1205 DIR *dirp;
713 union
714 {
715 EIO_STRUCT_DIRENT d;
716 char b [offsetof (EIO_STRUCT_DIRENT, d_name) + NAME_MAX + 1];
717 } *u;
718 EIO_STRUCT_DIRENT *entp; 1206 EIO_STRUCT_DIRENT *entp;
719 char *name, *names; 1207 char *name, *names;
720 int memlen = 4096; 1208 int namesalloc = 4096;
721 int memofs = 0; 1209 int namesoffs = 0;
1210 int flags = req->int1;
1211 eio_dirent *dents = 0;
1212 int dentalloc = 128;
722 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);
723 1220
724 X_LOCK (wrklock); 1221 X_LOCK (wrklock);
1222 /* the corresponding closedir is in ETP_WORKER_CLEAR */
725 self->dirp = dirp = opendir (req->ptr1); 1223 self->dirp = dirp = opendir (req->ptr1);
726 self->dbuf = u = malloc (sizeof (*u));
727 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;
728 req->ptr2 = names = malloc (memlen); 1226 req->ptr2 = names = malloc (namesalloc);
729 X_UNLOCK (wrklock); 1227 X_UNLOCK (wrklock);
730 1228
731 if (dirp && u && names) 1229 if (dirp && names && (!flags || dents))
732 for (;;) 1230 for (;;)
733 { 1231 {
734 errno = 0; 1232 errno = 0;
735 readdir_r (dirp, &u->d, &entp); 1233 entp = readdir (dirp);
736 1234
737 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
738 break; 1274 break;
1275 }
739 1276
1277 /* now add the entry to our list(s) */
740 name = entp->d_name; 1278 name = entp->d_name;
741 1279
1280 /* skip . and .. entries */
742 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) 1281 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
743 { 1282 {
744 int len = strlen (name) + 1; 1283 int len = D_NAMLEN (entp) + 1;
745 1284
746 res++; 1285 while (expect_false (namesoffs + len > namesalloc))
747
748 while (memofs + len > memlen)
749 { 1286 {
750 memlen *= 2; 1287 namesalloc *= 2;
751 X_LOCK (wrklock); 1288 X_LOCK (wrklock);
752 req->ptr2 = names = realloc (names, memlen); 1289 req->ptr2 = names = realloc (names, namesalloc);
753 X_UNLOCK (wrklock); 1290 X_UNLOCK (wrklock);
754 1291
755 if (!names) 1292 if (!names)
756 break; 1293 break;
757 } 1294 }
758 1295
759 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
760 memofs += len; 1388 namesoffs += len;
1389 ++dentoffs;
1390 }
1391
1392 if (EIO_CANCELLED (req))
1393 {
1394 errno = ECANCELED;
1395 break;
761 } 1396 }
762 } 1397 }
1398}
763 1399
764 if (errno) 1400#ifdef PAGESIZE
765 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
766 1492 {
767 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;
768} 1505}
769 1506
770/*****************************************************************************/ 1507/*****************************************************************************/
771 1508
772#define ALLOC(len) \ 1509#define ALLOC(len) \
… …
782 req->result = -1; \ 1519 req->result = -1; \
783 break; \ 1520 break; \
784 } \ 1521 } \
785 } 1522 }
786 1523
787X_THREAD_PROC (eio_proc) 1524X_THREAD_PROC (etp_proc)
788{ 1525{
789 eio_req *req; 1526 ETP_REQ *req;
790 struct timespec ts; 1527 struct timespec ts;
791 worker *self = (worker *)thr_arg; 1528 etp_worker *self = (etp_worker *)thr_arg;
792 1529
793 /* try to distribute timeouts somewhat randomly */ 1530 /* try to distribute timeouts somewhat randomly */
794 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); 1531 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
795 1532
796 for (;;) 1533 for (;;)
797 { 1534 {
798 ts.tv_sec = time (0) + IDLE_TIMEOUT;
799
800 X_LOCK (reqlock); 1535 X_LOCK (reqlock);
801 1536
802 for (;;) 1537 for (;;)
803 { 1538 {
804 self->req = req = reqq_shift (&req_queue); 1539 self->req = req = reqq_shift (&req_queue);
… …
806 if (req) 1541 if (req)
807 break; 1542 break;
808 1543
809 ++idle; 1544 ++idle;
810 1545
1546 ts.tv_sec = time (0) + IDLE_TIMEOUT;
811 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) 1547 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
812 { 1548 {
813 if (idle > max_idle) 1549 if (idle > max_idle)
814 { 1550 {
815 --idle; 1551 --idle;
… …
820 goto quit; 1556 goto quit;
821 } 1557 }
822 1558
823 /* we are allowed to idle, so do so without any timeout */ 1559 /* we are allowed to idle, so do so without any timeout */
824 X_COND_WAIT (reqwait, reqlock); 1560 X_COND_WAIT (reqwait, reqlock);
825 ts.tv_sec = time (0) + IDLE_TIMEOUT;
826 } 1561 }
827 1562
828 --idle; 1563 --idle;
829 } 1564 }
830 1565
831 --nready; 1566 --nready;
832 1567
833 X_UNLOCK (reqlock); 1568 X_UNLOCK (reqlock);
834 1569
835 errno = 0; /* strictly unnecessary */ 1570 if (req->type < 0)
1571 goto quit;
836 1572
837 if (!EIO_CANCELLED (req)) 1573 if (!EIO_CANCELLED (req))
838 switch (req->type) 1574 ETP_EXECUTE (self, req);
839 {
840 case EIO_READ: ALLOC (req->size);
841 req->result = req->offs >= 0
842 ? pread (req->int1, req->ptr2, req->size, req->offs)
843 : read (req->int1, req->ptr2, req->size); break;
844 case EIO_WRITE: req->result = req->offs >= 0
845 ? pwrite (req->int1, req->ptr2, req->size, req->offs)
846 : write (req->int1, req->ptr2, req->size); break;
847
848 case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
849 case EIO_SENDFILE: req->result = sendfile_ (req->int1, req->int2, req->offs, req->size, self); break;
850
851 case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
852 req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
853 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
854 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
855 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
856 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
857
858 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
859 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
860 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
861 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
862 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
863 case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
864
865 case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
866 case EIO_CLOSE: req->result = close (req->int1); break;
867 case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
868 case EIO_UNLINK: req->result = unlink (req->ptr1); break;
869 case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
870 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
871 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
872 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
873 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
874 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
875
876 case EIO_READLINK: ALLOC (NAME_MAX);
877 req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break;
878
879 case EIO_SYNC: req->result = 0; sync (); break;
880 case EIO_FSYNC: req->result = fsync (req->int1); break;
881 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
882
883 case EIO_READDIR: scandir_ (req, self); break;
884
885 case EIO_BUSY:
886#ifdef _WIN32
887 Sleep (req->nv1 * 1000.);
888#else
889 {
890 struct timeval tv;
891
892 tv.tv_sec = req->nv1;
893 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.;
894
895 req->result = select (0, 0, 0, 0, &tv);
896 }
897#endif
898 break;
899
900 case EIO_UTIME:
901 case EIO_FUTIME:
902 {
903 struct timeval tv[2];
904 struct timeval *times;
905
906 if (req->nv1 != -1. || req->nv2 != -1.)
907 {
908 tv[0].tv_sec = req->nv1;
909 tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
910 tv[1].tv_sec = req->nv2;
911 tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
912
913 times = tv;
914 }
915 else
916 times = 0;
917
918
919 req->result = req->type == EIO_FUTIME
920 ? futimes (req->int1, times)
921 : utimes (req->ptr1, times);
922 }
923
924 case EIO_GROUP:
925 case EIO_NOP:
926 break;
927
928 case EIO_QUIT:
929 goto quit;
930
931 default:
932 req->result = -1;
933 break;
934 }
935
936 req->errorno = errno;
937 1575
938 X_LOCK (reslock); 1576 X_LOCK (reslock);
939 1577
940 ++npending; 1578 ++npending;
941 1579
942 if (!reqq_push (&res_queue, req) && want_poll_cb) 1580 if (!reqq_push (&res_queue, req) && want_poll_cb)
943 want_poll_cb (); 1581 want_poll_cb ();
944 1582
945 self->req = 0; 1583 self->req = 0;
946 worker_clear (self); 1584 etp_worker_clear (self);
947 1585
948 X_UNLOCK (reslock); 1586 X_UNLOCK (reslock);
949 } 1587 }
950 1588
951quit: 1589quit:
952 X_LOCK (wrklock); 1590 X_LOCK (wrklock);
953 worker_free (self); 1591 etp_worker_free (self);
954 X_UNLOCK (wrklock); 1592 X_UNLOCK (wrklock);
955 1593
956 return 0; 1594 return 0;
957} 1595}
958 1596
959/*****************************************************************************/ 1597/*****************************************************************************/
960 1598
961static void eio_atfork_prepare (void)
962{
963 X_LOCK (wrklock);
964 X_LOCK (reqlock);
965 X_LOCK (reslock);
966#if !HAVE_PREADWRITE
967 X_LOCK (preadwritelock);
968#endif
969#if !HAVE_READDIR_R
970 X_LOCK (readdirlock);
971#endif
972}
973
974static void eio_atfork_parent (void)
975{
976#if !HAVE_READDIR_R
977 X_UNLOCK (readdirlock);
978#endif
979#if !HAVE_PREADWRITE
980 X_UNLOCK (preadwritelock);
981#endif
982 X_UNLOCK (reslock);
983 X_UNLOCK (reqlock);
984 X_UNLOCK (wrklock);
985}
986
987static void eio_atfork_child (void)
988{
989 eio_req *prv;
990
991 while (prv = reqq_shift (&req_queue))
992 eio_destroy (prv);
993
994 while (prv = reqq_shift (&res_queue))
995 eio_destroy (prv);
996
997 while (wrk_first.next != &wrk_first)
998 {
999 worker *wrk = wrk_first.next;
1000
1001 if (wrk->req)
1002 eio_destroy (wrk->req);
1003
1004 worker_clear (wrk);
1005 worker_free (wrk);
1006 }
1007
1008 started = 0;
1009 idle = 0;
1010 nreqs = 0;
1011 nready = 0;
1012 npending = 0;
1013
1014 eio_atfork_parent ();
1015}
1016
1017int eio_init (void (*want_poll)(void), void (*done_poll)(void)) 1599int eio_init (void (*want_poll)(void), void (*done_poll)(void))
1018{ 1600{
1019 want_poll_cb = want_poll; 1601 return etp_init (want_poll, done_poll);
1020 done_poll_cb = done_poll;
1021
1022#ifdef _WIN32
1023 X_MUTEX_CHECK (wrklock);
1024 X_MUTEX_CHECK (reslock);
1025 X_MUTEX_CHECK (reqlock);
1026 X_MUTEX_CHECK (reqwait);
1027 X_MUTEX_CHECK (preadwritelock);
1028 X_MUTEX_CHECK (readdirlock);
1029
1030 X_COND_CHECK (reqwait);
1031#endif
1032
1033 X_THREAD_ATFORK (eio_atfork_prepare, eio_atfork_parent, eio_atfork_child);
1034} 1602}
1035 1603
1036static void eio_api_destroy (eio_req *req) 1604static void eio_api_destroy (eio_req *req)
1037{ 1605{
1038 free (req); 1606 free (req);
… …
1043 \ 1611 \
1044 req = (eio_req *)calloc (1, sizeof *req); \ 1612 req = (eio_req *)calloc (1, sizeof *req); \
1045 if (!req) \ 1613 if (!req) \
1046 return 0; \ 1614 return 0; \
1047 \ 1615 \
1048 req->type = EIO_ ## rtype; \ 1616 req->type = rtype; \
1049 req->pri = EIO_DEFAULT_PRI + EIO_PRI_BIAS; \ 1617 req->pri = pri; \
1050 req->finish = cb; \ 1618 req->finish = cb; \
1619 req->data = data; \
1051 req->destroy = eio_api_destroy; 1620 req->destroy = eio_api_destroy;
1052 1621
1053#define SEND eio_submit (req); return req 1622#define SEND eio_submit (req); return req
1054 1623
1055#define PATH (void)0 1624#define PATH \
1625 req->flags |= EIO_FLAG_PTR1_FREE; \
1626 req->ptr1 = strdup (path); \
1627 if (!req->ptr1) \
1628 { \
1629 eio_api_destroy (req); \
1630 return 0; \
1631 }
1056 1632
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)
1756{
1757 REQ (EIO_NOP); SEND;
1758}
1759
1760eio_req *eio_busy (double delay, int pri, eio_cb cb, void *data)
1761{
1762 REQ (EIO_BUSY); req->nv1 = delay; SEND;
1763}
1764
1057eio_req *eio_fsync (int fd, eio_cb cb) 1765eio_req *eio_sync (int pri, eio_cb cb, void *data)
1058{ 1766{
1767 REQ (EIO_SYNC); SEND;
1768}
1769
1770eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data)
1771{
1059 REQ (FSYNC); req->int1 = fd; SEND; 1772 REQ (EIO_FSYNC); req->int1 = fd; SEND;
1060} 1773}
1061 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
1062eio_req *eio_fdatasync (int fd, eio_cb cb) 1800eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data)
1063{ 1801{
1064 REQ (FDATASYNC); req->int1 = fd; SEND; 1802 REQ (EIO_FDATASYNC); req->int1 = fd; SEND;
1065} 1803}
1066 1804
1805eio_req *eio_close (int fd, int pri, eio_cb cb, void *data)
1806{
1807 REQ (EIO_CLOSE); req->int1 = fd; SEND;
1808}
1809
1067eio_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)
1068{ 1811{
1069 REQ (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;
1070} 1813}
1071 1814
1072eio_req *eio_read (int fd, off_t offset, size_t length, void *data, eio_cb cb) 1815eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
1073{ 1816{
1074 REQ (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;
1075} 1818}
1076 1819
1077eio_req *eio_write (int fd, off_t offset, size_t length, void *data, eio_cb cb) 1820eio_req *eio_write (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
1078{ 1821{
1079 REQ (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;
1080} 1823}
1081 1824
1082eio_req *eio_fstat (int fd, eio_cb cb) 1825eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
1083{ 1826{
1084 REQ (FSTAT); req->int1 = fd; SEND; 1827 REQ (EIO_FSTAT); req->int1 = fd; SEND;
1085} 1828}
1086 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
1087eio_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)
1088{ 1836{
1089 REQ (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;
1090} 1838}
1091 1839
1092eio_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)
1093{ 1841{
1094 REQ (FTRUNCATE); req->int1 = fd; req->offs = offset; SEND; 1842 REQ (EIO_FTRUNCATE); req->int1 = fd; req->offs = offset; SEND;
1095} 1843}
1096 1844
1097eio_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)
1098{ 1846{
1099 REQ (FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND; 1847 REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND;
1100} 1848}
1101 1849
1102eio_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)
1103{ 1851{
1104 REQ (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;
1105} 1853}
1106 1854
1107eio_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)
1108{ 1856{
1109 REQ (DUP2); req->int1 = fd; req->int2 = fd2; SEND; 1857 REQ (EIO_DUP2); req->int1 = fd; req->int2 = fd2; SEND;
1110} 1858}
1111 1859
1112eio_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)
1113{ 1861{
1114 REQ (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;
1115} 1863}
1116 1864
1117eio_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)
1118{ 1866{
1119 REQ (OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND; 1867 REQ (EIO_OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND;
1120} 1868}
1121 1869
1122eio_req *eio_readlink (const char *path, eio_cb cb)
1123{
1124 REQ (READLINK); PATH; SEND;
1125}
1126
1127eio_req *eio_stat (const char *path, eio_cb cb)
1128{
1129 REQ (STAT); PATH; SEND;
1130}
1131
1132eio_req *eio_lstat (const char *path, eio_cb cb)
1133{
1134 REQ (LSTAT); PATH; SEND;
1135}
1136
1137eio_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)
1138{ 1871{
1139 REQ (UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND; 1872 REQ (EIO_UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND;
1140} 1873}
1141 1874
1142eio_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)
1143{ 1876{
1144 REQ (TRUNCATE); PATH; req->offs = offset; SEND; 1877 REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND;
1145} 1878}
1146 1879
1147eio_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)
1148{ 1881{
1149 REQ (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;
1150} 1883}
1151 1884
1152eio_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)
1153{ 1886{
1154 REQ (CHMOD); PATH; req->int2 = (long)mode; SEND; 1887 REQ (EIO_CHMOD); PATH; req->int2 = (long)mode; SEND;
1155} 1888}
1156 1889
1157eio_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)
1158{ 1891{
1159 REQ (MKDIR); PATH; req->int2 = (long)mode; SEND; 1892 REQ (EIO_MKDIR); PATH; req->int2 = (long)mode; SEND;
1160} 1893}
1161 1894
1162eio_req *eio_unlink (const char *path, eio_cb cb) 1895static eio_req *
1896eio__1path (int type, const char *path, int pri, eio_cb cb, void *data)
1163{ 1897{
1164 REQ (UNLINK); PATH; SEND;
1165}
1166
1167eio_req *eio_rmdir (const char *path, eio_cb cb)
1168{
1169 REQ (RMDIR); PATH; SEND; 1898 REQ (type); PATH; SEND;
1170} 1899}
1171 1900
1901eio_req *eio_readlink (const char *path, int pri, eio_cb cb, void *data)
1902{
1903 return eio__1path (EIO_READLINK, path, pri, cb, data);
1904}
1905
1906eio_req *eio_stat (const char *path, int pri, eio_cb cb, void *data)
1907{
1908 return eio__1path (EIO_STAT, path, pri, cb, data);
1909}
1910
1911eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data)
1912{
1913 return eio__1path (EIO_LSTAT, path, pri, cb, data);
1914}
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
1921eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data)
1922{
1923 return eio__1path (EIO_UNLINK, path, pri, cb, data);
1924}
1925
1172eio_req *eio_readdir (const char *path, eio_cb cb) 1926eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
1173{ 1927{
1174 REQ (READDIR); PATH; SEND; 1928 return eio__1path (EIO_RMDIR, path, pri, cb, data);
1175} 1929}
1176 1930
1931eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data)
1932{
1933 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
1934}
1935
1177eio_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)
1178{ 1937{
1179 REQ (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;
1180} 1939}
1181 1940
1182eio_req *eio_busy (double delay, eio_cb cb) 1941static eio_req *
1942eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1183{ 1943{
1184 REQ (BUSY); req->nv1 = delay; SEND; 1944 REQ (type); PATH;
1185}
1186 1945
1946 req->flags |= EIO_FLAG_PTR2_FREE;
1947 req->ptr2 = strdup (new_path);
1948 if (!req->ptr2)
1949 {
1950 eio_api_destroy (req);
1951 return 0;
1952 }
1953
1954 SEND;
1955}
1956
1957eio_req *eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1958{
1959 return eio__2path (EIO_LINK, path, new_path, pri, cb, data);
1960}
1961
1962eio_req *eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1963{
1964 return eio__2path (EIO_SYMLINK, path, new_path, pri, cb, data);
1965}
1966
1967eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1968{
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
1187eio_req *eio_nop (eio_cb cb) 1979eio_req *eio_grp (eio_cb cb, void *data)
1188{ 1980{
1981 const int pri = EIO_PRI_MAX;
1982
1189 REQ (NOP); SEND; 1983 REQ (EIO_GROUP); SEND;
1190} 1984}
1191 1985
1192#undef REQ 1986#undef REQ
1193#undef PATH 1987#undef PATH
1194#undef SEND 1988#undef SEND
1195 1989
1196#if 0 1990/*****************************************************************************/
1197 1991/* grp functions */
1198void
1199aio_open (SV8 *pathname, int flags, int mode, SV *callback=&PL_sv_undef)
1200 PROTOTYPE: $$$;$
1201 PPCODE:
1202{
1203 dREQ;
1204
1205 req->type = EIO_OPEN;
1206 req->sv1 = newSVsv (pathname);
1207 req->ptr1 = SvPVbyte_nolen (req->sv1);
1208 req->int1 = flags;
1209 req->int2 = mode;
1210
1211 EIO_SEND;
1212}
1213
1214void
1215aio_fsync (SV *fh, SV *callback=&PL_sv_undef)
1216 PROTOTYPE: $;$
1217 ALIAS:
1218 aio_fsync = EIO_FSYNC
1219 aio_fdatasync = EIO_FDATASYNC
1220 PPCODE:
1221{
1222 dREQ;
1223
1224 req->type = ix;
1225 req->sv1 = newSVsv (fh);
1226 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh)));
1227
1228 EIO_SEND (req);
1229}
1230
1231void
1232aio_close (SV *fh, SV *callback=&PL_sv_undef)
1233 PROTOTYPE: $;$
1234 PPCODE:
1235{
1236 dREQ;
1237
1238 req->type = EIO_CLOSE;
1239 req->sv1 = newSVsv (fh);
1240 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh)));
1241
1242 EIO_SEND (req);
1243}
1244
1245void
1246aio_read (SV *fh, SV *offset, SV *length, SV8 *data, IV dataoffset, SV *callback=&PL_sv_undef)
1247 ALIAS:
1248 aio_read = EIO_READ
1249 aio_write = EIO_WRITE
1250 PROTOTYPE: $$$$$;$
1251 PPCODE:
1252{
1253 STRLEN svlen;
1254 char *svptr = SvPVbyte (data, svlen);
1255 UV len = SvUV (length);
1256
1257 SvUPGRADE (data, SVt_PV);
1258 SvPOK_on (data);
1259
1260 if (dataoffset < 0)
1261 dataoffset += svlen;
1262
1263 if (dataoffset < 0 || dataoffset > svlen)
1264 croak ("dataoffset outside of data scalar");
1265
1266 if (ix == EIO_WRITE)
1267 {
1268 /* write: check length and adjust. */
1269 if (!SvOK (length) || len + dataoffset > svlen)
1270 len = svlen - dataoffset;
1271 }
1272 else
1273 {
1274 /* read: grow scalar as necessary */
1275 svptr = SvGROW (data, len + dataoffset + 1);
1276 }
1277
1278 if (len < 0)
1279 croak ("length must not be negative");
1280
1281 {
1282 dREQ;
1283
1284 req->type = ix;
1285 req->sv1 = newSVsv (fh);
1286 req->int1 = PerlIO_fileno (ix == EIO_READ ? IoIFP (sv_2io (fh))
1287 : IoOFP (sv_2io (fh)));
1288 req->offs = SvOK (offset) ? SvVAL64 (offset) : -1;
1289 req->size = len;
1290 req->sv2 = SvREFCNT_inc (data);
1291 req->ptr2 = (char *)svptr + dataoffset;
1292 req->stroffset = dataoffset;
1293
1294 if (!SvREADONLY (data))
1295 {
1296 SvREADONLY_on (data);
1297 req->flags |= FLAG_SV2_RO_OFF;
1298 }
1299
1300 EIO_SEND;
1301 }
1302}
1303
1304void
1305aio_readlink (SV8 *path, SV *callback=&PL_sv_undef)
1306 PROTOTYPE: $$;$
1307 PPCODE:
1308{
1309 SV *data;
1310 dREQ;
1311
1312 data = newSV (NAME_MAX);
1313 SvPOK_on (data);
1314
1315 req->type = EIO_READLINK;
1316 req->sv1 = newSVsv (path);
1317 req->ptr1 = SvPVbyte_nolen (req->sv1);
1318 req->sv2 = data;
1319 req->ptr2 = SvPVbyte_nolen (data);
1320
1321 EIO_SEND;
1322}
1323
1324void
1325aio_sendfile (SV *out_fh, SV *in_fh, SV *in_offset, UV length, SV *callback=&PL_sv_undef)
1326 PROTOTYPE: $$$$;$
1327 PPCODE:
1328{
1329 dREQ;
1330
1331 req->type = EIO_SENDFILE;
1332 req->sv1 = newSVsv (out_fh);
1333 req->int1 = PerlIO_fileno (IoIFP (sv_2io (out_fh)));
1334 req->sv2 = newSVsv (in_fh);
1335 req->int2 = PerlIO_fileno (IoIFP (sv_2io (in_fh)));
1336 req->offs = SvVAL64 (in_offset);
1337 req->size = length;
1338
1339 EIO_SEND;
1340}
1341
1342void
1343aio_readahead (SV *fh, SV *offset, IV length, SV *callback=&PL_sv_undef)
1344 PROTOTYPE: $$$;$
1345 PPCODE:
1346{
1347 dREQ;
1348
1349 req->type = EIO_READAHEAD;
1350 req->sv1 = newSVsv (fh);
1351 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh)));
1352 req->offs = SvVAL64 (offset);
1353 req->size = length;
1354
1355 EIO_SEND;
1356}
1357
1358void
1359aio_stat (SV8 *fh_or_path, SV *callback=&PL_sv_undef)
1360 ALIAS:
1361 aio_stat = EIO_STAT
1362 aio_lstat = EIO_LSTAT
1363 PPCODE:
1364{
1365 dREQ;
1366
1367 req->ptr2 = malloc (sizeof (EIO_STRUCT_STAT));
1368 if (!req->ptr2)
1369 {
1370 req_destroy (req);
1371 croak ("out of memory during aio_stat statdata allocation");
1372 }
1373
1374 req->flags |= FLAG_PTR2_FREE;
1375 req->sv1 = newSVsv (fh_or_path);
1376
1377 if (SvPOK (fh_or_path))
1378 {
1379 req->type = ix;
1380 req->ptr1 = SvPVbyte_nolen (req->sv1);
1381 }
1382 else
1383 {
1384 req->type = EIO_FSTAT;
1385 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path)));
1386 }
1387
1388 EIO_SEND;
1389}
1390
1391void
1392aio_utime (SV8 *fh_or_path, SV *atime, SV *mtime, SV *callback=&PL_sv_undef)
1393 PPCODE:
1394{
1395 dREQ;
1396
1397 req->nv1 = SvOK (atime) ? SvNV (atime) : -1.;
1398 req->nv2 = SvOK (mtime) ? SvNV (mtime) : -1.;
1399 req->sv1 = newSVsv (fh_or_path);
1400
1401 if (SvPOK (fh_or_path))
1402 {
1403 req->type = EIO_UTIME;
1404 req->ptr1 = SvPVbyte_nolen (req->sv1);
1405 }
1406 else
1407 {
1408 req->type = EIO_FUTIME;
1409 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path)));
1410 }
1411
1412 EIO_SEND;
1413}
1414
1415void
1416aio_truncate (SV8 *fh_or_path, SV *offset, SV *callback=&PL_sv_undef)
1417 PPCODE:
1418{
1419 dREQ;
1420
1421 req->sv1 = newSVsv (fh_or_path);
1422 req->offs = SvOK (offset) ? SvVAL64 (offset) : -1;
1423
1424 if (SvPOK (fh_or_path))
1425 {
1426 req->type = EIO_TRUNCATE;
1427 req->ptr1 = SvPVbyte_nolen (req->sv1);
1428 }
1429 else
1430 {
1431 req->type = EIO_FTRUNCATE;
1432 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path)));
1433 }
1434
1435 EIO_SEND;
1436}
1437
1438void
1439aio_chmod (SV8 *fh_or_path, int mode, SV *callback=&PL_sv_undef)
1440 ALIAS:
1441 aio_chmod = EIO_CHMOD
1442 aio_fchmod = EIO_FCHMOD
1443 aio_mkdir = EIO_MKDIR
1444 PPCODE:
1445{
1446 dREQ;
1447
1448 req->type = type;
1449 req->int2 = mode;
1450 req->sv1 = newSVsv (fh_or_path);
1451
1452 if (ix == EIO_FCHMOD)
1453 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path)));
1454 else
1455 req->ptr1 = SvPVbyte_nolen (req->sv1);
1456
1457 EIO_SEND;
1458}
1459
1460void
1461aio_chown (SV8 *fh_or_path, SV *uid, SV *gid, SV *callback=&PL_sv_undef)
1462 PPCODE:
1463{
1464 dREQ;
1465
1466 req->int2 = SvOK (uid) ? SvIV (uid) : -1;
1467 req->int3 = SvOK (gid) ? SvIV (gid) : -1;
1468 req->sv1 = newSVsv (fh_or_path);
1469
1470 if (SvPOK (fh_or_path))
1471 {
1472 req->type = EIO_CHOWN;
1473 req->ptr1 = SvPVbyte_nolen (req->sv1);
1474 }
1475 else
1476 {
1477 req->type = EIO_FCHOWN;
1478 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path)));
1479 }
1480
1481 EIO_SEND;
1482}
1483
1484void
1485aio_unlink (SV8 *pathname, SV *callback=&PL_sv_undef)
1486 ALIAS:
1487 aio_unlink = EIO_UNLINK
1488 aio_rmdir = EIO_RMDIR
1489 aio_readdir = EIO_READDIR
1490 PPCODE:
1491{
1492 dREQ;
1493
1494 req->type = ix;
1495 req->sv1 = newSVsv (pathname);
1496 req->ptr1 = SvPVbyte_nolen (req->sv1);
1497
1498 EIO_SEND;
1499}
1500
1501void
1502aio_link (SV8 *oldpath, SV8 *newpath, SV *callback=&PL_sv_undef)
1503 ALIAS:
1504 aio_link = EIO_LINK
1505 aio_symlink = EIO_SYMLINK
1506 aio_rename = EIO_RENAME
1507 PPCODE:
1508{
1509 dREQ;
1510
1511 req->type = ix;
1512 req->sv1 = newSVsv (oldpath);
1513 req->ptr1 = SvPVbyte_nolen (req->sv1);
1514 req->sv2 = newSVsv (newpath);
1515 req->ptr2 = SvPVbyte_nolen (req->sv2);
1516
1517 EIO_SEND;
1518}
1519
1520void
1521aio_mknod (SV8 *pathname, int mode, UV dev, SV *callback=&PL_sv_undef)
1522 PPCODE:
1523{
1524 dREQ;
1525
1526 req->type = EIO_MKNOD;
1527 req->sv1 = newSVsv (pathname);
1528 req->ptr1 = SvPVbyte_nolen (req->sv1);
1529 req->int2 = (mode_t)mode;
1530 req->offs = dev;
1531
1532 EIO_SEND;
1533}
1534
1535void
1536aio_busy (double delay, SV *callback=&PL_sv_undef)
1537 PPCODE:
1538{
1539 dREQ;
1540
1541 req->type = EIO_BUSY;
1542 req->nv1 = delay < 0. ? 0. : delay;
1543
1544 EIO_SEND;
1545}
1546
1547void
1548aio_group (SV *callback=&PL_sv_undef)
1549 PROTOTYPE: ;$
1550 PPCODE:
1551{
1552 dREQ;
1553
1554 req->type = EIO_GROUP;
1555
1556 req_send (req);
1557 XPUSHs (req_sv (req, AIO_GRP_KLASS));
1558}
1559
1560void
1561aio_nop (SV *callback=&PL_sv_undef)
1562 ALIAS:
1563 aio_nop = EIO_NOP
1564 aio_sync = EIO_SYNC
1565 PPCODE:
1566{
1567 dREQ;
1568
1569#endif
1570 1992
1571void eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit) 1993void eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit)
1572{ 1994{
1573 grp->int2 = limit; 1995 grp->int2 = limit;
1574 grp->feed = feed; 1996 grp->feed = feed;
… …
1585 2007
1586void eio_grp_add (eio_req *grp, eio_req *req) 2008void eio_grp_add (eio_req *grp, eio_req *req)
1587{ 2009{
1588 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));
1589 2011
2012 grp->flags |= EIO_FLAG_GROUPADD;
2013
1590 ++grp->size; 2014 ++grp->size;
1591 req->grp = grp; 2015 req->grp = grp;
1592 2016
1593 req->grp_prev = 0; 2017 req->grp_prev = 0;
1594 req->grp_next = grp->grp_first; 2018 req->grp_next = grp->grp_first;
… …
1597 grp->grp_first->grp_prev = req; 2021 grp->grp_first->grp_prev = req;
1598 2022
1599 grp->grp_first = req; 2023 grp->grp_first = req;
1600} 2024}
1601 2025
2026/*****************************************************************************/
2027/* misc garbage */
1602 2028
2029ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
2030{
2031 etp_worker wrk;
2032 ssize_t ret;
2033
2034 wrk.dbuf = 0;
2035
2036 ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
2037
2038 if (wrk.dbuf)
2039 free (wrk.dbuf);
2040
2041 return ret;
2042}
2043

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines