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

Comparing libeio/eio.c (file contents):
Revision 1.31 by root, Sat Jun 6 17:25:13 2009 UTC vs.
Revision 1.39 by root, Sat Jun 13 03:59:04 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
178 if (wrk->dirp) \ 187 if (wrk->dirp) \
179 { \ 188 { \
180 closedir (wrk->dirp); \ 189 closedir (wrk->dirp); \
181 wrk->dirp = 0; \ 190 wrk->dirp = 0; \
182 } 191 }
192
183#define ETP_WORKER_COMMON \ 193#define ETP_WORKER_COMMON \
184 void *dbuf; \ 194 void *dbuf; \
185 DIR *dirp; 195 DIR *dirp;
186 196
187/*****************************************************************************/ 197/*****************************************************************************/
980 } 990 }
981 991
982 return res; 992 return res;
983} 993}
984 994
985static int 995static signed char
986eio_dent_cmp (const void *a_, const void *b_) 996eio_dent_cmp (const eio_dirent *a, const eio_dirent *b)
987{ 997{
988 const eio_dirent *a = (const eio_dirent *)a_; 998 return b->score - a->score ? b->score - a->score /* works because our signed char is always 0..100 */
989 const eio_dirent *b = (const eio_dirent *)b_;
990
991 return (int)b->score - (int)a->score ? (int)b->score - (int)a->score
992 : 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_QSORT_CUTOFF 30 /* quite high, but performs well on many filesystems */
1005#define EIO_QSORT_SKIP 60 /* when to skip qsort completely */
1006
1007static void
1008eio_dent_sort (eio_dirent *dents, int size)
1009{
1010 int i, j;
1011
1012 if (size <= 1)
1013 return; /* our insertion sort relies on size > 0 */
1014
1015 if (size > EIO_QSORT_SKIP) /* skip quicksort for small directories */
1016 {
1017 /* first, use quicksort */
1018 /* should be good for 2**31 entries */
1019 struct rng { int l, r; } rng [32];
1020
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 */
1069 /* first move the smallest element to the front, to act as a sentinel */
1070 {
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 }
993} 1093}
994 1094
995/* read a full directory */ 1095/* read a full directory */
996static void 1096static void
997eio__scandir (eio_req *req, etp_worker *self) 1097eio__scandir (eio_req *req, etp_worker *self)
998{ 1098{
999 DIR *dirp; 1099 DIR *dirp;
1000 EIO_STRUCT_DIRENT *entp; 1100 EIO_STRUCT_DIRENT *entp;
1001 unsigned char *name, *names; 1101 char *name, *names;
1002 int namesalloc = 4096; 1102 int namesalloc = 4096;
1003 int namesoffs = 0; 1103 int namesoffs = 0;
1004 int flags = req->int1; 1104 int flags = req->int1;
1005 eio_dirent *dents = 0; 1105 eio_dirent *dents = 0;
1006 int dentalloc = 128; 1106 int dentalloc = 128;
1010 1110
1011 if (!(flags & EIO_READDIR_DENTS)) 1111 if (!(flags & EIO_READDIR_DENTS))
1012 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); 1112 flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER);
1013 1113
1014 X_LOCK (wrklock); 1114 X_LOCK (wrklock);
1015
1016 /* the corresponding closedir is in ETP_WORKER_CLEAR */ 1115 /* the corresponding closedir is in ETP_WORKER_CLEAR */
1017 self->dirp = dirp = opendir (req->ptr1); 1116 self->dirp = dirp = opendir (req->ptr1);
1018 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; 1117 req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE;
1019 req->ptr1 = names = malloc (namesalloc); 1118 req->ptr1 = names = malloc (namesalloc);
1020 req->ptr2 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; 1119 req->ptr2 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0;
1021
1022 X_UNLOCK (wrklock); 1120 X_UNLOCK (wrklock);
1023 1121
1024 if (dirp && names && (!flags || dents)) 1122 if (dirp && names && (!flags || dents))
1025 for (;;) 1123 for (;;)
1026 { 1124 {
1034 1132
1035 /* sort etc. */ 1133 /* sort etc. */
1036 req->int1 = flags; 1134 req->int1 = flags;
1037 req->result = dentoffs; 1135 req->result = dentoffs;
1038 1136
1039 if (flags & EIO_READDIR_STAT_ORDER || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN)) 1137 if (dents)
1040 { 1138 {
1041 /* pray your qsort doesn't use quicksort */ 1139 eio_dirent *ent = dents + dentoffs;
1042 qsort (dents, dentoffs, sizeof (*dents), eio_dent_cmp); /* score depends of DIRS_FIRST */ 1140
1141 while (ent > dents)
1142 (--ent)->name = names + (size_t)ent->name;
1043 } 1143 }
1144
1145 if (flags & EIO_READDIR_STAT_ORDER
1044 else if (flags & EIO_READDIR_DIRS_FIRST && !(flags & EIO_READDIR_FOUND_UNKNOWN)) 1146 || !(~flags & (EIO_READDIR_DIRS_FIRST | EIO_READDIR_FOUND_UNKNOWN)))
1147 eio_dent_sort (dents, dentoffs); /* score depends of DIRS_FIRST */
1148 else if (flags & EIO_READDIR_DIRS_FIRST)
1045 { 1149 {
1046 /* in this case, all is known, and we just put dirs first and sort them */ 1150 /* in this case, all is known, and we just put dirs first and sort them */
1047 eio_dirent *ent = dents + dentoffs; 1151 eio_dirent *ent = dents + dentoffs;
1048 eio_dirent *dir = dents; 1152 eio_dirent *dir = dents;
1049 1153
1154 /* now move dirs to the front, and non-dirs to the back */
1155 /* by walking from both sides and swapping if necessary */
1050 while (ent > dir) 1156 while (ent > dir)
1051 { 1157 {
1052 if (dir->type == DT_DIR) 1158 if (dir->type == DT_DIR)
1053 ++dir; 1159 ++dir;
1054 else 1160 else
1065 } 1171 }
1066 } 1172 }
1067 } 1173 }
1068 1174
1069 /* now sort the dirs only */ 1175 /* now sort the dirs only */
1070 qsort (dents, dir - dents, sizeof (*dents), eio_dent_cmp); 1176 eio_dent_sort (dents, dir - dents);
1071 } 1177 }
1072 1178
1073 {int i; for(i=0;i<dentoffs;++i){eio_dirent *e=dents+i; printf ("%9ld %3d %s\n", e->inode,e->score,e->name);}}//D 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 }
1074 1188
1075 break; 1189 break;
1076 } 1190 }
1077 1191
1192 /* now add the entry to our list(s) */
1078 name = entp->d_name; 1193 name = entp->d_name;
1079 1194
1195 /* skip . and .. entries */
1080 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) 1196 if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2])))
1081 { 1197 {
1082 int len = strlen (name) + 1; 1198 int len = D_NAMLEN (entp) + 1;
1083 1199
1084 while (expect_false (namesoffs + len > namesalloc)) 1200 while (expect_false (namesoffs + len > namesalloc))
1085 { 1201 {
1086 namesalloc *= 2; 1202 namesalloc *= 2;
1087 X_LOCK (wrklock); 1203 X_LOCK (wrklock);
1109 break; 1225 break;
1110 } 1226 }
1111 1227
1112 ent = dents + dentoffs; 1228 ent = dents + dentoffs;
1113 1229
1114 ent->name = names + namesoffs; 1230 ent->name = (char *)(size_t)namesoffs; /* rather dirtily we store the offset in the pointer */
1115 ent->namelen = len - 1; 1231 ent->namelen = len - 1;
1116 ent->inode = D_INO (entp); 1232 ent->inode = D_INO (entp);
1117 1233
1118 switch (D_TYPE (entp)) 1234 switch (D_TYPE (entp))
1119 { 1235 {
1126 case DT_FIFO: ent->type = EIO_DT_FIFO; break; 1242 case DT_FIFO: ent->type = EIO_DT_FIFO; break;
1127 #endif 1243 #endif
1128 #ifdef DT_CHR 1244 #ifdef DT_CHR
1129 case DT_CHR: ent->type = EIO_DT_CHR; break; 1245 case DT_CHR: ent->type = EIO_DT_CHR; break;
1130 #endif 1246 #endif
1247 #ifdef DT_MPC
1248 case DT_MPC: ent->type = EIO_DT_MPC; break;
1249 #endif
1131 #ifdef DT_DIR 1250 #ifdef DT_DIR
1132 case DT_DIR: ent->type = EIO_DT_DIR; break; 1251 case DT_DIR: ent->type = EIO_DT_DIR; break;
1133 #endif 1252 #endif
1253 #ifdef DT_NAM
1254 case DT_NAM: ent->type = EIO_DT_NAM; break;
1255 #endif
1134 #ifdef DT_BLK 1256 #ifdef DT_BLK
1135 case DT_BLK: ent->type = EIO_DT_BLK; break; 1257 case DT_BLK: ent->type = EIO_DT_BLK; break;
1136 #endif 1258 #endif
1259 #ifdef DT_MPB
1260 case DT_MPB: ent->type = EIO_DT_MPB; break;
1261 #endif
1137 #ifdef DT_REG 1262 #ifdef DT_REG
1138 case DT_REG: ent->type = EIO_DT_REG; break; 1263 case DT_REG: ent->type = EIO_DT_REG; break;
1139 #endif 1264 #endif
1265 #ifdef DT_NWK
1266 case DT_NWK: ent->type = EIO_DT_NWK; break;
1267 #endif
1268 #ifdef DT_CMP
1269 case DT_CMP: ent->type = EIO_DT_CMP; break;
1270 #endif
1140 #ifdef DT_LNK 1271 #ifdef DT_LNK
1141 case DT_LNK: ent->type = EIO_DT_LNK; break; 1272 case DT_LNK: ent->type = EIO_DT_LNK; break;
1142 #endif 1273 #endif
1143 #ifdef DT_SOCK 1274 #ifdef DT_SOCK
1144 case DT_SOCK: ent->type = EIO_DT_SOCK; break; 1275 case DT_SOCK: ent->type = EIO_DT_SOCK; break;
1276 #endif
1277 #ifdef DT_DOOR
1278 case DT_DOOR: ent->type = EIO_DT_DOOR; break;
1145 #endif 1279 #endif
1146 #ifdef DT_WHT 1280 #ifdef DT_WHT
1147 case DT_WHT: ent->type = EIO_DT_WHT; break; 1281 case DT_WHT: ent->type = EIO_DT_WHT; break;
1148 #endif 1282 #endif
1149 } 1283 }
1155 if (ent->type == EIO_DT_UNKNOWN) 1289 if (ent->type == EIO_DT_UNKNOWN)
1156 { 1290 {
1157 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ 1291 if (*name == '.') /* leading dots are likely directories, and, in any case, rare */
1158 ent->score = 98; 1292 ent->score = 98;
1159 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ 1293 else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */
1160 ent->score = len <= 4 ? 5 : len <= 7 ? 4 : 1; /* shorter == more likely dir, but avoid too many classes */ 1294 ent->score = len <= 2 ? len + 6 : len <= 4 ? 5 : len <= 7 ? 4 : 1; /* shorter == more likely dir, but avoid too many classes */
1161 } 1295 }
1162 else if (ent->type == DT_DIR) 1296 else if (ent->type == EIO_DT_DIR)
1163 ent->score = 100; 1297 ent->score = 100;
1164 } 1298 }
1165 } 1299 }
1166 1300
1167 namesoffs += len; 1301 namesoffs += len;
1168 ++dentoffs; 1302 ++dentoffs;
1169 } 1303 }
1304
1305 if (EIO_CANCELLED (req))
1306 {
1307 errno = ECANCELED;
1308 break;
1309 }
1170 } 1310 }
1171 else
1172 req->result = -1;
1173
1174 /* if user doesn't want the dents, do not provide it */
1175 if (!(flags & EIO_READDIR_DENTS))
1176 {
1177 X_LOCK (wrklock);
1178 free (dents);
1179 req->ptr2 = req->ptr1;
1180 req->ptr1 = 0;
1181 X_UNLOCK (wrklock);
1182 }
1183} 1311}
1184 1312
1185#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) 1313#if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO)
1186# undef msync 1314# undef msync
1187# define msync(a,b,c) ((errno = ENOSYS), -1) 1315# define msync(a,b,c) ((errno = ENOSYS), -1)
1708/* misc garbage */ 1836/* misc garbage */
1709 1837
1710ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) 1838ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
1711{ 1839{
1712 etp_worker wrk; 1840 etp_worker wrk;
1841 ssize_t ret;
1713 1842
1714 wrk.dbuf = 0; 1843 wrk.dbuf = 0;
1715 1844
1716 eio__sendfile (ofd, ifd, offset, count, &wrk); 1845 ret = eio__sendfile (ofd, ifd, offset, count, &wrk);
1717 1846
1718 if (wrk.dbuf) 1847 if (wrk.dbuf)
1719 free (wrk.dbuf); 1848 free (wrk.dbuf);
1720}
1721 1849
1850 return ret;
1851}
1852

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines