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

Comparing libeio/eio.c (file contents):
Revision 1.30 by root, Wed Jun 3 12:24:49 2009 UTC vs.
Revision 1.65 by root, Mon May 30 12:56:50 2011 UTC

1/* 1/*
2 * libeio implementation 2 * libeio implementation
3 * 3 *
4 * Copyright (c) 2007,2008 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
58#ifndef EIO_FINISH 63#ifndef EIO_FINISH
68#endif 73#endif
69 74
70#ifdef _WIN32 75#ifdef _WIN32
71 76
72 /*doh*/ 77 /*doh*/
73
74#else 78#else
75 79
76# include "config.h"
77# include <sys/time.h> 80# include <sys/time.h>
78# include <sys/select.h> 81# include <sys/select.h>
79# include <unistd.h> 82# include <unistd.h>
80# include <utime.h> 83# include <utime.h>
81# include <signal.h> 84# include <signal.h>
82# include <dirent.h> 85# include <dirent.h>
83 86
87#if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES
88# include <sys/mman.h>
89#endif
90
91/* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */
92# if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__
93# define _DIRENT_HAVE_D_TYPE /* sigh */
94# define D_INO(de) (de)->d_fileno
95# define D_NAMLEN(de) (de)->d_namlen
96# elif __linux || defined d_ino || _XOPEN_SOURCE >= 600
97# define D_INO(de) (de)->d_ino
98# endif
99
100#ifdef _D_EXACT_NAMLEN
101# undef D_NAMLEN
102# define D_NAMLEN(de) _D_EXACT_NAMLEN (de)
103#endif
104
105# ifdef _DIRENT_HAVE_D_TYPE
106# define D_TYPE(de) (de)->d_type
107# endif
108
84# ifndef EIO_STRUCT_DIRENT 109# ifndef EIO_STRUCT_DIRENT
85# define EIO_STRUCT_DIRENT struct dirent 110# define EIO_STRUCT_DIRENT struct dirent
86# endif 111# endif
87 112
88#endif 113#endif
89 114
90#if HAVE_SENDFILE 115#if HAVE_SENDFILE
91# if __linux 116# if __linux
92# include <sys/sendfile.h> 117# include <sys/sendfile.h>
93# elif __freebsd 118# elif __FreeBSD__ || defined __APPLE__
94# include <sys/socket.h> 119# include <sys/socket.h>
95# include <sys/uio.h> 120# include <sys/uio.h>
96# elif __hpux 121# elif __hpux
97# include <sys/socket.h> 122# include <sys/socket.h>
98# elif __solaris /* not yet */ 123# elif __solaris
99# include <sys/sendfile.h> 124# include <sys/sendfile.h>
100# else 125# else
101# error sendfile support requested but not available 126# error sendfile support requested but not available
102# endif 127# endif
103#endif 128#endif
104 129
105/* number of seconds after which an idle threads exit */ 130#ifndef D_TYPE
106#define IDLE_TIMEOUT 10 131# define D_TYPE(de) 0
132#endif
133#ifndef D_INO
134# define D_INO(de) 0
135#endif
136#ifndef D_NAMLEN
137# define D_NAMLEN(de) strlen ((de)->d_name)
138#endif
107 139
108/* used for struct dirent, AIX doesn't provide it */ 140/* used for struct dirent, AIX doesn't provide it */
109#ifndef NAME_MAX 141#ifndef NAME_MAX
110# 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
111#endif 148#endif
112 149
113/* buffer size for various temporary buffers */ 150/* buffer size for various temporary buffers */
114#define EIO_BUFSIZE 65536 151#define EIO_BUFSIZE 65536
115 152
159 if (wrk->dirp) \ 196 if (wrk->dirp) \
160 { \ 197 { \
161 closedir (wrk->dirp); \ 198 closedir (wrk->dirp); \
162 wrk->dirp = 0; \ 199 wrk->dirp = 0; \
163 } 200 }
201
164#define ETP_WORKER_COMMON \ 202#define ETP_WORKER_COMMON \
165 void *dbuf; \ 203 void *dbuf; \
166 DIR *dirp; 204 DIR *dirp;
167 205
168/*****************************************************************************/ 206/*****************************************************************************/
169 207
170#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) 208#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
171 209
172/* calculcate time difference in ~1/EIO_TICKS of a second */ 210/* calculate time difference in ~1/EIO_TICKS of a second */
173static int tvdiff (struct timeval *tv1, struct timeval *tv2) 211static int tvdiff (struct timeval *tv1, struct timeval *tv2)
174{ 212{
175 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS 213 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
176 + ((tv2->tv_usec - tv1->tv_usec) >> 10); 214 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
177} 215}
185static unsigned int max_poll_reqs; /* reslock */ 223static unsigned int max_poll_reqs; /* reslock */
186 224
187static volatile unsigned int nreqs; /* reqlock */ 225static volatile unsigned int nreqs; /* reqlock */
188static volatile unsigned int nready; /* reqlock */ 226static volatile unsigned int nready; /* reqlock */
189static volatile unsigned int npending; /* reqlock */ 227static volatile unsigned int npending; /* reqlock */
190static volatile unsigned int max_idle = 4; 228static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */
229static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */
191 230
192static mutex_t wrklock = X_MUTEX_INIT; 231static xmutex_t wrklock;
193static mutex_t reslock = X_MUTEX_INIT; 232static xmutex_t reslock;
194static mutex_t reqlock = X_MUTEX_INIT; 233static xmutex_t reqlock;
195static cond_t reqwait = X_COND_INIT; 234static xcond_t reqwait;
196 235
197#if !HAVE_PREADWRITE 236#if !HAVE_PREADWRITE
198/* 237/*
199 * make our pread/pwrite emulation safe against themselves, but not against 238 * make our pread/pwrite emulation safe against themselves, but not against
200 * normal read/write by using a mutex. slows down execution a lot, 239 * normal read/write by using a mutex. slows down execution a lot,
201 * but that's your problem, not mine. 240 * but that's your problem, not mine.
202 */ 241 */
203static mutex_t preadwritelock = X_MUTEX_INIT; 242static xmutex_t preadwritelock = X_MUTEX_INIT;
204#endif 243#endif
205 244
206typedef struct etp_worker 245typedef struct etp_worker
207{ 246{
208 /* locked by wrklock */ 247 /* locked by wrklock */
209 struct etp_worker *prev, *next; 248 struct etp_worker *prev, *next;
210 249
211 thread_t tid; 250 xthread_t tid;
212 251
213 /* locked by reslock, reqlock or wrklock */ 252 /* locked by reslock, reqlock or wrklock */
214 ETP_REQ *req; /* currently processed request */ 253 ETP_REQ *req; /* currently processed request */
215 254
216 ETP_WORKER_COMMON 255 ETP_WORKER_COMMON
330 } 369 }
331 370
332 abort (); 371 abort ();
333} 372}
334 373
374static void etp_thread_init (void)
375{
376 X_MUTEX_CREATE (wrklock);
377 X_MUTEX_CREATE (reslock);
378 X_MUTEX_CREATE (reqlock);
379 X_COND_CREATE (reqwait);
380}
381
335static void etp_atfork_prepare (void) 382static void etp_atfork_prepare (void)
336{ 383{
337 X_LOCK (wrklock); 384 X_LOCK (wrklock);
338 X_LOCK (reqlock); 385 X_LOCK (reqlock);
339 X_LOCK (reslock); 386 X_LOCK (reslock);
377 idle = 0; 424 idle = 0;
378 nreqs = 0; 425 nreqs = 0;
379 nready = 0; 426 nready = 0;
380 npending = 0; 427 npending = 0;
381 428
382 etp_atfork_parent (); 429 etp_thread_init ();
383} 430}
384 431
385static void 432static void
386etp_once_init (void) 433etp_once_init (void)
387{ 434{
435 etp_thread_init ();
388 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); 436 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child);
389} 437}
390 438
391static int 439static int
392etp_init (void (*want_poll)(void), void (*done_poll)(void)) 440etp_init (void (*want_poll)(void), void (*done_poll)(void))
569} 617}
570 618
571static void etp_set_max_poll_time (double nseconds) 619static void etp_set_max_poll_time (double nseconds)
572{ 620{
573 if (WORDACCESS_UNSAFE) X_LOCK (reslock); 621 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
574 max_poll_time = nseconds; 622 max_poll_time = nseconds * EIO_TICKS;
575 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); 623 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
576} 624}
577 625
578static void etp_set_max_poll_reqs (unsigned int maxreqs) 626static void etp_set_max_poll_reqs (unsigned int maxreqs)
579{ 627{
583} 631}
584 632
585static void etp_set_max_idle (unsigned int nthreads) 633static void etp_set_max_idle (unsigned int nthreads)
586{ 634{
587 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 635 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
588 max_idle = nthreads <= 0 ? 1 : nthreads; 636 max_idle = nthreads;
637 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
638}
639
640static void etp_set_idle_timeout (unsigned int seconds)
641{
642 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
643 idle_timeout = seconds;
589 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 644 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
590} 645}
591 646
592static void etp_set_min_parallel (unsigned int nthreads) 647static void etp_set_min_parallel (unsigned int nthreads)
593{ 648{
721void eio_set_max_idle (unsigned int nthreads) 776void eio_set_max_idle (unsigned int nthreads)
722{ 777{
723 etp_set_max_idle (nthreads); 778 etp_set_max_idle (nthreads);
724} 779}
725 780
781void eio_set_idle_timeout (unsigned int seconds)
782{
783 etp_set_idle_timeout (seconds);
784}
785
726void eio_set_min_parallel (unsigned int nthreads) 786void eio_set_min_parallel (unsigned int nthreads)
727{ 787{
728 etp_set_min_parallel (nthreads); 788 etp_set_min_parallel (nthreads);
729} 789}
730 790
778 838
779 return res; 839 return res;
780} 840}
781#endif 841#endif
782 842
783#ifndef HAVE_FUTIMES 843#ifndef HAVE_UTIMES
784 844
785# undef utimes 845# undef utimes
786# undef futimes
787# define utimes(path,times) eio__utimes (path, times) 846# define utimes(path,times) eio__utimes (path, times)
788# define futimes(fd,times) eio__futimes (fd, times)
789 847
790static int 848static int
791eio__utimes (const char *filename, const struct timeval times[2]) 849eio__utimes (const char *filename, const struct timeval times[2])
792{ 850{
793 if (times) 851 if (times)
800 return utime (filename, &buf); 858 return utime (filename, &buf);
801 } 859 }
802 else 860 else
803 return utime (filename, 0); 861 return utime (filename, 0);
804} 862}
863
864#endif
865
866#ifndef HAVE_FUTIMES
867
868# undef futimes
869# define futimes(fd,times) eio__futimes (fd, times)
805 870
806static int eio__futimes (int fd, const struct timeval tv[2]) 871static int eio__futimes (int fd, const struct timeval tv[2])
807{ 872{
808 errno = ENOSYS; 873 errno = ENOSYS;
809 return -1; 874 return -1;
838 if (!res || errno != ENOSYS) 903 if (!res || errno != ENOSYS)
839 return res; 904 return res;
840#endif 905#endif
841 906
842 /* even though we could play tricks with the flags, it's better to always 907 /* even though we could play tricks with the flags, it's better to always
843 * call fdatasync, as thta matches the expectation of it's users best */ 908 * call fdatasync, as that matches the expectation of its users best */
844 return fdatasync (fd); 909 return fdatasync (fd);
845} 910}
846 911
847#if !HAVE_READAHEAD 912#if !HAVE_READAHEAD
848# undef readahead 913# undef readahead
880 945
881#if HAVE_SENDFILE 946#if HAVE_SENDFILE
882# if __linux 947# if __linux
883 res = sendfile (ofd, ifd, &offset, count); 948 res = sendfile (ofd, ifd, &offset, count);
884 949
885# elif __freebsd 950# elif __FreeBSD__
886 /* 951 /*
887 * Of course, the freebsd sendfile is a dire hack with no thoughts 952 * Of course, the freebsd sendfile is a dire hack with no thoughts
888 * wasted on making it similar to other I/O functions. 953 * wasted on making it similar to other I/O functions.
889 */ 954 */
890 { 955 {
891 off_t sbytes; 956 off_t sbytes;
892 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); 957 res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0);
893 958
894 if (res < 0 && sbytes) 959 #if 0 /* according to the manpage, this is correct, but broken behaviour */
895 /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ 960 /* freebsd' sendfile will return 0 on success */
961 /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */
962 /* not on e.g. EIO or EPIPE - sounds broken */
963 if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0)
964 res = sbytes;
965 #endif
966
967 /* according to source inspection, this is correct, and useful behaviour */
968 if (sbytes)
969 res = sbytes;
970 }
971
972# elif defined (__APPLE__)
973
974 {
975 off_t sbytes = count;
976 res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
977
978 /* according to the manpage, sbytes is always valid */
979 if (sbytes)
896 res = sbytes; 980 res = sbytes;
897 } 981 }
898 982
899# elif __hpux 983# elif __hpux
900 res = sendfile (ofd, ifd, offset, count, 0, 0); 984 res = sendfile (ofd, ifd, offset, count, 0, 0);
914 if (res < 0 && sbytes) 998 if (res < 0 && sbytes)
915 res = sbytes; 999 res = sbytes;
916 } 1000 }
917 1001
918# endif 1002# endif
1003
1004#elif defined (_WIN32)
1005
1006 /* does not work, just for documentation of what would need to be done */
1007 {
1008 HANDLE h = TO_SOCKET (ifd);
1009 SetFilePointer (h, offset, 0, FILE_BEGIN);
1010 res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
1011 }
1012
919#else 1013#else
920 res = -1; 1014 res = -1;
921 errno = ENOSYS; 1015 errno = ENOSYS;
922#endif 1016#endif
923 1017
924 if (res < 0 1018 if (res < 0
925 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK 1019 && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK
1020 /* BSDs */
1021#ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */
1022 || errno == ENOTSUP
1023#endif
1024 || errno == EOPNOTSUPP /* BSDs */
926#if __solaris 1025#if __solaris
927 || errno == EAFNOSUPPORT || errno == EPROTOTYPE 1026 || errno == EAFNOSUPPORT || errno == EPROTOTYPE
928#endif 1027#endif
929 ) 1028 )
930 ) 1029 )
961 } 1060 }
962 1061
963 return res; 1062 return res;
964} 1063}
965 1064
1065static signed char
1066eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
1067{
1068 return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
1069 : a->inode < b->inode ? -1
1070 : a->inode > b->inode ? 1
1071 : 0;
1072}
1073
1074#define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1075
1076#define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1077#define EIO_SORT_FAST 60 /* when to only use insertion sort */
1078
1079static void
1080eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1081{
1082 unsigned char bits [9 + sizeof (ino_t) * 8];
1083 unsigned char *bit = bits;
1084
1085 assert (CHAR_BIT == 8);
1086 assert (sizeof (eio_dirent) * 8 < 256);
1087 assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */
1088 assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */
1089
1090 if (size <= EIO_SORT_FAST)
1091 return;
1092
1093 /* first prepare an array of bits to test in our radix sort */
1094 /* try to take endianness into account, as well as differences in ino_t sizes */
1095 /* inode_bits must contain all inodes ORed together */
1096 /* which is used to skip bits that are 0 everywhere, which is very common */
1097 {
1098 ino_t endianness;
1099 int i, j;
1100
1101 /* we store the byte offset of byte n into byte n of "endianness" */
1102 for (i = 0; i < sizeof (ino_t); ++i)
1103 ((unsigned char *)&endianness)[i] = i;
1104
1105 *bit++ = 0;
1106
1107 for (i = 0; i < sizeof (ino_t); ++i)
1108 {
1109 /* shifting off the byte offsets out of "endianness" */
1110 int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1111 endianness >>= 8;
1112
1113 for (j = 0; j < 8; ++j)
1114 if (inode_bits & (((ino_t)1) << (i * 8 + j)))
1115 *bit++ = offs + j;
1116 }
1117
1118 for (j = 0; j < 8; ++j)
1119 if (score_bits & (1 << j))
1120 *bit++ = offsetof (eio_dirent, score) * 8 + j;
1121 }
1122
1123 /* now actually do the sorting (a variant of MSD radix sort) */
1124 {
1125 eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base;
1126 eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end;
1127 unsigned char *bit_stk [9 + sizeof (ino_t) * 8];
1128 int stk_idx = 0;
1129
1130 base_stk [stk_idx] = dents;
1131 end_stk [stk_idx] = dents + size;
1132 bit_stk [stk_idx] = bit - 1;
1133
1134 do
1135 {
1136 base = base_stk [stk_idx];
1137 end = end_stk [stk_idx];
1138 bit = bit_stk [stk_idx];
1139
1140 for (;;)
1141 {
1142 unsigned char O = *bit >> 3;
1143 unsigned char M = 1 << (*bit & 7);
1144
1145 eio_dirent *a = base;
1146 eio_dirent *b = end;
1147
1148 if (b - a < EIO_SORT_CUTOFF)
1149 break;
1150
1151 /* now bit-partition the array on the bit */
1152 /* this ugly asymmetric loop seems to perform much better than typical */
1153 /* partition algos found in the literature */
1154 do
1155 if (!(((unsigned char *)a)[O] & M))
1156 ++a;
1157 else if (!(((unsigned char *)--b)[O] & M))
1158 {
1159 eio_dirent tmp = *a; *a = *b; *b = tmp;
1160 ++a;
1161 }
1162 while (b > a);
1163
1164 /* next bit, or stop, if no bits left in this path */
1165 if (!*--bit)
1166 break;
1167
1168 base_stk [stk_idx] = a;
1169 end_stk [stk_idx] = end;
1170 bit_stk [stk_idx] = bit;
1171 ++stk_idx;
1172
1173 end = a;
1174 }
1175 }
1176 while (stk_idx--);
1177 }
1178}
1179
1180static void
1181eio_dent_insertion_sort (eio_dirent *dents, int size)
1182{
1183 /* first move the smallest element to the front, to act as a sentinel */
1184 {
1185 int i;
1186 eio_dirent *min = dents;
1187
1188 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1189 for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1190 if (EIO_DENT_CMP (dents [i], <, *min))
1191 min = &dents [i];
1192
1193 /* swap elements 0 and j (minimum) */
1194 {
1195 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1196 }
1197 }
1198
1199 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1200 {
1201 eio_dirent *i, *j;
1202
1203 for (i = dents + 1; i < dents + size; ++i)
1204 {
1205 eio_dirent value = *i;
1206
1207 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1208 j [1] = j [0];
1209
1210 j [1] = value;
1211 }
1212 }
1213}
1214
1215static void
1216eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1217{
1218 if (size <= 1)
1219 return; /* our insertion sort relies on size > 0 */
1220
1221 /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1222 /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1223 eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1224
1225 /* use an insertion sort at the end, or for small arrays, */
1226 /* as insertion sort is more efficient for small partitions */
1227 eio_dent_insertion_sort (dents, size);
1228}
1229
966/* read a full directory */ 1230/* read a full directory */
967static void 1231static void
968eio__scandir (eio_req *req, etp_worker *self) 1232eio__scandir (eio_req *req, etp_worker *self)
969{ 1233{
970 DIR *dirp; 1234 DIR *dirp;
971 EIO_STRUCT_DIRENT *entp; 1235 EIO_STRUCT_DIRENT *entp;
972 char *name, *names; 1236 char *name, *names;
973 int memlen = 4096; 1237 int namesalloc = 4096;
974 int memofs = 0; 1238 int namesoffs = 0;
1239 int flags = req->int1;
1240 eio_dirent *dents = 0;
1241 int dentalloc = 128;
975 int res = 0; 1242 int dentoffs = 0;
1243 ino_t inode_bits = 0;
1244
1245 req->result = -1;
1246
1247 if (!(flags & EIO_READDIR_DENTS))
1248 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
976 1249
977 X_LOCK (wrklock); 1250 X_LOCK (wrklock);
978 /* the corresponding closedir is in ETP_WORKER_CLEAR */ 1251 /* the corresponding closedir is in ETP_WORKER_CLEAR */
979 self->dirp = dirp = opendir (req->ptr1); 1252 self->dirp = dirp = opendir (req->ptr1);
1253
980 req->flags |= EIO_FLAG_PTR2_FREE; 1254 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1255 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
981 req->ptr2 = names = malloc (memlen); 1256 req->ptr2 = names = malloc (namesalloc);
982 X_UNLOCK (wrklock); 1257 X_UNLOCK (wrklock);
983 1258
984 if (dirp && names) 1259 if (dirp && names && (!flags || dents))
985 for (;;) 1260 for (;;)
986 { 1261 {
987 errno = 0; 1262 errno = 0;
988 entp = readdir (dirp); 1263 entp = readdir (dirp);
989 1264
990 if (!entp) 1265 if (!entp)
1266 {
1267 if (errno)
1268 break;
1269
1270 /* sort etc. */
1271 req->int1 = flags;
1272 req->result = dentoffs;
1273
1274 if (flags & EIO_READDIR_STAT_ORDER)
1275 eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits);
1276 else if (flags & EIO_READDIR_DIRS_FIRST)
1277 if (flags & EIO_READDIR_FOUND_UNKNOWN)
1278 eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1279 else
1280 {
1281 /* in this case, all is known, and we just put dirs first and sort them */
1282 eio_dirent *oth = dents + dentoffs;
1283 eio_dirent *dir = dents;
1284
1285 /* now partition dirs to the front, and non-dirs to the back */
1286 /* by walking from both sides and swapping if necessary */
1287 while (oth > dir)
1288 {
1289 if (dir->type == EIO_DT_DIR)
1290 ++dir;
1291 else if ((--oth)->type == EIO_DT_DIR)
1292 {
1293 eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1294
1295 ++dir;
1296 }
1297 }
1298
1299 /* now sort the dirs only (dirs all have the same score) */
1300 eio_dent_sort (dents, dir - dents, 0, inode_bits);
1301 }
1302
991 break; 1303 break;
1304 }
992 1305
1306 /* now add the entry to our list(s) */
993 name = entp->d_name; 1307 name = entp->d_name;
994 1308
1309 /* skip . and .. entries */
995 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) 1310 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
996 { 1311 {
997 int len = strlen (name) + 1; 1312 int len = D_NAMLEN (entp) + 1;
998 1313
999 res++; 1314 while (expect_false (namesoffs + len > namesalloc))
1000
1001 while (memofs + len > memlen)
1002 { 1315 {
1003 memlen *= 2; 1316 namesalloc *= 2;
1004 X_LOCK (wrklock); 1317 X_LOCK (wrklock);
1005 req->ptr2 = names = realloc (names, memlen); 1318 req->ptr2 = names = realloc (names, namesalloc);
1006 X_UNLOCK (wrklock); 1319 X_UNLOCK (wrklock);
1007 1320
1008 if (!names) 1321 if (!names)
1009 break; 1322 break;
1010 } 1323 }
1011 1324
1012 memcpy (names + memofs, name, len); 1325 memcpy (names + namesoffs, name, len);
1326
1327 if (dents)
1328 {
1329 struct eio_dirent *ent;
1330
1331 if (expect_false (dentoffs == dentalloc))
1332 {
1333 dentalloc *= 2;
1334 X_LOCK (wrklock);
1335 req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1336 X_UNLOCK (wrklock);
1337
1338 if (!dents)
1339 break;
1340 }
1341
1342 ent = dents + dentoffs;
1343
1344 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1345 ent->namelen = len - 1;
1346 ent->inode = D_INO (entp);
1347
1348 inode_bits |= ent->inode;
1349
1350 switch (D_TYPE (entp))
1351 {
1352 default:
1353 ent->type = EIO_DT_UNKNOWN;
1354 flags |= EIO_READDIR_FOUND_UNKNOWN;
1355 break;
1356
1357 #ifdef DT_FIFO
1358 case DT_FIFO: ent->type = EIO_DT_FIFO; break;
1359 #endif
1360 #ifdef DT_CHR
1361 case DT_CHR: ent->type = EIO_DT_CHR; break;
1362 #endif
1363 #ifdef DT_MPC
1364 case DT_MPC: ent->type = EIO_DT_MPC; break;
1365 #endif
1366 #ifdef DT_DIR
1367 case DT_DIR: ent->type = EIO_DT_DIR; break;
1368 #endif
1369 #ifdef DT_NAM
1370 case DT_NAM: ent->type = EIO_DT_NAM; break;
1371 #endif
1372 #ifdef DT_BLK
1373 case DT_BLK: ent->type = EIO_DT_BLK; break;
1374 #endif
1375 #ifdef DT_MPB
1376 case DT_MPB: ent->type = EIO_DT_MPB; break;
1377 #endif
1378 #ifdef DT_REG
1379 case DT_REG: ent->type = EIO_DT_REG; break;
1380 #endif
1381 #ifdef DT_NWK
1382 case DT_NWK: ent->type = EIO_DT_NWK; break;
1383 #endif
1384 #ifdef DT_CMP
1385 case DT_CMP: ent->type = EIO_DT_CMP; break;
1386 #endif
1387 #ifdef DT_LNK
1388 case DT_LNK: ent->type = EIO_DT_LNK; break;
1389 #endif
1390 #ifdef DT_SOCK
1391 case DT_SOCK: ent->type = EIO_DT_SOCK; break;
1392 #endif
1393 #ifdef DT_DOOR
1394 case DT_DOOR: ent->type = EIO_DT_DOOR; break;
1395 #endif
1396 #ifdef DT_WHT
1397 case DT_WHT: ent->type = EIO_DT_WHT; break;
1398 #endif
1399 }
1400
1401 ent->score = 7;
1402
1403 if (flags & EIO_READDIR_DIRS_FIRST)
1404 {
1405 if (ent->type == EIO_DT_UNKNOWN)
1406 {
1407 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1408 ent->score = 1;
1409 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1410 ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1411 }
1412 else if (ent->type == EIO_DT_DIR)
1413 ent->score = 0;
1414 }
1415 }
1416
1013 memofs += len; 1417 namesoffs += len;
1418 ++dentoffs;
1419 }
1420
1421 if (EIO_CANCELLED (req))
1422 {
1423 errno = ECANCELED;
1424 break;
1014 } 1425 }
1015 } 1426 }
1016
1017 if (errno)
1018 res = -1;
1019
1020 req->result = res;
1021} 1427}
1428
1429#ifdef PAGESIZE
1430# define eio_pagesize() PAGESIZE
1431#else
1432static intptr_t
1433eio_pagesize (void)
1434{
1435 static intptr_t page;
1436
1437 if (!page)
1438 page = sysconf (_SC_PAGESIZE);
1439
1440 return page;
1441}
1442#endif
1443
1444static void
1445eio_page_align (void **addr, size_t *length)
1446{
1447 intptr_t mask = eio_pagesize () - 1;
1448
1449 /* round down addr */
1450 intptr_t adj = mask & (intptr_t)*addr;
1451
1452 *addr = (void *)((intptr_t)*addr - adj);
1453 *length += adj;
1454
1455 /* round up length */
1456 *length = (*length + mask) & ~mask;
1457}
1458
1459#if !_POSIX_MEMLOCK
1460# define eio__mlockall(a) ((errno = ENOSYS), -1)
1461#else
1462
1463static int
1464eio__mlockall (int flags)
1465{
1466 #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7
1467 extern int mallopt (int, int);
1468 mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */
1469 #endif
1470
1471 if (EIO_MCL_CURRENT != MCL_CURRENT
1472 || EIO_MCL_FUTURE != MCL_FUTURE)
1473 {
1474 flags = 0
1475 | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0)
1476 | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0);
1477 }
1478
1479 return mlockall (flags);
1480}
1481#endif
1482
1483#if !_POSIX_MEMLOCK_RANGE
1484# define eio__mlock(a,b) ((errno = ENOSYS), -1)
1485#else
1486
1487static int
1488eio__mlock (void *addr, size_t length)
1489{
1490 eio_page_align (&addr, &length);
1491
1492 return mlock (addr, length);
1493}
1494
1495#endif
1022 1496
1023#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) 1497#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1024# undef msync
1025# define msync(a,b,c) ((errno = ENOSYS), -1) 1498# define eio__msync(a,b,c) ((errno = ENOSYS), -1)
1499#else
1500
1501int
1502eio__msync (void *mem, size_t len, int flags)
1503{
1504 eio_page_align (&mem, &len);
1505
1506 if (EIO_MS_ASYNC != MS_SYNC
1507 || EIO_MS_INVALIDATE != MS_INVALIDATE
1508 || EIO_MS_SYNC != MS_SYNC)
1509 {
1510 flags = 0
1511 | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0)
1512 | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0)
1513 | (flags & EIO_MS_SYNC ? MS_SYNC : 0);
1514 }
1515
1516 return msync (mem, len, flags);
1517}
1518
1026#endif 1519#endif
1027 1520
1028int 1521int
1029eio__mtouch (void *mem, size_t len, int flags) 1522eio__mtouch (void *mem, size_t len, int flags)
1030{ 1523{
1524 eio_page_align (&mem, &len);
1525
1526 {
1031 intptr_t addr = (intptr_t)mem; 1527 intptr_t addr = (intptr_t)mem;
1032 intptr_t end = addr + len; 1528 intptr_t end = addr + len;
1033#ifdef PAGESIZE 1529 intptr_t page = eio_pagesize ();
1034 const intptr_t page = PAGESIZE;
1035#else
1036 static intptr_t page;
1037 1530
1038 if (!page)
1039 page = sysconf (_SC_PAGESIZE);
1040#endif
1041
1042 addr &= ~(page - 1); /* assume page size is always a power of two */
1043
1044 if (addr < end) 1531 if (addr < end)
1045 if (flags) /* modify */ 1532 if (flags & EIO_MT_MODIFY) /* modify */
1046 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len); 1533 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len);
1047 else 1534 else
1048 do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len); 1535 do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len);
1536 }
1049 1537
1050 return 0; 1538 return 0;
1051} 1539}
1052 1540
1053/*****************************************************************************/ 1541/*****************************************************************************/
1087 if (req) 1575 if (req)
1088 break; 1576 break;
1089 1577
1090 ++idle; 1578 ++idle;
1091 1579
1092 ts.tv_sec = time (0) + IDLE_TIMEOUT; 1580 ts.tv_sec = time (0) + idle_timeout;
1093 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) 1581 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
1094 { 1582 {
1095 if (idle > max_idle) 1583 if (idle > max_idle)
1096 { 1584 {
1097 --idle; 1585 --idle;
1176 return 0; \ 1664 return 0; \
1177 } 1665 }
1178 1666
1179static void eio_execute (etp_worker *self, eio_req *req) 1667static void eio_execute (etp_worker *self, eio_req *req)
1180{ 1668{
1181 errno = 0;
1182
1183 switch (req->type) 1669 switch (req->type)
1184 { 1670 {
1185 case EIO_READ: ALLOC (req->size); 1671 case EIO_READ: ALLOC (req->size);
1186 req->result = req->offs >= 0 1672 req->result = req->offs >= 0
1187 ? pread (req->int1, req->ptr2, req->size, req->offs) 1673 ? pread (req->int1, req->ptr2, req->size, req->offs)
1198 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); 1684 case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1199 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; 1685 req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break;
1200 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); 1686 case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT));
1201 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; 1687 req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break;
1202 1688
1689 case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1690 req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1691 case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS));
1692 req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break;
1693
1203 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; 1694 case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break;
1204 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; 1695 case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break;
1205 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; 1696 case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break;
1206 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; 1697 case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break;
1207 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; 1698 case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break;
1214 case EIO_RMDIR: req->result = rmdir (req->ptr1); break; 1705 case EIO_RMDIR: req->result = rmdir (req->ptr1); break;
1215 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; 1706 case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break;
1216 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; 1707 case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break;
1217 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; 1708 case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break;
1218 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; 1709 case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break;
1219 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->int3); break; 1710 case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break;
1220 1711
1221 case EIO_READLINK: ALLOC (NAME_MAX); 1712 case EIO_READLINK: ALLOC (PATH_MAX);
1222 req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; 1713 req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break;
1223 1714
1224 case EIO_SYNC: req->result = 0; sync (); break; 1715 case EIO_SYNC: req->result = 0; sync (); break;
1225 case EIO_FSYNC: req->result = fsync (req->int1); break; 1716 case EIO_FSYNC: req->result = fsync (req->int1); break;
1226 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; 1717 case EIO_FDATASYNC: req->result = fdatasync (req->int1); break;
1227 case EIO_MSYNC: req->result = msync (req->ptr2, req->size, req->int1); break; 1718 case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break;
1228 case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break; 1719 case EIO_MTOUCH: req->result = eio__mtouch (req->ptr2, req->size, req->int1); break;
1720 case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break;
1721 case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break;
1229 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; 1722 case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break;
1230 1723
1231 case EIO_READDIR: eio__scandir (req, self); break; 1724 case EIO_READDIR: eio__scandir (req, self); break;
1232 1725
1233 case EIO_BUSY: 1726 case EIO_BUSY:
1234#ifdef _WIN32 1727#ifdef _WIN32
1235 Sleep (req->nv1 * 1000.); 1728 Sleep (req->nv1 * 1e3);
1236#else 1729#else
1237 { 1730 {
1238 struct timeval tv; 1731 struct timeval tv;
1239 1732
1240 tv.tv_sec = req->nv1; 1733 tv.tv_sec = req->nv1;
1241 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; 1734 tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6;
1242 1735
1243 req->result = select (0, 0, 0, 0, &tv); 1736 req->result = select (0, 0, 0, 0, &tv);
1244 } 1737 }
1245#endif 1738#endif
1246 break; 1739 break;
1261 times = tv; 1754 times = tv;
1262 } 1755 }
1263 else 1756 else
1264 times = 0; 1757 times = 0;
1265 1758
1266
1267 req->result = req->type == EIO_FUTIME 1759 req->result = req->type == EIO_FUTIME
1268 ? futimes (req->int1, times) 1760 ? futimes (req->int1, times)
1269 : utimes (req->ptr1, times); 1761 : utimes (req->ptr1, times);
1270 } 1762 }
1271 break; 1763 break;
1280 case EIO_CUSTOM: 1772 case EIO_CUSTOM:
1281 ((void (*)(eio_req *))req->feed) (req); 1773 ((void (*)(eio_req *))req->feed) (req);
1282 break; 1774 break;
1283 1775
1284 default: 1776 default:
1777 errno = ENOSYS;
1285 req->result = -1; 1778 req->result = -1;
1286 break; 1779 break;
1287 } 1780 }
1288 1781
1289 req->errorno = errno; 1782 req->errorno = errno;
1319eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) 1812eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data)
1320{ 1813{
1321 REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; 1814 REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND;
1322} 1815}
1323 1816
1817eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data)
1818{
1819 REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND;
1820}
1821
1822eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data)
1823{
1824 REQ (EIO_MLOCKALL); req->int1 = flags; SEND;
1825}
1826
1324eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) 1827eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data)
1325{ 1828{
1326 REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; 1829 REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND;
1327} 1830}
1328 1831
1352} 1855}
1353 1856
1354eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) 1857eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data)
1355{ 1858{
1356 REQ (EIO_FSTAT); req->int1 = fd; SEND; 1859 REQ (EIO_FSTAT); req->int1 = fd; SEND;
1860}
1861
1862eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data)
1863{
1864 REQ (EIO_FSTATVFS); req->int1 = fd; SEND;
1357} 1865}
1358 1866
1359eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) 1867eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data)
1360{ 1868{
1361 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; 1869 REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND;
1435eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) 1943eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data)
1436{ 1944{
1437 return eio__1path (EIO_LSTAT, path, pri, cb, data); 1945 return eio__1path (EIO_LSTAT, path, pri, cb, data);
1438} 1946}
1439 1947
1948eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data)
1949{
1950 return eio__1path (EIO_STATVFS, path, pri, cb, data);
1951}
1952
1440eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) 1953eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data)
1441{ 1954{
1442 return eio__1path (EIO_UNLINK, path, pri, cb, data); 1955 return eio__1path (EIO_UNLINK, path, pri, cb, data);
1443} 1956}
1444 1957
1445eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data) 1958eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data)
1446{ 1959{
1447 return eio__1path (EIO_RMDIR, path, pri, cb, data); 1960 return eio__1path (EIO_RMDIR, path, pri, cb, data);
1448} 1961}
1449 1962
1450eio_req *eio_readdir (const char *path, int pri, eio_cb cb, void *data) 1963eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data)
1451{ 1964{
1452 return eio__1path (EIO_READDIR, path, pri, cb, data); 1965 REQ (EIO_READDIR); PATH; req->int1 = flags; SEND;
1453} 1966}
1454 1967
1455eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) 1968eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data)
1456{ 1969{
1457 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int3 = (long)dev; SEND; 1970 REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND;
1458} 1971}
1459 1972
1460static eio_req * 1973static eio_req *
1461eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) 1974eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1462{ 1975{
1546/* misc garbage */ 2059/* misc garbage */
1547 2060
1548ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) 2061ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
1549{ 2062{
1550 etp_worker wrk; 2063 etp_worker wrk;
2064 ssize_t ret;
1551 2065
1552 wrk.dbuf = 0; 2066 wrk.dbuf = 0;
1553 2067
1554 eio__sendfile (ofd, ifd, offset, count, &wrk); 2068 ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
1555 2069
1556 if (wrk.dbuf) 2070 if (wrk.dbuf)
1557 free (wrk.dbuf); 2071 free (wrk.dbuf);
1558}
1559 2072
2073 return ret;
2074}
2075

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines