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

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

Diff Legend

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