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

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

Diff Legend

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