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

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

Diff Legend

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