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

Comparing libeio/eio.c (file contents):
Revision 1.35 by root, Sat Jun 6 20:13:46 2009 UTC vs.
Revision 1.62 by root, Tue Feb 15 03:15:16 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 *
… …
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_MEMLOCK_RANGE || _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
… …
127#endif 132#endif
128#ifndef D_NAMLEN 133#ifndef D_NAMLEN
129# define D_NAMLEN(de) strlen ((de)->d_name) 134# define D_NAMLEN(de) strlen ((de)->d_name)
130#endif 135#endif
131 136
132/* number of seconds after which an idle threads exit */
133#define IDLE_TIMEOUT 10
134
135/* used for struct dirent, AIX doesn't provide it */ 137/* used for struct dirent, AIX doesn't provide it */
136#ifndef NAME_MAX 138#ifndef NAME_MAX
137# define NAME_MAX 4096 139# define NAME_MAX 4096
140#endif
141
142/* used for readlink etc. */
143#ifndef PATH_MAX
144# define PATH_MAX 4096
138#endif 145#endif
139 146
140/* buffer size for various temporary buffers */ 147/* buffer size for various temporary buffers */
141#define EIO_BUFSIZE 65536 148#define EIO_BUFSIZE 65536
142 149
… …
195 202
196/*****************************************************************************/ 203/*****************************************************************************/
197 204
198#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) 205#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
199 206
200/* calculcate time difference in ~1/EIO_TICKS of a second */ 207/* calculate time difference in ~1/EIO_TICKS of a second */
201static int tvdiff (struct timeval *tv1, struct timeval *tv2) 208static int tvdiff (struct timeval *tv1, struct timeval *tv2)
202{ 209{
203 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS 210 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
204 + ((tv2->tv_usec - tv1->tv_usec) >> 10); 211 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
205} 212}
… …
213static unsigned int max_poll_reqs; /* reslock */ 220static unsigned int max_poll_reqs; /* reslock */
214 221
215static volatile unsigned int nreqs; /* reqlock */ 222static volatile unsigned int nreqs; /* reqlock */
216static volatile unsigned int nready; /* reqlock */ 223static volatile unsigned int nready; /* reqlock */
217static volatile unsigned int npending; /* reqlock */ 224static volatile unsigned int npending; /* reqlock */
218static volatile unsigned int max_idle = 4; 225static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */
226static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */
219 227
220static mutex_t wrklock = X_MUTEX_INIT; 228static xmutex_t wrklock;
221static mutex_t reslock = X_MUTEX_INIT; 229static xmutex_t reslock;
222static mutex_t reqlock = X_MUTEX_INIT; 230static xmutex_t reqlock;
223static cond_t reqwait = X_COND_INIT; 231static xcond_t reqwait;
224 232
225#if !HAVE_PREADWRITE 233#if !HAVE_PREADWRITE
226/* 234/*
227 * make our pread/pwrite emulation safe against themselves, but not against 235 * make our pread/pwrite emulation safe against themselves, but not against
228 * normal read/write by using a mutex. slows down execution a lot, 236 * normal read/write by using a mutex. slows down execution a lot,
229 * but that's your problem, not mine. 237 * but that's your problem, not mine.
230 */ 238 */
231static mutex_t preadwritelock = X_MUTEX_INIT; 239static xmutex_t preadwritelock = X_MUTEX_INIT;
232#endif 240#endif
233 241
234typedef struct etp_worker 242typedef struct etp_worker
235{ 243{
236 /* locked by wrklock */ 244 /* locked by wrklock */
237 struct etp_worker *prev, *next; 245 struct etp_worker *prev, *next;
238 246
239 thread_t tid; 247 xthread_t tid;
240 248
241 /* locked by reslock, reqlock or wrklock */ 249 /* locked by reslock, reqlock or wrklock */
242 ETP_REQ *req; /* currently processed request */ 250 ETP_REQ *req; /* currently processed request */
243 251
244 ETP_WORKER_COMMON 252 ETP_WORKER_COMMON
… …
358 } 366 }
359 367
360 abort (); 368 abort ();
361} 369}
362 370
371static void etp_thread_init (void)
372{
373 X_MUTEX_CREATE (wrklock);
374 X_MUTEX_CREATE (reslock);
375 X_MUTEX_CREATE (reqlock);
376 X_COND_CREATE (reqwait);
377}
378
363static void etp_atfork_prepare (void) 379static void etp_atfork_prepare (void)
364{ 380{
365 X_LOCK (wrklock); 381 X_LOCK (wrklock);
366 X_LOCK (reqlock); 382 X_LOCK (reqlock);
367 X_LOCK (reslock); 383 X_LOCK (reslock);
… …
405 idle = 0; 421 idle = 0;
406 nreqs = 0; 422 nreqs = 0;
407 nready = 0; 423 nready = 0;
408 npending = 0; 424 npending = 0;
409 425
410 etp_atfork_parent (); 426 etp_thread_init ();
411} 427}
412 428
413static void 429static void
414etp_once_init (void) 430etp_once_init (void)
415{ 431{
432 etp_thread_init ();
416 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); 433 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child);
417} 434}
418 435
419static int 436static int
420etp_init (void (*want_poll)(void), void (*done_poll)(void)) 437etp_init (void (*want_poll)(void), void (*done_poll)(void))
… …
597} 614}
598 615
599static void etp_set_max_poll_time (double nseconds) 616static void etp_set_max_poll_time (double nseconds)
600{ 617{
601 if (WORDACCESS_UNSAFE) X_LOCK (reslock); 618 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
602 max_poll_time = nseconds; 619 max_poll_time = nseconds * EIO_TICKS;
603 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); 620 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
604} 621}
605 622
606static void etp_set_max_poll_reqs (unsigned int maxreqs) 623static void etp_set_max_poll_reqs (unsigned int maxreqs)
607{ 624{
… …
611} 628}
612 629
613static void etp_set_max_idle (unsigned int nthreads) 630static void etp_set_max_idle (unsigned int nthreads)
614{ 631{
615 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 632 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
616 max_idle = nthreads <= 0 ? 1 : nthreads; 633 max_idle = nthreads;
634 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
635}
636
637static void etp_set_idle_timeout (unsigned int seconds)
638{
639 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
640 idle_timeout = seconds;
617 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 641 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
618} 642}
619 643
620static void etp_set_min_parallel (unsigned int nthreads) 644static void etp_set_min_parallel (unsigned int nthreads)
621{ 645{
… …
749void eio_set_max_idle (unsigned int nthreads) 773void eio_set_max_idle (unsigned int nthreads)
750{ 774{
751 etp_set_max_idle (nthreads); 775 etp_set_max_idle (nthreads);
752} 776}
753 777
778void eio_set_idle_timeout (unsigned int seconds)
779{
780 etp_set_idle_timeout (seconds);
781}
782
754void eio_set_min_parallel (unsigned int nthreads) 783void eio_set_min_parallel (unsigned int nthreads)
755{ 784{
756 etp_set_min_parallel (nthreads); 785 etp_set_min_parallel (nthreads);
757} 786}
758 787
… …
806 835
807 return res; 836 return res;
808} 837}
809#endif 838#endif
810 839
811#ifndef HAVE_FUTIMES 840#ifndef HAVE_UTIMES
812 841
813# undef utimes 842# undef utimes
814# undef futimes
815# define utimes(path,times) eio__utimes (path, times) 843# define utimes(path,times) eio__utimes (path, times)
816# define futimes(fd,times) eio__futimes (fd, times)
817 844
818static int 845static int
819eio__utimes (const char *filename, const struct timeval times[2]) 846eio__utimes (const char *filename, const struct timeval times[2])
820{ 847{
821 if (times) 848 if (times)
… …
828 return utime (filename, &buf); 855 return utime (filename, &buf);
829 } 856 }
830 else 857 else
831 return utime (filename, 0); 858 return utime (filename, 0);
832} 859}
860
861#endif
862
863#ifndef HAVE_FUTIMES
864
865# undef futimes
866# define futimes(fd,times) eio__futimes (fd, times)
833 867
834static int eio__futimes (int fd, const struct timeval tv[2]) 868static int eio__futimes (int fd, const struct timeval tv[2])
835{ 869{
836 errno = ENOSYS; 870 errno = ENOSYS;
837 return -1; 871 return -1;
… …
866 if (!res || errno != ENOSYS) 900 if (!res || errno != ENOSYS)
867 return res; 901 return res;
868#endif 902#endif
869 903
870 /* even though we could play tricks with the flags, it's better to always 904 /* 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 */ 905 * call fdatasync, as that matches the expectation of its users best */
872 return fdatasync (fd); 906 return fdatasync (fd);
873} 907}
874 908
875#if !HAVE_READAHEAD 909#if !HAVE_READAHEAD
876# undef readahead 910# undef readahead
… …
908 942
909#if HAVE_SENDFILE 943#if HAVE_SENDFILE
910# if __linux 944# if __linux
911 res = sendfile (ofd, ifd, &offset, count); 945 res = sendfile (ofd, ifd, &offset, count);
912 946
913# elif __freebsd 947# elif __FreeBSD__
914 /* 948 /*
915 * Of course, the freebsd sendfile is a dire hack with no thoughts 949 * Of course, the freebsd sendfile is a dire hack with no thoughts
916 * wasted on making it similar to other I/O functions. 950 * wasted on making it similar to other I/O functions.
917 */ 951 */
918 { 952 {
919 off_t sbytes; 953 off_t sbytes;
920 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); 954 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
921 955
922 if (res < 0 && sbytes) 956 #if 0 /* according to the manpage, this is correct, but broken behaviour */
923 /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ 957 /* freebsd' sendfile will return 0 on success */
958 /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */
959 /* not on e.g. EIO or EPIPE - sounds broken */
960 if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0)
961 res = sbytes;
962 #endif
963
964 /* according to source inspection, this is correct, and useful behaviour */
965 if (sbytes)
966 res = sbytes;
967 }
968
969# elif defined (__APPLE__)
970
971 {
972 off_t sbytes = count;
973 res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
974
975 /* according to the manpage, sbytes is always valid */
976 if (sbytes)
924 res = sbytes; 977 res = sbytes;
925 } 978 }
926 979
927# elif __hpux 980# elif __hpux
928 res = sendfile (ofd, ifd, offset, count, 0, 0); 981 res = sendfile (ofd, ifd, offset, count, 0, 0);
… …
942 if (res < 0 && sbytes) 995 if (res < 0 && sbytes)
943 res = sbytes; 996 res = sbytes;
944 } 997 }
945 998
946# endif 999# endif
1000
1001#elif defined (_WIN32)
1002
1003 /* does not work, just for documentation of what would need to be done */
1004 {
1005 HANDLE h = TO_SOCKET (ifd);
1006 SetFilePointer (h, offset, 0, FILE_BEGIN);
1007 res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
1008 }
1009
947#else 1010#else
948 res = -1; 1011 res = -1;
949 errno = ENOSYS; 1012 errno = ENOSYS;
950#endif 1013#endif
951 1014
952 if (res < 0 1015 if (res < 0
953 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK 1016 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK
1017 /* BSDs */
1018#ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */
1019 || errno == ENOTSUP
1020#endif
1021 || errno == EOPNOTSUPP /* BSDs */
954#if __solaris 1022#if __solaris
955 || errno == EAFNOSUPPORT || errno == EPROTOTYPE 1023 || errno == EAFNOSUPPORT || errno == EPROTOTYPE
956#endif 1024#endif
957 ) 1025 )
958 ) 1026 )
… …
989 } 1057 }
990 1058
991 return res; 1059 return res;
992} 1060}
993 1061
994static int 1062static signed char
995eio_dent_cmp (const void *a_, const void *b_) 1063eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
996{ 1064{
997 const eio_dirent *a = (const eio_dirent *)a_; 1065 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 */ 1066 : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0;
1067}
1068
1069#define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1070
1071#define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1072#define EIO_SORT_FAST 60 /* when to only use insertion sort */
1073
1074static void
1075eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1076{
1077 unsigned char bits [9 + sizeof (ino_t) * 8];
1078 unsigned char *bit = bits;
1079
1080 assert (CHAR_BIT == 8);
1081 assert (sizeof (eio_dirent) * 8 < 256);
1082 assert (offsetof (eio_dirent, inode)); /* we use 0 as sentinel */
1083 assert (offsetof (eio_dirent, score)); /* we use 0 as sentinel */
1084
1085 if (size <= EIO_SORT_FAST)
1086 return;
1087
1088 /* first prepare an array of bits to test in our radix sort */
1089 /* try to take endianness into account, as well as differences in ino_t sizes */
1090 /* inode_bits must contain all inodes ORed together */
1091 /* which is used to skip bits that are 0 everywhere, which is very common */
1092 {
1093 ino_t endianness;
1094 int i, j;
1095
1096 /* we store the byte offset of byte n into byte n of "endianness" */
1097 for (i = 0; i < sizeof (ino_t); ++i)
1098 ((unsigned char *)&endianness)[i] = i;
1099
1100 *bit++ = 0;
1101
1102 for (i = 0; i < sizeof (ino_t); ++i)
1103 {
1104 /* shifting off the byte offsets out of "endianness" */
1105 int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1106 endianness >>= 8;
1107
1108 for (j = 0; j < 8; ++j)
1109 if (inode_bits & (((ino_t)1) << (i * 8 + j)))
1110 *bit++ = offs + j;
1111 }
1112
1113 for (j = 0; j < 8; ++j)
1114 if (score_bits & (1 << j))
1115 *bit++ = offsetof (eio_dirent, score) * 8 + j;
1116 }
1117
1118 /* now actually do the sorting (a variant of MSD radix sort) */
1119 {
1120 eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base;
1121 eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end;
1122 unsigned char *bit_stk [9 + sizeof (ino_t) * 8];
1123 int stk_idx = 0;
1124
1125 base_stk [stk_idx] = dents;
1126 end_stk [stk_idx] = dents + size;
1127 bit_stk [stk_idx] = bit - 1;
1128
1129 do
1130 {
1131 base = base_stk [stk_idx];
1132 end = end_stk [stk_idx];
1133 bit = bit_stk [stk_idx];
1134
1135 for (;;)
1136 {
1137 unsigned char O = *bit >> 3;
1138 unsigned char M = 1 << (*bit & 7);
1139
1140 eio_dirent *a = base;
1141 eio_dirent *b = end;
1142
1143 if (b - a < EIO_SORT_CUTOFF)
1144 break;
1145
1146 /* now bit-partition the array on the bit */
1147 /* this ugly asymmetric loop seems to perform much better than typical */
1148 /* partition algos found in the literature */
1149 do
1150 if (!(((unsigned char *)a)[O] & M))
1151 ++a;
1152 else if (!(((unsigned char *)--b)[O] & M))
1153 {
1154 eio_dirent tmp = *a; *a = *b; *b = tmp;
1155 ++a;
1156 }
1157 while (b > a);
1158
1159 /* next bit, or stop, if no bits left in this path */
1160 if (!*--bit)
1161 break;
1162
1163 base_stk [stk_idx] = a;
1164 end_stk [stk_idx] = end;
1165 bit_stk [stk_idx] = bit;
1166 ++stk_idx;
1167
1168 end = a;
1169 }
1170 }
1171 while (stk_idx--);
1172 }
1173}
1174
1175static void
1176eio_dent_insertion_sort (eio_dirent *dents, int size)
1177{
1178 /* first move the smallest element to the front, to act as a sentinel */
1179 {
1180 int i;
1181 eio_dirent *min = dents;
1182
1183 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1184 for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1185 if (EIO_DENT_CMP (dents [i], <, *min))
1186 min = &dents [i];
1187
1188 /* swap elements 0 and j (minimum) */
1189 {
1190 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1191 }
1192 }
1193
1194 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1195 {
1196 eio_dirent *i, *j;
1197
1198 for (i = dents + 1; i < dents + size; ++i)
1199 {
1200 eio_dirent value = *i;
1201
1202 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1203 j [1] = j [0];
1204
1205 j [1] = value;
1206 }
1207 }
1208}
1209
1210static void
1211eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1212{
1213 if (size <= 1)
1214 return; /* our insertion sort relies on size > 0 */
1215
1216 /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1217 /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1218 eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1219
1220 /* use an insertion sort at the end, or for small arrays, */
1221 /* as insertion sort is more efficient for small partitions */
1222 eio_dent_insertion_sort (dents, size);
1002} 1223}
1003 1224
1004/* read a full directory */ 1225/* read a full directory */
1005static void 1226static void
1006eio__scandir (eio_req *req, etp_worker *self) 1227eio__scandir (eio_req *req, etp_worker *self)
1007{ 1228{
1008 DIR *dirp; 1229 DIR *dirp;
1009 EIO_STRUCT_DIRENT *entp; 1230 EIO_STRUCT_DIRENT *entp;
1010 unsigned char *name, *names; 1231 char *name, *names;
1011 int namesalloc = 4096; 1232 int namesalloc = 4096;
1012 int namesoffs = 0; 1233 int namesoffs = 0;
1013 int flags = req->int1; 1234 int flags = req->int1;
1014 eio_dirent *dents = 0; 1235 eio_dirent *dents = 0;
1015 int dentalloc = 128; 1236 int dentalloc = 128;
1016 int dentoffs = 0; 1237 int dentoffs = 0;
1238 ino_t inode_bits = 0;
1017 1239
1018 req->result = -1; 1240 req->result = -1;
1019 1241
1020 if (!(flags & EIO_READDIR_DENTS)) 1242 if (!(flags & EIO_READDIR_DENTS))
1021 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); 1243 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
1022 1244
1023 X_LOCK (wrklock); 1245 X_LOCK (wrklock);
1024 /* the corresponding closedir is in ETP_WORKER_CLEAR */ 1246 /* the corresponding closedir is in ETP_WORKER_CLEAR */
1025 self->dirp = dirp = opendir (req->ptr1); 1247 self->dirp = dirp = opendir (req->ptr1);
1026 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; 1248 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; 1249 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
1250 req->ptr2 = names = malloc (namesalloc);
1029 X_UNLOCK (wrklock); 1251 X_UNLOCK (wrklock);
1030 1252
1031 if (dirp && names && (!flags || dents)) 1253 if (dirp && names && (!flags || dents))
1032 for (;;) 1254 for (;;)
1033 { 1255 {
… …
1041 1263
1042 /* sort etc. */ 1264 /* sort etc. */
1043 req->int1 = flags; 1265 req->int1 = flags;
1044 req->result = dentoffs; 1266 req->result = dentoffs;
1045 1267
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 1268 if (flags & EIO_READDIR_STAT_ORDER)
1055 || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN))) 1269 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) 1270 else if (flags & EIO_READDIR_DIRS_FIRST)
1271 if (flags & EIO_READDIR_FOUND_UNKNOWN)
1272 eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1273 else
1061 { 1274 {
1062 /* in this case, all is known, and we just put dirs first and sort them */ 1275 /* in this case, all is known, and we just put dirs first and sort them */
1063 eio_dirent *ent = dents + dentoffs; 1276 eio_dirent *oth = dents + dentoffs;
1064 eio_dirent *dir = dents; 1277 eio_dirent *dir = dents;
1065 1278
1066 /* now move dirs to the front, and non-dirs to the back */ 1279 /* now partition dirs to the front, and non-dirs to the back */
1067 /* by walkign from both sides and swapping if necessary */ 1280 /* by walking from both sides and swapping if necessary */
1281 /* also clear score, so it doesn't influence sorting */
1068 while (ent > dir) 1282 while (oth > dir)
1069 { 1283 {
1070 if (dir->type == DT_DIR) 1284 if (dir->type == EIO_DT_DIR)
1071 ++dir; 1285 ++dir;
1072 else
1073 {
1074 --ent;
1075
1076 if (ent->type == DT_DIR) 1286 else if ((--oth)->type == EIO_DT_DIR)
1077 { 1287 {
1078 eio_dirent tmp = *dir; 1288 eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1079 *dir = *ent;
1080 *ent = tmp;
1081 1289
1082 ++dir; 1290 ++dir;
1083 } 1291 }
1084 } 1292 }
1085 }
1086 1293
1087 /* now sort the dirs only */ 1294 /* now sort the dirs only */
1088 qsort (dents, dir - dents, sizeof (*dents), eio_dent_cmp); 1295 eio_dent_sort (dents, dir - dents, 0, inode_bits);
1089 } 1296 }
1090
1091 /* only provide the names array unless DENTS is specified */
1092 if (!(flags & EIO_READDIR_DENTS))
1093 {
1094 X_LOCK (wrklock);
1095 assert (!dents);
1096 req->ptr1 = 0;
1097 req->ptr2 = names;
1098 X_UNLOCK (wrklock);
1099 }
1100 1297
1101 break; 1298 break;
1102 } 1299 }
1103 1300
1104 /* now add the entry to our list(s) */ 1301 /* now add the entry to our list(s) */
… …
1111 1308
1112 while (expect_false (namesoffs + len > namesalloc)) 1309 while (expect_false (namesoffs + len > namesalloc))
1113 { 1310 {
1114 namesalloc *= 2; 1311 namesalloc *= 2;
1115 X_LOCK (wrklock); 1312 X_LOCK (wrklock);
1116 req->ptr1 = names = realloc (names, namesalloc); 1313 req->ptr2 = names = realloc (names, namesalloc);
1117 X_UNLOCK (wrklock); 1314 X_UNLOCK (wrklock);
1118 1315
1119 if (!names) 1316 if (!names)
1120 break; 1317 break;
1121 } 1318 }
… …
1128 1325
1129 if (expect_false (dentoffs == dentalloc)) 1326 if (expect_false (dentoffs == dentalloc))
1130 { 1327 {
1131 dentalloc *= 2; 1328 dentalloc *= 2;
1132 X_LOCK (wrklock); 1329 X_LOCK (wrklock);
1133 req->ptr2 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); 1330 req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1134 X_UNLOCK (wrklock); 1331 X_UNLOCK (wrklock);
1135 1332
1136 if (!dents) 1333 if (!dents)
1137 break; 1334 break;
1138 } 1335 }
1139 1336
1140 ent = dents + dentoffs; 1337 ent = dents + dentoffs;
1141 1338
1142 ent->name = (char *)(size_t)namesoffs; /* rather dirtily we store the offset in the pointer */ 1339 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1143 ent->namelen = len - 1; 1340 ent->namelen = len - 1;
1144 ent->inode = D_INO (entp); 1341 ent->inode = D_INO (entp);
1342
1343 inode_bits |= ent->inode;
1145 1344
1146 switch (D_TYPE (entp)) 1345 switch (D_TYPE (entp))
1147 { 1346 {
1148 default: 1347 default:
1149 ent->type = EIO_DT_UNKNOWN; 1348 ent->type = EIO_DT_UNKNOWN;
… …
1192 #ifdef DT_WHT 1391 #ifdef DT_WHT
1193 case DT_WHT: ent->type = EIO_DT_WHT; break; 1392 case DT_WHT: ent->type = EIO_DT_WHT; break;
1194 #endif 1393 #endif
1195 } 1394 }
1196 1395
1197 ent->score = 0; 1396 ent->score = 7;
1198 1397
1199 if (flags & EIO_READDIR_DIRS_FIRST) 1398 if (flags & EIO_READDIR_DIRS_FIRST)
1200 { 1399 {
1201 if (ent->type == EIO_DT_UNKNOWN) 1400 if (ent->type == EIO_DT_UNKNOWN)
1202 { 1401 {
1203 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ 1402 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1204 ent->score = 98; 1403 ent->score = 1;
1205 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ 1404 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1206 ent->score = len <= 2 ? len + 6 : len <= 4 ? 5 : len <= 7 ? 4 : 1; /* shorter == more likely dir, but avoid too many classes */ 1405 ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1207 } 1406 }
1208 else if (ent->type == EIO_DT_DIR) 1407 else if (ent->type == EIO_DT_DIR)
1209 ent->score = 100; 1408 ent->score = 0;
1210 } 1409 }
1211 } 1410 }
1212 1411
1213 namesoffs += len; 1412 namesoffs += len;
1214 ++dentoffs; 1413 ++dentoffs;
1215 } 1414 }
1415
1416 if (EIO_CANCELLED (req))
1417 {
1418 errno = ECANCELED;
1419 break;
1420 }
1216 } 1421 }
1217 else
1218 req->result = -1;
1219} 1422}
1423
1424#ifdef PAGESIZE
1425# define eio_pagesize() PAGESIZE
1426#else
1427static intptr_t
1428eio_pagesize (void)
1429{
1430 static intptr_t page;
1431
1432 if (!page)
1433 page = sysconf (_SC_PAGESIZE);
1434
1435 return page;
1436}
1437#endif
1438
1439static void
1440eio_page_align (void **addr, size_t *length)
1441{
1442 intptr_t mask = eio_pagesize () - 1;
1443
1444 /* round down addr */
1445 intptr_t adj = mask & (intptr_t)*addr;
1446
1447 *addr = (void *)((intptr_t)*addr - adj);
1448 *length += adj;
1449
1450 /* round up length */
1451 *length = (*length + mask) & ~mask;
1452}
1453
1454#if !_POSIX_MEMLOCK
1455# define eio__mlockall(a) ((errno = ENOSYS), -1)
1456#else
1457
1458static int
1459eio__mlockall (int flags)
1460{
1461 #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7
1462 extern int mallopt (int, int);
1463 mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */
1464 #endif
1465
1466 if (EIO_MCL_CURRENT != MCL_CURRENT
1467 || EIO_MCL_FUTURE != MCL_FUTURE)
1468 {
1469 flags = 0
1470 | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0)
1471 | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0);
1472 }
1473
1474 return mlockall (flags);
1475}
1476#endif
1477
1478#if !_POSIX_MEMLOCK_RANGE
1479# define eio__mlock(a,b) ((errno = ENOSYS), -1)
1480#else
1481
1482static int
1483eio__mlock (void *addr, size_t length)
1484{
1485 eio_page_align (&addr, &length);
1486
1487 return mlock (addr, length);
1488}
1489
1490#endif
1220 1491
1221#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) 1492#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1222# undef msync
1223# define msync(a,b,c) ((errno = ENOSYS), -1) 1493# define eio__msync(a,b,c) ((errno = ENOSYS), -1)
1494#else
1495
1496int
1497eio__msync (void *mem, size_t len, int flags)
1498{
1499 eio_page_align (&mem, &len);
1500
1501 if (EIO_MS_ASYNC != MS_SYNC
1502 || EIO_MS_INVALIDATE != MS_INVALIDATE
1503 || EIO_MS_SYNC != MS_SYNC)
1504 {
1505 flags = 0
1506 | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0)
1507 | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0)
1508 | (flags & EIO_MS_SYNC ? MS_SYNC : 0);
1509 }
1510
1511 return msync (mem, len, flags);
1512}
1513
1224#endif 1514#endif
1225 1515
1226int 1516int
1227eio__mtouch (void *mem, size_t len, int flags) 1517eio__mtouch (void *mem, size_t len, int flags)
1228{ 1518{
1519 eio_page_align (&mem, &len);
1520
1521 {
1229 intptr_t addr = (intptr_t)mem; 1522 intptr_t addr = (intptr_t)mem;
1230 intptr_t end = addr + len; 1523 intptr_t end = addr + len;
1231#ifdef PAGESIZE 1524 intptr_t page = eio_pagesize ();
1232 const intptr_t page = PAGESIZE;
1233#else
1234 static intptr_t page;
1235 1525
1236 if (!page)
1237 page = sysconf (_SC_PAGESIZE);
1238#endif
1239
1240 addr &= ~(page - 1); /* assume page size is always a power of two */
1241
1242 if (addr < end) 1526 if (addr < end)
1243 if (flags) /* modify */ 1527 if (flags & EIO_MT_MODIFY) /* modify */
1244 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len); 1528 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len);
1245 else 1529 else
1246 do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len); 1530 do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len);
1531 }
1247 1532
1248 return 0; 1533 return 0;
1249} 1534}
1250 1535
1251/*****************************************************************************/ 1536/*****************************************************************************/
… …
1285 if (req) 1570 if (req)
1286 break; 1571 break;
1287 1572
1288 ++idle; 1573 ++idle;
1289 1574
1290 ts.tv_sec = time (0) + IDLE_TIMEOUT; 1575 ts.tv_sec = time (0) + idle_timeout;
1291 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) 1576 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
1292 { 1577 {
1293 if (idle > max_idle) 1578 if (idle > max_idle)
1294 { 1579 {
1295 --idle; 1580 --idle;
… …
1374 return 0; \ 1659 return 0; \
1375 } 1660 }
1376 1661
1377static void eio_execute (etp_worker *self, eio_req *req) 1662static void eio_execute (etp_worker *self, eio_req *req)
1378{ 1663{
1379 errno = 0;
1380
1381 switch (req->type) 1664 switch (req->type)
1382 { 1665 {
1383 case EIO_READ: ALLOC (req->size); 1666 case EIO_READ: ALLOC (req->size);
1384 req->result = req->offs >= 0 1667 req->result = req->offs >= 0
1385 ? pread (req->int1, req->ptr2, req->size, req->offs) 1668 ? pread (req->int1, req->ptr2, req->size, req->offs)
… …
1396 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); 1679 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1397 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; 1680 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1398 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); 1681 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1399 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; 1682 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
1400 1683
1684 case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1685 req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1686 case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1687 req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1688
1401 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; 1689 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
1402 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; 1690 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
1403 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; 1691 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
1404 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; 1692 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
1405 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; 1693 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
… …
1412 case EIO_RMDIR: req->result = rmdir (req->ptr1); break; 1700 case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
1413 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; 1701 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
1414 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; 1702 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
1415 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; 1703 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
1416 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; 1704 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
1417 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break; 1705 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
1418 1706
1419 case EIO_READLINK: ALLOC (NAME_MAX); 1707 case EIO_READLINK: ALLOC (PATH_MAX);
1420 req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; 1708 req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break;
1421 1709
1422 case EIO_SYNC: req->result = 0; sync (); break; 1710 case EIO_SYNC: req->result = 0; sync (); break;
1423 case EIO_FSYNC: req->result = fsync (req->int1); break; 1711 case EIO_FSYNC: req->result = fsync (req->int1); break;
1424 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; 1712 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
1425 case EIO_MSYNC: req->result = msync (req->ptr2, req->size, req->int1); break; 1713 case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break;
1426 case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break; 1714 case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break;
1715 case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break;
1716 case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break;
1427 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; 1717 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
1428 1718
1429 case EIO_READDIR: eio__scandir (req, self); break; 1719 case EIO_READDIR: eio__scandir (req, self); break;
1430 1720
1431 case EIO_BUSY: 1721 case EIO_BUSY:
1432#ifdef _WIN32 1722#ifdef _WIN32
1433 Sleep (req->nv1 * 1000.); 1723 Sleep (req->nv1 * 1e3);
1434#else 1724#else
1435 { 1725 {
1436 struct timeval tv; 1726 struct timeval tv;
1437 1727
1438 tv.tv_sec = req->nv1; 1728 tv.tv_sec = req->nv1;
1439 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; 1729 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6;
1440 1730
1441 req->result = select (0, 0, 0, 0, &tv); 1731 req->result = select (0, 0, 0, 0, &tv);
1442 } 1732 }
1443#endif 1733#endif
1444 break; 1734 break;
… …
1459 times = tv; 1749 times = tv;
1460 } 1750 }
1461 else 1751 else
1462 times = 0; 1752 times = 0;
1463 1753
1464
1465 req->result = req->type == EIO_FUTIME 1754 req->result = req->type == EIO_FUTIME
1466 ? futimes (req->int1, times) 1755 ? futimes (req->int1, times)
1467 : utimes (req->ptr1, times); 1756 : utimes (req->ptr1, times);
1468 } 1757 }
1469 break; 1758 break;
… …
1478 case EIO_CUSTOM: 1767 case EIO_CUSTOM:
1479 ((void (*)(eio_req *))req->feed) (req); 1768 ((void (*)(eio_req *))req->feed) (req);
1480 break; 1769 break;
1481 1770
1482 default: 1771 default:
1772 errno = ENOSYS;
1483 req->result = -1; 1773 req->result = -1;
1484 break; 1774 break;
1485 } 1775 }
1486 1776
1487 req->errorno = errno; 1777 req->errorno = errno;
… …
1517eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) 1807eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
1518{ 1808{
1519 REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; 1809 REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
1520} 1810}
1521 1811
1812eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data)
1813{
1814 REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND;
1815}
1816
1817eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data)
1818{
1819 REQ (EIO_MLOCKALL); req->int1 = flags; SEND;
1820}
1821
1522eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) 1822eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
1523{ 1823{
1524 REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; 1824 REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND;
1525} 1825}
1526 1826
… …
1550} 1850}
1551 1851
1552eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) 1852eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
1553{ 1853{
1554 REQ (EIO_FSTAT); req->int1 = fd; SEND; 1854 REQ (EIO_FSTAT); req->int1 = fd; SEND;
1855}
1856
1857eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data)
1858{
1859 REQ (EIO_FSTATVFS); req->int1 = fd; SEND;
1555} 1860}
1556 1861
1557eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) 1862eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data)
1558{ 1863{
1559 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; 1864 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
… …
1633eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) 1938eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data)
1634{ 1939{
1635 return eio__1path (EIO_LSTAT, path, pri, cb, data); 1940 return eio__1path (EIO_LSTAT, path, pri, cb, data);
1636} 1941}
1637 1942
1943eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data)
1944{
1945 return eio__1path (EIO_STATVFS, path, pri, cb, data);
1946}
1947
1638eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) 1948eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data)
1639{ 1949{
1640 return eio__1path (EIO_UNLINK, path, pri, cb, data); 1950 return eio__1path (EIO_UNLINK, path, pri, cb, data);
1641} 1951}
1642 1952
… …
1650 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; 1960 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
1651} 1961}
1652 1962
1653eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) 1963eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
1654{ 1964{
1655 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND; 1965 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND;
1656} 1966}
1657 1967
1658static eio_req * 1968static eio_req *
1659eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) 1969eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1660{ 1970{
… …
1744/* misc garbage */ 2054/* misc garbage */
1745 2055
1746ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) 2056ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
1747{ 2057{
1748 etp_worker wrk; 2058 etp_worker wrk;
2059 ssize_t ret;
1749 2060
1750 wrk.dbuf = 0; 2061 wrk.dbuf = 0;
1751 2062
1752 eio__sendfile (ofd, ifd, offset, count, &wrk); 2063 ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
1753 2064
1754 if (wrk.dbuf) 2065 if (wrk.dbuf)
1755 free (wrk.dbuf); 2066 free (wrk.dbuf);
1756}
1757 2067
2068 return ret;
2069}
2070

Diff Legend

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