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

Comparing libeio/eio.c (file contents):
Revision 1.10 by root, Tue May 13 17:08:15 2008 UTC vs.
Revision 1.14 by root, Sat May 17 12:17:25 2008 UTC

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#define ETP_REQ eio_req
129#define ETP_DESTROY(req) eio_destroy (req)
130static int eio_finish (eio_req *req);
131#define ETP_FINISH(req) eio_finish (req)
132
133#define ETP_WORKER_CLEAR(req) \
134 if (wrk->dbuf) \
135 { \
136 free (wrk->dbuf); \
137 wrk->dbuf = 0; \
138 } \
139 \
140 if (wrk->dirp) \
141 { \
142 closedir (wrk->dirp); \
143 wrk->dirp = 0; \
144 }
145#define ETP_WORKER_COMMON \
146 void *dbuf; \
147 DIR *dirp;
148
149/*****************************************************************************/
150
151#define ETP_NUM_PRI (ETP_PRI_MAX - ETP_PRI_MIN + 1)
152
153/* calculcate time difference in ~1/EIO_TICKS of a second */
154static int tvdiff (struct timeval *tv1, struct timeval *tv2)
155{
156 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS
157 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
158}
159
160static unsigned int started, idle, wanted = 4;
161
84static void (*want_poll_cb) (void); 162static void (*want_poll_cb) (void);
85static void (*done_poll_cb) (void); 163static void (*done_poll_cb) (void);
86 164
87static unsigned int max_poll_time = 0; 165static unsigned int max_poll_time; /* reslock */
88static unsigned int max_poll_reqs = 0; 166static unsigned int max_poll_reqs; /* reslock */
89 167
90/* calculcate time difference in ~1/EIO_TICKS of a second */ 168static volatile unsigned int nreqs; /* reqlock */
91static int tvdiff (struct timeval *tv1, struct timeval *tv2) 169static volatile unsigned int nready; /* reqlock */
92{ 170static volatile unsigned int npending; /* reqlock */
93 return (tv2->tv_sec - tv1->tv_sec ) * EIO_TICKS 171static volatile unsigned int max_idle = 4;
94 + ((tv2->tv_usec - tv1->tv_usec) >> 10);
95}
96 172
97static unsigned int started, idle, wanted = 4;
98
99/* worker threads management */
100static mutex_t wrklock = X_MUTEX_INIT; 173static mutex_t wrklock = X_MUTEX_INIT;
101
102typedef 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
115static worker wrk_first = { &wrk_first, &wrk_first, 0 };
116
117static 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
132static void worker_free (worker *wrk)
133{
134 wrk->next->prev = wrk->prev;
135 wrk->prev->next = wrk->next;
136
137 free (wrk);
138}
139
140static volatile unsigned int nreqs, nready, npending;
141static volatile unsigned int max_idle = 4;
142
143static mutex_t reslock = X_MUTEX_INIT; 174static mutex_t reslock = X_MUTEX_INIT;
144static mutex_t reqlock = X_MUTEX_INIT; 175static mutex_t reqlock = X_MUTEX_INIT;
145static cond_t reqwait = X_COND_INIT; 176static cond_t reqwait = X_COND_INIT;
146 177
178typedef struct etp_worker
179{
180 /* locked by wrklock */
181 struct etp_worker *prev, *next;
182
183 thread_t tid;
184
185 /* locked by reslock, reqlock or wrklock */
186 ETP_REQ *req; /* currently processed request */
187
188 ETP_WORKER_COMMON
189} etp_worker;
190
191static etp_worker wrk_first = { &wrk_first, &wrk_first, 0 }; /* NOT etp */
192
193#define ETP_WORKER_LOCK(wrk) X_LOCK (wrklock)
194#define ETP_WORKER_UNLOCK(wrk) X_UNLOCK (wrklock)
195
196/* worker threads management */
197
198static void etp_worker_clear (etp_worker *wrk)
199{
200 ETP_WORKER_CLEAR (wrk);
201}
202
203static void etp_worker_free (etp_worker *wrk)
204{
205 wrk->next->prev = wrk->prev;
206 wrk->prev->next = wrk->next;
207
208 free (wrk);
209}
210
147unsigned int eio_nreqs (void) 211static unsigned int etp_nreqs (void)
148{ 212{
213 int retval;
214 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
215 retval = nreqs;
216 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
149 return nreqs; 217 return retval;
150} 218}
151 219
152unsigned int eio_nready (void) 220static unsigned int etp_nready (void)
153{ 221{
154 unsigned int retval; 222 unsigned int retval;
155 223
156 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 224 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
157 retval = nready; 225 retval = nready;
158 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 226 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
159 227
160 return retval; 228 return retval;
161} 229}
162 230
163unsigned int eio_npending (void) 231static unsigned int etp_npending (void)
164{ 232{
165 unsigned int retval; 233 unsigned int retval;
166 234
167 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 235 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
168 retval = npending; 236 retval = npending;
169 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock); 237 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
170 238
171 return retval; 239 return retval;
172} 240}
173 241
174unsigned int eio_nthreads (void) 242static unsigned int etp_nthreads (void)
175{ 243{
176 unsigned int retval; 244 unsigned int retval;
177 245
178 if (WORDACCESS_UNSAFE) X_LOCK (reqlock); 246 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
179 retval = started; 247 retval = started;
… …
186 * a somewhat faster data structure might be nice, but 254 * a somewhat faster data structure might be nice, but
187 * with 8 priorities this actually needs <20 insns 255 * with 8 priorities this actually needs <20 insns
188 * per shift, the most expensive operation. 256 * per shift, the most expensive operation.
189 */ 257 */
190typedef struct { 258typedef struct {
191 eio_req *qs[EIO_NUM_PRI], *qe[EIO_NUM_PRI]; /* qstart, qend */ 259 ETP_REQ *qs[ETP_NUM_PRI], *qe[ETP_NUM_PRI]; /* qstart, qend */
192 int size; 260 int size;
193} reqq; 261} etp_reqq;
194 262
195static reqq req_queue; 263static etp_reqq req_queue;
196static reqq res_queue; 264static etp_reqq res_queue;
197 265
198static int reqq_push (reqq *q, eio_req *req) 266static int reqq_push (etp_reqq *q, ETP_REQ *req)
199{ 267{
200 int pri = req->pri; 268 int pri = req->pri;
201 req->next = 0; 269 req->next = 0;
202 270
203 if (q->qe[pri]) 271 if (q->qe[pri])
… …
209 q->qe[pri] = q->qs[pri] = req; 277 q->qe[pri] = q->qs[pri] = req;
210 278
211 return q->size++; 279 return q->size++;
212} 280}
213 281
214static eio_req *reqq_shift (reqq *q) 282static ETP_REQ *reqq_shift (etp_reqq *q)
215{ 283{
216 int pri; 284 int pri;
217 285
218 if (!q->size) 286 if (!q->size)
219 return 0; 287 return 0;
220 288
221 --q->size; 289 --q->size;
222 290
223 for (pri = EIO_NUM_PRI; pri--; ) 291 for (pri = ETP_NUM_PRI; pri--; )
224 { 292 {
225 eio_req *req = q->qs[pri]; 293 eio_req *req = q->qs[pri];
226 294
227 if (req) 295 if (req)
228 { 296 {
… …
234 } 302 }
235 303
236 abort (); 304 abort ();
237} 305}
238 306
239static void grp_try_feed (eio_req *grp) 307static void etp_atfork_prepare (void)
240{ 308{
241 while (grp->size < grp->int2 && !EIO_CANCELLED (grp)) 309 X_LOCK (wrklock);
310 X_LOCK (reqlock);
311 X_LOCK (reslock);
312#if !HAVE_PREADWRITE
313 X_LOCK (preadwritelock);
314#endif
315#if !HAVE_READDIR_R
316 X_LOCK (readdirlock);
317#endif
318}
319
320static void etp_atfork_parent (void)
321{
322#if !HAVE_READDIR_R
323 X_UNLOCK (readdirlock);
324#endif
325#if !HAVE_PREADWRITE
326 X_UNLOCK (preadwritelock);
327#endif
328 X_UNLOCK (reslock);
329 X_UNLOCK (reqlock);
330 X_UNLOCK (wrklock);
331}
332
333static void etp_atfork_child (void)
334{
335 ETP_REQ *prv;
336
337 while (prv = reqq_shift (&req_queue))
338 ETP_DESTROY (prv);
339
340 while (prv = reqq_shift (&res_queue))
341 ETP_DESTROY (prv);
342
343 while (wrk_first.next != &wrk_first)
242 { 344 {
243 int old_len = grp->size; 345 etp_worker *wrk = wrk_first.next;
244 346
245 EIO_FEED (grp); 347 if (wrk->req)
348 ETP_DESTROY (wrk->req);
246 349
247 /* stop if no progress has been made */ 350 etp_worker_clear (wrk);
248 if (old_len == grp->size) 351 etp_worker_free (wrk);
249 {
250 grp->feed = 0;
251 break;
252 }
253 }
254}
255
256static int eio_finish (eio_req *req);
257
258static 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
272void 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
280static int eio_finish (eio_req *req)
281{
282 int res = EIO_FINISH (req);
283
284 if (req->grp)
285 { 352 }
286 int res2;
287 eio_req *grp = req->grp;
288 353
289 /* unlink request */ 354 started = 0;
290 if (req->grp_next) req->grp_next->grp_prev = req->grp_prev; 355 idle = 0;
291 if (req->grp_prev) req->grp_prev->grp_next = req->grp_next; 356 nreqs = 0;
357 nready = 0;
358 npending = 0;
292 359
293 if (grp->grp_first == req) 360 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} 361}
306 362
307void eio_grp_cancel (eio_req *grp) 363static void
308{ 364etp_once_init (void)
309 for (grp = grp->grp_first; grp; grp = grp->grp_next) 365{
310 eio_cancel (grp); 366 X_THREAD_ATFORK (etp_atfork_prepare, etp_atfork_parent, etp_atfork_child);
311} 367}
312 368
313void eio_cancel (eio_req *req) 369static int
370etp_init (void (*want_poll)(void), void (*done_poll)(void))
314{ 371{
315 X_LOCK (wrklock); 372 static pthread_once_t doinit = PTHREAD_ONCE_INIT;
316 req->flags |= EIO_FLAG_CANCELLED;
317 X_UNLOCK (wrklock);
318 373
319 eio_grp_cancel (req); 374 pthread_once (&doinit, etp_once_init);
320}
321 375
376 want_poll_cb = want_poll;
377 done_poll_cb = done_poll;
378}
379
322X_THREAD_PROC (eio_proc); 380X_THREAD_PROC (etp_proc);
323 381
324static void start_thread (void) 382static void etp_start_thread (void)
325{ 383{
326 worker *wrk = calloc (1, sizeof (worker)); 384 etp_worker *wrk = calloc (1, sizeof (etp_worker));
327 385
328 /*TODO*/ 386 /*TODO*/
329 assert (("unable to allocate worker thread data", wrk)); 387 assert (("unable to allocate worker thread data", wrk));
330 388
331 X_LOCK (wrklock); 389 X_LOCK (wrklock);
332 390
333 if (thread_create (&wrk->tid, eio_proc, (void *)wrk)) 391 if (thread_create (&wrk->tid, etp_proc, (void *)wrk))
334 { 392 {
335 wrk->prev = &wrk_first; 393 wrk->prev = &wrk_first;
336 wrk->next = wrk_first.next; 394 wrk->next = wrk_first.next;
337 wrk_first.next->prev = wrk; 395 wrk_first.next->prev = wrk;
338 wrk_first.next = wrk; 396 wrk_first.next = wrk;
… …
342 free (wrk); 400 free (wrk);
343 401
344 X_UNLOCK (wrklock); 402 X_UNLOCK (wrklock);
345} 403}
346 404
347static void maybe_start_thread (void) 405static void etp_maybe_start_thread (void)
348{ 406{
349 if (eio_nthreads () >= wanted) 407 if (etp_nthreads () >= wanted)
350 return; 408 return;
351 409
352 /* todo: maybe use idle here, but might be less exact */ 410 /* todo: maybe use idle here, but might be less exact */
353 if (0 <= (int)eio_nthreads () + (int)eio_npending () - (int)eio_nreqs ()) 411 if (0 <= (int)etp_nthreads () + (int)etp_npending () - (int)etp_nreqs ())
354 return; 412 return;
355 413
356 start_thread (); 414 etp_start_thread ();
357} 415}
358 416
359void 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
372static void end_thread (void) 417static void etp_end_thread (void)
373{ 418{
374 eio_req *req = calloc (1, sizeof (eio_req)); 419 eio_req *req = calloc (1, sizeof (eio_req));
375 420
376 req->type = EIO_QUIT; 421 req->type = -1;
377 req->pri = EIO_PRI_MAX + EIO_PRI_BIAS; 422 req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
378 423
379 X_LOCK (reqlock); 424 X_LOCK (reqlock);
380 reqq_push (&req_queue, req); 425 reqq_push (&req_queue, req);
381 X_COND_SIGNAL (reqwait); 426 X_COND_SIGNAL (reqwait);
382 X_UNLOCK (reqlock); 427 X_UNLOCK (reqlock);
… …
384 X_LOCK (wrklock); 429 X_LOCK (wrklock);
385 --started; 430 --started;
386 X_UNLOCK (wrklock); 431 X_UNLOCK (wrklock);
387} 432}
388 433
389void 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
396void 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
403void 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
410void eio_set_min_parallel (unsigned int nthreads)
411{
412 if (wanted < nthreads)
413 wanted = nthreads;
414}
415
416void 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
425int eio_poll (void) 434static int etp_poll (void)
426{ 435{
427 int maxreqs = max_poll_reqs; 436 unsigned int maxreqs;
437 unsigned int maxtime;
428 struct timeval tv_start, tv_now; 438 struct timeval tv_start, tv_now;
429 eio_req *req;
430 439
440 X_LOCK (reslock);
441 maxreqs = max_poll_reqs;
442 maxtime = max_poll_time;
443 X_UNLOCK (reslock);
444
431 if (max_poll_time) 445 if (maxtime)
432 gettimeofday (&tv_start, 0); 446 gettimeofday (&tv_start, 0);
433 447
434 for (;;) 448 for (;;)
435 { 449 {
450 ETP_REQ *req;
451
436 maybe_start_thread (); 452 etp_maybe_start_thread ();
437 453
438 X_LOCK (reslock); 454 X_LOCK (reslock);
439 req = reqq_shift (&res_queue); 455 req = reqq_shift (&res_queue);
440 456
441 if (req) 457 if (req)
… …
449 X_UNLOCK (reslock); 465 X_UNLOCK (reslock);
450 466
451 if (!req) 467 if (!req)
452 return 0; 468 return 0;
453 469
470 X_LOCK (reqlock);
454 --nreqs; 471 --nreqs;
472 X_UNLOCK (reqlock);
455 473
456 if (req->type == EIO_GROUP && req->size) 474 if (req->type == EIO_GROUP && req->size)
457 { 475 {
458 req->int1 = 1; /* mark request as delayed */ 476 req->int1 = 1; /* mark request as delayed */
459 continue; 477 continue;
460 } 478 }
461 else 479 else
462 { 480 {
463 int res = eio_finish (req); 481 int res = ETP_FINISH (req);
464 if (res) 482 if (res)
465 return res; 483 return res;
466 } 484 }
467 485
468 if (maxreqs && !--maxreqs) 486 if (maxreqs && !--maxreqs)
469 break; 487 break;
470 488
471 if (max_poll_time) 489 if (maxtime)
472 { 490 {
473 gettimeofday (&tv_now, 0); 491 gettimeofday (&tv_now, 0);
474 492
475 if (tvdiff (&tv_start, &tv_now) >= max_poll_time) 493 if (tvdiff (&tv_start, &tv_now) >= maxtime)
476 break; 494 break;
477 } 495 }
478 } 496 }
479 497
480 errno = EAGAIN; 498 errno = EAGAIN;
481 return -1; 499 return -1;
500}
501
502static void etp_cancel (ETP_REQ *req)
503{
504 X_LOCK (wrklock);
505 req->flags |= EIO_FLAG_CANCELLED;
506 X_UNLOCK (wrklock);
507
508 eio_grp_cancel (req);
509}
510
511static void etp_submit (ETP_REQ *req)
512{
513 req->pri -= ETP_PRI_MIN;
514
515 if (req->pri < ETP_PRI_MIN - ETP_PRI_MIN) req->pri = ETP_PRI_MIN - ETP_PRI_MIN;
516 if (req->pri > ETP_PRI_MAX - ETP_PRI_MIN) req->pri = ETP_PRI_MAX - ETP_PRI_MIN;
517
518 X_LOCK (reqlock);
519 ++nreqs;
520 ++nready;
521 reqq_push (&req_queue, req);
522 X_COND_SIGNAL (reqwait);
523 X_UNLOCK (reqlock);
524
525 etp_maybe_start_thread ();
526}
527
528static void etp_set_max_poll_time (double nseconds)
529{
530 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
531 max_poll_time = nseconds;
532 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
533}
534
535static void etp_set_max_poll_reqs (unsigned int maxreqs)
536{
537 if (WORDACCESS_UNSAFE) X_LOCK (reslock);
538 max_poll_reqs = maxreqs;
539 if (WORDACCESS_UNSAFE) X_UNLOCK (reslock);
540}
541
542static void etp_set_max_idle (unsigned int nthreads)
543{
544 if (WORDACCESS_UNSAFE) X_LOCK (reqlock);
545 max_idle = nthreads <= 0 ? 1 : nthreads;
546 if (WORDACCESS_UNSAFE) X_UNLOCK (reqlock);
547}
548
549static void etp_set_min_parallel (unsigned int nthreads)
550{
551 if (wanted < nthreads)
552 wanted = nthreads;
553}
554
555static void etp_set_max_parallel (unsigned int nthreads)
556{
557 if (wanted > nthreads)
558 wanted = nthreads;
559
560 while (started > wanted)
561 etp_end_thread ();
562}
563
564/*****************************************************************************/
565
566static void grp_try_feed (eio_req *grp)
567{
568 while (grp->size < grp->int2 && !EIO_CANCELLED (grp))
569 {
570 int old_len = grp->size;
571
572 EIO_FEED (grp);
573
574 /* stop if no progress has been made */
575 if (old_len == grp->size)
576 {
577 grp->feed = 0;
578 break;
579 }
580 }
581}
582
583static int grp_dec (eio_req *grp)
584{
585 --grp->size;
586
587 /* call feeder, if applicable */
588 grp_try_feed (grp);
589
590 /* finish, if done */
591 if (!grp->size && grp->int1)
592 return eio_finish (grp);
593 else
594 return 0;
595}
596
597void eio_destroy (eio_req *req)
598{
599 if ((req)->flags & EIO_FLAG_PTR1_FREE) free (req->ptr1);
600 if ((req)->flags & EIO_FLAG_PTR2_FREE) free (req->ptr2);
601
602 EIO_DESTROY (req);
603}
604
605static int eio_finish (eio_req *req)
606{
607 int res = EIO_FINISH (req);
608
609 if (req->grp)
610 {
611 int res2;
612 eio_req *grp = req->grp;
613
614 /* unlink request */
615 if (req->grp_next) req->grp_next->grp_prev = req->grp_prev;
616 if (req->grp_prev) req->grp_prev->grp_next = req->grp_next;
617
618 if (grp->grp_first == req)
619 grp->grp_first = req->grp_next;
620
621 res2 = grp_dec (grp);
622
623 if (!res && res2)
624 res = res2;
625 }
626
627 eio_destroy (req);
628
629 return res;
630}
631
632void eio_grp_cancel (eio_req *grp)
633{
634 for (grp = grp->grp_first; grp; grp = grp->grp_next)
635 eio_cancel (grp);
636}
637
638void eio_cancel (eio_req *req)
639{
640 etp_cancel (req);
641}
642
643void eio_submit (eio_req *req)
644{
645 etp_submit (req);
646}
647
648unsigned int eio_nreqs (void)
649{
650 return etp_nreqs ();
651}
652
653unsigned int eio_nready (void)
654{
655 return etp_nready ();
656}
657
658unsigned int eio_npending (void)
659{
660 return etp_npending ();
661}
662
663unsigned int eio_nthreads (void)
664{
665 return etp_nthreads ();
666}
667
668void eio_set_max_poll_time (double nseconds)
669{
670 etp_set_max_poll_time (nseconds);
671}
672
673void eio_set_max_poll_reqs (unsigned int maxreqs)
674{
675 etp_set_max_poll_reqs (maxreqs);
676}
677
678void eio_set_max_idle (unsigned int nthreads)
679{
680 etp_set_max_idle (nthreads);
681}
682
683void eio_set_min_parallel (unsigned int nthreads)
684{
685 etp_set_min_parallel (nthreads);
686}
687
688void eio_set_max_parallel (unsigned int nthreads)
689{
690 etp_set_max_parallel (nthreads);
691}
692
693int eio_poll (void)
694{
695 return etp_poll ();
482} 696}
483 697
484/*****************************************************************************/ 698/*****************************************************************************/
485/* work around various missing functions */ 699/* work around various missing functions */
486 700
… …
616} 830}
617#endif 831#endif
618 832
619/* sendfile always needs emulation */ 833/* sendfile always needs emulation */
620static ssize_t 834static ssize_t
621eio__sendfile (int ofd, int ifd, off_t offset, size_t count, worker *self) 835eio__sendfile (int ofd, int ifd, off_t offset, size_t count, etp_worker *self)
622{ 836{
623 ssize_t res; 837 ssize_t res;
624 838
625 if (!count) 839 if (!count)
626 return 0; 840 return 0;
… …
710 return res; 924 return res;
711} 925}
712 926
713/* read a full directory */ 927/* read a full directory */
714static void 928static void
715eio__scandir (eio_req *req, worker *self) 929eio__scandir (eio_req *req, etp_worker *self)
716{ 930{
717 DIR *dirp; 931 DIR *dirp;
718 union 932 union
719 { 933 {
720 EIO_STRUCT_DIRENT d; 934 EIO_STRUCT_DIRENT d;
… …
787 req->result = -1; \ 1001 req->result = -1; \
788 break; \ 1002 break; \
789 } \ 1003 } \
790 } 1004 }
791 1005
792X_THREAD_PROC (eio_proc) 1006X_THREAD_PROC (etp_proc)
793{ 1007{
794 eio_req *req; 1008 ETP_REQ *req;
795 struct timespec ts; 1009 struct timespec ts;
796 worker *self = (worker *)thr_arg; 1010 etp_worker *self = (etp_worker *)thr_arg;
797 1011
798 /* try to distribute timeouts somewhat randomly */ 1012 /* try to distribute timeouts somewhat randomly */
799 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL); 1013 ts.tv_nsec = ((unsigned long)self & 1023UL) * (1000000000UL / 1024UL);
800 1014
801 for (;;) 1015 for (;;)
802 { 1016 {
803 ts.tv_sec = time (0) + IDLE_TIMEOUT;
804
805 X_LOCK (reqlock); 1017 X_LOCK (reqlock);
806 1018
807 for (;;) 1019 for (;;)
808 { 1020 {
809 self->req = req = reqq_shift (&req_queue); 1021 self->req = req = reqq_shift (&req_queue);
… …
811 if (req) 1023 if (req)
812 break; 1024 break;
813 1025
814 ++idle; 1026 ++idle;
815 1027
1028 ts.tv_sec = time (0) + IDLE_TIMEOUT;
816 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT) 1029 if (X_COND_TIMEDWAIT (reqwait, reqlock, ts) == ETIMEDOUT)
817 { 1030 {
818 if (idle > max_idle) 1031 if (idle > max_idle)
819 { 1032 {
820 --idle; 1033 --idle;
… …
825 goto quit; 1038 goto quit;
826 } 1039 }
827 1040
828 /* we are allowed to idle, so do so without any timeout */ 1041 /* we are allowed to idle, so do so without any timeout */
829 X_COND_WAIT (reqwait, reqlock); 1042 X_COND_WAIT (reqwait, reqlock);
830 ts.tv_sec = time (0) + IDLE_TIMEOUT;
831 } 1043 }
832 1044
833 --idle; 1045 --idle;
834 } 1046 }
835 1047
… …
929 case EIO_GROUP: 1141 case EIO_GROUP:
930 case EIO_NOP: 1142 case EIO_NOP:
931 req->result = 0; 1143 req->result = 0;
932 break; 1144 break;
933 1145
934 case EIO_QUIT: 1146 case -1:
935 goto quit; 1147 goto quit;
936 1148
937 default: 1149 default:
938 req->result = -1; 1150 req->result = -1;
939 break; 1151 break;
… …
947 1159
948 if (!reqq_push (&res_queue, req) && want_poll_cb) 1160 if (!reqq_push (&res_queue, req) && want_poll_cb)
949 want_poll_cb (); 1161 want_poll_cb ();
950 1162
951 self->req = 0; 1163 self->req = 0;
952 worker_clear (self); 1164 etp_worker_clear (self);
953 1165
954 X_UNLOCK (reslock); 1166 X_UNLOCK (reslock);
955 } 1167 }
956 1168
957quit: 1169quit:
958 X_LOCK (wrklock); 1170 X_LOCK (wrklock);
959 worker_free (self); 1171 etp_worker_free (self);
960 X_UNLOCK (wrklock); 1172 X_UNLOCK (wrklock);
961 1173
962 return 0; 1174 return 0;
963} 1175}
964 1176
965/*****************************************************************************/ 1177/*****************************************************************************/
966 1178
967static 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
980static 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
993static 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
1023int eio_init (void (*want_poll)(void), void (*done_poll)(void)) 1179int eio_init (void (*want_poll)(void), void (*done_poll)(void))
1024{ 1180{
1025 want_poll_cb = want_poll; 1181 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} 1182}
1041 1183
1042static void eio_api_destroy (eio_req *req) 1184static void eio_api_destroy (eio_req *req)
1043{ 1185{
1044 free (req); 1186 free (req);
… …
1049 \ 1191 \
1050 req = (eio_req *)calloc (1, sizeof *req); \ 1192 req = (eio_req *)calloc (1, sizeof *req); \
1051 if (!req) \ 1193 if (!req) \
1052 return 0; \ 1194 return 0; \
1053 \ 1195 \
1054 req->type = rtype; \ 1196 req->type = rtype; \
1055 req->pri = EIO_DEFAULT_PRI + EIO_PRI_BIAS; \ 1197 req->pri = pri; \
1056 req->finish = cb; \ 1198 req->finish = cb; \
1199 req->data = data; \
1057 req->destroy = eio_api_destroy; 1200 req->destroy = eio_api_destroy;
1058 1201
1059#define SEND eio_submit (req); return req 1202#define SEND eio_submit (req); return req
1060 1203
1061#define PATH \ 1204#define PATH \
… …
1065 { \ 1208 { \
1066 eio_api_destroy (req); \ 1209 eio_api_destroy (req); \
1067 return 0; \ 1210 return 0; \
1068 } 1211 }
1069 1212
1213#ifndef EIO_NO_WRAPPERS
1214
1070eio_req *eio_nop (int pri, eio_cb cb, void *data) 1215eio_req *eio_nop (int pri, eio_cb cb, void *data)
1071{ 1216{
1072 REQ (EIO_NOP); SEND; 1217 REQ (EIO_NOP); SEND;
1073} 1218}
1074 1219
… …
1247eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data) 1392eio_req *eio_rename (const char *path, const char *new_path, int pri, eio_cb cb, void *data)
1248{ 1393{
1249 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data); 1394 return eio__2path (EIO_RENAME, path, new_path, pri, cb, data);
1250} 1395}
1251 1396
1397#endif
1398
1252eio_req *eio_grp (eio_cb cb, void *data) 1399eio_req *eio_grp (eio_cb cb, void *data)
1253{ 1400{
1254 const int pri = EIO_PRI_MAX; 1401 const int pri = EIO_PRI_MAX;
1255 1402
1256 REQ (EIO_GROUP); SEND; 1403 REQ (EIO_GROUP); SEND;
… …
1297/*****************************************************************************/ 1444/*****************************************************************************/
1298/* misc garbage */ 1445/* misc garbage */
1299 1446
1300ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count) 1447ssize_t eio_sendfile_sync (int ofd, int ifd, off_t offset, size_t count)
1301{ 1448{
1302 worker wrk; 1449 etp_worker wrk;
1303 1450
1304 wrk.dbuf = 0; 1451 wrk.dbuf = 0;
1305 1452
1306 eio__sendfile (ofd, ifd, offset, count, &wrk); 1453 eio__sendfile (ofd, ifd, offset, count, &wrk);
1307 1454

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines