ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.94
Committed: Mon Jul 18 02:59:58 2011 UTC (12 years, 10 months ago) by root
Content type: text/plain
Branch: MAIN
CVS Tags: rel-4_0
Changes since 1.93: +14 -29 lines
Log Message:
*** empty log message ***

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