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 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 | * |
… | |
… | |
49 | #include <stdlib.h> |
49 | #include <stdlib.h> |
50 | #include <string.h> |
50 | #include <string.h> |
51 | #include <errno.h> |
51 | #include <errno.h> |
52 | #include <sys/types.h> |
52 | #include <sys/types.h> |
53 | #include <sys/stat.h> |
53 | #include <sys/stat.h> |
|
|
54 | #include <sys/statvfs.h> |
54 | #include <limits.h> |
55 | #include <limits.h> |
55 | #include <fcntl.h> |
56 | #include <fcntl.h> |
56 | #include <assert.h> |
57 | #include <assert.h> |
57 | |
58 | |
58 | #ifndef EIO_FINISH |
59 | #ifndef EIO_FINISH |
… | |
… | |
78 | # include <unistd.h> |
79 | # include <unistd.h> |
79 | # include <utime.h> |
80 | # include <utime.h> |
80 | # include <signal.h> |
81 | # include <signal.h> |
81 | # include <dirent.h> |
82 | # include <dirent.h> |
82 | |
83 | |
|
|
84 | #if _POSIX_MEMLOCK || _POSIX_MAPPED_FILES |
|
|
85 | # include <sys/mman.h> |
|
|
86 | #endif |
|
|
87 | |
83 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
88 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
84 | # if defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) |
89 | # if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__ |
85 | # define _DIRENT_HAVE_D_TYPE /* sigh */ |
90 | # define _DIRENT_HAVE_D_TYPE /* sigh */ |
86 | # define D_INO(de) (de)->d_fileno |
91 | # define D_INO(de) (de)->d_fileno |
87 | # define D_NAMLEN(de) (de)->d_namlen |
92 | # define D_NAMLEN(de) (de)->d_namlen |
88 | # elif defined(__linux) || defined(d_ino) || _XOPEN_SOURCE >= 600 |
93 | # elif __linux || defined d_ino || _XOPEN_SOURCE >= 600 |
89 | # define D_INO(de) (de)->d_ino |
94 | # define D_INO(de) (de)->d_ino |
90 | # endif |
95 | # endif |
91 | |
96 | |
92 | #ifdef _D_EXACT_NAMLEN |
97 | #ifdef _D_EXACT_NAMLEN |
93 | # undef D_NAMLEN |
98 | # undef D_NAMLEN |
… | |
… | |
105 | #endif |
110 | #endif |
106 | |
111 | |
107 | #if HAVE_SENDFILE |
112 | #if HAVE_SENDFILE |
108 | # if __linux |
113 | # if __linux |
109 | # include <sys/sendfile.h> |
114 | # include <sys/sendfile.h> |
110 | # elif __freebsd |
115 | # elif __FreeBSD__ || defined __APPLE__ |
111 | # include <sys/socket.h> |
116 | # include <sys/socket.h> |
112 | # include <sys/uio.h> |
117 | # include <sys/uio.h> |
113 | # elif __hpux |
118 | # elif __hpux |
114 | # include <sys/socket.h> |
119 | # include <sys/socket.h> |
115 | # elif __solaris /* not yet */ |
120 | # elif __solaris |
116 | # include <sys/sendfile.h> |
121 | # include <sys/sendfile.h> |
117 | # else |
122 | # else |
118 | # error sendfile support requested but not available |
123 | # error sendfile support requested but not available |
119 | # endif |
124 | # endif |
120 | #endif |
125 | #endif |
… | |
… | |
133 | #define IDLE_TIMEOUT 10 |
138 | #define IDLE_TIMEOUT 10 |
134 | |
139 | |
135 | /* used for struct dirent, AIX doesn't provide it */ |
140 | /* used for struct dirent, AIX doesn't provide it */ |
136 | #ifndef NAME_MAX |
141 | #ifndef NAME_MAX |
137 | # define NAME_MAX 4096 |
142 | # define NAME_MAX 4096 |
|
|
143 | #endif |
|
|
144 | |
|
|
145 | /* used for readlink etc. */ |
|
|
146 | #ifndef PATH_MAX |
|
|
147 | # define PATH_MAX 4096 |
138 | #endif |
148 | #endif |
139 | |
149 | |
140 | /* buffer size for various temporary buffers */ |
150 | /* buffer size for various temporary buffers */ |
141 | #define EIO_BUFSIZE 65536 |
151 | #define EIO_BUFSIZE 65536 |
142 | |
152 | |
… | |
… | |
195 | |
205 | |
196 | /*****************************************************************************/ |
206 | /*****************************************************************************/ |
197 | |
207 | |
198 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
208 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
199 | |
209 | |
200 | /* calculcate time difference in ~1/EIO_TICKS of a second */ |
210 | /* calculate time difference in ~1/EIO_TICKS of a second */ |
201 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
211 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
202 | { |
212 | { |
203 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
213 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
204 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
214 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
205 | } |
215 | } |
… | |
… | |
215 | static volatile unsigned int nreqs; /* reqlock */ |
225 | static volatile unsigned int nreqs; /* reqlock */ |
216 | static volatile unsigned int nready; /* reqlock */ |
226 | static volatile unsigned int nready; /* reqlock */ |
217 | static volatile unsigned int npending; /* reqlock */ |
227 | static volatile unsigned int npending; /* reqlock */ |
218 | static volatile unsigned int max_idle = 4; |
228 | static volatile unsigned int max_idle = 4; |
219 | |
229 | |
220 | static mutex_t wrklock = X_MUTEX_INIT; |
230 | static xmutex_t wrklock = X_MUTEX_INIT; |
221 | static mutex_t reslock = X_MUTEX_INIT; |
231 | static xmutex_t reslock = X_MUTEX_INIT; |
222 | static mutex_t reqlock = X_MUTEX_INIT; |
232 | static xmutex_t reqlock = X_MUTEX_INIT; |
223 | static cond_t reqwait = X_COND_INIT; |
233 | static xcond_t reqwait = X_COND_INIT; |
224 | |
234 | |
225 | #if !HAVE_PREADWRITE |
235 | #if !HAVE_PREADWRITE |
226 | /* |
236 | /* |
227 | * make our pread/pwrite emulation safe against themselves, but not against |
237 | * make our pread/pwrite emulation safe against themselves, but not against |
228 | * normal read/write by using a mutex. slows down execution a lot, |
238 | * normal read/write by using a mutex. slows down execution a lot, |
229 | * but that's your problem, not mine. |
239 | * but that's your problem, not mine. |
230 | */ |
240 | */ |
231 | static mutex_t preadwritelock = X_MUTEX_INIT; |
241 | static xmutex_t preadwritelock = X_MUTEX_INIT; |
232 | #endif |
242 | #endif |
233 | |
243 | |
234 | typedef struct etp_worker |
244 | typedef struct etp_worker |
235 | { |
245 | { |
236 | /* locked by wrklock */ |
246 | /* locked by wrklock */ |
237 | struct etp_worker *prev, *next; |
247 | struct etp_worker *prev, *next; |
238 | |
248 | |
239 | thread_t tid; |
249 | xthread_t tid; |
240 | |
250 | |
241 | /* locked by reslock, reqlock or wrklock */ |
251 | /* locked by reslock, reqlock or wrklock */ |
242 | ETP_REQ *req; /* currently processed request */ |
252 | ETP_REQ *req; /* currently processed request */ |
243 | |
253 | |
244 | ETP_WORKER_COMMON |
254 | ETP_WORKER_COMMON |
… | |
… | |
597 | } |
607 | } |
598 | |
608 | |
599 | static void etp_set_max_poll_time (double nseconds) |
609 | static void etp_set_max_poll_time (double nseconds) |
600 | { |
610 | { |
601 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
611 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
602 | max_poll_time = nseconds; |
612 | max_poll_time = nseconds * EIO_TICKS; |
603 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
613 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
604 | } |
614 | } |
605 | |
615 | |
606 | static void etp_set_max_poll_reqs (unsigned int maxreqs) |
616 | static void etp_set_max_poll_reqs (unsigned int maxreqs) |
607 | { |
617 | { |
… | |
… | |
866 | if (!res || errno != ENOSYS) |
876 | if (!res || errno != ENOSYS) |
867 | return res; |
877 | return res; |
868 | #endif |
878 | #endif |
869 | |
879 | |
870 | /* even though we could play tricks with the flags, it's better to always |
880 | /* even though we could play tricks with the flags, it's better to always |
871 | * call fdatasync, as thta matches the expectation of it's users best */ |
881 | * call fdatasync, as that matches the expectation of its users best */ |
872 | return fdatasync (fd); |
882 | return fdatasync (fd); |
873 | } |
883 | } |
874 | |
884 | |
875 | #if !HAVE_READAHEAD |
885 | #if !HAVE_READAHEAD |
876 | # undef readahead |
886 | # undef readahead |
… | |
… | |
908 | |
918 | |
909 | #if HAVE_SENDFILE |
919 | #if HAVE_SENDFILE |
910 | # if __linux |
920 | # if __linux |
911 | res = sendfile (ofd, ifd, &offset, count); |
921 | res = sendfile (ofd, ifd, &offset, count); |
912 | |
922 | |
913 | # elif __freebsd |
923 | # elif __FreeBSD__ |
914 | /* |
924 | /* |
915 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
925 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
916 | * wasted on making it similar to other I/O functions. |
926 | * wasted on making it similar to other I/O functions. |
917 | */ |
927 | */ |
918 | { |
928 | { |
919 | off_t sbytes; |
929 | off_t sbytes; |
920 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
930 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
921 | |
931 | |
922 | if (res < 0 && sbytes) |
932 | #if 0 /* according to the manpage, this is correct, but broken behaviour */ |
923 | /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ |
933 | /* freebsd' sendfile will return 0 on success */ |
|
|
934 | /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */ |
|
|
935 | /* not on e.g. EIO or EPIPE - sounds broken */ |
|
|
936 | if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0) |
|
|
937 | res = sbytes; |
|
|
938 | #endif |
|
|
939 | |
|
|
940 | /* according to source inspection, this is correct, and useful behaviour */ |
|
|
941 | if (sbytes) |
|
|
942 | res = sbytes; |
|
|
943 | } |
|
|
944 | |
|
|
945 | # elif defined (__APPLE__) |
|
|
946 | |
|
|
947 | { |
|
|
948 | off_t sbytes = count; |
|
|
949 | res = sendfile (ifd, ofd, offset, &sbytes, 0, 0); |
|
|
950 | |
|
|
951 | /* according to the manpage, sbytes is always valid */ |
|
|
952 | if (sbytes) |
924 | res = sbytes; |
953 | res = sbytes; |
925 | } |
954 | } |
926 | |
955 | |
927 | # elif __hpux |
956 | # elif __hpux |
928 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
957 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
… | |
… | |
942 | if (res < 0 && sbytes) |
971 | if (res < 0 && sbytes) |
943 | res = sbytes; |
972 | res = sbytes; |
944 | } |
973 | } |
945 | |
974 | |
946 | # endif |
975 | # endif |
|
|
976 | |
|
|
977 | #elif defined (_WIN32) |
|
|
978 | |
|
|
979 | /* does not work, just for documentation of what would need to be done */ |
|
|
980 | { |
|
|
981 | HANDLE h = TO_SOCKET (ifd); |
|
|
982 | SetFilePointer (h, offset, 0, FILE_BEGIN); |
|
|
983 | res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0); |
|
|
984 | } |
|
|
985 | |
947 | #else |
986 | #else |
948 | res = -1; |
987 | res = -1; |
949 | errno = ENOSYS; |
988 | errno = ENOSYS; |
950 | #endif |
989 | #endif |
951 | |
990 | |
952 | if (res < 0 |
991 | if (res < 0 |
953 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
992 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
|
|
993 | /* BSDs */ |
|
|
994 | #ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */ |
|
|
995 | || errno == ENOTSUP |
|
|
996 | #endif |
|
|
997 | || errno == EOPNOTSUPP /* BSDs */ |
954 | #if __solaris |
998 | #if __solaris |
955 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
999 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
956 | #endif |
1000 | #endif |
957 | ) |
1001 | ) |
958 | ) |
1002 | ) |
… | |
… | |
989 | } |
1033 | } |
990 | |
1034 | |
991 | return res; |
1035 | return res; |
992 | } |
1036 | } |
993 | |
1037 | |
994 | static int |
1038 | static signed char |
995 | eio_dent_cmp (const void *a_, const void *b_) |
1039 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
996 | { |
1040 | { |
997 | const eio_dirent *a = (const eio_dirent *)a_; |
1041 | return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */ |
998 | const eio_dirent *b = (const eio_dirent *)b_; |
|
|
999 | |
|
|
1000 | return (int)b->score - (int)a->score ? (int)b->score - (int)a->score |
|
|
1001 | : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0; /* int might be < ino_t */ |
1042 | : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0; |
|
|
1043 | } |
|
|
1044 | |
|
|
1045 | #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0 |
|
|
1046 | |
|
|
1047 | #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */ |
|
|
1048 | #define EIO_SORT_FAST 60 /* when to only use insertion sort */ |
|
|
1049 | |
|
|
1050 | static void |
|
|
1051 | eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
|
|
1052 | { |
|
|
1053 | unsigned char bits [9 + sizeof (ino_t) * 8]; |
|
|
1054 | unsigned char *bit = bits; |
|
|
1055 | |
|
|
1056 | assert (CHAR_BIT == 8); |
|
|
1057 | assert (sizeof (eio_dirent) * 8 < 256); |
|
|
1058 | assert (offsetof (eio_dirent, inode)); /* we use 0 as sentinel */ |
|
|
1059 | assert (offsetof (eio_dirent, score)); /* we use 0 as sentinel */ |
|
|
1060 | |
|
|
1061 | if (size <= EIO_SORT_FAST) |
|
|
1062 | return; |
|
|
1063 | |
|
|
1064 | /* first prepare an array of bits to test in our radix sort */ |
|
|
1065 | /* try to take endianness into account, as well as differences in ino_t sizes */ |
|
|
1066 | /* inode_bits must contain all inodes ORed together */ |
|
|
1067 | /* which is used to skip bits that are 0 everywhere, which is very common */ |
|
|
1068 | { |
|
|
1069 | ino_t endianness; |
|
|
1070 | int i, j; |
|
|
1071 | |
|
|
1072 | /* we store the byte offset of byte n into byte n of "endianness" */ |
|
|
1073 | for (i = 0; i < sizeof (ino_t); ++i) |
|
|
1074 | ((unsigned char *)&endianness)[i] = i; |
|
|
1075 | |
|
|
1076 | *bit++ = 0; |
|
|
1077 | |
|
|
1078 | for (i = 0; i < sizeof (ino_t); ++i) |
|
|
1079 | { |
|
|
1080 | /* shifting off the byte offsets out of "endianness" */ |
|
|
1081 | int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8; |
|
|
1082 | endianness >>= 8; |
|
|
1083 | |
|
|
1084 | for (j = 0; j < 8; ++j) |
|
|
1085 | if (inode_bits & (((ino_t)1) << (i * 8 + j))) |
|
|
1086 | *bit++ = offs + j; |
|
|
1087 | } |
|
|
1088 | |
|
|
1089 | for (j = 0; j < 8; ++j) |
|
|
1090 | if (score_bits & (1 << j)) |
|
|
1091 | *bit++ = offsetof (eio_dirent, score) * 8 + j; |
|
|
1092 | } |
|
|
1093 | |
|
|
1094 | /* now actually do the sorting (a variant of MSD radix sort) */ |
|
|
1095 | { |
|
|
1096 | eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base; |
|
|
1097 | eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end; |
|
|
1098 | unsigned char *bit_stk [9 + sizeof (ino_t) * 8]; |
|
|
1099 | int stk_idx = 0; |
|
|
1100 | |
|
|
1101 | base_stk [stk_idx] = dents; |
|
|
1102 | end_stk [stk_idx] = dents + size; |
|
|
1103 | bit_stk [stk_idx] = bit - 1; |
|
|
1104 | |
|
|
1105 | do |
|
|
1106 | { |
|
|
1107 | base = base_stk [stk_idx]; |
|
|
1108 | end = end_stk [stk_idx]; |
|
|
1109 | bit = bit_stk [stk_idx]; |
|
|
1110 | |
|
|
1111 | for (;;) |
|
|
1112 | { |
|
|
1113 | unsigned char O = *bit >> 3; |
|
|
1114 | unsigned char M = 1 << (*bit & 7); |
|
|
1115 | |
|
|
1116 | eio_dirent *a = base; |
|
|
1117 | eio_dirent *b = end; |
|
|
1118 | |
|
|
1119 | if (b - a < EIO_SORT_CUTOFF) |
|
|
1120 | break; |
|
|
1121 | |
|
|
1122 | /* now bit-partition the array on the bit */ |
|
|
1123 | /* this ugly asymmetric loop seems to perform much better than typical */ |
|
|
1124 | /* partition algos found in the literature */ |
|
|
1125 | do |
|
|
1126 | if (!(((unsigned char *)a)[O] & M)) |
|
|
1127 | ++a; |
|
|
1128 | else if (!(((unsigned char *)--b)[O] & M)) |
|
|
1129 | { |
|
|
1130 | eio_dirent tmp = *a; *a = *b; *b = tmp; |
|
|
1131 | ++a; |
|
|
1132 | } |
|
|
1133 | while (b > a); |
|
|
1134 | |
|
|
1135 | /* next bit, or stop, if no bits left in this path */ |
|
|
1136 | if (!*--bit) |
|
|
1137 | break; |
|
|
1138 | |
|
|
1139 | base_stk [stk_idx] = a; |
|
|
1140 | end_stk [stk_idx] = end; |
|
|
1141 | bit_stk [stk_idx] = bit; |
|
|
1142 | ++stk_idx; |
|
|
1143 | |
|
|
1144 | end = a; |
|
|
1145 | } |
|
|
1146 | } |
|
|
1147 | while (stk_idx--); |
|
|
1148 | } |
|
|
1149 | } |
|
|
1150 | |
|
|
1151 | static void |
|
|
1152 | eio_dent_insertion_sort (eio_dirent *dents, int size) |
|
|
1153 | { |
|
|
1154 | /* first move the smallest element to the front, to act as a sentinel */ |
|
|
1155 | { |
|
|
1156 | int i; |
|
|
1157 | eio_dirent *min = dents; |
|
|
1158 | |
|
|
1159 | /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */ |
|
|
1160 | for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; ) |
|
|
1161 | if (EIO_DENT_CMP (dents [i], <, *min)) |
|
|
1162 | min = &dents [i]; |
|
|
1163 | |
|
|
1164 | /* swap elements 0 and j (minimum) */ |
|
|
1165 | { |
|
|
1166 | eio_dirent tmp = *dents; *dents = *min; *min = tmp; |
|
|
1167 | } |
|
|
1168 | } |
|
|
1169 | |
|
|
1170 | /* then do standard insertion sort, assuming that all elements are >= dents [0] */ |
|
|
1171 | { |
|
|
1172 | eio_dirent *i, *j; |
|
|
1173 | |
|
|
1174 | for (i = dents + 1; i < dents + size; ++i) |
|
|
1175 | { |
|
|
1176 | eio_dirent value = *i; |
|
|
1177 | |
|
|
1178 | for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j) |
|
|
1179 | j [1] = j [0]; |
|
|
1180 | |
|
|
1181 | j [1] = value; |
|
|
1182 | } |
|
|
1183 | } |
|
|
1184 | } |
|
|
1185 | |
|
|
1186 | static void |
|
|
1187 | eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
|
|
1188 | { |
|
|
1189 | if (size <= 1) |
|
|
1190 | return; /* our insertion sort relies on size > 0 */ |
|
|
1191 | |
|
|
1192 | /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */ |
|
|
1193 | /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */ |
|
|
1194 | eio_dent_radix_sort (dents, size, score_bits, inode_bits); |
|
|
1195 | |
|
|
1196 | /* use an insertion sort at the end, or for small arrays, */ |
|
|
1197 | /* as insertion sort is more efficient for small partitions */ |
|
|
1198 | eio_dent_insertion_sort (dents, size); |
1002 | } |
1199 | } |
1003 | |
1200 | |
1004 | /* read a full directory */ |
1201 | /* read a full directory */ |
1005 | static void |
1202 | static void |
1006 | eio__scandir (eio_req *req, etp_worker *self) |
1203 | eio__scandir (eio_req *req, etp_worker *self) |
1007 | { |
1204 | { |
1008 | DIR *dirp; |
1205 | DIR *dirp; |
1009 | EIO_STRUCT_DIRENT *entp; |
1206 | EIO_STRUCT_DIRENT *entp; |
1010 | unsigned char *name, *names; |
1207 | char *name, *names; |
1011 | int namesalloc = 4096; |
1208 | int namesalloc = 4096; |
1012 | int namesoffs = 0; |
1209 | int namesoffs = 0; |
1013 | int flags = req->int1; |
1210 | int flags = req->int1; |
1014 | eio_dirent *dents = 0; |
1211 | eio_dirent *dents = 0; |
1015 | int dentalloc = 128; |
1212 | int dentalloc = 128; |
1016 | int dentoffs = 0; |
1213 | int dentoffs = 0; |
|
|
1214 | ino_t inode_bits = 0; |
1017 | |
1215 | |
1018 | req->result = -1; |
1216 | req->result = -1; |
1019 | |
1217 | |
1020 | if (!(flags & EIO_READDIR_DENTS)) |
1218 | if (!(flags & EIO_READDIR_DENTS)) |
1021 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
1219 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
1022 | |
1220 | |
1023 | X_LOCK (wrklock); |
1221 | X_LOCK (wrklock); |
1024 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
1222 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
1025 | self->dirp = dirp = opendir (req->ptr1); |
1223 | self->dirp = dirp = opendir (req->ptr1); |
1026 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1224 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1027 | req->ptr1 = names = malloc (namesalloc); |
|
|
1028 | req->ptr2 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
1225 | req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
|
|
1226 | req->ptr2 = names = malloc (namesalloc); |
1029 | X_UNLOCK (wrklock); |
1227 | X_UNLOCK (wrklock); |
1030 | |
1228 | |
1031 | if (dirp && names && (!flags || dents)) |
1229 | if (dirp && names && (!flags || dents)) |
1032 | for (;;) |
1230 | for (;;) |
1033 | { |
1231 | { |
… | |
… | |
1041 | |
1239 | |
1042 | /* sort etc. */ |
1240 | /* sort etc. */ |
1043 | req->int1 = flags; |
1241 | req->int1 = flags; |
1044 | req->result = dentoffs; |
1242 | req->result = dentoffs; |
1045 | |
1243 | |
1046 | if (dents) |
|
|
1047 | { |
|
|
1048 | eio_dirent *ent = dents + dentoffs; |
|
|
1049 | |
|
|
1050 | while (ent > dents) |
|
|
1051 | (--ent)->name = names + (size_t)ent->name; |
|
|
1052 | } |
|
|
1053 | |
|
|
1054 | if (flags & EIO_READDIR_STAT_ORDER |
1244 | if (flags & EIO_READDIR_STAT_ORDER) |
1055 | || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN))) |
1245 | eio_dent_sort (dents, dentoffs, 0, inode_bits); /* sort by inode exclusively */ |
1056 | { |
|
|
1057 | /* pray your qsort doesn't use quicksort */ |
|
|
1058 | qsort (dents, dentoffs, sizeof (*dents), eio_dent_cmp); /* score depends of DIRS_FIRST */ |
|
|
1059 | } |
|
|
1060 | else if (flags & EIO_READDIR_DIRS_FIRST) |
1246 | else if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1247 | if (flags & EIO_READDIR_FOUND_UNKNOWN) |
|
|
1248 | eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */ |
|
|
1249 | else |
1061 | { |
1250 | { |
1062 | /* in this case, all is known, and we just put dirs first and sort them */ |
1251 | /* in this case, all is known, and we just put dirs first and sort them */ |
1063 | eio_dirent *ent = dents + dentoffs; |
1252 | eio_dirent *oth = dents + dentoffs; |
1064 | eio_dirent *dir = dents; |
1253 | eio_dirent *dir = dents; |
1065 | |
1254 | |
|
|
1255 | /* now partition dirs to the front, and non-dirs to the back */ |
|
|
1256 | /* by walking from both sides and swapping if necessary */ |
|
|
1257 | /* also clear score, so it doesn't influence sorting */ |
1066 | while (ent > dir) |
1258 | while (oth > dir) |
1067 | { |
1259 | { |
1068 | if (dir->type == DT_DIR) |
1260 | if (dir->type == EIO_DT_DIR) |
1069 | ++dir; |
1261 | ++dir; |
1070 | else |
|
|
1071 | { |
|
|
1072 | --ent; |
|
|
1073 | |
|
|
1074 | if (ent->type == DT_DIR) |
1262 | else if ((--oth)->type == EIO_DT_DIR) |
1075 | { |
1263 | { |
1076 | eio_dirent tmp = *dir; |
1264 | eio_dirent tmp = *dir; *dir = *oth; *oth = tmp; |
1077 | *dir = *ent; |
|
|
1078 | *ent = tmp; |
|
|
1079 | |
1265 | |
1080 | ++dir; |
1266 | ++dir; |
1081 | } |
1267 | } |
1082 | } |
1268 | } |
1083 | } |
|
|
1084 | |
1269 | |
1085 | /* now sort the dirs only */ |
1270 | /* now sort the dirs only */ |
1086 | qsort (dents, dir - dents, sizeof (*dents), eio_dent_cmp); |
1271 | eio_dent_sort (dents, dir - dents, 0, inode_bits); |
1087 | } |
1272 | } |
1088 | |
|
|
1089 | /* only provide the names array unless DENTS is specified */ |
|
|
1090 | if (!(flags & EIO_READDIR_DENTS)) |
|
|
1091 | { |
|
|
1092 | X_LOCK (wrklock); |
|
|
1093 | assert (!dents); |
|
|
1094 | req->ptr1 = 0; |
|
|
1095 | req->ptr2 = names; |
|
|
1096 | X_UNLOCK (wrklock); |
|
|
1097 | } |
|
|
1098 | |
1273 | |
1099 | break; |
1274 | break; |
1100 | } |
1275 | } |
1101 | |
1276 | |
1102 | /* now add the entry to our list(s) */ |
1277 | /* now add the entry to our list(s) */ |
… | |
… | |
1109 | |
1284 | |
1110 | while (expect_false (namesoffs + len > namesalloc)) |
1285 | while (expect_false (namesoffs + len > namesalloc)) |
1111 | { |
1286 | { |
1112 | namesalloc *= 2; |
1287 | namesalloc *= 2; |
1113 | X_LOCK (wrklock); |
1288 | X_LOCK (wrklock); |
1114 | req->ptr1 = names = realloc (names, namesalloc); |
1289 | req->ptr2 = names = realloc (names, namesalloc); |
1115 | X_UNLOCK (wrklock); |
1290 | X_UNLOCK (wrklock); |
1116 | |
1291 | |
1117 | if (!names) |
1292 | if (!names) |
1118 | break; |
1293 | break; |
1119 | } |
1294 | } |
… | |
… | |
1126 | |
1301 | |
1127 | if (expect_false (dentoffs == dentalloc)) |
1302 | if (expect_false (dentoffs == dentalloc)) |
1128 | { |
1303 | { |
1129 | dentalloc *= 2; |
1304 | dentalloc *= 2; |
1130 | X_LOCK (wrklock); |
1305 | X_LOCK (wrklock); |
1131 | req->ptr2 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
1306 | req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
1132 | X_UNLOCK (wrklock); |
1307 | X_UNLOCK (wrklock); |
1133 | |
1308 | |
1134 | if (!dents) |
1309 | if (!dents) |
1135 | break; |
1310 | break; |
1136 | } |
1311 | } |
1137 | |
1312 | |
1138 | ent = dents + dentoffs; |
1313 | ent = dents + dentoffs; |
1139 | |
1314 | |
1140 | ent->name = (char *)(size_t)namesoffs; /* rather dirtily we store the offset in the pointer */ |
1315 | ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */ |
1141 | ent->namelen = len - 1; |
1316 | ent->namelen = len - 1; |
1142 | ent->inode = D_INO (entp); |
1317 | ent->inode = D_INO (entp); |
|
|
1318 | |
|
|
1319 | inode_bits |= ent->inode; |
1143 | |
1320 | |
1144 | switch (D_TYPE (entp)) |
1321 | switch (D_TYPE (entp)) |
1145 | { |
1322 | { |
1146 | default: |
1323 | default: |
1147 | ent->type = EIO_DT_UNKNOWN; |
1324 | ent->type = EIO_DT_UNKNOWN; |
… | |
… | |
1190 | #ifdef DT_WHT |
1367 | #ifdef DT_WHT |
1191 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
1368 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
1192 | #endif |
1369 | #endif |
1193 | } |
1370 | } |
1194 | |
1371 | |
1195 | ent->score = 0; |
1372 | ent->score = 7; |
1196 | |
1373 | |
1197 | if (flags & EIO_READDIR_DIRS_FIRST) |
1374 | if (flags & EIO_READDIR_DIRS_FIRST) |
1198 | { |
1375 | { |
1199 | if (ent->type == EIO_DT_UNKNOWN) |
1376 | if (ent->type == EIO_DT_UNKNOWN) |
1200 | { |
1377 | { |
1201 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
1378 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
1202 | ent->score = 98; |
1379 | ent->score = 1; |
1203 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
1380 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
1204 | ent->score = len <= 2 ? len + 60 : len <= 4 ? 50 : len <= 7 ? 40 : 10; /* shorter == more likely dir, but avoid too many classes */ |
1381 | ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */ |
1205 | } |
1382 | } |
1206 | else if (ent->type == EIO_DT_DIR) |
1383 | else if (ent->type == EIO_DT_DIR) |
1207 | ent->score = 100; |
1384 | ent->score = 0; |
1208 | } |
1385 | } |
1209 | } |
1386 | } |
1210 | |
1387 | |
1211 | namesoffs += len; |
1388 | namesoffs += len; |
1212 | ++dentoffs; |
1389 | ++dentoffs; |
1213 | } |
1390 | } |
|
|
1391 | |
|
|
1392 | if (EIO_CANCELLED (req)) |
|
|
1393 | { |
|
|
1394 | errno = ECANCELED; |
|
|
1395 | break; |
|
|
1396 | } |
1214 | } |
1397 | } |
1215 | else |
|
|
1216 | req->result = -1; |
|
|
1217 | } |
1398 | } |
|
|
1399 | |
|
|
1400 | #ifdef PAGESIZE |
|
|
1401 | # define eio_pagesize() PAGESIZE |
|
|
1402 | #else |
|
|
1403 | static intptr_t |
|
|
1404 | eio_pagesize (void) |
|
|
1405 | { |
|
|
1406 | static intptr_t page; |
|
|
1407 | |
|
|
1408 | if (!page) |
|
|
1409 | page = sysconf (_SC_PAGESIZE); |
|
|
1410 | |
|
|
1411 | return page; |
|
|
1412 | } |
|
|
1413 | #endif |
|
|
1414 | |
|
|
1415 | static void |
|
|
1416 | eio_page_align (void **addr, size_t *length) |
|
|
1417 | { |
|
|
1418 | intptr_t mask = eio_pagesize () - 1; |
|
|
1419 | |
|
|
1420 | /* round down addr */ |
|
|
1421 | intptr_t adj = mask & (intptr_t)*addr; |
|
|
1422 | |
|
|
1423 | *addr = (void *)((intptr_t)*addr - adj); |
|
|
1424 | *length += adj; |
|
|
1425 | |
|
|
1426 | /* round up length */ |
|
|
1427 | *length = (*length + mask) & ~mask; |
|
|
1428 | } |
|
|
1429 | |
|
|
1430 | #if !_POSIX_MEMLOCK |
|
|
1431 | # define eio__mlock(a,b) ((errno = ENOSYS), -1) |
|
|
1432 | # define eio__mlockall(a) ((errno = ENOSYS), -1) |
|
|
1433 | #else |
|
|
1434 | |
|
|
1435 | static int |
|
|
1436 | eio__mlock (void *addr, size_t length) |
|
|
1437 | { |
|
|
1438 | eio_page_align (&addr, &length); |
|
|
1439 | |
|
|
1440 | return mlock (addr, length); |
|
|
1441 | } |
|
|
1442 | |
|
|
1443 | static int |
|
|
1444 | eio__mlockall (int flags) |
|
|
1445 | { |
|
|
1446 | #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7 |
|
|
1447 | extern int mallopt (int, int); |
|
|
1448 | mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */ |
|
|
1449 | #endif |
|
|
1450 | |
|
|
1451 | if (EIO_MCL_CURRENT != MCL_CURRENT |
|
|
1452 | || EIO_MCL_FUTURE != MCL_FUTURE) |
|
|
1453 | { |
|
|
1454 | flags = 0 |
|
|
1455 | | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0) |
|
|
1456 | | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0); |
|
|
1457 | } |
|
|
1458 | |
|
|
1459 | return mlockall (flags); |
|
|
1460 | } |
|
|
1461 | #endif |
1218 | |
1462 | |
1219 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
1463 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
1220 | # undef msync |
|
|
1221 | # define msync(a,b,c) ((errno = ENOSYS), -1) |
1464 | # define eio__msync(a,b,c) ((errno = ENOSYS), -1) |
|
|
1465 | #else |
|
|
1466 | |
|
|
1467 | int |
|
|
1468 | eio__msync (void *mem, size_t len, int flags) |
|
|
1469 | { |
|
|
1470 | eio_page_align (&mem, &len); |
|
|
1471 | |
|
|
1472 | if (EIO_MS_ASYNC != MS_SYNC |
|
|
1473 | || EIO_MS_INVALIDATE != MS_INVALIDATE |
|
|
1474 | || EIO_MS_SYNC != MS_SYNC) |
|
|
1475 | { |
|
|
1476 | flags = 0 |
|
|
1477 | | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0) |
|
|
1478 | | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0) |
|
|
1479 | | (flags & EIO_MS_SYNC ? MS_SYNC : 0); |
|
|
1480 | } |
|
|
1481 | |
|
|
1482 | return msync (mem, len, flags); |
|
|
1483 | } |
|
|
1484 | |
1222 | #endif |
1485 | #endif |
1223 | |
1486 | |
1224 | int |
1487 | int |
1225 | eio__mtouch (void *mem, size_t len, int flags) |
1488 | eio__mtouch (void *mem, size_t len, int flags) |
1226 | { |
1489 | { |
|
|
1490 | eio_page_align (&mem, &len); |
|
|
1491 | |
|
|
1492 | { |
1227 | intptr_t addr = (intptr_t)mem; |
1493 | intptr_t addr = (intptr_t)mem; |
1228 | intptr_t end = addr + len; |
1494 | intptr_t end = addr + len; |
1229 | #ifdef PAGESIZE |
1495 | intptr_t page = eio_pagesize (); |
1230 | const intptr_t page = PAGESIZE; |
|
|
1231 | #else |
|
|
1232 | static intptr_t page; |
|
|
1233 | |
1496 | |
1234 | if (!page) |
|
|
1235 | page = sysconf (_SC_PAGESIZE); |
|
|
1236 | #endif |
|
|
1237 | |
|
|
1238 | addr &= ~(page - 1); /* assume page size is always a power of two */ |
|
|
1239 | |
|
|
1240 | if (addr < end) |
1497 | if (addr < end) |
1241 | if (flags) /* modify */ |
1498 | if (flags & EIO_MT_MODIFY) /* modify */ |
1242 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len); |
1499 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len); |
1243 | else |
1500 | else |
1244 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len); |
1501 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len); |
|
|
1502 | } |
1245 | |
1503 | |
1246 | return 0; |
1504 | return 0; |
1247 | } |
1505 | } |
1248 | |
1506 | |
1249 | /*****************************************************************************/ |
1507 | /*****************************************************************************/ |
… | |
… | |
1372 | return 0; \ |
1630 | return 0; \ |
1373 | } |
1631 | } |
1374 | |
1632 | |
1375 | static void eio_execute (etp_worker *self, eio_req *req) |
1633 | static void eio_execute (etp_worker *self, eio_req *req) |
1376 | { |
1634 | { |
1377 | errno = 0; |
|
|
1378 | |
|
|
1379 | switch (req->type) |
1635 | switch (req->type) |
1380 | { |
1636 | { |
1381 | case EIO_READ: ALLOC (req->size); |
1637 | case EIO_READ: ALLOC (req->size); |
1382 | req->result = req->offs >= 0 |
1638 | req->result = req->offs >= 0 |
1383 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
1639 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
… | |
… | |
1393 | req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1649 | req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1394 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1650 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1395 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1651 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1396 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1652 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
1397 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
1653 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1654 | |
|
|
1655 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1656 | req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1657 | case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1658 | req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
1398 | |
1659 | |
1399 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
1660 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
1400 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
1661 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
1401 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
1662 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
1402 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
1663 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
… | |
… | |
1412 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
1673 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
1413 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
1674 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
1414 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
1675 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
1415 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break; |
1676 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break; |
1416 | |
1677 | |
1417 | case EIO_READLINK: ALLOC (NAME_MAX); |
1678 | case EIO_READLINK: ALLOC (PATH_MAX); |
1418 | req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; |
1679 | req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break; |
1419 | |
1680 | |
1420 | case EIO_SYNC: req->result = 0; sync (); break; |
1681 | case EIO_SYNC: req->result = 0; sync (); break; |
1421 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
1682 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
1422 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
1683 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
1423 | case EIO_MSYNC: req->result = msync (req->ptr2, req->size, req->int1); break; |
1684 | case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break; |
1424 | case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break; |
1685 | case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break; |
|
|
1686 | case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break; |
|
|
1687 | case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break; |
1425 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
1688 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
1426 | |
1689 | |
1427 | case EIO_READDIR: eio__scandir (req, self); break; |
1690 | case EIO_READDIR: eio__scandir (req, self); break; |
1428 | |
1691 | |
1429 | case EIO_BUSY: |
1692 | case EIO_BUSY: |
1430 | #ifdef _WIN32 |
1693 | #ifdef _WIN32 |
1431 | Sleep (req->nv1 * 1000.); |
1694 | Sleep (req->nv1 * 1e3); |
1432 | #else |
1695 | #else |
1433 | { |
1696 | { |
1434 | struct timeval tv; |
1697 | struct timeval tv; |
1435 | |
1698 | |
1436 | tv.tv_sec = req->nv1; |
1699 | tv.tv_sec = req->nv1; |
1437 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; |
1700 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6; |
1438 | |
1701 | |
1439 | req->result = select (0, 0, 0, 0, &tv); |
1702 | req->result = select (0, 0, 0, 0, &tv); |
1440 | } |
1703 | } |
1441 | #endif |
1704 | #endif |
1442 | break; |
1705 | break; |
… | |
… | |
1457 | times = tv; |
1720 | times = tv; |
1458 | } |
1721 | } |
1459 | else |
1722 | else |
1460 | times = 0; |
1723 | times = 0; |
1461 | |
1724 | |
1462 | |
|
|
1463 | req->result = req->type == EIO_FUTIME |
1725 | req->result = req->type == EIO_FUTIME |
1464 | ? futimes (req->int1, times) |
1726 | ? futimes (req->int1, times) |
1465 | : utimes (req->ptr1, times); |
1727 | : utimes (req->ptr1, times); |
1466 | } |
1728 | } |
1467 | break; |
1729 | break; |
… | |
… | |
1476 | case EIO_CUSTOM: |
1738 | case EIO_CUSTOM: |
1477 | ((void (*)(eio_req *))req->feed) (req); |
1739 | ((void (*)(eio_req *))req->feed) (req); |
1478 | break; |
1740 | break; |
1479 | |
1741 | |
1480 | default: |
1742 | default: |
|
|
1743 | errno = ENOSYS; |
1481 | req->result = -1; |
1744 | req->result = -1; |
1482 | break; |
1745 | break; |
1483 | } |
1746 | } |
1484 | |
1747 | |
1485 | req->errorno = errno; |
1748 | req->errorno = errno; |
… | |
… | |
1515 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
1778 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
1516 | { |
1779 | { |
1517 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
1780 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
1518 | } |
1781 | } |
1519 | |
1782 | |
|
|
1783 | eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data) |
|
|
1784 | { |
|
|
1785 | REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND; |
|
|
1786 | } |
|
|
1787 | |
|
|
1788 | eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data) |
|
|
1789 | { |
|
|
1790 | REQ (EIO_MLOCKALL); req->int1 = flags; SEND; |
|
|
1791 | } |
|
|
1792 | |
1520 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
1793 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
1521 | { |
1794 | { |
1522 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
1795 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
1523 | } |
1796 | } |
1524 | |
1797 | |
… | |
… | |
1548 | } |
1821 | } |
1549 | |
1822 | |
1550 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
1823 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
1551 | { |
1824 | { |
1552 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
1825 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
|
|
1826 | } |
|
|
1827 | |
|
|
1828 | eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data) |
|
|
1829 | { |
|
|
1830 | REQ (EIO_FSTATVFS); req->int1 = fd; SEND; |
1553 | } |
1831 | } |
1554 | |
1832 | |
1555 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
1833 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
1556 | { |
1834 | { |
1557 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
1835 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
… | |
… | |
1629 | } |
1907 | } |
1630 | |
1908 | |
1631 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
1909 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
1632 | { |
1910 | { |
1633 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
1911 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
|
|
1912 | } |
|
|
1913 | |
|
|
1914 | eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data) |
|
|
1915 | { |
|
|
1916 | return eio__1path (EIO_STATVFS, path, pri, cb, data); |
1634 | } |
1917 | } |
1635 | |
1918 | |
1636 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
1919 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
1637 | { |
1920 | { |
1638 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
1921 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
… | |
… | |
1742 | /* misc garbage */ |
2025 | /* misc garbage */ |
1743 | |
2026 | |
1744 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
2027 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
1745 | { |
2028 | { |
1746 | etp_worker wrk; |
2029 | etp_worker wrk; |
|
|
2030 | ssize_t ret; |
1747 | |
2031 | |
1748 | wrk.dbuf = 0; |
2032 | wrk.dbuf = 0; |
1749 | |
2033 | |
1750 | eio__sendfile (ofd, ifd, offset, count, &wrk); |
2034 | ret = eio__sendfile (ofd, ifd, offset, count, &wrk); |
1751 | |
2035 | |
1752 | if (wrk.dbuf) |
2036 | if (wrk.dbuf) |
1753 | free (wrk.dbuf); |
2037 | free (wrk.dbuf); |
1754 | } |
|
|
1755 | |
2038 | |
|
|
2039 | return ret; |
|
|
2040 | } |
|
|
2041 | |