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