Lines Matching refs:fill
413 int fill; in btree_grow() local
419 fill = getfill(geo, head->node, 0); in btree_grow()
420 setkey(geo, node, 0, bkey(geo, head->node, fill - 1)); in btree_grow()
431 int fill; in btree_shrink() local
437 fill = getfill(geo, node, 0); in btree_shrink()
438 BUG_ON(fill > 1); in btree_shrink()
449 int i, pos, fill, err; in btree_insert_level() local
461 fill = getfill(geo, node, pos); in btree_insert_level()
463 BUG_ON(pos < fill && keycmp(geo, node, pos, key) == 0); in btree_insert_level()
465 if (fill == geo->no_pairs) { in btree_insert_level()
473 bkey(geo, node, fill / 2 - 1), in btree_insert_level()
479 for (i = 0; i < fill / 2; i++) { in btree_insert_level()
482 setkey(geo, node, i, bkey(geo, node, i + fill / 2)); in btree_insert_level()
483 setval(geo, node, i, bval(geo, node, i + fill / 2)); in btree_insert_level()
484 clearpair(geo, node, i + fill / 2); in btree_insert_level()
486 if (fill & 1) { in btree_insert_level()
487 setkey(geo, node, i, bkey(geo, node, fill - 1)); in btree_insert_level()
488 setval(geo, node, i, bval(geo, node, fill - 1)); in btree_insert_level()
489 clearpair(geo, node, fill - 1); in btree_insert_level()
493 BUG_ON(fill >= geo->no_pairs); in btree_insert_level()
496 for (i = fill; i > pos; i--) { in btree_insert_level()
537 unsigned long *key, int level, unsigned long *child, int fill) in rebalance() argument
542 if (fill == 0) { in rebalance()
559 if (fill + no_left <= geo->no_pairs) { in rebalance()
562 child, fill, in rebalance()
570 if (fill + no_right <= geo->no_pairs) { in rebalance()
572 child, fill, in rebalance()
591 int i, pos, fill; in btree_remove_level() local
603 fill = getfill(geo, node, pos); in btree_remove_level()
609 for (i = pos; i < fill - 1; i++) { in btree_remove_level()
613 clearpair(geo, node, fill - 1); in btree_remove_level()
615 if (fill - 1 < geo->no_pairs / 2) { in btree_remove_level()
617 rebalance(head, geo, key, level, node, fill - 1); in btree_remove_level()
618 else if (fill - 1 == 1) in btree_remove_level()