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

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

Diff Legend

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