ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.92
Committed: Sun Jul 17 18:27:17 2011 UTC (12 years, 10 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.91: +21 -9 lines
Log Message:
*** empty log message ***

File Contents

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