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.86 by root, Thu Jul 14 18:30:10 2011 UTC

1/*
2 * libeio implementation
3 *
4 * Copyright (c) 2007,2008,2009,2010,2011 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
40#ifndef _WIN32
41# include "config.h"
42#endif
43
1#include "eio.h" 44#include "eio.h"
45#include "ecb.h"
46
47#ifdef EIO_STACKSIZE
48# define XTHREAD_STACKSIZE EIO_STACKSIZE
49#endif
2#include "xthread.h" 50#include "xthread.h"
3 51
4#include <errno.h> 52#include <errno.h>
5
6#include "EXTERN.h"
7#include "perl.h"
8#include "XSUB.h"
9
10#include <stddef.h> 53#include <stddef.h>
11#include <stdlib.h> 54#include <stdlib.h>
55#include <string.h>
12#include <errno.h> 56#include <errno.h>
13#include <sys/types.h> 57#include <sys/types.h>
14#include <sys/stat.h> 58#include <sys/stat.h>
15#include <limits.h> 59#include <limits.h>
16#include <fcntl.h> 60#include <fcntl.h>
17#include <sched.h> 61#include <assert.h>
62
63#include <sys/statvfs.h>
64/* intptr_t comes from unistd.h, says POSIX/UNIX/tradition */
65/* intptr_t only comes from stdint.h, says idiot openbsd coder */
66#if HAVE_STDINT_H
67# include <stdint.h>
68#endif
69
70#ifndef ECANCELED
71# define ECANCELED EDOM
72#endif
73
74static void eio_destroy (eio_req *req);
18 75
19#ifndef EIO_FINISH 76#ifndef EIO_FINISH
20# define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 77# define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0
21#endif 78#endif
22 79
26 83
27#ifndef EIO_FEED 84#ifndef EIO_FEED
28# define EIO_FEED(req) do { if ((req)->feed ) (req)->feed (req); } while (0) 85# define EIO_FEED(req) do { if ((req)->feed ) (req)->feed (req); } while (0)
29#endif 86#endif
30 87
88#ifndef EIO_FD_TO_WIN32_HANDLE
89# define EIO_FD_TO_WIN32_HANDLE(fd) _get_osfhandle (fd)
90#endif
91#ifndef EIO_WIN32_HANDLE_TO_FD
92# define EIO_WIN32_HANDLE_TO_FD(handle) _open_osfhandle (handle, 0)
93#endif
94
95#define EIO_ERRNO(errval,retval) ((errno = errval), retval)
96
97#define EIO_ENOSYS() EIO_ERRNO (ENOSYS, -1)
98
31#ifdef _WIN32 99#ifdef _WIN32
32 100
33 /*doh*/ 101 #define PAGESIZE 4096 /* GetSystemInfo? */
102
103 #define stat(path,buf) _stati64 (path,buf)
104 #define lstat(path,buf) stat (path,buf)
105 #define fstat(fd,buf) _fstati64 (path,buf)
106 #define fsync(fd) (FlushFileBuffers (EIO_FD_TO_WIN32_HANDLE (fd)) ? 0 : EIO_ERRNO (EBADF, -1))
107 #define mkdir(path,mode) _mkdir (path)
108 #define link(old,neu) (CreateHardLink (neu, old, 0) ? 0 : EIO_ERRNO (ENOENT, -1))
109
110 #define chown(path,uid,gid) EIO_ENOSYS ()
111 #define fchown(fd,uid,gid) EIO_ENOSYS ()
112 #define truncate(path,offs) EIO_ENOSYS () /* far-miss: SetEndOfFile */
113 #define ftruncate(fd,offs) EIO_ENOSYS () /* near-miss: SetEndOfFile */
114 #define mknod(path,mode,dev) EIO_ENOSYS ()
115 #define sync() EIO_ENOSYS ()
116
117 /* we could even stat and see if it exists */
118 static int
119 symlink (const char *old, const char *neu)
120 {
121 if (CreateSymbolicLink (neu, old, 1))
122 return 0;
123
124 if (CreateSymbolicLink (neu, old, 0))
125 return 0;
126
127 return EIO_ERRNO (ENOENT, -1);
128 }
34 129
35#else 130#else
36 131
37# include "config.h"
38# include <sys/time.h> 132 #include <sys/time.h>
39# include <sys/select.h> 133 #include <sys/select.h>
134 #include <sys/statvfs.h>
40# include <unistd.h> 135 #include <unistd.h>
41# include <utime.h> 136 #include <utime.h>
42# include <signal.h> 137 #include <signal.h>
138 #include <dirent.h>
43 139
140 #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES
141 #include <sys/mman.h>
142 #endif
143
144 /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */
145 #if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__
146 #define _DIRENT_HAVE_D_TYPE /* sigh */
147 #define D_INO(de) (de)->d_fileno
148 #define D_NAMLEN(de) (de)->d_namlen
149 #elif __linux || defined d_ino || _XOPEN_SOURCE >= 600
150 #define D_INO(de) (de)->d_ino
151 #endif
152
153 #ifdef _D_EXACT_NAMLEN
154 #undef D_NAMLEN
155 #define D_NAMLEN(de) _D_EXACT_NAMLEN (de)
156 #endif
157
158 #ifdef _DIRENT_HAVE_D_TYPE
159 #define D_TYPE(de) (de)->d_type
160 #endif
161
44# ifndef EIO_STRUCT_DIRENT 162 #ifndef EIO_STRUCT_DIRENT
45# define EIO_STRUCT_DIRENT struct dirent 163 #define EIO_STRUCT_DIRENT struct dirent
164 #endif
165
46# endif 166#endif
47
48#endif
49
50# ifndef EIO_STRUCT_STAT
51# define EIO_STRUCT_STAT struct stat
52# endif
53 167
54#if HAVE_SENDFILE 168#if HAVE_SENDFILE
55# if __linux 169# if __linux
56# include <sys/sendfile.h> 170# include <sys/sendfile.h>
57# elif __freebsd 171# elif __FreeBSD__ || defined __APPLE__
58# include <sys/socket.h> 172# include <sys/socket.h>
59# include <sys/uio.h> 173# include <sys/uio.h>
60# elif __hpux 174# elif __hpux
61# include <sys/socket.h> 175# include <sys/socket.h>
62# elif __solaris /* not yet */ 176# elif __solaris
63# include <sys/sendfile.h> 177# include <sys/sendfile.h>
64# else 178# else
65# error sendfile support requested but not available 179# error sendfile support requested but not available
66# endif 180# endif
67#endif 181#endif
68 182
69/* number of seconds after which an idle threads exit */ 183#ifndef D_TYPE
70#define IDLE_TIMEOUT 10 184# define D_TYPE(de) 0
185#endif
186#ifndef D_INO
187# define D_INO(de) 0
188#endif
189#ifndef D_NAMLEN
190# define D_NAMLEN(de) strlen ((de)->d_name)
191#endif
71 192
72/* used for struct dirent, AIX doesn't provide it */ 193/* used for struct dirent, AIX doesn't provide it */
73#ifndef NAME_MAX 194#ifndef NAME_MAX
74# define NAME_MAX 4096 195# define NAME_MAX 4096
75#endif 196#endif
76 197
198/* used for readlink etc. */
199#ifndef PATH_MAX
200# define PATH_MAX 4096
201#endif
202
77/* buffer size for various temporary buffers */ 203/* buffer size for various temporary buffers */
78#define EIO_BUFSIZE 65536 204#define EIO_BUFSIZE 65536
79 205
80#define dBUF \ 206#define dBUF \
81 char *eio_buf; \ 207 char *eio_buf; \
82 X_LOCK (wrklock); \ 208 ETP_WORKER_LOCK (self); \
83 self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \ 209 self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \
84 X_UNLOCK (wrklock); \ 210 ETP_WORKER_UNLOCK (self); \
211 errno = ENOMEM; \
85 if (!eio_buf) \ 212 if (!eio_buf) \
86 return -1; 213 return -1;
87 214
88#define EIO_TICKS ((1000000 + 1023) >> 10) 215#define EIO_TICKS ((1000000 + 1023) >> 10)
89 216
217#define ETP_PRI_MIN EIO_PRI_MIN
218#define ETP_PRI_MAX EIO_PRI_MAX
219
220struct etp_worker;
221
222#define ETP_REQ eio_req
223#define ETP_DESTROY(req) eio_destroy (req)
224static int eio_finish (eio_req *req);
225#define ETP_FINISH(req) eio_finish (req)
226static void eio_execute (struct etp_worker *self, eio_req *req);
227#define ETP_EXECUTE(wrk,req) eio_execute (wrk,req)
228
229#define ETP_WORKER_CLEAR(req) \
230 if (wrk->dbuf) \
231 { \
232 free (wrk->dbuf); \
233 wrk->dbuf = 0; \
234 } \
235 \
236 if (wrk->dirp) \
237 { \
238 closedir (wrk->dirp); \
239 wrk->dirp = 0; \
240 }
241
242#define ETP_WORKER_COMMON \
243 void *dbuf; \
244 DIR *dirp;
245
246/*****************************************************************************/
247
248#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
249
250/* calculate time difference in ~1/EIO_TICKS of a second */
251ecb_inline int
252tvdiff (struct timeval *tv1, struct timeval *tv2)
253{
254 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
255 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
256}
257
258static unsigned int started, idle, wanted = 4;
259
90static void (*want_poll_cb) (void); 260static void (*want_poll_cb) (void);
91static void (*done_poll_cb) (void); 261static void (*done_poll_cb) (void);
92 262
93static unsigned int max_poll_time = 0; 263static unsigned int max_poll_time; /* reslock */
94static unsigned int max_poll_reqs = 0; 264static unsigned int max_poll_reqs; /* reslock */
95 265
96/* calculcate time difference in ~1/EIO_TICKS of a second */ 266static volatile unsigned int nreqs; /* reqlock */
97static int tvdiff (struct timeval *tv1, struct timeval *tv2) 267static volatile unsigned int nready; /* reqlock */
98{ 268static volatile unsigned int npending; /* reqlock */
99 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS 269static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */
100 + ((tv2->tv_usec - tv1->tv_usec) >> 10); 270static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */
101}
102 271
103static unsigned int started, idle, wanted; 272static xmutex_t wrklock;
273static xmutex_t reslock;
274static xmutex_t reqlock;
275static xcond_t reqwait;
276
277#if !HAVE_PREADWRITE
278/*
279 * make our pread/pwrite emulation safe against themselves, but not against
280 * normal read/write by using a mutex. slows down execution a lot,
281 * but that's your problem, not mine.
282 */
283static xmutex_t preadwritelock = X_MUTEX_INIT;
284#endif
285
286typedef struct etp_worker
287{
288 /* locked by wrklock */
289 struct etp_worker *prev, *next;
290
291 xthread_t tid;
292
293 /* locked by reslock, reqlock or wrklock */
294 ETP_REQ *req; /* currently processed request */
295
296 ETP_WORKER_COMMON
297} etp_worker;
298
299static etp_worker wrk_first = { &wrk_first, &wrk_first, 0 }; /* NOT etp */
300
301#define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock)
302#define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock)
104 303
105/* worker threads management */ 304/* worker threads management */
106static mutex_t wrklock = X_MUTEX_INIT;
107 305
108typedef struct worker { 306static void ecb_cold
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) 307etp_worker_clear (etp_worker *wrk)
123{ 308{
124 if (wrk->dirp) 309 ETP_WORKER_CLEAR (wrk);
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} 310}
136 311
137static void worker_free (worker *wrk) 312static void ecb_cold
313etp_worker_free (etp_worker *wrk)
138{ 314{
139 wrk->next->prev = wrk->prev; 315 wrk->next->prev = wrk->prev;
140 wrk->prev->next = wrk->next; 316 wrk->prev->next = wrk->next;
141 317
142 free (wrk); 318 free (wrk);
143} 319}
144 320
145static volatile unsigned int nreqs, nready, npending; 321static unsigned int
146static volatile unsigned int max_idle = 4; 322etp_nreqs (void)
147
148static mutex_t reslock = X_MUTEX_INIT;
149static mutex_t reqlock = X_MUTEX_INIT;
150static cond_t reqwait = X_COND_INIT;
151
152unsigned int eio_nreqs (void)
153{ 323{
324 int retval;
325 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
326 retval = nreqs;
327 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
154 return nreqs; 328 return retval;
155} 329}
156 330
157unsigned int eio_nready (void) 331static unsigned int
332etp_nready (void)
158{ 333{
159 unsigned int retval; 334 unsigned int retval;
160 335
161 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 336 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
162 retval = nready; 337 retval = nready;
163 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 338 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
164 339
165 return retval; 340 return retval;
166} 341}
167 342
168unsigned int eio_npending (void) 343static unsigned int
344etp_npending (void)
169{ 345{
170 unsigned int retval; 346 unsigned int retval;
171 347
172 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 348 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
173 retval = npending; 349 retval = npending;
174 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 350 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
175 351
176 return retval; 352 return retval;
177} 353}
178 354
179unsigned int eio_nthreads (void) 355static unsigned int
356etp_nthreads (void)
180{ 357{
181 unsigned int retval; 358 unsigned int retval;
182 359
183 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 360 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
184 retval = started; 361 retval = started;
191 * a somewhat faster data structure might be nice, but 368 * a somewhat faster data structure might be nice, but
192 * with 8 priorities this actually needs <20 insns 369 * with 8 priorities this actually needs <20 insns
193 * per shift, the most expensive operation. 370 * per shift, the most expensive operation.
194 */ 371 */
195typedef struct { 372typedef struct {
196 eio_req *qs[EIO_NUM_PRI], *qe[EIO_NUM_PRI]; /* qstart, qend */ 373 ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */
197 int size; 374 int size;
198} reqq; 375} etp_reqq;
199 376
200static reqq req_queue; 377static etp_reqq req_queue;
201static reqq res_queue; 378static etp_reqq res_queue;
202 379
203static int reqq_push (reqq *q, eio_req *req) 380static int ecb_noinline
381reqq_push (etp_reqq *q, ETP_REQ *req)
204{ 382{
205 int pri = req->pri; 383 int pri = req->pri;
206 req->next = 0; 384 req->next = 0;
207 385
208 if (q->qe[pri]) 386 if (q->qe[pri])
214 q->qe[pri] = q->qs[pri] = req; 392 q->qe[pri] = q->qs[pri] = req;
215 393
216 return q->size++; 394 return q->size++;
217} 395}
218 396
219static eio_req *reqq_shift (reqq *q) 397static ETP_REQ * ecb_noinline
398reqq_shift (etp_reqq *q)
220{ 399{
221 int pri; 400 int pri;
222 401
223 if (!q->size) 402 if (!q->size)
224 return 0; 403 return 0;
225 404
226 --q->size; 405 --q->size;
227 406
228 for (pri = EIO_NUM_PRI; pri--; ) 407 for (pri = ETP_NUM_PRI; pri--; )
229 { 408 {
230 eio_req *req = q->qs[pri]; 409 eio_req *req = q->qs[pri];
231 410
232 if (req) 411 if (req)
233 { 412 {
239 } 418 }
240 419
241 abort (); 420 abort ();
242} 421}
243 422
244static void grp_try_feed (eio_req *grp) 423static void ecb_cold
424etp_thread_init (void)
245{ 425{
246 while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) 426#if !HAVE_PREADWRITE
427 X_MUTEX_CREATE (preadwritelock);
428#endif
429 X_MUTEX_CREATE (wrklock);
430 X_MUTEX_CREATE (reslock);
431 X_MUTEX_CREATE (reqlock);
432 X_COND_CREATE (reqwait);
433}
434
435static void ecb_cold
436etp_atfork_prepare (void)
437{
438}
439
440static void ecb_cold
441etp_atfork_parent (void)
442{
443}
444
445static void ecb_cold
446etp_atfork_child (void)
447{
448 ETP_REQ *prv;
449
450 while ((prv = reqq_shift (&req_queue)))
451 ETP_DESTROY (prv);
452
453 while ((prv = reqq_shift (&res_queue)))
454 ETP_DESTROY (prv);
455
456 while (wrk_first.next != &wrk_first)
247 { 457 {
248 int old_len = grp->size; 458 etp_worker *wrk = wrk_first.next;
249 459
250 EIO_FEED (grp); 460 if (wrk->req)
461 ETP_DESTROY (wrk->req);
251 462
252 /* stop if no progress has been made */ 463 etp_worker_clear (wrk);
253 if (old_len == grp->size) 464 etp_worker_free (wrk);
254 {
255 grp->feed = 0;
256 break;
257 }
258 } 465 }
259}
260 466
261static int eio_finish (eio_req *req); 467 started = 0;
468 idle = 0;
469 nreqs = 0;
470 nready = 0;
471 npending = 0;
262 472
263static int grp_dec (eio_req *grp) 473 etp_thread_init ();
264{ 474}
265 --grp->size;
266 475
267 /* call feeder, if applicable */ 476static void ecb_cold
268 grp_try_feed (grp); 477etp_once_init (void)
478{
479 etp_thread_init ();
480 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child);
481}
269 482
270 /* finish, if done */ 483static int ecb_cold
271 if (!grp->size && grp->int1) 484etp_init (void (*want_poll)(void), void (*done_poll)(void))
272 return eio_finish (grp); 485{
273 else 486 static pthread_once_t doinit = PTHREAD_ONCE_INIT;
487
488 pthread_once (&doinit, etp_once_init);
489
490 want_poll_cb = want_poll;
491 done_poll_cb = done_poll;
492
274 return 0; 493 return 0;
275} 494}
276 495
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); 496X_THREAD_PROC (etp_proc);
326 497
327static void start_thread (void) 498static void ecb_cold
499etp_start_thread (void)
328{ 500{
329 worker *wrk = calloc (1, sizeof (worker)); 501 etp_worker *wrk = calloc (1, sizeof (etp_worker));
330 502
331 if (!wrk) 503 /*TODO*/
332 croak ("unable to allocate worker thread data"); 504 assert (("unable to allocate worker thread data", wrk));
333 505
334 X_LOCK (wrklock); 506 X_LOCK (wrklock);
335 507
336 if (thread_create (&wrk->tid, eio_proc, (void *)wrk)) 508 if (thread_create (&wrk->tid, etp_proc, (void *)wrk))
337 { 509 {
338 wrk->prev = &wrk_first; 510 wrk->prev = &wrk_first;
339 wrk->next = wrk_first.next; 511 wrk->next = wrk_first.next;
340 wrk_first.next->prev = wrk; 512 wrk_first.next->prev = wrk;
341 wrk_first.next = wrk; 513 wrk_first.next = wrk;
345 free (wrk); 517 free (wrk);
346 518
347 X_UNLOCK (wrklock); 519 X_UNLOCK (wrklock);
348} 520}
349 521
522static void
350static void maybe_start_thread (void) 523etp_maybe_start_thread (void)
351{ 524{
352 if (eio_nthreads () >= wanted) 525 if (ecb_expect_true (etp_nthreads () >= wanted))
353 return; 526 return;
354 527
355 /* todo: maybe use idle here, but might be less exact */ 528 /* todo: maybe use idle here, but might be less exact */
356 if (0 <= (int)eio_nthreads () + (int)eio_npending () - (int)eio_nreqs ()) 529 if (ecb_expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ()))
357 return; 530 return;
358 531
359 start_thread (); 532 etp_start_thread ();
360} 533}
361 534
362void eio_submit (eio_req *req) 535static void ecb_cold
363{ 536etp_end_thread (void)
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)
376{ 537{
377 eio_req *req = calloc (1, sizeof (eio_req)); 538 eio_req *req = calloc (1, sizeof (eio_req));
378 539
379 req->type = EIO_QUIT; 540 req->type = -1;
380 req->pri = EIO_PRI_MAX + EIO_PRI_BIAS; 541 req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
381 542
382 X_LOCK (reqlock); 543 X_LOCK (reqlock);
383 reqq_push (&req_queue, req); 544 reqq_push (&req_queue, req);
384 X_COND_SIGNAL (reqwait); 545 X_COND_SIGNAL (reqwait);
385 X_UNLOCK (reqlock); 546 X_UNLOCK (reqlock);
387 X_LOCK (wrklock); 548 X_LOCK (wrklock);
388 --started; 549 --started;
389 X_UNLOCK (wrklock); 550 X_UNLOCK (wrklock);
390} 551}
391 552
392void eio_set_max_poll_time (double nseconds) 553static int
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) 554etp_poll (void)
429{ 555{
430 int maxreqs = max_poll_reqs; 556 unsigned int maxreqs;
557 unsigned int maxtime;
431 struct timeval tv_start, tv_now; 558 struct timeval tv_start, tv_now;
432 eio_req *req;
433 559
560 X_LOCK (reslock);
561 maxreqs = max_poll_reqs;
562 maxtime = max_poll_time;
563 X_UNLOCK (reslock);
564
434 if (max_poll_time) 565 if (maxtime)
435 gettimeofday (&tv_start, 0); 566 gettimeofday (&tv_start, 0);
436 567
437 for (;;) 568 for (;;)
438 { 569 {
570 ETP_REQ *req;
571
439 maybe_start_thread (); 572 etp_maybe_start_thread ();
440 573
441 X_LOCK (reslock); 574 X_LOCK (reslock);
442 req = reqq_shift (&res_queue); 575 req = reqq_shift (&res_queue);
443 576
444 if (req) 577 if (req)
452 X_UNLOCK (reslock); 585 X_UNLOCK (reslock);
453 586
454 if (!req) 587 if (!req)
455 return 0; 588 return 0;
456 589
590 X_LOCK (reqlock);
457 --nreqs; 591 --nreqs;
592 X_UNLOCK (reqlock);
458 593
459 if (req->type == EIO_GROUP && req->size) 594 if (ecb_expect_false (req->type == EIO_GROUP && req->size))
460 { 595 {
461 req->int1 = 1; /* mark request as delayed */ 596 req->int1 = 1; /* mark request as delayed */
462 continue; 597 continue;
463 } 598 }
464 else 599 else
465 { 600 {
466 int res = eio_finish (req); 601 int res = ETP_FINISH (req);
467 if (res) 602 if (ecb_expect_false (res))
468 return res; 603 return res;
469 } 604 }
470 605
471 if (maxreqs && !--maxreqs) 606 if (ecb_expect_false (maxreqs && !--maxreqs))
472 break; 607 break;
473 608
474 if (max_poll_time) 609 if (maxtime)
475 { 610 {
476 gettimeofday (&tv_now, 0); 611 gettimeofday (&tv_now, 0);
477 612
478 if (tvdiff (&tv_start, &tv_now) >= max_poll_time) 613 if (tvdiff (&tv_start, &tv_now) >= maxtime)
479 break; 614 break;
480 } 615 }
481 } 616 }
482 617
483 errno = EAGAIN; 618 errno = EAGAIN;
484 return -1; 619 return -1;
485} 620}
486 621
622static void
623etp_cancel (ETP_REQ *req)
624{
625 req->cancelled = 1;
626
627 eio_grp_cancel (req);
628}
629
630static void
631etp_submit (ETP_REQ *req)
632{
633 req->pri -= ETP_PRI_MIN;
634
635 if (ecb_expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN;
636 if (ecb_expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
637
638 if (ecb_expect_false (req->type == EIO_GROUP))
639 {
640 /* I hope this is worth it :/ */
641 X_LOCK (reqlock);
642 ++nreqs;
643 X_UNLOCK (reqlock);
644
645 X_LOCK (reslock);
646
647 ++npending;
648
649 if (!reqq_push (&res_queue, req) && want_poll_cb)
650 want_poll_cb ();
651
652 X_UNLOCK (reslock);
653 }
654 else
655 {
656 X_LOCK (reqlock);
657 ++nreqs;
658 ++nready;
659 reqq_push (&req_queue, req);
660 X_COND_SIGNAL (reqwait);
661 X_UNLOCK (reqlock);
662
663 etp_maybe_start_thread ();
664 }
665}
666
667static void ecb_cold
668etp_set_max_poll_time (double nseconds)
669{
670 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
671 max_poll_time = nseconds * EIO_TICKS;
672 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
673}
674
675static void ecb_cold
676etp_set_max_poll_reqs (unsigned int maxreqs)
677{
678 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
679 max_poll_reqs = maxreqs;
680 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
681}
682
683static void ecb_cold
684etp_set_max_idle (unsigned int nthreads)
685{
686 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
687 max_idle = nthreads;
688 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
689}
690
691static void ecb_cold
692etp_set_idle_timeout (unsigned int seconds)
693{
694 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
695 idle_timeout = seconds;
696 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
697}
698
699static void ecb_cold
700etp_set_min_parallel (unsigned int nthreads)
701{
702 if (wanted < nthreads)
703 wanted = nthreads;
704}
705
706static void ecb_cold
707etp_set_max_parallel (unsigned int nthreads)
708{
709 if (wanted > nthreads)
710 wanted = nthreads;
711
712 while (started > wanted)
713 etp_end_thread ();
714}
715
716/*****************************************************************************/
717
718static void
719grp_try_feed (eio_req *grp)
720{
721 while (grp->size < grp->int2 && !EIO_CANCELLED (grp))
722 {
723 grp->flags &= ~EIO_FLAG_GROUPADD;
724
725 EIO_FEED (grp);
726
727 /* stop if no progress has been made */
728 if (!(grp->flags & EIO_FLAG_GROUPADD))
729 {
730 grp->feed = 0;
731 break;
732 }
733 }
734}
735
736static int
737grp_dec (eio_req *grp)
738{
739 --grp->size;
740
741 /* call feeder, if applicable */
742 grp_try_feed (grp);
743
744 /* finish, if done */
745 if (!grp->size && grp->int1)
746 return eio_finish (grp);
747 else
748 return 0;
749}
750
751static void
752eio_destroy (eio_req *req)
753{
754 if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1);
755 if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
756
757 EIO_DESTROY (req);
758}
759
760static int
761eio_finish (eio_req *req)
762{
763 int res = EIO_FINISH (req);
764
765 if (req->grp)
766 {
767 int res2;
768 eio_req *grp = req->grp;
769
770 /* unlink request */
771 if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
772 if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
773
774 if (grp->grp_first == req)
775 grp->grp_first = req->grp_next;
776
777 res2 = grp_dec (grp);
778
779 if (!res)
780 res = res2;
781 }
782
783 eio_destroy (req);
784
785 return res;
786}
787
788void
789eio_grp_cancel (eio_req *grp)
790{
791 for (grp = grp->grp_first; grp; grp = grp->grp_next)
792 eio_cancel (grp);
793}
794
795void
796eio_cancel (eio_req *req)
797{
798 etp_cancel (req);
799}
800
801void
802eio_submit (eio_req *req)
803{
804 etp_submit (req);
805}
806
807unsigned int
808eio_nreqs (void)
809{
810 return etp_nreqs ();
811}
812
813unsigned int
814eio_nready (void)
815{
816 return etp_nready ();
817}
818
819unsigned int
820eio_npending (void)
821{
822 return etp_npending ();
823}
824
825unsigned int ecb_cold
826eio_nthreads (void)
827{
828 return etp_nthreads ();
829}
830
831void ecb_cold
832eio_set_max_poll_time (double nseconds)
833{
834 etp_set_max_poll_time (nseconds);
835}
836
837void ecb_cold
838eio_set_max_poll_reqs (unsigned int maxreqs)
839{
840 etp_set_max_poll_reqs (maxreqs);
841}
842
843void ecb_cold
844eio_set_max_idle (unsigned int nthreads)
845{
846 etp_set_max_idle (nthreads);
847}
848
849void ecb_cold
850eio_set_idle_timeout (unsigned int seconds)
851{
852 etp_set_idle_timeout (seconds);
853}
854
855void ecb_cold
856eio_set_min_parallel (unsigned int nthreads)
857{
858 etp_set_min_parallel (nthreads);
859}
860
861void ecb_cold
862eio_set_max_parallel (unsigned int nthreads)
863{
864 etp_set_max_parallel (nthreads);
865}
866
867int eio_poll (void)
868{
869 return etp_poll ();
870}
871
487/*****************************************************************************/ 872/*****************************************************************************/
488/* work around various missing functions */ 873/* work around various missing functions */
489 874
490#if !HAVE_PREADWRITE 875#if !HAVE_PREADWRITE
876# undef pread
877# undef pwrite
491# define pread aio_pread 878# define pread eio__pread
492# define pwrite aio_pwrite 879# define pwrite eio__pwrite
493 880
494/* 881static ssize_t
495 * make our pread/pwrite safe against themselves, but not against 882eio__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{ 883{
503 ssize_t res; 884 ssize_t res;
504 off_t ooffset; 885 off_t ooffset;
505 886
506 X_LOCK (preadwritelock); 887 X_LOCK (preadwritelock);
511 X_UNLOCK (preadwritelock); 892 X_UNLOCK (preadwritelock);
512 893
513 return res; 894 return res;
514} 895}
515 896
516static ssize_t pwrite (int fd, void *buf, size_t count, off_t offset) 897static ssize_t
898eio__pwrite (int fd, void *buf, size_t count, off_t offset)
517{ 899{
518 ssize_t res; 900 ssize_t res;
519 off_t ooffset; 901 off_t ooffset;
520 902
521 X_LOCK (preadwritelock); 903 X_LOCK (preadwritelock);
522 ooffset = lseek (fd, 0, SEEK_CUR); 904 ooffset = lseek (fd, 0, SEEK_CUR);
523 lseek (fd, offset, SEEK_SET); 905 lseek (fd, offset, SEEK_SET);
524 res = write (fd, buf, count); 906 res = write (fd, buf, count);
525 lseek (fd, offset, SEEK_SET); 907 lseek (fd, ooffset, SEEK_SET);
526 X_UNLOCK (preadwritelock); 908 X_UNLOCK (preadwritelock);
527 909
528 return res; 910 return res;
529} 911}
530#endif 912#endif
531 913
532#ifndef HAVE_FUTIMES 914#ifndef HAVE_UTIMES
533 915
916# undef utimes
534# define utimes(path,times) aio_utimes (path, times) 917# define utimes(path,times) eio__utimes (path, times)
535# define futimes(fd,times) aio_futimes (fd, times)
536 918
919static int
537static int aio_utimes (const char *filename, const struct timeval times[2]) 920eio__utimes (const char *filename, const struct timeval times[2])
538{ 921{
539 if (times) 922 if (times)
540 { 923 {
541 struct utimbuf buf; 924 struct utimbuf buf;
542 925
547 } 930 }
548 else 931 else
549 return utime (filename, 0); 932 return utime (filename, 0);
550} 933}
551 934
935#endif
936
937#ifndef HAVE_FUTIMES
938
939# undef futimes
940# define futimes(fd,times) eio__futimes (fd, times)
941
942static int
552static int aio_futimes (int fd, const struct timeval tv[2]) 943eio__futimes (int fd, const struct timeval tv[2])
553{ 944{
554 errno = ENOSYS; 945 errno = ENOSYS;
555 return -1; 946 return -1;
556} 947}
557 948
558#endif 949#endif
559 950
560#if !HAVE_FDATASYNC 951#if !HAVE_FDATASYNC
952# undef fdatasync
561# define fdatasync fsync 953# define fdatasync(fd) fsync (fd)
562#endif 954#endif
955
956/* sync_file_range always needs emulation */
957static int
958eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags)
959{
960#if HAVE_SYNC_FILE_RANGE
961 int res;
962
963 if (EIO_SYNC_FILE_RANGE_WAIT_BEFORE != SYNC_FILE_RANGE_WAIT_BEFORE
964 || EIO_SYNC_FILE_RANGE_WRITE != SYNC_FILE_RANGE_WRITE
965 || EIO_SYNC_FILE_RANGE_WAIT_AFTER != SYNC_FILE_RANGE_WAIT_AFTER)
966 {
967 flags = 0
968 | (flags & EIO_SYNC_FILE_RANGE_WAIT_BEFORE ? SYNC_FILE_RANGE_WAIT_BEFORE : 0)
969 | (flags & EIO_SYNC_FILE_RANGE_WRITE ? SYNC_FILE_RANGE_WRITE : 0)
970 | (flags & EIO_SYNC_FILE_RANGE_WAIT_AFTER ? SYNC_FILE_RANGE_WAIT_AFTER : 0);
971 }
972
973 res = sync_file_range (fd, offset, nbytes, flags);
974
975 if (!res || errno != ENOSYS)
976 return res;
977#endif
978
979 /* even though we could play tricks with the flags, it's better to always
980 * call fdatasync, as that matches the expectation of its users best */
981 return fdatasync (fd);
982}
983
984static int
985eio__fallocate (int fd, int mode, off_t offset, size_t len)
986{
987#if HAVE_FALLOCATE
988 return fallocate (fd, mode, offset, len);
989#else
990 errno = ENOSYS;
991 return -1;
992#endif
993}
563 994
564#if !HAVE_READAHEAD 995#if !HAVE_READAHEAD
996# undef readahead
565# define readahead(fd,offset,count) aio_readahead (fd, offset, count, self) 997# define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)
566 998
999static ssize_t
567static ssize_t aio_readahead (int fd, off_t offset, size_t count, worker *self) 1000eio__readahead (int fd, off_t offset, size_t count, etp_worker *self)
568{ 1001{
569 size_t todo = count; 1002 size_t todo = count;
570 dBUF; 1003 dBUF;
571 1004
572 while (todo > 0) 1005 while (todo > 0)
573 { 1006 {
574 size_t len = todo < EIO_BUFSIZE ? todo : EIO_BUFSIZE; 1007 size_t len = todo < EIO_BUFSIZE ? todo : EIO_BUFSIZE;
575 1008
576 pread (fd, aio_buf, len, offset); 1009 pread (fd, eio_buf, len, offset);
577 offset += len; 1010 offset += len;
578 todo -= len; 1011 todo -= len;
579 } 1012 }
580 1013
581 errno = 0; 1014 errno = 0;
582 return count; 1015 return count;
583} 1016}
584 1017
585#endif 1018#endif
586 1019
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 */ 1020/* sendfile always needs emulation */
1021static ssize_t
618static ssize_t sendfile_ (int ofd, int ifd, off_t offset, size_t count, worker *self) 1022eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self)
619{ 1023{
1024 ssize_t written = 0;
620 ssize_t res; 1025 ssize_t res;
621 1026
622 if (!count) 1027 if (!count)
623 return 0; 1028 return 0;
624 1029
1030 for (;;)
1031 {
1032#ifdef __APPLE__
1033# undef HAVE_SENDFILE /* broken, as everything on os x */
1034#endif
625#if HAVE_SENDFILE 1035#if HAVE_SENDFILE
626# if __linux 1036# if __linux
1037 off_t soffset = offset;
627 res = sendfile (ofd, ifd, &offset, count); 1038 res = sendfile (ofd, ifd, &soffset, count);
628 1039
629# elif __freebsd 1040# elif __FreeBSD__
630 /* 1041 /*
631 * Of course, the freebsd sendfile is a dire hack with no thoughts 1042 * Of course, the freebsd sendfile is a dire hack with no thoughts
632 * wasted on making it similar to other I/O functions. 1043 * wasted on making it similar to other I/O functions.
633 */ 1044 */
634 {
635 off_t sbytes; 1045 off_t sbytes;
636 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); 1046 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
637 1047
638 if (res < 0 && sbytes) 1048 #if 0 /* according to the manpage, this is correct, but broken behaviour */
639 /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ 1049 /* freebsd' sendfile will return 0 on success */
1050 /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */
1051 /* not on e.g. EIO or EPIPE - sounds broken */
1052 if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0)
640 res = sbytes; 1053 res = sbytes;
641 } 1054 #endif
1055
1056 /* according to source inspection, this is correct, and useful behaviour */
1057 if (sbytes)
1058 res = sbytes;
1059
1060# elif defined (__APPLE__)
1061 off_t sbytes = count;
1062 res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
1063
1064 /* according to the manpage, sbytes is always valid */
1065 if (sbytes)
1066 res = sbytes;
642 1067
643# elif __hpux 1068# elif __hpux
644 res = sendfile (ofd, ifd, offset, count, 0, 0); 1069 res = sendfile (ofd, ifd, offset, count, 0, 0);
645 1070
646# elif __solaris 1071# elif __solaris
647 {
648 struct sendfilevec vec; 1072 struct sendfilevec vec;
649 size_t sbytes; 1073 size_t sbytes;
650 1074
651 vec.sfv_fd = ifd; 1075 vec.sfv_fd = ifd;
652 vec.sfv_flag = 0; 1076 vec.sfv_flag = 0;
653 vec.sfv_off = offset; 1077 vec.sfv_off = offset;
654 vec.sfv_len = count; 1078 vec.sfv_len = count;
655 1079
656 res = sendfilev (ofd, &vec, 1, &sbytes); 1080 res = sendfilev (ofd, &vec, 1, &sbytes);
657 1081
658 if (res < 0 && sbytes) 1082 if (res < 0 && sbytes)
659 res = sbytes; 1083 res = sbytes;
660 }
661 1084
662# endif 1085# endif
1086
1087#elif defined (_WIN32) && 0
1088 /* does not work, just for documentation of what would need to be done */
1089 /* actually, cannot be done like this, as TransmitFile changes the file offset, */
1090 /* libeio guarantees that the file offset does not change, and windows */
1091 /* has no way to get an independent handle to the same file description */
1092 HANDLE h = TO_SOCKET (ifd);
1093 SetFilePointer (h, offset, 0, FILE_BEGIN);
1094 res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
1095
663#else 1096#else
664 res = -1; 1097 res = -1;
665 errno = ENOSYS; 1098 errno = ENOSYS;
666#endif 1099#endif
667 1100
1101 /* we assume sendfile can copy at least 128mb in one go */
1102 if (res <= 128 * 1024 * 1024)
1103 {
1104 if (res > 0)
1105 written += res;
1106
1107 if (written)
1108 return written;
1109
1110 break;
1111 }
1112 else
1113 {
1114 /* if we requested more, then probably the kernel was lazy */
1115 written += res;
1116 offset += res;
1117 count -= res;
1118
1119 if (!count)
1120 return written;
1121 }
1122 }
1123
668 if (res < 0 1124 if (res < 0
669 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK 1125 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK
1126 /* BSDs */
1127#ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */
1128 || errno == ENOTSUP
1129#endif
1130 || errno == EOPNOTSUPP /* BSDs */
670#if __solaris 1131#if __solaris
671 || errno == EAFNOSUPPORT || errno == EPROTOTYPE 1132 || errno == EAFNOSUPPORT || errno == EPROTOTYPE
672#endif 1133#endif
673 ) 1134 )
674 ) 1135 )
705 } 1166 }
706 1167
707 return res; 1168 return res;
708} 1169}
709 1170
1171#ifdef PAGESIZE
1172# define eio_pagesize() PAGESIZE
1173#else
1174static intptr_t
1175eio_pagesize (void)
1176{
1177 static intptr_t page;
1178
1179 if (!page)
1180 page = sysconf (_SC_PAGESIZE);
1181
1182 return page;
1183}
1184#endif
1185
1186static void
1187eio_page_align (void **addr, size_t *length)
1188{
1189 intptr_t mask = eio_pagesize () - 1;
1190
1191 /* round down addr */
1192 intptr_t adj = mask & (intptr_t)*addr;
1193
1194 *addr = (void *)((intptr_t)*addr - adj);
1195 *length += adj;
1196
1197 /* round up length */
1198 *length = (*length + mask) & ~mask;
1199}
1200
1201#if !_POSIX_MEMLOCK
1202# define eio__mlockall(a) eio_nosyscall()
1203#else
1204
1205static int
1206eio__mlockall (int flags)
1207{
1208 #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7
1209 extern int mallopt (int, int);
1210 mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */
1211 #endif
1212
1213 if (EIO_MCL_CURRENT != MCL_CURRENT
1214 || EIO_MCL_FUTURE != MCL_FUTURE)
1215 {
1216 flags = 0
1217 | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0)
1218 | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0);
1219 }
1220
1221 return mlockall (flags);
1222}
1223#endif
1224
1225#if !_POSIX_MEMLOCK_RANGE
1226# define eio__mlock(a,b) EIO_ENOSYS ()
1227#else
1228
1229static int
1230eio__mlock (void *addr, size_t length)
1231{
1232 eio_page_align (&addr, &length);
1233
1234 return mlock (addr, length);
1235}
1236
1237#endif
1238
1239#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1240# define eio__msync(a,b,c) EIO_ENOSYS ()
1241#else
1242
1243static int
1244eio__msync (void *mem, size_t len, int flags)
1245{
1246 eio_page_align (&mem, &len);
1247
1248 if (EIO_MS_ASYNC != MS_SYNC
1249 || EIO_MS_INVALIDATE != MS_INVALIDATE
1250 || EIO_MS_SYNC != MS_SYNC)
1251 {
1252 flags = 0
1253 | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0)
1254 | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0)
1255 | (flags & EIO_MS_SYNC ? MS_SYNC : 0);
1256 }
1257
1258 return msync (mem, len, flags);
1259}
1260
1261#endif
1262
1263static int
1264eio__mtouch (eio_req *req)
1265{
1266 void *mem = req->ptr2;
1267 size_t len = req->size;
1268 int flags = req->int1;
1269
1270 eio_page_align (&mem, &len);
1271
1272 {
1273 intptr_t addr = (intptr_t)mem;
1274 intptr_t end = addr + len;
1275 intptr_t page = eio_pagesize ();
1276
1277 if (addr < end)
1278 if (flags & EIO_MT_MODIFY) /* modify */
1279 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req));
1280 else
1281 do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req));
1282 }
1283
1284 return 0;
1285}
1286
1287/*****************************************************************************/
1288/* requests implemented outside eio_execute, because they are so large */
1289
1290static void
1291eio__realpath (eio_req *req, etp_worker *self)
1292{
1293 char *rel = req->ptr1;
1294 char *res;
1295 char *tmp1, *tmp2;
1296#if SYMLOOP_MAX > 32
1297 int symlinks = SYMLOOP_MAX;
1298#else
1299 int symlinks = 32;
1300#endif
1301
1302 req->result = -1;
1303
1304 errno = EINVAL;
1305 if (!rel)
1306 return;
1307
1308 errno = ENOENT;
1309 if (!*rel)
1310 return;
1311
1312 if (!req->ptr2)
1313 {
1314 X_LOCK (wrklock);
1315 req->flags |= EIO_FLAG_PTR2_FREE;
1316 X_UNLOCK (wrklock);
1317 req->ptr2 = malloc (PATH_MAX * 3);
1318
1319 errno = ENOMEM;
1320 if (!req->ptr2)
1321 return;
1322 }
1323
1324 res = req->ptr2;
1325 tmp1 = res + PATH_MAX;
1326 tmp2 = tmp1 + PATH_MAX;
1327
1328#if 0 /* disabled, the musl way to do things is just too racy */
1329#if __linux && defined(O_NONBLOCK) && defined(O_NOATIME)
1330 /* on linux we may be able to ask the kernel */
1331 {
1332 int fd = open (rel, O_RDONLY | O_NONBLOCK | O_NOCTTY | O_NOATIME);
1333
1334 if (fd >= 0)
1335 {
1336 sprintf (tmp1, "/proc/self/fd/%d", fd);
1337 req->result = readlink (tmp1, res, PATH_MAX);
1338 close (fd);
1339
1340 /* here we should probably stat the open file and the disk file, to make sure they still match */
1341
1342 if (req->result > 0)
1343 goto done;
1344 }
1345 else if (errno == ELOOP || errno == ENAMETOOLONG || errno == ENOENT || errno == ENOTDIR || errno == EIO)
1346 return;
1347 }
1348#endif
1349#endif
1350
1351 if (*rel != '/')
1352 {
1353 if (!getcwd (res, PATH_MAX))
1354 return;
1355
1356 if (res [1]) /* only use if not / */
1357 res += strlen (res);
1358 }
1359
1360 while (*rel)
1361 {
1362 ssize_t len, linklen;
1363 char *beg = rel;
1364
1365 while (*rel && *rel != '/')
1366 ++rel;
1367
1368 len = rel - beg;
1369
1370 if (!len) /* skip slashes */
1371 {
1372 ++rel;
1373 continue;
1374 }
1375
1376 if (beg [0] == '.')
1377 {
1378 if (len == 1)
1379 continue; /* . - nop */
1380
1381 if (beg [1] == '.' && len == 2)
1382 {
1383 /* .. - back up one component, if possible */
1384
1385 while (res != req->ptr2)
1386 if (*--res == '/')
1387 break;
1388
1389 continue;
1390 }
1391 }
1392
1393 errno = ENAMETOOLONG;
1394 if (res + 1 + len + 1 >= tmp1)
1395 return;
1396
1397 /* copy one component */
1398 *res = '/';
1399 memcpy (res + 1, beg, len);
1400
1401 /* zero-terminate, for readlink */
1402 res [len + 1] = 0;
1403
1404 /* now check if it's a symlink */
1405 linklen = readlink (req->ptr2, tmp1, PATH_MAX);
1406
1407 if (linklen < 0)
1408 {
1409 if (errno != EINVAL)
1410 return;
1411
1412 /* it's a normal directory. hopefully */
1413 res += len + 1;
1414 }
1415 else
1416 {
1417 /* yay, it was a symlink - build new path in tmp2 */
1418 int rellen = strlen (rel);
1419
1420 errno = ENAMETOOLONG;
1421 if (linklen + 1 + rellen >= PATH_MAX)
1422 return;
1423
1424 errno = ELOOP;
1425 if (!--symlinks)
1426 return;
1427
1428 if (*tmp1 == '/')
1429 res = req->ptr2; /* symlink resolves to an absolute path */
1430
1431 /* we need to be careful, as rel might point into tmp2 already */
1432 memmove (tmp2 + linklen + 1, rel, rellen + 1);
1433 tmp2 [linklen] = '/';
1434 memcpy (tmp2, tmp1, linklen);
1435
1436 rel = tmp2;
1437 }
1438 }
1439
1440 /* special case for the lone root path */
1441 if (res == req->ptr2)
1442 *res++ = '/';
1443
1444 req->result = res - (char *)req->ptr2;
1445
1446done:
1447 req->ptr2 = realloc (req->ptr2, req->result); /* trade time for space savings */
1448}
1449
1450static signed char
1451eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
1452{
1453 return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
1454 : a->inode < b->inode ? -1
1455 : a->inode > b->inode ? 1
1456 : 0;
1457}
1458
1459#define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1460
1461#define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1462#define EIO_SORT_FAST 60 /* when to only use insertion sort */
1463
1464static void
1465eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1466{
1467 unsigned char bits [9 + sizeof (ino_t) * 8];
1468 unsigned char *bit = bits;
1469
1470 assert (CHAR_BIT == 8);
1471 assert (sizeof (eio_dirent) * 8 < 256);
1472 assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */
1473 assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */
1474
1475 if (size <= EIO_SORT_FAST)
1476 return;
1477
1478 /* first prepare an array of bits to test in our radix sort */
1479 /* try to take endianness into account, as well as differences in ino_t sizes */
1480 /* inode_bits must contain all inodes ORed together */
1481 /* which is used to skip bits that are 0 everywhere, which is very common */
1482 {
1483 ino_t endianness;
1484 int i, j;
1485
1486 /* we store the byte offset of byte n into byte n of "endianness" */
1487 for (i = 0; i < sizeof (ino_t); ++i)
1488 ((unsigned char *)&endianness)[i] = i;
1489
1490 *bit++ = 0;
1491
1492 for (i = 0; i < sizeof (ino_t); ++i)
1493 {
1494 /* shifting off the byte offsets out of "endianness" */
1495 int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1496 endianness >>= 8;
1497
1498 for (j = 0; j < 8; ++j)
1499 if (inode_bits & (((ino_t)1) << (i * 8 + j)))
1500 *bit++ = offs + j;
1501 }
1502
1503 for (j = 0; j < 8; ++j)
1504 if (score_bits & (1 << j))
1505 *bit++ = offsetof (eio_dirent, score) * 8 + j;
1506 }
1507
1508 /* now actually do the sorting (a variant of MSD radix sort) */
1509 {
1510 eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base;
1511 eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end;
1512 unsigned char *bit_stk [9 + sizeof (ino_t) * 8];
1513 int stk_idx = 0;
1514
1515 base_stk [stk_idx] = dents;
1516 end_stk [stk_idx] = dents + size;
1517 bit_stk [stk_idx] = bit - 1;
1518
1519 do
1520 {
1521 base = base_stk [stk_idx];
1522 end = end_stk [stk_idx];
1523 bit = bit_stk [stk_idx];
1524
1525 for (;;)
1526 {
1527 unsigned char O = *bit >> 3;
1528 unsigned char M = 1 << (*bit & 7);
1529
1530 eio_dirent *a = base;
1531 eio_dirent *b = end;
1532
1533 if (b - a < EIO_SORT_CUTOFF)
1534 break;
1535
1536 /* now bit-partition the array on the bit */
1537 /* this ugly asymmetric loop seems to perform much better than typical */
1538 /* partition algos found in the literature */
1539 do
1540 if (!(((unsigned char *)a)[O] & M))
1541 ++a;
1542 else if (!(((unsigned char *)--b)[O] & M))
1543 {
1544 eio_dirent tmp = *a; *a = *b; *b = tmp;
1545 ++a;
1546 }
1547 while (b > a);
1548
1549 /* next bit, or stop, if no bits left in this path */
1550 if (!*--bit)
1551 break;
1552
1553 base_stk [stk_idx] = a;
1554 end_stk [stk_idx] = end;
1555 bit_stk [stk_idx] = bit;
1556 ++stk_idx;
1557
1558 end = a;
1559 }
1560 }
1561 while (stk_idx--);
1562 }
1563}
1564
1565static void
1566eio_dent_insertion_sort (eio_dirent *dents, int size)
1567{
1568 /* first move the smallest element to the front, to act as a sentinel */
1569 {
1570 int i;
1571 eio_dirent *min = dents;
1572
1573 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1574 for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1575 if (EIO_DENT_CMP (dents [i], <, *min))
1576 min = &dents [i];
1577
1578 /* swap elements 0 and j (minimum) */
1579 {
1580 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1581 }
1582 }
1583
1584 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1585 {
1586 eio_dirent *i, *j;
1587
1588 for (i = dents + 1; i < dents + size; ++i)
1589 {
1590 eio_dirent value = *i;
1591
1592 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1593 j [1] = j [0];
1594
1595 j [1] = value;
1596 }
1597 }
1598}
1599
1600static void
1601eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1602{
1603 if (size <= 1)
1604 return; /* our insertion sort relies on size > 0 */
1605
1606 /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1607 /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1608 eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1609
1610 /* use an insertion sort at the end, or for small arrays, */
1611 /* as insertion sort is more efficient for small partitions */
1612 eio_dent_insertion_sort (dents, size);
1613}
1614
710/* read a full directory */ 1615/* read a full directory */
1616static void
711static void scandir_ (eio_req *req, worker *self) 1617eio__scandir (eio_req *req, etp_worker *self)
712{ 1618{
713 DIR *dirp; 1619 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; 1620 EIO_STRUCT_DIRENT *entp;
720 char *name, *names; 1621 char *name, *names;
721 int memlen = 4096; 1622 int namesalloc = 4096;
722 int memofs = 0; 1623 int namesoffs = 0;
1624 int flags = req->int1;
1625 eio_dirent *dents = 0;
1626 int dentalloc = 128;
723 int res = 0; 1627 int dentoffs = 0;
1628 ino_t inode_bits = 0;
1629
1630 req->result = -1;
1631
1632 if (!(flags & EIO_READDIR_DENTS))
1633 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
724 1634
725 X_LOCK (wrklock); 1635 X_LOCK (wrklock);
1636 /* the corresponding closedir is in ETP_WORKER_CLEAR */
726 self->dirp = dirp = opendir (req->ptr1); 1637 self->dirp = dirp = opendir (req->ptr1);
727 self->dbuf = u = malloc (sizeof (*u)); 1638
728 req->flags |= EIO_FLAG_PTR2_FREE; 1639 if (req->flags & EIO_FLAG_PTR1_FREE)
1640 free (req->ptr1);
1641
1642 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1643 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
729 req->ptr2 = names = malloc (memlen); 1644 req->ptr2 = names = malloc (namesalloc);
730 X_UNLOCK (wrklock); 1645 X_UNLOCK (wrklock);
731 1646
732 if (dirp && u && names) 1647 if (dirp && names && (!flags || dents))
733 for (;;) 1648 for (;;)
734 { 1649 {
735 errno = 0; 1650 errno = 0;
736 readdir_r (dirp, &u->d, &entp); 1651 entp = readdir (dirp);
737 1652
738 if (!entp) 1653 if (!entp)
1654 {
1655 if (errno)
1656 break;
1657
1658 /* sort etc. */
1659 req->int1 = flags;
1660 req->result = dentoffs;
1661
1662 if (flags & EIO_READDIR_STAT_ORDER)
1663 eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits);
1664 else if (flags & EIO_READDIR_DIRS_FIRST)
1665 if (flags & EIO_READDIR_FOUND_UNKNOWN)
1666 eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1667 else
1668 {
1669 /* in this case, all is known, and we just put dirs first and sort them */
1670 eio_dirent *oth = dents + dentoffs;
1671 eio_dirent *dir = dents;
1672
1673 /* now partition dirs to the front, and non-dirs to the back */
1674 /* by walking from both sides and swapping if necessary */
1675 while (oth > dir)
1676 {
1677 if (dir->type == EIO_DT_DIR)
1678 ++dir;
1679 else if ((--oth)->type == EIO_DT_DIR)
1680 {
1681 eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1682
1683 ++dir;
1684 }
1685 }
1686
1687 /* now sort the dirs only (dirs all have the same score) */
1688 eio_dent_sort (dents, dir - dents, 0, inode_bits);
1689 }
1690
739 break; 1691 break;
1692 }
740 1693
1694 /* now add the entry to our list(s) */
741 name = entp->d_name; 1695 name = entp->d_name;
742 1696
1697 /* skip . and .. entries */
743 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) 1698 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
744 { 1699 {
745 int len = strlen (name) + 1; 1700 int len = D_NAMLEN (entp) + 1;
746 1701
747 res++; 1702 while (ecb_expect_false (namesoffs + len > namesalloc))
748
749 while (memofs + len > memlen)
750 { 1703 {
751 memlen *= 2; 1704 namesalloc *= 2;
752 X_LOCK (wrklock); 1705 X_LOCK (wrklock);
753 req->ptr2 = names = realloc (names, memlen); 1706 req->ptr2 = names = realloc (names, namesalloc);
754 X_UNLOCK (wrklock); 1707 X_UNLOCK (wrklock);
755 1708
756 if (!names) 1709 if (!names)
757 break; 1710 break;
758 } 1711 }
759 1712
760 memcpy (names + memofs, name, len); 1713 memcpy (names + namesoffs, name, len);
1714
1715 if (dents)
1716 {
1717 struct eio_dirent *ent;
1718
1719 if (ecb_expect_false (dentoffs == dentalloc))
1720 {
1721 dentalloc *= 2;
1722 X_LOCK (wrklock);
1723 req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1724 X_UNLOCK (wrklock);
1725
1726 if (!dents)
1727 break;
1728 }
1729
1730 ent = dents + dentoffs;
1731
1732 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1733 ent->namelen = len - 1;
1734 ent->inode = D_INO (entp);
1735
1736 inode_bits |= ent->inode;
1737
1738 switch (D_TYPE (entp))
1739 {
1740 default:
1741 ent->type = EIO_DT_UNKNOWN;
1742 flags |= EIO_READDIR_FOUND_UNKNOWN;
1743 break;
1744
1745 #ifdef DT_FIFO
1746 case DT_FIFO: ent->type = EIO_DT_FIFO; break;
1747 #endif
1748 #ifdef DT_CHR
1749 case DT_CHR: ent->type = EIO_DT_CHR; break;
1750 #endif
1751 #ifdef DT_MPC
1752 case DT_MPC: ent->type = EIO_DT_MPC; break;
1753 #endif
1754 #ifdef DT_DIR
1755 case DT_DIR: ent->type = EIO_DT_DIR; break;
1756 #endif
1757 #ifdef DT_NAM
1758 case DT_NAM: ent->type = EIO_DT_NAM; break;
1759 #endif
1760 #ifdef DT_BLK
1761 case DT_BLK: ent->type = EIO_DT_BLK; break;
1762 #endif
1763 #ifdef DT_MPB
1764 case DT_MPB: ent->type = EIO_DT_MPB; break;
1765 #endif
1766 #ifdef DT_REG
1767 case DT_REG: ent->type = EIO_DT_REG; break;
1768 #endif
1769 #ifdef DT_NWK
1770 case DT_NWK: ent->type = EIO_DT_NWK; break;
1771 #endif
1772 #ifdef DT_CMP
1773 case DT_CMP: ent->type = EIO_DT_CMP; break;
1774 #endif
1775 #ifdef DT_LNK
1776 case DT_LNK: ent->type = EIO_DT_LNK; break;
1777 #endif
1778 #ifdef DT_SOCK
1779 case DT_SOCK: ent->type = EIO_DT_SOCK; break;
1780 #endif
1781 #ifdef DT_DOOR
1782 case DT_DOOR: ent->type = EIO_DT_DOOR; break;
1783 #endif
1784 #ifdef DT_WHT
1785 case DT_WHT: ent->type = EIO_DT_WHT; break;
1786 #endif
1787 }
1788
1789 ent->score = 7;
1790
1791 if (flags & EIO_READDIR_DIRS_FIRST)
1792 {
1793 if (ent->type == EIO_DT_UNKNOWN)
1794 {
1795 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1796 ent->score = 1;
1797 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1798 ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1799 }
1800 else if (ent->type == EIO_DT_DIR)
1801 ent->score = 0;
1802 }
1803 }
1804
761 memofs += len; 1805 namesoffs += len;
1806 ++dentoffs;
1807 }
1808
1809 if (EIO_CANCELLED (req))
1810 {
1811 errno = ECANCELED;
1812 break;
762 } 1813 }
763 } 1814 }
764
765 if (errno)
766 res = -1;
767
768 req->result = res;
769} 1815}
770 1816
771/*****************************************************************************/ 1817/*****************************************************************************/
772 1818
1819#define ALLOC(len) \
1820 if (!req->ptr2) \
1821 { \
1822 X_LOCK (wrklock); \
1823 req->flags |= EIO_FLAG_PTR2_FREE; \
1824 X_UNLOCK (wrklock); \
1825 req->ptr2 = malloc (len); \
1826 if (!req->ptr2) \
1827 { \
1828 errno = ENOMEM; \
1829 req->result = -1; \
1830 break; \
1831 } \
1832 }
1833
773X_THREAD_PROC (eio_proc) 1834X_THREAD_PROC (etp_proc)
774{ 1835{
775 eio_req *req; 1836 ETP_REQ *req;
776 struct timespec ts; 1837 struct timespec ts;
777 worker *self = (worker *)thr_arg; 1838 etp_worker *self = (etp_worker *)thr_arg;
1839 int timeout;
778 1840
779 /* try to distribute timeouts somewhat randomly */ 1841 /* try to distribute timeouts somewhat evenly */
780 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); 1842 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
781 1843
782 for (;;) 1844 for (;;)
783 { 1845 {
784 ts.tv_sec = time (0) + IDLE_TIMEOUT; 1846 ts.tv_sec = 0;
785 1847
786 X_LOCK (reqlock); 1848 X_LOCK (reqlock);
787 1849
788 for (;;) 1850 for (;;)
789 { 1851 {
790 self->req = req = reqq_shift (&req_queue); 1852 self->req = req = reqq_shift (&req_queue);
791 1853
792 if (req) 1854 if (req)
793 break; 1855 break;
794 1856
1857 if (ts.tv_sec == 1) /* no request, but timeout detected, let's quit */
1858 {
1859 X_UNLOCK (reqlock);
1860 X_LOCK (wrklock);
1861 --started;
1862 X_UNLOCK (wrklock);
1863 goto quit;
1864 }
1865
795 ++idle; 1866 ++idle;
796 1867
797 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) 1868 if (idle <= max_idle)
1869 /* we are allowed to idle, so do so without any timeout */
1870 X_COND_WAIT (reqwait, reqlock);
1871 else
798 { 1872 {
799 if (idle > max_idle) 1873 /* initialise timeout once */
800 { 1874 if (!ts.tv_sec)
801 --idle; 1875 ts.tv_sec = time (0) + idle_timeout;
802 X_UNLOCK (reqlock);
803 X_LOCK (wrklock);
804 --started;
805 X_UNLOCK (wrklock);
806 goto quit;
807 }
808 1876
809 /* we are allowed to idle, so do so without any timeout */
810 X_COND_WAIT (reqwait, reqlock); 1877 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
811 ts.tv_sec = time (0) + IDLE_TIMEOUT; 1878 ts.tv_sec = 1; /* assuming this is not a value computed above.,.. */
812 } 1879 }
813 1880
814 --idle; 1881 --idle;
815 } 1882 }
816 1883
817 --nready; 1884 --nready;
818 1885
819 X_UNLOCK (reqlock); 1886 X_UNLOCK (reqlock);
820 1887
821 errno = 0; /* strictly unnecessary */
822
823 if (!EIO_CANCELLED (req))
824 switch (req->type) 1888 if (req->type < 0)
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; 1889 goto quit;
910 1890
911 default: 1891 ETP_EXECUTE (self, req);
912 req->result = -1;
913 break;
914 }
915
916 req->errorno = errno;
917 1892
918 X_LOCK (reslock); 1893 X_LOCK (reslock);
919 1894
920 ++npending; 1895 ++npending;
921 1896
922 if (!reqq_push (&res_queue, req) && want_poll_cb) 1897 if (!reqq_push (&res_queue, req) && want_poll_cb)
923 want_poll_cb (); 1898 want_poll_cb ();
924 1899
925 self->req = 0; 1900 self->req = 0;
926 worker_clear (self); 1901 etp_worker_clear (self);
927 1902
928 X_UNLOCK (reslock); 1903 X_UNLOCK (reslock);
929 } 1904 }
930 1905
931quit: 1906quit:
932 X_LOCK (wrklock); 1907 X_LOCK (wrklock);
933 worker_free (self); 1908 etp_worker_free (self);
934 X_UNLOCK (wrklock); 1909 X_UNLOCK (wrklock);
935 1910
936 return 0; 1911 return 0;
937} 1912}
938 1913
939/*****************************************************************************/ 1914/*****************************************************************************/
940 1915
941static void eio_atfork_prepare (void) 1916int ecb_cold
1917eio_init (void (*want_poll)(void), void (*done_poll)(void))
942{ 1918{
943 X_LOCK (wrklock); 1919 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} 1920}
953 1921
954static void eio_atfork_parent (void) 1922ecb_inline void
1923eio_api_destroy (eio_req *req)
955{ 1924{
956#if !HAVE_READDIR_R 1925 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} 1926}
966 1927
967static void eio_atfork_child (void) 1928#define REQ(rtype) \
968{ 1929 eio_req *req; \
969 eio_req *prv; 1930 \
1931 req = (eio_req *)calloc (1, sizeof *req); \
1932 if (!req) \
1933 return 0; \
1934 \
1935 req->type = rtype; \
1936 req->pri = pri; \
1937 req->finish = cb; \
1938 req->data = data; \
1939 req->destroy = eio_api_destroy;
970 1940
971 while (prv = reqq_shift (&req_queue)) 1941#define SEND eio_submit (req); return req
972 eio_destroy (prv);
973 1942
974 while (prv = reqq_shift (&res_queue)) 1943#define PATH \
975 eio_destroy (prv); 1944 req->flags |= EIO_FLAG_PTR1_FREE; \
1945 req->ptr1 = strdup (path); \
1946 if (!req->ptr1) \
1947 { \
1948 eio_api_destroy (req); \
1949 return 0; \
1950 }
976 1951
977 while (wrk_first.next != &wrk_first) 1952static void
1953eio_execute (etp_worker *self, eio_req *req)
1954{
1955 if (ecb_expect_false (EIO_CANCELLED (req)))
978 { 1956 {
979 worker *wrk = wrk_first.next; 1957 req->result = -1;
1958 req->errorno = ECANCELED;
1959 return;
1960 }
980 1961
981 if (wrk->req) 1962 switch (req->type)
982 eio_destroy (wrk->req);
983
984 worker_clear (wrk);
985 worker_free (wrk);
986 } 1963 {
1964 case EIO_READ: ALLOC (req->size);
1965 req->result = req->offs >= 0
1966 ? pread (req->int1, req->ptr2, req->size, req->offs)
1967 : read (req->int1, req->ptr2, req->size); break;
1968 case EIO_WRITE: req->result = req->offs >= 0
1969 ? pwrite (req->int1, req->ptr2, req->size, req->offs)
1970 : write (req->int1, req->ptr2, req->size); break;
987 1971
988 started = 0; 1972 case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
989 idle = 0; 1973 case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break;
990 nreqs = 0;
991 nready = 0;
992 npending = 0;
993 1974
994 eio_atfork_parent (); 1975 case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
995} 1976 req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1977 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1978 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1979 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1980 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
996 1981
997int eio_init (void (*want_poll)(void), void (*done_poll)(void)) 1982 case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
998{ 1983 req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
999 want_poll_cb = want_poll; 1984 case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1000 done_poll_cb = done_poll; 1985 req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1001 1986
1987 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
1988 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
1989 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
1990 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
1991 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
1992 case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
1993
1994 case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break;
1995 case EIO_CLOSE: req->result = close (req->int1); break;
1996 case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
1997 case EIO_UNLINK: req->result = unlink (req->ptr1); break;
1998 case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
1999 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
2000 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
2001 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
2002 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
2003 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
2004
2005 case EIO_REALPATH: eio__realpath (req, self); break;
2006
2007 case EIO_READLINK: ALLOC (PATH_MAX);
2008 req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break;
2009
2010 case EIO_SYNC: req->result = 0; sync (); break;
2011 case EIO_FSYNC: req->result = fsync (req->int1); break;
2012 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
2013 case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break;
2014 case EIO_MTOUCH: req->result = eio__mtouch (req); break;
2015 case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break;
2016 case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break;
2017 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
2018 case EIO_FALLOCATE: req->result = eio__fallocate (req->int1, req->int2, req->offs, req->size); break;
2019
2020 case EIO_READDIR: eio__scandir (req, self); break;
2021
2022 case EIO_BUSY:
1002#ifdef _WIN32 2023#ifdef _WIN32
1003 X_MUTEX_CHECK (wrklock); 2024 Sleep (req->nv1 * 1e3);
1004 X_MUTEX_CHECK (reslock); 2025#else
1005 X_MUTEX_CHECK (reqlock); 2026 {
1006 X_MUTEX_CHECK (reqwait); 2027 struct timeval tv;
1007 X_MUTEX_CHECK (preadwritelock);
1008 X_MUTEX_CHECK (readdirlock);
1009 2028
1010 X_COND_CHECK (reqwait); 2029 tv.tv_sec = req->nv1;
1011#endif 2030 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6;
1012 2031
1013 X_THREAD_ATFORK (eio_atfork_prepare, eio_atfork_parent, eio_atfork_child); 2032 req->result = select (0, 0, 0, 0, &tv);
1014} 2033 }
2034#endif
2035 break;
1015 2036
1016#if 0 2037 case EIO_UTIME:
2038 case EIO_FUTIME:
2039 {
2040 struct timeval tv[2];
2041 struct timeval *times;
1017 2042
2043 if (req->nv1 != -1. || req->nv2 != -1.)
2044 {
2045 tv[0].tv_sec = req->nv1;
2046 tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
2047 tv[1].tv_sec = req->nv2;
2048 tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
2049
2050 times = tv;
2051 }
2052 else
2053 times = 0;
2054
2055 req->result = req->type == EIO_FUTIME
2056 ? futimes (req->int1, times)
2057 : utimes (req->ptr1, times);
2058 }
2059 break;
2060
2061 case EIO_GROUP:
2062 abort (); /* handled in eio_request */
2063
2064 case EIO_NOP:
2065 req->result = 0;
2066 break;
2067
2068 case EIO_CUSTOM:
2069 req->feed (req);
2070 break;
2071
2072 default:
2073 errno = ENOSYS;
2074 req->result = -1;
2075 break;
2076 }
2077
2078 req->errorno = errno;
2079}
2080
2081#ifndef EIO_NO_WRAPPERS
2082
2083eio_req *eio_nop (int pri, eio_cb cb, void *data)
2084{
2085 REQ (EIO_NOP); SEND;
2086}
2087
2088eio_req *eio_busy (double delay, int pri, eio_cb cb, void *data)
2089{
2090 REQ (EIO_BUSY); req->nv1 = delay; SEND;
2091}
2092
1018eio_req *eio_fsync (int fd, eio_cb cb); 2093eio_req *eio_sync (int pri, eio_cb cb, void *data)
2094{
2095 REQ (EIO_SYNC); SEND;
2096}
2097
2098eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data)
2099{
2100 REQ (EIO_FSYNC); req->int1 = fd; SEND;
2101}
2102
2103eio_req *eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
2104{
2105 REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
2106}
2107
2108eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
2109{
2110 REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
2111}
2112
2113eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data)
2114{
2115 REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND;
2116}
2117
2118eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data)
2119{
2120 REQ (EIO_MLOCKALL); req->int1 = flags; SEND;
2121}
2122
2123eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
2124{
2125 REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND;
2126}
2127
2128eio_req *eio_fallocate (int fd, int mode, off_t offset, size_t len, int pri, eio_cb cb, void *data)
2129{
2130 REQ (EIO_FALLOCATE); req->int1 = fd; req->int2 = mode; req->offs = offset; req->size = len; SEND;
2131}
2132
1019eio_req *eio_fdatasync (int fd, eio_cb cb); 2133eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data)
1020eio_req *eio_dupclose (int fd, eio_cb cb); 2134{
2135 REQ (EIO_FDATASYNC); req->int1 = fd; SEND;
2136}
2137
2138eio_req *eio_close (int fd, int pri, eio_cb cb, void *data)
2139{
2140 REQ (EIO_CLOSE); req->int1 = fd; SEND;
2141}
2142
1021eio_req *eio_readahead (int fd, off_t offset, size_t length, eio_cb cb); 2143eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data)
1022eio_req *eio_read (int fd, off_t offs, size_t length, char *data, eio_cb cb); 2144{
1023eio_req *eio_write (int fd, off_t offs, size_t length, char *data, eio_cb cb); 2145 REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND;
1024eio_req *eio_fstat (int fd, eio_cb cb); /* stat buffer=ptr2 allocates dynamically */ 2146}
2147
2148eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
2149{
2150 REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
2151}
2152
2153eio_req *eio_write (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
2154{
2155 REQ (EIO_WRITE); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
2156}
2157
2158eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
2159{
2160 REQ (EIO_FSTAT); req->int1 = fd; SEND;
2161}
2162
2163eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data)
2164{
2165 REQ (EIO_FSTATVFS); req->int1 = fd; SEND;
2166}
2167
1025eio_req *eio_futime (int fd, double atime, double mtime, eio_cb cb); 2168eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data)
2169{
2170 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
2171}
2172
1026eio_req *eio_ftruncate (int fd, off_t offset, eio_cb cb); 2173eio_req *eio_ftruncate (int fd, off_t offset, int pri, eio_cb cb, void *data)
2174{
2175 REQ (EIO_FTRUNCATE); req->int1 = fd; req->offs = offset; SEND;
2176}
2177
1027eio_req *eio_fchmod (int fd, mode_t mode, eio_cb cb); 2178eio_req *eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data)
2179{
2180 REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND;
2181}
2182
1028eio_req *eio_fchown (int fd, uid_t uid, gid_t gid, eio_cb cb); 2183eio_req *eio_fchown (int fd, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
2184{
2185 REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
2186}
2187
1029eio_req *eio_dup2 (int fd, int fd2, eio_cb cb); 2188eio_req *eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data)
2189{
2190 REQ (EIO_DUP2); req->int1 = fd; req->int2 = fd2; SEND;
2191}
2192
1030eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, eio_cb cb); 2193eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, int pri, eio_cb cb, void *data)
2194{
2195 REQ (EIO_SENDFILE); req->int1 = out_fd; req->int2 = in_fd; req->offs = in_offset; req->size = length; SEND;
2196}
2197
1031eio_req *eio_open (const char *path, int flags, mode_t mode, eio_cb cb); 2198eio_req *eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data)
1032eio_req *eio_readlink (const char *path, eio_cb cb); /* result=ptr2 allocated dynamically */ 2199{
1033eio_req *eio_stat (const char *path, eio_cb cb); /* stat buffer=ptr2 allocates dynamically */ 2200 REQ (EIO_OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND;
1034eio_req *eio_lstat (const char *path, eio_cb cb); /* stat buffer=ptr2 allocates dynamically */ 2201}
2202
1035eio_req *eio_utime (const char *path, double atime, double mtime, eio_cb cb); 2203eio_req *eio_utime (const char *path, double atime, double mtime, int pri, eio_cb cb, void *data)
2204{
2205 REQ (EIO_UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND;
2206}
2207
1036eio_req *eio_truncate (const char *path, off_t offset, eio_cb cb); 2208eio_req *eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data)
1037eio_req *eio_chmod (const char *path, mode_t mode, eio_cb cb); 2209{
1038eio_req *eio_mkdir (const char *path, mode_t mode, eio_cb cb); 2210 REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND;
2211}
2212
1039eio_req *eio_chown (const char *path, uid_t uid, gid_t gid, eio_cb cb); 2213eio_req *eio_chown (const char *path, uid_t uid, gid_t gid, int pri, eio_cb cb, void *data)
2214{
2215 REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
2216}
2217
2218eio_req *eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
2219{
2220 REQ (EIO_CHMOD); PATH; req->int2 = (long)mode; SEND;
2221}
2222
2223eio_req *eio_mkdir (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
2224{
2225 REQ (EIO_MKDIR); PATH; req->int2 = (long)mode; SEND;
2226}
2227
2228static eio_req *
2229eio__1path (int type, const char *path, int pri, eio_cb cb, void *data)
2230{
2231 REQ (type); PATH; SEND;
2232}
2233
2234eio_req *eio_readlink (const char *path, int pri, eio_cb cb, void *data)
2235{
2236 return eio__1path (EIO_READLINK, path, pri, cb, data);
2237}
2238
2239eio_req *eio_realpath (const char *path, int pri, eio_cb cb, void *data)
2240{
2241 return eio__1path (EIO_REALPATH, path, pri, cb, data);
2242}
2243
2244eio_req *eio_stat (const char *path, int pri, eio_cb cb, void *data)
2245{
2246 return eio__1path (EIO_STAT, path, pri, cb, data);
2247}
2248
2249eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data)
2250{
2251 return eio__1path (EIO_LSTAT, path, pri, cb, data);
2252}
2253
2254eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data)
2255{
2256 return eio__1path (EIO_STATVFS, path, pri, cb, data);
2257}
2258
1040eio_req *eio_unlink (const char *path, eio_cb cb); 2259eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data)
2260{
2261 return eio__1path (EIO_UNLINK, path, pri, cb, data);
2262}
2263
1041eio_req *eio_rmdir (const char *path, eio_cb cb); 2264eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
1042eio_req *eio_readdir (const char *path, eio_cb cb); /* result=ptr2 allocated dynamically */ 2265{
2266 return eio__1path (EIO_RMDIR, path, pri, cb, data);
2267}
2268
2269eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data)
2270{
2271 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
2272}
2273
1043eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, eio_cb cb); 2274eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
1044eio_req *eio_busy (double delay, eio_cb cb); /* ties a thread for this long, simulating busyness */ 2275{
1045eio_req *eio_nop (eio_cb cb); /* does nothing except go through the whole process */ 2276 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND;
2277}
2278
2279static eio_req *
2280eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2281{
2282 REQ (type); PATH;
2283
2284 req->flags |= EIO_FLAG_PTR2_FREE;
2285 req->ptr2 = strdup (new_path);
2286 if (!req->ptr2)
2287 {
2288 eio_api_destroy (req);
2289 return 0;
2290 }
2291
2292 SEND;
2293}
2294
2295eio_req *eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2296{
2297 return eio__2path (EIO_LINK, path, new_path, pri, cb, data);
2298}
2299
2300eio_req *eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2301{
2302 return eio__2path (EIO_SYMLINK, path, new_path, pri, cb, data);
2303}
2304
2305eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2306{
2307 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
2308}
2309
2310eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data)
2311{
2312 REQ (EIO_CUSTOM); req->feed = execute; SEND;
2313}
2314
2315#endif
2316
2317eio_req *eio_grp (eio_cb cb, void *data)
2318{
2319 const int pri = EIO_PRI_MAX;
2320
2321 REQ (EIO_GROUP); SEND;
2322}
2323
2324#undef REQ
2325#undef PATH
2326#undef SEND
2327
2328/*****************************************************************************/
2329/* grp functions */
2330
1046void 2331void
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 {
1130 dREQ;
1131
1132 req->type = ix;
1133 req->sv1 = newSVsv (fh);
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
1142 if (!SvREADONLY (data))
1143 {
1144 SvREADONLY_on (data);
1145 req->flags |= FLAG_SV2_RO_OFF;
1146 }
1147
1148 EIO_SEND;
1149 }
1150}
1151
1152void
1153aio_readlink (SV8 *path, SV *callback=&PL_sv_undef)
1154 PROTOTYPE: $$;$
1155 PPCODE:
1156{
1157 SV *data;
1158 dREQ;
1159
1160 data = newSV (NAME_MAX);
1161 SvPOK_on (data);
1162
1163 req->type = EIO_READLINK;
1164 req->sv1 = newSVsv (path);
1165 req->ptr1 = SvPVbyte_nolen (req->sv1);
1166 req->sv2 = data;
1167 req->ptr2 = SvPVbyte_nolen (data);
1168
1169 EIO_SEND;
1170}
1171
1172void
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}
1189
1190void
1191aio_readahead (SV *fh, SV *offset, IV length, SV *callback=&PL_sv_undef)
1192 PROTOTYPE: $$$;$
1193 PPCODE:
1194{
1195 dREQ;
1196
1197 req->type = EIO_READAHEAD;
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{
1213 dREQ;
1214
1215 req->ptr2 = malloc (sizeof (EIO_STRUCT_STAT));
1216 if (!req->ptr2)
1217 {
1218 req_destroy (req);
1219 croak ("out of memory during aio_stat statdata allocation");
1220 }
1221
1222 req->flags |= FLAG_PTR2_FREE;
1223 req->sv1 = newSVsv (fh_or_path);
1224
1225 if (SvPOK (fh_or_path))
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}
1238
1239void
1240aio_utime (SV8 *fh_or_path, SV *atime, SV *mtime, SV *callback=&PL_sv_undef)
1241 PPCODE:
1242{
1243 dREQ;
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}
1262
1263void
1264aio_truncate (SV8 *fh_or_path, SV *offset, SV *callback=&PL_sv_undef)
1265 PPCODE:
1266{
1267 dREQ;
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}
1285
1286void
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{
1294 dREQ;
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}
1307
1308void
1309aio_chown (SV8 *fh_or_path, SV *uid, SV *gid, SV *callback=&PL_sv_undef)
1310 PPCODE:
1311{
1312 dREQ;
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}
1331
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
1418
1419void eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit) 2332eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit)
1420{ 2333{
1421 grp->int2 = limit; 2334 grp->int2 = limit;
1422 grp->feed = feed; 2335 grp->feed = feed;
1423 2336
1424 grp_try_feed (grp); 2337 grp_try_feed (grp);
1425} 2338}
1426 2339
2340void
1427void eio_grp_limit (eio_req *grp, int limit) 2341eio_grp_limit (eio_req *grp, int limit)
1428{ 2342{
1429 grp->int2 = limit; 2343 grp->int2 = limit;
1430 2344
1431 grp_try_feed (grp); 2345 grp_try_feed (grp);
1432} 2346}
1433 2347
2348void
1434void eio_grp_add (eio_req *grp, eio_req *req) 2349eio_grp_add (eio_req *grp, eio_req *req)
1435{ 2350{
1436 assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); 2351 assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2));
2352
2353 grp->flags |= EIO_FLAG_GROUPADD;
1437 2354
1438 ++grp->size; 2355 ++grp->size;
1439 req->grp = grp; 2356 req->grp = grp;
1440 2357
1441 req->grp_prev = 0; 2358 req->grp_prev = 0;
1445 grp->grp_first->grp_prev = req; 2362 grp->grp_first->grp_prev = req;
1446 2363
1447 grp->grp_first = req; 2364 grp->grp_first = req;
1448} 2365}
1449 2366
2367/*****************************************************************************/
2368/* misc garbage */
1450 2369
2370ssize_t
2371eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
2372{
2373 etp_worker wrk;
2374 ssize_t ret;
2375
2376 wrk.dbuf = 0;
2377
2378 ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
2379
2380 if (wrk.dbuf)
2381 free (wrk.dbuf);
2382
2383 return ret;
2384}
2385

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines