Lines Matching refs:fill
412 int fill; in btree_grow() local
418 fill = getfill(geo, head->node, 0); in btree_grow()
419 setkey(geo, node, 0, bkey(geo, head->node, fill - 1)); in btree_grow()
430 int fill; in btree_shrink() local
436 fill = getfill(geo, node, 0); in btree_shrink()
437 BUG_ON(fill > 1); in btree_shrink()
448 int i, pos, fill, err; in btree_insert_level() local
460 fill = getfill(geo, node, pos); in btree_insert_level()
462 BUG_ON(pos < fill && keycmp(geo, node, pos, key) == 0); in btree_insert_level()
464 if (fill == geo->no_pairs) { in btree_insert_level()
472 bkey(geo, node, fill / 2 - 1), in btree_insert_level()
478 for (i = 0; i < fill / 2; i++) { in btree_insert_level()
481 setkey(geo, node, i, bkey(geo, node, i + fill / 2)); in btree_insert_level()
482 setval(geo, node, i, bval(geo, node, i + fill / 2)); in btree_insert_level()
483 clearpair(geo, node, i + fill / 2); in btree_insert_level()
485 if (fill & 1) { in btree_insert_level()
486 setkey(geo, node, i, bkey(geo, node, fill - 1)); in btree_insert_level()
487 setval(geo, node, i, bval(geo, node, fill - 1)); in btree_insert_level()
488 clearpair(geo, node, fill - 1); in btree_insert_level()
492 BUG_ON(fill >= geo->no_pairs); in btree_insert_level()
495 for (i = fill; i > pos; i--) { in btree_insert_level()
536 unsigned long *key, int level, unsigned long *child, int fill) in rebalance() argument
541 if (fill == 0) { in rebalance()
558 if (fill + no_left <= geo->no_pairs) { in rebalance()
561 child, fill, in rebalance()
569 if (fill + no_right <= geo->no_pairs) { in rebalance()
571 child, fill, in rebalance()
590 int i, pos, fill; in btree_remove_level() local
602 fill = getfill(geo, node, pos); in btree_remove_level()
608 for (i = pos; i < fill - 1; i++) { in btree_remove_level()
612 clearpair(geo, node, fill - 1); in btree_remove_level()
614 if (fill - 1 < geo->no_pairs / 2) { in btree_remove_level()
616 rebalance(head, geo, key, level, node, fill - 1); in btree_remove_level()
617 else if (fill - 1 == 1) in btree_remove_level()