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.133 by root, Thu Jun 25 13:42:18 2015 UTC

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

Diff Legend

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