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