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