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