… | |
… | |
993 | } |
993 | } |
994 | |
994 | |
995 | static signed char |
995 | static signed char |
996 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
996 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
997 | { |
997 | { |
998 | return b->score - a->score ? b->score - a->score /* works because our signed char is always 0..100 */ |
998 | 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; |
999 | : a->inode < b->inode ? -1 : a->inode > b->inode ? 1 : 0; |
1000 | } |
1000 | } |
1001 | |
1001 | |
|
|
1002 | #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0 |
|
|
1003 | |
1002 | #define EIO_QSORT_CUTOFF 20 /* quite high, but performs well on many filesystems */ |
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 */ |
1003 | |
1006 | |
1004 | static void |
1007 | static void |
1005 | eio_dent_sort (eio_dirent *dents, int size) |
1008 | eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
1006 | { |
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; |
1007 | int i, j; |
1027 | int i, j; |
1008 | |
1028 | |
1009 | if (size > EIO_QSORT_CUTOFF * 3) /* skip quicksort for small directories */ |
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 | |
|
|
1108 | static void |
|
|
1109 | eio_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) */ |
1010 | { |
1122 | { |
1011 | /* first, use quicksort */ |
1123 | eio_dirent tmp = *dents; *dents = *min; *min = tmp; |
1012 | /* should be good for 2**31 entries */ |
1124 | } |
1013 | struct rng { int l, r; } rng [32]; |
1125 | } |
1014 | |
1126 | |
1015 | i = 0; |
1127 | /* then do standard insertion sort, assuming that all elements are >= dents [0] */ |
1016 | rng[0].l = 0; |
1128 | { |
1017 | rng[0].r = size; |
1129 | eio_dirent *i, *j; |
1018 | |
1130 | |
1019 | while (expect_true (i >= 0)) |
1131 | for (i = dents + 1; i < dents + size; ++i) |
1020 | { |
1132 | { |
1021 | int L = rng [i].l; |
1133 | eio_dirent value = *i; |
1022 | int R = rng [i].r - 1; |
|
|
1023 | |
1134 | |
1024 | if (expect_false (L + EIO_QSORT_CUTOFF < R)) |
1135 | for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j) |
1025 | { |
1136 | j [1] = j [0]; |
1026 | eio_dirent piv = dents [L]; |
|
|
1027 | |
1137 | |
1028 | while (L < R) |
1138 | j [1] = value; |
1029 | { |
|
|
1030 | while (eio_dent_cmp (&dents [R], &piv) >= 0 && L < R) |
|
|
1031 | --R; |
|
|
1032 | |
|
|
1033 | if (L < R) |
|
|
1034 | dents [L++] = dents [R]; |
|
|
1035 | |
|
|
1036 | while (eio_dent_cmp (&dents [L], &piv) <= 0 && L < R) |
|
|
1037 | ++L; |
|
|
1038 | |
|
|
1039 | if (L < R) |
|
|
1040 | dents [R--] = dents [L]; |
|
|
1041 | } |
|
|
1042 | |
|
|
1043 | dents [L] = piv; |
|
|
1044 | |
|
|
1045 | ++i; |
|
|
1046 | rng [i].l = L + 1; |
|
|
1047 | rng [i].r = rng [i - 1].r; |
|
|
1048 | rng [i - 1].r = L; |
|
|
1049 | |
|
|
1050 | if (rng [i].r - rng [i].l > rng [i - 1].r - rng [i - 1].l) |
|
|
1051 | { |
|
|
1052 | struct rng t; |
|
|
1053 | |
|
|
1054 | t = rng [i]; rng [i] = rng [i - 1]; rng [i - 1] = t; |
|
|
1055 | } |
|
|
1056 | } |
|
|
1057 | else |
|
|
1058 | --i; |
|
|
1059 | } |
1139 | } |
1060 | } |
1140 | } |
|
|
1141 | } |
1061 | |
1142 | |
1062 | /* use a simple insertion sort at the end */ |
1143 | static void |
1063 | for (i = 1; i < size; ++i) |
1144 | eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
1064 | { |
1145 | { |
1065 | eio_dirent value = dents [i]; |
1146 | if (size <= 1) |
|
|
1147 | return; /* our insertion sort relies on size > 0 */ |
1066 | |
1148 | |
1067 | for (j = i - 1; j >= 0 && eio_dent_cmp (&dents [j], &value) > 0; --j) |
1149 | /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */ |
1068 | dents [j + 1] = dents [j]; |
1150 | /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */ |
|
|
1151 | eio_dent_radix_sort (dents, size, score_bits, inode_bits); |
1069 | |
1152 | |
1070 | dents [j + 1] = value; |
1153 | /* use an insertion sort at the end, or for small arrays, */ |
1071 | } |
1154 | /* as insertion sort is more efficient for small partitions */ |
|
|
1155 | eio_dent_insertion_sort (dents, size); |
1072 | } |
1156 | } |
1073 | |
1157 | |
1074 | /* read a full directory */ |
1158 | /* read a full directory */ |
1075 | static void |
1159 | static void |
1076 | eio__scandir (eio_req *req, etp_worker *self) |
1160 | eio__scandir (eio_req *req, etp_worker *self) |
… | |
… | |
1082 | int namesoffs = 0; |
1166 | int namesoffs = 0; |
1083 | int flags = req->int1; |
1167 | int flags = req->int1; |
1084 | eio_dirent *dents = 0; |
1168 | eio_dirent *dents = 0; |
1085 | int dentalloc = 128; |
1169 | int dentalloc = 128; |
1086 | int dentoffs = 0; |
1170 | int dentoffs = 0; |
|
|
1171 | ino_t inode_bits = 0; |
1087 | |
1172 | |
1088 | req->result = -1; |
1173 | req->result = -1; |
1089 | |
1174 | |
1090 | if (!(flags & EIO_READDIR_DENTS)) |
1175 | if (!(flags & EIO_READDIR_DENTS)) |
1091 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
1176 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
1092 | |
1177 | |
1093 | X_LOCK (wrklock); |
1178 | X_LOCK (wrklock); |
1094 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
1179 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
1095 | self->dirp = dirp = opendir (req->ptr1); |
1180 | self->dirp = dirp = opendir (req->ptr1); |
1096 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1181 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
1097 | req->ptr1 = names = malloc (namesalloc); |
|
|
1098 | 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); |
1099 | X_UNLOCK (wrklock); |
1184 | X_UNLOCK (wrklock); |
1100 | |
1185 | |
1101 | if (dirp && names && (!flags || dents)) |
1186 | if (dirp && names && (!flags || dents)) |
1102 | for (;;) |
1187 | for (;;) |
1103 | { |
1188 | { |
… | |
… | |
1111 | |
1196 | |
1112 | /* sort etc. */ |
1197 | /* sort etc. */ |
1113 | req->int1 = flags; |
1198 | req->int1 = flags; |
1114 | req->result = dentoffs; |
1199 | req->result = dentoffs; |
1115 | |
1200 | |
1116 | if (dents) |
|
|
1117 | { |
|
|
1118 | eio_dirent *ent = dents + dentoffs; |
|
|
1119 | |
|
|
1120 | while (ent > dents) |
|
|
1121 | (--ent)->name = names + (size_t)ent->name; |
|
|
1122 | } |
|
|
1123 | |
|
|
1124 | if (flags & EIO_READDIR_STAT_ORDER |
1201 | if (flags & EIO_READDIR_STAT_ORDER) |
1125 | || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN))) |
1202 | eio_dent_sort (dents, dentoffs, 0, inode_bits); /* sort by inode exclusively */ |
1126 | eio_dent_sort (dents, dentoffs); /* score depends of DIRS_FIRST */ |
|
|
1127 | 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 |
1128 | { |
1207 | { |
1129 | /* 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 */ |
1130 | eio_dirent *ent = dents + dentoffs; |
1209 | eio_dirent *oth = dents + dentoffs; |
1131 | eio_dirent *dir = dents; |
1210 | eio_dirent *dir = dents; |
1132 | |
1211 | |
1133 | /* now move dirs to the front, and non-dirs to the back */ |
1212 | /* now partition dirs to the front, and non-dirs to the back */ |
1134 | /* by walking from both sides and swapping if necessary */ |
1213 | /* by walking from both sides and swapping if necessary */ |
|
|
1214 | /* also clear score, so it doesn't influence sorting */ |
1135 | while (ent > dir) |
1215 | while (oth > dir) |
1136 | { |
1216 | { |
1137 | if (dir->type == DT_DIR) |
1217 | if (dir->type == EIO_DT_DIR) |
1138 | ++dir; |
1218 | ++dir; |
1139 | else |
|
|
1140 | { |
|
|
1141 | --ent; |
|
|
1142 | |
|
|
1143 | if (ent->type == DT_DIR) |
1219 | else if ((--oth)->type == EIO_DT_DIR) |
1144 | { |
1220 | { |
1145 | eio_dirent tmp = *dir; |
1221 | eio_dirent tmp = *dir; *dir = *oth; *oth = tmp; |
1146 | *dir = *ent; |
|
|
1147 | *ent = tmp; |
|
|
1148 | |
1222 | |
1149 | ++dir; |
1223 | ++dir; |
1150 | } |
1224 | } |
1151 | } |
1225 | } |
1152 | } |
|
|
1153 | |
1226 | |
1154 | /* now sort the dirs only */ |
1227 | /* now sort the dirs only */ |
1155 | eio_dent_sort (dents, dir - dents); |
1228 | eio_dent_sort (dents, dir - dents, 0, inode_bits); |
1156 | } |
1229 | } |
1157 | |
|
|
1158 | /* only provide the names array unless DENTS is specified */ |
|
|
1159 | if (!(flags & EIO_READDIR_DENTS)) |
|
|
1160 | { |
|
|
1161 | X_LOCK (wrklock); |
|
|
1162 | assert (!dents); |
|
|
1163 | req->ptr1 = 0; |
|
|
1164 | req->ptr2 = names; |
|
|
1165 | X_UNLOCK (wrklock); |
|
|
1166 | } |
|
|
1167 | |
1230 | |
1168 | break; |
1231 | break; |
1169 | } |
1232 | } |
1170 | |
1233 | |
1171 | /* now add the entry to our list(s) */ |
1234 | /* now add the entry to our list(s) */ |
… | |
… | |
1178 | |
1241 | |
1179 | while (expect_false (namesoffs + len > namesalloc)) |
1242 | while (expect_false (namesoffs + len > namesalloc)) |
1180 | { |
1243 | { |
1181 | namesalloc *= 2; |
1244 | namesalloc *= 2; |
1182 | X_LOCK (wrklock); |
1245 | X_LOCK (wrklock); |
1183 | req->ptr1 = names = realloc (names, namesalloc); |
1246 | req->ptr2 = names = realloc (names, namesalloc); |
1184 | X_UNLOCK (wrklock); |
1247 | X_UNLOCK (wrklock); |
1185 | |
1248 | |
1186 | if (!names) |
1249 | if (!names) |
1187 | break; |
1250 | break; |
1188 | } |
1251 | } |
… | |
… | |
1195 | |
1258 | |
1196 | if (expect_false (dentoffs == dentalloc)) |
1259 | if (expect_false (dentoffs == dentalloc)) |
1197 | { |
1260 | { |
1198 | dentalloc *= 2; |
1261 | dentalloc *= 2; |
1199 | X_LOCK (wrklock); |
1262 | X_LOCK (wrklock); |
1200 | req->ptr2 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
1263 | req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
1201 | X_UNLOCK (wrklock); |
1264 | X_UNLOCK (wrklock); |
1202 | |
1265 | |
1203 | if (!dents) |
1266 | if (!dents) |
1204 | break; |
1267 | break; |
1205 | } |
1268 | } |
1206 | |
1269 | |
1207 | ent = dents + dentoffs; |
1270 | ent = dents + dentoffs; |
1208 | |
1271 | |
1209 | 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 */ |
1210 | ent->namelen = len - 1; |
1273 | ent->namelen = len - 1; |
1211 | ent->inode = D_INO (entp); |
1274 | ent->inode = D_INO (entp); |
|
|
1275 | |
|
|
1276 | inode_bits |= ent->inode; |
1212 | |
1277 | |
1213 | switch (D_TYPE (entp)) |
1278 | switch (D_TYPE (entp)) |
1214 | { |
1279 | { |
1215 | default: |
1280 | default: |
1216 | ent->type = EIO_DT_UNKNOWN; |
1281 | ent->type = EIO_DT_UNKNOWN; |
… | |
… | |
1259 | #ifdef DT_WHT |
1324 | #ifdef DT_WHT |
1260 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
1325 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
1261 | #endif |
1326 | #endif |
1262 | } |
1327 | } |
1263 | |
1328 | |
1264 | ent->score = 0; |
1329 | ent->score = 7; |
1265 | |
1330 | |
1266 | if (flags & EIO_READDIR_DIRS_FIRST) |
1331 | if (flags & EIO_READDIR_DIRS_FIRST) |
1267 | { |
1332 | { |
1268 | if (ent->type == EIO_DT_UNKNOWN) |
1333 | if (ent->type == EIO_DT_UNKNOWN) |
1269 | { |
1334 | { |
1270 | 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 */ |
1271 | ent->score = 98; |
1336 | ent->score = 1; |
1272 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
1337 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
1273 | ent->score = len <= 2 ? len + 6 : 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 */ |
1274 | } |
1339 | } |
1275 | else if (ent->type == EIO_DT_DIR) |
1340 | else if (ent->type == EIO_DT_DIR) |
1276 | ent->score = 100; |
1341 | ent->score = 0; |
1277 | } |
1342 | } |
1278 | } |
1343 | } |
1279 | |
1344 | |
1280 | namesoffs += len; |
1345 | namesoffs += len; |
1281 | ++dentoffs; |
1346 | ++dentoffs; |