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

Comparing libeio/eio.c (file contents):
Revision 1.39 by root, Sat Jun 13 03:59:04 2009 UTC vs.
Revision 1.46 by root, Sat Jan 2 12:58:37 2010 UTC

… …
80# include <utime.h> 80# include <utime.h>
81# include <signal.h> 81# include <signal.h>
82# include <dirent.h> 82# include <dirent.h>
83 83
84/* 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 */
85# if defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) 85# if __freebsd || defined __NetBSD__ || defined __OpenBSD__
86# define _DIRENT_HAVE_D_TYPE /* sigh */ 86# define _DIRENT_HAVE_D_TYPE /* sigh */
87# define D_INO(de) (de)->d_fileno 87# define D_INO(de) (de)->d_fileno
88# define D_NAMLEN(de) (de)->d_namlen 88# define D_NAMLEN(de) (de)->d_namlen
89# elif defined(__linux) || defined(d_ino) || _XOPEN_SOURCE >= 600 89# elif __linux || defined d_ino || _XOPEN_SOURCE >= 600
90# define D_INO(de) (de)->d_ino 90# define D_INO(de) (de)->d_ino
91# endif 91# endif
92 92
93#ifdef _D_EXACT_NAMLEN 93#ifdef _D_EXACT_NAMLEN
94# undef D_NAMLEN 94# undef D_NAMLEN
… …
106#endif 106#endif
107 107
108#if HAVE_SENDFILE 108#if HAVE_SENDFILE
109# if __linux 109# if __linux
110# include <sys/sendfile.h> 110# include <sys/sendfile.h>
111# elif __freebsd 111# elif __freebsd || defined __APPLE__
112# include <sys/socket.h> 112# include <sys/socket.h>
113# include <sys/uio.h> 113# include <sys/uio.h>
114# elif __hpux 114# elif __hpux
115# include <sys/socket.h> 115# include <sys/socket.h>
116# elif __solaris /* not yet */ 116# elif __solaris
117# include <sys/sendfile.h> 117# include <sys/sendfile.h>
118# else 118# else
119# error sendfile support requested but not available 119# error sendfile support requested but not available
120# endif 120# endif
121#endif 121#endif
… …
196 196
197/*****************************************************************************/ 197/*****************************************************************************/
198 198
199#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) 199#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
200 200
201/* calculcate time difference in ~1/EIO_TICKS of a second */ 201/* calculate time difference in ~1/EIO_TICKS of a second */
202static int tvdiff (struct timeval *tv1, struct timeval *tv2) 202static int tvdiff (struct timeval *tv1, struct timeval *tv2)
203{ 203{
204 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS 204 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
205 + ((tv2->tv_usec - tv1->tv_usec) >> 10); 205 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
206} 206}
… …
598} 598}
599 599
600static void etp_set_max_poll_time (double nseconds) 600static void etp_set_max_poll_time (double nseconds)
601{ 601{
602 if (WORDACCESS_UNSAFE) X_LOCK (reslock); 602 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
603 max_poll_time = nseconds; 603 max_poll_time = nseconds * EIO_TICKS;
604 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); 604 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
605} 605}
606 606
607static void etp_set_max_poll_reqs (unsigned int maxreqs) 607static void etp_set_max_poll_reqs (unsigned int maxreqs)
608{ 608{
… …
867 if (!res || errno != ENOSYS) 867 if (!res || errno != ENOSYS)
868 return res; 868 return res;
869#endif 869#endif
870 870
871 /* 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
872 * call fdatasync, as thta matches the expectation of it's users best */ 872 * call fdatasync, as that matches the expectation of its users best */
873 return fdatasync (fd); 873 return fdatasync (fd);
874} 874}
875 875
876#if !HAVE_READAHEAD 876#if !HAVE_READAHEAD
877# undef readahead 877# undef readahead
… …
923 if (res < 0 && sbytes) 923 if (res < 0 && sbytes)
924 /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ 924 /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */
925 res = sbytes; 925 res = sbytes;
926 } 926 }
927 927
928# elif defined (__APPLE__)
929
930 {
931 off_t sbytes = count;
932 res = sendfile (ifd, ofd, offset, &sbytes, 0, 0);
933
934 if (res < 0 && errno == EAGAIN && sbytes)
935 res = sbytes;
936 }
937
928# elif __hpux 938# elif __hpux
929 res = sendfile (ofd, ifd, offset, count, 0, 0); 939 res = sendfile (ofd, ifd, offset, count, 0, 0);
930 940
931# elif __solaris 941# elif __solaris
932 { 942 {
… …
943 if (res < 0 && sbytes) 953 if (res < 0 && sbytes)
944 res = sbytes; 954 res = sbytes;
945 } 955 }
946 956
947# endif 957# endif
958
959#elif defined (_WIN32)
960
961 /* does not work, just for documentation of what would need to be done */
962 {
963 HANDLE h = TO_SOCKET (ifd);
964 SetFilePointer (h, offset, 0, FILE_BEGIN);
965 res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0);
966 }
967
948#else 968#else
949 res = -1; 969 res = -1;
950 errno = ENOSYS; 970 errno = ENOSYS;
951#endif 971#endif
952 972
… …
993} 1013}
994 1014
995static signed char 1015static signed char
996eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) 1016eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
997{ 1017{
998 return b->score - a->score ? b->score - a->score /* works because our signed char is always 0..100 */ 1018 return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */
999 : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0; 1019 : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0;
1000} 1020}
1001 1021
1002#define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0 1022#define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0
1003 1023
1004#define EIO_QSORT_CUTOFF 30 /* quite high, but performs well on many filesystems */ 1024#define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1005#define EIO_QSORT_SKIP 60 /* when to skip qsort completely */ 1025#define EIO_SORT_FAST 60 /* when to only use insertion sort */
1006 1026
1007static void 1027static void
1008eio_dent_sort (eio_dirent *dents, int size) 1028eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1009{ 1029{
1030 unsigned char bits [9 + sizeof (ino_t) * 8];
1031 unsigned char *bit = bits;
1032
1033 assert (CHAR_BIT == 8);
1034 assert (sizeof (eio_dirent) * 8 < 256);
1035 assert (offsetof (eio_dirent, inode)); /* we use 0 as sentinel */
1036 assert (offsetof (eio_dirent, score)); /* we use 0 as sentinel */
1037
1038 if (size <= EIO_SORT_FAST)
1039 return;
1040
1041 /* first prepare an array of bits to test in our radix sort */
1042 /* try to take endianness into account, as well as differences in ino_t sizes */
1043 /* inode_bits must contain all inodes ORed together */
1044 /* which is used to skip bits that are 0 everywhere, which is very common */
1045 {
1046 ino_t endianness;
1010 int i, j; 1047 int i, j;
1011 1048
1049 /* we store the byte offset of byte n into byte n of "endianness" */
1050 for (i = 0; i < sizeof (ino_t); ++i)
1051 ((unsigned char *)&endianness)[i] = i;
1052
1053 *bit++ = 0;
1054
1055 for (i = 0; i < sizeof (ino_t); ++i)
1056 {
1057 /* shifting off the byte offsets out of "endianness" */
1058 int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8;
1059 endianness >>= 8;
1060
1061 for (j = 0; j < 8; ++j)
1062 if (inode_bits & (((ino_t)1) << (i * 8 + j)))
1063 *bit++ = offs + j;
1064 }
1065
1066 for (j = 0; j < 8; ++j)
1067 if (score_bits & (1 << j))
1068 *bit++ = offsetof (eio_dirent, score) * 8 + j;
1069 }
1070
1071 /* now actually do the sorting (a variant of MSD radix sort) */
1072 {
1073 eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base;
1074 eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end;
1075 unsigned char *bit_stk [9 + sizeof (ino_t) * 8];
1076 int stk_idx = 0;
1077
1078 base_stk [stk_idx] = dents;
1079 end_stk [stk_idx] = dents + size;
1080 bit_stk [stk_idx] = bit - 1;
1081
1082 do
1083 {
1084 base = base_stk [stk_idx];
1085 end = end_stk [stk_idx];
1086 bit = bit_stk [stk_idx];
1087
1088 for (;;)
1089 {
1090 unsigned char O = *bit >> 3;
1091 unsigned char M = 1 << (*bit & 7);
1092
1093 eio_dirent *a = base;
1094 eio_dirent *b = end;
1095
1096 if (b - a < EIO_SORT_CUTOFF)
1097 break;
1098
1099 /* now bit-partition the array on the bit */
1100 /* this ugly asymmetric loop seems to perform much better than typical */
1101 /* partition algos found in the literature */
1102 do
1103 if (!(((unsigned char *)a)[O] & M))
1104 ++a;
1105 else if (!(((unsigned char *)--b)[O] & M))
1106 {
1107 eio_dirent tmp = *a; *a = *b; *b = tmp;
1108 ++a;
1109 }
1110 while (b > a);
1111
1112 /* next bit, or stop, if no bits left in this path */
1113 if (!*--bit)
1114 break;
1115
1116 base_stk [stk_idx] = a;
1117 end_stk [stk_idx] = end;
1118 bit_stk [stk_idx] = bit;
1119 ++stk_idx;
1120
1121 end = a;
1122 }
1123 }
1124 while (stk_idx--);
1125 }
1126}
1127
1128static void
1129eio_dent_insertion_sort (eio_dirent *dents, int size)
1130{
1131 /* first move the smallest element to the front, to act as a sentinel */
1132 {
1133 int i;
1134 eio_dirent *min = dents;
1135
1136 /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */
1137 for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; )
1138 if (EIO_DENT_CMP (dents [i], <, *min))
1139 min = &dents [i];
1140
1141 /* swap elements 0 and j (minimum) */
1142 {
1143 eio_dirent tmp = *dents; *dents = *min; *min = tmp;
1144 }
1145 }
1146
1147 /* then do standard insertion sort, assuming that all elements are >= dents [0] */
1148 {
1149 eio_dirent *i, *j;
1150
1151 for (i = dents + 1; i < dents + size; ++i)
1152 {
1153 eio_dirent value = *i;
1154
1155 for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j)
1156 j [1] = j [0];
1157
1158 j [1] = value;
1159 }
1160 }
1161}
1162
1163static void
1164eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits)
1165{
1012 if (size <= 1) 1166 if (size <= 1)
1013 return; /* our insertion sort relies on size > 0 */ 1167 return; /* our insertion sort relies on size > 0 */
1014 1168
1015 if (size > EIO_QSORT_SKIP) /* skip quicksort for small directories */ 1169 /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */
1016 { 1170 /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */
1017 /* first, use quicksort */ 1171 eio_dent_radix_sort (dents, size, score_bits, inode_bits);
1018 /* should be good for 2**31 entries */
1019 struct rng { int l, r; } rng [32];
1020 1172
1021 i = 0;
1022 rng[0].l = 0;
1023 rng[0].r = size;
1024
1025 while (expect_true (i >= 0))
1026 {
1027 int L = rng [i].l;
1028 int R = rng [i].r - 1;
1029
1030 if (expect_false (L + EIO_QSORT_CUTOFF < R))
1031 {
1032 eio_dirent piv = dents [L];
1033
1034 while (L < R)
1035 {
1036 while (EIO_DENT_CMP (dents [R], >=, piv) && L < R)
1037 --R;
1038
1039 if (L < R)
1040 dents [L++] = dents [R];
1041
1042 while (EIO_DENT_CMP (dents [L], <=, piv) && L < R)
1043 ++L;
1044
1045 if (L < R)
1046 dents [R--] = dents [L];
1047 }
1048
1049 dents [L] = piv;
1050
1051 ++i;
1052 rng [i].l = L + 1;
1053 rng [i].r = rng [i - 1].r;
1054 rng [i - 1].r = L;
1055
1056 if (rng [i].r - rng [i].l > rng [i - 1].r - rng [i - 1].l)
1057 {
1058 struct rng t;
1059
1060 t = rng [i]; rng [i] = rng [i - 1]; rng [i - 1] = t;
1061 }
1062 }
1063 else
1064 --i;
1065 }
1066 }
1067
1068 /* use an insertion sort after qsort, or for small arrays */ 1173 /* use an insertion sort at the end, or for small arrays, */
1069 /* first move the smallest element to the front, to act as a sentinel */ 1174 /* as insertion sort is more efficient for small partitions */
1070 { 1175 eio_dent_insertion_sort (dents, size);
1071 int min = 0;
1072
1073 for (i = size > EIO_QSORT_SKIP ? EIO_QSORT_CUTOFF : size; --i; )
1074 if (EIO_DENT_CMP (dents [i], <, dents [min]))
1075 min = i;
1076
1077 /* swap elements 0 and j (minimum) */
1078 {
1079 eio_dirent tmp = dents [0]; dents [0] = dents [min]; dents [min] = tmp;
1080 }
1081 }
1082
1083 /* then do standard insertion sort */
1084 for (i = 1; i < size; ++i)
1085 {
1086 eio_dirent value = dents [i];
1087
1088 for (j = i - 1; EIO_DENT_CMP (dents [j], >, value); --j)
1089 dents [j + 1] = dents [j];
1090
1091 dents [j + 1] = value;
1092 }
1093} 1176}
1094 1177
1095/* read a full directory */ 1178/* read a full directory */
1096static void 1179static void
1097eio__scandir (eio_req *req, etp_worker *self) 1180eio__scandir (eio_req *req, etp_worker *self)
… …
1103 int namesoffs = 0; 1186 int namesoffs = 0;
1104 int flags = req->int1; 1187 int flags = req->int1;
1105 eio_dirent *dents = 0; 1188 eio_dirent *dents = 0;
1106 int dentalloc = 128; 1189 int dentalloc = 128;
1107 int dentoffs = 0; 1190 int dentoffs = 0;
1191 ino_t inode_bits = 0;
1108 1192
1109 req->result = -1; 1193 req->result = -1;
1110 1194
1111 if (!(flags & EIO_READDIR_DENTS)) 1195 if (!(flags & EIO_READDIR_DENTS))
1112 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); 1196 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
1113 1197
1114 X_LOCK (wrklock); 1198 X_LOCK (wrklock);
1115 /* the corresponding closedir is in ETP_WORKER_CLEAR */ 1199 /* the corresponding closedir is in ETP_WORKER_CLEAR */
1116 self->dirp = dirp = opendir (req->ptr1); 1200 self->dirp = dirp = opendir (req->ptr1);
1117 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; 1201 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1118 req->ptr1 = names = malloc (namesalloc);
1119 req->ptr2 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; 1202 req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
1203 req->ptr2 = names = malloc (namesalloc);
1120 X_UNLOCK (wrklock); 1204 X_UNLOCK (wrklock);
1121 1205
1122 if (dirp && names && (!flags || dents)) 1206 if (dirp && names && (!flags || dents))
1123 for (;;) 1207 for (;;)
1124 { 1208 {
… …
1132 1216
1133 /* sort etc. */ 1217 /* sort etc. */
1134 req->int1 = flags; 1218 req->int1 = flags;
1135 req->result = dentoffs; 1219 req->result = dentoffs;
1136 1220
1137 if (dents)
1138 {
1139 eio_dirent *ent = dents + dentoffs;
1140
1141 while (ent > dents)
1142 (--ent)->name = names + (size_t)ent->name;
1143 }
1144
1145 if (flags & EIO_READDIR_STAT_ORDER 1221 if (flags & EIO_READDIR_STAT_ORDER)
1146 || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN))) 1222 eio_dent_sort (dents, dentoffs, 0, inode_bits); /* sort by inode exclusively */
1147 eio_dent_sort (dents, dentoffs); /* score depends of DIRS_FIRST */
1148 else if (flags & EIO_READDIR_DIRS_FIRST) 1223 else if (flags & EIO_READDIR_DIRS_FIRST)
1224 if (flags & EIO_READDIR_FOUND_UNKNOWN)
1225 eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */
1226 else
1149 { 1227 {
1150 /* in this case, all is known, and we just put dirs first and sort them */ 1228 /* in this case, all is known, and we just put dirs first and sort them */
1151 eio_dirent *ent = dents + dentoffs; 1229 eio_dirent *oth = dents + dentoffs;
1152 eio_dirent *dir = dents; 1230 eio_dirent *dir = dents;
1153 1231
1154 /* now move dirs to the front, and non-dirs to the back */ 1232 /* now partition dirs to the front, and non-dirs to the back */
1155 /* by walking from both sides and swapping if necessary */ 1233 /* by walking from both sides and swapping if necessary */
1234 /* also clear score, so it doesn't influence sorting */
1156 while (ent > dir) 1235 while (oth > dir)
1157 { 1236 {
1158 if (dir->type == DT_DIR) 1237 if (dir->type == EIO_DT_DIR)
1159 ++dir; 1238 ++dir;
1160 else
1161 {
1162 --ent;
1163
1164 if (ent->type == DT_DIR) 1239 else if ((--oth)->type == EIO_DT_DIR)
1165 { 1240 {
1166 eio_dirent tmp = *dir; 1241 eio_dirent tmp = *dir; *dir = *oth; *oth = tmp;
1167 *dir = *ent;
1168 *ent = tmp;
1169 1242
1170 ++dir; 1243 ++dir;
1171 } 1244 }
1172 } 1245 }
1173 }
1174 1246
1175 /* now sort the dirs only */ 1247 /* now sort the dirs only */
1176 eio_dent_sort (dents, dir - dents); 1248 eio_dent_sort (dents, dir - dents, 0, inode_bits);
1177 } 1249 }
1178
1179 /* only provide the names array unless DENTS is specified */
1180 if (!(flags & EIO_READDIR_DENTS))
1181 {
1182 X_LOCK (wrklock);
1183 assert (!dents);
1184 req->ptr1 = 0;
1185 req->ptr2 = names;
1186 X_UNLOCK (wrklock);
1187 }
1188 1250
1189 break; 1251 break;
1190 } 1252 }
1191 1253
1192 /* now add the entry to our list(s) */ 1254 /* now add the entry to our list(s) */
… …
1199 1261
1200 while (expect_false (namesoffs + len > namesalloc)) 1262 while (expect_false (namesoffs + len > namesalloc))
1201 { 1263 {
1202 namesalloc *= 2; 1264 namesalloc *= 2;
1203 X_LOCK (wrklock); 1265 X_LOCK (wrklock);
1204 req->ptr1 = names = realloc (names, namesalloc); 1266 req->ptr2 = names = realloc (names, namesalloc);
1205 X_UNLOCK (wrklock); 1267 X_UNLOCK (wrklock);
1206 1268
1207 if (!names) 1269 if (!names)
1208 break; 1270 break;
1209 } 1271 }
… …
1216 1278
1217 if (expect_false (dentoffs == dentalloc)) 1279 if (expect_false (dentoffs == dentalloc))
1218 { 1280 {
1219 dentalloc *= 2; 1281 dentalloc *= 2;
1220 X_LOCK (wrklock); 1282 X_LOCK (wrklock);
1221 req->ptr2 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); 1283 req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent));
1222 X_UNLOCK (wrklock); 1284 X_UNLOCK (wrklock);
1223 1285
1224 if (!dents) 1286 if (!dents)
1225 break; 1287 break;
1226 } 1288 }
1227 1289
1228 ent = dents + dentoffs; 1290 ent = dents + dentoffs;
1229 1291
1230 ent->name = (char *)(size_t)namesoffs; /* rather dirtily we store the offset in the pointer */ 1292 ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */
1231 ent->namelen = len - 1; 1293 ent->namelen = len - 1;
1232 ent->inode = D_INO (entp); 1294 ent->inode = D_INO (entp);
1295
1296 inode_bits |= ent->inode;
1233 1297
1234 switch (D_TYPE (entp)) 1298 switch (D_TYPE (entp))
1235 { 1299 {
1236 default: 1300 default:
1237 ent->type = EIO_DT_UNKNOWN; 1301 ent->type = EIO_DT_UNKNOWN;
… …
1280 #ifdef DT_WHT 1344 #ifdef DT_WHT
1281 case DT_WHT: ent->type = EIO_DT_WHT; break; 1345 case DT_WHT: ent->type = EIO_DT_WHT; break;
1282 #endif 1346 #endif
1283 } 1347 }
1284 1348
1285 ent->score = 0; 1349 ent->score = 7;
1286 1350
1287 if (flags & EIO_READDIR_DIRS_FIRST) 1351 if (flags & EIO_READDIR_DIRS_FIRST)
1288 { 1352 {
1289 if (ent->type == EIO_DT_UNKNOWN) 1353 if (ent->type == EIO_DT_UNKNOWN)
1290 { 1354 {
1291 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ 1355 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1292 ent->score = 98; 1356 ent->score = 1;
1293 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ 1357 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1294 ent->score = len <= 2 ? len + 6 : len <= 4 ? 5 : len <= 7 ? 4 : 1; /* shorter == more likely dir, but avoid too many classes */ 1358 ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */
1295 } 1359 }
1296 else if (ent->type == EIO_DT_DIR) 1360 else if (ent->type == EIO_DT_DIR)
1297 ent->score = 100; 1361 ent->score = 0;
1298 } 1362 }
1299 } 1363 }
1300 1364
1301 namesoffs += len; 1365 namesoffs += len;
1302 ++dentoffs; 1366 ++dentoffs;
… …
1327 1391
1328 if (!page) 1392 if (!page)
1329 page = sysconf (_SC_PAGESIZE); 1393 page = sysconf (_SC_PAGESIZE);
1330#endif 1394#endif
1331 1395
1396 /* round down to start of page, although this is probably useless */
1332 addr &= ~(page - 1); /* assume page size is always a power of two */ 1397 addr &= ~(page - 1); /* assume page size is always a power of two */
1333 1398
1334 if (addr < end) 1399 if (addr < end)
1335 if (flags) /* modify */ 1400 if (flags) /* modify */
1336 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len); 1401 do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len);

Diff Legend

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