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