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

Comparing libeio/eio.c (file contents):
Revision 1.17 by root, Tue Jun 3 05:12:51 2008 UTC vs.
Revision 1.144 by root, Tue Dec 27 09:58:44 2016 UTC

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

Diff Legend

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