ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libeio/eio.c
(Generate patch)

Comparing libeio/eio.c (file contents):
Revision 1.40 by root, Sat Jun 13 14:58:33 2009 UTC vs.
Revision 1.71 by root, Fri Jun 10 12:35:18 2011 UTC

1/* 1/*
2 * libeio implementation 2 * libeio implementation
3 * 3 *
4 * Copyright (c) 2007,2008,2009 Marc Alexander Lehmann <libeio@schmorp.de> 4 * Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libeio@schmorp.de>
5 * All rights reserved. 5 * All rights reserved.
6 * 6 *
7 * Redistribution and use in source and binary forms, with or without modifica- 7 * Redistribution and use in source and binary forms, with or without modifica-
8 * tion, are permitted provided that the following conditions are met: 8 * tion, are permitted provided that the following conditions are met:
9 * 9 *
… …
35 * and other provisions required by the GPL. If you do not delete the 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 36 * provisions above, a recipient may use your version of this file under
37 * either the BSD or the GPL. 37 * either the BSD or the GPL.
38 */ 38 */
39 39
40#ifndef _WIN32
41# include "config.h"
42#endif
43
40#include "eio.h" 44#include "eio.h"
41 45
42#ifdef EIO_STACKSIZE 46#ifdef EIO_STACKSIZE
43# define XTHREAD_STACKSIZE EIO_STACKSIZE 47# define XTHREAD_STACKSIZE EIO_STACKSIZE
44#endif 48#endif
… …
49#include <stdlib.h> 53#include <stdlib.h>
50#include <string.h> 54#include <string.h>
51#include <errno.h> 55#include <errno.h>
52#include <sys/types.h> 56#include <sys/types.h>
53#include <sys/stat.h> 57#include <sys/stat.h>
58#include <sys/statvfs.h>
54#include <limits.h> 59#include <limits.h>
55#include <fcntl.h> 60#include <fcntl.h>
56#include <assert.h> 61#include <assert.h>
57 62
63/* intptr_t comes from unistd.h, says POSIX/UNIX/tradition */
64/* intptr_t only comes form stdint.h, says idiot openbsd coder */
65#if HAVE_STDINT_H
66# include <stdint.h>
67#endif
68
58#ifndef EIO_FINISH 69#ifndef EIO_FINISH
59# define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 70# define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0
60#endif 71#endif
61 72
62#ifndef EIO_DESTROY 73#ifndef EIO_DESTROY
… …
70#ifdef _WIN32 81#ifdef _WIN32
71 82
72 /*doh*/ 83 /*doh*/
73#else 84#else
74 85
75# include "config.h"
76# include <sys/time.h> 86# include <sys/time.h>
77# include <sys/select.h> 87# include <sys/select.h>
78# include <sys/mman.h>
79# include <unistd.h> 88# include <unistd.h>
80# include <utime.h> 89# include <utime.h>
81# include <signal.h> 90# include <signal.h>
82# include <dirent.h> 91# include <dirent.h>
83 92
93#if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES
94# include <sys/mman.h>
95#endif
96
84/* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ 97/* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */
85# if defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) 98# if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__
86# define _DIRENT_HAVE_D_TYPE /* sigh */ 99# define _DIRENT_HAVE_D_TYPE /* sigh */
87# define D_INO(de) (de)->d_fileno 100# define D_INO(de) (de)->d_fileno
88# define D_NAMLEN(de) (de)->d_namlen 101# define D_NAMLEN(de) (de)->d_namlen
89# elif defined(__linux) || defined(d_ino) || _XOPEN_SOURCE >= 600 102# elif __linux || defined d_ino || _XOPEN_SOURCE >= 600
90# define D_INO(de) (de)->d_ino 103# define D_INO(de) (de)->d_ino
91# endif 104# endif
92 105
93#ifdef _D_EXACT_NAMLEN 106#ifdef _D_EXACT_NAMLEN
94# undef D_NAMLEN 107# undef D_NAMLEN
… …
106#endif 119#endif
107 120
108#if HAVE_SENDFILE 121#if HAVE_SENDFILE
109# if __linux 122# if __linux
110# include <sys/sendfile.h> 123# include <sys/sendfile.h>
111# elif __freebsd 124# elif __FreeBSD__ || defined __APPLE__
112# include <sys/socket.h> 125# include <sys/socket.h>
113# include <sys/uio.h> 126# include <sys/uio.h>
114# elif __hpux 127# elif __hpux
115# include <sys/socket.h> 128# include <sys/socket.h>
116# elif __solaris /* not yet */ 129# elif __solaris
117# include <sys/sendfile.h> 130# include <sys/sendfile.h>
118# else 131# else
119# error sendfile support requested but not available 132# error sendfile support requested but not available
120# endif 133# endif
121#endif 134#endif
… …
128#endif 141#endif
129#ifndef D_NAMLEN 142#ifndef D_NAMLEN
130# define D_NAMLEN(de) strlen ((de)->d_name) 143# define D_NAMLEN(de) strlen ((de)->d_name)
131#endif 144#endif
132 145
133/* number of seconds after which an idle threads exit */
134#define IDLE_TIMEOUT 10
135
136/* used for struct dirent, AIX doesn't provide it */ 146/* used for struct dirent, AIX doesn't provide it */
137#ifndef NAME_MAX 147#ifndef NAME_MAX
138# define NAME_MAX 4096 148# define NAME_MAX 4096
149#endif
150
151/* used for readlink etc. */
152#ifndef PATH_MAX
153# define PATH_MAX 4096
139#endif 154#endif
140 155
141/* buffer size for various temporary buffers */ 156/* buffer size for various temporary buffers */
142#define EIO_BUFSIZE 65536 157#define EIO_BUFSIZE 65536
143 158
… …
196 211
197/*****************************************************************************/ 212/*****************************************************************************/
198 213
199#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) 214#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
200 215
201/* calculcate time difference in ~1/EIO_TICKS of a second */ 216/* calculate time difference in ~1/EIO_TICKS of a second */
202static int tvdiff (struct timeval *tv1, struct timeval *tv2) 217static int tvdiff (struct timeval *tv1, struct timeval *tv2)
203{ 218{
204 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS 219 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
205 + ((tv2->tv_usec - tv1->tv_usec) >> 10); 220 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
206} 221}
… …
214static unsigned int max_poll_reqs; /* reslock */ 229static unsigned int max_poll_reqs; /* reslock */
215 230
216static volatile unsigned int nreqs; /* reqlock */ 231static volatile unsigned int nreqs; /* reqlock */
217static volatile unsigned int nready; /* reqlock */ 232static volatile unsigned int nready; /* reqlock */
218static volatile unsigned int npending; /* reqlock */ 233static volatile unsigned int npending; /* reqlock */
219static volatile unsigned int max_idle = 4; 234static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */
235static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */
220 236
221static mutex_t wrklock = X_MUTEX_INIT; 237static xmutex_t wrklock;
222static mutex_t reslock = X_MUTEX_INIT; 238static xmutex_t reslock;
223static mutex_t reqlock = X_MUTEX_INIT; 239static xmutex_t reqlock;
224static cond_t reqwait = X_COND_INIT; 240static xcond_t reqwait;
225 241
226#if !HAVE_PREADWRITE 242#if !HAVE_PREADWRITE
227/* 243/*
228 * make our pread/pwrite emulation safe against themselves, but not against 244 * make our pread/pwrite emulation safe against themselves, but not against
229 * normal read/write by using a mutex. slows down execution a lot, 245 * normal read/write by using a mutex. slows down execution a lot,
230 * but that's your problem, not mine. 246 * but that's your problem, not mine.
231 */ 247 */
232static mutex_t preadwritelock = X_MUTEX_INIT; 248static xmutex_t preadwritelock = X_MUTEX_INIT;
233#endif 249#endif
234 250
235typedef struct etp_worker 251typedef struct etp_worker
236{ 252{
237 /* locked by wrklock */ 253 /* locked by wrklock */
238 struct etp_worker *prev, *next; 254 struct etp_worker *prev, *next;
239 255
240 thread_t tid; 256 xthread_t tid;
241 257
242 /* locked by reslock, reqlock or wrklock */ 258 /* locked by reslock, reqlock or wrklock */
243 ETP_REQ *req; /* currently processed request */ 259 ETP_REQ *req; /* currently processed request */
244 260
245 ETP_WORKER_COMMON 261 ETP_WORKER_COMMON
… …
359 } 375 }
360 376
361 abort (); 377 abort ();
362} 378}
363 379
380static void etp_thread_init (void)
381{
382 X_MUTEX_CREATE (wrklock);
383 X_MUTEX_CREATE (reslock);
384 X_MUTEX_CREATE (reqlock);
385 X_COND_CREATE (reqwait);
386}
387
364static void etp_atfork_prepare (void) 388static void etp_atfork_prepare (void)
365{ 389{
366 X_LOCK (wrklock); 390 X_LOCK (wrklock);
367 X_LOCK (reqlock); 391 X_LOCK (reqlock);
368 X_LOCK (reslock); 392 X_LOCK (reslock);
… …
406 idle = 0; 430 idle = 0;
407 nreqs = 0; 431 nreqs = 0;
408 nready = 0; 432 nready = 0;
409 npending = 0; 433 npending = 0;
410 434
411 etp_atfork_parent (); 435 etp_thread_init ();
412} 436}
413 437
414static void 438static void
415etp_once_init (void) 439etp_once_init (void)
416{ 440{
441 etp_thread_init ();
417 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); 442 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child);
418} 443}
419 444
420static int 445static int
421etp_init (void (*want_poll)(void), void (*done_poll)(void)) 446etp_init (void (*want_poll)(void), void (*done_poll)(void))
… …
598} 623}
599 624
600static void etp_set_max_poll_time (double nseconds) 625static void etp_set_max_poll_time (double nseconds)
601{ 626{
602 if (WORDACCESS_UNSAFE) X_LOCK (reslock); 627 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
603 max_poll_time = nseconds; 628 max_poll_time = nseconds * EIO_TICKS;
604 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); 629 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
605} 630}
606 631
607static void etp_set_max_poll_reqs (unsigned int maxreqs) 632static void etp_set_max_poll_reqs (unsigned int maxreqs)
608{ 633{
… …
612} 637}
613 638
614static void etp_set_max_idle (unsigned int nthreads) 639static void etp_set_max_idle (unsigned int nthreads)
615{ 640{
616 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 641 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
617 max_idle = nthreads <= 0 ? 1 : nthreads; 642 max_idle = nthreads;
643 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
644}
645
646static void etp_set_idle_timeout (unsigned int seconds)
647{
648 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
649 idle_timeout = seconds;
618 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 650 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
619} 651}
620 652
621static void etp_set_min_parallel (unsigned int nthreads) 653static void etp_set_min_parallel (unsigned int nthreads)
622{ 654{
… …
750void eio_set_max_idle (unsigned int nthreads) 782void eio_set_max_idle (unsigned int nthreads)
751{ 783{
752 etp_set_max_idle (nthreads); 784 etp_set_max_idle (nthreads);
753} 785}
754 786
787void eio_set_idle_timeout (unsigned int seconds)
788{
789 etp_set_idle_timeout (seconds);
790}
791
755void eio_set_min_parallel (unsigned int nthreads) 792void eio_set_min_parallel (unsigned int nthreads)
756{ 793{
757 etp_set_min_parallel (nthreads); 794 etp_set_min_parallel (nthreads);
758} 795}
759 796
… …
807 844
808 return res; 845 return res;
809} 846}
810#endif 847#endif
811 848
812#ifndef HAVE_FUTIMES 849#ifndef HAVE_UTIMES
813 850
814# undef utimes 851# undef utimes
815# undef futimes
816# define utimes(path,times) eio__utimes (path, times) 852# define utimes(path,times) eio__utimes (path, times)
817# define futimes(fd,times) eio__futimes (fd, times)
818 853
819static int 854static int
820eio__utimes (const char *filename, const struct timeval times[2]) 855eio__utimes (const char *filename, const struct timeval times[2])
821{ 856{
822 if (times) 857 if (times)
… …
829 return utime (filename, &buf); 864 return utime (filename, &buf);
830 } 865 }
831 else 866 else
832 return utime (filename, 0); 867 return utime (filename, 0);
833} 868}
869
870#endif
871
872#ifndef HAVE_FUTIMES
873
874# undef futimes
875# define futimes(fd,times) eio__futimes (fd, times)
834 876
835static int eio__futimes (int fd, const struct timeval tv[2]) 877static int eio__futimes (int fd, const struct timeval tv[2])
836{ 878{
837 errno = ENOSYS; 879 errno = ENOSYS;
838 return -1; 880 return -1;
… …
867 if (!res || errno != ENOSYS) 909 if (!res || errno != ENOSYS)
868 return res; 910 return res;
869#endif 911#endif
870 912
871 /* even though we could play tricks with the flags, it's better to always 913 /* even though we could play tricks with the flags, it's better to always
872 * call fdatasync, as thta matches the expectation of it's users best */ 914 * call fdatasync, as that matches the expectation of its users best */
873 return fdatasync (fd); 915 return fdatasync (fd);
874} 916}
875 917
876#if !HAVE_READAHEAD 918#if !HAVE_READAHEAD
877# undef readahead 919# undef readahead
… …
900 942
901/* sendfile always needs emulation */ 943/* sendfile always needs emulation */
902static ssize_t 944static ssize_t
903eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self) 945eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self)
904{ 946{
947 ssize_t written = 0;
905 ssize_t res; 948 ssize_t res;
906 949
907 if (!count) 950 if (!count)
908 return 0; 951 return 0;
909 952
953 for (;;)
954 {
910#if HAVE_SENDFILE 955#if HAVE_SENDFILE
911# if __linux 956# if __linux
957 off_t soffset = offset;
912 res = sendfile (ofd, ifd, &offset, count); 958 res = sendfile (ofd, ifd, &soffset, count);
913 959
914# elif __freebsd 960# elif __FreeBSD__
915 /* 961 /*
916 * Of course, the freebsd sendfile is a dire hack with no thoughts 962 * Of course, the freebsd sendfile is a dire hack with no thoughts
917 * wasted on making it similar to other I/O functions. 963 * wasted on making it similar to other I/O functions.
918 */ 964 */
919 {
920 off_t sbytes; 965 off_t sbytes;
921 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); 966 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
922 967
923 if (res < 0 && sbytes) 968 #if 0 /* according to the manpage, this is correct, but broken behaviour */
924 /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ 969 /* freebsd' sendfile will return 0 on success */
970 /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */
971 /* not on e.g. EIO or EPIPE - sounds broken */
972 if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0)
925 res = sbytes; 973 res = sbytes;
926 } 974 #endif
975
976 /* according to source inspection, this is correct, and useful behaviour */
977 if (sbytes)
978 res = sbytes;
979
980# elif defined (__APPLE__)
981 off_t sbytes = count;
982 res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
983
984 /* according to the manpage, sbytes is always valid */
985 if (sbytes)
986 res = sbytes;
927 987
928# elif __hpux 988# elif __hpux
929 res = sendfile (ofd, ifd, offset, count, 0, 0); 989 res = sendfile (ofd, ifd, offset, count, 0, 0);
930 990
931# elif __solaris 991# elif __solaris
932 {
933 struct sendfilevec vec; 992 struct sendfilevec vec;
934 size_t sbytes; 993 size_t sbytes;
935 994
936 vec.sfv_fd = ifd; 995 vec.sfv_fd = ifd;
937 vec.sfv_flag = 0; 996 vec.sfv_flag = 0;
938 vec.sfv_off = offset; 997 vec.sfv_off = offset;
939 vec.sfv_len = count; 998 vec.sfv_len = count;
940 999
941 res = sendfilev (ofd, &vec, 1, &sbytes); 1000 res = sendfilev (ofd, &vec, 1, &sbytes);
942 1001
943 if (res < 0 && sbytes) 1002 if (res < 0 && sbytes)
944 res = sbytes; 1003 res = sbytes;
945 }
946 1004
947# endif 1005# endif
1006
1007#elif defined (_WIN32)
1008 /* does not work, just for documentation of what would need to be done */
1009 /* actually, cannot be done like this, as TransmitFile changes the file offset, */
1010 /* libeio guarantees that the file offset does not change, and windows */
1011 /* has no way to get an independent handle to the same file description */
1012 HANDLE h = TO_SOCKET (ifd);
1013 SetFilePointer (h, offset, 0, FILE_BEGIN);
1014 res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
1015
948#else 1016#else
949 res = -1; 1017 res = -1;
950 errno = ENOSYS; 1018 errno = ENOSYS;
951#endif 1019#endif
952 1020
1021 /* we assume sendfile can copy at least 128mb in one go */
1022 if (res <= 128 * 1024 * 1024)
1023 {
1024 if (res > 0)
1025 written += res;
1026
1027 if (written)
1028 return written;
1029
1030 break;
1031 }
1032 else
1033 {
1034 /* if we requested more, then probably the kernel was lazy */
1035 written += res;
1036 offset += res;
1037 count -= res;
1038
1039 if (!count)
1040 return written;
1041 }
1042 }
1043
953 if (res < 0 1044 if (res < 0
954 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK 1045 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK
1046 /* BSDs */
1047#ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */
1048 || errno == ENOTSUP
1049#endif
1050 || errno == EOPNOTSUPP /* BSDs */
955#if __solaris 1051#if __solaris
956 || errno == EAFNOSUPPORT || errno == EPROTOTYPE 1052 || errno == EAFNOSUPPORT || errno == EPROTOTYPE
957#endif 1053#endif
958 ) 1054 )
959 ) 1055 )
… …
993} 1089}
994 1090
995static signed char 1091static signed char
996eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) 1092eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
997{ 1093{
998 return b->score - a->score ? b->score - a->score /* works because our signed char is always 0..100 */ 1094 return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
999 : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0; 1095 : a->inode < b->inode ? -1
1096 : a->inode > b->inode ? 1
1097 : 0;
1000} 1098}
1001 1099
1002#define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0 1100#define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1003 1101
1004#define EIO_QSORT_CUTOFF 30 /* quite high, but performs well on many filesystems */ 1102#define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1005#define EIO_QSORT_SKIP 60 /* when to skip qsort completely */ 1103#define EIO_SORT_FAST 60 /* when to only use insertion sort */
1006 1104
1007static void 1105static void
1008eio_dent_sort (eio_dirent *dents, int size) 1106eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1009{ 1107{
1108 unsigned char bits [9 + sizeof (ino_t) * 8];
1109 unsigned char *bit = bits;
1110
1111 assert (CHAR_BIT == 8);
1112 assert (sizeof (eio_dirent) * 8 < 256);
1113 assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */
1114 assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */
1115
1116 if (size <= EIO_SORT_FAST)
1117 return;
1118
1119 /* first prepare an array of bits to test in our radix sort */
1120 /* try to take endianness into account, as well as differences in ino_t sizes */
1121 /* inode_bits must contain all inodes ORed together */
1122 /* which is used to skip bits that are 0 everywhere, which is very common */
1123 {
1124 ino_t endianness;
1010 int i, j; 1125 int i, j;
1011 1126
1127 /* we store the byte offset of byte n into byte n of "endianness" */
1128 for (i = 0; i < sizeof (ino_t); ++i)
1129 ((unsigned char *)&endianness)[i] = i;
1130
1131 *bit++ = 0;
1132
1133 for (i = 0; i < sizeof (ino_t); ++i)
1134 {
1135 /* shifting off the byte offsets out of "endianness" */
1136 int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1137 endianness >>= 8;
1138
1139 for (j = 0; j < 8; ++j)
1140 if (inode_bits & (((ino_t)1) << (i * 8 + j)))
1141 *bit++ = offs + j;
1142 }
1143
1144 for (j = 0; j < 8; ++j)
1145 if (score_bits & (1 << j))
1146 *bit++ = offsetof (eio_dirent, score) * 8 + j;
1147 }
1148
1149 /* now actually do the sorting (a variant of MSD radix sort) */
1150 {
1151 eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base;
1152 eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end;
1153 unsigned char *bit_stk [9 + sizeof (ino_t) * 8];
1154 int stk_idx = 0;
1155
1156 base_stk [stk_idx] = dents;
1157 end_stk [stk_idx] = dents + size;
1158 bit_stk [stk_idx] = bit - 1;
1159
1160 do
1161 {
1162 base = base_stk [stk_idx];
1163 end = end_stk [stk_idx];
1164 bit = bit_stk [stk_idx];
1165
1166 for (;;)
1167 {
1168 unsigned char O = *bit >> 3;
1169 unsigned char M = 1 << (*bit & 7);
1170
1171 eio_dirent *a = base;
1172 eio_dirent *b = end;
1173
1174 if (b - a < EIO_SORT_CUTOFF)
1175 break;
1176
1177 /* now bit-partition the array on the bit */
1178 /* this ugly asymmetric loop seems to perform much better than typical */
1179 /* partition algos found in the literature */
1180 do
1181 if (!(((unsigned char *)a)[O] & M))
1182 ++a;
1183 else if (!(((unsigned char *)--b)[O] & M))
1184 {
1185 eio_dirent tmp = *a; *a = *b; *b = tmp;
1186 ++a;
1187 }
1188 while (b > a);
1189
1190 /* next bit, or stop, if no bits left in this path */
1191 if (!*--bit)
1192 break;
1193
1194 base_stk [stk_idx] = a;
1195 end_stk [stk_idx] = end;
1196 bit_stk [stk_idx] = bit;
1197 ++stk_idx;
1198
1199 end = a;
1200 }
1201 }
1202 while (stk_idx--);
1203 }
1204}
1205
1206static void
1207eio_dent_insertion_sort (eio_dirent *dents, int size)
1208{
1209 /* first move the smallest element to the front, to act as a sentinel */
1210 {
1211 int i;
1212 eio_dirent *min = dents;
1213
1214 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1215 for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1216 if (EIO_DENT_CMP (dents [i], <, *min))
1217 min = &dents [i];
1218
1219 /* swap elements 0 and j (minimum) */
1220 {
1221 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1222 }
1223 }
1224
1225 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1226 {
1227 eio_dirent *i, *j;
1228
1229 for (i = dents + 1; i < dents + size; ++i)
1230 {
1231 eio_dirent value = *i;
1232
1233 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1234 j [1] = j [0];
1235
1236 j [1] = value;
1237 }
1238 }
1239}
1240
1241static void
1242eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1243{
1012 if (size <= 1) 1244 if (size <= 1)
1013 return; /* our insertion sort relies on size > 0 */ 1245 return; /* our insertion sort relies on size > 0 */
1014 1246
1015 if (size > EIO_QSORT_SKIP) /* skip quicksort for small directories */ 1247 /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1016 { 1248 /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1017 /* first, use quicksort */ 1249 eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1018 /* should be good for 2**31 entries */
1019 struct rng { int l, r; } rng [32];
1020 1250
1021 i = 0;
1022 rng[0].l = 0;
1023 rng[0].r = size;
1024
1025 while (expect_true (i >= 0))
1026 {
1027 int L = rng [i].l;
1028 int R = rng [i].r - 1;
1029
1030 if (expect_false (L + EIO_QSORT_CUTOFF < R))
1031 {
1032 eio_dirent piv = dents [L];
1033
1034 while (L < R)
1035 {
1036 while (EIO_DENT_CMP (dents [R], >=, piv) && L < R)
1037 --R;
1038
1039 if (L < R)
1040 dents [L++] = dents [R];
1041
1042 while (EIO_DENT_CMP (dents [L], <=, piv) && L < R)
1043 ++L;
1044
1045 if (L < R)
1046 dents [R--] = dents [L];
1047 }
1048
1049 dents [L] = piv;
1050
1051 ++i;
1052 rng [i].l = L + 1;
1053 rng [i].r = rng [i - 1].r;
1054 rng [i - 1].r = L;
1055
1056 if (rng [i].r - rng [i].l > rng [i - 1].r - rng [i - 1].l)
1057 {
1058 struct rng t;
1059
1060 t = rng [i]; rng [i] = rng [i - 1]; rng [i - 1] = t;
1061 }
1062 }
1063 else
1064 --i;
1065 }
1066 }
1067
1068 /* use an insertion sort after qsort, or for small arrays */ 1251 /* use an insertion sort at the end, or for small arrays, */
1069 /* first move the smallest element to the front, to act as a sentinel */ 1252 /* as insertion sort is more efficient for small partitions */
1070 { 1253 eio_dent_insertion_sort (dents, size);
1071 int min = 0;
1072
1073 for (i = size > EIO_QSORT_SKIP ? EIO_QSORT_CUTOFF + 1 : size; --i; )
1074 if (EIO_DENT_CMP (dents [i], <, dents [min]))
1075 min = i;
1076
1077 /* swap elements 0 and j (minimum) */
1078 {
1079 eio_dirent tmp = dents [0]; dents [0] = dents [min]; dents [min] = tmp;
1080 }
1081 }
1082
1083 /* then do standard insertion sort */
1084 for (i = 1; i < size; ++i)
1085 {
1086 eio_dirent value = dents [i];
1087
1088 for (j = i - 1; EIO_DENT_CMP (dents [j], >, value); --j)
1089 {
1090 assert (j >= 0);
1091 dents [j + 1] = dents [j];
1092 }
1093
1094 dents [j + 1] = value;
1095 }
1096} 1254}
1097 1255
1098/* read a full directory */ 1256/* read a full directory */
1099static void 1257static void
1100eio__scandir (eio_req *req, etp_worker *self) 1258eio__scandir (eio_req *req, etp_worker *self)
… …
1106 int namesoffs = 0; 1264 int namesoffs = 0;
1107 int flags = req->int1; 1265 int flags = req->int1;
1108 eio_dirent *dents = 0; 1266 eio_dirent *dents = 0;
1109 int dentalloc = 128; 1267 int dentalloc = 128;
1110 int dentoffs = 0; 1268 int dentoffs = 0;
1269 ino_t inode_bits = 0;
1111 1270
1112 req->result = -1; 1271 req->result = -1;
1113 1272
1114 if (!(flags & EIO_READDIR_DENTS)) 1273 if (!(flags & EIO_READDIR_DENTS))
1115 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); 1274 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
1116 1275
1117 X_LOCK (wrklock); 1276 X_LOCK (wrklock);
1118 /* the corresponding closedir is in ETP_WORKER_CLEAR */ 1277 /* the corresponding closedir is in ETP_WORKER_CLEAR */
1119 self->dirp = dirp = opendir (req->ptr1); 1278 self->dirp = dirp = opendir (req->ptr1);
1279
1120 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; 1280 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1121 req->ptr1 = names = malloc (namesalloc);
1122 req->ptr2 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; 1281 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
1282 req->ptr2 = names = malloc (namesalloc);
1123 X_UNLOCK (wrklock); 1283 X_UNLOCK (wrklock);
1124 1284
1125 if (dirp && names && (!flags || dents)) 1285 if (dirp && names && (!flags || dents))
1126 for (;;) 1286 for (;;)
1127 { 1287 {
… …
1135 1295
1136 /* sort etc. */ 1296 /* sort etc. */
1137 req->int1 = flags; 1297 req->int1 = flags;
1138 req->result = dentoffs; 1298 req->result = dentoffs;
1139 1299
1140 if (dents)
1141 {
1142 eio_dirent *ent = dents + dentoffs;
1143
1144 while (ent > dents)
1145 (--ent)->name = names + (size_t)ent->name;
1146 }
1147
1148 if (flags & EIO_READDIR_STAT_ORDER 1300 if (flags & EIO_READDIR_STAT_ORDER)
1149 || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN))) 1301 eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits);
1150 eio_dent_sort (dents, dentoffs); /* score depends of DIRS_FIRST */
1151 else if (flags & EIO_READDIR_DIRS_FIRST) 1302 else if (flags & EIO_READDIR_DIRS_FIRST)
1303 if (flags & EIO_READDIR_FOUND_UNKNOWN)
1304 eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1305 else
1152 { 1306 {
1153 /* in this case, all is known, and we just put dirs first and sort them */ 1307 /* in this case, all is known, and we just put dirs first and sort them */
1154 eio_dirent *ent = dents + dentoffs; 1308 eio_dirent *oth = dents + dentoffs;
1155 eio_dirent *dir = dents; 1309 eio_dirent *dir = dents;
1156 1310
1157 /* now move dirs to the front, and non-dirs to the back */ 1311 /* now partition dirs to the front, and non-dirs to the back */
1158 /* by walking from both sides and swapping if necessary */ 1312 /* by walking from both sides and swapping if necessary */
1159 while (ent > dir) 1313 while (oth > dir)
1160 { 1314 {
1161 if (dir->type == DT_DIR) 1315 if (dir->type == EIO_DT_DIR)
1162 ++dir; 1316 ++dir;
1163 else
1164 {
1165 --ent;
1166
1167 if (ent->type == DT_DIR) 1317 else if ((--oth)->type == EIO_DT_DIR)
1168 { 1318 {
1169 eio_dirent tmp = *dir; 1319 eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1170 *dir = *ent;
1171 *ent = tmp;
1172 1320
1173 ++dir; 1321 ++dir;
1174 } 1322 }
1175 } 1323 }
1324
1325 /* now sort the dirs only (dirs all have the same score) */
1326 eio_dent_sort (dents, dir - dents, 0, inode_bits);
1176 } 1327 }
1177
1178 /* now sort the dirs only */
1179 eio_dent_sort (dents, dir - dents);
1180 }
1181
1182 /* only provide the names array unless DENTS is specified */
1183 if (!(flags & EIO_READDIR_DENTS))
1184 {
1185 X_LOCK (wrklock);
1186 assert (!dents);
1187 req->ptr1 = 0;
1188 req->ptr2 = names;
1189 X_UNLOCK (wrklock);
1190 }
1191 1328
1192 break; 1329 break;
1193 } 1330 }
1194 1331
1195 /* now add the entry to our list(s) */ 1332 /* now add the entry to our list(s) */
… …
1202 1339
1203 while (expect_false (namesoffs + len > namesalloc)) 1340 while (expect_false (namesoffs + len > namesalloc))
1204 { 1341 {
1205 namesalloc *= 2; 1342 namesalloc *= 2;
1206 X_LOCK (wrklock); 1343 X_LOCK (wrklock);
1207 req->ptr1 = names = realloc (names, namesalloc); 1344 req->ptr2 = names = realloc (names, namesalloc);
1208 X_UNLOCK (wrklock); 1345 X_UNLOCK (wrklock);
1209 1346
1210 if (!names) 1347 if (!names)
1211 break; 1348 break;
1212 } 1349 }
… …
1219 1356
1220 if (expect_false (dentoffs == dentalloc)) 1357 if (expect_false (dentoffs == dentalloc))
1221 { 1358 {
1222 dentalloc *= 2; 1359 dentalloc *= 2;
1223 X_LOCK (wrklock); 1360 X_LOCK (wrklock);
1224 req->ptr2 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); 1361 req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1225 X_UNLOCK (wrklock); 1362 X_UNLOCK (wrklock);
1226 1363
1227 if (!dents) 1364 if (!dents)
1228 break; 1365 break;
1229 } 1366 }
1230 1367
1231 ent = dents + dentoffs; 1368 ent = dents + dentoffs;
1232 1369
1233 ent->name = (char *)(size_t)namesoffs; /* rather dirtily we store the offset in the pointer */ 1370 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1234 ent->namelen = len - 1; 1371 ent->namelen = len - 1;
1235 ent->inode = D_INO (entp); 1372 ent->inode = D_INO (entp);
1373
1374 inode_bits |= ent->inode;
1236 1375
1237 switch (D_TYPE (entp)) 1376 switch (D_TYPE (entp))
1238 { 1377 {
1239 default: 1378 default:
1240 ent->type = EIO_DT_UNKNOWN; 1379 ent->type = EIO_DT_UNKNOWN;
… …
1283 #ifdef DT_WHT 1422 #ifdef DT_WHT
1284 case DT_WHT: ent->type = EIO_DT_WHT; break; 1423 case DT_WHT: ent->type = EIO_DT_WHT; break;
1285 #endif 1424 #endif
1286 } 1425 }
1287 1426
1288 ent->score = 0; 1427 ent->score = 7;
1289 1428
1290 if (flags & EIO_READDIR_DIRS_FIRST) 1429 if (flags & EIO_READDIR_DIRS_FIRST)
1291 { 1430 {
1292 if (ent->type == EIO_DT_UNKNOWN) 1431 if (ent->type == EIO_DT_UNKNOWN)
1293 { 1432 {
1294 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ 1433 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1295 ent->score = 98; 1434 ent->score = 1;
1296 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ 1435 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1297 ent->score = len <= 2 ? len + 6 : len <= 4 ? 5 : len <= 7 ? 4 : 1; /* shorter == more likely dir, but avoid too many classes */ 1436 ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1298 } 1437 }
1299 else if (ent->type == EIO_DT_DIR) 1438 else if (ent->type == EIO_DT_DIR)
1300 ent->score = 100; 1439 ent->score = 0;
1301 } 1440 }
1302 } 1441 }
1303 1442
1304 namesoffs += len; 1443 namesoffs += len;
1305 ++dentoffs; 1444 ++dentoffs;
… …
1311 break; 1450 break;
1312 } 1451 }
1313 } 1452 }
1314} 1453}
1315 1454
1316#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1317# undef msync
1318# define msync(a,b,c) ((errno = ENOSYS), -1)
1319#endif
1320
1321int
1322eio__mtouch (void *mem, size_t len, int flags)
1323{
1324 intptr_t addr = (intptr_t)mem;
1325 intptr_t end = addr + len;
1326#ifdef PAGESIZE 1455#ifdef PAGESIZE
1327 const intptr_t page = PAGESIZE; 1456# define eio_pagesize() PAGESIZE
1328#else 1457#else
1458static intptr_t
1459eio_pagesize (void)
1460{
1329 static intptr_t page; 1461 static intptr_t page;
1330 1462
1331 if (!page) 1463 if (!page)
1332 page = sysconf (_SC_PAGESIZE); 1464 page = sysconf (_SC_PAGESIZE);
1465
1466 return page;
1467}
1468#endif
1469
1470static void
1471eio_page_align (void **addr, size_t *length)
1472{
1473 intptr_t mask = eio_pagesize () - 1;
1474
1475 /* round down addr */
1476 intptr_t adj = mask & (intptr_t)*addr;
1477
1478 *addr = (void *)((intptr_t)*addr - adj);
1479 *length += adj;
1480
1481 /* round up length */
1482 *length = (*length + mask) & ~mask;
1483}
1484
1485#if !_POSIX_MEMLOCK
1486# define eio__mlockall(a) ((errno = ENOSYS), -1)
1487#else
1488
1489static int
1490eio__mlockall (int flags)
1491{
1492 #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7
1493 extern int mallopt (int, int);
1494 mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */
1333#endif 1495 #endif
1334 1496
1335 addr &= ~(page - 1); /* assume page size is always a power of two */ 1497 if (EIO_MCL_CURRENT != MCL_CURRENT
1498 || EIO_MCL_FUTURE != MCL_FUTURE)
1499 {
1500 flags = 0
1501 | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0)
1502 | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0);
1503 }
1336 1504
1505 return mlockall (flags);
1506}
1507#endif
1508
1509#if !_POSIX_MEMLOCK_RANGE
1510# define eio__mlock(a,b) ((errno = ENOSYS), -1)
1511#else
1512
1513static int
1514eio__mlock (void *addr, size_t length)
1515{
1516 eio_page_align (&addr, &length);
1517
1518 return mlock (addr, length);
1519}
1520
1521#endif
1522
1523#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1524# define eio__msync(a,b,c) ((errno = ENOSYS), -1)
1525#else
1526
1527int
1528eio__msync (void *mem, size_t len, int flags)
1529{
1530 eio_page_align (&mem, &len);
1531
1532 if (EIO_MS_ASYNC != MS_SYNC
1533 || EIO_MS_INVALIDATE != MS_INVALIDATE
1534 || EIO_MS_SYNC != MS_SYNC)
1535 {
1536 flags = 0
1537 | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0)
1538 | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0)
1539 | (flags & EIO_MS_SYNC ? MS_SYNC : 0);
1540 }
1541
1542 return msync (mem, len, flags);
1543}
1544
1545#endif
1546
1547int
1548eio__mtouch (eio_req *req)
1549{
1550 void *mem = req->ptr2;
1551 size_t len = req->size;
1552 int flags = req->int1;
1553
1554 eio_page_align (&mem, &len);
1555
1556 {
1557 intptr_t addr = (intptr_t)mem;
1558 intptr_t end = addr + len;
1559 intptr_t page = eio_pagesize ();
1560
1337 if (addr < end) 1561 if (addr < end)
1338 if (flags) /* modify */ 1562 if (flags & EIO_MT_MODIFY) /* modify */
1339 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len); 1563 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req));
1340 else 1564 else
1341 do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len); 1565 do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req));
1566 }
1342 1567
1343 return 0; 1568 return 0;
1344} 1569}
1345 1570
1346/*****************************************************************************/ 1571/*****************************************************************************/
… …
1380 if (req) 1605 if (req)
1381 break; 1606 break;
1382 1607
1383 ++idle; 1608 ++idle;
1384 1609
1385 ts.tv_sec = time (0) + IDLE_TIMEOUT; 1610 ts.tv_sec = time (0) + idle_timeout;
1386 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) 1611 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
1387 { 1612 {
1388 if (idle > max_idle) 1613 if (idle > max_idle)
1389 { 1614 {
1390 --idle; 1615 --idle;
… …
1469 return 0; \ 1694 return 0; \
1470 } 1695 }
1471 1696
1472static void eio_execute (etp_worker *self, eio_req *req) 1697static void eio_execute (etp_worker *self, eio_req *req)
1473{ 1698{
1474 errno = 0;
1475
1476 switch (req->type) 1699 switch (req->type)
1477 { 1700 {
1478 case EIO_READ: ALLOC (req->size); 1701 case EIO_READ: ALLOC (req->size);
1479 req->result = req->offs >= 0 1702 req->result = req->offs >= 0
1480 ? pread (req->int1, req->ptr2, req->size, req->offs) 1703 ? pread (req->int1, req->ptr2, req->size, req->offs)
… …
1491 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); 1714 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1492 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; 1715 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1493 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); 1716 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1494 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; 1717 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
1495 1718
1719 case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1720 req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1721 case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1722 req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1723
1496 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; 1724 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
1497 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; 1725 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
1498 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; 1726 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
1499 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; 1727 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
1500 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; 1728 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
… …
1507 case EIO_RMDIR: req->result = rmdir (req->ptr1); break; 1735 case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
1508 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; 1736 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
1509 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; 1737 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
1510 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; 1738 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
1511 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; 1739 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
1512 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break; 1740 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
1513 1741
1514 case EIO_READLINK: ALLOC (NAME_MAX); 1742 case EIO_READLINK: ALLOC (PATH_MAX);
1515 req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; 1743 req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break;
1516 1744
1517 case EIO_SYNC: req->result = 0; sync (); break; 1745 case EIO_SYNC: req->result = 0; sync (); break;
1518 case EIO_FSYNC: req->result = fsync (req->int1); break; 1746 case EIO_FSYNC: req->result = fsync (req->int1); break;
1519 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; 1747 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
1520 case EIO_MSYNC: req->result = msync (req->ptr2, req->size, req->int1); break; 1748 case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break;
1749 case EIO_MTOUCH: req->result = eio__mtouch (req); break;
1521 case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break; 1750 case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break;
1751 case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break;
1522 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; 1752 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
1523 1753
1524 case EIO_READDIR: eio__scandir (req, self); break; 1754 case EIO_READDIR: eio__scandir (req, self); break;
1525 1755
1526 case EIO_BUSY: 1756 case EIO_BUSY:
1527#ifdef _WIN32 1757#ifdef _WIN32
1528 Sleep (req->nv1 * 1000.); 1758 Sleep (req->nv1 * 1e3);
1529#else 1759#else
1530 { 1760 {
1531 struct timeval tv; 1761 struct timeval tv;
1532 1762
1533 tv.tv_sec = req->nv1; 1763 tv.tv_sec = req->nv1;
1534 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; 1764 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6;
1535 1765
1536 req->result = select (0, 0, 0, 0, &tv); 1766 req->result = select (0, 0, 0, 0, &tv);
1537 } 1767 }
1538#endif 1768#endif
1539 break; 1769 break;
… …
1554 times = tv; 1784 times = tv;
1555 } 1785 }
1556 else 1786 else
1557 times = 0; 1787 times = 0;
1558 1788
1559
1560 req->result = req->type == EIO_FUTIME 1789 req->result = req->type == EIO_FUTIME
1561 ? futimes (req->int1, times) 1790 ? futimes (req->int1, times)
1562 : utimes (req->ptr1, times); 1791 : utimes (req->ptr1, times);
1563 } 1792 }
1564 break; 1793 break;
… …
1569 case EIO_NOP: 1798 case EIO_NOP:
1570 req->result = 0; 1799 req->result = 0;
1571 break; 1800 break;
1572 1801
1573 case EIO_CUSTOM: 1802 case EIO_CUSTOM:
1574 ((void (*)(eio_req *))req->feed) (req); 1803 req->feed (req);
1575 break; 1804 break;
1576 1805
1577 default: 1806 default:
1807 errno = ENOSYS;
1578 req->result = -1; 1808 req->result = -1;
1579 break; 1809 break;
1580 } 1810 }
1581 1811
1582 req->errorno = errno; 1812 req->errorno = errno;
… …
1612eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) 1842eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
1613{ 1843{
1614 REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; 1844 REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
1615} 1845}
1616 1846
1847eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data)
1848{
1849 REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND;
1850}
1851
1852eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data)
1853{
1854 REQ (EIO_MLOCKALL); req->int1 = flags; SEND;
1855}
1856
1617eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) 1857eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
1618{ 1858{
1619 REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; 1859 REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND;
1620} 1860}
1621 1861
… …
1645} 1885}
1646 1886
1647eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) 1887eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
1648{ 1888{
1649 REQ (EIO_FSTAT); req->int1 = fd; SEND; 1889 REQ (EIO_FSTAT); req->int1 = fd; SEND;
1890}
1891
1892eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data)
1893{
1894 REQ (EIO_FSTATVFS); req->int1 = fd; SEND;
1650} 1895}
1651 1896
1652eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) 1897eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data)
1653{ 1898{
1654 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; 1899 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
… …
1728eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) 1973eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data)
1729{ 1974{
1730 return eio__1path (EIO_LSTAT, path, pri, cb, data); 1975 return eio__1path (EIO_LSTAT, path, pri, cb, data);
1731} 1976}
1732 1977
1978eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data)
1979{
1980 return eio__1path (EIO_STATVFS, path, pri, cb, data);
1981}
1982
1733eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) 1983eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data)
1734{ 1984{
1735 return eio__1path (EIO_UNLINK, path, pri, cb, data); 1985 return eio__1path (EIO_UNLINK, path, pri, cb, data);
1736} 1986}
1737 1987
… …
1745 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; 1995 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
1746} 1996}
1747 1997
1748eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) 1998eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
1749{ 1999{
1750 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND; 2000 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND;
1751} 2001}
1752 2002
1753static eio_req * 2003static eio_req *
1754eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) 2004eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1755{ 2005{
… …
1779eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) 2029eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1780{ 2030{
1781 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); 2031 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
1782} 2032}
1783 2033
1784eio_req *eio_custom (eio_cb execute, int pri, eio_cb cb, void *data) 2034eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data)
1785{ 2035{
1786 REQ (EIO_CUSTOM); req->feed = (void (*)(eio_req *))execute; SEND; 2036 REQ (EIO_CUSTOM); req->feed = execute; SEND;
1787} 2037}
1788 2038
1789#endif 2039#endif
1790 2040
1791eio_req *eio_grp (eio_cb cb, void *data) 2041eio_req *eio_grp (eio_cb cb, void *data)

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines