ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.104
Committed: Mon Sep 26 16:54:25 2011 UTC (12 years, 8 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.103: +237 -61 lines
Log Message:
preliminary wd support

File Contents

# User Rev Content
1 root 1.14 /*
2     * libeio implementation
3     *
4 root 1.61 * Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libeio@schmorp.de>
5 root 1.14 * All rights reserved.
6     *
7     * Redistribution and use in source and binary forms, with or without modifica-
8     * tion, are permitted provided that the following conditions are met:
9     *
10     * 1. Redistributions of source code must retain the above copyright notice,
11     * this list of conditions and the following disclaimer.
12     *
13     * 2. Redistributions in binary form must reproduce the above copyright
14     * notice, this list of conditions and the following disclaimer in the
15     * documentation and/or other materials provided with the distribution.
16     *
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-
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-
21     * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
22     * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
23     * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
24     * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
25     * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
26     * OF THE POSSIBILITY OF SUCH DAMAGE.
27     *
28     * Alternatively, the contents of this file may be used under the terms of
29     * the GNU General Public License ("GPL") version 2 or any later version,
30     * in which case the provisions of the GPL are applicable instead of
31     * the above. If you wish to allow the use of your version of this file
32     * only under the terms of the GPL and not to allow others to use your
33     * version of this file under the BSD license, indicate your decision
34     * by deleting the provisions above and replace them with the notice
35     * and other provisions required by the GPL. If you do not delete the
36     * provisions above, a recipient may use your version of this file under
37     * either the BSD or the GPL.
38     */
39    
40 root 1.65 #ifndef _WIN32
41     # include "config.h"
42     #endif
43    
44 root 1.1 #include "eio.h"
45 root 1.72 #include "ecb.h"
46 root 1.29
47     #ifdef EIO_STACKSIZE
48 root 1.102 # define X_STACKSIZE EIO_STACKSIZE
49 root 1.29 #endif
50 root 1.1 #include "xthread.h"
51    
52     #include <errno.h>
53     #include <stddef.h>
54     #include <stdlib.h>
55 root 1.3 #include <string.h>
56 root 1.1 #include <errno.h>
57     #include <sys/types.h>
58     #include <sys/stat.h>
59     #include <limits.h>
60     #include <fcntl.h>
61 root 1.8 #include <assert.h>
62 root 1.1
63 root 1.66 /* intptr_t comes from unistd.h, says POSIX/UNIX/tradition */
64 root 1.80 /* intptr_t only comes from stdint.h, says idiot openbsd coder */
65 root 1.66 #if HAVE_STDINT_H
66     # include <stdint.h>
67     #endif
68    
69 root 1.80 #ifndef ECANCELED
70     # define ECANCELED EDOM
71     #endif
72 root 1.90 #ifndef ELOOP
73     # define ELOOP EDOM
74     #endif
75 root 1.80
76 root 1.95 #if !defined(ENOTSOCK) && defined(WSAENOTSOCK)
77     # define ENOTSOCK WSAENOTSOCK
78     #endif
79    
80 root 1.80 static void eio_destroy (eio_req *req);
81    
82 root 1.1 #ifndef EIO_FINISH
83     # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0
84     #endif
85    
86     #ifndef EIO_DESTROY
87     # define EIO_DESTROY(req) do { if ((req)->destroy) (req)->destroy (req); } while (0)
88     #endif
89    
90     #ifndef EIO_FEED
91     # define EIO_FEED(req) do { if ((req)->feed ) (req)->feed (req); } while (0)
92     #endif
93    
94 root 1.86 #ifndef EIO_FD_TO_WIN32_HANDLE
95     # define EIO_FD_TO_WIN32_HANDLE(fd) _get_osfhandle (fd)
96     #endif
97     #ifndef EIO_WIN32_HANDLE_TO_FD
98     # define EIO_WIN32_HANDLE_TO_FD(handle) _open_osfhandle (handle, 0)
99     #endif
100    
101     #define EIO_ERRNO(errval,retval) ((errno = errval), retval)
102    
103     #define EIO_ENOSYS() EIO_ERRNO (ENOSYS, -1)
104    
105 root 1.1 #ifdef _WIN32
106    
107 root 1.90 #undef PAGESIZE
108 root 1.86 #define PAGESIZE 4096 /* GetSystemInfo? */
109    
110 root 1.100 /* TODO: look at how perl does stat (non-sloppy), unlink (ro-files), utime, link */
111    
112 root 1.87 #ifdef EIO_STRUCT_STATI64
113 root 1.100 /* look at perl's non-sloppy stat */
114 root 1.87 #define stat(path,buf) _stati64 (path,buf)
115 root 1.95 #define fstat(fd,buf) _fstati64 (fd,buf)
116 root 1.87 #endif
117 root 1.86 #define lstat(path,buf) stat (path,buf)
118 root 1.90 #define fsync(fd) (FlushFileBuffers ((HANDLE)EIO_FD_TO_WIN32_HANDLE (fd)) ? 0 : EIO_ERRNO (EBADF, -1))
119 root 1.86 #define mkdir(path,mode) _mkdir (path)
120     #define link(old,neu) (CreateHardLink (neu, old, 0) ? 0 : EIO_ERRNO (ENOENT, -1))
121    
122 root 1.90 #define chmod(path,mode) _chmod (path, mode)
123 root 1.91 #define dup(fd) _dup (fd)
124     #define dup2(fd1,fd2) _dup2 (fd1, fd2)
125    
126 root 1.90 #define fchmod(fd,mode) EIO_ENOSYS ()
127 root 1.86 #define chown(path,uid,gid) EIO_ENOSYS ()
128     #define fchown(fd,uid,gid) EIO_ENOSYS ()
129     #define truncate(path,offs) EIO_ENOSYS () /* far-miss: SetEndOfFile */
130     #define ftruncate(fd,offs) EIO_ENOSYS () /* near-miss: SetEndOfFile */
131     #define mknod(path,mode,dev) EIO_ENOSYS ()
132     #define sync() EIO_ENOSYS ()
133 root 1.90 #define readlink(path,buf,s) EIO_ENOSYS ()
134     #define statvfs(path,buf) EIO_ENOSYS ()
135     #define fstatvfs(fd,buf) EIO_ENOSYS ()
136 root 1.86
137 root 1.99 /* rename() uses MoveFile, which fails to overwrite */
138     #define rename(old,neu) eio__rename (old, neu)
139    
140     static int
141     eio__rename (const char *old, const char *neu)
142     {
143     if (MoveFileEx (old, neu, MOVEFILE_REPLACE_EXISTING))
144     return 0;
145    
146     /* should steal _dosmaperr */
147     switch (GetLastError ())
148     {
149     case ERROR_FILE_NOT_FOUND:
150     case ERROR_PATH_NOT_FOUND:
151     case ERROR_INVALID_DRIVE:
152     case ERROR_NO_MORE_FILES:
153     case ERROR_BAD_NETPATH:
154     case ERROR_BAD_NET_NAME:
155     case ERROR_BAD_PATHNAME:
156     case ERROR_FILENAME_EXCED_RANGE:
157     errno = ENOENT;
158     break;
159    
160     default:
161     errno = EACCES;
162     break;
163     }
164    
165     return -1;
166     }
167    
168 root 1.86 /* we could even stat and see if it exists */
169     static int
170     symlink (const char *old, const char *neu)
171     {
172 root 1.90 #if WINVER >= 0x0600
173     if (CreateSymbolicLink (neu, old, 1))
174     return 0;
175 root 1.86
176 root 1.90 if (CreateSymbolicLink (neu, old, 0))
177     return 0;
178     #endif
179 root 1.86
180     return EIO_ERRNO (ENOENT, -1);
181     }
182    
183 root 1.90 /* POSIX API only */
184 root 1.91 #define CreateHardLink(neu,old,flags) 0
185 root 1.90 #define CreateSymbolicLink(neu,old,flags) 0
186    
187     struct statvfs
188     {
189     int dummy;
190     };
191    
192 root 1.91 #define DT_DIR EIO_DT_DIR
193     #define DT_REG EIO_DT_REG
194     #define D_NAME(entp) entp.cFileName
195     #define D_TYPE(entp) (entp.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY ? DT_DIR : DT_REG)
196    
197 root 1.1 #else
198    
199 root 1.86 #include <sys/time.h>
200     #include <sys/select.h>
201     #include <sys/statvfs.h>
202     #include <unistd.h>
203     #include <signal.h>
204     #include <dirent.h>
205    
206     #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES
207     #include <sys/mman.h>
208     #endif
209    
210 root 1.91 #define D_NAME(entp) entp->d_name
211    
212 root 1.86 /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */
213     #if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__
214     #define _DIRENT_HAVE_D_TYPE /* sigh */
215     #define D_INO(de) (de)->d_fileno
216     #define D_NAMLEN(de) (de)->d_namlen
217     #elif __linux || defined d_ino || _XOPEN_SOURCE >= 600
218     #define D_INO(de) (de)->d_ino
219     #endif
220 root 1.31
221 root 1.86 #ifdef _D_EXACT_NAMLEN
222     #undef D_NAMLEN
223     #define D_NAMLEN(de) _D_EXACT_NAMLEN (de)
224     #endif
225 root 1.33
226 root 1.86 #ifdef _DIRENT_HAVE_D_TYPE
227     #define D_TYPE(de) (de)->d_type
228     #endif
229 root 1.31
230 root 1.86 #ifndef EIO_STRUCT_DIRENT
231     #define EIO_STRUCT_DIRENT struct dirent
232     #endif
233 root 1.1
234     #endif
235    
236 root 1.96 #if HAVE_UTIMES
237     # include <utime.h>
238     #endif
239    
240 root 1.98 #if HAVE_SYS_SYSCALL_H
241     # include <sys/syscall.h>
242     #endif
243    
244     #if HAVE_SYS_PRCTL_H
245     # include <sys/prctl.h>
246     #endif
247    
248 root 1.1 #if HAVE_SENDFILE
249     # if __linux
250     # include <sys/sendfile.h>
251 root 1.50 # elif __FreeBSD__ || defined __APPLE__
252 root 1.1 # include <sys/socket.h>
253     # include <sys/uio.h>
254     # elif __hpux
255     # include <sys/socket.h>
256 root 1.45 # elif __solaris
257 root 1.1 # include <sys/sendfile.h>
258     # else
259     # error sendfile support requested but not available
260     # endif
261     #endif
262    
263 root 1.31 #ifndef D_TYPE
264     # define D_TYPE(de) 0
265     #endif
266     #ifndef D_INO
267     # define D_INO(de) 0
268     #endif
269 root 1.33 #ifndef D_NAMLEN
270 root 1.91 # define D_NAMLEN(entp) strlen (D_NAME (entp))
271 root 1.33 #endif
272 root 1.31
273 root 1.1 /* used for struct dirent, AIX doesn't provide it */
274     #ifndef NAME_MAX
275     # define NAME_MAX 4096
276     #endif
277    
278 root 1.54 /* used for readlink etc. */
279     #ifndef PATH_MAX
280     # define PATH_MAX 4096
281     #endif
282    
283 root 1.1 /* buffer size for various temporary buffers */
284     #define EIO_BUFSIZE 65536
285    
286     #define dBUF \
287 root 1.94 char *eio_buf = malloc (EIO_BUFSIZE); \
288 root 1.9 errno = ENOMEM; \
289 root 1.1 if (!eio_buf) \
290 root 1.94 return -1
291    
292     #define FUBd \
293     free (eio_buf)
294 root 1.1
295     #define EIO_TICKS ((1000000 + 1023) >> 10)
296    
297 root 1.104 /*****************************************************************************/
298    
299     struct tmpbuf
300     {
301     void *ptr;
302     int len;
303     };
304    
305     static void *
306     tmpbuf_get (struct tmpbuf *buf, int len)
307     {
308     if (buf->len < len)
309     {
310     free (buf->ptr);
311     buf->ptr = malloc (buf->len = len);
312     }
313    
314     return buf->ptr;
315     }
316    
317     /*****************************************************************************/
318    
319 root 1.14 #define ETP_PRI_MIN EIO_PRI_MIN
320     #define ETP_PRI_MAX EIO_PRI_MAX
321    
322 root 1.15 struct etp_worker;
323    
324 root 1.14 #define ETP_REQ eio_req
325     #define ETP_DESTROY(req) eio_destroy (req)
326     static int eio_finish (eio_req *req);
327     #define ETP_FINISH(req) eio_finish (req)
328 root 1.15 static void eio_execute (struct etp_worker *self, eio_req *req);
329     #define ETP_EXECUTE(wrk,req) eio_execute (wrk,req)
330 root 1.14
331     /*****************************************************************************/
332    
333     #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
334    
335 root 1.44 /* calculate time difference in ~1/EIO_TICKS of a second */
336 root 1.73 ecb_inline int
337 root 1.72 tvdiff (struct timeval *tv1, struct timeval *tv2)
338 root 1.1 {
339     return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
340     + ((tv2->tv_usec - tv1->tv_usec) >> 10);
341     }
342    
343 root 1.9 static unsigned int started, idle, wanted = 4;
344 root 1.1
345 root 1.14 static void (*want_poll_cb) (void);
346     static void (*done_poll_cb) (void);
347 root 1.13
348 root 1.14 static unsigned int max_poll_time; /* reslock */
349     static unsigned int max_poll_reqs; /* reslock */
350 root 1.13
351 root 1.101 static unsigned int nreqs; /* reqlock */
352     static unsigned int nready; /* reqlock */
353     static unsigned int npending; /* reqlock */
354     static unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */
355     static unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */
356 root 1.13
357 root 1.62 static xmutex_t wrklock;
358     static xmutex_t reslock;
359     static xmutex_t reqlock;
360     static xcond_t reqwait;
361 root 1.1
362 root 1.22 #if !HAVE_PREADWRITE
363     /*
364     * make our pread/pwrite emulation safe against themselves, but not against
365     * normal read/write by using a mutex. slows down execution a lot,
366     * but that's your problem, not mine.
367     */
368 root 1.93 static xmutex_t preadwritelock;
369 root 1.22 #endif
370    
371 root 1.14 typedef struct etp_worker
372 root 1.9 {
373 root 1.104 struct tmpbuf tmpbuf;
374    
375 root 1.14 /* locked by wrklock */
376     struct etp_worker *prev, *next;
377 root 1.1
378 root 1.55 xthread_t tid;
379 root 1.1
380 root 1.94 #ifdef ETP_WORKER_COMMON
381 root 1.14 ETP_WORKER_COMMON
382 root 1.94 #endif
383 root 1.14 } etp_worker;
384    
385 root 1.93 static etp_worker wrk_first; /* NOT etp */
386 root 1.1
387 root 1.14 #define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock)
388     #define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock)
389 root 1.13
390     /* worker threads management */
391 root 1.1
392 root 1.72 static void ecb_cold
393     etp_worker_clear (etp_worker *wrk)
394 root 1.1 {
395     }
396    
397 root 1.72 static void ecb_cold
398     etp_worker_free (etp_worker *wrk)
399 root 1.1 {
400 root 1.104 free (wrk->tmpbuf.ptr);
401    
402 root 1.1 wrk->next->prev = wrk->prev;
403     wrk->prev->next = wrk->next;
404    
405     free (wrk);
406     }
407    
408 root 1.72 static unsigned int
409     etp_nreqs (void)
410 root 1.1 {
411 root 1.14 int retval;
412     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
413     retval = nreqs;
414     if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
415     return retval;
416 root 1.1 }
417    
418 root 1.72 static unsigned int
419     etp_nready (void)
420 root 1.1 {
421     unsigned int retval;
422    
423     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
424     retval = nready;
425     if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
426    
427     return retval;
428     }
429    
430 root 1.72 static unsigned int
431     etp_npending (void)
432 root 1.1 {
433     unsigned int retval;
434    
435     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
436     retval = npending;
437     if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
438    
439     return retval;
440     }
441    
442 root 1.72 static unsigned int
443     etp_nthreads (void)
444 root 1.1 {
445     unsigned int retval;
446    
447     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
448     retval = started;
449     if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
450    
451     return retval;
452     }
453    
454     /*
455     * a somewhat faster data structure might be nice, but
456     * with 8 priorities this actually needs <20 insns
457     * per shift, the most expensive operation.
458     */
459     typedef struct {
460 root 1.14 ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */
461 root 1.1 int size;
462 root 1.14 } etp_reqq;
463 root 1.1
464 root 1.14 static etp_reqq req_queue;
465     static etp_reqq res_queue;
466 root 1.1
467 root 1.91 static void ecb_noinline ecb_cold
468     reqq_init (etp_reqq *q)
469     {
470     int pri;
471    
472     for (pri = 0; pri < ETP_NUM_PRI; ++pri)
473     q->qs[pri] = q->qe[pri] = 0;
474    
475     q->size = 0;
476     }
477    
478 root 1.72 static int ecb_noinline
479     reqq_push (etp_reqq *q, ETP_REQ *req)
480 root 1.1 {
481     int pri = req->pri;
482     req->next = 0;
483    
484     if (q->qe[pri])
485     {
486     q->qe[pri]->next = req;
487     q->qe[pri] = req;
488     }
489     else
490     q->qe[pri] = q->qs[pri] = req;
491    
492     return q->size++;
493     }
494    
495 root 1.72 static ETP_REQ * ecb_noinline
496     reqq_shift (etp_reqq *q)
497 root 1.1 {
498     int pri;
499    
500     if (!q->size)
501     return 0;
502    
503     --q->size;
504    
505 root 1.14 for (pri = ETP_NUM_PRI; pri--; )
506 root 1.1 {
507     eio_req *req = q->qs[pri];
508    
509     if (req)
510     {
511     if (!(q->qs[pri] = (eio_req *)req->next))
512     q->qe[pri] = 0;
513    
514     return req;
515     }
516     }
517    
518     abort ();
519     }
520    
521 root 1.93 static int ecb_cold
522     etp_init (void (*want_poll)(void), void (*done_poll)(void))
523 root 1.62 {
524     X_MUTEX_CREATE (wrklock);
525     X_MUTEX_CREATE (reslock);
526     X_MUTEX_CREATE (reqlock);
527     X_COND_CREATE (reqwait);
528    
529 root 1.91 reqq_init (&req_queue);
530     reqq_init (&res_queue);
531 root 1.13
532 root 1.91 wrk_first.next =
533     wrk_first.prev = &wrk_first;
534 root 1.13
535     started = 0;
536     idle = 0;
537     nreqs = 0;
538     nready = 0;
539     npending = 0;
540    
541 root 1.14 want_poll_cb = want_poll;
542     done_poll_cb = done_poll;
543 root 1.19
544     return 0;
545 root 1.14 }
546    
547     X_THREAD_PROC (etp_proc);
548    
549 root 1.72 static void ecb_cold
550     etp_start_thread (void)
551 root 1.14 {
552     etp_worker *wrk = calloc (1, sizeof (etp_worker));
553    
554     /*TODO*/
555     assert (("unable to allocate worker thread data", wrk));
556    
557     X_LOCK (wrklock);
558    
559     if (thread_create (&wrk->tid, etp_proc, (void *)wrk))
560     {
561     wrk->prev = &wrk_first;
562     wrk->next = wrk_first.next;
563     wrk_first.next->prev = wrk;
564     wrk_first.next = wrk;
565     ++started;
566     }
567     else
568     free (wrk);
569    
570     X_UNLOCK (wrklock);
571     }
572    
573 root 1.72 static void
574     etp_maybe_start_thread (void)
575 root 1.14 {
576 root 1.72 if (ecb_expect_true (etp_nthreads () >= wanted))
577 root 1.14 return;
578    
579     /* todo: maybe use idle here, but might be less exact */
580 root 1.72 if (ecb_expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ()))
581 root 1.14 return;
582    
583     etp_start_thread ();
584     }
585    
586 root 1.72 static void ecb_cold
587     etp_end_thread (void)
588 root 1.14 {
589     eio_req *req = calloc (1, sizeof (eio_req));
590    
591     req->type = -1;
592     req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
593    
594     X_LOCK (reqlock);
595     reqq_push (&req_queue, req);
596     X_COND_SIGNAL (reqwait);
597     X_UNLOCK (reqlock);
598    
599     X_LOCK (wrklock);
600     --started;
601     X_UNLOCK (wrklock);
602     }
603    
604 root 1.72 static int
605     etp_poll (void)
606 root 1.14 {
607     unsigned int maxreqs;
608     unsigned int maxtime;
609     struct timeval tv_start, tv_now;
610    
611     X_LOCK (reslock);
612     maxreqs = max_poll_reqs;
613     maxtime = max_poll_time;
614     X_UNLOCK (reslock);
615    
616     if (maxtime)
617     gettimeofday (&tv_start, 0);
618    
619     for (;;)
620     {
621     ETP_REQ *req;
622    
623     etp_maybe_start_thread ();
624    
625     X_LOCK (reslock);
626     req = reqq_shift (&res_queue);
627    
628     if (req)
629     {
630     --npending;
631    
632     if (!res_queue.size && done_poll_cb)
633     done_poll_cb ();
634     }
635    
636     X_UNLOCK (reslock);
637    
638     if (!req)
639     return 0;
640    
641     X_LOCK (reqlock);
642     --nreqs;
643     X_UNLOCK (reqlock);
644    
645 root 1.72 if (ecb_expect_false (req->type == EIO_GROUP && req->size))
646 root 1.14 {
647     req->int1 = 1; /* mark request as delayed */
648     continue;
649     }
650     else
651     {
652     int res = ETP_FINISH (req);
653 root 1.72 if (ecb_expect_false (res))
654 root 1.14 return res;
655     }
656    
657 root 1.72 if (ecb_expect_false (maxreqs && !--maxreqs))
658 root 1.14 break;
659    
660     if (maxtime)
661     {
662     gettimeofday (&tv_now, 0);
663    
664     if (tvdiff (&tv_start, &tv_now) >= maxtime)
665     break;
666     }
667     }
668    
669     errno = EAGAIN;
670     return -1;
671     }
672    
673 root 1.72 static void
674     etp_cancel (ETP_REQ *req)
675 root 1.14 {
676 root 1.81 req->cancelled = 1;
677 root 1.14
678     eio_grp_cancel (req);
679     }
680    
681 root 1.72 static void
682     etp_submit (ETP_REQ *req)
683 root 1.14 {
684     req->pri -= ETP_PRI_MIN;
685    
686 root 1.72 if (ecb_expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN;
687     if (ecb_expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
688 root 1.24
689 root 1.72 if (ecb_expect_false (req->type == EIO_GROUP))
690 root 1.24 {
691     /* I hope this is worth it :/ */
692     X_LOCK (reqlock);
693     ++nreqs;
694     X_UNLOCK (reqlock);
695    
696     X_LOCK (reslock);
697    
698     ++npending;
699    
700     if (!reqq_push (&res_queue, req) && want_poll_cb)
701     want_poll_cb ();
702 root 1.14
703 root 1.24 X_UNLOCK (reslock);
704     }
705     else
706     {
707     X_LOCK (reqlock);
708     ++nreqs;
709     ++nready;
710     reqq_push (&req_queue, req);
711     X_COND_SIGNAL (reqwait);
712     X_UNLOCK (reqlock);
713 root 1.14
714 root 1.24 etp_maybe_start_thread ();
715     }
716 root 1.14 }
717    
718 root 1.72 static void ecb_cold
719     etp_set_max_poll_time (double nseconds)
720 root 1.14 {
721     if (WORDACCESS_UNSAFE) X_LOCK (reslock);
722 root 1.44 max_poll_time = nseconds * EIO_TICKS;
723 root 1.14 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
724     }
725    
726 root 1.72 static void ecb_cold
727     etp_set_max_poll_reqs (unsigned int maxreqs)
728 root 1.14 {
729     if (WORDACCESS_UNSAFE) X_LOCK (reslock);
730     max_poll_reqs = maxreqs;
731     if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
732     }
733 root 1.13
734 root 1.72 static void ecb_cold
735     etp_set_max_idle (unsigned int nthreads)
736 root 1.14 {
737     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
738 root 1.62 max_idle = nthreads;
739     if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
740     }
741    
742 root 1.72 static void ecb_cold
743     etp_set_idle_timeout (unsigned int seconds)
744 root 1.62 {
745     if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
746     idle_timeout = seconds;
747 root 1.14 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
748 root 1.13 }
749    
750 root 1.72 static void ecb_cold
751     etp_set_min_parallel (unsigned int nthreads)
752 root 1.14 {
753     if (wanted < nthreads)
754     wanted = nthreads;
755     }
756    
757 root 1.72 static void ecb_cold
758     etp_set_max_parallel (unsigned int nthreads)
759 root 1.14 {
760     if (wanted > nthreads)
761     wanted = nthreads;
762    
763     while (started > wanted)
764     etp_end_thread ();
765     }
766 root 1.13
767     /*****************************************************************************/
768    
769 root 1.72 static void
770     grp_try_feed (eio_req *grp)
771 root 1.1 {
772     while (grp->size < grp->int2 && !EIO_CANCELLED (grp))
773     {
774 root 1.26 grp->flags &= ~EIO_FLAG_GROUPADD;
775 root 1.1
776     EIO_FEED (grp);
777    
778     /* stop if no progress has been made */
779 root 1.26 if (!(grp->flags & EIO_FLAG_GROUPADD))
780 root 1.1 {
781     grp->feed = 0;
782 root 1.2 break;
783 root 1.1 }
784     }
785     }
786    
787 root 1.72 static int
788     grp_dec (eio_req *grp)
789 root 1.1 {
790     --grp->size;
791    
792     /* call feeder, if applicable */
793 root 1.2 grp_try_feed (grp);
794 root 1.1
795     /* finish, if done */
796     if (!grp->size && grp->int1)
797 root 1.2 return eio_finish (grp);
798 root 1.1 else
799     return 0;
800     }
801    
802 root 1.80 static void
803 root 1.72 eio_destroy (eio_req *req)
804 root 1.1 {
805 root 1.6 if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1);
806     if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
807 root 1.1
808     EIO_DESTROY (req);
809     }
810    
811 root 1.72 static int
812     eio_finish (eio_req *req)
813 root 1.1 {
814     int res = EIO_FINISH (req);
815    
816     if (req->grp)
817     {
818     int res2;
819     eio_req *grp = req->grp;
820    
821     /* unlink request */
822     if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
823     if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
824    
825     if (grp->grp_first == req)
826     grp->grp_first = req->grp_next;
827    
828     res2 = grp_dec (grp);
829    
830 root 1.79 if (!res)
831 root 1.1 res = res2;
832     }
833    
834     eio_destroy (req);
835    
836     return res;
837     }
838    
839 root 1.72 void
840     eio_grp_cancel (eio_req *grp)
841 root 1.1 {
842     for (grp = grp->grp_first; grp; grp = grp->grp_next)
843     eio_cancel (grp);
844     }
845    
846 root 1.72 void
847     eio_cancel (eio_req *req)
848 root 1.1 {
849 root 1.14 etp_cancel (req);
850     }
851 root 1.1
852 root 1.72 void
853     eio_submit (eio_req *req)
854 root 1.14 {
855     etp_submit (req);
856 root 1.1 }
857    
858 root 1.72 unsigned int
859     eio_nreqs (void)
860 root 1.1 {
861 root 1.14 return etp_nreqs ();
862 root 1.1 }
863    
864 root 1.72 unsigned int
865     eio_nready (void)
866 root 1.1 {
867 root 1.14 return etp_nready ();
868 root 1.1 }
869    
870 root 1.72 unsigned int
871     eio_npending (void)
872 root 1.1 {
873 root 1.14 return etp_npending ();
874 root 1.1 }
875    
876 root 1.72 unsigned int ecb_cold
877     eio_nthreads (void)
878 root 1.1 {
879 root 1.14 return etp_nthreads ();
880 root 1.1 }
881    
882 root 1.72 void ecb_cold
883     eio_set_max_poll_time (double nseconds)
884 root 1.1 {
885 root 1.14 etp_set_max_poll_time (nseconds);
886 root 1.1 }
887    
888 root 1.72 void ecb_cold
889     eio_set_max_poll_reqs (unsigned int maxreqs)
890 root 1.1 {
891 root 1.14 etp_set_max_poll_reqs (maxreqs);
892 root 1.1 }
893    
894 root 1.72 void ecb_cold
895     eio_set_max_idle (unsigned int nthreads)
896 root 1.1 {
897 root 1.14 etp_set_max_idle (nthreads);
898 root 1.1 }
899    
900 root 1.72 void ecb_cold
901     eio_set_idle_timeout (unsigned int seconds)
902 root 1.62 {
903     etp_set_idle_timeout (seconds);
904     }
905    
906 root 1.72 void ecb_cold
907     eio_set_min_parallel (unsigned int nthreads)
908 root 1.1 {
909 root 1.14 etp_set_min_parallel (nthreads);
910 root 1.1 }
911    
912 root 1.72 void ecb_cold
913     eio_set_max_parallel (unsigned int nthreads)
914 root 1.1 {
915 root 1.14 etp_set_max_parallel (nthreads);
916 root 1.1 }
917    
918     int eio_poll (void)
919     {
920 root 1.14 return etp_poll ();
921 root 1.1 }
922    
923     /*****************************************************************************/
924     /* work around various missing functions */
925    
926     #if !HAVE_PREADWRITE
927 root 1.27 # undef pread
928     # undef pwrite
929 root 1.9 # define pread eio__pread
930     # define pwrite eio__pwrite
931 root 1.1
932 root 1.88 static eio_ssize_t
933 root 1.9 eio__pread (int fd, void *buf, size_t count, off_t offset)
934 root 1.1 {
935 root 1.88 eio_ssize_t res;
936 root 1.1 off_t ooffset;
937    
938     X_LOCK (preadwritelock);
939     ooffset = lseek (fd, 0, SEEK_CUR);
940     lseek (fd, offset, SEEK_SET);
941     res = read (fd, buf, count);
942     lseek (fd, ooffset, SEEK_SET);
943     X_UNLOCK (preadwritelock);
944    
945     return res;
946     }
947    
948 root 1.88 static eio_ssize_t
949 root 1.9 eio__pwrite (int fd, void *buf, size_t count, off_t offset)
950 root 1.1 {
951 root 1.88 eio_ssize_t res;
952 root 1.1 off_t ooffset;
953    
954     X_LOCK (preadwritelock);
955     ooffset = lseek (fd, 0, SEEK_CUR);
956     lseek (fd, offset, SEEK_SET);
957     res = write (fd, buf, count);
958 root 1.30 lseek (fd, ooffset, SEEK_SET);
959 root 1.1 X_UNLOCK (preadwritelock);
960    
961     return res;
962     }
963     #endif
964    
965 root 1.59 #ifndef HAVE_UTIMES
966 root 1.1
967 root 1.27 # undef utimes
968 root 1.59 # define utimes(path,times) eio__utimes (path, times)
969 root 1.1
970 root 1.9 static int
971     eio__utimes (const char *filename, const struct timeval times[2])
972 root 1.1 {
973     if (times)
974     {
975     struct utimbuf buf;
976    
977     buf.actime = times[0].tv_sec;
978     buf.modtime = times[1].tv_sec;
979    
980     return utime (filename, &buf);
981     }
982     else
983     return utime (filename, 0);
984     }
985    
986 root 1.59 #endif
987    
988     #ifndef HAVE_FUTIMES
989    
990     # undef futimes
991     # define futimes(fd,times) eio__futimes (fd, times)
992    
993 root 1.72 static int
994     eio__futimes (int fd, const struct timeval tv[2])
995 root 1.1 {
996     errno = ENOSYS;
997     return -1;
998     }
999    
1000     #endif
1001    
1002     #if !HAVE_FDATASYNC
1003 root 1.27 # undef fdatasync
1004     # define fdatasync(fd) fsync (fd)
1005 root 1.1 #endif
1006    
1007 root 1.97 static int
1008     eio__syncfs (int fd)
1009     {
1010     int res;
1011    
1012     #if HAVE_SYS_SYNCFS
1013     res = (int)syscall (__NR_syncfs, (int)(fd));
1014     #else
1015     res = -1;
1016     errno = ENOSYS;
1017     #endif
1018    
1019     if (res < 0 && errno == ENOSYS && fd >= 0)
1020     sync ();
1021    
1022     return res;
1023     }
1024    
1025 root 1.27 /* sync_file_range always needs emulation */
1026 root 1.72 static int
1027 root 1.27 eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags)
1028     {
1029     #if HAVE_SYNC_FILE_RANGE
1030     int res;
1031    
1032     if (EIO_SYNC_FILE_RANGE_WAIT_BEFORE != SYNC_FILE_RANGE_WAIT_BEFORE
1033     || EIO_SYNC_FILE_RANGE_WRITE != SYNC_FILE_RANGE_WRITE
1034     || EIO_SYNC_FILE_RANGE_WAIT_AFTER != SYNC_FILE_RANGE_WAIT_AFTER)
1035     {
1036     flags = 0
1037     | (flags & EIO_SYNC_FILE_RANGE_WAIT_BEFORE ? SYNC_FILE_RANGE_WAIT_BEFORE : 0)
1038     | (flags & EIO_SYNC_FILE_RANGE_WRITE ? SYNC_FILE_RANGE_WRITE : 0)
1039     | (flags & EIO_SYNC_FILE_RANGE_WAIT_AFTER ? SYNC_FILE_RANGE_WAIT_AFTER : 0);
1040     }
1041    
1042     res = sync_file_range (fd, offset, nbytes, flags);
1043    
1044 root 1.28 if (!res || errno != ENOSYS)
1045 root 1.27 return res;
1046     #endif
1047    
1048     /* even though we could play tricks with the flags, it's better to always
1049 root 1.43 * call fdatasync, as that matches the expectation of its users best */
1050 root 1.27 return fdatasync (fd);
1051     }
1052    
1053 root 1.83 static int
1054 root 1.84 eio__fallocate (int fd, int mode, off_t offset, size_t len)
1055 root 1.83 {
1056     #if HAVE_FALLOCATE
1057 root 1.84 return fallocate (fd, mode, offset, len);
1058 root 1.83 #else
1059     errno = ENOSYS;
1060     return -1;
1061     #endif
1062     }
1063    
1064 root 1.1 #if !HAVE_READAHEAD
1065 root 1.27 # undef readahead
1066 root 1.9 # define readahead(fd,offset,count) eio__readahead (fd, offset, count, self)
1067 root 1.1
1068 root 1.88 static eio_ssize_t
1069 root 1.17 eio__readahead (int fd, off_t offset, size_t count, etp_worker *self)
1070 root 1.1 {
1071     size_t todo = count;
1072     dBUF;
1073    
1074     while (todo > 0)
1075     {
1076     size_t len = todo < EIO_BUFSIZE ? todo : EIO_BUFSIZE;
1077    
1078 root 1.3 pread (fd, eio_buf, len, offset);
1079 root 1.1 offset += len;
1080     todo -= len;
1081     }
1082    
1083 root 1.94 FUBd;
1084    
1085 root 1.1 errno = 0;
1086     return count;
1087     }
1088    
1089     #endif
1090    
1091     /* sendfile always needs emulation */
1092 root 1.88 static eio_ssize_t
1093 root 1.94 eio__sendfile (int ofd, int ifd, off_t offset, size_t count)
1094 root 1.1 {
1095 root 1.88 eio_ssize_t written = 0;
1096     eio_ssize_t res;
1097 root 1.1
1098     if (!count)
1099     return 0;
1100    
1101 root 1.69 for (;;)
1102     {
1103 root 1.82 #ifdef __APPLE__
1104     # undef HAVE_SENDFILE /* broken, as everything on os x */
1105     #endif
1106 root 1.1 #if HAVE_SENDFILE
1107     # if __linux
1108 root 1.69 off_t soffset = offset;
1109     res = sendfile (ofd, ifd, &soffset, count);
1110 root 1.1
1111 root 1.50 # elif __FreeBSD__
1112 root 1.69 /*
1113     * Of course, the freebsd sendfile is a dire hack with no thoughts
1114     * wasted on making it similar to other I/O functions.
1115     */
1116     off_t sbytes;
1117     res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
1118    
1119     #if 0 /* according to the manpage, this is correct, but broken behaviour */
1120     /* freebsd' sendfile will return 0 on success */
1121     /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */
1122     /* not on e.g. EIO or EPIPE - sounds broken */
1123     if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0)
1124     res = sbytes;
1125     #endif
1126    
1127     /* according to source inspection, this is correct, and useful behaviour */
1128     if (sbytes)
1129     res = sbytes;
1130 root 1.1
1131 root 1.82 # elif defined (__APPLE__)
1132 root 1.69 off_t sbytes = count;
1133     res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
1134 root 1.45
1135 root 1.69 /* according to the manpage, sbytes is always valid */
1136     if (sbytes)
1137     res = sbytes;
1138 root 1.45
1139 root 1.1 # elif __hpux
1140 root 1.69 res = sendfile (ofd, ifd, offset, count, 0, 0);
1141 root 1.1
1142     # elif __solaris
1143 root 1.69 struct sendfilevec vec;
1144     size_t sbytes;
1145 root 1.1
1146 root 1.69 vec.sfv_fd = ifd;
1147     vec.sfv_flag = 0;
1148     vec.sfv_off = offset;
1149     vec.sfv_len = count;
1150 root 1.1
1151 root 1.69 res = sendfilev (ofd, &vec, 1, &sbytes);
1152 root 1.1
1153 root 1.69 if (res < 0 && sbytes)
1154     res = sbytes;
1155 root 1.1
1156     # endif
1157 root 1.46
1158 root 1.86 #elif defined (_WIN32) && 0
1159 root 1.69 /* does not work, just for documentation of what would need to be done */
1160 root 1.70 /* actually, cannot be done like this, as TransmitFile changes the file offset, */
1161     /* libeio guarantees that the file offset does not change, and windows */
1162     /* has no way to get an independent handle to the same file description */
1163 root 1.69 HANDLE h = TO_SOCKET (ifd);
1164     SetFilePointer (h, offset, 0, FILE_BEGIN);
1165     res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
1166 root 1.45
1167 root 1.1 #else
1168 root 1.69 res = -1;
1169     errno = ENOSYS;
1170 root 1.1 #endif
1171    
1172 root 1.69 /* we assume sendfile can copy at least 128mb in one go */
1173     if (res <= 128 * 1024 * 1024)
1174     {
1175     if (res > 0)
1176     written += res;
1177    
1178     if (written)
1179     return written;
1180    
1181     break;
1182     }
1183     else
1184     {
1185     /* if we requested more, then probably the kernel was lazy */
1186     written += res;
1187     offset += res;
1188     count -= res;
1189    
1190     if (!count)
1191     return written;
1192     }
1193     }
1194    
1195     if (res < 0
1196 root 1.1 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK
1197 root 1.49 /* BSDs */
1198     #ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */
1199     || errno == ENOTSUP
1200     #endif
1201 root 1.90 #ifdef EOPNOTSUPP /* windows */
1202 root 1.49 || errno == EOPNOTSUPP /* BSDs */
1203 root 1.90 #endif
1204 root 1.1 #if __solaris
1205     || errno == EAFNOSUPPORT || errno == EPROTOTYPE
1206     #endif
1207     )
1208     )
1209     {
1210     /* emulate sendfile. this is a major pain in the ass */
1211     dBUF;
1212    
1213     res = 0;
1214    
1215     while (count)
1216     {
1217 root 1.88 eio_ssize_t cnt;
1218 root 1.1
1219     cnt = pread (ifd, eio_buf, count > EIO_BUFSIZE ? EIO_BUFSIZE : count, offset);
1220    
1221     if (cnt <= 0)
1222     {
1223     if (cnt && !res) res = -1;
1224     break;
1225     }
1226    
1227     cnt = write (ofd, eio_buf, cnt);
1228    
1229     if (cnt <= 0)
1230     {
1231     if (cnt && !res) res = -1;
1232     break;
1233     }
1234    
1235     offset += cnt;
1236     res += cnt;
1237     count -= cnt;
1238     }
1239 root 1.94
1240     FUBd;
1241 root 1.1 }
1242    
1243     return res;
1244     }
1245    
1246 root 1.77 #ifdef PAGESIZE
1247     # define eio_pagesize() PAGESIZE
1248     #else
1249     static intptr_t
1250     eio_pagesize (void)
1251     {
1252     static intptr_t page;
1253    
1254     if (!page)
1255     page = sysconf (_SC_PAGESIZE);
1256    
1257     return page;
1258     }
1259     #endif
1260    
1261     static void
1262     eio_page_align (void **addr, size_t *length)
1263     {
1264     intptr_t mask = eio_pagesize () - 1;
1265    
1266     /* round down addr */
1267     intptr_t adj = mask & (intptr_t)*addr;
1268    
1269     *addr = (void *)((intptr_t)*addr - adj);
1270     *length += adj;
1271    
1272     /* round up length */
1273     *length = (*length + mask) & ~mask;
1274     }
1275    
1276     #if !_POSIX_MEMLOCK
1277 root 1.89 # define eio__mlockall(a) EIO_ENOSYS ()
1278 root 1.77 #else
1279    
1280     static int
1281     eio__mlockall (int flags)
1282     {
1283     #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7
1284     extern int mallopt (int, int);
1285     mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */
1286     #endif
1287    
1288     if (EIO_MCL_CURRENT != MCL_CURRENT
1289     || EIO_MCL_FUTURE != MCL_FUTURE)
1290     {
1291     flags = 0
1292     | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0)
1293     | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0);
1294     }
1295    
1296     return mlockall (flags);
1297     }
1298     #endif
1299    
1300     #if !_POSIX_MEMLOCK_RANGE
1301 root 1.86 # define eio__mlock(a,b) EIO_ENOSYS ()
1302 root 1.77 #else
1303    
1304     static int
1305     eio__mlock (void *addr, size_t length)
1306     {
1307     eio_page_align (&addr, &length);
1308    
1309     return mlock (addr, length);
1310     }
1311    
1312     #endif
1313    
1314     #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1315 root 1.86 # define eio__msync(a,b,c) EIO_ENOSYS ()
1316 root 1.77 #else
1317    
1318     static int
1319     eio__msync (void *mem, size_t len, int flags)
1320     {
1321     eio_page_align (&mem, &len);
1322    
1323     if (EIO_MS_ASYNC != MS_SYNC
1324     || EIO_MS_INVALIDATE != MS_INVALIDATE
1325     || EIO_MS_SYNC != MS_SYNC)
1326     {
1327     flags = 0
1328     | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0)
1329     | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0)
1330     | (flags & EIO_MS_SYNC ? MS_SYNC : 0);
1331     }
1332    
1333     return msync (mem, len, flags);
1334     }
1335    
1336     #endif
1337    
1338     static int
1339     eio__mtouch (eio_req *req)
1340     {
1341     void *mem = req->ptr2;
1342     size_t len = req->size;
1343     int flags = req->int1;
1344    
1345     eio_page_align (&mem, &len);
1346    
1347     {
1348     intptr_t addr = (intptr_t)mem;
1349     intptr_t end = addr + len;
1350     intptr_t page = eio_pagesize ();
1351    
1352     if (addr < end)
1353     if (flags & EIO_MT_MODIFY) /* modify */
1354     do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req));
1355     else
1356     do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req));
1357     }
1358    
1359     return 0;
1360     }
1361    
1362     /*****************************************************************************/
1363     /* requests implemented outside eio_execute, because they are so large */
1364    
1365 root 1.104 /* copies some absolute path to tmpbuf */
1366     static char *
1367     eio__getwd (struct tmpbuf *tmpbuf, eio_wd wd)
1368     {
1369     if (wd == EIO_CWD)
1370     return getcwd (tmpbuf->ptr, PATH_MAX);
1371    
1372     #if HAVE_AT
1373     abort (); /*TODO*/
1374     #else
1375     strcpy (tmpbuf->ptr, wd);
1376     #endif
1377     return tmpbuf->ptr;
1378     }
1379    
1380     /* result will always end up in tmpbuf, there is always space for adding a 0-byte */
1381     static int
1382     eio__realpath (struct tmpbuf *tmpbuf, eio_wd wd, const char *path)
1383 root 1.77 {
1384 root 1.104 const char *rel = path;
1385 root 1.77 char *res;
1386     char *tmp1, *tmp2;
1387     #if SYMLOOP_MAX > 32
1388 root 1.78 int symlinks = SYMLOOP_MAX;
1389 root 1.77 #else
1390 root 1.78 int symlinks = 32;
1391 root 1.77 #endif
1392    
1393 root 1.104 /*D*/ /*TODO: wd ignored */
1394 root 1.77
1395     errno = EINVAL;
1396     if (!rel)
1397 root 1.104 return -1;
1398 root 1.77
1399     errno = ENOENT;
1400     if (!*rel)
1401 root 1.104 return -1;
1402 root 1.77
1403 root 1.104 res = tmpbuf_get (tmpbuf, PATH_MAX * 3);
1404 root 1.77 tmp1 = res + PATH_MAX;
1405     tmp2 = tmp1 + PATH_MAX;
1406    
1407 root 1.78 #if 0 /* disabled, the musl way to do things is just too racy */
1408     #if __linux && defined(O_NONBLOCK) && defined(O_NOATIME)
1409     /* on linux we may be able to ask the kernel */
1410     {
1411     int fd = open (rel, O_RDONLY | O_NONBLOCK | O_NOCTTY | O_NOATIME);
1412    
1413     if (fd >= 0)
1414     {
1415     sprintf (tmp1, "/proc/self/fd/%d", fd);
1416     req->result = readlink (tmp1, res, PATH_MAX);
1417     close (fd);
1418    
1419     /* here we should probably stat the open file and the disk file, to make sure they still match */
1420    
1421     if (req->result > 0)
1422     goto done;
1423     }
1424     else if (errno == ELOOP || errno == ENAMETOOLONG || errno == ENOENT || errno == ENOTDIR || errno == EIO)
1425     return;
1426     }
1427     #endif
1428     #endif
1429    
1430 root 1.77 if (*rel != '/')
1431     {
1432 root 1.104 if (!eio__getwd (tmpbuf, wd))
1433     return -1;
1434 root 1.77
1435     if (res [1]) /* only use if not / */
1436     res += strlen (res);
1437     }
1438    
1439     while (*rel)
1440     {
1441 root 1.88 eio_ssize_t len, linklen;
1442 root 1.104 const char *beg = rel;
1443 root 1.77
1444     while (*rel && *rel != '/')
1445     ++rel;
1446    
1447     len = rel - beg;
1448    
1449     if (!len) /* skip slashes */
1450     {
1451     ++rel;
1452     continue;
1453     }
1454    
1455     if (beg [0] == '.')
1456     {
1457     if (len == 1)
1458     continue; /* . - nop */
1459    
1460     if (beg [1] == '.' && len == 2)
1461     {
1462     /* .. - back up one component, if possible */
1463    
1464 root 1.104 while (res != tmpbuf->ptr)
1465 root 1.77 if (*--res == '/')
1466     break;
1467    
1468     continue;
1469     }
1470     }
1471    
1472     errno = ENAMETOOLONG;
1473     if (res + 1 + len + 1 >= tmp1)
1474     return;
1475    
1476     /* copy one component */
1477     *res = '/';
1478     memcpy (res + 1, beg, len);
1479    
1480     /* zero-terminate, for readlink */
1481     res [len + 1] = 0;
1482    
1483     /* now check if it's a symlink */
1484 root 1.104 linklen = readlink (tmpbuf->ptr, tmp1, PATH_MAX);
1485 root 1.77
1486     if (linklen < 0)
1487     {
1488     if (errno != EINVAL)
1489 root 1.104 return -1;
1490 root 1.77
1491     /* it's a normal directory. hopefully */
1492     res += len + 1;
1493     }
1494     else
1495     {
1496     /* yay, it was a symlink - build new path in tmp2 */
1497     int rellen = strlen (rel);
1498    
1499     errno = ENAMETOOLONG;
1500     if (linklen + 1 + rellen >= PATH_MAX)
1501 root 1.104 return -1;
1502 root 1.77
1503 root 1.78 errno = ELOOP;
1504     if (!--symlinks)
1505 root 1.104 return -1;
1506 root 1.78
1507 root 1.77 if (*tmp1 == '/')
1508 root 1.104 res = tmpbuf->ptr; /* symlink resolves to an absolute path */
1509 root 1.77
1510     /* we need to be careful, as rel might point into tmp2 already */
1511     memmove (tmp2 + linklen + 1, rel, rellen + 1);
1512     tmp2 [linklen] = '/';
1513     memcpy (tmp2, tmp1, linklen);
1514    
1515     rel = tmp2;
1516     }
1517     }
1518    
1519     /* special case for the lone root path */
1520 root 1.104 if (res == tmpbuf->ptr)
1521 root 1.77 *res++ = '/';
1522    
1523 root 1.104 return res - (char *)tmpbuf->ptr;
1524 root 1.77 }
1525    
1526 root 1.37 static signed char
1527     eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
1528     {
1529 root 1.63 return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
1530     : a->inode < b->inode ? -1
1531     : a->inode > b->inode ? 1
1532     : 0;
1533 root 1.37 }
1534    
1535 root 1.39 #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1536    
1537 root 1.42 #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1538     #define EIO_SORT_FAST 60 /* when to only use insertion sort */
1539 root 1.37
1540     static void
1541 root 1.91 eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, eio_ino_t inode_bits)
1542 root 1.31 {
1543 root 1.91 unsigned char bits [9 + sizeof (eio_ino_t) * 8];
1544 root 1.42 unsigned char *bit = bits;
1545    
1546     assert (CHAR_BIT == 8);
1547     assert (sizeof (eio_dirent) * 8 < 256);
1548 root 1.63 assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */
1549     assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */
1550 root 1.42
1551     if (size <= EIO_SORT_FAST)
1552     return;
1553    
1554     /* first prepare an array of bits to test in our radix sort */
1555 root 1.91 /* try to take endianness into account, as well as differences in eio_ino_t sizes */
1556 root 1.42 /* inode_bits must contain all inodes ORed together */
1557     /* which is used to skip bits that are 0 everywhere, which is very common */
1558     {
1559 root 1.91 eio_ino_t endianness;
1560 root 1.42 int i, j;
1561 root 1.39
1562 root 1.42 /* we store the byte offset of byte n into byte n of "endianness" */
1563 root 1.91 for (i = 0; i < sizeof (eio_ino_t); ++i)
1564 root 1.42 ((unsigned char *)&endianness)[i] = i;
1565 root 1.37
1566 root 1.42 *bit++ = 0;
1567 root 1.37
1568 root 1.91 for (i = 0; i < sizeof (eio_ino_t); ++i)
1569 root 1.42 {
1570     /* shifting off the byte offsets out of "endianness" */
1571     int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1572     endianness >>= 8;
1573    
1574     for (j = 0; j < 8; ++j)
1575 root 1.91 if (inode_bits & (((eio_ino_t)1) << (i * 8 + j)))
1576 root 1.42 *bit++ = offs + j;
1577     }
1578 root 1.38
1579 root 1.42 for (j = 0; j < 8; ++j)
1580     if (score_bits & (1 << j))
1581     *bit++ = offsetof (eio_dirent, score) * 8 + j;
1582     }
1583 root 1.37
1584 root 1.42 /* now actually do the sorting (a variant of MSD radix sort) */
1585     {
1586 root 1.91 eio_dirent *base_stk [9 + sizeof (eio_ino_t) * 8], *base;
1587     eio_dirent *end_stk [9 + sizeof (eio_ino_t) * 8], *end;
1588     unsigned char *bit_stk [9 + sizeof (eio_ino_t) * 8];
1589 root 1.42 int stk_idx = 0;
1590    
1591     base_stk [stk_idx] = dents;
1592     end_stk [stk_idx] = dents + size;
1593     bit_stk [stk_idx] = bit - 1;
1594 root 1.37
1595 root 1.42 do
1596     {
1597     base = base_stk [stk_idx];
1598     end = end_stk [stk_idx];
1599     bit = bit_stk [stk_idx];
1600 root 1.37
1601 root 1.42 for (;;)
1602     {
1603     unsigned char O = *bit >> 3;
1604     unsigned char M = 1 << (*bit & 7);
1605 root 1.31
1606 root 1.42 eio_dirent *a = base;
1607     eio_dirent *b = end;
1608 root 1.37
1609 root 1.42 if (b - a < EIO_SORT_CUTOFF)
1610     break;
1611 root 1.37
1612 root 1.42 /* now bit-partition the array on the bit */
1613     /* this ugly asymmetric loop seems to perform much better than typical */
1614     /* partition algos found in the literature */
1615     do
1616     if (!(((unsigned char *)a)[O] & M))
1617     ++a;
1618     else if (!(((unsigned char *)--b)[O] & M))
1619 root 1.38 {
1620 root 1.42 eio_dirent tmp = *a; *a = *b; *b = tmp;
1621     ++a;
1622     }
1623     while (b > a);
1624    
1625     /* next bit, or stop, if no bits left in this path */
1626     if (!*--bit)
1627     break;
1628 root 1.37
1629 root 1.42 base_stk [stk_idx] = a;
1630     end_stk [stk_idx] = end;
1631     bit_stk [stk_idx] = bit;
1632     ++stk_idx;
1633    
1634     end = a;
1635     }
1636     }
1637     while (stk_idx--);
1638     }
1639     }
1640 root 1.37
1641 root 1.42 static void
1642     eio_dent_insertion_sort (eio_dirent *dents, int size)
1643     {
1644 root 1.39 /* first move the smallest element to the front, to act as a sentinel */
1645     {
1646 root 1.41 int i;
1647     eio_dirent *min = dents;
1648    
1649 root 1.42 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1650     for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1651 root 1.41 if (EIO_DENT_CMP (dents [i], <, *min))
1652     min = &dents [i];
1653 root 1.39
1654     /* swap elements 0 and j (minimum) */
1655     {
1656 root 1.41 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1657 root 1.39 }
1658     }
1659    
1660 root 1.42 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1661 root 1.41 {
1662     eio_dirent *i, *j;
1663    
1664     for (i = dents + 1; i < dents + size; ++i)
1665     {
1666     eio_dirent value = *i;
1667 root 1.37
1668 root 1.41 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1669     j [1] = j [0];
1670 root 1.37
1671 root 1.41 j [1] = value;
1672     }
1673     }
1674 root 1.31 }
1675    
1676 root 1.42 static void
1677 root 1.91 eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, eio_ino_t inode_bits)
1678 root 1.42 {
1679     if (size <= 1)
1680     return; /* our insertion sort relies on size > 0 */
1681    
1682     /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1683     /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1684     eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1685    
1686     /* use an insertion sort at the end, or for small arrays, */
1687     /* as insertion sort is more efficient for small partitions */
1688     eio_dent_insertion_sort (dents, size);
1689     }
1690    
1691 root 1.1 /* read a full directory */
1692 root 1.9 static void
1693 root 1.104 eio__scandir (eio_req *req)
1694 root 1.1 {
1695 root 1.37 char *name, *names;
1696 root 1.91 int namesalloc = 4096 - sizeof (void *) * 4;
1697 root 1.31 int namesoffs = 0;
1698     int flags = req->int1;
1699     eio_dirent *dents = 0;
1700     int dentalloc = 128;
1701     int dentoffs = 0;
1702 root 1.91 eio_ino_t inode_bits = 0;
1703     #ifdef _WIN32
1704     HANDLE dirp;
1705     WIN32_FIND_DATA entp;
1706     #else
1707     DIR *dirp;
1708     EIO_STRUCT_DIRENT *entp;
1709     #endif
1710 root 1.31
1711     req->result = -1;
1712    
1713     if (!(flags & EIO_READDIR_DENTS))
1714     flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
1715 root 1.1
1716 root 1.91 #ifdef _WIN32
1717     {
1718 root 1.92 int len = strlen ((const char *)req->ptr1);
1719 root 1.91 char *path = malloc (MAX_PATH);
1720 root 1.92 const char *fmt;
1721    
1722     if (!len)
1723     fmt = "./*";
1724     else if (((const char *)req->ptr1)[len - 1] == '/' || ((const char *)req->ptr1)[len - 1] == '\\')
1725     fmt = "%s*";
1726     else
1727     fmt = "%s/*";
1728    
1729     _snprintf (path, MAX_PATH, fmt, (const char *)req->ptr1);
1730 root 1.91 dirp = FindFirstFile (path, &entp);
1731     free (path);
1732    
1733 root 1.92 if (dirp == INVALID_HANDLE_VALUE)
1734     {
1735 root 1.103 /* should steal _dosmaperr */
1736     switch (GetLastError ())
1737     {
1738     case ERROR_FILE_NOT_FOUND:
1739     req->result = 0;
1740     break;
1741    
1742     case ERROR_INVALID_NAME:
1743     case ERROR_PATH_NOT_FOUND:
1744     case ERROR_NO_MORE_FILES:
1745     errno = ENOENT;
1746     break;
1747    
1748     case ERROR_NOT_ENOUGH_MEMORY:
1749     errno = ENOMEM;
1750     break;
1751    
1752     default:
1753     errno = EINVAL;
1754     break;
1755     }
1756 root 1.92
1757 root 1.103 return;
1758 root 1.92 }
1759 root 1.91 }
1760     #else
1761     dirp = opendir (req->ptr1);
1762 root 1.103
1763     if (!dirp)
1764     return;
1765 root 1.91 #endif
1766 root 1.63
1767 root 1.74 if (req->flags & EIO_FLAG_PTR1_FREE)
1768     free (req->ptr1);
1769    
1770 root 1.31 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1771 root 1.42 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
1772     req->ptr2 = names = malloc (namesalloc);
1773 root 1.1
1774 root 1.103 if (!names || (flags && !dents))
1775     return;
1776    
1777     for (;;)
1778     {
1779     int done;
1780 root 1.91
1781     #ifdef _WIN32
1782 root 1.103 done = !dirp;
1783 root 1.91 #else
1784 root 1.103 errno = 0;
1785     entp = readdir (dirp);
1786     done = !entp;
1787 root 1.91 #endif
1788 root 1.1
1789 root 1.103 if (done)
1790     {
1791 root 1.91 #ifndef _WIN32
1792 root 1.103 int old_errno = errno;
1793     closedir (dirp);
1794     errno = old_errno;
1795 root 1.91
1796 root 1.103 if (errno)
1797     break;
1798 root 1.91 #endif
1799 root 1.31
1800 root 1.103 /* sort etc. */
1801     req->int1 = flags;
1802     req->result = dentoffs;
1803    
1804     if (flags & EIO_READDIR_STAT_ORDER)
1805     eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits);
1806     else if (flags & EIO_READDIR_DIRS_FIRST)
1807     if (flags & EIO_READDIR_FOUND_UNKNOWN)
1808     eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1809     else
1810     {
1811     /* in this case, all is known, and we just put dirs first and sort them */
1812     eio_dirent *oth = dents + dentoffs;
1813     eio_dirent *dir = dents;
1814    
1815     /* now partition dirs to the front, and non-dirs to the back */
1816     /* by walking from both sides and swapping if necessary */
1817     while (oth > dir)
1818     {
1819     if (dir->type == EIO_DT_DIR)
1820     ++dir;
1821     else if ((--oth)->type == EIO_DT_DIR)
1822     {
1823     eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1824    
1825 root 1.41 ++dir;
1826 root 1.103 }
1827     }
1828 root 1.42
1829 root 1.103 /* now sort the dirs only (dirs all have the same score) */
1830     eio_dent_sort (dents, dir - dents, 0, inode_bits);
1831     }
1832 root 1.31
1833 root 1.103 break;
1834     }
1835 root 1.31
1836 root 1.103 /* now add the entry to our list(s) */
1837     name = D_NAME (entp);
1838 root 1.1
1839 root 1.103 /* skip . and .. entries */
1840     if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
1841     {
1842     int len = D_NAMLEN (entp) + 1;
1843 root 1.1
1844 root 1.103 while (ecb_expect_false (namesoffs + len > namesalloc))
1845     {
1846     namesalloc *= 2;
1847     req->ptr2 = names = realloc (names, namesalloc);
1848 root 1.1
1849 root 1.103 if (!names)
1850     break;
1851     }
1852 root 1.1
1853 root 1.103 memcpy (names + namesoffs, name, len);
1854 root 1.1
1855 root 1.103 if (dents)
1856     {
1857     struct eio_dirent *ent;
1858 root 1.31
1859 root 1.103 if (ecb_expect_false (dentoffs == dentalloc))
1860     {
1861     dentalloc *= 2;
1862     req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1863 root 1.31
1864 root 1.103 if (!dents)
1865     break;
1866     }
1867 root 1.31
1868 root 1.103 ent = dents + dentoffs;
1869 root 1.31
1870 root 1.103 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1871     ent->namelen = len - 1;
1872     ent->inode = D_INO (entp);
1873 root 1.31
1874 root 1.103 inode_bits |= ent->inode;
1875 root 1.42
1876 root 1.103 switch (D_TYPE (entp))
1877     {
1878     default:
1879     ent->type = EIO_DT_UNKNOWN;
1880     flags |= EIO_READDIR_FOUND_UNKNOWN;
1881     break;
1882    
1883     #ifdef DT_FIFO
1884     case DT_FIFO: ent->type = EIO_DT_FIFO; break;
1885     #endif
1886     #ifdef DT_CHR
1887     case DT_CHR: ent->type = EIO_DT_CHR; break;
1888     #endif
1889     #ifdef DT_MPC
1890     case DT_MPC: ent->type = EIO_DT_MPC; break;
1891     #endif
1892     #ifdef DT_DIR
1893     case DT_DIR: ent->type = EIO_DT_DIR; break;
1894     #endif
1895     #ifdef DT_NAM
1896     case DT_NAM: ent->type = EIO_DT_NAM; break;
1897     #endif
1898     #ifdef DT_BLK
1899     case DT_BLK: ent->type = EIO_DT_BLK; break;
1900     #endif
1901     #ifdef DT_MPB
1902     case DT_MPB: ent->type = EIO_DT_MPB; break;
1903     #endif
1904     #ifdef DT_REG
1905     case DT_REG: ent->type = EIO_DT_REG; break;
1906     #endif
1907     #ifdef DT_NWK
1908     case DT_NWK: ent->type = EIO_DT_NWK; break;
1909     #endif
1910     #ifdef DT_CMP
1911     case DT_CMP: ent->type = EIO_DT_CMP; break;
1912     #endif
1913     #ifdef DT_LNK
1914     case DT_LNK: ent->type = EIO_DT_LNK; break;
1915     #endif
1916     #ifdef DT_SOCK
1917     case DT_SOCK: ent->type = EIO_DT_SOCK; break;
1918     #endif
1919     #ifdef DT_DOOR
1920     case DT_DOOR: ent->type = EIO_DT_DOOR; break;
1921     #endif
1922     #ifdef DT_WHT
1923     case DT_WHT: ent->type = EIO_DT_WHT; break;
1924     #endif
1925     }
1926 root 1.31
1927 root 1.103 ent->score = 7;
1928 root 1.31
1929 root 1.103 if (flags & EIO_READDIR_DIRS_FIRST)
1930     {
1931     if (ent->type == EIO_DT_UNKNOWN)
1932     {
1933     if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1934     ent->score = 1;
1935     else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1936     ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1937     }
1938     else if (ent->type == EIO_DT_DIR)
1939     ent->score = 0;
1940     }
1941     }
1942 root 1.31
1943 root 1.103 namesoffs += len;
1944     ++dentoffs;
1945     }
1946 root 1.31
1947 root 1.103 if (EIO_CANCELLED (req))
1948     {
1949     errno = ECANCELED;
1950     break;
1951     }
1952 root 1.91
1953     #ifdef _WIN32
1954 root 1.103 if (!FindNextFile (dirp, &entp))
1955     {
1956     FindClose (dirp);
1957     dirp = 0;
1958     }
1959 root 1.91 #endif
1960 root 1.103 }
1961 root 1.1 }
1962    
1963     /*****************************************************************************/
1964 root 1.104 /* working directory stuff */
1965    
1966     #if HAVE_AT
1967    
1968     #define WD2FD(wd) (wd ? ((int)wd) - 1 : AT_FDCWD)
1969    
1970     eio_wd
1971     eio_wd_open_sync (eio_wd wd, const char *path)
1972     {
1973     int fd = openat (WD2FD (wd), path, O_CLOEXEC | O_SEARCH | O_DIRECTORY);
1974    
1975     return fd >= 0 ? (eio_wd)(fd + 1) : EIO_INVALID_WD;
1976     }
1977    
1978     void
1979     eio_wd_close_sync (eio_wd wd)
1980     {
1981     int fd = WD2FD (wd);
1982    
1983     if (fd >= 0)
1984     close (fd);
1985     }
1986    
1987     #else
1988    
1989     /* on legacy systems, we represent the working directories simply by their path strings */
1990    
1991     static const char *
1992     wd_expand (struct tmpbuf *tmpbuf, eio_wd wd, const char *path)
1993     {
1994     if (!wd || *path == '/')
1995     return path;
1996    
1997     {
1998     int l1 = strlen ((const char *)wd);
1999     int l2 = strlen (path);
2000    
2001     char *res = tmpbuf_get (tmpbuf, l1 + l2 + 2);
2002    
2003     memcpy (res, wd, l1);
2004     res [l1] = '/';
2005     memcpy (res + l1 + 1, path, l2 + 1);
2006    
2007     return res;
2008     }
2009     }
2010    
2011     eio_wd
2012     eio__wd_open_sync (struct tmpbuf *tmpbuf, eio_wd wd, const char *path)
2013     {
2014     if (*path == '/') /* absolute paths ignore wd */
2015     path = strdup (path);
2016     else if (path [0] == '.' && !path [1]) /* special case '.', as it is common */
2017     return wd;
2018     else
2019     {
2020     int len = eio__realpath (tmpbuf, wd, path);
2021    
2022     path = EIO_INVALID_WD;
2023    
2024     if (len >= 0)
2025     {
2026     ((char *)tmpbuf->ptr)[len] = 0;
2027     path = strdup (tmpbuf->ptr);
2028     }
2029     }
2030    
2031     if (!path)
2032     path = EIO_INVALID_WD;
2033    
2034     return (eio_wd)path;
2035     }
2036    
2037     eio_wd
2038     eio_wd_open_sync (eio_wd wd, const char *path)
2039     {
2040     struct tmpbuf tmpbuf = { 0 };
2041     wd = eio__wd_open_sync (&tmpbuf, wd, path);
2042     free (tmpbuf.ptr);
2043    
2044     return wd;
2045     }
2046    
2047     void
2048     eio_wd_close_sync (eio_wd wd)
2049     {
2050     if (wd != EIO_INVALID_WD)
2051     free (wd);
2052     }
2053    
2054     #endif
2055    
2056     /*****************************************************************************/
2057 root 1.1
2058 root 1.6 #define ALLOC(len) \
2059     if (!req->ptr2) \
2060     { \
2061 root 1.14 X_LOCK (wrklock); \
2062 root 1.7 req->flags |= EIO_FLAG_PTR2_FREE; \
2063 root 1.14 X_UNLOCK (wrklock); \
2064 root 1.7 req->ptr2 = malloc (len); \
2065     if (!req->ptr2) \
2066     { \
2067     errno = ENOMEM; \
2068     req->result = -1; \
2069     break; \
2070     } \
2071 root 1.6 }
2072    
2073 root 1.14 X_THREAD_PROC (etp_proc)
2074 root 1.1 {
2075 root 1.14 ETP_REQ *req;
2076 root 1.1 struct timespec ts;
2077 root 1.14 etp_worker *self = (etp_worker *)thr_arg;
2078 root 1.1
2079 root 1.98 #if HAVE_PRCTL_SET_NAME
2080     prctl (PR_SET_NAME, (unsigned long)"eio_thread", 0, 0, 0);
2081     #endif
2082    
2083 root 1.85 /* try to distribute timeouts somewhat evenly */
2084 root 1.1 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
2085    
2086     for (;;)
2087     {
2088 root 1.85 ts.tv_sec = 0;
2089    
2090 root 1.1 X_LOCK (reqlock);
2091    
2092     for (;;)
2093     {
2094 root 1.104 req = reqq_shift (&req_queue);
2095 root 1.1
2096     if (req)
2097     break;
2098    
2099 root 1.85 if (ts.tv_sec == 1) /* no request, but timeout detected, let's quit */
2100     {
2101     X_UNLOCK (reqlock);
2102     X_LOCK (wrklock);
2103     --started;
2104     X_UNLOCK (wrklock);
2105     goto quit;
2106     }
2107    
2108 root 1.1 ++idle;
2109    
2110 root 1.85 if (idle <= max_idle)
2111     /* we are allowed to idle, so do so without any timeout */
2112     X_COND_WAIT (reqwait, reqlock);
2113     else
2114 root 1.1 {
2115 root 1.85 /* initialise timeout once */
2116     if (!ts.tv_sec)
2117     ts.tv_sec = time (0) + idle_timeout;
2118 root 1.1
2119 root 1.85 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
2120     ts.tv_sec = 1; /* assuming this is not a value computed above.,.. */
2121 root 1.1 }
2122    
2123     --idle;
2124     }
2125    
2126     --nready;
2127    
2128     X_UNLOCK (reqlock);
2129    
2130 root 1.15 if (req->type < 0)
2131     goto quit;
2132 root 1.1
2133 root 1.80 ETP_EXECUTE (self, req);
2134 root 1.1
2135     X_LOCK (reslock);
2136    
2137     ++npending;
2138    
2139 root 1.14 if (!reqq_push (&res_queue, req) && want_poll_cb)
2140     want_poll_cb ();
2141 root 1.1
2142 root 1.14 etp_worker_clear (self);
2143 root 1.1
2144     X_UNLOCK (reslock);
2145     }
2146    
2147     quit:
2148 root 1.104 free (req);
2149    
2150 root 1.14 X_LOCK (wrklock);
2151     etp_worker_free (self);
2152     X_UNLOCK (wrklock);
2153 root 1.1
2154     return 0;
2155     }
2156    
2157     /*****************************************************************************/
2158    
2159 root 1.72 int ecb_cold
2160     eio_init (void (*want_poll)(void), void (*done_poll)(void))
2161 root 1.1 {
2162 root 1.93 #if !HAVE_PREADWRITE
2163     X_MUTEX_CREATE (preadwritelock);
2164     #endif
2165    
2166 root 1.19 return etp_init (want_poll, done_poll);
2167 root 1.1 }
2168    
2169 root 1.73 ecb_inline void
2170 root 1.72 eio_api_destroy (eio_req *req)
2171 root 1.6 {
2172     free (req);
2173     }
2174    
2175     #define REQ(rtype) \
2176     eio_req *req; \
2177     \
2178     req = (eio_req *)calloc (1, sizeof *req); \
2179     if (!req) \
2180     return 0; \
2181     \
2182 root 1.11 req->type = rtype; \
2183     req->pri = pri; \
2184     req->finish = cb; \
2185     req->data = data; \
2186 root 1.6 req->destroy = eio_api_destroy;
2187    
2188     #define SEND eio_submit (req); return req
2189    
2190 root 1.9 #define PATH \
2191     req->flags |= EIO_FLAG_PTR1_FREE; \
2192     req->ptr1 = strdup (path); \
2193     if (!req->ptr1) \
2194     { \
2195     eio_api_destroy (req); \
2196     return 0; \
2197     }
2198    
2199 root 1.72 static void
2200     eio_execute (etp_worker *self, eio_req *req)
2201 root 1.15 {
2202 root 1.104 #if HAVE_AT
2203     int dirfd;
2204     #else
2205     const char *path;
2206     #endif
2207    
2208 root 1.80 if (ecb_expect_false (EIO_CANCELLED (req)))
2209     {
2210     req->result = -1;
2211     req->errorno = ECANCELED;
2212     return;
2213     }
2214    
2215 root 1.104 if (ecb_expect_false (req->wd == EIO_INVALID_WD))
2216     {
2217     req->result = -1;
2218     req->errorno = ENOENT;
2219     return;
2220     }
2221    
2222     if (req->type >= EIO_OPEN)
2223     {
2224     #if HAVE_AT
2225     dirfd = WD2FD (req->wd);
2226     #else
2227     path = wd_expand (&self->tmpbuf, req->wd, req->ptr1);
2228     #endif
2229     }
2230    
2231 root 1.15 switch (req->type)
2232     {
2233 root 1.104 case EIO_WD_OPEN: req->wd = eio__wd_open_sync (&self->tmpbuf, req->wd, req->ptr1);
2234     req->result = req->wd == EIO_INVALID_WD ? -1 : 0;
2235     break;
2236     case EIO_WD_CLOSE: eio_wd_close_sync (req->wd); break;
2237    
2238 root 1.15 case EIO_READ: ALLOC (req->size);
2239     req->result = req->offs >= 0
2240     ? pread (req->int1, req->ptr2, req->size, req->offs)
2241     : read (req->int1, req->ptr2, req->size); break;
2242     case EIO_WRITE: req->result = req->offs >= 0
2243     ? pwrite (req->int1, req->ptr2, req->size, req->offs)
2244     : write (req->int1, req->ptr2, req->size); break;
2245    
2246     case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break;
2247 root 1.94 case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size); break;
2248 root 1.15
2249 root 1.104 #if HAVE_AT
2250     case EIO_GETPATH: abort ();
2251 root 1.15 case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2252 root 1.104 req->result = fstatat (dirfd, path, (EIO_STRUCT_STAT *)req->ptr2); break;
2253 root 1.15 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2254 root 1.104 req->result = lstat (dirfd, path, (EIO_STRUCT_STAT *)req->ptr2); break;
2255     #if 0/*D*/
2256     case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
2257     req->result = statvfs (dirfd, path, (EIO_STRUCT_STATVFS *)req->ptr2); break;
2258     #endif
2259     case EIO_CHOWN: req->result = chown (dirfd, path, req->int2, req->int3); break;
2260     case EIO_CHMOD: req->result = chmod (dirfd, path, (mode_t)req->int2); break;
2261     case EIO_TRUNCATE: req->result = truncate (dirfd, path, req->offs); break;
2262     case EIO_OPEN: req->result = open (dirfd, path, req->int1, (mode_t)req->int2); break;
2263    
2264     case EIO_UNLINK: req->result = unlink (dirfd, path); break;
2265     case EIO_RMDIR: req->result = rmdir (dirfd, path); break;
2266     case EIO_MKDIR: req->result = mkdir (dirfd, path, (mode_t)req->int2); break;
2267     case EIO_RENAME: req->result = rename (dirfd, path, req->ptr2); break;
2268     case EIO_LINK: req->result = link (dirfd, path, req->ptr2); break;
2269     case EIO_SYMLINK: req->result = symlink (dirfd, path, req->ptr2); break;
2270     case EIO_MKNOD: req->result = mknod (dirfd, path, (mode_t)req->int2, (dev_t)req->offs); break;
2271     #else
2272     case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2273     req->result = stat (path , (EIO_STRUCT_STAT *)req->ptr2); break;
2274     case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2275     req->result = lstat (path , (EIO_STRUCT_STAT *)req->ptr2); break;
2276     case EIO_CHOWN: req->result = chown (path , req->int2, req->int3); break;
2277     case EIO_CHMOD: req->result = chmod (path , (mode_t)req->int2); break;
2278     case EIO_TRUNCATE: req->result = truncate (path , req->offs); break;
2279     case EIO_OPEN: req->result = open (path , req->int1, (mode_t)req->int2); break;
2280    
2281     case EIO_UNLINK: req->result = unlink (path ); break;
2282     case EIO_RMDIR: req->result = rmdir (path ); break;
2283     case EIO_MKDIR: req->result = mkdir (path , (mode_t)req->int2); break;
2284     case EIO_RENAME: req->result = rename (path , req->ptr2); break;
2285     case EIO_LINK: req->result = link (path , req->ptr2); break;
2286     case EIO_SYMLINK: req->result = symlink (path , req->ptr2); break;
2287     case EIO_MKNOD: req->result = mknod (path , (mode_t)req->int2, (dev_t)req->offs); break;
2288    
2289     case EIO_READLINK: ALLOC (PATH_MAX);
2290     req->result = readlink (path, req->ptr2, PATH_MAX); break;
2291     #endif
2292    
2293     case EIO_REALPATH: if (0 <= (req->result = eio__realpath (&self->tmpbuf, req->wd, req->ptr1)))
2294     {
2295     ALLOC (req->result);
2296     memcpy (req->ptr2, self->tmpbuf.ptr, req->result);
2297     }
2298     break;
2299    
2300     case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); /*D*/
2301     req->result = statvfs (path , (EIO_STRUCT_STATVFS *)req->ptr2); break;
2302    
2303 root 1.15 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
2304     req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
2305    
2306 root 1.51 case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
2307     req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
2308    
2309 root 1.15 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
2310     case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
2311     case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break;
2312    
2313     case EIO_CLOSE: req->result = close (req->int1); break;
2314     case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break;
2315     case EIO_SYNC: req->result = 0; sync (); break;
2316     case EIO_FSYNC: req->result = fsync (req->int1); break;
2317     case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
2318 root 1.97 case EIO_SYNCFS: req->result = eio__syncfs (req->int1); break;
2319     case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
2320 root 1.48 case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break;
2321 root 1.67 case EIO_MTOUCH: req->result = eio__mtouch (req); break;
2322 root 1.56 case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break;
2323     case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break;
2324 root 1.83 case EIO_FALLOCATE: req->result = eio__fallocate (req->int1, req->int2, req->offs, req->size); break;
2325 root 1.15
2326 root 1.104 case EIO_READDIR: eio__scandir (req); break;
2327 root 1.15
2328     case EIO_BUSY:
2329     #ifdef _WIN32
2330 root 1.57 Sleep (req->nv1 * 1e3);
2331 root 1.15 #else
2332     {
2333     struct timeval tv;
2334    
2335     tv.tv_sec = req->nv1;
2336 root 1.57 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6;
2337 root 1.15
2338     req->result = select (0, 0, 0, 0, &tv);
2339     }
2340     #endif
2341     break;
2342    
2343     case EIO_UTIME:
2344     case EIO_FUTIME:
2345     {
2346     struct timeval tv[2];
2347     struct timeval *times;
2348    
2349     if (req->nv1 != -1. || req->nv2 != -1.)
2350     {
2351     tv[0].tv_sec = req->nv1;
2352     tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.;
2353     tv[1].tv_sec = req->nv2;
2354     tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.;
2355    
2356     times = tv;
2357     }
2358     else
2359     times = 0;
2360    
2361     req->result = req->type == EIO_FUTIME
2362     ? futimes (req->int1, times)
2363     : utimes (req->ptr1, times);
2364     }
2365 root 1.25 break;
2366 root 1.15
2367     case EIO_GROUP:
2368 root 1.24 abort (); /* handled in eio_request */
2369    
2370 root 1.15 case EIO_NOP:
2371     req->result = 0;
2372     break;
2373    
2374     case EIO_CUSTOM:
2375 root 1.68 req->feed (req);
2376 root 1.15 break;
2377    
2378     default:
2379 root 1.58 errno = ENOSYS;
2380 root 1.15 req->result = -1;
2381     break;
2382     }
2383    
2384     req->errorno = errno;
2385     }
2386    
2387 root 1.12 #ifndef EIO_NO_WRAPPERS
2388    
2389 root 1.10 eio_req *eio_nop (int pri, eio_cb cb, void *data)
2390 root 1.9 {
2391     REQ (EIO_NOP); SEND;
2392     }
2393    
2394 root 1.10 eio_req *eio_busy (double delay, int pri, eio_cb cb, void *data)
2395 root 1.9 {
2396     REQ (EIO_BUSY); req->nv1 = delay; SEND;
2397     }
2398    
2399 root 1.10 eio_req *eio_sync (int pri, eio_cb cb, void *data)
2400 root 1.9 {
2401     REQ (EIO_SYNC); SEND;
2402     }
2403 root 1.6
2404 root 1.10 eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data)
2405 root 1.6 {
2406 root 1.9 REQ (EIO_FSYNC); req->int1 = fd; SEND;
2407 root 1.6 }
2408    
2409 root 1.23 eio_req *eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
2410     {
2411     REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
2412     }
2413    
2414 root 1.97 eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data)
2415     {
2416     REQ (EIO_FDATASYNC); req->int1 = fd; SEND;
2417     }
2418    
2419     eio_req *eio_syncfs (int fd, int pri, eio_cb cb, void *data)
2420     {
2421     REQ (EIO_SYNCFS); req->int1 = fd; SEND;
2422     }
2423    
2424     eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
2425     {
2426     REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND;
2427     }
2428    
2429 root 1.23 eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
2430     {
2431     REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
2432     }
2433    
2434 root 1.56 eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data)
2435     {
2436     REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND;
2437     }
2438    
2439     eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data)
2440     {
2441     REQ (EIO_MLOCKALL); req->int1 = flags; SEND;
2442     }
2443    
2444 root 1.83 eio_req *eio_fallocate (int fd, int mode, off_t offset, size_t len, int pri, eio_cb cb, void *data)
2445     {
2446     REQ (EIO_FALLOCATE); req->int1 = fd; req->int2 = mode; req->offs = offset; req->size = len; SEND;
2447     }
2448    
2449 root 1.10 eio_req *eio_close (int fd, int pri, eio_cb cb, void *data)
2450 root 1.9 {
2451     REQ (EIO_CLOSE); req->int1 = fd; SEND;
2452 root 1.6 }
2453    
2454 root 1.10 eio_req *eio_readahead (int fd, off_t offset, size_t length, int pri, eio_cb cb, void *data)
2455 root 1.6 {
2456 root 1.9 REQ (EIO_READAHEAD); req->int1 = fd; req->offs = offset; req->size = length; SEND;
2457 root 1.6 }
2458    
2459 root 1.10 eio_req *eio_read (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
2460 root 1.6 {
2461 root 1.10 REQ (EIO_READ); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
2462 root 1.6 }
2463    
2464 root 1.10 eio_req *eio_write (int fd, void *buf, size_t length, off_t offset, int pri, eio_cb cb, void *data)
2465 root 1.6 {
2466 root 1.10 REQ (EIO_WRITE); req->int1 = fd; req->offs = offset; req->size = length; req->ptr2 = buf; SEND;
2467 root 1.6 }
2468    
2469 root 1.10 eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
2470 root 1.6 {
2471 root 1.9 REQ (EIO_FSTAT); req->int1 = fd; SEND;
2472 root 1.6 }
2473    
2474 root 1.51 eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data)
2475     {
2476     REQ (EIO_FSTATVFS); req->int1 = fd; SEND;
2477     }
2478    
2479 root 1.10 eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data)
2480 root 1.6 {
2481 root 1.9 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
2482 root 1.6 }
2483    
2484 root 1.10 eio_req *eio_ftruncate (int fd, off_t offset, int pri, eio_cb cb, void *data)
2485 root 1.6 {
2486 root 1.9 REQ (EIO_FTRUNCATE); req->int1 = fd; req->offs = offset; SEND;
2487 root 1.6 }
2488    
2489 root 1.10 eio_req *eio_fchmod (int fd, mode_t mode, int pri, eio_cb cb, void *data)
2490 root 1.6 {
2491 root 1.9 REQ (EIO_FCHMOD); req->int1 = fd; req->int2 = (long)mode; SEND;
2492 root 1.6 }
2493    
2494 root 1.88 eio_req *eio_fchown (int fd, eio_uid_t uid, eio_gid_t gid, int pri, eio_cb cb, void *data)
2495 root 1.6 {
2496 root 1.9 REQ (EIO_FCHOWN); req->int1 = fd; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
2497 root 1.6 }
2498    
2499 root 1.10 eio_req *eio_dup2 (int fd, int fd2, int pri, eio_cb cb, void *data)
2500 root 1.6 {
2501 root 1.9 REQ (EIO_DUP2); req->int1 = fd; req->int2 = fd2; SEND;
2502 root 1.6 }
2503    
2504 root 1.10 eio_req *eio_sendfile (int out_fd, int in_fd, off_t in_offset, size_t length, int pri, eio_cb cb, void *data)
2505 root 1.6 {
2506 root 1.9 REQ (EIO_SENDFILE); req->int1 = out_fd; req->int2 = in_fd; req->offs = in_offset; req->size = length; SEND;
2507 root 1.6 }
2508    
2509 root 1.10 eio_req *eio_open (const char *path, int flags, mode_t mode, int pri, eio_cb cb, void *data)
2510 root 1.6 {
2511 root 1.9 REQ (EIO_OPEN); PATH; req->int1 = flags; req->int2 = (long)mode; SEND;
2512 root 1.6 }
2513    
2514 root 1.10 eio_req *eio_utime (const char *path, double atime, double mtime, int pri, eio_cb cb, void *data)
2515 root 1.6 {
2516 root 1.9 REQ (EIO_UTIME); PATH; req->nv1 = atime; req->nv2 = mtime; SEND;
2517 root 1.6 }
2518    
2519 root 1.10 eio_req *eio_truncate (const char *path, off_t offset, int pri, eio_cb cb, void *data)
2520 root 1.6 {
2521 root 1.9 REQ (EIO_TRUNCATE); PATH; req->offs = offset; SEND;
2522 root 1.6 }
2523    
2524 root 1.88 eio_req *eio_chown (const char *path, eio_uid_t uid, eio_gid_t gid, int pri, eio_cb cb, void *data)
2525 root 1.6 {
2526 root 1.9 REQ (EIO_CHOWN); PATH; req->int2 = (long)uid; req->int3 = (long)gid; SEND;
2527 root 1.6 }
2528    
2529 root 1.10 eio_req *eio_chmod (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
2530 root 1.6 {
2531 root 1.9 REQ (EIO_CHMOD); PATH; req->int2 = (long)mode; SEND;
2532 root 1.6 }
2533    
2534 root 1.10 eio_req *eio_mkdir (const char *path, mode_t mode, int pri, eio_cb cb, void *data)
2535 root 1.6 {
2536 root 1.9 REQ (EIO_MKDIR); PATH; req->int2 = (long)mode; SEND;
2537 root 1.6 }
2538    
2539 root 1.9 static eio_req *
2540 root 1.10 eio__1path (int type, const char *path, int pri, eio_cb cb, void *data)
2541 root 1.6 {
2542 root 1.9 REQ (type); PATH; SEND;
2543 root 1.6 }
2544    
2545 root 1.10 eio_req *eio_readlink (const char *path, int pri, eio_cb cb, void *data)
2546 root 1.6 {
2547 root 1.10 return eio__1path (EIO_READLINK, path, pri, cb, data);
2548 root 1.6 }
2549    
2550 root 1.76 eio_req *eio_realpath (const char *path, int pri, eio_cb cb, void *data)
2551     {
2552     return eio__1path (EIO_REALPATH, path, pri, cb, data);
2553     }
2554    
2555 root 1.10 eio_req *eio_stat (const char *path, int pri, eio_cb cb, void *data)
2556 root 1.6 {
2557 root 1.10 return eio__1path (EIO_STAT, path, pri, cb, data);
2558 root 1.6 }
2559    
2560 root 1.10 eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data)
2561 root 1.6 {
2562 root 1.10 return eio__1path (EIO_LSTAT, path, pri, cb, data);
2563 root 1.6 }
2564    
2565 root 1.51 eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data)
2566     {
2567     return eio__1path (EIO_STATVFS, path, pri, cb, data);
2568     }
2569    
2570 root 1.10 eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data)
2571 root 1.6 {
2572 root 1.10 return eio__1path (EIO_UNLINK, path, pri, cb, data);
2573 root 1.6 }
2574    
2575 root 1.10 eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
2576 root 1.6 {
2577 root 1.10 return eio__1path (EIO_RMDIR, path, pri, cb, data);
2578 root 1.6 }
2579    
2580 root 1.31 eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data)
2581 root 1.1 {
2582 root 1.31 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
2583 root 1.1 }
2584    
2585 root 1.10 eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
2586 root 1.1 {
2587 root 1.61 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND;
2588 root 1.1 }
2589    
2590 root 1.9 static eio_req *
2591 root 1.10 eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2592 root 1.1 {
2593 root 1.9 REQ (type); PATH;
2594 root 1.1
2595 root 1.9 req->flags |= EIO_FLAG_PTR2_FREE;
2596     req->ptr2 = strdup (new_path);
2597     if (!req->ptr2)
2598     {
2599     eio_api_destroy (req);
2600     return 0;
2601     }
2602 root 1.1
2603 root 1.9 SEND;
2604 root 1.1 }
2605    
2606 root 1.10 eio_req *eio_link (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2607 root 1.1 {
2608 root 1.10 return eio__2path (EIO_LINK, path, new_path, pri, cb, data);
2609 root 1.1 }
2610    
2611 root 1.10 eio_req *eio_symlink (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2612 root 1.1 {
2613 root 1.10 return eio__2path (EIO_SYMLINK, path, new_path, pri, cb, data);
2614 root 1.1 }
2615    
2616 root 1.10 eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
2617 root 1.1 {
2618 root 1.10 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
2619     }
2620    
2621 root 1.71 eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data)
2622 root 1.15 {
2623 root 1.68 REQ (EIO_CUSTOM); req->feed = execute; SEND;
2624 root 1.15 }
2625    
2626 root 1.12 #endif
2627    
2628 root 1.10 eio_req *eio_grp (eio_cb cb, void *data)
2629     {
2630     const int pri = EIO_PRI_MAX;
2631    
2632     REQ (EIO_GROUP); SEND;
2633 root 1.1 }
2634    
2635 root 1.9 #undef REQ
2636     #undef PATH
2637     #undef SEND
2638 root 1.1
2639 root 1.9 /*****************************************************************************/
2640     /* grp functions */
2641 root 1.1
2642 root 1.72 void
2643     eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit)
2644 root 1.1 {
2645     grp->int2 = limit;
2646     grp->feed = feed;
2647 root 1.2
2648     grp_try_feed (grp);
2649     }
2650    
2651 root 1.72 void
2652     eio_grp_limit (eio_req *grp, int limit)
2653 root 1.2 {
2654     grp->int2 = limit;
2655    
2656     grp_try_feed (grp);
2657 root 1.1 }
2658    
2659 root 1.72 void
2660     eio_grp_add (eio_req *grp, eio_req *req)
2661 root 1.1 {
2662     assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2));
2663    
2664 root 1.26 grp->flags |= EIO_FLAG_GROUPADD;
2665    
2666 root 1.1 ++grp->size;
2667     req->grp = grp;
2668    
2669     req->grp_prev = 0;
2670     req->grp_next = grp->grp_first;
2671    
2672     if (grp->grp_first)
2673     grp->grp_first->grp_prev = req;
2674    
2675     grp->grp_first = req;
2676     }
2677    
2678 root 1.9 /*****************************************************************************/
2679     /* misc garbage */
2680    
2681 root 1.88 eio_ssize_t
2682 root 1.72 eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
2683 root 1.9 {
2684 root 1.94 return eio__sendfile (ofd, ifd, offset, count);
2685 root 1.9 }
2686 root 1.1