| 464 | } |
| 465 | |
| 466 | bool |
| 467 | ckh_insert(tsd_t *tsd, ckh_t *ckh, const void *key, const void *data) { |
| 468 | bool ret; |
| 469 | |
| 470 | assert(ckh != NULL); |
| 471 | assert(ckh_search(ckh, key, NULL, NULL)); |
| 472 | |
| 473 | #ifdef CKH_COUNT |
| 474 | ckh->ninserts++; |
| 475 | #endif |
| 476 | |
| 477 | while (ckh_try_insert(ckh, &key, &data)) { |
| 478 | if (ckh_grow(tsd, ckh)) { |
| 479 | ret = true; |
| 480 | goto label_return; |
| 481 | } |
| 482 | } |
| 483 | |
| 484 | ret = false; |
| 485 | label_return: |
| 486 | return ret; |
| 487 | } |
| 488 | |
| 489 | bool |
| 490 | ckh_remove(tsd_t *tsd, ckh_t *ckh, const void *searchkey, void **key, |