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

Comparing libeio/eio.c (file contents):
Revision 1.2 by root, Sat May 10 23:33:40 2008 UTC vs.
Revision 1.54 by root, Tue Feb 23 14:32:45 2010 UTC

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

Diff Legend

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