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