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

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines