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

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

Diff Legend

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