ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.125
Committed: Thu Dec 6 12:21:41 2012 UTC (11 years, 5 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.124: +3 -3 lines
Log Message:
*** empty log message ***

File Contents

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