| … | |
… | |
| 396 | { |
396 | { |
| 397 | return ev_rt_now; |
397 | return ev_rt_now; |
| 398 | } |
398 | } |
| 399 | #endif |
399 | #endif |
| 400 | |
400 | |
| 401 | #define array_roundsize(type,n) (((n) | 4) & ~3) |
401 | int inline_size |
|
|
402 | array_nextsize (int elem, int cur, int cnt) |
|
|
403 | { |
|
|
404 | int ncur = cur + 1; |
|
|
405 | |
|
|
406 | do |
|
|
407 | ncur <<= 1; |
|
|
408 | while (cnt > ncur); |
|
|
409 | |
|
|
410 | /* if size > 4096, round to 4096 - 4 * longs to accomodate malloc overhead */ |
|
|
411 | if (elem * ncur > 4096) |
|
|
412 | { |
|
|
413 | ncur *= elem; |
|
|
414 | ncur = (ncur + elem + 4095 + sizeof (void *) * 4) & ~4095; |
|
|
415 | ncur = ncur - sizeof (void *) * 4; |
|
|
416 | ncur /= elem; |
|
|
417 | } |
|
|
418 | |
|
|
419 | return ncur; |
|
|
420 | } |
|
|
421 | |
|
|
422 | inline_speed void * |
|
|
423 | array_realloc (int elem, void *base, int *cur, int cnt) |
|
|
424 | { |
|
|
425 | *cur = array_nextsize (elem, *cur, cnt); |
|
|
426 | return ev_realloc (base, elem * *cur); |
|
|
427 | } |
| 402 | |
428 | |
| 403 | #define array_needsize(type,base,cur,cnt,init) \ |
429 | #define array_needsize(type,base,cur,cnt,init) \ |
| 404 | if (expect_false ((cnt) > cur)) \ |
430 | if (expect_false ((cnt) > (cur))) \ |
| 405 | { \ |
431 | { \ |
| 406 | int newcnt = cur; \ |
432 | int ocur_ = (cur); \ |
| 407 | do \ |
433 | (base) = (type *)array_realloc \ |
| 408 | { \ |
434 | (sizeof (type), (base), &(cur), (cnt)); \ |
| 409 | newcnt = array_roundsize (type, newcnt << 1); \ |
435 | init ((base) + (ocur_), (cur) - ocur_); \ |
| 410 | } \ |
|
|
| 411 | while ((cnt) > newcnt); \ |
|
|
| 412 | \ |
|
|
| 413 | base = (type *)ev_realloc (base, sizeof (type) * (newcnt));\ |
|
|
| 414 | init (base + cur, newcnt - cur); \ |
|
|
| 415 | cur = newcnt; \ |
|
|
| 416 | } |
436 | } |
| 417 | |
437 | |
|
|
438 | #if 0 |
| 418 | #define array_slim(type,stem) \ |
439 | #define array_slim(type,stem) \ |
| 419 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
440 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
| 420 | { \ |
441 | { \ |
| 421 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
442 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
| 422 | base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
443 | base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
| 423 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
444 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
| 424 | } |
445 | } |
|
|
446 | #endif |
| 425 | |
447 | |
| 426 | #define array_free(stem, idx) \ |
448 | #define array_free(stem, idx) \ |
| 427 | ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
449 | ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
| 428 | |
450 | |
| 429 | /*****************************************************************************/ |
451 | /*****************************************************************************/ |
