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