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

Comparing cvsroot/libeio/eio.c (file contents):
Revision 1.32 by root, Sat Jun 6 18:06:55 2009 UTC vs.
Revision 1.44 by root, Thu Nov 26 05:25:35 2009 UTC

… …
73#else 73#else
74 74
75# include "config.h" 75# include "config.h"
76# include <sys/time.h> 76# include <sys/time.h>
77# include <sys/select.h> 77# include <sys/select.h>
78# include <sys/mman.h>
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
83/* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ 84/* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */
84# if defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) 85# if defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__)
86# define _DIRENT_HAVE_D_TYPE /* sigh */
85# define D_INO(de) (de)->d_fileno 87# define D_INO(de) (de)->d_fileno
86# define _DIRENT_HAVE_D_TYPE /* sigh */ 88# define D_NAMLEN(de) (de)->d_namlen
87# elif defined(__linux) || defined(d_ino) || _XOPEN_SOURCE >= 600 89# elif defined(__linux) || defined(d_ino) || _XOPEN_SOURCE >= 600
88# define D_INO(de) (de)->d_ino 90# define D_INO(de) (de)->d_ino
89# endif 91# endif
92
93#ifdef _D_EXACT_NAMLEN
94# undef D_NAMLEN
95# define D_NAMLEN(de) _D_EXACT_NAMLEN (de)
96#endif
90 97
91# ifdef _DIRENT_HAVE_D_TYPE 98# ifdef _DIRENT_HAVE_D_TYPE
92# define D_TYPE(de) (de)->d_type 99# define D_TYPE(de) (de)->d_type
93# endif 100# endif
94 101
… …
114#endif 121#endif
115 122
116#ifndef D_TYPE 123#ifndef D_TYPE
117# define D_TYPE(de) 0 124# define D_TYPE(de) 0
118#endif 125#endif
119
120#ifndef D_INO 126#ifndef D_INO
121# define D_INO(de) 0 127# define D_INO(de) 0
128#endif
129#ifndef D_NAMLEN
130# define D_NAMLEN(de) strlen ((de)->d_name)
122#endif 131#endif
123 132
124/* number of seconds after which an idle threads exit */ 133/* number of seconds after which an idle threads exit */
125#define IDLE_TIMEOUT 10 134#define IDLE_TIMEOUT 10
126 135
… …
187 196
188/*****************************************************************************/ 197/*****************************************************************************/
189 198
190#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) 199#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
191 200
192/* calculcate time difference in ~1/EIO_TICKS of a second */ 201/* calculate time difference in ~1/EIO_TICKS of a second */
193static int tvdiff (struct timeval *tv1, struct timeval *tv2) 202static int tvdiff (struct timeval *tv1, struct timeval *tv2)
194{ 203{
195 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS 204 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
196 + ((tv2->tv_usec - tv1->tv_usec) >> 10); 205 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
197} 206}
… …
589} 598}
590 599
591static void etp_set_max_poll_time (double nseconds) 600static void etp_set_max_poll_time (double nseconds)
592{ 601{
593 if (WORDACCESS_UNSAFE) X_LOCK (reslock); 602 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
594 max_poll_time = nseconds; 603 max_poll_time = nseconds * EIO_TICKS;
595 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); 604 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
596} 605}
597 606
598static void etp_set_max_poll_reqs (unsigned int maxreqs) 607static void etp_set_max_poll_reqs (unsigned int maxreqs)
599{ 608{
… …
858 if (!res || errno != ENOSYS) 867 if (!res || errno != ENOSYS)
859 return res; 868 return res;
860#endif 869#endif
861 870
862 /* even though we could play tricks with the flags, it's better to always 871 /* even though we could play tricks with the flags, it's better to always
863 * call fdatasync, as thta matches the expectation of it's users best */ 872 * call fdatasync, as that matches the expectation of its users best */
864 return fdatasync (fd); 873 return fdatasync (fd);
865} 874}
866 875
867#if !HAVE_READAHEAD 876#if !HAVE_READAHEAD
868# undef readahead 877# undef readahead
… …
981 } 990 }
982 991
983 return res; 992 return res;
984} 993}
985 994
986static int 995static signed char
987eio_dent_cmp (const void *a_, const void *b_) 996eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
988{ 997{
989 const eio_dirent *a = (const eio_dirent *)a_; 998 return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
990 const eio_dirent *b = (const eio_dirent *)b_;
991
992 return (int)b->score - (int)a->score ? (int)b->score - (int)a->score
993 : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0; /* int might be < ino_t */ 999 : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0;
1000}
1001
1002#define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1003
1004#define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1005#define EIO_SORT_FAST 60 /* when to only use insertion sort */
1006
1007static void
1008eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1009{
1010 unsigned char bits [9 + sizeof (ino_t) * 8];
1011 unsigned char *bit = bits;
1012
1013 assert (CHAR_BIT == 8);
1014 assert (sizeof (eio_dirent) * 8 < 256);
1015 assert (offsetof (eio_dirent, inode)); /* we use 0 as sentinel */
1016 assert (offsetof (eio_dirent, score)); /* we use 0 as sentinel */
1017
1018 if (size <= EIO_SORT_FAST)
1019 return;
1020
1021 /* first prepare an array of bits to test in our radix sort */
1022 /* try to take endianness into account, as well as differences in ino_t sizes */
1023 /* inode_bits must contain all inodes ORed together */
1024 /* which is used to skip bits that are 0 everywhere, which is very common */
1025 {
1026 ino_t endianness;
1027 int i, j;
1028
1029 /* we store the byte offset of byte n into byte n of "endianness" */
1030 for (i = 0; i < sizeof (ino_t); ++i)
1031 ((unsigned char *)&endianness)[i] = i;
1032
1033 *bit++ = 0;
1034
1035 for (i = 0; i < sizeof (ino_t); ++i)
1036 {
1037 /* shifting off the byte offsets out of "endianness" */
1038 int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1039 endianness >>= 8;
1040
1041 for (j = 0; j < 8; ++j)
1042 if (inode_bits & (((ino_t)1) << (i * 8 + j)))
1043 *bit++ = offs + j;
1044 }
1045
1046 for (j = 0; j < 8; ++j)
1047 if (score_bits & (1 << j))
1048 *bit++ = offsetof (eio_dirent, score) * 8 + j;
1049 }
1050
1051 /* now actually do the sorting (a variant of MSD radix sort) */
1052 {
1053 eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base;
1054 eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end;
1055 unsigned char *bit_stk [9 + sizeof (ino_t) * 8];
1056 int stk_idx = 0;
1057
1058 base_stk [stk_idx] = dents;
1059 end_stk [stk_idx] = dents + size;
1060 bit_stk [stk_idx] = bit - 1;
1061
1062 do
1063 {
1064 base = base_stk [stk_idx];
1065 end = end_stk [stk_idx];
1066 bit = bit_stk [stk_idx];
1067
1068 for (;;)
1069 {
1070 unsigned char O = *bit >> 3;
1071 unsigned char M = 1 << (*bit & 7);
1072
1073 eio_dirent *a = base;
1074 eio_dirent *b = end;
1075
1076 if (b - a < EIO_SORT_CUTOFF)
1077 break;
1078
1079 /* now bit-partition the array on the bit */
1080 /* this ugly asymmetric loop seems to perform much better than typical */
1081 /* partition algos found in the literature */
1082 do
1083 if (!(((unsigned char *)a)[O] & M))
1084 ++a;
1085 else if (!(((unsigned char *)--b)[O] & M))
1086 {
1087 eio_dirent tmp = *a; *a = *b; *b = tmp;
1088 ++a;
1089 }
1090 while (b > a);
1091
1092 /* next bit, or stop, if no bits left in this path */
1093 if (!*--bit)
1094 break;
1095
1096 base_stk [stk_idx] = a;
1097 end_stk [stk_idx] = end;
1098 bit_stk [stk_idx] = bit;
1099 ++stk_idx;
1100
1101 end = a;
1102 }
1103 }
1104 while (stk_idx--);
1105 }
1106}
1107
1108static void
1109eio_dent_insertion_sort (eio_dirent *dents, int size)
1110{
1111 /* first move the smallest element to the front, to act as a sentinel */
1112 {
1113 int i;
1114 eio_dirent *min = dents;
1115
1116 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1117 for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1118 if (EIO_DENT_CMP (dents [i], <, *min))
1119 min = &dents [i];
1120
1121 /* swap elements 0 and j (minimum) */
1122 {
1123 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1124 }
1125 }
1126
1127 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1128 {
1129 eio_dirent *i, *j;
1130
1131 for (i = dents + 1; i < dents + size; ++i)
1132 {
1133 eio_dirent value = *i;
1134
1135 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1136 j [1] = j [0];
1137
1138 j [1] = value;
1139 }
1140 }
1141}
1142
1143static void
1144eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1145{
1146 if (size <= 1)
1147 return; /* our insertion sort relies on size > 0 */
1148
1149 /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1150 /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1151 eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1152
1153 /* use an insertion sort at the end, or for small arrays, */
1154 /* as insertion sort is more efficient for small partitions */
1155 eio_dent_insertion_sort (dents, size);
994} 1156}
995 1157
996/* read a full directory */ 1158/* read a full directory */
997static void 1159static void
998eio__scandir (eio_req *req, etp_worker *self) 1160eio__scandir (eio_req *req, etp_worker *self)
999{ 1161{
1000 DIR *dirp; 1162 DIR *dirp;
1001 EIO_STRUCT_DIRENT *entp; 1163 EIO_STRUCT_DIRENT *entp;
1002 unsigned char *name, *names; 1164 char *name, *names;
1003 int namesalloc = 4096; 1165 int namesalloc = 4096;
1004 int namesoffs = 0; 1166 int namesoffs = 0;
1005 int flags = req->int1; 1167 int flags = req->int1;
1006 eio_dirent *dents = 0; 1168 eio_dirent *dents = 0;
1007 int dentalloc = 128; 1169 int dentalloc = 128;
1008 int dentoffs = 0; 1170 int dentoffs = 0;
1171 ino_t inode_bits = 0;
1009 1172
1010 req->result = -1; 1173 req->result = -1;
1011 1174
1012 if (!(flags & EIO_READDIR_DENTS)) 1175 if (!(flags & EIO_READDIR_DENTS))
1013 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); 1176 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
1014 1177
1015 X_LOCK (wrklock); 1178 X_LOCK (wrklock);
1016 /* the corresponding closedir is in ETP_WORKER_CLEAR */ 1179 /* the corresponding closedir is in ETP_WORKER_CLEAR */
1017 self->dirp = dirp = opendir (req->ptr1); 1180 self->dirp = dirp = opendir (req->ptr1);
1018 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; 1181 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1019 req->ptr1 = names = malloc (namesalloc);
1020 req->ptr2 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; 1182 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
1183 req->ptr2 = names = malloc (namesalloc);
1021 X_UNLOCK (wrklock); 1184 X_UNLOCK (wrklock);
1022 1185
1023 if (dirp && names && (!flags || dents)) 1186 if (dirp && names && (!flags || dents))
1024 for (;;) 1187 for (;;)
1025 { 1188 {
… …
1033 1196
1034 /* sort etc. */ 1197 /* sort etc. */
1035 req->int1 = flags; 1198 req->int1 = flags;
1036 req->result = dentoffs; 1199 req->result = dentoffs;
1037 1200
1038 if (dents)
1039 {
1040 eio_dirent *ent = dents + dentoffs;
1041
1042 while (ent > dents)
1043 (--ent)->name = names + (size_t)ent->name;
1044 }
1045
1046 if (flags & EIO_READDIR_STAT_ORDER 1201 if (flags & EIO_READDIR_STAT_ORDER)
1047 || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN))) 1202 eio_dent_sort (dents, dentoffs, 0, inode_bits); /* sort by inode exclusively */
1048 {
1049 /* pray your qsort doesn't use quicksort */
1050 qsort (dents, dentoffs, sizeof (*dents), eio_dent_cmp); /* score depends of DIRS_FIRST */
1051 }
1052 else if (flags & EIO_READDIR_DIRS_FIRST) 1203 else if (flags & EIO_READDIR_DIRS_FIRST)
1204 if (flags & EIO_READDIR_FOUND_UNKNOWN)
1205 eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1206 else
1053 { 1207 {
1054 /* in this case, all is known, and we just put dirs first and sort them */ 1208 /* in this case, all is known, and we just put dirs first and sort them */
1055 eio_dirent *ent = dents + dentoffs; 1209 eio_dirent *oth = dents + dentoffs;
1056 eio_dirent *dir = dents; 1210 eio_dirent *dir = dents;
1057 1211
1212 /* now partition dirs to the front, and non-dirs to the back */
1213 /* by walking from both sides and swapping if necessary */
1214 /* also clear score, so it doesn't influence sorting */
1058 while (ent > dir) 1215 while (oth > dir)
1059 { 1216 {
1060 if (dir->type == DT_DIR) 1217 if (dir->type == EIO_DT_DIR)
1061 ++dir; 1218 ++dir;
1062 else
1063 {
1064 --ent;
1065
1066 if (ent->type == DT_DIR) 1219 else if ((--oth)->type == EIO_DT_DIR)
1067 { 1220 {
1068 eio_dirent tmp = *dir; 1221 eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1069 *dir = *ent;
1070 *ent = tmp;
1071 1222
1072 ++dir; 1223 ++dir;
1073 } 1224 }
1074 } 1225 }
1075 }
1076 1226
1077 /* now sort the dirs only */ 1227 /* now sort the dirs only */
1078 qsort (dents, dir - dents, sizeof (*dents), eio_dent_cmp); 1228 eio_dent_sort (dents, dir - dents, 0, inode_bits);
1079 } 1229 }
1080
1081 /* only provide the names array unless DENTS is specified */
1082 if (!(flags & EIO_READDIR_DENTS))
1083 {
1084 X_LOCK (wrklock);
1085 assert (!dents);
1086 req->ptr1 = 0;
1087 req->ptr2 = names;
1088 X_UNLOCK (wrklock);
1089 }
1090 1230
1091 break; 1231 break;
1092 } 1232 }
1093 1233
1094 /* now add the entry to our list(s) */ 1234 /* now add the entry to our list(s) */
1095 name = entp->d_name; 1235 name = entp->d_name;
1096 1236
1097 /* skip . and .. entries */ 1237 /* skip . and .. entries */
1098 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) 1238 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
1099 { 1239 {
1100 int len = strlen (name) + 1; 1240 int len = D_NAMLEN (entp) + 1;
1101 1241
1102 while (expect_false (namesoffs + len > namesalloc)) 1242 while (expect_false (namesoffs + len > namesalloc))
1103 { 1243 {
1104 namesalloc *= 2; 1244 namesalloc *= 2;
1105 X_LOCK (wrklock); 1245 X_LOCK (wrklock);
1106 req->ptr1 = names = realloc (names, namesalloc); 1246 req->ptr2 = names = realloc (names, namesalloc);
1107 X_UNLOCK (wrklock); 1247 X_UNLOCK (wrklock);
1108 1248
1109 if (!names) 1249 if (!names)
1110 break; 1250 break;
1111 } 1251 }
… …
1118 1258
1119 if (expect_false (dentoffs == dentalloc)) 1259 if (expect_false (dentoffs == dentalloc))
1120 { 1260 {
1121 dentalloc *= 2; 1261 dentalloc *= 2;
1122 X_LOCK (wrklock); 1262 X_LOCK (wrklock);
1123 req->ptr2 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); 1263 req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1124 X_UNLOCK (wrklock); 1264 X_UNLOCK (wrklock);
1125 1265
1126 if (!dents) 1266 if (!dents)
1127 break; 1267 break;
1128 } 1268 }
1129 1269
1130 ent = dents + dentoffs; 1270 ent = dents + dentoffs;
1131 1271
1132 ent->name = (char *)(size_t)namesoffs; /* rather dirtily we store the offset in the pointer */ 1272 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1133 ent->namelen = len - 1; 1273 ent->namelen = len - 1;
1134 ent->inode = D_INO (entp); 1274 ent->inode = D_INO (entp);
1275
1276 inode_bits |= ent->inode;
1135 1277
1136 switch (D_TYPE (entp)) 1278 switch (D_TYPE (entp))
1137 { 1279 {
1138 default: 1280 default:
1139 ent->type = EIO_DT_UNKNOWN; 1281 ent->type = EIO_DT_UNKNOWN;
… …
1144 case DT_FIFO: ent->type = EIO_DT_FIFO; break; 1286 case DT_FIFO: ent->type = EIO_DT_FIFO; break;
1145 #endif 1287 #endif
1146 #ifdef DT_CHR 1288 #ifdef DT_CHR
1147 case DT_CHR: ent->type = EIO_DT_CHR; break; 1289 case DT_CHR: ent->type = EIO_DT_CHR; break;
1148 #endif 1290 #endif
1291 #ifdef DT_MPC
1292 case DT_MPC: ent->type = EIO_DT_MPC; break;
1293 #endif
1149 #ifdef DT_DIR 1294 #ifdef DT_DIR
1150 case DT_DIR: ent->type = EIO_DT_DIR; break; 1295 case DT_DIR: ent->type = EIO_DT_DIR; break;
1296 #endif
1297 #ifdef DT_NAM
1298 case DT_NAM: ent->type = EIO_DT_NAM; break;
1151 #endif 1299 #endif
1152 #ifdef DT_BLK 1300 #ifdef DT_BLK
1153 case DT_BLK: ent->type = EIO_DT_BLK; break; 1301 case DT_BLK: ent->type = EIO_DT_BLK; break;
1154 #endif 1302 #endif
1303 #ifdef DT_MPB
1304 case DT_MPB: ent->type = EIO_DT_MPB; break;
1305 #endif
1155 #ifdef DT_REG 1306 #ifdef DT_REG
1156 case DT_REG: ent->type = EIO_DT_REG; break; 1307 case DT_REG: ent->type = EIO_DT_REG; break;
1308 #endif
1309 #ifdef DT_NWK
1310 case DT_NWK: ent->type = EIO_DT_NWK; break;
1311 #endif
1312 #ifdef DT_CMP
1313 case DT_CMP: ent->type = EIO_DT_CMP; break;
1157 #endif 1314 #endif
1158 #ifdef DT_LNK 1315 #ifdef DT_LNK
1159 case DT_LNK: ent->type = EIO_DT_LNK; break; 1316 case DT_LNK: ent->type = EIO_DT_LNK; break;
1160 #endif 1317 #endif
1161 #ifdef DT_SOCK 1318 #ifdef DT_SOCK
1162 case DT_SOCK: ent->type = EIO_DT_SOCK; break; 1319 case DT_SOCK: ent->type = EIO_DT_SOCK; break;
1163 #endif 1320 #endif
1321 #ifdef DT_DOOR
1322 case DT_DOOR: ent->type = EIO_DT_DOOR; break;
1323 #endif
1164 #ifdef DT_WHT 1324 #ifdef DT_WHT
1165 case DT_WHT: ent->type = EIO_DT_WHT; break; 1325 case DT_WHT: ent->type = EIO_DT_WHT; break;
1166 #endif 1326 #endif
1167 } 1327 }
1168 1328
1169 ent->score = 0; 1329 ent->score = 7;
1170 1330
1171 if (flags & EIO_READDIR_DIRS_FIRST) 1331 if (flags & EIO_READDIR_DIRS_FIRST)
1172 { 1332 {
1173 if (ent->type == EIO_DT_UNKNOWN) 1333 if (ent->type == EIO_DT_UNKNOWN)
1174 { 1334 {
1175 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ 1335 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1176 ent->score = 98; 1336 ent->score = 1;
1177 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ 1337 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1178 ent->score = len <= 4 ? 5 : len <= 7 ? 4 : 1; /* shorter == more likely dir, but avoid too many classes */ 1338 ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1179 } 1339 }
1180 else if (ent->type == DT_DIR) 1340 else if (ent->type == EIO_DT_DIR)
1181 ent->score = 100; 1341 ent->score = 0;
1182 } 1342 }
1183 } 1343 }
1184 1344
1185 namesoffs += len; 1345 namesoffs += len;
1186 ++dentoffs; 1346 ++dentoffs;
1187 } 1347 }
1348
1349 if (EIO_CANCELLED (req))
1350 {
1351 errno = ECANCELED;
1352 break;
1353 }
1188 } 1354 }
1189 else
1190 req->result = -1;
1191} 1355}
1192 1356
1193#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) 1357#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1194# undef msync 1358# undef msync
1195# define msync(a,b,c) ((errno = ENOSYS), -1) 1359# define msync(a,b,c) ((errno = ENOSYS), -1)
… …
1716/* misc garbage */ 1880/* misc garbage */
1717 1881
1718ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) 1882ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
1719{ 1883{
1720 etp_worker wrk; 1884 etp_worker wrk;
1885 ssize_t ret;
1721 1886
1722 wrk.dbuf = 0; 1887 wrk.dbuf = 0;
1723 1888
1724 eio__sendfile (ofd, ifd, offset, count, &wrk); 1889 ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
1725 1890
1726 if (wrk.dbuf) 1891 if (wrk.dbuf)
1727 free (wrk.dbuf); 1892 free (wrk.dbuf);
1728}
1729 1893
1894 return ret;
1895}
1896

Diff Legend

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