|
|
1 | /* |
|
|
2 | * libeio implementation |
|
|
3 | * |
|
|
4 | * Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libeio@schmorp.de> |
|
|
5 | * All rights reserved. |
|
|
6 | * |
|
|
7 | * Redistribution and use in source and binary forms, with or without modifica- |
|
|
8 | * tion, are permitted provided that the following conditions are met: |
|
|
9 | * |
|
|
10 | * 1. Redistributions of source code must retain the above copyright notice, |
|
|
11 | * this list of conditions and the following disclaimer. |
|
|
12 | * |
|
|
13 | * 2. Redistributions in binary form must reproduce the above copyright |
|
|
14 | * notice, this list of conditions and the following disclaimer in the |
|
|
15 | * documentation and/or other materials provided with the distribution. |
|
|
16 | * |
|
|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
|
|
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
|
|
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
|
|
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
|
|
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
|
|
22 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
|
|
23 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
|
|
24 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- |
|
|
25 | * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
|
|
26 | * OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
27 | * |
|
|
28 | * Alternatively, the contents of this file may be used under the terms of |
|
|
29 | * the GNU General Public License ("GPL") version 2 or any later version, |
|
|
30 | * in which case the provisions of the GPL are applicable instead of |
|
|
31 | * the above. If you wish to allow the use of your version of this file |
|
|
32 | * only under the terms of the GPL and not to allow others to use your |
|
|
33 | * version of this file under the BSD license, indicate your decision |
|
|
34 | * by deleting the provisions above and replace them with the notice |
|
|
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 |
|
|
37 | * either the BSD or the GPL. |
|
|
38 | */ |
|
|
39 | |
|
|
40 | #ifndef _WIN32 |
|
|
41 | # include "config.h" |
|
|
42 | #endif |
|
|
43 | |
1 | #include "eio.h" |
44 | #include "eio.h" |
|
|
45 | #include "ecb.h" |
|
|
46 | |
|
|
47 | #ifdef EIO_STACKSIZE |
|
|
48 | # define XTHREAD_STACKSIZE EIO_STACKSIZE |
|
|
49 | #endif |
2 | #include "xthread.h" |
50 | #include "xthread.h" |
3 | |
51 | |
4 | #include <errno.h> |
52 | #include <errno.h> |
5 | #include <stddef.h> |
53 | #include <stddef.h> |
6 | #include <stdlib.h> |
54 | #include <stdlib.h> |
7 | #include <string.h> |
55 | #include <string.h> |
8 | #include <errno.h> |
56 | #include <errno.h> |
9 | #include <sys/types.h> |
57 | #include <sys/types.h> |
10 | #include <sys/stat.h> |
58 | #include <sys/stat.h> |
|
|
59 | #include <sys/statvfs.h> |
11 | #include <limits.h> |
60 | #include <limits.h> |
12 | #include <fcntl.h> |
61 | #include <fcntl.h> |
13 | #include <assert.h> |
62 | #include <assert.h> |
14 | |
63 | |
|
|
64 | /* intptr_t comes from unistd.h, says POSIX/UNIX/tradition */ |
|
|
65 | /* intptr_t only comes form stdint.h, says idiot openbsd coder */ |
|
|
66 | #if HAVE_STDINT_H |
|
|
67 | # include <stdint.h> |
|
|
68 | #endif |
|
|
69 | |
15 | #ifndef EIO_FINISH |
70 | #ifndef EIO_FINISH |
16 | # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 |
71 | # define EIO_FINISH(req) ((req)->finish) && !EIO_CANCELLED (req) ? (req)->finish (req) : 0 |
17 | #endif |
72 | #endif |
18 | |
73 | |
19 | #ifndef EIO_DESTROY |
74 | #ifndef EIO_DESTROY |
… | |
… | |
25 | #endif |
80 | #endif |
26 | |
81 | |
27 | #ifdef _WIN32 |
82 | #ifdef _WIN32 |
28 | |
83 | |
29 | /*doh*/ |
84 | /*doh*/ |
30 | |
|
|
31 | #else |
85 | #else |
32 | |
86 | |
33 | # include "config.h" |
|
|
34 | # include <sys/time.h> |
87 | # include <sys/time.h> |
35 | # include <sys/select.h> |
88 | # include <sys/select.h> |
36 | # include <unistd.h> |
89 | # include <unistd.h> |
37 | # include <utime.h> |
90 | # include <utime.h> |
38 | # include <signal.h> |
91 | # include <signal.h> |
39 | # include <dirent.h> |
92 | # include <dirent.h> |
40 | |
93 | |
|
|
94 | #if _POSIX_MEMLOCK || _POSIX_MEMLOCK_RANGE || _POSIX_MAPPED_FILES |
|
|
95 | # include <sys/mman.h> |
|
|
96 | #endif |
|
|
97 | |
|
|
98 | /* POSIX_SOURCE is useless on bsd's, and XOPEN_SOURCE is unreliable there, too */ |
|
|
99 | # if __FreeBSD__ || defined __NetBSD__ || defined __OpenBSD__ |
|
|
100 | # define _DIRENT_HAVE_D_TYPE /* sigh */ |
|
|
101 | # define D_INO(de) (de)->d_fileno |
|
|
102 | # define D_NAMLEN(de) (de)->d_namlen |
|
|
103 | # elif __linux || defined d_ino || _XOPEN_SOURCE >= 600 |
|
|
104 | # define D_INO(de) (de)->d_ino |
|
|
105 | # endif |
|
|
106 | |
|
|
107 | #ifdef _D_EXACT_NAMLEN |
|
|
108 | # undef D_NAMLEN |
|
|
109 | # define D_NAMLEN(de) _D_EXACT_NAMLEN (de) |
|
|
110 | #endif |
|
|
111 | |
|
|
112 | # ifdef _DIRENT_HAVE_D_TYPE |
|
|
113 | # define D_TYPE(de) (de)->d_type |
|
|
114 | # endif |
|
|
115 | |
41 | # ifndef EIO_STRUCT_DIRENT |
116 | # ifndef EIO_STRUCT_DIRENT |
42 | # define EIO_STRUCT_DIRENT struct dirent |
117 | # define EIO_STRUCT_DIRENT struct dirent |
43 | # endif |
118 | # endif |
44 | |
119 | |
45 | #endif |
120 | #endif |
46 | |
121 | |
47 | #if HAVE_SENDFILE |
122 | #if HAVE_SENDFILE |
48 | # if __linux |
123 | # if __linux |
49 | # include <sys/sendfile.h> |
124 | # include <sys/sendfile.h> |
50 | # elif __freebsd |
125 | # elif __FreeBSD__ || defined __APPLE__ |
51 | # include <sys/socket.h> |
126 | # include <sys/socket.h> |
52 | # include <sys/uio.h> |
127 | # include <sys/uio.h> |
53 | # elif __hpux |
128 | # elif __hpux |
54 | # include <sys/socket.h> |
129 | # include <sys/socket.h> |
55 | # elif __solaris /* not yet */ |
130 | # elif __solaris |
56 | # include <sys/sendfile.h> |
131 | # include <sys/sendfile.h> |
57 | # else |
132 | # else |
58 | # error sendfile support requested but not available |
133 | # error sendfile support requested but not available |
59 | # endif |
134 | # endif |
60 | #endif |
135 | #endif |
61 | |
136 | |
62 | /* number of seconds after which an idle threads exit */ |
137 | #ifndef D_TYPE |
63 | #define IDLE_TIMEOUT 10 |
138 | # define D_TYPE(de) 0 |
|
|
139 | #endif |
|
|
140 | #ifndef D_INO |
|
|
141 | # define D_INO(de) 0 |
|
|
142 | #endif |
|
|
143 | #ifndef D_NAMLEN |
|
|
144 | # define D_NAMLEN(de) strlen ((de)->d_name) |
|
|
145 | #endif |
64 | |
146 | |
65 | /* used for struct dirent, AIX doesn't provide it */ |
147 | /* used for struct dirent, AIX doesn't provide it */ |
66 | #ifndef NAME_MAX |
148 | #ifndef NAME_MAX |
67 | # define NAME_MAX 4096 |
149 | # define NAME_MAX 4096 |
68 | #endif |
150 | #endif |
69 | |
151 | |
|
|
152 | /* used for readlink etc. */ |
|
|
153 | #ifndef PATH_MAX |
|
|
154 | # define PATH_MAX 4096 |
|
|
155 | #endif |
|
|
156 | |
70 | /* buffer size for various temporary buffers */ |
157 | /* buffer size for various temporary buffers */ |
71 | #define EIO_BUFSIZE 65536 |
158 | #define EIO_BUFSIZE 65536 |
72 | |
159 | |
73 | #define dBUF \ |
160 | #define dBUF \ |
74 | char *eio_buf; \ |
161 | char *eio_buf; \ |
75 | X_LOCK (etplock); \ |
162 | ETP_WORKER_LOCK (self); \ |
76 | self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \ |
163 | self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \ |
77 | X_UNLOCK (etplock); \ |
164 | ETP_WORKER_UNLOCK (self); \ |
78 | errno = ENOMEM; \ |
165 | errno = ENOMEM; \ |
79 | if (!eio_buf) \ |
166 | if (!eio_buf) \ |
80 | return -1; |
167 | return -1; |
81 | |
168 | |
82 | #define EIO_TICKS ((1000000 + 1023) >> 10) |
169 | #define EIO_TICKS ((1000000 + 1023) >> 10) |
83 | |
170 | |
|
|
171 | #define ETP_PRI_MIN EIO_PRI_MIN |
|
|
172 | #define ETP_PRI_MAX EIO_PRI_MAX |
|
|
173 | |
|
|
174 | struct etp_worker; |
|
|
175 | |
|
|
176 | #define ETP_REQ eio_req |
|
|
177 | #define ETP_DESTROY(req) eio_destroy (req) |
|
|
178 | static int eio_finish (eio_req *req); |
|
|
179 | #define ETP_FINISH(req) eio_finish (req) |
|
|
180 | static void eio_execute (struct etp_worker *self, eio_req *req); |
|
|
181 | #define ETP_EXECUTE(wrk,req) eio_execute (wrk,req) |
|
|
182 | |
|
|
183 | #define ETP_WORKER_CLEAR(req) \ |
|
|
184 | if (wrk->dbuf) \ |
|
|
185 | { \ |
|
|
186 | free (wrk->dbuf); \ |
|
|
187 | wrk->dbuf = 0; \ |
|
|
188 | } \ |
|
|
189 | \ |
|
|
190 | if (wrk->dirp) \ |
|
|
191 | { \ |
|
|
192 | closedir (wrk->dirp); \ |
|
|
193 | wrk->dirp = 0; \ |
|
|
194 | } |
|
|
195 | |
|
|
196 | #define ETP_WORKER_COMMON \ |
|
|
197 | void *dbuf; \ |
|
|
198 | DIR *dirp; |
|
|
199 | |
84 | /*****************************************************************************/ |
200 | /*****************************************************************************/ |
85 | |
201 | |
|
|
202 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
|
|
203 | |
86 | /* calculcate time difference in ~1/EIO_TICKS of a second */ |
204 | /* calculate time difference in ~1/EIO_TICKS of a second */ |
|
|
205 | ecb_inline int |
87 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
206 | tvdiff (struct timeval *tv1, struct timeval *tv2) |
88 | { |
207 | { |
89 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
208 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
90 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
209 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
91 | } |
210 | } |
92 | |
211 | |
93 | static unsigned int started, idle, wanted = 4; |
212 | static unsigned int started, idle, wanted = 4; |
94 | |
213 | |
95 | typedef struct etp_pool |
|
|
96 | { |
|
|
97 | void (*want_poll_cb) (void); |
214 | static void (*want_poll_cb) (void); |
98 | void (*done_poll_cb) (void); |
215 | static void (*done_poll_cb) (void); |
99 | |
216 | |
100 | unsigned int max_poll_time; |
217 | static unsigned int max_poll_time; /* reslock */ |
101 | unsigned int max_poll_reqs; |
218 | static unsigned int max_poll_reqs; /* reslock */ |
102 | } etp_pool; |
|
|
103 | |
219 | |
104 | static volatile unsigned int nreqs, nready, npending; |
220 | static volatile unsigned int nreqs; /* reqlock */ |
105 | static volatile unsigned int max_idle = 4; |
221 | static volatile unsigned int nready; /* reqlock */ |
|
|
222 | static volatile unsigned int npending; /* reqlock */ |
|
|
223 | static volatile unsigned int max_idle = 4; /* maximum number of threads that can idle indefinitely */ |
|
|
224 | static volatile unsigned int idle_timeout = 10; /* number of seconds after which an idle threads exit */ |
106 | |
225 | |
|
|
226 | static xmutex_t wrklock; |
|
|
227 | static xmutex_t reslock; |
|
|
228 | static xmutex_t reqlock; |
|
|
229 | static xcond_t reqwait; |
|
|
230 | |
|
|
231 | #if !HAVE_PREADWRITE |
|
|
232 | /* |
|
|
233 | * make our pread/pwrite emulation safe against themselves, but not against |
|
|
234 | * normal read/write by using a mutex. slows down execution a lot, |
|
|
235 | * but that's your problem, not mine. |
|
|
236 | */ |
107 | static mutex_t etplock = X_MUTEX_INIT; |
237 | static xmutex_t preadwritelock = X_MUTEX_INIT; |
108 | static mutex_t reslock = X_MUTEX_INIT; |
238 | #endif |
109 | static mutex_t reqlock = X_MUTEX_INIT; |
|
|
110 | static cond_t reqwait = X_COND_INIT; |
|
|
111 | |
239 | |
112 | typedef struct worker |
240 | typedef struct etp_worker |
113 | { |
241 | { |
114 | /* locked by etplock */ |
242 | /* locked by wrklock */ |
115 | struct worker *prev, *next; |
243 | struct etp_worker *prev, *next; |
116 | |
244 | |
117 | thread_t tid; |
245 | xthread_t tid; |
118 | |
246 | |
119 | /* locked by reslock, reqlock or etplock */ |
247 | /* locked by reslock, reqlock or wrklock */ |
120 | eio_req *req; /* currently processed request */ |
248 | ETP_REQ *req; /* currently processed request */ |
121 | void *dbuf; |
249 | |
122 | DIR *dirp; |
250 | ETP_WORKER_COMMON |
123 | } worker; |
251 | } etp_worker; |
124 | |
252 | |
125 | static worker wrk_first = { &wrk_first, &wrk_first, 0 }; /* NOT etp */ |
253 | static etp_worker wrk_first = { &wrk_first, &wrk_first, 0 }; /* NOT etp */ |
|
|
254 | |
|
|
255 | #define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock) |
|
|
256 | #define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock) |
126 | |
257 | |
127 | /* worker threads management */ |
258 | /* worker threads management */ |
128 | |
259 | |
|
|
260 | static void ecb_cold |
129 | static void worker_clear (worker *wrk) |
261 | etp_worker_clear (etp_worker *wrk) |
130 | { |
262 | { |
131 | if (wrk->dirp) |
263 | ETP_WORKER_CLEAR (wrk); |
132 | { |
|
|
133 | closedir (wrk->dirp); |
|
|
134 | wrk->dirp = 0; |
|
|
135 | } |
|
|
136 | |
|
|
137 | if (wrk->dbuf) |
|
|
138 | { |
|
|
139 | free (wrk->dbuf); |
|
|
140 | wrk->dbuf = 0; |
|
|
141 | } |
|
|
142 | } |
264 | } |
143 | |
265 | |
144 | static void worker_free (worker *wrk) |
266 | static void ecb_cold |
|
|
267 | etp_worker_free (etp_worker *wrk) |
145 | { |
268 | { |
146 | wrk->next->prev = wrk->prev; |
269 | wrk->next->prev = wrk->prev; |
147 | wrk->prev->next = wrk->next; |
270 | wrk->prev->next = wrk->next; |
148 | |
271 | |
149 | free (wrk); |
272 | free (wrk); |
150 | } |
273 | } |
151 | |
274 | |
152 | unsigned int eio_nreqs (void) |
275 | static unsigned int |
|
|
276 | etp_nreqs (void) |
153 | { |
277 | { |
|
|
278 | int retval; |
|
|
279 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
280 | retval = nreqs; |
|
|
281 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
154 | return nreqs; |
282 | return retval; |
155 | } |
283 | } |
156 | |
284 | |
157 | unsigned int eio_nready (void) |
285 | static unsigned int |
|
|
286 | etp_nready (void) |
158 | { |
287 | { |
159 | unsigned int retval; |
288 | unsigned int retval; |
160 | |
289 | |
161 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
290 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
162 | retval = nready; |
291 | retval = nready; |
163 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
292 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
164 | |
293 | |
165 | return retval; |
294 | return retval; |
166 | } |
295 | } |
167 | |
296 | |
168 | unsigned int eio_npending (void) |
297 | static unsigned int |
|
|
298 | etp_npending (void) |
169 | { |
299 | { |
170 | unsigned int retval; |
300 | unsigned int retval; |
171 | |
301 | |
172 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
302 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
173 | retval = npending; |
303 | retval = npending; |
174 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
304 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
175 | |
305 | |
176 | return retval; |
306 | return retval; |
177 | } |
307 | } |
178 | |
308 | |
179 | unsigned int eio_nthreads (void) |
309 | static unsigned int |
|
|
310 | etp_nthreads (void) |
180 | { |
311 | { |
181 | unsigned int retval; |
312 | unsigned int retval; |
182 | |
313 | |
183 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
314 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
184 | retval = started; |
315 | retval = started; |
… | |
… | |
191 | * a somewhat faster data structure might be nice, but |
322 | * a somewhat faster data structure might be nice, but |
192 | * with 8 priorities this actually needs <20 insns |
323 | * with 8 priorities this actually needs <20 insns |
193 | * per shift, the most expensive operation. |
324 | * per shift, the most expensive operation. |
194 | */ |
325 | */ |
195 | typedef struct { |
326 | typedef struct { |
196 | eio_req *qs[EIO_NUM_PRI], *qe[EIO_NUM_PRI]; /* qstart, qend */ |
327 | ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */ |
197 | int size; |
328 | int size; |
198 | } reqq; |
329 | } etp_reqq; |
199 | |
330 | |
200 | static reqq req_queue; |
331 | static etp_reqq req_queue; |
201 | static reqq res_queue; |
332 | static etp_reqq res_queue; |
202 | |
333 | |
203 | static int reqq_push (reqq *q, eio_req *req) |
334 | static int ecb_noinline |
|
|
335 | reqq_push (etp_reqq *q, ETP_REQ *req) |
204 | { |
336 | { |
205 | int pri = req->pri; |
337 | int pri = req->pri; |
206 | req->next = 0; |
338 | req->next = 0; |
207 | |
339 | |
208 | if (q->qe[pri]) |
340 | if (q->qe[pri]) |
… | |
… | |
214 | q->qe[pri] = q->qs[pri] = req; |
346 | q->qe[pri] = q->qs[pri] = req; |
215 | |
347 | |
216 | return q->size++; |
348 | return q->size++; |
217 | } |
349 | } |
218 | |
350 | |
219 | static eio_req *reqq_shift (reqq *q) |
351 | static ETP_REQ * ecb_noinline |
|
|
352 | reqq_shift (etp_reqq *q) |
220 | { |
353 | { |
221 | int pri; |
354 | int pri; |
222 | |
355 | |
223 | if (!q->size) |
356 | if (!q->size) |
224 | return 0; |
357 | return 0; |
225 | |
358 | |
226 | --q->size; |
359 | --q->size; |
227 | |
360 | |
228 | for (pri = EIO_NUM_PRI; pri--; ) |
361 | for (pri = ETP_NUM_PRI; pri--; ) |
229 | { |
362 | { |
230 | eio_req *req = q->qs[pri]; |
363 | eio_req *req = q->qs[pri]; |
231 | |
364 | |
232 | if (req) |
365 | if (req) |
233 | { |
366 | { |
… | |
… | |
239 | } |
372 | } |
240 | |
373 | |
241 | abort (); |
374 | abort (); |
242 | } |
375 | } |
243 | |
376 | |
|
|
377 | static void ecb_cold |
|
|
378 | etp_thread_init (void) |
|
|
379 | { |
|
|
380 | X_MUTEX_CREATE (wrklock); |
|
|
381 | X_MUTEX_CREATE (reslock); |
|
|
382 | X_MUTEX_CREATE (reqlock); |
|
|
383 | X_COND_CREATE (reqwait); |
|
|
384 | } |
|
|
385 | |
|
|
386 | static void ecb_cold |
244 | static void etp_atfork_prepare (void) |
387 | etp_atfork_prepare (void) |
245 | { |
388 | { |
246 | X_LOCK (etplock); |
389 | X_LOCK (wrklock); |
247 | X_LOCK (reqlock); |
390 | X_LOCK (reqlock); |
248 | X_LOCK (reslock); |
391 | X_LOCK (reslock); |
249 | #if !HAVE_PREADWRITE |
392 | #if !HAVE_PREADWRITE |
250 | X_LOCK (preadwritelock); |
393 | X_LOCK (preadwritelock); |
251 | #endif |
394 | #endif |
252 | #if !HAVE_READDIR_R |
|
|
253 | X_LOCK (readdirlock); |
|
|
254 | #endif |
|
|
255 | } |
395 | } |
256 | |
396 | |
|
|
397 | static void ecb_cold |
257 | static void etp_atfork_parent (void) |
398 | etp_atfork_parent (void) |
258 | { |
399 | { |
259 | #if !HAVE_READDIR_R |
|
|
260 | X_UNLOCK (readdirlock); |
|
|
261 | #endif |
|
|
262 | #if !HAVE_PREADWRITE |
400 | #if !HAVE_PREADWRITE |
263 | X_UNLOCK (preadwritelock); |
401 | X_UNLOCK (preadwritelock); |
264 | #endif |
402 | #endif |
265 | X_UNLOCK (reslock); |
403 | X_UNLOCK (reslock); |
266 | X_UNLOCK (reqlock); |
404 | X_UNLOCK (reqlock); |
267 | X_UNLOCK (etplock); |
405 | X_UNLOCK (wrklock); |
268 | } |
406 | } |
269 | |
407 | |
|
|
408 | static void ecb_cold |
270 | static void etp_atfork_child (void) |
409 | etp_atfork_child (void) |
271 | { |
410 | { |
272 | eio_req *prv; |
411 | ETP_REQ *prv; |
273 | |
412 | |
274 | while (prv = reqq_shift (&req_queue)) |
413 | while ((prv = reqq_shift (&req_queue))) |
275 | eio_destroy (prv); |
414 | ETP_DESTROY (prv); |
276 | |
415 | |
277 | while (prv = reqq_shift (&res_queue)) |
416 | while ((prv = reqq_shift (&res_queue))) |
278 | eio_destroy (prv); |
417 | ETP_DESTROY (prv); |
279 | |
418 | |
280 | while (wrk_first.next != &wrk_first) |
419 | while (wrk_first.next != &wrk_first) |
281 | { |
420 | { |
282 | worker *wrk = wrk_first.next; |
421 | etp_worker *wrk = wrk_first.next; |
283 | |
422 | |
284 | if (wrk->req) |
423 | if (wrk->req) |
285 | eio_destroy (wrk->req); |
424 | ETP_DESTROY (wrk->req); |
286 | |
425 | |
287 | worker_clear (wrk); |
426 | etp_worker_clear (wrk); |
288 | worker_free (wrk); |
427 | etp_worker_free (wrk); |
289 | } |
428 | } |
290 | |
429 | |
291 | started = 0; |
430 | started = 0; |
292 | idle = 0; |
431 | idle = 0; |
293 | nreqs = 0; |
432 | nreqs = 0; |
294 | nready = 0; |
433 | nready = 0; |
295 | npending = 0; |
434 | npending = 0; |
296 | |
435 | |
297 | etp_atfork_parent (); |
436 | etp_thread_init (); |
298 | } |
437 | } |
299 | |
438 | |
300 | static void |
439 | static void ecb_cold |
301 | etp_once_init (void) |
440 | etp_once_init (void) |
302 | { |
441 | { |
|
|
442 | etp_thread_init (); |
303 | X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); |
443 | X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); |
304 | } |
444 | } |
305 | |
445 | |
306 | static int |
446 | static int ecb_cold |
307 | etp_init (etp_pool *etp, void (*want_poll)(void), void (*done_poll)(void)) |
447 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
308 | { |
448 | { |
309 | static pthread_once_t doinit = PTHREAD_ONCE_INIT; |
449 | static pthread_once_t doinit = PTHREAD_ONCE_INIT; |
310 | |
450 | |
311 | pthread_once (&doinit, etp_once_init); |
451 | pthread_once (&doinit, etp_once_init); |
312 | |
452 | |
313 | memset (etp, 0, sizeof *etp); |
|
|
314 | |
|
|
315 | etp->want_poll_cb = want_poll; |
453 | want_poll_cb = want_poll; |
316 | etp->done_poll_cb = done_poll; |
454 | done_poll_cb = done_poll; |
317 | } |
|
|
318 | |
455 | |
319 | static etp_pool etp; |
|
|
320 | |
|
|
321 | /*****************************************************************************/ |
|
|
322 | |
|
|
323 | static void grp_try_feed (eio_req *grp) |
|
|
324 | { |
|
|
325 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
|
|
326 | { |
|
|
327 | int old_len = grp->size; |
|
|
328 | |
|
|
329 | EIO_FEED (grp); |
|
|
330 | |
|
|
331 | /* stop if no progress has been made */ |
|
|
332 | if (old_len == grp->size) |
|
|
333 | { |
|
|
334 | grp->feed = 0; |
|
|
335 | break; |
|
|
336 | } |
|
|
337 | } |
|
|
338 | } |
|
|
339 | |
|
|
340 | static int eio_finish (eio_req *req); |
|
|
341 | |
|
|
342 | static int grp_dec (eio_req *grp) |
|
|
343 | { |
|
|
344 | --grp->size; |
|
|
345 | |
|
|
346 | /* call feeder, if applicable */ |
|
|
347 | grp_try_feed (grp); |
|
|
348 | |
|
|
349 | /* finish, if done */ |
|
|
350 | if (!grp->size && grp->int1) |
|
|
351 | return eio_finish (grp); |
|
|
352 | else |
|
|
353 | return 0; |
456 | return 0; |
354 | } |
457 | } |
355 | |
458 | |
356 | void eio_destroy (eio_req *req) |
|
|
357 | { |
|
|
358 | if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1); |
|
|
359 | if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2); |
|
|
360 | |
|
|
361 | EIO_DESTROY (req); |
|
|
362 | } |
|
|
363 | |
|
|
364 | static int eio_finish (eio_req *req) |
|
|
365 | { |
|
|
366 | int res = EIO_FINISH (req); |
|
|
367 | |
|
|
368 | if (req->grp) |
|
|
369 | { |
|
|
370 | int res2; |
|
|
371 | eio_req *grp = req->grp; |
|
|
372 | |
|
|
373 | /* unlink request */ |
|
|
374 | if (req->grp_next) req->grp_next->grp_prev = req->grp_prev; |
|
|
375 | if (req->grp_prev) req->grp_prev->grp_next = req->grp_next; |
|
|
376 | |
|
|
377 | if (grp->grp_first == req) |
|
|
378 | grp->grp_first = req->grp_next; |
|
|
379 | |
|
|
380 | res2 = grp_dec (grp); |
|
|
381 | |
|
|
382 | if (!res && res2) |
|
|
383 | res = res2; |
|
|
384 | } |
|
|
385 | |
|
|
386 | eio_destroy (req); |
|
|
387 | |
|
|
388 | return res; |
|
|
389 | } |
|
|
390 | |
|
|
391 | void eio_grp_cancel (eio_req *grp) |
|
|
392 | { |
|
|
393 | for (grp = grp->grp_first; grp; grp = grp->grp_next) |
|
|
394 | eio_cancel (grp); |
|
|
395 | } |
|
|
396 | |
|
|
397 | void eio_cancel (eio_req *req) |
|
|
398 | { |
|
|
399 | X_LOCK (etplock); |
|
|
400 | req->flags |= EIO_FLAG_CANCELLED; |
|
|
401 | X_UNLOCK (etplock); |
|
|
402 | |
|
|
403 | eio_grp_cancel (req); |
|
|
404 | } |
|
|
405 | |
|
|
406 | X_THREAD_PROC (eio_proc); |
459 | X_THREAD_PROC (etp_proc); |
407 | |
460 | |
408 | static void start_thread (void) |
461 | static void ecb_cold |
|
|
462 | etp_start_thread (void) |
409 | { |
463 | { |
410 | worker *wrk = calloc (1, sizeof (worker)); |
464 | etp_worker *wrk = calloc (1, sizeof (etp_worker)); |
411 | |
465 | |
412 | /*TODO*/ |
466 | /*TODO*/ |
413 | assert (("unable to allocate worker thread data", wrk)); |
467 | assert (("unable to allocate worker thread data", wrk)); |
414 | |
468 | |
415 | X_LOCK (etplock); |
469 | X_LOCK (wrklock); |
416 | |
470 | |
417 | if (thread_create (&wrk->tid, eio_proc, (void *)wrk)) |
471 | if (thread_create (&wrk->tid, etp_proc, (void *)wrk)) |
418 | { |
472 | { |
419 | wrk->prev = &wrk_first; |
473 | wrk->prev = &wrk_first; |
420 | wrk->next = wrk_first.next; |
474 | wrk->next = wrk_first.next; |
421 | wrk_first.next->prev = wrk; |
475 | wrk_first.next->prev = wrk; |
422 | wrk_first.next = wrk; |
476 | wrk_first.next = wrk; |
423 | ++started; |
477 | ++started; |
424 | } |
478 | } |
425 | else |
479 | else |
426 | free (wrk); |
480 | free (wrk); |
427 | |
481 | |
428 | X_UNLOCK (etplock); |
482 | X_UNLOCK (wrklock); |
429 | } |
483 | } |
430 | |
484 | |
|
|
485 | static void |
431 | static void maybe_start_thread (void) |
486 | etp_maybe_start_thread (void) |
432 | { |
487 | { |
433 | if (eio_nthreads () >= wanted) |
488 | if (ecb_expect_true (etp_nthreads () >= wanted)) |
434 | return; |
489 | return; |
435 | |
490 | |
436 | /* todo: maybe use idle here, but might be less exact */ |
491 | /* todo: maybe use idle here, but might be less exact */ |
437 | if (0 <= (int)eio_nthreads () + (int)eio_npending () - (int)eio_nreqs ()) |
492 | if (ecb_expect_true (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ())) |
438 | return; |
493 | return; |
439 | |
494 | |
440 | start_thread (); |
495 | etp_start_thread (); |
441 | } |
496 | } |
442 | |
497 | |
443 | void eio_submit (eio_req *req) |
498 | static void ecb_cold |
444 | { |
499 | etp_end_thread (void) |
445 | req->pri += EIO_PRI_BIAS; |
|
|
446 | |
|
|
447 | if (req->pri < EIO_PRI_MIN + EIO_PRI_BIAS) req->pri = EIO_PRI_MIN + EIO_PRI_BIAS; |
|
|
448 | if (req->pri > EIO_PRI_MAX + EIO_PRI_BIAS) req->pri = EIO_PRI_MAX + EIO_PRI_BIAS; |
|
|
449 | |
|
|
450 | ++nreqs; |
|
|
451 | |
|
|
452 | X_LOCK (reqlock); |
|
|
453 | ++nready; |
|
|
454 | reqq_push (&req_queue, req); |
|
|
455 | X_COND_SIGNAL (reqwait); |
|
|
456 | X_UNLOCK (reqlock); |
|
|
457 | |
|
|
458 | maybe_start_thread (); |
|
|
459 | } |
|
|
460 | |
|
|
461 | static void end_thread (void) |
|
|
462 | { |
500 | { |
463 | eio_req *req = calloc (1, sizeof (eio_req)); |
501 | eio_req *req = calloc (1, sizeof (eio_req)); |
464 | |
502 | |
465 | req->type = EIO_QUIT; |
503 | req->type = -1; |
466 | req->pri = EIO_PRI_MAX + EIO_PRI_BIAS; |
504 | req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
467 | |
505 | |
468 | X_LOCK (reqlock); |
506 | X_LOCK (reqlock); |
469 | reqq_push (&req_queue, req); |
507 | reqq_push (&req_queue, req); |
470 | X_COND_SIGNAL (reqwait); |
508 | X_COND_SIGNAL (reqwait); |
471 | X_UNLOCK (reqlock); |
509 | X_UNLOCK (reqlock); |
472 | |
510 | |
473 | X_LOCK (etplock); |
511 | X_LOCK (wrklock); |
474 | --started; |
512 | --started; |
475 | X_UNLOCK (etplock); |
513 | X_UNLOCK (wrklock); |
476 | } |
514 | } |
477 | |
515 | |
478 | void eio_set_max_poll_time (double nseconds) |
516 | static int |
479 | { |
|
|
480 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
481 | etp.max_poll_time = nseconds; |
|
|
482 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
483 | } |
|
|
484 | |
|
|
485 | void eio_set_max_poll_reqs (unsigned int maxreqs) |
|
|
486 | { |
|
|
487 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
488 | etp.max_poll_reqs = maxreqs; |
|
|
489 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
490 | } |
|
|
491 | |
|
|
492 | void eio_set_max_idle (unsigned int nthreads) |
|
|
493 | { |
|
|
494 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
495 | max_idle = nthreads <= 0 ? 1 : nthreads; |
|
|
496 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
497 | } |
|
|
498 | |
|
|
499 | void eio_set_min_parallel (unsigned int nthreads) |
|
|
500 | { |
|
|
501 | if (wanted < nthreads) |
|
|
502 | wanted = nthreads; |
|
|
503 | } |
|
|
504 | |
|
|
505 | void eio_set_max_parallel (unsigned int nthreads) |
|
|
506 | { |
|
|
507 | if (wanted > nthreads) |
|
|
508 | wanted = nthreads; |
|
|
509 | |
|
|
510 | while (started > wanted) |
|
|
511 | end_thread (); |
|
|
512 | } |
|
|
513 | |
|
|
514 | int eio_poll (void) |
517 | etp_poll (void) |
515 | { |
518 | { |
516 | int maxreqs = etp.max_poll_reqs; |
519 | unsigned int maxreqs; |
|
|
520 | unsigned int maxtime; |
517 | struct timeval tv_start, tv_now; |
521 | struct timeval tv_start, tv_now; |
518 | eio_req *req; |
|
|
519 | |
522 | |
520 | if (etp.max_poll_time) |
523 | X_LOCK (reslock); |
|
|
524 | maxreqs = max_poll_reqs; |
|
|
525 | maxtime = max_poll_time; |
|
|
526 | X_UNLOCK (reslock); |
|
|
527 | |
|
|
528 | if (maxtime) |
521 | gettimeofday (&tv_start, 0); |
529 | gettimeofday (&tv_start, 0); |
522 | |
530 | |
523 | for (;;) |
531 | for (;;) |
524 | { |
532 | { |
|
|
533 | ETP_REQ *req; |
|
|
534 | |
525 | maybe_start_thread (); |
535 | etp_maybe_start_thread (); |
526 | |
536 | |
527 | X_LOCK (reslock); |
537 | X_LOCK (reslock); |
528 | req = reqq_shift (&res_queue); |
538 | req = reqq_shift (&res_queue); |
529 | |
539 | |
530 | if (req) |
540 | if (req) |
531 | { |
541 | { |
532 | --npending; |
542 | --npending; |
533 | |
543 | |
534 | if (!res_queue.size && etp.done_poll_cb) |
544 | if (!res_queue.size && done_poll_cb) |
535 | etp.done_poll_cb (); |
545 | done_poll_cb (); |
536 | } |
546 | } |
537 | |
547 | |
538 | X_UNLOCK (reslock); |
548 | X_UNLOCK (reslock); |
539 | |
549 | |
540 | if (!req) |
550 | if (!req) |
541 | return 0; |
551 | return 0; |
542 | |
552 | |
|
|
553 | X_LOCK (reqlock); |
543 | --nreqs; |
554 | --nreqs; |
|
|
555 | X_UNLOCK (reqlock); |
544 | |
556 | |
545 | if (req->type == EIO_GROUP && req->size) |
557 | if (ecb_expect_false (req->type == EIO_GROUP && req->size)) |
546 | { |
558 | { |
547 | req->int1 = 1; /* mark request as delayed */ |
559 | req->int1 = 1; /* mark request as delayed */ |
548 | continue; |
560 | continue; |
549 | } |
561 | } |
550 | else |
562 | else |
551 | { |
563 | { |
552 | int res = eio_finish (req); |
564 | int res = ETP_FINISH (req); |
553 | if (res) |
565 | if (ecb_expect_false (res)) |
554 | return res; |
566 | return res; |
555 | } |
567 | } |
556 | |
568 | |
557 | if (maxreqs && !--maxreqs) |
569 | if (ecb_expect_false (maxreqs && !--maxreqs)) |
558 | break; |
570 | break; |
559 | |
571 | |
560 | if (etp.max_poll_time) |
572 | if (maxtime) |
561 | { |
573 | { |
562 | gettimeofday (&tv_now, 0); |
574 | gettimeofday (&tv_now, 0); |
563 | |
575 | |
564 | if (tvdiff (&tv_start, &tv_now) >= etp.max_poll_time) |
576 | if (tvdiff (&tv_start, &tv_now) >= maxtime) |
565 | break; |
577 | break; |
566 | } |
578 | } |
567 | } |
579 | } |
568 | |
580 | |
569 | errno = EAGAIN; |
581 | errno = EAGAIN; |
570 | return -1; |
582 | return -1; |
571 | } |
583 | } |
572 | |
584 | |
|
|
585 | static void |
|
|
586 | etp_cancel (ETP_REQ *req) |
|
|
587 | { |
|
|
588 | X_LOCK (wrklock); |
|
|
589 | req->flags |= EIO_FLAG_CANCELLED; |
|
|
590 | X_UNLOCK (wrklock); |
|
|
591 | |
|
|
592 | eio_grp_cancel (req); |
|
|
593 | } |
|
|
594 | |
|
|
595 | static void |
|
|
596 | etp_submit (ETP_REQ *req) |
|
|
597 | { |
|
|
598 | req->pri -= ETP_PRI_MIN; |
|
|
599 | |
|
|
600 | if (ecb_expect_false (req->pri < ETP_PRI_MIN - ETP_PRI_MIN)) req->pri = ETP_PRI_MIN - ETP_PRI_MIN; |
|
|
601 | if (ecb_expect_false (req->pri > ETP_PRI_MAX - ETP_PRI_MIN)) req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
|
|
602 | |
|
|
603 | if (ecb_expect_false (req->type == EIO_GROUP)) |
|
|
604 | { |
|
|
605 | /* I hope this is worth it :/ */ |
|
|
606 | X_LOCK (reqlock); |
|
|
607 | ++nreqs; |
|
|
608 | X_UNLOCK (reqlock); |
|
|
609 | |
|
|
610 | X_LOCK (reslock); |
|
|
611 | |
|
|
612 | ++npending; |
|
|
613 | |
|
|
614 | if (!reqq_push (&res_queue, req) && want_poll_cb) |
|
|
615 | want_poll_cb (); |
|
|
616 | |
|
|
617 | X_UNLOCK (reslock); |
|
|
618 | } |
|
|
619 | else |
|
|
620 | { |
|
|
621 | X_LOCK (reqlock); |
|
|
622 | ++nreqs; |
|
|
623 | ++nready; |
|
|
624 | reqq_push (&req_queue, req); |
|
|
625 | X_COND_SIGNAL (reqwait); |
|
|
626 | X_UNLOCK (reqlock); |
|
|
627 | |
|
|
628 | etp_maybe_start_thread (); |
|
|
629 | } |
|
|
630 | } |
|
|
631 | |
|
|
632 | static void ecb_cold |
|
|
633 | etp_set_max_poll_time (double nseconds) |
|
|
634 | { |
|
|
635 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
|
|
636 | max_poll_time = nseconds * EIO_TICKS; |
|
|
637 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
|
|
638 | } |
|
|
639 | |
|
|
640 | static void ecb_cold |
|
|
641 | etp_set_max_poll_reqs (unsigned int maxreqs) |
|
|
642 | { |
|
|
643 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
|
|
644 | max_poll_reqs = maxreqs; |
|
|
645 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
|
|
646 | } |
|
|
647 | |
|
|
648 | static void ecb_cold |
|
|
649 | etp_set_max_idle (unsigned int nthreads) |
|
|
650 | { |
|
|
651 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
652 | max_idle = nthreads; |
|
|
653 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
654 | } |
|
|
655 | |
|
|
656 | static void ecb_cold |
|
|
657 | etp_set_idle_timeout (unsigned int seconds) |
|
|
658 | { |
|
|
659 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
660 | idle_timeout = seconds; |
|
|
661 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
662 | } |
|
|
663 | |
|
|
664 | static void ecb_cold |
|
|
665 | etp_set_min_parallel (unsigned int nthreads) |
|
|
666 | { |
|
|
667 | if (wanted < nthreads) |
|
|
668 | wanted = nthreads; |
|
|
669 | } |
|
|
670 | |
|
|
671 | static void ecb_cold |
|
|
672 | etp_set_max_parallel (unsigned int nthreads) |
|
|
673 | { |
|
|
674 | if (wanted > nthreads) |
|
|
675 | wanted = nthreads; |
|
|
676 | |
|
|
677 | while (started > wanted) |
|
|
678 | etp_end_thread (); |
|
|
679 | } |
|
|
680 | |
|
|
681 | /*****************************************************************************/ |
|
|
682 | |
|
|
683 | static void |
|
|
684 | grp_try_feed (eio_req *grp) |
|
|
685 | { |
|
|
686 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
|
|
687 | { |
|
|
688 | grp->flags &= ~EIO_FLAG_GROUPADD; |
|
|
689 | |
|
|
690 | EIO_FEED (grp); |
|
|
691 | |
|
|
692 | /* stop if no progress has been made */ |
|
|
693 | if (!(grp->flags & EIO_FLAG_GROUPADD)) |
|
|
694 | { |
|
|
695 | grp->feed = 0; |
|
|
696 | break; |
|
|
697 | } |
|
|
698 | } |
|
|
699 | } |
|
|
700 | |
|
|
701 | static int |
|
|
702 | grp_dec (eio_req *grp) |
|
|
703 | { |
|
|
704 | --grp->size; |
|
|
705 | |
|
|
706 | /* call feeder, if applicable */ |
|
|
707 | grp_try_feed (grp); |
|
|
708 | |
|
|
709 | /* finish, if done */ |
|
|
710 | if (!grp->size && grp->int1) |
|
|
711 | return eio_finish (grp); |
|
|
712 | else |
|
|
713 | return 0; |
|
|
714 | } |
|
|
715 | |
|
|
716 | void |
|
|
717 | eio_destroy (eio_req *req) |
|
|
718 | { |
|
|
719 | if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1); |
|
|
720 | if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2); |
|
|
721 | |
|
|
722 | EIO_DESTROY (req); |
|
|
723 | } |
|
|
724 | |
|
|
725 | static int |
|
|
726 | eio_finish (eio_req *req) |
|
|
727 | { |
|
|
728 | int res = EIO_FINISH (req); |
|
|
729 | |
|
|
730 | if (req->grp) |
|
|
731 | { |
|
|
732 | int res2; |
|
|
733 | eio_req *grp = req->grp; |
|
|
734 | |
|
|
735 | /* unlink request */ |
|
|
736 | if (req->grp_next) req->grp_next->grp_prev = req->grp_prev; |
|
|
737 | if (req->grp_prev) req->grp_prev->grp_next = req->grp_next; |
|
|
738 | |
|
|
739 | if (grp->grp_first == req) |
|
|
740 | grp->grp_first = req->grp_next; |
|
|
741 | |
|
|
742 | res2 = grp_dec (grp); |
|
|
743 | |
|
|
744 | if (!res && res2) |
|
|
745 | res = res2; |
|
|
746 | } |
|
|
747 | |
|
|
748 | eio_destroy (req); |
|
|
749 | |
|
|
750 | return res; |
|
|
751 | } |
|
|
752 | |
|
|
753 | void |
|
|
754 | eio_grp_cancel (eio_req *grp) |
|
|
755 | { |
|
|
756 | for (grp = grp->grp_first; grp; grp = grp->grp_next) |
|
|
757 | eio_cancel (grp); |
|
|
758 | } |
|
|
759 | |
|
|
760 | void |
|
|
761 | eio_cancel (eio_req *req) |
|
|
762 | { |
|
|
763 | etp_cancel (req); |
|
|
764 | } |
|
|
765 | |
|
|
766 | void |
|
|
767 | eio_submit (eio_req *req) |
|
|
768 | { |
|
|
769 | etp_submit (req); |
|
|
770 | } |
|
|
771 | |
|
|
772 | unsigned int |
|
|
773 | eio_nreqs (void) |
|
|
774 | { |
|
|
775 | return etp_nreqs (); |
|
|
776 | } |
|
|
777 | |
|
|
778 | unsigned int |
|
|
779 | eio_nready (void) |
|
|
780 | { |
|
|
781 | return etp_nready (); |
|
|
782 | } |
|
|
783 | |
|
|
784 | unsigned int |
|
|
785 | eio_npending (void) |
|
|
786 | { |
|
|
787 | return etp_npending (); |
|
|
788 | } |
|
|
789 | |
|
|
790 | unsigned int ecb_cold |
|
|
791 | eio_nthreads (void) |
|
|
792 | { |
|
|
793 | return etp_nthreads (); |
|
|
794 | } |
|
|
795 | |
|
|
796 | void ecb_cold |
|
|
797 | eio_set_max_poll_time (double nseconds) |
|
|
798 | { |
|
|
799 | etp_set_max_poll_time (nseconds); |
|
|
800 | } |
|
|
801 | |
|
|
802 | void ecb_cold |
|
|
803 | eio_set_max_poll_reqs (unsigned int maxreqs) |
|
|
804 | { |
|
|
805 | etp_set_max_poll_reqs (maxreqs); |
|
|
806 | } |
|
|
807 | |
|
|
808 | void ecb_cold |
|
|
809 | eio_set_max_idle (unsigned int nthreads) |
|
|
810 | { |
|
|
811 | etp_set_max_idle (nthreads); |
|
|
812 | } |
|
|
813 | |
|
|
814 | void ecb_cold |
|
|
815 | eio_set_idle_timeout (unsigned int seconds) |
|
|
816 | { |
|
|
817 | etp_set_idle_timeout (seconds); |
|
|
818 | } |
|
|
819 | |
|
|
820 | void ecb_cold |
|
|
821 | eio_set_min_parallel (unsigned int nthreads) |
|
|
822 | { |
|
|
823 | etp_set_min_parallel (nthreads); |
|
|
824 | } |
|
|
825 | |
|
|
826 | void ecb_cold |
|
|
827 | eio_set_max_parallel (unsigned int nthreads) |
|
|
828 | { |
|
|
829 | etp_set_max_parallel (nthreads); |
|
|
830 | } |
|
|
831 | |
|
|
832 | int eio_poll (void) |
|
|
833 | { |
|
|
834 | return etp_poll (); |
|
|
835 | } |
|
|
836 | |
573 | /*****************************************************************************/ |
837 | /*****************************************************************************/ |
574 | /* work around various missing functions */ |
838 | /* work around various missing functions */ |
575 | |
839 | |
576 | #if !HAVE_PREADWRITE |
840 | #if !HAVE_PREADWRITE |
|
|
841 | # undef pread |
|
|
842 | # undef pwrite |
577 | # define pread eio__pread |
843 | # define pread eio__pread |
578 | # define pwrite eio__pwrite |
844 | # define pwrite eio__pwrite |
579 | |
|
|
580 | /* |
|
|
581 | * make our pread/pwrite safe against themselves, but not against |
|
|
582 | * normal read/write by using a mutex. slows down execution a lot, |
|
|
583 | * but that's your problem, not mine. |
|
|
584 | */ |
|
|
585 | static mutex_t preadwritelock = X_MUTEX_INIT; |
|
|
586 | |
845 | |
587 | static ssize_t |
846 | static ssize_t |
588 | eio__pread (int fd, void *buf, size_t count, off_t offset) |
847 | eio__pread (int fd, void *buf, size_t count, off_t offset) |
589 | { |
848 | { |
590 | ssize_t res; |
849 | ssize_t res; |
… | |
… | |
608 | |
867 | |
609 | X_LOCK (preadwritelock); |
868 | X_LOCK (preadwritelock); |
610 | ooffset = lseek (fd, 0, SEEK_CUR); |
869 | ooffset = lseek (fd, 0, SEEK_CUR); |
611 | lseek (fd, offset, SEEK_SET); |
870 | lseek (fd, offset, SEEK_SET); |
612 | res = write (fd, buf, count); |
871 | res = write (fd, buf, count); |
613 | lseek (fd, offset, SEEK_SET); |
872 | lseek (fd, ooffset, SEEK_SET); |
614 | X_UNLOCK (preadwritelock); |
873 | X_UNLOCK (preadwritelock); |
615 | |
874 | |
616 | return res; |
875 | return res; |
617 | } |
876 | } |
618 | #endif |
877 | #endif |
619 | |
878 | |
620 | #ifndef HAVE_FUTIMES |
879 | #ifndef HAVE_UTIMES |
621 | |
880 | |
|
|
881 | # undef utimes |
622 | # define utimes(path,times) eio__utimes (path, times) |
882 | # define utimes(path,times) eio__utimes (path, times) |
623 | # define futimes(fd,times) eio__futimes (fd, times) |
|
|
624 | |
883 | |
625 | static int |
884 | static int |
626 | eio__utimes (const char *filename, const struct timeval times[2]) |
885 | eio__utimes (const char *filename, const struct timeval times[2]) |
627 | { |
886 | { |
628 | if (times) |
887 | if (times) |
… | |
… | |
636 | } |
895 | } |
637 | else |
896 | else |
638 | return utime (filename, 0); |
897 | return utime (filename, 0); |
639 | } |
898 | } |
640 | |
899 | |
|
|
900 | #endif |
|
|
901 | |
|
|
902 | #ifndef HAVE_FUTIMES |
|
|
903 | |
|
|
904 | # undef futimes |
|
|
905 | # define futimes(fd,times) eio__futimes (fd, times) |
|
|
906 | |
|
|
907 | static int |
641 | static int eio__futimes (int fd, const struct timeval tv[2]) |
908 | eio__futimes (int fd, const struct timeval tv[2]) |
642 | { |
909 | { |
643 | errno = ENOSYS; |
910 | errno = ENOSYS; |
644 | return -1; |
911 | return -1; |
645 | } |
912 | } |
646 | |
913 | |
647 | #endif |
914 | #endif |
648 | |
915 | |
649 | #if !HAVE_FDATASYNC |
916 | #if !HAVE_FDATASYNC |
|
|
917 | # undef fdatasync |
650 | # define fdatasync fsync |
918 | # define fdatasync(fd) fsync (fd) |
651 | #endif |
919 | #endif |
|
|
920 | |
|
|
921 | /* sync_file_range always needs emulation */ |
|
|
922 | static int |
|
|
923 | eio__sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags) |
|
|
924 | { |
|
|
925 | #if HAVE_SYNC_FILE_RANGE |
|
|
926 | int res; |
|
|
927 | |
|
|
928 | if (EIO_SYNC_FILE_RANGE_WAIT_BEFORE != SYNC_FILE_RANGE_WAIT_BEFORE |
|
|
929 | || EIO_SYNC_FILE_RANGE_WRITE != SYNC_FILE_RANGE_WRITE |
|
|
930 | || EIO_SYNC_FILE_RANGE_WAIT_AFTER != SYNC_FILE_RANGE_WAIT_AFTER) |
|
|
931 | { |
|
|
932 | flags = 0 |
|
|
933 | | (flags & EIO_SYNC_FILE_RANGE_WAIT_BEFORE ? SYNC_FILE_RANGE_WAIT_BEFORE : 0) |
|
|
934 | | (flags & EIO_SYNC_FILE_RANGE_WRITE ? SYNC_FILE_RANGE_WRITE : 0) |
|
|
935 | | (flags & EIO_SYNC_FILE_RANGE_WAIT_AFTER ? SYNC_FILE_RANGE_WAIT_AFTER : 0); |
|
|
936 | } |
|
|
937 | |
|
|
938 | res = sync_file_range (fd, offset, nbytes, flags); |
|
|
939 | |
|
|
940 | if (!res || errno != ENOSYS) |
|
|
941 | return res; |
|
|
942 | #endif |
|
|
943 | |
|
|
944 | /* even though we could play tricks with the flags, it's better to always |
|
|
945 | * call fdatasync, as that matches the expectation of its users best */ |
|
|
946 | return fdatasync (fd); |
|
|
947 | } |
652 | |
948 | |
653 | #if !HAVE_READAHEAD |
949 | #if !HAVE_READAHEAD |
|
|
950 | # undef readahead |
654 | # define readahead(fd,offset,count) eio__readahead (fd, offset, count, self) |
951 | # define readahead(fd,offset,count) eio__readahead (fd, offset, count, self) |
655 | |
952 | |
656 | static ssize_t |
953 | static ssize_t |
657 | eio__readahead (int fd, off_t offset, size_t count, worker *self) |
954 | eio__readahead (int fd, off_t offset, size_t count, etp_worker *self) |
658 | { |
955 | { |
659 | size_t todo = count; |
956 | size_t todo = count; |
660 | dBUF; |
957 | dBUF; |
661 | |
958 | |
662 | while (todo > 0) |
959 | while (todo > 0) |
… | |
… | |
672 | return count; |
969 | return count; |
673 | } |
970 | } |
674 | |
971 | |
675 | #endif |
972 | #endif |
676 | |
973 | |
677 | #if !HAVE_READDIR_R |
|
|
678 | # define readdir_r eio__readdir_r |
|
|
679 | |
|
|
680 | static mutex_t readdirlock = X_MUTEX_INIT; |
|
|
681 | |
|
|
682 | static int |
|
|
683 | eio__readdir_r (DIR *dirp, EIO_STRUCT_DIRENT *ent, EIO_STRUCT_DIRENT **res) |
|
|
684 | { |
|
|
685 | EIO_STRUCT_DIRENT *e; |
|
|
686 | int errorno; |
|
|
687 | |
|
|
688 | X_LOCK (readdirlock); |
|
|
689 | |
|
|
690 | e = readdir (dirp); |
|
|
691 | errorno = errno; |
|
|
692 | |
|
|
693 | if (e) |
|
|
694 | { |
|
|
695 | *res = ent; |
|
|
696 | strcpy (ent->d_name, e->d_name); |
|
|
697 | } |
|
|
698 | else |
|
|
699 | *res = 0; |
|
|
700 | |
|
|
701 | X_UNLOCK (readdirlock); |
|
|
702 | |
|
|
703 | errno = errorno; |
|
|
704 | return e ? 0 : -1; |
|
|
705 | } |
|
|
706 | #endif |
|
|
707 | |
|
|
708 | /* sendfile always needs emulation */ |
974 | /* sendfile always needs emulation */ |
709 | static ssize_t |
975 | static ssize_t |
710 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count, worker *self) |
976 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self) |
711 | { |
977 | { |
|
|
978 | ssize_t written = 0; |
712 | ssize_t res; |
979 | ssize_t res; |
713 | |
980 | |
714 | if (!count) |
981 | if (!count) |
715 | return 0; |
982 | return 0; |
716 | |
983 | |
|
|
984 | for (;;) |
|
|
985 | { |
717 | #if HAVE_SENDFILE |
986 | #if HAVE_SENDFILE |
718 | # if __linux |
987 | # if __linux |
|
|
988 | off_t soffset = offset; |
719 | res = sendfile (ofd, ifd, &offset, count); |
989 | res = sendfile (ofd, ifd, &soffset, count); |
720 | |
990 | |
721 | # elif __freebsd |
991 | # elif __FreeBSD__ |
722 | /* |
992 | /* |
723 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
993 | * Of course, the freebsd sendfile is a dire hack with no thoughts |
724 | * wasted on making it similar to other I/O functions. |
994 | * wasted on making it similar to other I/O functions. |
725 | */ |
995 | */ |
726 | { |
|
|
727 | off_t sbytes; |
996 | off_t sbytes; |
728 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
997 | res = sendfile (ifd, ofd, offset, count, 0, &sbytes, 0); |
729 | |
998 | |
730 | if (res < 0 && sbytes) |
999 | #if 0 /* according to the manpage, this is correct, but broken behaviour */ |
731 | /* maybe only on EAGAIN: as usual, the manpage leaves you guessing */ |
1000 | /* freebsd' sendfile will return 0 on success */ |
|
|
1001 | /* freebsd 8 documents it as only setting *sbytes on EINTR and EAGAIN, but */ |
|
|
1002 | /* not on e.g. EIO or EPIPE - sounds broken */ |
|
|
1003 | if ((res < 0 && (errno == EAGAIN || errno == EINTR) && sbytes) || res == 0) |
732 | res = sbytes; |
1004 | res = sbytes; |
733 | } |
1005 | #endif |
|
|
1006 | |
|
|
1007 | /* according to source inspection, this is correct, and useful behaviour */ |
|
|
1008 | if (sbytes) |
|
|
1009 | res = sbytes; |
|
|
1010 | |
|
|
1011 | # elif defined (__APPLE__) |
|
|
1012 | off_t sbytes = count; |
|
|
1013 | res = sendfile (ifd, ofd, offset, &sbytes, 0, 0); |
|
|
1014 | |
|
|
1015 | /* according to the manpage, sbytes is always valid */ |
|
|
1016 | if (sbytes) |
|
|
1017 | res = sbytes; |
734 | |
1018 | |
735 | # elif __hpux |
1019 | # elif __hpux |
736 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
1020 | res = sendfile (ofd, ifd, offset, count, 0, 0); |
737 | |
1021 | |
738 | # elif __solaris |
1022 | # elif __solaris |
739 | { |
|
|
740 | struct sendfilevec vec; |
1023 | struct sendfilevec vec; |
741 | size_t sbytes; |
1024 | size_t sbytes; |
742 | |
1025 | |
743 | vec.sfv_fd = ifd; |
1026 | vec.sfv_fd = ifd; |
744 | vec.sfv_flag = 0; |
1027 | vec.sfv_flag = 0; |
745 | vec.sfv_off = offset; |
1028 | vec.sfv_off = offset; |
746 | vec.sfv_len = count; |
1029 | vec.sfv_len = count; |
747 | |
1030 | |
748 | res = sendfilev (ofd, &vec, 1, &sbytes); |
1031 | res = sendfilev (ofd, &vec, 1, &sbytes); |
749 | |
1032 | |
750 | if (res < 0 && sbytes) |
1033 | if (res < 0 && sbytes) |
751 | res = sbytes; |
1034 | res = sbytes; |
752 | } |
|
|
753 | |
1035 | |
754 | # endif |
1036 | # endif |
|
|
1037 | |
|
|
1038 | #elif defined (_WIN32) |
|
|
1039 | /* does not work, just for documentation of what would need to be done */ |
|
|
1040 | /* actually, cannot be done like this, as TransmitFile changes the file offset, */ |
|
|
1041 | /* libeio guarantees that the file offset does not change, and windows */ |
|
|
1042 | /* has no way to get an independent handle to the same file description */ |
|
|
1043 | HANDLE h = TO_SOCKET (ifd); |
|
|
1044 | SetFilePointer (h, offset, 0, FILE_BEGIN); |
|
|
1045 | res = TransmitFile (TO_SOCKET (ofd), h, count, 0, 0, 0, 0); |
|
|
1046 | |
755 | #else |
1047 | #else |
756 | res = -1; |
1048 | res = -1; |
757 | errno = ENOSYS; |
1049 | errno = ENOSYS; |
758 | #endif |
1050 | #endif |
759 | |
1051 | |
|
|
1052 | /* we assume sendfile can copy at least 128mb in one go */ |
|
|
1053 | if (res <= 128 * 1024 * 1024) |
|
|
1054 | { |
|
|
1055 | if (res > 0) |
|
|
1056 | written += res; |
|
|
1057 | |
|
|
1058 | if (written) |
|
|
1059 | return written; |
|
|
1060 | |
|
|
1061 | break; |
|
|
1062 | } |
|
|
1063 | else |
|
|
1064 | { |
|
|
1065 | /* if we requested more, then probably the kernel was lazy */ |
|
|
1066 | written += res; |
|
|
1067 | offset += res; |
|
|
1068 | count -= res; |
|
|
1069 | |
|
|
1070 | if (!count) |
|
|
1071 | return written; |
|
|
1072 | } |
|
|
1073 | } |
|
|
1074 | |
760 | if (res < 0 |
1075 | if (res < 0 |
761 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
1076 | && (errno == ENOSYS || errno == EINVAL || errno == ENOTSOCK |
|
|
1077 | /* BSDs */ |
|
|
1078 | #ifdef ENOTSUP /* sigh, if the steenking pile called openbsd would only try to at least compile posix code... */ |
|
|
1079 | || errno == ENOTSUP |
|
|
1080 | #endif |
|
|
1081 | || errno == EOPNOTSUPP /* BSDs */ |
762 | #if __solaris |
1082 | #if __solaris |
763 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
1083 | || errno == EAFNOSUPPORT || errno == EPROTOTYPE |
764 | #endif |
1084 | #endif |
765 | ) |
1085 | ) |
766 | ) |
1086 | ) |
… | |
… | |
797 | } |
1117 | } |
798 | |
1118 | |
799 | return res; |
1119 | return res; |
800 | } |
1120 | } |
801 | |
1121 | |
|
|
1122 | static signed char |
|
|
1123 | eio_dent_cmp (const eio_dirent *a, const eio_dirent *b) |
|
|
1124 | { |
|
|
1125 | return a->score - b->score ? a->score - b->score /* works because our signed char is always 0..100 */ |
|
|
1126 | : a->inode < b->inode ? -1 |
|
|
1127 | : a->inode > b->inode ? 1 |
|
|
1128 | : 0; |
|
|
1129 | } |
|
|
1130 | |
|
|
1131 | #define EIO_DENT_CMP(i,op,j) eio_dent_cmp (&i, &j) op 0 |
|
|
1132 | |
|
|
1133 | #define EIO_SORT_CUTOFF 30 /* quite high, but performs well on many filesystems */ |
|
|
1134 | #define EIO_SORT_FAST 60 /* when to only use insertion sort */ |
|
|
1135 | |
|
|
1136 | static void |
|
|
1137 | eio_dent_radix_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
|
|
1138 | { |
|
|
1139 | unsigned char bits [9 + sizeof (ino_t) * 8]; |
|
|
1140 | unsigned char *bit = bits; |
|
|
1141 | |
|
|
1142 | assert (CHAR_BIT == 8); |
|
|
1143 | assert (sizeof (eio_dirent) * 8 < 256); |
|
|
1144 | assert (offsetof (eio_dirent, inode)); /* we use bit #0 as sentinel */ |
|
|
1145 | assert (offsetof (eio_dirent, score)); /* we use bit #0 as sentinel */ |
|
|
1146 | |
|
|
1147 | if (size <= EIO_SORT_FAST) |
|
|
1148 | return; |
|
|
1149 | |
|
|
1150 | /* first prepare an array of bits to test in our radix sort */ |
|
|
1151 | /* try to take endianness into account, as well as differences in ino_t sizes */ |
|
|
1152 | /* inode_bits must contain all inodes ORed together */ |
|
|
1153 | /* which is used to skip bits that are 0 everywhere, which is very common */ |
|
|
1154 | { |
|
|
1155 | ino_t endianness; |
|
|
1156 | int i, j; |
|
|
1157 | |
|
|
1158 | /* we store the byte offset of byte n into byte n of "endianness" */ |
|
|
1159 | for (i = 0; i < sizeof (ino_t); ++i) |
|
|
1160 | ((unsigned char *)&endianness)[i] = i; |
|
|
1161 | |
|
|
1162 | *bit++ = 0; |
|
|
1163 | |
|
|
1164 | for (i = 0; i < sizeof (ino_t); ++i) |
|
|
1165 | { |
|
|
1166 | /* shifting off the byte offsets out of "endianness" */ |
|
|
1167 | int offs = (offsetof (eio_dirent, inode) + (endianness & 0xff)) * 8; |
|
|
1168 | endianness >>= 8; |
|
|
1169 | |
|
|
1170 | for (j = 0; j < 8; ++j) |
|
|
1171 | if (inode_bits & (((ino_t)1) << (i * 8 + j))) |
|
|
1172 | *bit++ = offs + j; |
|
|
1173 | } |
|
|
1174 | |
|
|
1175 | for (j = 0; j < 8; ++j) |
|
|
1176 | if (score_bits & (1 << j)) |
|
|
1177 | *bit++ = offsetof (eio_dirent, score) * 8 + j; |
|
|
1178 | } |
|
|
1179 | |
|
|
1180 | /* now actually do the sorting (a variant of MSD radix sort) */ |
|
|
1181 | { |
|
|
1182 | eio_dirent *base_stk [9 + sizeof (ino_t) * 8], *base; |
|
|
1183 | eio_dirent *end_stk [9 + sizeof (ino_t) * 8], *end; |
|
|
1184 | unsigned char *bit_stk [9 + sizeof (ino_t) * 8]; |
|
|
1185 | int stk_idx = 0; |
|
|
1186 | |
|
|
1187 | base_stk [stk_idx] = dents; |
|
|
1188 | end_stk [stk_idx] = dents + size; |
|
|
1189 | bit_stk [stk_idx] = bit - 1; |
|
|
1190 | |
|
|
1191 | do |
|
|
1192 | { |
|
|
1193 | base = base_stk [stk_idx]; |
|
|
1194 | end = end_stk [stk_idx]; |
|
|
1195 | bit = bit_stk [stk_idx]; |
|
|
1196 | |
|
|
1197 | for (;;) |
|
|
1198 | { |
|
|
1199 | unsigned char O = *bit >> 3; |
|
|
1200 | unsigned char M = 1 << (*bit & 7); |
|
|
1201 | |
|
|
1202 | eio_dirent *a = base; |
|
|
1203 | eio_dirent *b = end; |
|
|
1204 | |
|
|
1205 | if (b - a < EIO_SORT_CUTOFF) |
|
|
1206 | break; |
|
|
1207 | |
|
|
1208 | /* now bit-partition the array on the bit */ |
|
|
1209 | /* this ugly asymmetric loop seems to perform much better than typical */ |
|
|
1210 | /* partition algos found in the literature */ |
|
|
1211 | do |
|
|
1212 | if (!(((unsigned char *)a)[O] & M)) |
|
|
1213 | ++a; |
|
|
1214 | else if (!(((unsigned char *)--b)[O] & M)) |
|
|
1215 | { |
|
|
1216 | eio_dirent tmp = *a; *a = *b; *b = tmp; |
|
|
1217 | ++a; |
|
|
1218 | } |
|
|
1219 | while (b > a); |
|
|
1220 | |
|
|
1221 | /* next bit, or stop, if no bits left in this path */ |
|
|
1222 | if (!*--bit) |
|
|
1223 | break; |
|
|
1224 | |
|
|
1225 | base_stk [stk_idx] = a; |
|
|
1226 | end_stk [stk_idx] = end; |
|
|
1227 | bit_stk [stk_idx] = bit; |
|
|
1228 | ++stk_idx; |
|
|
1229 | |
|
|
1230 | end = a; |
|
|
1231 | } |
|
|
1232 | } |
|
|
1233 | while (stk_idx--); |
|
|
1234 | } |
|
|
1235 | } |
|
|
1236 | |
|
|
1237 | static void |
|
|
1238 | eio_dent_insertion_sort (eio_dirent *dents, int size) |
|
|
1239 | { |
|
|
1240 | /* first move the smallest element to the front, to act as a sentinel */ |
|
|
1241 | { |
|
|
1242 | int i; |
|
|
1243 | eio_dirent *min = dents; |
|
|
1244 | |
|
|
1245 | /* the radix pre-pass ensures that the minimum element is in the first EIO_SORT_CUTOFF + 1 elements */ |
|
|
1246 | for (i = size > EIO_SORT_FAST ? EIO_SORT_CUTOFF + 1 : size; --i; ) |
|
|
1247 | if (EIO_DENT_CMP (dents [i], <, *min)) |
|
|
1248 | min = &dents [i]; |
|
|
1249 | |
|
|
1250 | /* swap elements 0 and j (minimum) */ |
|
|
1251 | { |
|
|
1252 | eio_dirent tmp = *dents; *dents = *min; *min = tmp; |
|
|
1253 | } |
|
|
1254 | } |
|
|
1255 | |
|
|
1256 | /* then do standard insertion sort, assuming that all elements are >= dents [0] */ |
|
|
1257 | { |
|
|
1258 | eio_dirent *i, *j; |
|
|
1259 | |
|
|
1260 | for (i = dents + 1; i < dents + size; ++i) |
|
|
1261 | { |
|
|
1262 | eio_dirent value = *i; |
|
|
1263 | |
|
|
1264 | for (j = i - 1; EIO_DENT_CMP (*j, >, value); --j) |
|
|
1265 | j [1] = j [0]; |
|
|
1266 | |
|
|
1267 | j [1] = value; |
|
|
1268 | } |
|
|
1269 | } |
|
|
1270 | } |
|
|
1271 | |
|
|
1272 | static void |
|
|
1273 | eio_dent_sort (eio_dirent *dents, int size, signed char score_bits, ino_t inode_bits) |
|
|
1274 | { |
|
|
1275 | if (size <= 1) |
|
|
1276 | return; /* our insertion sort relies on size > 0 */ |
|
|
1277 | |
|
|
1278 | /* first we use a radix sort, but only for dirs >= EIO_SORT_FAST */ |
|
|
1279 | /* and stop sorting when the partitions are <= EIO_SORT_CUTOFF */ |
|
|
1280 | eio_dent_radix_sort (dents, size, score_bits, inode_bits); |
|
|
1281 | |
|
|
1282 | /* use an insertion sort at the end, or for small arrays, */ |
|
|
1283 | /* as insertion sort is more efficient for small partitions */ |
|
|
1284 | eio_dent_insertion_sort (dents, size); |
|
|
1285 | } |
|
|
1286 | |
802 | /* read a full directory */ |
1287 | /* read a full directory */ |
803 | static void |
1288 | static void |
804 | eio__scandir (eio_req *req, worker *self) |
1289 | eio__scandir (eio_req *req, etp_worker *self) |
805 | { |
1290 | { |
806 | DIR *dirp; |
1291 | DIR *dirp; |
807 | union |
|
|
808 | { |
|
|
809 | EIO_STRUCT_DIRENT d; |
|
|
810 | char b [offsetof (EIO_STRUCT_DIRENT, d_name) + NAME_MAX + 1]; |
|
|
811 | } *u; |
|
|
812 | EIO_STRUCT_DIRENT *entp; |
1292 | EIO_STRUCT_DIRENT *entp; |
813 | char *name, *names; |
1293 | char *name, *names; |
814 | int memlen = 4096; |
1294 | int namesalloc = 4096; |
815 | int memofs = 0; |
1295 | int namesoffs = 0; |
|
|
1296 | int flags = req->int1; |
|
|
1297 | eio_dirent *dents = 0; |
|
|
1298 | int dentalloc = 128; |
816 | int res = 0; |
1299 | int dentoffs = 0; |
|
|
1300 | ino_t inode_bits = 0; |
817 | |
1301 | |
|
|
1302 | req->result = -1; |
|
|
1303 | |
|
|
1304 | if (!(flags & EIO_READDIR_DENTS)) |
|
|
1305 | flags &= ~(EIO_READDIR_DIRS_FIRST | EIO_READDIR_STAT_ORDER); |
|
|
1306 | |
818 | X_LOCK (etplock); |
1307 | X_LOCK (wrklock); |
|
|
1308 | /* the corresponding closedir is in ETP_WORKER_CLEAR */ |
819 | self->dirp = dirp = opendir (req->ptr1); |
1309 | self->dirp = dirp = opendir (req->ptr1); |
820 | self->dbuf = u = malloc (sizeof (*u)); |
1310 | |
821 | req->flags |= EIO_FLAG_PTR2_FREE; |
1311 | if (req->flags & EIO_FLAG_PTR1_FREE) |
|
|
1312 | free (req->ptr1); |
|
|
1313 | |
|
|
1314 | req->flags |= EIO_FLAG_PTR1_FREE | EIO_FLAG_PTR2_FREE; |
|
|
1315 | req->ptr1 = dents = flags ? malloc (dentalloc * sizeof (eio_dirent)) : 0; |
822 | req->ptr2 = names = malloc (memlen); |
1316 | req->ptr2 = names = malloc (namesalloc); |
823 | X_UNLOCK (etplock); |
1317 | X_UNLOCK (wrklock); |
824 | |
1318 | |
825 | if (dirp && u && names) |
1319 | if (dirp && names && (!flags || dents)) |
826 | for (;;) |
1320 | for (;;) |
827 | { |
1321 | { |
828 | errno = 0; |
1322 | errno = 0; |
829 | readdir_r (dirp, &u->d, &entp); |
1323 | entp = readdir (dirp); |
830 | |
1324 | |
831 | if (!entp) |
1325 | if (!entp) |
|
|
1326 | { |
|
|
1327 | if (errno) |
|
|
1328 | break; |
|
|
1329 | |
|
|
1330 | /* sort etc. */ |
|
|
1331 | req->int1 = flags; |
|
|
1332 | req->result = dentoffs; |
|
|
1333 | |
|
|
1334 | if (flags & EIO_READDIR_STAT_ORDER) |
|
|
1335 | eio_dent_sort (dents, dentoffs, flags & EIO_READDIR_DIRS_FIRST ? 7 : 0, inode_bits); |
|
|
1336 | else if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1337 | if (flags & EIO_READDIR_FOUND_UNKNOWN) |
|
|
1338 | eio_dent_sort (dents, dentoffs, 7, inode_bits); /* sort by score and inode */ |
|
|
1339 | else |
|
|
1340 | { |
|
|
1341 | /* in this case, all is known, and we just put dirs first and sort them */ |
|
|
1342 | eio_dirent *oth = dents + dentoffs; |
|
|
1343 | eio_dirent *dir = dents; |
|
|
1344 | |
|
|
1345 | /* now partition dirs to the front, and non-dirs to the back */ |
|
|
1346 | /* by walking from both sides and swapping if necessary */ |
|
|
1347 | while (oth > dir) |
|
|
1348 | { |
|
|
1349 | if (dir->type == EIO_DT_DIR) |
|
|
1350 | ++dir; |
|
|
1351 | else if ((--oth)->type == EIO_DT_DIR) |
|
|
1352 | { |
|
|
1353 | eio_dirent tmp = *dir; *dir = *oth; *oth = tmp; |
|
|
1354 | |
|
|
1355 | ++dir; |
|
|
1356 | } |
|
|
1357 | } |
|
|
1358 | |
|
|
1359 | /* now sort the dirs only (dirs all have the same score) */ |
|
|
1360 | eio_dent_sort (dents, dir - dents, 0, inode_bits); |
|
|
1361 | } |
|
|
1362 | |
832 | break; |
1363 | break; |
|
|
1364 | } |
833 | |
1365 | |
|
|
1366 | /* now add the entry to our list(s) */ |
834 | name = entp->d_name; |
1367 | name = entp->d_name; |
835 | |
1368 | |
|
|
1369 | /* skip . and .. entries */ |
836 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
1370 | if (name [0] != '.' || (name [1] && (name [1] != '.' || name [2]))) |
837 | { |
1371 | { |
838 | int len = strlen (name) + 1; |
1372 | int len = D_NAMLEN (entp) + 1; |
839 | |
1373 | |
840 | res++; |
1374 | while (ecb_expect_false (namesoffs + len > namesalloc)) |
841 | |
|
|
842 | while (memofs + len > memlen) |
|
|
843 | { |
1375 | { |
844 | memlen *= 2; |
1376 | namesalloc *= 2; |
845 | X_LOCK (etplock); |
1377 | X_LOCK (wrklock); |
846 | req->ptr2 = names = realloc (names, memlen); |
1378 | req->ptr2 = names = realloc (names, namesalloc); |
847 | X_UNLOCK (etplock); |
1379 | X_UNLOCK (wrklock); |
848 | |
1380 | |
849 | if (!names) |
1381 | if (!names) |
850 | break; |
1382 | break; |
851 | } |
1383 | } |
852 | |
1384 | |
853 | memcpy (names + memofs, name, len); |
1385 | memcpy (names + namesoffs, name, len); |
|
|
1386 | |
|
|
1387 | if (dents) |
|
|
1388 | { |
|
|
1389 | struct eio_dirent *ent; |
|
|
1390 | |
|
|
1391 | if (ecb_expect_false (dentoffs == dentalloc)) |
|
|
1392 | { |
|
|
1393 | dentalloc *= 2; |
|
|
1394 | X_LOCK (wrklock); |
|
|
1395 | req->ptr1 = dents = realloc (dents, dentalloc * sizeof (eio_dirent)); |
|
|
1396 | X_UNLOCK (wrklock); |
|
|
1397 | |
|
|
1398 | if (!dents) |
|
|
1399 | break; |
|
|
1400 | } |
|
|
1401 | |
|
|
1402 | ent = dents + dentoffs; |
|
|
1403 | |
|
|
1404 | ent->nameofs = namesoffs; /* rather dirtily we store the offset in the pointer */ |
|
|
1405 | ent->namelen = len - 1; |
|
|
1406 | ent->inode = D_INO (entp); |
|
|
1407 | |
|
|
1408 | inode_bits |= ent->inode; |
|
|
1409 | |
|
|
1410 | switch (D_TYPE (entp)) |
|
|
1411 | { |
|
|
1412 | default: |
|
|
1413 | ent->type = EIO_DT_UNKNOWN; |
|
|
1414 | flags |= EIO_READDIR_FOUND_UNKNOWN; |
|
|
1415 | break; |
|
|
1416 | |
|
|
1417 | #ifdef DT_FIFO |
|
|
1418 | case DT_FIFO: ent->type = EIO_DT_FIFO; break; |
|
|
1419 | #endif |
|
|
1420 | #ifdef DT_CHR |
|
|
1421 | case DT_CHR: ent->type = EIO_DT_CHR; break; |
|
|
1422 | #endif |
|
|
1423 | #ifdef DT_MPC |
|
|
1424 | case DT_MPC: ent->type = EIO_DT_MPC; break; |
|
|
1425 | #endif |
|
|
1426 | #ifdef DT_DIR |
|
|
1427 | case DT_DIR: ent->type = EIO_DT_DIR; break; |
|
|
1428 | #endif |
|
|
1429 | #ifdef DT_NAM |
|
|
1430 | case DT_NAM: ent->type = EIO_DT_NAM; break; |
|
|
1431 | #endif |
|
|
1432 | #ifdef DT_BLK |
|
|
1433 | case DT_BLK: ent->type = EIO_DT_BLK; break; |
|
|
1434 | #endif |
|
|
1435 | #ifdef DT_MPB |
|
|
1436 | case DT_MPB: ent->type = EIO_DT_MPB; break; |
|
|
1437 | #endif |
|
|
1438 | #ifdef DT_REG |
|
|
1439 | case DT_REG: ent->type = EIO_DT_REG; break; |
|
|
1440 | #endif |
|
|
1441 | #ifdef DT_NWK |
|
|
1442 | case DT_NWK: ent->type = EIO_DT_NWK; break; |
|
|
1443 | #endif |
|
|
1444 | #ifdef DT_CMP |
|
|
1445 | case DT_CMP: ent->type = EIO_DT_CMP; break; |
|
|
1446 | #endif |
|
|
1447 | #ifdef DT_LNK |
|
|
1448 | case DT_LNK: ent->type = EIO_DT_LNK; break; |
|
|
1449 | #endif |
|
|
1450 | #ifdef DT_SOCK |
|
|
1451 | case DT_SOCK: ent->type = EIO_DT_SOCK; break; |
|
|
1452 | #endif |
|
|
1453 | #ifdef DT_DOOR |
|
|
1454 | case DT_DOOR: ent->type = EIO_DT_DOOR; break; |
|
|
1455 | #endif |
|
|
1456 | #ifdef DT_WHT |
|
|
1457 | case DT_WHT: ent->type = EIO_DT_WHT; break; |
|
|
1458 | #endif |
|
|
1459 | } |
|
|
1460 | |
|
|
1461 | ent->score = 7; |
|
|
1462 | |
|
|
1463 | if (flags & EIO_READDIR_DIRS_FIRST) |
|
|
1464 | { |
|
|
1465 | if (ent->type == EIO_DT_UNKNOWN) |
|
|
1466 | { |
|
|
1467 | if (*name == '.') /* leading dots are likely directories, and, in any case, rare */ |
|
|
1468 | ent->score = 1; |
|
|
1469 | else if (!strchr (name, '.')) /* absense of dots indicate likely dirs */ |
|
|
1470 | ent->score = len <= 2 ? 4 - len : len <= 4 ? 4 : len <= 7 ? 5 : 6; /* shorter == more likely dir, but avoid too many classes */ |
|
|
1471 | } |
|
|
1472 | else if (ent->type == EIO_DT_DIR) |
|
|
1473 | ent->score = 0; |
|
|
1474 | } |
|
|
1475 | } |
|
|
1476 | |
854 | memofs += len; |
1477 | namesoffs += len; |
|
|
1478 | ++dentoffs; |
|
|
1479 | } |
|
|
1480 | |
|
|
1481 | if (EIO_CANCELLED (req)) |
|
|
1482 | { |
|
|
1483 | errno = ECANCELED; |
|
|
1484 | break; |
855 | } |
1485 | } |
856 | } |
1486 | } |
|
|
1487 | } |
857 | |
1488 | |
858 | if (errno) |
1489 | #ifdef PAGESIZE |
859 | res = -1; |
1490 | # define eio_pagesize() PAGESIZE |
|
|
1491 | #else |
|
|
1492 | static intptr_t |
|
|
1493 | eio_pagesize (void) |
|
|
1494 | { |
|
|
1495 | static intptr_t page; |
|
|
1496 | |
|
|
1497 | if (!page) |
|
|
1498 | page = sysconf (_SC_PAGESIZE); |
|
|
1499 | |
|
|
1500 | return page; |
|
|
1501 | } |
|
|
1502 | #endif |
|
|
1503 | |
|
|
1504 | static void |
|
|
1505 | eio_page_align (void **addr, size_t *length) |
|
|
1506 | { |
|
|
1507 | intptr_t mask = eio_pagesize () - 1; |
|
|
1508 | |
|
|
1509 | /* round down addr */ |
|
|
1510 | intptr_t adj = mask & (intptr_t)*addr; |
|
|
1511 | |
|
|
1512 | *addr = (void *)((intptr_t)*addr - adj); |
|
|
1513 | *length += adj; |
|
|
1514 | |
|
|
1515 | /* round up length */ |
|
|
1516 | *length = (*length + mask) & ~mask; |
|
|
1517 | } |
|
|
1518 | |
|
|
1519 | #if !_POSIX_MEMLOCK |
|
|
1520 | # define eio__mlockall(a) ((errno = ENOSYS), -1) |
|
|
1521 | #else |
|
|
1522 | |
|
|
1523 | static int |
|
|
1524 | eio__mlockall (int flags) |
|
|
1525 | { |
|
|
1526 | #if __GLIBC__ == 2 && __GLIBC_MINOR__ <= 7 |
|
|
1527 | extern int mallopt (int, int); |
|
|
1528 | mallopt (-6, 238); /* http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=473812 */ |
|
|
1529 | #endif |
|
|
1530 | |
|
|
1531 | if (EIO_MCL_CURRENT != MCL_CURRENT |
|
|
1532 | || EIO_MCL_FUTURE != MCL_FUTURE) |
|
|
1533 | { |
|
|
1534 | flags = 0 |
|
|
1535 | | (flags & EIO_MCL_CURRENT ? MCL_CURRENT : 0) |
|
|
1536 | | (flags & EIO_MCL_FUTURE ? MCL_FUTURE : 0); |
|
|
1537 | } |
|
|
1538 | |
|
|
1539 | return mlockall (flags); |
|
|
1540 | } |
|
|
1541 | #endif |
|
|
1542 | |
|
|
1543 | #if !_POSIX_MEMLOCK_RANGE |
|
|
1544 | # define eio__mlock(a,b) ((errno = ENOSYS), -1) |
|
|
1545 | #else |
|
|
1546 | |
|
|
1547 | static int |
|
|
1548 | eio__mlock (void *addr, size_t length) |
|
|
1549 | { |
|
|
1550 | eio_page_align (&addr, &length); |
|
|
1551 | |
|
|
1552 | return mlock (addr, length); |
|
|
1553 | } |
|
|
1554 | |
|
|
1555 | #endif |
|
|
1556 | |
|
|
1557 | #if !(_POSIX_MAPPED_FILES && _POSIX_SYNCHRONIZED_IO) |
|
|
1558 | # define eio__msync(a,b,c) ((errno = ENOSYS), -1) |
|
|
1559 | #else |
|
|
1560 | |
|
|
1561 | static int |
|
|
1562 | eio__msync (void *mem, size_t len, int flags) |
|
|
1563 | { |
|
|
1564 | eio_page_align (&mem, &len); |
|
|
1565 | |
|
|
1566 | if (EIO_MS_ASYNC != MS_SYNC |
|
|
1567 | || EIO_MS_INVALIDATE != MS_INVALIDATE |
|
|
1568 | || EIO_MS_SYNC != MS_SYNC) |
|
|
1569 | { |
|
|
1570 | flags = 0 |
|
|
1571 | | (flags & EIO_MS_ASYNC ? MS_ASYNC : 0) |
|
|
1572 | | (flags & EIO_MS_INVALIDATE ? MS_INVALIDATE : 0) |
|
|
1573 | | (flags & EIO_MS_SYNC ? MS_SYNC : 0); |
|
|
1574 | } |
|
|
1575 | |
|
|
1576 | return msync (mem, len, flags); |
|
|
1577 | } |
|
|
1578 | |
|
|
1579 | #endif |
|
|
1580 | |
|
|
1581 | static int |
|
|
1582 | eio__mtouch (eio_req *req) |
|
|
1583 | { |
|
|
1584 | void *mem = req->ptr2; |
|
|
1585 | size_t len = req->size; |
|
|
1586 | int flags = req->int1; |
|
|
1587 | |
|
|
1588 | eio_page_align (&mem, &len); |
|
|
1589 | |
860 | |
1590 | { |
861 | req->result = res; |
1591 | intptr_t addr = (intptr_t)mem; |
|
|
1592 | intptr_t end = addr + len; |
|
|
1593 | intptr_t page = eio_pagesize (); |
|
|
1594 | |
|
|
1595 | if (addr < end) |
|
|
1596 | if (flags & EIO_MT_MODIFY) /* modify */ |
|
|
1597 | do { *((volatile sig_atomic_t *)addr) |= 0; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
|
|
1598 | else |
|
|
1599 | do { *((volatile sig_atomic_t *)addr) ; } while ((addr += page) < len && !EIO_CANCELLED (req)); |
|
|
1600 | } |
|
|
1601 | |
|
|
1602 | return 0; |
862 | } |
1603 | } |
863 | |
1604 | |
864 | /*****************************************************************************/ |
1605 | /*****************************************************************************/ |
865 | |
1606 | |
866 | #define ALLOC(len) \ |
1607 | #define ALLOC(len) \ |
867 | if (!req->ptr2) \ |
1608 | if (!req->ptr2) \ |
868 | { \ |
1609 | { \ |
869 | X_LOCK (etplock); \ |
1610 | X_LOCK (wrklock); \ |
870 | req->flags |= EIO_FLAG_PTR2_FREE; \ |
1611 | req->flags |= EIO_FLAG_PTR2_FREE; \ |
871 | X_UNLOCK (etplock); \ |
1612 | X_UNLOCK (wrklock); \ |
872 | req->ptr2 = malloc (len); \ |
1613 | req->ptr2 = malloc (len); \ |
873 | if (!req->ptr2) \ |
1614 | if (!req->ptr2) \ |
874 | { \ |
1615 | { \ |
875 | errno = ENOMEM; \ |
1616 | errno = ENOMEM; \ |
876 | req->result = -1; \ |
1617 | req->result = -1; \ |
877 | break; \ |
1618 | break; \ |
878 | } \ |
1619 | } \ |
879 | } |
1620 | } |
880 | |
1621 | |
881 | X_THREAD_PROC (eio_proc) |
1622 | X_THREAD_PROC (etp_proc) |
882 | { |
1623 | { |
883 | eio_req *req; |
1624 | ETP_REQ *req; |
884 | struct timespec ts; |
1625 | struct timespec ts; |
885 | worker *self = (worker *)thr_arg; |
1626 | etp_worker *self = (etp_worker *)thr_arg; |
886 | |
1627 | |
887 | /* try to distribute timeouts somewhat randomly */ |
1628 | /* try to distribute timeouts somewhat randomly */ |
888 | ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); |
1629 | ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); |
889 | |
1630 | |
890 | for (;;) |
1631 | for (;;) |
891 | { |
1632 | { |
892 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
|
|
893 | |
|
|
894 | X_LOCK (reqlock); |
1633 | X_LOCK (reqlock); |
895 | |
1634 | |
896 | for (;;) |
1635 | for (;;) |
897 | { |
1636 | { |
898 | self->req = req = reqq_shift (&req_queue); |
1637 | self->req = req = reqq_shift (&req_queue); |
… | |
… | |
900 | if (req) |
1639 | if (req) |
901 | break; |
1640 | break; |
902 | |
1641 | |
903 | ++idle; |
1642 | ++idle; |
904 | |
1643 | |
|
|
1644 | ts.tv_sec = time (0) + idle_timeout; |
905 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
1645 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
906 | { |
1646 | { |
907 | if (idle > max_idle) |
1647 | if (idle > max_idle) |
908 | { |
1648 | { |
909 | --idle; |
1649 | --idle; |
910 | X_UNLOCK (reqlock); |
1650 | X_UNLOCK (reqlock); |
911 | X_LOCK (etplock); |
1651 | X_LOCK (wrklock); |
912 | --started; |
1652 | --started; |
913 | X_UNLOCK (etplock); |
1653 | X_UNLOCK (wrklock); |
914 | goto quit; |
1654 | goto quit; |
915 | } |
1655 | } |
916 | |
1656 | |
917 | /* we are allowed to idle, so do so without any timeout */ |
1657 | /* we are allowed to idle, so do so without any timeout */ |
918 | X_COND_WAIT (reqwait, reqlock); |
1658 | X_COND_WAIT (reqwait, reqlock); |
919 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
|
|
920 | } |
1659 | } |
921 | |
1660 | |
922 | --idle; |
1661 | --idle; |
923 | } |
1662 | } |
924 | |
1663 | |
925 | --nready; |
1664 | --nready; |
926 | |
1665 | |
927 | X_UNLOCK (reqlock); |
1666 | X_UNLOCK (reqlock); |
928 | |
1667 | |
929 | errno = 0; /* strictly unnecessary */ |
1668 | if (req->type < 0) |
|
|
1669 | goto quit; |
930 | |
1670 | |
931 | if (!EIO_CANCELLED (req)) |
1671 | if (!EIO_CANCELLED (req)) |
932 | switch (req->type) |
1672 | ETP_EXECUTE (self, req); |
933 | { |
|
|
934 | case EIO_READ: ALLOC (req->size); |
|
|
935 | req->result = req->offs >= 0 |
|
|
936 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
|
|
937 | : read (req->int1, req->ptr2, req->size); break; |
|
|
938 | case EIO_WRITE: req->result = req->offs >= 0 |
|
|
939 | ? pwrite (req->int1, req->ptr2, req->size, req->offs) |
|
|
940 | : write (req->int1, req->ptr2, req->size); break; |
|
|
941 | |
|
|
942 | case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break; |
|
|
943 | case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break; |
|
|
944 | |
|
|
945 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
946 | req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
947 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
948 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
949 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
950 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
951 | |
|
|
952 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
|
|
953 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
|
|
954 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
|
|
955 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
|
|
956 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
|
|
957 | case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break; |
|
|
958 | |
|
|
959 | case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break; |
|
|
960 | case EIO_CLOSE: req->result = close (req->int1); break; |
|
|
961 | case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break; |
|
|
962 | case EIO_UNLINK: req->result = unlink (req->ptr1); break; |
|
|
963 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
|
|
964 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
|
|
965 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
|
|
966 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
|
|
967 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
|
|
968 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
|
|
969 | |
|
|
970 | case EIO_READLINK: ALLOC (NAME_MAX); |
|
|
971 | req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; |
|
|
972 | |
|
|
973 | case EIO_SYNC: req->result = 0; sync (); break; |
|
|
974 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
|
|
975 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
|
|
976 | |
|
|
977 | case EIO_READDIR: eio__scandir (req, self); break; |
|
|
978 | |
|
|
979 | case EIO_BUSY: |
|
|
980 | #ifdef _WIN32 |
|
|
981 | Sleep (req->nv1 * 1000.); |
|
|
982 | #else |
|
|
983 | { |
|
|
984 | struct timeval tv; |
|
|
985 | |
|
|
986 | tv.tv_sec = req->nv1; |
|
|
987 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; |
|
|
988 | |
|
|
989 | req->result = select (0, 0, 0, 0, &tv); |
|
|
990 | } |
|
|
991 | #endif |
|
|
992 | break; |
|
|
993 | |
|
|
994 | case EIO_UTIME: |
|
|
995 | case EIO_FUTIME: |
|
|
996 | { |
|
|
997 | struct timeval tv[2]; |
|
|
998 | struct timeval *times; |
|
|
999 | |
|
|
1000 | if (req->nv1 != -1. || req->nv2 != -1.) |
|
|
1001 | { |
|
|
1002 | tv[0].tv_sec = req->nv1; |
|
|
1003 | tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.; |
|
|
1004 | tv[1].tv_sec = req->nv2; |
|
|
1005 | tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.; |
|
|
1006 | |
|
|
1007 | times = tv; |
|
|
1008 | } |
|
|
1009 | else |
|
|
1010 | times = 0; |
|
|
1011 | |
|
|
1012 | |
|
|
1013 | req->result = req->type == EIO_FUTIME |
|
|
1014 | ? futimes (req->int1, times) |
|
|
1015 | : utimes (req->ptr1, times); |
|
|
1016 | } |
|
|
1017 | |
|
|
1018 | case EIO_GROUP: |
|
|
1019 | case EIO_NOP: |
|
|
1020 | req->result = 0; |
|
|
1021 | break; |
|
|
1022 | |
|
|
1023 | case EIO_QUIT: |
|
|
1024 | goto quit; |
|
|
1025 | |
|
|
1026 | default: |
|
|
1027 | req->result = -1; |
|
|
1028 | break; |
|
|
1029 | } |
|
|
1030 | |
|
|
1031 | req->errorno = errno; |
|
|
1032 | |
1673 | |
1033 | X_LOCK (reslock); |
1674 | X_LOCK (reslock); |
1034 | |
1675 | |
1035 | ++npending; |
1676 | ++npending; |
1036 | |
1677 | |
1037 | if (!reqq_push (&res_queue, req) && etp.want_poll_cb) |
1678 | if (!reqq_push (&res_queue, req) && want_poll_cb) |
1038 | etp.want_poll_cb (); |
1679 | want_poll_cb (); |
1039 | |
1680 | |
1040 | self->req = 0; |
1681 | self->req = 0; |
1041 | worker_clear (self); |
1682 | etp_worker_clear (self); |
1042 | |
1683 | |
1043 | X_UNLOCK (reslock); |
1684 | X_UNLOCK (reslock); |
1044 | } |
1685 | } |
1045 | |
1686 | |
1046 | quit: |
1687 | quit: |
1047 | X_LOCK (etplock); |
1688 | X_LOCK (wrklock); |
1048 | worker_free (self); |
1689 | etp_worker_free (self); |
1049 | X_UNLOCK (etplock); |
1690 | X_UNLOCK (wrklock); |
1050 | |
1691 | |
1051 | return 0; |
1692 | return 0; |
1052 | } |
1693 | } |
1053 | |
1694 | |
1054 | /*****************************************************************************/ |
1695 | /*****************************************************************************/ |
1055 | |
1696 | |
|
|
1697 | int ecb_cold |
1056 | int eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
1698 | eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
1057 | { |
1699 | { |
1058 | etp_init (&etp, want_poll, done_poll); |
1700 | return etp_init (want_poll, done_poll); |
1059 | } |
1701 | } |
1060 | |
1702 | |
|
|
1703 | ecb_inline void |
1061 | static void eio_api_destroy (eio_req *req) |
1704 | eio_api_destroy (eio_req *req) |
1062 | { |
1705 | { |
1063 | free (req); |
1706 | free (req); |
1064 | } |
1707 | } |
1065 | |
1708 | |
1066 | #define REQ(rtype) \ |
1709 | #define REQ(rtype) \ |
… | |
… | |
1085 | { \ |
1728 | { \ |
1086 | eio_api_destroy (req); \ |
1729 | eio_api_destroy (req); \ |
1087 | return 0; \ |
1730 | return 0; \ |
1088 | } |
1731 | } |
1089 | |
1732 | |
|
|
1733 | static void |
|
|
1734 | eio_execute (etp_worker *self, eio_req *req) |
|
|
1735 | { |
|
|
1736 | switch (req->type) |
|
|
1737 | { |
|
|
1738 | case EIO_READ: ALLOC (req->size); |
|
|
1739 | req->result = req->offs >= 0 |
|
|
1740 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
|
|
1741 | : read (req->int1, req->ptr2, req->size); break; |
|
|
1742 | case EIO_WRITE: req->result = req->offs >= 0 |
|
|
1743 | ? pwrite (req->int1, req->ptr2, req->size, req->offs) |
|
|
1744 | : write (req->int1, req->ptr2, req->size); break; |
|
|
1745 | |
|
|
1746 | case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break; |
|
|
1747 | case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break; |
|
|
1748 | |
|
|
1749 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1750 | req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1751 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1752 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1753 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1754 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1755 | |
|
|
1756 | case EIO_STATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1757 | req->result = statvfs (req->ptr1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1758 | case EIO_FSTATVFS: ALLOC (sizeof (EIO_STRUCT_STATVFS)); |
|
|
1759 | req->result = fstatvfs (req->int1, (EIO_STRUCT_STATVFS *)req->ptr2); break; |
|
|
1760 | |
|
|
1761 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
|
|
1762 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
|
|
1763 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
|
|
1764 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
|
|
1765 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
|
|
1766 | case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break; |
|
|
1767 | |
|
|
1768 | case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break; |
|
|
1769 | case EIO_CLOSE: req->result = close (req->int1); break; |
|
|
1770 | case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break; |
|
|
1771 | case EIO_UNLINK: req->result = unlink (req->ptr1); break; |
|
|
1772 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
|
|
1773 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
|
|
1774 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
|
|
1775 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
|
|
1776 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
|
|
1777 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
|
|
1778 | |
|
|
1779 | case EIO_READLINK: ALLOC (PATH_MAX); |
|
|
1780 | req->result = readlink (req->ptr1, req->ptr2, PATH_MAX); break; |
|
|
1781 | |
|
|
1782 | case EIO_SYNC: req->result = 0; sync (); break; |
|
|
1783 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
|
|
1784 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
|
|
1785 | case EIO_MSYNC: req->result = eio__msync (req->ptr2, req->size, req->int1); break; |
|
|
1786 | case EIO_MTOUCH: req->result = eio__mtouch (req); break; |
|
|
1787 | case EIO_MLOCK: req->result = eio__mlock (req->ptr2, req->size); break; |
|
|
1788 | case EIO_MLOCKALL: req->result = eio__mlockall (req->int1); break; |
|
|
1789 | case EIO_SYNC_FILE_RANGE: req->result = eio__sync_file_range (req->int1, req->offs, req->size, req->int2); break; |
|
|
1790 | |
|
|
1791 | case EIO_READDIR: eio__scandir (req, self); break; |
|
|
1792 | |
|
|
1793 | case EIO_BUSY: |
|
|
1794 | #ifdef _WIN32 |
|
|
1795 | Sleep (req->nv1 * 1e3); |
|
|
1796 | #else |
|
|
1797 | { |
|
|
1798 | struct timeval tv; |
|
|
1799 | |
|
|
1800 | tv.tv_sec = req->nv1; |
|
|
1801 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1e6; |
|
|
1802 | |
|
|
1803 | req->result = select (0, 0, 0, 0, &tv); |
|
|
1804 | } |
|
|
1805 | #endif |
|
|
1806 | break; |
|
|
1807 | |
|
|
1808 | case EIO_UTIME: |
|
|
1809 | case EIO_FUTIME: |
|
|
1810 | { |
|
|
1811 | struct timeval tv[2]; |
|
|
1812 | struct timeval *times; |
|
|
1813 | |
|
|
1814 | if (req->nv1 != -1. || req->nv2 != -1.) |
|
|
1815 | { |
|
|
1816 | tv[0].tv_sec = req->nv1; |
|
|
1817 | tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.; |
|
|
1818 | tv[1].tv_sec = req->nv2; |
|
|
1819 | tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.; |
|
|
1820 | |
|
|
1821 | times = tv; |
|
|
1822 | } |
|
|
1823 | else |
|
|
1824 | times = 0; |
|
|
1825 | |
|
|
1826 | req->result = req->type == EIO_FUTIME |
|
|
1827 | ? futimes (req->int1, times) |
|
|
1828 | : utimes (req->ptr1, times); |
|
|
1829 | } |
|
|
1830 | break; |
|
|
1831 | |
|
|
1832 | case EIO_GROUP: |
|
|
1833 | abort (); /* handled in eio_request */ |
|
|
1834 | |
|
|
1835 | case EIO_NOP: |
|
|
1836 | req->result = 0; |
|
|
1837 | break; |
|
|
1838 | |
|
|
1839 | case EIO_CUSTOM: |
|
|
1840 | req->feed (req); |
|
|
1841 | break; |
|
|
1842 | |
|
|
1843 | default: |
|
|
1844 | errno = ENOSYS; |
|
|
1845 | req->result = -1; |
|
|
1846 | break; |
|
|
1847 | } |
|
|
1848 | |
|
|
1849 | req->errorno = errno; |
|
|
1850 | } |
|
|
1851 | |
1090 | #ifndef EIO_NO_WRAPPERS |
1852 | #ifndef EIO_NO_WRAPPERS |
1091 | |
1853 | |
1092 | eio_req *eio_nop (int pri, eio_cb cb, void *data) |
1854 | eio_req *eio_nop (int pri, eio_cb cb, void *data) |
1093 | { |
1855 | { |
1094 | REQ (EIO_NOP); SEND; |
1856 | REQ (EIO_NOP); SEND; |
… | |
… | |
1107 | eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data) |
1869 | eio_req *eio_fsync (int fd, int pri, eio_cb cb, void *data) |
1108 | { |
1870 | { |
1109 | REQ (EIO_FSYNC); req->int1 = fd; SEND; |
1871 | REQ (EIO_FSYNC); req->int1 = fd; SEND; |
1110 | } |
1872 | } |
1111 | |
1873 | |
|
|
1874 | eio_req *eio_msync (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
|
|
1875 | { |
|
|
1876 | REQ (EIO_MSYNC); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
|
|
1877 | } |
|
|
1878 | |
|
|
1879 | eio_req *eio_mtouch (void *addr, size_t length, int flags, int pri, eio_cb cb, void *data) |
|
|
1880 | { |
|
|
1881 | REQ (EIO_MTOUCH); req->ptr2 = addr; req->size = length; req->int1 = flags; SEND; |
|
|
1882 | } |
|
|
1883 | |
|
|
1884 | eio_req *eio_mlock (void *addr, size_t length, int pri, eio_cb cb, void *data) |
|
|
1885 | { |
|
|
1886 | REQ (EIO_MLOCK); req->ptr2 = addr; req->size = length; SEND; |
|
|
1887 | } |
|
|
1888 | |
|
|
1889 | eio_req *eio_mlockall (int flags, int pri, eio_cb cb, void *data) |
|
|
1890 | { |
|
|
1891 | REQ (EIO_MLOCKALL); req->int1 = flags; SEND; |
|
|
1892 | } |
|
|
1893 | |
|
|
1894 | eio_req *eio_sync_file_range (int fd, off_t offset, size_t nbytes, unsigned int flags, int pri, eio_cb cb, void *data) |
|
|
1895 | { |
|
|
1896 | REQ (EIO_SYNC_FILE_RANGE); req->int1 = fd; req->offs = offset; req->size = nbytes; req->int2 = flags; SEND; |
|
|
1897 | } |
|
|
1898 | |
1112 | eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data) |
1899 | eio_req *eio_fdatasync (int fd, int pri, eio_cb cb, void *data) |
1113 | { |
1900 | { |
1114 | REQ (EIO_FDATASYNC); req->int1 = fd; SEND; |
1901 | REQ (EIO_FDATASYNC); req->int1 = fd; SEND; |
1115 | } |
1902 | } |
1116 | |
1903 | |
… | |
… | |
1135 | } |
1922 | } |
1136 | |
1923 | |
1137 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
1924 | eio_req *eio_fstat (int fd, int pri, eio_cb cb, void *data) |
1138 | { |
1925 | { |
1139 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
1926 | REQ (EIO_FSTAT); req->int1 = fd; SEND; |
|
|
1927 | } |
|
|
1928 | |
|
|
1929 | eio_req *eio_fstatvfs (int fd, int pri, eio_cb cb, void *data) |
|
|
1930 | { |
|
|
1931 | REQ (EIO_FSTATVFS); req->int1 = fd; SEND; |
1140 | } |
1932 | } |
1141 | |
1933 | |
1142 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
1934 | eio_req *eio_futime (int fd, double atime, double mtime, int pri, eio_cb cb, void *data) |
1143 | { |
1935 | { |
1144 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
1936 | REQ (EIO_FUTIME); req->int1 = fd; req->nv1 = atime; req->nv2 = mtime; SEND; |
… | |
… | |
1218 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
2010 | eio_req *eio_lstat (const char *path, int pri, eio_cb cb, void *data) |
1219 | { |
2011 | { |
1220 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
2012 | return eio__1path (EIO_LSTAT, path, pri, cb, data); |
1221 | } |
2013 | } |
1222 | |
2014 | |
|
|
2015 | eio_req *eio_statvfs (const char *path, int pri, eio_cb cb, void *data) |
|
|
2016 | { |
|
|
2017 | return eio__1path (EIO_STATVFS, path, pri, cb, data); |
|
|
2018 | } |
|
|
2019 | |
1223 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
2020 | eio_req *eio_unlink (const char *path, int pri, eio_cb cb, void *data) |
1224 | { |
2021 | { |
1225 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
2022 | return eio__1path (EIO_UNLINK, path, pri, cb, data); |
1226 | } |
2023 | } |
1227 | |
2024 | |
1228 | eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data) |
2025 | eio_req *eio_rmdir (const char *path, int pri, eio_cb cb, void *data) |
1229 | { |
2026 | { |
1230 | return eio__1path (EIO_RMDIR, path, pri, cb, data); |
2027 | return eio__1path (EIO_RMDIR, path, pri, cb, data); |
1231 | } |
2028 | } |
1232 | |
2029 | |
1233 | eio_req *eio_readdir (const char *path, int pri, eio_cb cb, void *data) |
2030 | eio_req *eio_readdir (const char *path, int flags, int pri, eio_cb cb, void *data) |
1234 | { |
2031 | { |
1235 | return eio__1path (EIO_READDIR, path, pri, cb, data); |
2032 | REQ (EIO_READDIR); PATH; req->int1 = flags; SEND; |
1236 | } |
2033 | } |
1237 | |
2034 | |
1238 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
2035 | eio_req *eio_mknod (const char *path, mode_t mode, dev_t dev, int pri, eio_cb cb, void *data) |
1239 | { |
2036 | { |
1240 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->int2 = (long)dev; SEND; |
2037 | REQ (EIO_MKNOD); PATH; req->int2 = (long)mode; req->offs = (off_t)dev; SEND; |
1241 | } |
2038 | } |
1242 | |
2039 | |
1243 | static eio_req * |
2040 | static eio_req * |
1244 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
2041 | eio__2path (int type, const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1245 | { |
2042 | { |
… | |
… | |
1269 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
2066 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1270 | { |
2067 | { |
1271 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
2068 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
1272 | } |
2069 | } |
1273 | |
2070 | |
|
|
2071 | eio_req *eio_custom (void (*execute)(eio_req *), int pri, eio_cb cb, void *data) |
|
|
2072 | { |
|
|
2073 | REQ (EIO_CUSTOM); req->feed = execute; SEND; |
|
|
2074 | } |
|
|
2075 | |
1274 | #endif |
2076 | #endif |
1275 | |
2077 | |
1276 | eio_req *eio_grp (eio_cb cb, void *data) |
2078 | eio_req *eio_grp (eio_cb cb, void *data) |
1277 | { |
2079 | { |
1278 | const int pri = EIO_PRI_MAX; |
2080 | const int pri = EIO_PRI_MAX; |
… | |
… | |
1285 | #undef SEND |
2087 | #undef SEND |
1286 | |
2088 | |
1287 | /*****************************************************************************/ |
2089 | /*****************************************************************************/ |
1288 | /* grp functions */ |
2090 | /* grp functions */ |
1289 | |
2091 | |
|
|
2092 | void |
1290 | void eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit) |
2093 | eio_grp_feed (eio_req *grp, void (*feed)(eio_req *req), int limit) |
1291 | { |
2094 | { |
1292 | grp->int2 = limit; |
2095 | grp->int2 = limit; |
1293 | grp->feed = feed; |
2096 | grp->feed = feed; |
1294 | |
2097 | |
1295 | grp_try_feed (grp); |
2098 | grp_try_feed (grp); |
1296 | } |
2099 | } |
1297 | |
2100 | |
|
|
2101 | void |
1298 | void eio_grp_limit (eio_req *grp, int limit) |
2102 | eio_grp_limit (eio_req *grp, int limit) |
1299 | { |
2103 | { |
1300 | grp->int2 = limit; |
2104 | grp->int2 = limit; |
1301 | |
2105 | |
1302 | grp_try_feed (grp); |
2106 | grp_try_feed (grp); |
1303 | } |
2107 | } |
1304 | |
2108 | |
|
|
2109 | void |
1305 | void eio_grp_add (eio_req *grp, eio_req *req) |
2110 | eio_grp_add (eio_req *grp, eio_req *req) |
1306 | { |
2111 | { |
1307 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
2112 | assert (("cannot add requests to IO::AIO::GRP after the group finished", grp->int1 != 2)); |
|
|
2113 | |
|
|
2114 | grp->flags |= EIO_FLAG_GROUPADD; |
1308 | |
2115 | |
1309 | ++grp->size; |
2116 | ++grp->size; |
1310 | req->grp = grp; |
2117 | req->grp = grp; |
1311 | |
2118 | |
1312 | req->grp_prev = 0; |
2119 | req->grp_prev = 0; |
… | |
… | |
1319 | } |
2126 | } |
1320 | |
2127 | |
1321 | /*****************************************************************************/ |
2128 | /*****************************************************************************/ |
1322 | /* misc garbage */ |
2129 | /* misc garbage */ |
1323 | |
2130 | |
|
|
2131 | ssize_t |
1324 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
2132 | eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
1325 | { |
2133 | { |
1326 | worker wrk; |
2134 | etp_worker wrk; |
|
|
2135 | ssize_t ret; |
1327 | |
2136 | |
1328 | wrk.dbuf = 0; |
2137 | wrk.dbuf = 0; |
1329 | |
2138 | |
1330 | eio__sendfile (ofd, ifd, offset, count, &wrk); |
2139 | ret = eio__sendfile (ofd, ifd, offset, count, &wrk); |
1331 | |
2140 | |
1332 | if (wrk.dbuf) |
2141 | if (wrk.dbuf) |
1333 | free (wrk.dbuf); |
2142 | free (wrk.dbuf); |
1334 | } |
|
|
1335 | |
2143 | |
|
|
2144 | return ret; |
|
|
2145 | } |
|
|
2146 | |