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.56 by root, Sun Sep 12 03:36:28 2010 UTC

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

Diff Legend

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