ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
Revision: 1.130
Committed: Thu May 9 03:03:24 2013 UTC (11 years, 7 months ago) by root
Content type: text/plain
Branch: MAIN
CVS Tags: rel-4_2, rel-4_3, rel-4_31
Changes since 1.129: +19 -1 lines
Log Message:
*** empty log message ***

File Contents

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