|
|
1 | /* |
|
|
2 | * libeio implementation |
|
|
3 | * |
|
|
4 | * Copyright (c) 2007,2008 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 | |
1 | #include "eio.h" |
40 | #include "eio.h" |
2 | #include "xthread.h" |
41 | #include "xthread.h" |
3 | |
42 | |
4 | #include <errno.h> |
43 | #include <errno.h> |
5 | #include <stddef.h> |
44 | #include <stddef.h> |
… | |
… | |
70 | /* buffer size for various temporary buffers */ |
109 | /* buffer size for various temporary buffers */ |
71 | #define EIO_BUFSIZE 65536 |
110 | #define EIO_BUFSIZE 65536 |
72 | |
111 | |
73 | #define dBUF \ |
112 | #define dBUF \ |
74 | char *eio_buf; \ |
113 | char *eio_buf; \ |
75 | X_LOCK (wrklock); \ |
114 | ETP_WORKER_LOCK (self); \ |
76 | self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \ |
115 | self->dbuf = eio_buf = malloc (EIO_BUFSIZE); \ |
77 | X_UNLOCK (wrklock); \ |
116 | ETP_WORKER_UNLOCK (self); \ |
78 | errno = ENOMEM; \ |
117 | errno = ENOMEM; \ |
79 | if (!eio_buf) \ |
118 | if (!eio_buf) \ |
80 | return -1; |
119 | return -1; |
81 | |
120 | |
82 | #define EIO_TICKS ((1000000 + 1023) >> 10) |
121 | #define EIO_TICKS ((1000000 + 1023) >> 10) |
83 | |
122 | |
|
|
123 | /*****************************************************************************/ |
|
|
124 | |
|
|
125 | #define ETP_PRI_MIN EIO_PRI_MIN |
|
|
126 | #define ETP_PRI_MAX EIO_PRI_MAX |
|
|
127 | |
|
|
128 | struct etp_worker; |
|
|
129 | |
|
|
130 | #define ETP_REQ eio_req |
|
|
131 | #define ETP_DESTROY(req) eio_destroy (req) |
|
|
132 | static int eio_finish (eio_req *req); |
|
|
133 | #define ETP_FINISH(req) eio_finish (req) |
|
|
134 | static void eio_execute (struct etp_worker *self, eio_req *req); |
|
|
135 | #define ETP_EXECUTE(wrk,req) eio_execute (wrk,req) |
|
|
136 | |
|
|
137 | #define ETP_WORKER_CLEAR(req) \ |
|
|
138 | if (wrk->dbuf) \ |
|
|
139 | { \ |
|
|
140 | free (wrk->dbuf); \ |
|
|
141 | wrk->dbuf = 0; \ |
|
|
142 | } \ |
|
|
143 | \ |
|
|
144 | if (wrk->dirp) \ |
|
|
145 | { \ |
|
|
146 | closedir (wrk->dirp); \ |
|
|
147 | wrk->dirp = 0; \ |
|
|
148 | } |
|
|
149 | #define ETP_WORKER_COMMON \ |
|
|
150 | void *dbuf; \ |
|
|
151 | DIR *dirp; |
|
|
152 | |
|
|
153 | /*****************************************************************************/ |
|
|
154 | |
|
|
155 | #define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1) |
|
|
156 | |
|
|
157 | /* calculcate time difference in ~1/EIO_TICKS of a second */ |
|
|
158 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
|
|
159 | { |
|
|
160 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
|
|
161 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
|
|
162 | } |
|
|
163 | |
|
|
164 | static unsigned int started, idle, wanted = 4; |
|
|
165 | |
84 | static void (*want_poll_cb) (void); |
166 | static void (*want_poll_cb) (void); |
85 | static void (*done_poll_cb) (void); |
167 | static void (*done_poll_cb) (void); |
86 | |
168 | |
87 | static unsigned int max_poll_time = 0; |
169 | static unsigned int max_poll_time; /* reslock */ |
88 | static unsigned int max_poll_reqs = 0; |
170 | static unsigned int max_poll_reqs; /* reslock */ |
89 | |
171 | |
90 | /* calculcate time difference in ~1/EIO_TICKS of a second */ |
172 | static volatile unsigned int nreqs; /* reqlock */ |
91 | static int tvdiff (struct timeval *tv1, struct timeval *tv2) |
173 | static volatile unsigned int nready; /* reqlock */ |
92 | { |
174 | static volatile unsigned int npending; /* reqlock */ |
93 | return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS |
175 | static volatile unsigned int max_idle = 4; |
94 | + ((tv2->tv_usec - tv1->tv_usec) >> 10); |
|
|
95 | } |
|
|
96 | |
176 | |
97 | static unsigned int started, idle, wanted = 4; |
|
|
98 | |
|
|
99 | /* worker threads management */ |
|
|
100 | static mutex_t wrklock = X_MUTEX_INIT; |
177 | static mutex_t wrklock = X_MUTEX_INIT; |
101 | |
|
|
102 | typedef struct worker |
|
|
103 | { |
|
|
104 | /* locked by wrklock */ |
|
|
105 | struct worker *prev, *next; |
|
|
106 | |
|
|
107 | thread_t tid; |
|
|
108 | |
|
|
109 | /* locked by reslock, reqlock or wrklock */ |
|
|
110 | eio_req *req; /* currently processed request */ |
|
|
111 | void *dbuf; |
|
|
112 | DIR *dirp; |
|
|
113 | } worker; |
|
|
114 | |
|
|
115 | static worker wrk_first = { &wrk_first, &wrk_first, 0 }; |
|
|
116 | |
|
|
117 | static void worker_clear (worker *wrk) |
|
|
118 | { |
|
|
119 | if (wrk->dirp) |
|
|
120 | { |
|
|
121 | closedir (wrk->dirp); |
|
|
122 | wrk->dirp = 0; |
|
|
123 | } |
|
|
124 | |
|
|
125 | if (wrk->dbuf) |
|
|
126 | { |
|
|
127 | free (wrk->dbuf); |
|
|
128 | wrk->dbuf = 0; |
|
|
129 | } |
|
|
130 | } |
|
|
131 | |
|
|
132 | static void worker_free (worker *wrk) |
|
|
133 | { |
|
|
134 | wrk->next->prev = wrk->prev; |
|
|
135 | wrk->prev->next = wrk->next; |
|
|
136 | |
|
|
137 | free (wrk); |
|
|
138 | } |
|
|
139 | |
|
|
140 | static volatile unsigned int nreqs, nready, npending; |
|
|
141 | static volatile unsigned int max_idle = 4; |
|
|
142 | |
|
|
143 | static mutex_t reslock = X_MUTEX_INIT; |
178 | static mutex_t reslock = X_MUTEX_INIT; |
144 | static mutex_t reqlock = X_MUTEX_INIT; |
179 | static mutex_t reqlock = X_MUTEX_INIT; |
145 | static cond_t reqwait = X_COND_INIT; |
180 | static cond_t reqwait = X_COND_INIT; |
146 | |
181 | |
|
|
182 | typedef struct etp_worker |
|
|
183 | { |
|
|
184 | /* locked by wrklock */ |
|
|
185 | struct etp_worker *prev, *next; |
|
|
186 | |
|
|
187 | thread_t tid; |
|
|
188 | |
|
|
189 | /* locked by reslock, reqlock or wrklock */ |
|
|
190 | ETP_REQ *req; /* currently processed request */ |
|
|
191 | |
|
|
192 | ETP_WORKER_COMMON |
|
|
193 | } etp_worker; |
|
|
194 | |
|
|
195 | static etp_worker wrk_first = { &wrk_first, &wrk_first, 0 }; /* NOT etp */ |
|
|
196 | |
|
|
197 | #define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock) |
|
|
198 | #define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock) |
|
|
199 | |
|
|
200 | /* worker threads management */ |
|
|
201 | |
|
|
202 | static void etp_worker_clear (etp_worker *wrk) |
|
|
203 | { |
|
|
204 | ETP_WORKER_CLEAR (wrk); |
|
|
205 | } |
|
|
206 | |
|
|
207 | static void etp_worker_free (etp_worker *wrk) |
|
|
208 | { |
|
|
209 | wrk->next->prev = wrk->prev; |
|
|
210 | wrk->prev->next = wrk->next; |
|
|
211 | |
|
|
212 | free (wrk); |
|
|
213 | } |
|
|
214 | |
147 | unsigned int eio_nreqs (void) |
215 | static unsigned int etp_nreqs (void) |
148 | { |
216 | { |
|
|
217 | int retval; |
|
|
218 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
219 | retval = nreqs; |
|
|
220 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
149 | return nreqs; |
221 | return retval; |
150 | } |
222 | } |
151 | |
223 | |
152 | unsigned int eio_nready (void) |
224 | static unsigned int etp_nready (void) |
153 | { |
225 | { |
154 | unsigned int retval; |
226 | unsigned int retval; |
155 | |
227 | |
156 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
228 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
157 | retval = nready; |
229 | retval = nready; |
158 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
230 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
159 | |
231 | |
160 | return retval; |
232 | return retval; |
161 | } |
233 | } |
162 | |
234 | |
163 | unsigned int eio_npending (void) |
235 | static unsigned int etp_npending (void) |
164 | { |
236 | { |
165 | unsigned int retval; |
237 | unsigned int retval; |
166 | |
238 | |
167 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
239 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
168 | retval = npending; |
240 | retval = npending; |
169 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
241 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
170 | |
242 | |
171 | return retval; |
243 | return retval; |
172 | } |
244 | } |
173 | |
245 | |
174 | unsigned int eio_nthreads (void) |
246 | static unsigned int etp_nthreads (void) |
175 | { |
247 | { |
176 | unsigned int retval; |
248 | unsigned int retval; |
177 | |
249 | |
178 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
250 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
179 | retval = started; |
251 | retval = started; |
… | |
… | |
186 | * a somewhat faster data structure might be nice, but |
258 | * a somewhat faster data structure might be nice, but |
187 | * with 8 priorities this actually needs <20 insns |
259 | * with 8 priorities this actually needs <20 insns |
188 | * per shift, the most expensive operation. |
260 | * per shift, the most expensive operation. |
189 | */ |
261 | */ |
190 | typedef struct { |
262 | typedef struct { |
191 | eio_req *qs[EIO_NUM_PRI], *qe[EIO_NUM_PRI]; /* qstart, qend */ |
263 | ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */ |
192 | int size; |
264 | int size; |
193 | } reqq; |
265 | } etp_reqq; |
194 | |
266 | |
195 | static reqq req_queue; |
267 | static etp_reqq req_queue; |
196 | static reqq res_queue; |
268 | static etp_reqq res_queue; |
197 | |
269 | |
198 | static int reqq_push (reqq *q, eio_req *req) |
270 | static int reqq_push (etp_reqq *q, ETP_REQ *req) |
199 | { |
271 | { |
200 | int pri = req->pri; |
272 | int pri = req->pri; |
201 | req->next = 0; |
273 | req->next = 0; |
202 | |
274 | |
203 | if (q->qe[pri]) |
275 | if (q->qe[pri]) |
… | |
… | |
209 | q->qe[pri] = q->qs[pri] = req; |
281 | q->qe[pri] = q->qs[pri] = req; |
210 | |
282 | |
211 | return q->size++; |
283 | return q->size++; |
212 | } |
284 | } |
213 | |
285 | |
214 | static eio_req *reqq_shift (reqq *q) |
286 | static ETP_REQ *reqq_shift (etp_reqq *q) |
215 | { |
287 | { |
216 | int pri; |
288 | int pri; |
217 | |
289 | |
218 | if (!q->size) |
290 | if (!q->size) |
219 | return 0; |
291 | return 0; |
220 | |
292 | |
221 | --q->size; |
293 | --q->size; |
222 | |
294 | |
223 | for (pri = EIO_NUM_PRI; pri--; ) |
295 | for (pri = ETP_NUM_PRI; pri--; ) |
224 | { |
296 | { |
225 | eio_req *req = q->qs[pri]; |
297 | eio_req *req = q->qs[pri]; |
226 | |
298 | |
227 | if (req) |
299 | if (req) |
228 | { |
300 | { |
… | |
… | |
234 | } |
306 | } |
235 | |
307 | |
236 | abort (); |
308 | abort (); |
237 | } |
309 | } |
238 | |
310 | |
239 | static void grp_try_feed (eio_req *grp) |
311 | static void etp_atfork_prepare (void) |
240 | { |
312 | { |
241 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
313 | X_LOCK (wrklock); |
|
|
314 | X_LOCK (reqlock); |
|
|
315 | X_LOCK (reslock); |
|
|
316 | #if !HAVE_PREADWRITE |
|
|
317 | X_LOCK (preadwritelock); |
|
|
318 | #endif |
|
|
319 | } |
|
|
320 | |
|
|
321 | static void etp_atfork_parent (void) |
|
|
322 | { |
|
|
323 | #if !HAVE_PREADWRITE |
|
|
324 | X_UNLOCK (preadwritelock); |
|
|
325 | #endif |
|
|
326 | X_UNLOCK (reslock); |
|
|
327 | X_UNLOCK (reqlock); |
|
|
328 | X_UNLOCK (wrklock); |
|
|
329 | } |
|
|
330 | |
|
|
331 | static void etp_atfork_child (void) |
|
|
332 | { |
|
|
333 | ETP_REQ *prv; |
|
|
334 | |
|
|
335 | while (prv = reqq_shift (&req_queue)) |
|
|
336 | ETP_DESTROY (prv); |
|
|
337 | |
|
|
338 | while (prv = reqq_shift (&res_queue)) |
|
|
339 | ETP_DESTROY (prv); |
|
|
340 | |
|
|
341 | while (wrk_first.next != &wrk_first) |
242 | { |
342 | { |
243 | int old_len = grp->size; |
343 | etp_worker *wrk = wrk_first.next; |
244 | |
344 | |
245 | EIO_FEED (grp); |
345 | if (wrk->req) |
|
|
346 | ETP_DESTROY (wrk->req); |
246 | |
347 | |
247 | /* stop if no progress has been made */ |
348 | etp_worker_clear (wrk); |
248 | if (old_len == grp->size) |
349 | etp_worker_free (wrk); |
249 | { |
|
|
250 | grp->feed = 0; |
|
|
251 | break; |
|
|
252 | } |
|
|
253 | } |
|
|
254 | } |
|
|
255 | |
|
|
256 | static int eio_finish (eio_req *req); |
|
|
257 | |
|
|
258 | static int grp_dec (eio_req *grp) |
|
|
259 | { |
|
|
260 | --grp->size; |
|
|
261 | |
|
|
262 | /* call feeder, if applicable */ |
|
|
263 | grp_try_feed (grp); |
|
|
264 | |
|
|
265 | /* finish, if done */ |
|
|
266 | if (!grp->size && grp->int1) |
|
|
267 | return eio_finish (grp); |
|
|
268 | else |
|
|
269 | return 0; |
|
|
270 | } |
|
|
271 | |
|
|
272 | void eio_destroy (eio_req *req) |
|
|
273 | { |
|
|
274 | if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1); |
|
|
275 | if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2); |
|
|
276 | |
|
|
277 | EIO_DESTROY (req); |
|
|
278 | } |
|
|
279 | |
|
|
280 | static int eio_finish (eio_req *req) |
|
|
281 | { |
|
|
282 | int res = EIO_FINISH (req); |
|
|
283 | |
|
|
284 | if (req->grp) |
|
|
285 | { |
350 | } |
286 | int res2; |
|
|
287 | eio_req *grp = req->grp; |
|
|
288 | |
351 | |
289 | /* unlink request */ |
352 | started = 0; |
290 | if (req->grp_next) req->grp_next->grp_prev = req->grp_prev; |
353 | idle = 0; |
291 | if (req->grp_prev) req->grp_prev->grp_next = req->grp_next; |
354 | nreqs = 0; |
|
|
355 | nready = 0; |
|
|
356 | npending = 0; |
292 | |
357 | |
293 | if (grp->grp_first == req) |
358 | etp_atfork_parent (); |
294 | grp->grp_first = req->grp_next; |
|
|
295 | |
|
|
296 | res2 = grp_dec (grp); |
|
|
297 | |
|
|
298 | if (!res && res2) |
|
|
299 | res = res2; |
|
|
300 | } |
|
|
301 | |
|
|
302 | eio_destroy (req); |
|
|
303 | |
|
|
304 | return res; |
|
|
305 | } |
359 | } |
306 | |
360 | |
307 | void eio_grp_cancel (eio_req *grp) |
361 | static void |
308 | { |
362 | etp_once_init (void) |
309 | for (grp = grp->grp_first; grp; grp = grp->grp_next) |
363 | { |
310 | eio_cancel (grp); |
364 | X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child); |
311 | } |
365 | } |
312 | |
366 | |
313 | void eio_cancel (eio_req *req) |
367 | static int |
|
|
368 | etp_init (void (*want_poll)(void), void (*done_poll)(void)) |
314 | { |
369 | { |
315 | X_LOCK (wrklock); |
370 | static pthread_once_t doinit = PTHREAD_ONCE_INIT; |
316 | req->flags |= EIO_FLAG_CANCELLED; |
|
|
317 | X_UNLOCK (wrklock); |
|
|
318 | |
371 | |
319 | eio_grp_cancel (req); |
372 | pthread_once (&doinit, etp_once_init); |
320 | } |
|
|
321 | |
373 | |
|
|
374 | want_poll_cb = want_poll; |
|
|
375 | done_poll_cb = done_poll; |
|
|
376 | } |
|
|
377 | |
322 | X_THREAD_PROC (eio_proc); |
378 | X_THREAD_PROC (etp_proc); |
323 | |
379 | |
324 | static void start_thread (void) |
380 | static void etp_start_thread (void) |
325 | { |
381 | { |
326 | worker *wrk = calloc (1, sizeof (worker)); |
382 | etp_worker *wrk = calloc (1, sizeof (etp_worker)); |
327 | |
383 | |
328 | /*TODO*/ |
384 | /*TODO*/ |
329 | assert (("unable to allocate worker thread data", wrk)); |
385 | assert (("unable to allocate worker thread data", wrk)); |
330 | |
386 | |
331 | X_LOCK (wrklock); |
387 | X_LOCK (wrklock); |
332 | |
388 | |
333 | if (thread_create (&wrk->tid, eio_proc, (void *)wrk)) |
389 | if (thread_create (&wrk->tid, etp_proc, (void *)wrk)) |
334 | { |
390 | { |
335 | wrk->prev = &wrk_first; |
391 | wrk->prev = &wrk_first; |
336 | wrk->next = wrk_first.next; |
392 | wrk->next = wrk_first.next; |
337 | wrk_first.next->prev = wrk; |
393 | wrk_first.next->prev = wrk; |
338 | wrk_first.next = wrk; |
394 | wrk_first.next = wrk; |
… | |
… | |
342 | free (wrk); |
398 | free (wrk); |
343 | |
399 | |
344 | X_UNLOCK (wrklock); |
400 | X_UNLOCK (wrklock); |
345 | } |
401 | } |
346 | |
402 | |
347 | static void maybe_start_thread (void) |
403 | static void etp_maybe_start_thread (void) |
348 | { |
404 | { |
349 | if (eio_nthreads () >= wanted) |
405 | if (etp_nthreads () >= wanted) |
350 | return; |
406 | return; |
351 | |
407 | |
352 | /* todo: maybe use idle here, but might be less exact */ |
408 | /* todo: maybe use idle here, but might be less exact */ |
353 | if (0 <= (int)eio_nthreads () + (int)eio_npending () - (int)eio_nreqs ()) |
409 | if (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ()) |
354 | return; |
410 | return; |
355 | |
411 | |
356 | start_thread (); |
412 | etp_start_thread (); |
357 | } |
413 | } |
358 | |
414 | |
359 | void eio_submit (eio_req *req) |
|
|
360 | { |
|
|
361 | ++nreqs; |
|
|
362 | |
|
|
363 | X_LOCK (reqlock); |
|
|
364 | ++nready; |
|
|
365 | reqq_push (&req_queue, req); |
|
|
366 | X_COND_SIGNAL (reqwait); |
|
|
367 | X_UNLOCK (reqlock); |
|
|
368 | |
|
|
369 | maybe_start_thread (); |
|
|
370 | } |
|
|
371 | |
|
|
372 | static void end_thread (void) |
415 | static void etp_end_thread (void) |
373 | { |
416 | { |
374 | eio_req *req = calloc (1, sizeof (eio_req)); |
417 | eio_req *req = calloc (1, sizeof (eio_req)); |
375 | |
418 | |
376 | req->type = EIO_QUIT; |
419 | req->type = -1; |
377 | req->pri = EIO_PRI_MAX + EIO_PRI_BIAS; |
420 | req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
378 | |
421 | |
379 | X_LOCK (reqlock); |
422 | X_LOCK (reqlock); |
380 | reqq_push (&req_queue, req); |
423 | reqq_push (&req_queue, req); |
381 | X_COND_SIGNAL (reqwait); |
424 | X_COND_SIGNAL (reqwait); |
382 | X_UNLOCK (reqlock); |
425 | X_UNLOCK (reqlock); |
… | |
… | |
384 | X_LOCK (wrklock); |
427 | X_LOCK (wrklock); |
385 | --started; |
428 | --started; |
386 | X_UNLOCK (wrklock); |
429 | X_UNLOCK (wrklock); |
387 | } |
430 | } |
388 | |
431 | |
389 | void eio_set_max_poll_time (double nseconds) |
|
|
390 | { |
|
|
391 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
392 | max_poll_time = nseconds; |
|
|
393 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
394 | } |
|
|
395 | |
|
|
396 | void eio_set_max_poll_reqs (unsigned int maxreqs) |
|
|
397 | { |
|
|
398 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
399 | max_poll_reqs = maxreqs; |
|
|
400 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
401 | } |
|
|
402 | |
|
|
403 | void eio_set_max_idle (unsigned int nthreads) |
|
|
404 | { |
|
|
405 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
406 | max_idle = nthreads <= 0 ? 1 : nthreads; |
|
|
407 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
408 | } |
|
|
409 | |
|
|
410 | void eio_set_min_parallel (unsigned int nthreads) |
|
|
411 | { |
|
|
412 | if (wanted < nthreads) |
|
|
413 | wanted = nthreads; |
|
|
414 | } |
|
|
415 | |
|
|
416 | void eio_set_max_parallel (unsigned int nthreads) |
|
|
417 | { |
|
|
418 | if (wanted > nthreads) |
|
|
419 | wanted = nthreads; |
|
|
420 | |
|
|
421 | while (started > wanted) |
|
|
422 | end_thread (); |
|
|
423 | } |
|
|
424 | |
|
|
425 | int eio_poll (void) |
432 | static int etp_poll (void) |
426 | { |
433 | { |
427 | int maxreqs = max_poll_reqs; |
434 | unsigned int maxreqs; |
|
|
435 | unsigned int maxtime; |
428 | struct timeval tv_start, tv_now; |
436 | struct timeval tv_start, tv_now; |
429 | eio_req *req; |
|
|
430 | |
437 | |
|
|
438 | X_LOCK (reslock); |
|
|
439 | maxreqs = max_poll_reqs; |
|
|
440 | maxtime = max_poll_time; |
|
|
441 | X_UNLOCK (reslock); |
|
|
442 | |
431 | if (max_poll_time) |
443 | if (maxtime) |
432 | gettimeofday (&tv_start, 0); |
444 | gettimeofday (&tv_start, 0); |
433 | |
445 | |
434 | for (;;) |
446 | for (;;) |
435 | { |
447 | { |
|
|
448 | ETP_REQ *req; |
|
|
449 | |
436 | maybe_start_thread (); |
450 | etp_maybe_start_thread (); |
437 | |
451 | |
438 | X_LOCK (reslock); |
452 | X_LOCK (reslock); |
439 | req = reqq_shift (&res_queue); |
453 | req = reqq_shift (&res_queue); |
440 | |
454 | |
441 | if (req) |
455 | if (req) |
… | |
… | |
449 | X_UNLOCK (reslock); |
463 | X_UNLOCK (reslock); |
450 | |
464 | |
451 | if (!req) |
465 | if (!req) |
452 | return 0; |
466 | return 0; |
453 | |
467 | |
|
|
468 | X_LOCK (reqlock); |
454 | --nreqs; |
469 | --nreqs; |
|
|
470 | X_UNLOCK (reqlock); |
455 | |
471 | |
456 | if (req->type == EIO_GROUP && req->size) |
472 | if (req->type == EIO_GROUP && req->size) |
457 | { |
473 | { |
458 | req->int1 = 1; /* mark request as delayed */ |
474 | req->int1 = 1; /* mark request as delayed */ |
459 | continue; |
475 | continue; |
460 | } |
476 | } |
461 | else |
477 | else |
462 | { |
478 | { |
463 | int res = eio_finish (req); |
479 | int res = ETP_FINISH (req); |
464 | if (res) |
480 | if (res) |
465 | return res; |
481 | return res; |
466 | } |
482 | } |
467 | |
483 | |
468 | if (maxreqs && !--maxreqs) |
484 | if (maxreqs && !--maxreqs) |
469 | break; |
485 | break; |
470 | |
486 | |
471 | if (max_poll_time) |
487 | if (maxtime) |
472 | { |
488 | { |
473 | gettimeofday (&tv_now, 0); |
489 | gettimeofday (&tv_now, 0); |
474 | |
490 | |
475 | if (tvdiff (&tv_start, &tv_now) >= max_poll_time) |
491 | if (tvdiff (&tv_start, &tv_now) >= maxtime) |
476 | break; |
492 | break; |
477 | } |
493 | } |
478 | } |
494 | } |
479 | |
495 | |
480 | errno = EAGAIN; |
496 | errno = EAGAIN; |
481 | return -1; |
497 | return -1; |
|
|
498 | } |
|
|
499 | |
|
|
500 | static void etp_cancel (ETP_REQ *req) |
|
|
501 | { |
|
|
502 | X_LOCK (wrklock); |
|
|
503 | req->flags |= EIO_FLAG_CANCELLED; |
|
|
504 | X_UNLOCK (wrklock); |
|
|
505 | |
|
|
506 | eio_grp_cancel (req); |
|
|
507 | } |
|
|
508 | |
|
|
509 | static void etp_submit (ETP_REQ *req) |
|
|
510 | { |
|
|
511 | req->pri -= ETP_PRI_MIN; |
|
|
512 | |
|
|
513 | if (req->pri < ETP_PRI_MIN - ETP_PRI_MIN) req->pri = ETP_PRI_MIN - ETP_PRI_MIN; |
|
|
514 | if (req->pri > ETP_PRI_MAX - ETP_PRI_MIN) req->pri = ETP_PRI_MAX - ETP_PRI_MIN; |
|
|
515 | |
|
|
516 | X_LOCK (reqlock); |
|
|
517 | ++nreqs; |
|
|
518 | ++nready; |
|
|
519 | reqq_push (&req_queue, req); |
|
|
520 | X_COND_SIGNAL (reqwait); |
|
|
521 | X_UNLOCK (reqlock); |
|
|
522 | |
|
|
523 | etp_maybe_start_thread (); |
|
|
524 | } |
|
|
525 | |
|
|
526 | static void etp_set_max_poll_time (double nseconds) |
|
|
527 | { |
|
|
528 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
|
|
529 | max_poll_time = nseconds; |
|
|
530 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
|
|
531 | } |
|
|
532 | |
|
|
533 | static void etp_set_max_poll_reqs (unsigned int maxreqs) |
|
|
534 | { |
|
|
535 | if (WORDACCESS_UNSAFE) X_LOCK (reslock); |
|
|
536 | max_poll_reqs = maxreqs; |
|
|
537 | if (WORDACCESS_UNSAFE) X_UNLOCK (reslock); |
|
|
538 | } |
|
|
539 | |
|
|
540 | static void etp_set_max_idle (unsigned int nthreads) |
|
|
541 | { |
|
|
542 | if (WORDACCESS_UNSAFE) X_LOCK (reqlock); |
|
|
543 | max_idle = nthreads <= 0 ? 1 : nthreads; |
|
|
544 | if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); |
|
|
545 | } |
|
|
546 | |
|
|
547 | static void etp_set_min_parallel (unsigned int nthreads) |
|
|
548 | { |
|
|
549 | if (wanted < nthreads) |
|
|
550 | wanted = nthreads; |
|
|
551 | } |
|
|
552 | |
|
|
553 | static void etp_set_max_parallel (unsigned int nthreads) |
|
|
554 | { |
|
|
555 | if (wanted > nthreads) |
|
|
556 | wanted = nthreads; |
|
|
557 | |
|
|
558 | while (started > wanted) |
|
|
559 | etp_end_thread (); |
|
|
560 | } |
|
|
561 | |
|
|
562 | /*****************************************************************************/ |
|
|
563 | |
|
|
564 | static void grp_try_feed (eio_req *grp) |
|
|
565 | { |
|
|
566 | while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) |
|
|
567 | { |
|
|
568 | int old_len = grp->size; |
|
|
569 | |
|
|
570 | EIO_FEED (grp); |
|
|
571 | |
|
|
572 | /* stop if no progress has been made */ |
|
|
573 | if (old_len == grp->size) |
|
|
574 | { |
|
|
575 | grp->feed = 0; |
|
|
576 | break; |
|
|
577 | } |
|
|
578 | } |
|
|
579 | } |
|
|
580 | |
|
|
581 | static int grp_dec (eio_req *grp) |
|
|
582 | { |
|
|
583 | --grp->size; |
|
|
584 | |
|
|
585 | /* call feeder, if applicable */ |
|
|
586 | grp_try_feed (grp); |
|
|
587 | |
|
|
588 | /* finish, if done */ |
|
|
589 | if (!grp->size && grp->int1) |
|
|
590 | return eio_finish (grp); |
|
|
591 | else |
|
|
592 | return 0; |
|
|
593 | } |
|
|
594 | |
|
|
595 | void eio_destroy (eio_req *req) |
|
|
596 | { |
|
|
597 | if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1); |
|
|
598 | if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2); |
|
|
599 | |
|
|
600 | EIO_DESTROY (req); |
|
|
601 | } |
|
|
602 | |
|
|
603 | static int eio_finish (eio_req *req) |
|
|
604 | { |
|
|
605 | int res = EIO_FINISH (req); |
|
|
606 | |
|
|
607 | if (req->grp) |
|
|
608 | { |
|
|
609 | int res2; |
|
|
610 | eio_req *grp = req->grp; |
|
|
611 | |
|
|
612 | /* unlink request */ |
|
|
613 | if (req->grp_next) req->grp_next->grp_prev = req->grp_prev; |
|
|
614 | if (req->grp_prev) req->grp_prev->grp_next = req->grp_next; |
|
|
615 | |
|
|
616 | if (grp->grp_first == req) |
|
|
617 | grp->grp_first = req->grp_next; |
|
|
618 | |
|
|
619 | res2 = grp_dec (grp); |
|
|
620 | |
|
|
621 | if (!res && res2) |
|
|
622 | res = res2; |
|
|
623 | } |
|
|
624 | |
|
|
625 | eio_destroy (req); |
|
|
626 | |
|
|
627 | return res; |
|
|
628 | } |
|
|
629 | |
|
|
630 | void eio_grp_cancel (eio_req *grp) |
|
|
631 | { |
|
|
632 | for (grp = grp->grp_first; grp; grp = grp->grp_next) |
|
|
633 | eio_cancel (grp); |
|
|
634 | } |
|
|
635 | |
|
|
636 | void eio_cancel (eio_req *req) |
|
|
637 | { |
|
|
638 | etp_cancel (req); |
|
|
639 | } |
|
|
640 | |
|
|
641 | void eio_submit (eio_req *req) |
|
|
642 | { |
|
|
643 | etp_submit (req); |
|
|
644 | } |
|
|
645 | |
|
|
646 | unsigned int eio_nreqs (void) |
|
|
647 | { |
|
|
648 | return etp_nreqs (); |
|
|
649 | } |
|
|
650 | |
|
|
651 | unsigned int eio_nready (void) |
|
|
652 | { |
|
|
653 | return etp_nready (); |
|
|
654 | } |
|
|
655 | |
|
|
656 | unsigned int eio_npending (void) |
|
|
657 | { |
|
|
658 | return etp_npending (); |
|
|
659 | } |
|
|
660 | |
|
|
661 | unsigned int eio_nthreads (void) |
|
|
662 | { |
|
|
663 | return etp_nthreads (); |
|
|
664 | } |
|
|
665 | |
|
|
666 | void eio_set_max_poll_time (double nseconds) |
|
|
667 | { |
|
|
668 | etp_set_max_poll_time (nseconds); |
|
|
669 | } |
|
|
670 | |
|
|
671 | void eio_set_max_poll_reqs (unsigned int maxreqs) |
|
|
672 | { |
|
|
673 | etp_set_max_poll_reqs (maxreqs); |
|
|
674 | } |
|
|
675 | |
|
|
676 | void eio_set_max_idle (unsigned int nthreads) |
|
|
677 | { |
|
|
678 | etp_set_max_idle (nthreads); |
|
|
679 | } |
|
|
680 | |
|
|
681 | void eio_set_min_parallel (unsigned int nthreads) |
|
|
682 | { |
|
|
683 | etp_set_min_parallel (nthreads); |
|
|
684 | } |
|
|
685 | |
|
|
686 | void eio_set_max_parallel (unsigned int nthreads) |
|
|
687 | { |
|
|
688 | etp_set_max_parallel (nthreads); |
|
|
689 | } |
|
|
690 | |
|
|
691 | int eio_poll (void) |
|
|
692 | { |
|
|
693 | return etp_poll (); |
482 | } |
694 | } |
483 | |
695 | |
484 | /*****************************************************************************/ |
696 | /*****************************************************************************/ |
485 | /* work around various missing functions */ |
697 | /* work around various missing functions */ |
486 | |
698 | |
… | |
… | |
583 | return count; |
795 | return count; |
584 | } |
796 | } |
585 | |
797 | |
586 | #endif |
798 | #endif |
587 | |
799 | |
588 | #if !HAVE_READDIR_R |
|
|
589 | # define readdir_r eio__readdir_r |
|
|
590 | |
|
|
591 | static mutex_t readdirlock = X_MUTEX_INIT; |
|
|
592 | |
|
|
593 | static int |
|
|
594 | eio__readdir_r (DIR *dirp, EIO_STRUCT_DIRENT *ent, EIO_STRUCT_DIRENT **res) |
|
|
595 | { |
|
|
596 | EIO_STRUCT_DIRENT *e; |
|
|
597 | int errorno; |
|
|
598 | |
|
|
599 | X_LOCK (readdirlock); |
|
|
600 | |
|
|
601 | e = readdir (dirp); |
|
|
602 | errorno = errno; |
|
|
603 | |
|
|
604 | if (e) |
|
|
605 | { |
|
|
606 | *res = ent; |
|
|
607 | strcpy (ent->d_name, e->d_name); |
|
|
608 | } |
|
|
609 | else |
|
|
610 | *res = 0; |
|
|
611 | |
|
|
612 | X_UNLOCK (readdirlock); |
|
|
613 | |
|
|
614 | errno = errorno; |
|
|
615 | return e ? 0 : -1; |
|
|
616 | } |
|
|
617 | #endif |
|
|
618 | |
|
|
619 | /* sendfile always needs emulation */ |
800 | /* sendfile always needs emulation */ |
620 | static ssize_t |
801 | static ssize_t |
621 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count, worker *self) |
802 | eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self) |
622 | { |
803 | { |
623 | ssize_t res; |
804 | ssize_t res; |
624 | |
805 | |
625 | if (!count) |
806 | if (!count) |
626 | return 0; |
807 | return 0; |
… | |
… | |
710 | return res; |
891 | return res; |
711 | } |
892 | } |
712 | |
893 | |
713 | /* read a full directory */ |
894 | /* read a full directory */ |
714 | static void |
895 | static void |
715 | eio__scandir (eio_req *req, worker *self) |
896 | eio__scandir (eio_req *req, etp_worker *self) |
716 | { |
897 | { |
717 | DIR *dirp; |
898 | DIR *dirp; |
718 | union |
|
|
719 | { |
|
|
720 | EIO_STRUCT_DIRENT d; |
|
|
721 | char b [offsetof (EIO_STRUCT_DIRENT, d_name) + NAME_MAX + 1]; |
|
|
722 | } *u; |
|
|
723 | EIO_STRUCT_DIRENT *entp; |
899 | EIO_STRUCT_DIRENT *entp; |
724 | char *name, *names; |
900 | char *name, *names; |
725 | int memlen = 4096; |
901 | int memlen = 4096; |
726 | int memofs = 0; |
902 | int memofs = 0; |
727 | int res = 0; |
903 | int res = 0; |
728 | |
904 | |
729 | X_LOCK (wrklock); |
905 | X_LOCK (wrklock); |
730 | self->dirp = dirp = opendir (req->ptr1); |
906 | self->dirp = dirp = opendir (req->ptr1); |
731 | self->dbuf = u = malloc (sizeof (*u)); |
|
|
732 | req->flags |= EIO_FLAG_PTR2_FREE; |
907 | req->flags |= EIO_FLAG_PTR2_FREE; |
733 | req->ptr2 = names = malloc (memlen); |
908 | req->ptr2 = names = malloc (memlen); |
734 | X_UNLOCK (wrklock); |
909 | X_UNLOCK (wrklock); |
735 | |
910 | |
736 | if (dirp && u && names) |
911 | if (dirp && names) |
737 | for (;;) |
912 | for (;;) |
738 | { |
913 | { |
739 | errno = 0; |
914 | errno = 0; |
740 | readdir_r (dirp, &u->d, &entp); |
915 | entp = readdir (dirp); |
741 | |
916 | |
742 | if (!entp) |
917 | if (!entp) |
743 | break; |
918 | break; |
744 | |
919 | |
745 | name = entp->d_name; |
920 | name = entp->d_name; |
… | |
… | |
787 | req->result = -1; \ |
962 | req->result = -1; \ |
788 | break; \ |
963 | break; \ |
789 | } \ |
964 | } \ |
790 | } |
965 | } |
791 | |
966 | |
792 | X_THREAD_PROC (eio_proc) |
967 | X_THREAD_PROC (etp_proc) |
793 | { |
968 | { |
794 | eio_req *req; |
969 | ETP_REQ *req; |
795 | struct timespec ts; |
970 | struct timespec ts; |
796 | worker *self = (worker *)thr_arg; |
971 | etp_worker *self = (etp_worker *)thr_arg; |
797 | |
972 | |
798 | /* try to distribute timeouts somewhat randomly */ |
973 | /* try to distribute timeouts somewhat randomly */ |
799 | ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); |
974 | ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); |
800 | |
975 | |
801 | for (;;) |
976 | for (;;) |
802 | { |
977 | { |
803 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
|
|
804 | |
|
|
805 | X_LOCK (reqlock); |
978 | X_LOCK (reqlock); |
806 | |
979 | |
807 | for (;;) |
980 | for (;;) |
808 | { |
981 | { |
809 | self->req = req = reqq_shift (&req_queue); |
982 | self->req = req = reqq_shift (&req_queue); |
… | |
… | |
811 | if (req) |
984 | if (req) |
812 | break; |
985 | break; |
813 | |
986 | |
814 | ++idle; |
987 | ++idle; |
815 | |
988 | |
|
|
989 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
816 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
990 | if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) |
817 | { |
991 | { |
818 | if (idle > max_idle) |
992 | if (idle > max_idle) |
819 | { |
993 | { |
820 | --idle; |
994 | --idle; |
… | |
… | |
825 | goto quit; |
999 | goto quit; |
826 | } |
1000 | } |
827 | |
1001 | |
828 | /* we are allowed to idle, so do so without any timeout */ |
1002 | /* we are allowed to idle, so do so without any timeout */ |
829 | X_COND_WAIT (reqwait, reqlock); |
1003 | X_COND_WAIT (reqwait, reqlock); |
830 | ts.tv_sec = time (0) + IDLE_TIMEOUT; |
|
|
831 | } |
1004 | } |
832 | |
1005 | |
833 | --idle; |
1006 | --idle; |
834 | } |
1007 | } |
835 | |
1008 | |
836 | --nready; |
1009 | --nready; |
837 | |
1010 | |
838 | X_UNLOCK (reqlock); |
1011 | X_UNLOCK (reqlock); |
839 | |
1012 | |
840 | errno = 0; /* strictly unnecessary */ |
1013 | if (req->type < 0) |
|
|
1014 | goto quit; |
841 | |
1015 | |
842 | if (!EIO_CANCELLED (req)) |
1016 | if (!EIO_CANCELLED (req)) |
843 | switch (req->type) |
1017 | ETP_EXECUTE (self, req); |
844 | { |
|
|
845 | case EIO_READ: ALLOC (req->size); |
|
|
846 | req->result = req->offs >= 0 |
|
|
847 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
|
|
848 | : read (req->int1, req->ptr2, req->size); break; |
|
|
849 | case EIO_WRITE: req->result = req->offs >= 0 |
|
|
850 | ? pwrite (req->int1, req->ptr2, req->size, req->offs) |
|
|
851 | : write (req->int1, req->ptr2, req->size); break; |
|
|
852 | |
|
|
853 | case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break; |
|
|
854 | case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break; |
|
|
855 | |
|
|
856 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
857 | req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
858 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
859 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
860 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
861 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
862 | |
|
|
863 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
|
|
864 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
|
|
865 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
|
|
866 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
|
|
867 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
|
|
868 | case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break; |
|
|
869 | |
|
|
870 | case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break; |
|
|
871 | case EIO_CLOSE: req->result = close (req->int1); break; |
|
|
872 | case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break; |
|
|
873 | case EIO_UNLINK: req->result = unlink (req->ptr1); break; |
|
|
874 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
|
|
875 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
|
|
876 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
|
|
877 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
|
|
878 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
|
|
879 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
|
|
880 | |
|
|
881 | case EIO_READLINK: ALLOC (NAME_MAX); |
|
|
882 | req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; |
|
|
883 | |
|
|
884 | case EIO_SYNC: req->result = 0; sync (); break; |
|
|
885 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
|
|
886 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
|
|
887 | |
|
|
888 | case EIO_READDIR: eio__scandir (req, self); break; |
|
|
889 | |
|
|
890 | case EIO_BUSY: |
|
|
891 | #ifdef _WIN32 |
|
|
892 | Sleep (req->nv1 * 1000.); |
|
|
893 | #else |
|
|
894 | { |
|
|
895 | struct timeval tv; |
|
|
896 | |
|
|
897 | tv.tv_sec = req->nv1; |
|
|
898 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; |
|
|
899 | |
|
|
900 | req->result = select (0, 0, 0, 0, &tv); |
|
|
901 | } |
|
|
902 | #endif |
|
|
903 | break; |
|
|
904 | |
|
|
905 | case EIO_UTIME: |
|
|
906 | case EIO_FUTIME: |
|
|
907 | { |
|
|
908 | struct timeval tv[2]; |
|
|
909 | struct timeval *times; |
|
|
910 | |
|
|
911 | if (req->nv1 != -1. || req->nv2 != -1.) |
|
|
912 | { |
|
|
913 | tv[0].tv_sec = req->nv1; |
|
|
914 | tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.; |
|
|
915 | tv[1].tv_sec = req->nv2; |
|
|
916 | tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.; |
|
|
917 | |
|
|
918 | times = tv; |
|
|
919 | } |
|
|
920 | else |
|
|
921 | times = 0; |
|
|
922 | |
|
|
923 | |
|
|
924 | req->result = req->type == EIO_FUTIME |
|
|
925 | ? futimes (req->int1, times) |
|
|
926 | : utimes (req->ptr1, times); |
|
|
927 | } |
|
|
928 | |
|
|
929 | case EIO_GROUP: |
|
|
930 | case EIO_NOP: |
|
|
931 | req->result = 0; |
|
|
932 | break; |
|
|
933 | |
|
|
934 | case EIO_QUIT: |
|
|
935 | goto quit; |
|
|
936 | |
|
|
937 | default: |
|
|
938 | req->result = -1; |
|
|
939 | break; |
|
|
940 | } |
|
|
941 | |
|
|
942 | req->errorno = errno; |
|
|
943 | |
1018 | |
944 | X_LOCK (reslock); |
1019 | X_LOCK (reslock); |
945 | |
1020 | |
946 | ++npending; |
1021 | ++npending; |
947 | |
1022 | |
948 | if (!reqq_push (&res_queue, req) && want_poll_cb) |
1023 | if (!reqq_push (&res_queue, req) && want_poll_cb) |
949 | want_poll_cb (); |
1024 | want_poll_cb (); |
950 | |
1025 | |
951 | self->req = 0; |
1026 | self->req = 0; |
952 | worker_clear (self); |
1027 | etp_worker_clear (self); |
953 | |
1028 | |
954 | X_UNLOCK (reslock); |
1029 | X_UNLOCK (reslock); |
955 | } |
1030 | } |
956 | |
1031 | |
957 | quit: |
1032 | quit: |
958 | X_LOCK (wrklock); |
1033 | X_LOCK (wrklock); |
959 | worker_free (self); |
1034 | etp_worker_free (self); |
960 | X_UNLOCK (wrklock); |
1035 | X_UNLOCK (wrklock); |
961 | |
1036 | |
962 | return 0; |
1037 | return 0; |
963 | } |
1038 | } |
964 | |
1039 | |
965 | /*****************************************************************************/ |
1040 | /*****************************************************************************/ |
966 | |
1041 | |
967 | static void eio_atfork_prepare (void) |
|
|
968 | { |
|
|
969 | X_LOCK (wrklock); |
|
|
970 | X_LOCK (reqlock); |
|
|
971 | X_LOCK (reslock); |
|
|
972 | #if !HAVE_PREADWRITE |
|
|
973 | X_LOCK (preadwritelock); |
|
|
974 | #endif |
|
|
975 | #if !HAVE_READDIR_R |
|
|
976 | X_LOCK (readdirlock); |
|
|
977 | #endif |
|
|
978 | } |
|
|
979 | |
|
|
980 | static void eio_atfork_parent (void) |
|
|
981 | { |
|
|
982 | #if !HAVE_READDIR_R |
|
|
983 | X_UNLOCK (readdirlock); |
|
|
984 | #endif |
|
|
985 | #if !HAVE_PREADWRITE |
|
|
986 | X_UNLOCK (preadwritelock); |
|
|
987 | #endif |
|
|
988 | X_UNLOCK (reslock); |
|
|
989 | X_UNLOCK (reqlock); |
|
|
990 | X_UNLOCK (wrklock); |
|
|
991 | } |
|
|
992 | |
|
|
993 | static void eio_atfork_child (void) |
|
|
994 | { |
|
|
995 | eio_req *prv; |
|
|
996 | |
|
|
997 | while (prv = reqq_shift (&req_queue)) |
|
|
998 | eio_destroy (prv); |
|
|
999 | |
|
|
1000 | while (prv = reqq_shift (&res_queue)) |
|
|
1001 | eio_destroy (prv); |
|
|
1002 | |
|
|
1003 | while (wrk_first.next != &wrk_first) |
|
|
1004 | { |
|
|
1005 | worker *wrk = wrk_first.next; |
|
|
1006 | |
|
|
1007 | if (wrk->req) |
|
|
1008 | eio_destroy (wrk->req); |
|
|
1009 | |
|
|
1010 | worker_clear (wrk); |
|
|
1011 | worker_free (wrk); |
|
|
1012 | } |
|
|
1013 | |
|
|
1014 | started = 0; |
|
|
1015 | idle = 0; |
|
|
1016 | nreqs = 0; |
|
|
1017 | nready = 0; |
|
|
1018 | npending = 0; |
|
|
1019 | |
|
|
1020 | eio_atfork_parent (); |
|
|
1021 | } |
|
|
1022 | |
|
|
1023 | int eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
1042 | int eio_init (void (*want_poll)(void), void (*done_poll)(void)) |
1024 | { |
1043 | { |
1025 | want_poll_cb = want_poll; |
1044 | etp_init (want_poll, done_poll); |
1026 | done_poll_cb = done_poll; |
|
|
1027 | |
|
|
1028 | #ifdef _WIN32 |
|
|
1029 | X_MUTEX_CHECK (wrklock); |
|
|
1030 | X_MUTEX_CHECK (reslock); |
|
|
1031 | X_MUTEX_CHECK (reqlock); |
|
|
1032 | X_MUTEX_CHECK (reqwait); |
|
|
1033 | X_MUTEX_CHECK (preadwritelock); |
|
|
1034 | X_MUTEX_CHECK (readdirlock); |
|
|
1035 | |
|
|
1036 | X_COND_CHECK (reqwait); |
|
|
1037 | #endif |
|
|
1038 | |
|
|
1039 | X_THREAD_ATFORK (eio_atfork_prepare, eio_atfork_parent, eio_atfork_child); |
|
|
1040 | } |
1045 | } |
1041 | |
1046 | |
1042 | static void eio_api_destroy (eio_req *req) |
1047 | static void eio_api_destroy (eio_req *req) |
1043 | { |
1048 | { |
1044 | free (req); |
1049 | free (req); |
… | |
… | |
1049 | \ |
1054 | \ |
1050 | req = (eio_req *)calloc (1, sizeof *req); \ |
1055 | req = (eio_req *)calloc (1, sizeof *req); \ |
1051 | if (!req) \ |
1056 | if (!req) \ |
1052 | return 0; \ |
1057 | return 0; \ |
1053 | \ |
1058 | \ |
1054 | req->type = rtype; \ |
1059 | req->type = rtype; \ |
1055 | req->pri = EIO_DEFAULT_PRI + EIO_PRI_BIAS; \ |
1060 | req->pri = pri; \ |
1056 | req->finish = cb; \ |
1061 | req->finish = cb; \ |
|
|
1062 | req->data = data; \ |
1057 | req->destroy = eio_api_destroy; |
1063 | req->destroy = eio_api_destroy; |
1058 | |
1064 | |
1059 | #define SEND eio_submit (req); return req |
1065 | #define SEND eio_submit (req); return req |
1060 | |
1066 | |
1061 | #define PATH \ |
1067 | #define PATH \ |
… | |
… | |
1065 | { \ |
1071 | { \ |
1066 | eio_api_destroy (req); \ |
1072 | eio_api_destroy (req); \ |
1067 | return 0; \ |
1073 | return 0; \ |
1068 | } |
1074 | } |
1069 | |
1075 | |
|
|
1076 | static void eio_execute (etp_worker *self, eio_req *req) |
|
|
1077 | { |
|
|
1078 | errno = 0; |
|
|
1079 | |
|
|
1080 | switch (req->type) |
|
|
1081 | { |
|
|
1082 | case EIO_READ: ALLOC (req->size); |
|
|
1083 | req->result = req->offs >= 0 |
|
|
1084 | ? pread (req->int1, req->ptr2, req->size, req->offs) |
|
|
1085 | : read (req->int1, req->ptr2, req->size); break; |
|
|
1086 | case EIO_WRITE: req->result = req->offs >= 0 |
|
|
1087 | ? pwrite (req->int1, req->ptr2, req->size, req->offs) |
|
|
1088 | : write (req->int1, req->ptr2, req->size); break; |
|
|
1089 | |
|
|
1090 | case EIO_READAHEAD: req->result = readahead (req->int1, req->offs, req->size); break; |
|
|
1091 | case EIO_SENDFILE: req->result = eio__sendfile (req->int1, req->int2, req->offs, req->size, self); break; |
|
|
1092 | |
|
|
1093 | case EIO_STAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1094 | req->result = stat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1095 | case EIO_LSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1096 | req->result = lstat (req->ptr1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1097 | case EIO_FSTAT: ALLOC (sizeof (EIO_STRUCT_STAT)); |
|
|
1098 | req->result = fstat (req->int1, (EIO_STRUCT_STAT *)req->ptr2); break; |
|
|
1099 | |
|
|
1100 | case EIO_CHOWN: req->result = chown (req->ptr1, req->int2, req->int3); break; |
|
|
1101 | case EIO_FCHOWN: req->result = fchown (req->int1, req->int2, req->int3); break; |
|
|
1102 | case EIO_CHMOD: req->result = chmod (req->ptr1, (mode_t)req->int2); break; |
|
|
1103 | case EIO_FCHMOD: req->result = fchmod (req->int1, (mode_t)req->int2); break; |
|
|
1104 | case EIO_TRUNCATE: req->result = truncate (req->ptr1, req->offs); break; |
|
|
1105 | case EIO_FTRUNCATE: req->result = ftruncate (req->int1, req->offs); break; |
|
|
1106 | |
|
|
1107 | case EIO_OPEN: req->result = open (req->ptr1, req->int1, (mode_t)req->int2); break; |
|
|
1108 | case EIO_CLOSE: req->result = close (req->int1); break; |
|
|
1109 | case EIO_DUP2: req->result = dup2 (req->int1, req->int2); break; |
|
|
1110 | case EIO_UNLINK: req->result = unlink (req->ptr1); break; |
|
|
1111 | case EIO_RMDIR: req->result = rmdir (req->ptr1); break; |
|
|
1112 | case EIO_MKDIR: req->result = mkdir (req->ptr1, (mode_t)req->int2); break; |
|
|
1113 | case EIO_RENAME: req->result = rename (req->ptr1, req->ptr2); break; |
|
|
1114 | case EIO_LINK: req->result = link (req->ptr1, req->ptr2); break; |
|
|
1115 | case EIO_SYMLINK: req->result = symlink (req->ptr1, req->ptr2); break; |
|
|
1116 | case EIO_MKNOD: req->result = mknod (req->ptr1, (mode_t)req->int2, (dev_t)req->offs); break; |
|
|
1117 | |
|
|
1118 | case EIO_READLINK: ALLOC (NAME_MAX); |
|
|
1119 | req->result = readlink (req->ptr1, req->ptr2, NAME_MAX); break; |
|
|
1120 | |
|
|
1121 | case EIO_SYNC: req->result = 0; sync (); break; |
|
|
1122 | case EIO_FSYNC: req->result = fsync (req->int1); break; |
|
|
1123 | case EIO_FDATASYNC: req->result = fdatasync (req->int1); break; |
|
|
1124 | |
|
|
1125 | case EIO_READDIR: eio__scandir (req, self); break; |
|
|
1126 | |
|
|
1127 | case EIO_BUSY: |
|
|
1128 | #ifdef _WIN32 |
|
|
1129 | Sleep (req->nv1 * 1000.); |
|
|
1130 | #else |
|
|
1131 | { |
|
|
1132 | struct timeval tv; |
|
|
1133 | |
|
|
1134 | tv.tv_sec = req->nv1; |
|
|
1135 | tv.tv_usec = (req->nv1 - tv.tv_sec) * 1000000.; |
|
|
1136 | |
|
|
1137 | req->result = select (0, 0, 0, 0, &tv); |
|
|
1138 | } |
|
|
1139 | #endif |
|
|
1140 | break; |
|
|
1141 | |
|
|
1142 | case EIO_UTIME: |
|
|
1143 | case EIO_FUTIME: |
|
|
1144 | { |
|
|
1145 | struct timeval tv[2]; |
|
|
1146 | struct timeval *times; |
|
|
1147 | |
|
|
1148 | if (req->nv1 != -1. || req->nv2 != -1.) |
|
|
1149 | { |
|
|
1150 | tv[0].tv_sec = req->nv1; |
|
|
1151 | tv[0].tv_usec = (req->nv1 - tv[0].tv_sec) * 1000000.; |
|
|
1152 | tv[1].tv_sec = req->nv2; |
|
|
1153 | tv[1].tv_usec = (req->nv2 - tv[1].tv_sec) * 1000000.; |
|
|
1154 | |
|
|
1155 | times = tv; |
|
|
1156 | } |
|
|
1157 | else |
|
|
1158 | times = 0; |
|
|
1159 | |
|
|
1160 | |
|
|
1161 | req->result = req->type == EIO_FUTIME |
|
|
1162 | ? futimes (req->int1, times) |
|
|
1163 | : utimes (req->ptr1, times); |
|
|
1164 | } |
|
|
1165 | |
|
|
1166 | case EIO_GROUP: |
|
|
1167 | case EIO_NOP: |
|
|
1168 | req->result = 0; |
|
|
1169 | break; |
|
|
1170 | |
|
|
1171 | case EIO_CUSTOM: |
|
|
1172 | req->feed (req); |
|
|
1173 | break; |
|
|
1174 | |
|
|
1175 | default: |
|
|
1176 | req->result = -1; |
|
|
1177 | break; |
|
|
1178 | } |
|
|
1179 | |
|
|
1180 | req->errorno = errno; |
|
|
1181 | } |
|
|
1182 | |
|
|
1183 | #ifndef EIO_NO_WRAPPERS |
|
|
1184 | |
1070 | eio_req *eio_nop (int pri, eio_cb cb, void *data) |
1185 | eio_req *eio_nop (int pri, eio_cb cb, void *data) |
1071 | { |
1186 | { |
1072 | REQ (EIO_NOP); SEND; |
1187 | REQ (EIO_NOP); SEND; |
1073 | } |
1188 | } |
1074 | |
1189 | |
… | |
… | |
1247 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1362 | eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) |
1248 | { |
1363 | { |
1249 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
1364 | return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); |
1250 | } |
1365 | } |
1251 | |
1366 | |
|
|
1367 | eio_req *eio_custom (eio_cb execute, int pri, eio_cb cb, void *data) |
|
|
1368 | { |
|
|
1369 | REQ (EIO_CUSTOM); req->feed = execute; SEND; |
|
|
1370 | } |
|
|
1371 | |
|
|
1372 | #endif |
|
|
1373 | |
1252 | eio_req *eio_grp (eio_cb cb, void *data) |
1374 | eio_req *eio_grp (eio_cb cb, void *data) |
1253 | { |
1375 | { |
1254 | const int pri = EIO_PRI_MAX; |
1376 | const int pri = EIO_PRI_MAX; |
1255 | |
1377 | |
1256 | REQ (EIO_GROUP); SEND; |
1378 | REQ (EIO_GROUP); SEND; |
… | |
… | |
1297 | /*****************************************************************************/ |
1419 | /*****************************************************************************/ |
1298 | /* misc garbage */ |
1420 | /* misc garbage */ |
1299 | |
1421 | |
1300 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
1422 | ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) |
1301 | { |
1423 | { |
1302 | worker wrk; |
1424 | etp_worker wrk; |
1303 | |
1425 | |
1304 | wrk.dbuf = 0; |
1426 | wrk.dbuf = 0; |
1305 | |
1427 | |
1306 | eio__sendfile (ofd, ifd, offset, count, &wrk); |
1428 | eio__sendfile (ofd, ifd, offset, count, &wrk); |
1307 | |
1429 | |