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

Comparing libeio/eio.c (file contents):
Revision 1.8 by root, Sun May 11 20:08:37 2008 UTC vs.
Revision 1.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#include <stddef.h> 48#include <stddef.h>
6#include <stdlib.h> 49#include <stdlib.h>
… …
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_PTR1_FREE) free (req->ptr1);
277 if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
278
279 EIO_DESTROY (req);
280}
281
282static int eio_finish (eio_req *req)
283{
284 int res = EIO_FINISH (req);
285
286 if (req->grp)
287 {
288 int res2;
289 eio_req *grp = req->grp;
290
291 /* unlink request */
292 if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
293 if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
294
295 if (grp->grp_first == req)
296 grp->grp_first = req->grp_next;
297
298 res2 = grp_dec (grp);
299
300 if (!res && res2)
301 res = res2;
302 }
303
304 eio_destroy (req);
305
306 return res;
307}
308
309void eio_grp_cancel (eio_req *grp)
310{
311 for (grp = grp->grp_first; grp; grp = grp->grp_next)
312 eio_cancel (grp);
313}
314
315void eio_cancel (eio_req *req)
316{
317 X_LOCK (wrklock);
318 req->flags |= EIO_FLAG_CANCELLED;
319 X_UNLOCK (wrklock);
320
321 eio_grp_cancel (req);
322}
323
324X_THREAD_PROC (eio_proc); 433X_THREAD_PROC (etp_proc);
325 434
326static void start_thread (void) 435static void etp_start_thread (void)
327{ 436{
328 worker *wrk = calloc (1, sizeof (worker)); 437 etp_worker *wrk = calloc (1, sizeof (etp_worker));
329 438
330 /*TODO*/ 439 /*TODO*/
331 assert (("unable to allocate worker thread data", !wrk)); 440 assert (("unable to allocate worker thread data", wrk));
332 441
333 X_LOCK (wrklock); 442 X_LOCK (wrklock);
334 443
335 if (thread_create (&wrk->tid, eio_proc, (void *)wrk)) 444 if (thread_create (&wrk->tid, etp_proc, (void *)wrk))
336 { 445 {
337 wrk->prev = &wrk_first; 446 wrk->prev = &wrk_first;
338 wrk->next = wrk_first.next; 447 wrk->next = wrk_first.next;
339 wrk_first.next->prev = wrk; 448 wrk_first.next->prev = wrk;
340 wrk_first.next = wrk; 449 wrk_first.next = wrk;
… …
344 free (wrk); 453 free (wrk);
345 454
346 X_UNLOCK (wrklock); 455 X_UNLOCK (wrklock);
347} 456}
348 457
349static void maybe_start_thread (void) 458static void etp_maybe_start_thread (void)
350{ 459{
351 if (eio_nthreads () >= wanted) 460 if (expect_true (etp_nthreads () >= wanted))
352 return; 461 return;
353 462
354 /* todo: maybe use idle here, but might be less exact */ 463 /* todo: maybe use idle here, but might be less exact */
355 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 ()))
356 return; 465 return;
357 466
358 start_thread (); 467 etp_start_thread ();
359} 468}
360 469
361void eio_submit (eio_req *req)
362{
363 ++nreqs;
364
365 X_LOCK (reqlock);
366 ++nready;
367 reqq_push (&req_queue, req);
368 X_COND_SIGNAL (reqwait);
369 X_UNLOCK (reqlock);
370
371 maybe_start_thread ();
372}
373
374static void end_thread (void) 470static void etp_end_thread (void)
375{ 471{
376 eio_req *req = calloc (1, sizeof (eio_req)); 472 eio_req *req = calloc (1, sizeof (eio_req));
377 473
378 req->type = EIO_QUIT; 474 req->type = -1;
379 req->pri = EIO_PRI_MAX + EIO_PRI_BIAS; 475 req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
380 476
381 X_LOCK (reqlock); 477 X_LOCK (reqlock);
382 reqq_push (&req_queue, req); 478 reqq_push (&req_queue, req);
383 X_COND_SIGNAL (reqwait); 479 X_COND_SIGNAL (reqwait);
384 X_UNLOCK (reqlock); 480 X_UNLOCK (reqlock);
… …
386 X_LOCK (wrklock); 482 X_LOCK (wrklock);
387 --started; 483 --started;
388 X_UNLOCK (wrklock); 484 X_UNLOCK (wrklock);
389} 485}
390 486
391void eio_set_max_poll_time (double nseconds)
392{
393 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
394 max_poll_time = nseconds;
395 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
396}
397
398void eio_set_max_poll_reqs (unsigned int maxreqs)
399{
400 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
401 max_poll_reqs = maxreqs;
402 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
403}
404
405void eio_set_max_idle (unsigned int nthreads)
406{
407 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
408 max_idle = nthreads <= 0 ? 1 : nthreads;
409 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
410}
411
412void eio_set_min_parallel (unsigned int nthreads)
413{
414 if (wanted < nthreads)
415 wanted = nthreads;
416}
417
418void eio_set_max_parallel (unsigned int nthreads)
419{
420 if (wanted > nthreads)
421 wanted = nthreads;
422
423 while (started > wanted)
424 end_thread ();
425}
426
427int eio_poll (void) 487static int etp_poll (void)
428{ 488{
429 int maxreqs = max_poll_reqs; 489 unsigned int maxreqs;
490 unsigned int maxtime;
430 struct timeval tv_start, tv_now; 491 struct timeval tv_start, tv_now;
431 eio_req *req;
432 492
493 X_LOCK (reslock);
494 maxreqs = max_poll_reqs;
495 maxtime = max_poll_time;
496 X_UNLOCK (reslock);
497
433 if (max_poll_time) 498 if (maxtime)
434 gettimeofday (&tv_start, 0); 499 gettimeofday (&tv_start, 0);
435 500
436 for (;;) 501 for (;;)
437 { 502 {
503 ETP_REQ *req;
504
438 maybe_start_thread (); 505 etp_maybe_start_thread ();
439 506
440 X_LOCK (reslock); 507 X_LOCK (reslock);
441 req = reqq_shift (&res_queue); 508 req = reqq_shift (&res_queue);
442 509
443 if (req) 510 if (req)
… …
451 X_UNLOCK (reslock); 518 X_UNLOCK (reslock);
452 519
453 if (!req) 520 if (!req)
454 return 0; 521 return 0;
455 522
523 X_LOCK (reqlock);
456 --nreqs; 524 --nreqs;
525 X_UNLOCK (reqlock);
457 526
458 if (req->type == EIO_GROUP && req->size) 527 if (expect_false (req->type == EIO_GROUP && req->size))
459 { 528 {
460 req->int1 = 1; /* mark request as delayed */ 529 req->int1 = 1; /* mark request as delayed */
461 continue; 530 continue;
462 } 531 }
463 else 532 else
464 { 533 {
465 int res = eio_finish (req); 534 int res = ETP_FINISH (req);
466 if (res) 535 if (expect_false (res))
467 return res; 536 return res;
468 } 537 }
469 538
470 if (maxreqs && !--maxreqs) 539 if (expect_false (maxreqs && !--maxreqs))
471 break; 540 break;
472 541
473 if (max_poll_time) 542 if (maxtime)
474 { 543 {
475 gettimeofday (&tv_now, 0); 544 gettimeofday (&tv_now, 0);
476 545
477 if (tvdiff (&tv_start, &tv_now) >= max_poll_time) 546 if (tvdiff (&tv_start, &tv_now) >= maxtime)
478 break; 547 break;
479 } 548 }
480 } 549 }
481 550
482 errno = EAGAIN; 551 errno = EAGAIN;
483 return -1; 552 return -1;
484} 553}
485 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
486/*****************************************************************************/ 770/*****************************************************************************/
487/* work around various missing functions */ 771/* work around various missing functions */
488 772
489#if !HAVE_PREADWRITE 773#if !HAVE_PREADWRITE
774# undef pread
775# undef pwrite
490# define pread aio_pread 776# define pread eio__pread
491# define pwrite aio_pwrite 777# define pwrite eio__pwrite
492 778
493/* 779static ssize_t
494 * make our pread/pwrite safe against themselves, but not against 780eio__pread (int fd, void *buf, size_t count, off_t offset)
495 * normal read/write by using a mutex. slows down execution a lot,
496 * but that's your problem, not mine.
497 */
498static mutex_t preadwritelock = X_MUTEX_INIT;
499
500static ssize_t pread (int fd, void *buf, size_t count, off_t offset)
501{ 781{
502 ssize_t res; 782 ssize_t res;
503 off_t ooffset; 783 off_t ooffset;
504 784
505 X_LOCK (preadwritelock); 785 X_LOCK (preadwritelock);
… …
510 X_UNLOCK (preadwritelock); 790 X_UNLOCK (preadwritelock);
511 791
512 return res; 792 return res;
513} 793}
514 794
515static 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)
516{ 797{
517 ssize_t res; 798 ssize_t res;
518 off_t ooffset; 799 off_t ooffset;
519 800
520 X_LOCK (preadwritelock); 801 X_LOCK (preadwritelock);
521 ooffset = lseek (fd, 0, SEEK_CUR); 802 ooffset = lseek (fd, 0, SEEK_CUR);
522 lseek (fd, offset, SEEK_SET); 803 lseek (fd, offset, SEEK_SET);
523 res = write (fd, buf, count); 804 res = write (fd, buf, count);
524 lseek (fd, offset, SEEK_SET); 805 lseek (fd, ooffset, SEEK_SET);
525 X_UNLOCK (preadwritelock); 806 X_UNLOCK (preadwritelock);
526 807
527 return res; 808 return res;
528} 809}
529#endif 810#endif
530 811
531#ifndef HAVE_FUTIMES 812#ifndef HAVE_FUTIMES
532 813
814# undef utimes
815# undef futimes
533# define utimes(path,times) aio_utimes (path, times) 816# define utimes(path,times) eio__utimes (path, times)
534# define futimes(fd,times) aio_futimes (fd, times) 817# define futimes(fd,times) eio__futimes (fd, times)
535 818
819static int
536static int aio_utimes (const char *filename, const struct timeval times[2]) 820eio__utimes (const char *filename, const struct timeval times[2])
537{ 821{
538 if (times) 822 if (times)
539 { 823 {
540 struct utimbuf buf; 824 struct utimbuf buf;
541 825
… …
546 } 830 }
547 else 831 else
548 return utime (filename, 0); 832 return utime (filename, 0);
549} 833}
550 834
551static int aio_futimes (int fd, const struct timeval tv[2]) 835static int eio__futimes (int fd, const struct timeval tv[2])
552{ 836{
553 errno = ENOSYS; 837 errno = ENOSYS;
554 return -1; 838 return -1;
555} 839}
556 840
557#endif 841#endif
558 842
559#if !HAVE_FDATASYNC 843#if !HAVE_FDATASYNC
844# undef fdatasync
560# define fdatasync fsync 845# define fdatasync(fd) fsync (fd)
561#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}
562 875
563#if !HAVE_READAHEAD 876#if !HAVE_READAHEAD
877# undef readahead
564# define readahead(fd,offset,count) aio_readahead (fd, offset, count, self) 878# define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)
565 879
880static ssize_t
566static 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)
567{ 882{
568 size_t todo = count; 883 size_t todo = count;
569 dBUF; 884 dBUF;
570 885
571 while (todo > 0) 886 while (todo > 0)
… …
581 return count; 896 return count;
582} 897}
583 898
584#endif 899#endif
585 900
586#if !HAVE_READDIR_R
587# define readdir_r aio_readdir_r
588
589static mutex_t readdirlock = X_MUTEX_INIT;
590
591static int readdir_r (DIR *dirp, EIO_STRUCT_DIRENT *ent, EIO_STRUCT_DIRENT **res)
592{
593 EIO_STRUCT_DIRENT *e;
594 int errorno;
595
596 X_LOCK (readdirlock);
597
598 e = readdir (dirp);
599 errorno = errno;
600
601 if (e)
602 {
603 *res = ent;
604 strcpy (ent->d_name, e->d_name);
605 }
606 else
607 *res = 0;
608
609 X_UNLOCK (readdirlock);
610
611 errno = errorno;
612 return e ? 0 : -1;
613}
614#endif
615
616/* sendfile always needs emulation */ 901/* sendfile always needs emulation */
902static ssize_t
617static 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)
618{ 904{
619 ssize_t res; 905 ssize_t res;
620 906
621 if (!count) 907 if (!count)
622 return 0; 908 return 0;
623 909
624#if HAVE_SENDFILE 910#if HAVE_SENDFILE
625# if __linux 911# if __linux
626 res = sendfile (ofd, ifd, &offset, count); 912 res = sendfile (ofd, ifd, &offset, count);
627 913
628# elif __freebsd 914# elif __FreeBSD__
629 /* 915 /*
630 * 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
631 * wasted on making it similar to other I/O functions. 917 * wasted on making it similar to other I/O functions.
632 */ 918 */
633 { 919 {
634 off_t sbytes; 920 off_t sbytes;
635 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); 921 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
636 922
923 /* freebsd' sendfile will return 0 when success */
637 if (res < 0 && sbytes) 924 if (res == 0 && sbytes)
638 /* 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)
639 res = sbytes; 936 res = sbytes;
640 } 937 }
641 938
642# elif __hpux 939# elif __hpux
643 res = sendfile (ofd, ifd, offset, count, 0, 0); 940 res = sendfile (ofd, ifd, offset, count, 0, 0);
… …
657 if (res < 0 && sbytes) 954 if (res < 0 && sbytes)
658 res = sbytes; 955 res = sbytes;
659 } 956 }
660 957
661# 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
662#else 969#else
663 res = -1; 970 res = -1;
664 errno = ENOSYS; 971 errno = ENOSYS;
665#endif 972#endif
666 973
667 if (res < 0 974 if (res < 0
668 && (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 */
669#if __solaris 981#if __solaris
670 || errno == EAFNOSUPPORT || errno == EPROTOTYPE 982 || errno == EAFNOSUPPORT || errno == EPROTOTYPE
671#endif 983#endif
672 ) 984 )
673 ) 985 )
… …
704 } 1016 }
705 1017
706 return res; 1018 return res;
707} 1019}
708 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
709/* read a full directory */ 1184/* read a full directory */
1185static void
710static void scandir_ (eio_req *req, worker *self) 1186eio__scandir (eio_req *req, etp_worker *self)
711{ 1187{
712 DIR *dirp; 1188 DIR *dirp;
713 union
714 {
715 EIO_STRUCT_DIRENT d;
716 char b [offsetof (EIO_STRUCT_DIRENT, d_name) + NAME_MAX + 1];
717 } *u;
718 EIO_STRUCT_DIRENT *entp; 1189 EIO_STRUCT_DIRENT *entp;
719 char *name, *names; 1190 char *name, *names;
720 int memlen = 4096; 1191 int namesalloc = 4096;
721 int memofs = 0; 1192 int namesoffs = 0;
1193 int flags = req->int1;
1194 eio_dirent *dents = 0;
1195 int dentalloc = 128;
722 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);
723 1203
724 X_LOCK (wrklock); 1204 X_LOCK (wrklock);
1205 /* the corresponding closedir is in ETP_WORKER_CLEAR */
725 self->dirp = dirp = opendir (req->ptr1); 1206 self->dirp = dirp = opendir (req->ptr1);
726 self->dbuf = u = malloc (sizeof (*u));
727 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;
728 req->ptr2 = names = malloc (memlen); 1209 req->ptr2 = names = malloc (namesalloc);
729 X_UNLOCK (wrklock); 1210 X_UNLOCK (wrklock);
730 1211
731 if (dirp && u && names) 1212 if (dirp && names && (!flags || dents))
732 for (;;) 1213 for (;;)
733 { 1214 {
734 errno = 0; 1215 errno = 0;
735 readdir_r (dirp, &u->d, &entp); 1216 entp = readdir (dirp);
736 1217
737 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
738 break; 1257 break;
1258 }
739 1259
1260 /* now add the entry to our list(s) */
740 name = entp->d_name; 1261 name = entp->d_name;
741 1262
1263 /* skip . and .. entries */
742 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) 1264 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
743 { 1265 {
744 int len = strlen (name) + 1; 1266 int len = D_NAMLEN (entp) + 1;
745 1267
746 res++; 1268 while (expect_false (namesoffs + len > namesalloc))
747
748 while (memofs + len > memlen)
749 { 1269 {
750 memlen *= 2; 1270 namesalloc *= 2;
751 X_LOCK (wrklock); 1271 X_LOCK (wrklock);
752 req->ptr2 = names = realloc (names, memlen); 1272 req->ptr2 = names = realloc (names, namesalloc);
753 X_UNLOCK (wrklock); 1273 X_UNLOCK (wrklock);
754 1274
755 if (!names) 1275 if (!names)
756 break; 1276 break;
757 } 1277 }
758 1278
759 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
760 memofs += len; 1371 namesoffs += len;
1372 ++dentoffs;
1373 }
1374
1375 if (EIO_CANCELLED (req))
1376 {
1377 errno = ECANCELED;
1378 break;
761 } 1379 }
762 } 1380 }
1381}
763 1382
764 if (errno) 1383#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
765 res = -1; 1384# define eio__msync(a,b,c) ((errno = ENOSYS), -1)
766 1385#else
767 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;
768} 1429}
769 1430
770/*****************************************************************************/ 1431/*****************************************************************************/
771 1432
772#define ALLOC(len) \ 1433#define ALLOC(len) \
… …
782 req->result = -1; \ 1443 req->result = -1; \
783 break; \ 1444 break; \
784 } \ 1445 } \
785 } 1446 }
786 1447
787X_THREAD_PROC (eio_proc) 1448X_THREAD_PROC (etp_proc)
788{ 1449{
789 eio_req *req; 1450 ETP_REQ *req;
790 struct timespec ts; 1451 struct timespec ts;
791 worker *self = (worker *)thr_arg; 1452 etp_worker *self = (etp_worker *)thr_arg;
792 1453
793 /* try to distribute timeouts somewhat randomly */ 1454 /* try to distribute timeouts somewhat randomly */
794 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); 1455 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
795 1456
796 for (;;) 1457 for (;;)
797 { 1458 {
798 ts.tv_sec = time (0) + IDLE_TIMEOUT;
799
800 X_LOCK (reqlock); 1459 X_LOCK (reqlock);
801 1460
802 for (;;) 1461 for (;;)
803 { 1462 {
804 self->req = req = reqq_shift (&req_queue); 1463 self->req = req = reqq_shift (&req_queue);
… …
806 if (req) 1465 if (req)
807 break; 1466 break;
808 1467
809 ++idle; 1468 ++idle;
810 1469
1470 ts.tv_sec = time (0) + IDLE_TIMEOUT;
811 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) 1471 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
812 { 1472 {
813 if (idle > max_idle) 1473 if (idle > max_idle)
814 { 1474 {
815 --idle; 1475 --idle;
… …
820 goto quit; 1480 goto quit;
821 } 1481 }
822 1482
823 /* we are allowed to idle, so do so without any timeout */ 1483 /* we are allowed to idle, so do so without any timeout */
824 X_COND_WAIT (reqwait, reqlock); 1484 X_COND_WAIT (reqwait, reqlock);
825 ts.tv_sec = time (0) + IDLE_TIMEOUT;
826 } 1485 }
827 1486
828 --idle; 1487 --idle;
829 } 1488 }
830 1489
831 --nready; 1490 --nready;
832 1491
833 X_UNLOCK (reqlock); 1492 X_UNLOCK (reqlock);
834 1493
835 errno = 0; /* strictly unnecessary */ 1494 if (req->type < 0)
1495 goto quit;
836 1496
837 if (!EIO_CANCELLED (req)) 1497 if (!EIO_CANCELLED (req))
838 switch (req->type) 1498 ETP_EXECUTE (self, req);
839 {
840 case EIO_READ: ALLOC (req->size);
841 req->result = req->offs >= 0
842 ? pread (req->int1, req->ptr2, req->size, req->offs)
843 : read (req->int1, req->ptr2, req->size); break;
844 case EIO_WRITE: req->result = req->offs >= 0
845 ? pwrite (req->int1, req->ptr2, req->size, req->offs)
846 : write (req->int1, req->ptr2, req->size); break;
847
848 case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
849 case EIO_SENDFILE: req->result = sendfile_ (req->int1, req->int2, req->offs, req->size, self); break;
850
851 case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
852 req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
853 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
854 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
855 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
856 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
857
858 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
859 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
860 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
861 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
862 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
863 case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
864
865 case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
866 case EIO_CLOSE: req->result = close (req->int1); break;
867 case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
868 case EIO_UNLINK: req->result = unlink (req->ptr1); break;
869 case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
870 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
871 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
872 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
873 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
874 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
875
876 case EIO_READLINK: ALLOC (NAME_MAX);
877 req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break;
878
879 case EIO_SYNC: req->result = 0; sync (); break;
880 case EIO_FSYNC: req->result = fsync (req->int1); break;
881 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
882
883 case EIO_READDIR: scandir_ (req, self); break;
884
885 case EIO_BUSY:
886#ifdef _WIN32
887 Sleep (req->nv1 * 1000.);
888#else
889 {
890 struct timeval tv;
891
892 tv.tv_sec = req->nv1;
893 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.;
894
895 req->result = select (0, 0, 0, 0, &tv);
896 }
897#endif
898 break;
899
900 case EIO_UTIME:
901 case EIO_FUTIME:
902 {
903 struct timeval tv[2];
904 struct timeval *times;
905
906 if (req->nv1 != -1. || req->nv2 != -1.)
907 {
908 tv[0].tv_sec = req->nv1;
909 tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
910 tv[1].tv_sec = req->nv2;
911 tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
912
913 times = tv;
914 }
915 else
916 times = 0;
917
918
919 req->result = req->type == EIO_FUTIME
920 ? futimes (req->int1, times)
921 : utimes (req->ptr1, times);
922 }
923
924 case EIO_GROUP:
925 case EIO_NOP:
926 break;
927
928 case EIO_QUIT:
929 goto quit;
930
931 default:
932 req->result = -1;
933 break;
934 }
935
936 req->errorno = errno;
937 1499
938 X_LOCK (reslock); 1500 X_LOCK (reslock);
939 1501
940 ++npending; 1502 ++npending;
941 1503
942 if (!reqq_push (&res_queue, req) && want_poll_cb) 1504 if (!reqq_push (&res_queue, req) && want_poll_cb)
943 want_poll_cb (); 1505 want_poll_cb ();
944 1506
945 self->req = 0; 1507 self->req = 0;
946 worker_clear (self); 1508 etp_worker_clear (self);
947 1509
948 X_UNLOCK (reslock); 1510 X_UNLOCK (reslock);
949 } 1511 }
950 1512
951quit: 1513quit:
952 X_LOCK (wrklock); 1514 X_LOCK (wrklock);
953 worker_free (self); 1515 etp_worker_free (self);
954 X_UNLOCK (wrklock); 1516 X_UNLOCK (wrklock);
955 1517
956 return 0; 1518 return 0;
957} 1519}
958 1520
959/*****************************************************************************/ 1521/*****************************************************************************/
960 1522
961static void eio_atfork_prepare (void)
962{
963 X_LOCK (wrklock);
964 X_LOCK (reqlock);
965 X_LOCK (reslock);
966#if !HAVE_PREADWRITE
967 X_LOCK (preadwritelock);
968#endif
969#if !HAVE_READDIR_R
970 X_LOCK (readdirlock);
971#endif
972}
973
974static void eio_atfork_parent (void)
975{
976#if !HAVE_READDIR_R
977 X_UNLOCK (readdirlock);
978#endif
979#if !HAVE_PREADWRITE
980 X_UNLOCK (preadwritelock);
981#endif
982 X_UNLOCK (reslock);
983 X_UNLOCK (reqlock);
984 X_UNLOCK (wrklock);
985}
986
987static void eio_atfork_child (void)
988{
989 eio_req *prv;
990
991 while (prv = reqq_shift (&req_queue))
992 eio_destroy (prv);
993
994 while (prv = reqq_shift (&res_queue))
995 eio_destroy (prv);
996
997 while (wrk_first.next != &wrk_first)
998 {
999 worker *wrk = wrk_first.next;
1000
1001 if (wrk->req)
1002 eio_destroy (wrk->req);
1003
1004 worker_clear (wrk);
1005 worker_free (wrk);
1006 }
1007
1008 started = 0;
1009 idle = 0;
1010 nreqs = 0;
1011 nready = 0;
1012 npending = 0;
1013
1014 eio_atfork_parent ();
1015}
1016
1017int eio_init (void (*want_poll)(void), void (*done_poll)(void)) 1523int eio_init (void (*want_poll)(void), void (*done_poll)(void))
1018{ 1524{
1019 want_poll_cb = want_poll; 1525 return etp_init (want_poll, done_poll);
1020 done_poll_cb = done_poll;
1021
1022#ifdef _WIN32
1023 X_MUTEX_CHECK (wrklock);
1024 X_MUTEX_CHECK (reslock);
1025 X_MUTEX_CHECK (reqlock);
1026 X_MUTEX_CHECK (reqwait);
1027 X_MUTEX_CHECK (preadwritelock);
1028 X_MUTEX_CHECK (readdirlock);
1029
1030 X_COND_CHECK (reqwait);
1031#endif
1032
1033 X_THREAD_ATFORK (eio_atfork_prepare, eio_atfork_parent, eio_atfork_child);
1034} 1526}
1035 1527
1036static void eio_api_destroy (eio_req *req) 1528static void eio_api_destroy (eio_req *req)
1037{ 1529{
1038 free (req); 1530 free (req);
… …
1043 \ 1535 \
1044 req = (eio_req *)calloc (1, sizeof *req); \ 1536 req = (eio_req *)calloc (1, sizeof *req); \
1045 if (!req) \ 1537 if (!req) \
1046 return 0; \ 1538 return 0; \
1047 \ 1539 \
1048 req->type = EIO_ ## rtype; \ 1540 req->type = rtype; \
1049 req->pri = EIO_DEFAULT_PRI + EIO_PRI_BIAS; \ 1541 req->pri = pri; \
1050 req->finish = cb; \ 1542 req->finish = cb; \
1543 req->data = data; \
1051 req->destroy = eio_api_destroy; 1544 req->destroy = eio_api_destroy;
1052 1545
1053#define SEND eio_submit (req); return req 1546#define SEND eio_submit (req); return req
1054 1547
1055#define PATH (void)0 1548#define PATH \
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 }
1056 1556
1557static void eio_execute (etp_worker *self, eio_req *req)
1558{
1559 errno = 0;
1560
1561 switch (req->type)
1562 {
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;
1570
1571 case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
1572 case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break;
1573
1574 case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1575 req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
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;
1580
1581 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
1582 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
1583 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
1584 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
1585 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
1586 case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
1587
1588 case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
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;
1598
1599 case EIO_READLINK: ALLOC (NAME_MAX);
1600 req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break;
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:
1612#ifdef _WIN32
1613 Sleep (req->nv1 * 1000.);
1614#else
1615 {
1616 struct timeval tv;
1617
1618 tv.tv_sec = req->nv1;
1619 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.;
1620
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.)
1633 {
1634 tv[0].tv_sec = req->nv1;
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;
1640 }
1641 else
1642 times = 0;
1643
1644
1645 req->result = req->type == EIO_FUTIME
1646 ? futimes (req->int1, times)
1647 : utimes (req->ptr1, times);
1648 }
1649 break;
1650
1651 case EIO_GROUP:
1652 abort (); /* handled in eio_request */
1653
1654 case EIO_NOP:
1655 req->result = 0;
1656 break;
1657
1658 case EIO_CUSTOM:
1659 ((void (*)(eio_req *))req->feed) (req);
1660 break;
1661
1662 default:
1663 req->result = -1;
1664 break;
1665 }
1666
1667 req->errorno = errno;
1668}
1669
1670#ifndef EIO_NO_WRAPPERS
1671
1672eio_req *eio_nop (int pri, eio_cb cb, void *data)
1673{
1674 REQ (EIO_NOP); SEND;
1675}
1676
1677eio_req *eio_busy (double delay, int pri, eio_cb cb, void *data)
1678{
1679 REQ (EIO_BUSY); req->nv1 = delay; SEND;
1680}
1681
1057eio_req *eio_fsync (int fd, eio_cb cb) 1682eio_req *eio_sync (int pri, eio_cb cb, void *data)
1058{ 1683{
1684 REQ (EIO_SYNC); SEND;
1685}
1686
1687eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data)
1688{
1059 REQ (FSYNC); req->int1 = fd; SEND; 1689 REQ (EIO_FSYNC); req->int1 = fd; SEND;
1060} 1690}
1061 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
1062eio_req *eio_fdatasync (int fd, eio_cb cb) 1707eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data)
1063{ 1708{
1064 REQ (FDATASYNC); req->int1 = fd; SEND; 1709 REQ (EIO_FDATASYNC); req->int1 = fd; SEND;
1065} 1710}
1066 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
1067eio_req *eio_readahead (int fd, off_t offset, size_t length, eio_cb cb) 1717eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data)
1068{ 1718{
1069 REQ (READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND; 1719 REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND;
1070} 1720}
1071 1721
1072eio_req *eio_read (int fd, off_t offset, size_t length, void *data, eio_cb cb) 1722eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
1073{ 1723{
1074 REQ (READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = data; SEND; 1724 REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
1075} 1725}
1076 1726
1077eio_req *eio_write (int fd, off_t offset, size_t length, void *data, eio_cb cb) 1727eio_req *eio_write (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
1078{ 1728{
1079 REQ (WRITE); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = data; SEND; 1729 REQ (EIO_WRITE); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
1080} 1730}
1081 1731
1082eio_req *eio_fstat (int fd, eio_cb cb) 1732eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
1083{ 1733{
1084 REQ (FSTAT); req->int1 = fd; SEND; 1734 REQ (EIO_FSTAT); req->int1 = fd; SEND;
1085} 1735}
1086 1736
1087eio_req *eio_futime (int fd, double atime, double mtime, eio_cb cb) 1737eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data)
1088{ 1738{
1089 REQ (FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; 1739 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
1090} 1740}
1091 1741
1092eio_req *eio_ftruncate (int fd, off_t offset, eio_cb cb) 1742eio_req *eio_ftruncate (int fd, off_t offset, int pri, eio_cb cb, void *data)
1093{ 1743{
1094 REQ (FTRUNCATE); req->int1 = fd; req->offs = offset; SEND; 1744 REQ (EIO_FTRUNCATE); req->int1 = fd; req->offs = offset; SEND;
1095} 1745}
1096 1746
1097eio_req *eio_fchmod (int fd, mode_t mode, eio_cb cb) 1747eio_req *eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data)
1098{ 1748{
1099 REQ (FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND; 1749 REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND;
1100} 1750}
1101 1751
1102eio_req *eio_fchown (int fd, uid_t uid, gid_t gid, eio_cb cb) 1752eio_req *eio_fchown (int fd, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
1103{ 1753{
1104 REQ (FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND; 1754 REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
1105} 1755}
1106 1756
1107eio_req *eio_dup2 (int fd, int fd2, eio_cb cb) 1757eio_req *eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data)
1108{ 1758{
1109 REQ (DUP2); req->int1 = fd; req->int2 = fd2; SEND; 1759 REQ (EIO_DUP2); req->int1 = fd; req->int2 = fd2; SEND;
1110} 1760}
1111 1761
1112eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, eio_cb cb) 1762eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, int pri, eio_cb cb, void *data)
1113{ 1763{
1114 REQ (SENDFILE); req->int1 = out_fd; req->int2 = in_fd; req->offs = in_offset; req->size = length; SEND; 1764 REQ (EIO_SENDFILE); req->int1 = out_fd; req->int2 = in_fd; req->offs = in_offset; req->size = length; SEND;
1115} 1765}
1116 1766
1117eio_req *eio_open (const char *path, int flags, mode_t mode, eio_cb cb) 1767eio_req *eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data)
1118{ 1768{
1119 REQ (OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND; 1769 REQ (EIO_OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND;
1120} 1770}
1121 1771
1122eio_req *eio_readlink (const char *path, eio_cb cb)
1123{
1124 REQ (READLINK); PATH; SEND;
1125}
1126
1127eio_req *eio_stat (const char *path, eio_cb cb)
1128{
1129 REQ (STAT); PATH; SEND;
1130}
1131
1132eio_req *eio_lstat (const char *path, eio_cb cb)
1133{
1134 REQ (LSTAT); PATH; SEND;
1135}
1136
1137eio_req *eio_utime (const char *path, double atime, double mtime, eio_cb cb) 1772eio_req *eio_utime (const char *path, double atime, double mtime, int pri, eio_cb cb, void *data)
1138{ 1773{
1139 REQ (UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND; 1774 REQ (EIO_UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND;
1140} 1775}
1141 1776
1142eio_req *eio_truncate (const char *path, off_t offset, eio_cb cb) 1777eio_req *eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data)
1143{ 1778{
1144 REQ (TRUNCATE); PATH; req->offs = offset; SEND; 1779 REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND;
1145} 1780}
1146 1781
1147eio_req *eio_chown (const char *path, uid_t uid, gid_t gid, eio_cb cb) 1782eio_req *eio_chown (const char *path, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
1148{ 1783{
1149 REQ (CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND; 1784 REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
1150} 1785}
1151 1786
1152eio_req *eio_chmod (const char *path, mode_t mode, eio_cb cb) 1787eio_req *eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
1153{ 1788{
1154 REQ (CHMOD); PATH; req->int2 = (long)mode; SEND; 1789 REQ (EIO_CHMOD); PATH; req->int2 = (long)mode; SEND;
1155} 1790}
1156 1791
1157eio_req *eio_mkdir (const char *path, mode_t mode, eio_cb cb) 1792eio_req *eio_mkdir (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
1158{ 1793{
1159 REQ (MKDIR); PATH; req->int2 = (long)mode; SEND; 1794 REQ (EIO_MKDIR); PATH; req->int2 = (long)mode; SEND;
1160} 1795}
1161 1796
1162eio_req *eio_unlink (const char *path, eio_cb cb) 1797static eio_req *
1798eio__1path (int type, const char *path, int pri, eio_cb cb, void *data)
1163{ 1799{
1164 REQ (UNLINK); PATH; SEND;
1165}
1166
1167eio_req *eio_rmdir (const char *path, eio_cb cb)
1168{
1169 REQ (RMDIR); PATH; SEND; 1800 REQ (type); PATH; SEND;
1170} 1801}
1171 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
1172eio_req *eio_readdir (const char *path, eio_cb cb) 1823eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
1173{ 1824{
1174 REQ (READDIR); PATH; SEND; 1825 return eio__1path (EIO_RMDIR, path, pri, cb, data);
1175} 1826}
1176 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
1177eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, eio_cb cb) 1833eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
1178{ 1834{
1179 REQ (MKNOD); PATH; req->int2 = (long)mode; req->int2 = (long)dev; SEND; 1835 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND;
1180} 1836}
1181 1837
1182eio_req *eio_busy (double delay, eio_cb cb) 1838static eio_req *
1839eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1183{ 1840{
1184 REQ (BUSY); req->nv1 = delay; SEND; 1841 REQ (type); PATH;
1185}
1186 1842
1843 req->flags |= EIO_FLAG_PTR2_FREE;
1844 req->ptr2 = strdup (new_path);
1845 if (!req->ptr2)
1846 {
1847 eio_api_destroy (req);
1848 return 0;
1849 }
1850
1851 SEND;
1852}
1853
1854eio_req *eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1855{
1856 return eio__2path (EIO_LINK, path, new_path, pri, cb, data);
1857}
1858
1859eio_req *eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1860{
1861 return eio__2path (EIO_SYMLINK, path, new_path, pri, cb, data);
1862}
1863
1864eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1865{
1866 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
1867}
1868
1869eio_req *eio_custom (eio_cb execute, int pri, eio_cb cb, void *data)
1870{
1871 REQ (EIO_CUSTOM); req->feed = (void (*)(eio_req *))execute; SEND;
1872}
1873
1874#endif
1875
1187eio_req *eio_nop (eio_cb cb) 1876eio_req *eio_grp (eio_cb cb, void *data)
1188{ 1877{
1878 const int pri = EIO_PRI_MAX;
1879
1189 REQ (NOP); SEND; 1880 REQ (EIO_GROUP); SEND;
1190} 1881}
1191 1882
1192#undef REQ 1883#undef REQ
1193#undef PATH 1884#undef PATH
1194#undef SEND 1885#undef SEND
1195 1886
1196#if 0 1887/*****************************************************************************/
1197 1888/* grp functions */
1198void
1199aio_open (SV8 *pathname, int flags, int mode, SV *callback=&PL_sv_undef)
1200 PROTOTYPE: $$$;$
1201 PPCODE:
1202{
1203 dREQ;
1204
1205 req->type = EIO_OPEN;
1206 req->sv1 = newSVsv (pathname);
1207 req->ptr1 = SvPVbyte_nolen (req->sv1);
1208 req->int1 = flags;
1209 req->int2 = mode;
1210
1211 EIO_SEND;
1212}
1213
1214void
1215aio_fsync (SV *fh, SV *callback=&PL_sv_undef)
1216 PROTOTYPE: $;$
1217 ALIAS:
1218 aio_fsync = EIO_FSYNC
1219 aio_fdatasync = EIO_FDATASYNC
1220 PPCODE:
1221{
1222 dREQ;
1223
1224 req->type = ix;
1225 req->sv1 = newSVsv (fh);
1226 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh)));
1227
1228 EIO_SEND (req);
1229}
1230
1231void
1232aio_close (SV *fh, SV *callback=&PL_sv_undef)
1233 PROTOTYPE: $;$
1234 PPCODE:
1235{
1236 dREQ;
1237
1238 req->type = EIO_CLOSE;
1239 req->sv1 = newSVsv (fh);
1240 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh)));
1241
1242 EIO_SEND (req);
1243}
1244
1245void
1246aio_read (SV *fh, SV *offset, SV *length, SV8 *data, IV dataoffset, SV *callback=&PL_sv_undef)
1247 ALIAS:
1248 aio_read = EIO_READ
1249 aio_write = EIO_WRITE
1250 PROTOTYPE: $$$$$;$
1251 PPCODE:
1252{
1253 STRLEN svlen;
1254 char *svptr = SvPVbyte (data, svlen);
1255 UV len = SvUV (length);
1256
1257 SvUPGRADE (data, SVt_PV);
1258 SvPOK_on (data);
1259
1260 if (dataoffset < 0)
1261 dataoffset += svlen;
1262
1263 if (dataoffset < 0 || dataoffset > svlen)
1264 croak ("dataoffset outside of data scalar");
1265
1266 if (ix == EIO_WRITE)
1267 {
1268 /* write: check length and adjust. */
1269 if (!SvOK (length) || len + dataoffset > svlen)
1270 len = svlen - dataoffset;
1271 }
1272 else
1273 {
1274 /* read: grow scalar as necessary */
1275 svptr = SvGROW (data, len + dataoffset + 1);
1276 }
1277
1278 if (len < 0)
1279 croak ("length must not be negative");
1280
1281 {
1282 dREQ;
1283
1284 req->type = ix;
1285 req->sv1 = newSVsv (fh);
1286 req->int1 = PerlIO_fileno (ix == EIO_READ ? IoIFP (sv_2io (fh))
1287 : IoOFP (sv_2io (fh)));
1288 req->offs = SvOK (offset) ? SvVAL64 (offset) : -1;
1289 req->size = len;
1290 req->sv2 = SvREFCNT_inc (data);
1291 req->ptr2 = (char *)svptr + dataoffset;
1292 req->stroffset = dataoffset;
1293
1294 if (!SvREADONLY (data))
1295 {
1296 SvREADONLY_on (data);
1297 req->flags |= FLAG_SV2_RO_OFF;
1298 }
1299
1300 EIO_SEND;
1301 }
1302}
1303
1304void
1305aio_readlink (SV8 *path, SV *callback=&PL_sv_undef)
1306 PROTOTYPE: $$;$
1307 PPCODE:
1308{
1309 SV *data;
1310 dREQ;
1311
1312 data = newSV (NAME_MAX);
1313 SvPOK_on (data);
1314
1315 req->type = EIO_READLINK;
1316 req->sv1 = newSVsv (path);
1317 req->ptr1 = SvPVbyte_nolen (req->sv1);
1318 req->sv2 = data;
1319 req->ptr2 = SvPVbyte_nolen (data);
1320
1321 EIO_SEND;
1322}
1323
1324void
1325aio_sendfile (SV *out_fh, SV *in_fh, SV *in_offset, UV length, SV *callback=&PL_sv_undef)
1326 PROTOTYPE: $$$$;$
1327 PPCODE:
1328{
1329 dREQ;
1330
1331 req->type = EIO_SENDFILE;
1332 req->sv1 = newSVsv (out_fh);
1333 req->int1 = PerlIO_fileno (IoIFP (sv_2io (out_fh)));
1334 req->sv2 = newSVsv (in_fh);
1335 req->int2 = PerlIO_fileno (IoIFP (sv_2io (in_fh)));
1336 req->offs = SvVAL64 (in_offset);
1337 req->size = length;
1338
1339 EIO_SEND;
1340}
1341
1342void
1343aio_readahead (SV *fh, SV *offset, IV length, SV *callback=&PL_sv_undef)
1344 PROTOTYPE: $$$;$
1345 PPCODE:
1346{
1347 dREQ;
1348
1349 req->type = EIO_READAHEAD;
1350 req->sv1 = newSVsv (fh);
1351 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh)));
1352 req->offs = SvVAL64 (offset);
1353 req->size = length;
1354
1355 EIO_SEND;
1356}
1357
1358void
1359aio_stat (SV8 *fh_or_path, SV *callback=&PL_sv_undef)
1360 ALIAS:
1361 aio_stat = EIO_STAT
1362 aio_lstat = EIO_LSTAT
1363 PPCODE:
1364{
1365 dREQ;
1366
1367 req->ptr2 = malloc (sizeof (EIO_STRUCT_STAT));
1368 if (!req->ptr2)
1369 {
1370 req_destroy (req);
1371 croak ("out of memory during aio_stat statdata allocation");
1372 }
1373
1374 req->flags |= FLAG_PTR2_FREE;
1375 req->sv1 = newSVsv (fh_or_path);
1376
1377 if (SvPOK (fh_or_path))
1378 {
1379 req->type = ix;
1380 req->ptr1 = SvPVbyte_nolen (req->sv1);
1381 }
1382 else
1383 {
1384 req->type = EIO_FSTAT;
1385 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path)));
1386 }
1387
1388 EIO_SEND;
1389}
1390
1391void
1392aio_utime (SV8 *fh_or_path, SV *atime, SV *mtime, SV *callback=&PL_sv_undef)
1393 PPCODE:
1394{
1395 dREQ;
1396
1397 req->nv1 = SvOK (atime) ? SvNV (atime) : -1.;
1398 req->nv2 = SvOK (mtime) ? SvNV (mtime) : -1.;
1399 req->sv1 = newSVsv (fh_or_path);
1400
1401 if (SvPOK (fh_or_path))
1402 {
1403 req->type = EIO_UTIME;
1404 req->ptr1 = SvPVbyte_nolen (req->sv1);
1405 }
1406 else
1407 {
1408 req->type = EIO_FUTIME;
1409 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path)));
1410 }
1411
1412 EIO_SEND;
1413}
1414
1415void
1416aio_truncate (SV8 *fh_or_path, SV *offset, SV *callback=&PL_sv_undef)
1417 PPCODE:
1418{
1419 dREQ;
1420
1421 req->sv1 = newSVsv (fh_or_path);
1422 req->offs = SvOK (offset) ? SvVAL64 (offset) : -1;
1423
1424 if (SvPOK (fh_or_path))
1425 {
1426 req->type = EIO_TRUNCATE;
1427 req->ptr1 = SvPVbyte_nolen (req->sv1);
1428 }
1429 else
1430 {
1431 req->type = EIO_FTRUNCATE;
1432 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path)));
1433 }
1434
1435 EIO_SEND;
1436}
1437
1438void
1439aio_chmod (SV8 *fh_or_path, int mode, SV *callback=&PL_sv_undef)
1440 ALIAS:
1441 aio_chmod = EIO_CHMOD
1442 aio_fchmod = EIO_FCHMOD
1443 aio_mkdir = EIO_MKDIR
1444 PPCODE:
1445{
1446 dREQ;
1447
1448 req->type = type;
1449 req->int2 = mode;
1450 req->sv1 = newSVsv (fh_or_path);
1451
1452 if (ix == EIO_FCHMOD)
1453 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path)));
1454 else
1455 req->ptr1 = SvPVbyte_nolen (req->sv1);
1456
1457 EIO_SEND;
1458}
1459
1460void
1461aio_chown (SV8 *fh_or_path, SV *uid, SV *gid, SV *callback=&PL_sv_undef)
1462 PPCODE:
1463{
1464 dREQ;
1465
1466 req->int2 = SvOK (uid) ? SvIV (uid) : -1;
1467 req->int3 = SvOK (gid) ? SvIV (gid) : -1;
1468 req->sv1 = newSVsv (fh_or_path);
1469
1470 if (SvPOK (fh_or_path))
1471 {
1472 req->type = EIO_CHOWN;
1473 req->ptr1 = SvPVbyte_nolen (req->sv1);
1474 }
1475 else
1476 {
1477 req->type = EIO_FCHOWN;
1478 req->int1 = PerlIO_fileno (IoIFP (sv_2io (fh_or_path)));
1479 }
1480
1481 EIO_SEND;
1482}
1483
1484void
1485aio_unlink (SV8 *pathname, SV *callback=&PL_sv_undef)
1486 ALIAS:
1487 aio_unlink = EIO_UNLINK
1488 aio_rmdir = EIO_RMDIR
1489 aio_readdir = EIO_READDIR
1490 PPCODE:
1491{
1492 dREQ;
1493
1494 req->type = ix;
1495 req->sv1 = newSVsv (pathname);
1496 req->ptr1 = SvPVbyte_nolen (req->sv1);
1497
1498 EIO_SEND;
1499}
1500
1501void
1502aio_link (SV8 *oldpath, SV8 *newpath, SV *callback=&PL_sv_undef)
1503 ALIAS:
1504 aio_link = EIO_LINK
1505 aio_symlink = EIO_SYMLINK
1506 aio_rename = EIO_RENAME
1507 PPCODE:
1508{
1509 dREQ;
1510
1511 req->type = ix;
1512 req->sv1 = newSVsv (oldpath);
1513 req->ptr1 = SvPVbyte_nolen (req->sv1);
1514 req->sv2 = newSVsv (newpath);
1515 req->ptr2 = SvPVbyte_nolen (req->sv2);
1516
1517 EIO_SEND;
1518}
1519
1520void
1521aio_mknod (SV8 *pathname, int mode, UV dev, SV *callback=&PL_sv_undef)
1522 PPCODE:
1523{
1524 dREQ;
1525
1526 req->type = EIO_MKNOD;
1527 req->sv1 = newSVsv (pathname);
1528 req->ptr1 = SvPVbyte_nolen (req->sv1);
1529 req->int2 = (mode_t)mode;
1530 req->offs = dev;
1531
1532 EIO_SEND;
1533}
1534
1535void
1536aio_busy (double delay, SV *callback=&PL_sv_undef)
1537 PPCODE:
1538{
1539 dREQ;
1540
1541 req->type = EIO_BUSY;
1542 req->nv1 = delay < 0. ? 0. : delay;
1543
1544 EIO_SEND;
1545}
1546
1547void
1548aio_group (SV *callback=&PL_sv_undef)
1549 PROTOTYPE: ;$
1550 PPCODE:
1551{
1552 dREQ;
1553
1554 req->type = EIO_GROUP;
1555
1556 req_send (req);
1557 XPUSHs (req_sv (req, AIO_GRP_KLASS));
1558}
1559
1560void
1561aio_nop (SV *callback=&PL_sv_undef)
1562 ALIAS:
1563 aio_nop = EIO_NOP
1564 aio_sync = EIO_SYNC
1565 PPCODE:
1566{
1567 dREQ;
1568
1569#endif
1570 1889
1571void 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)
1572{ 1891{
1573 grp->int2 = limit; 1892 grp->int2 = limit;
1574 grp->feed = feed; 1893 grp->feed = feed;
… …
1585 1904
1586void eio_grp_add (eio_req *grp, eio_req *req) 1905void eio_grp_add (eio_req *grp, eio_req *req)
1587{ 1906{
1588 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));
1589 1908
1909 grp->flags |= EIO_FLAG_GROUPADD;
1910
1590 ++grp->size; 1911 ++grp->size;
1591 req->grp = grp; 1912 req->grp = grp;
1592 1913
1593 req->grp_prev = 0; 1914 req->grp_prev = 0;
1594 req->grp_next = grp->grp_first; 1915 req->grp_next = grp->grp_first;
… …
1597 grp->grp_first->grp_prev = req; 1918 grp->grp_first->grp_prev = req;
1598 1919
1599 grp->grp_first = req; 1920 grp->grp_first = req;
1600} 1921}
1601 1922
1923/*****************************************************************************/
1924/* misc garbage */
1602 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