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

Comparing libeio/eio.c (file contents):
Revision 1.88 by root, Thu Jul 14 19:31:43 2011 UTC vs.
Revision 1.139 by root, Thu Jun 25 18:14:19 2015 UTC

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

Diff Legend

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