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