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

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

Diff Legend

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