Lines Matching refs:fill
417 int fill; in btree_grow() local
423 fill = getfill(geo, head->node, 0); in btree_grow()
424 setkey(geo, node, 0, bkey(geo, head->node, fill - 1)); in btree_grow()
435 int fill; in btree_shrink() local
441 fill = getfill(geo, node, 0); in btree_shrink()
442 BUG_ON(fill > 1); in btree_shrink()
453 int i, pos, fill, err; in btree_insert_level() local
465 fill = getfill(geo, node, pos); in btree_insert_level()
467 BUG_ON(pos < fill && keycmp(geo, node, pos, key) == 0); in btree_insert_level()
469 if (fill == geo->no_pairs) { in btree_insert_level()
477 bkey(geo, node, fill / 2 - 1), in btree_insert_level()
483 for (i = 0; i < fill / 2; i++) { in btree_insert_level()
486 setkey(geo, node, i, bkey(geo, node, i + fill / 2)); in btree_insert_level()
487 setval(geo, node, i, bval(geo, node, i + fill / 2)); in btree_insert_level()
488 clearpair(geo, node, i + fill / 2); in btree_insert_level()
490 if (fill & 1) { in btree_insert_level()
491 setkey(geo, node, i, bkey(geo, node, fill - 1)); in btree_insert_level()
492 setval(geo, node, i, bval(geo, node, fill - 1)); in btree_insert_level()
493 clearpair(geo, node, fill - 1); in btree_insert_level()
497 BUG_ON(fill >= geo->no_pairs); in btree_insert_level()
500 for (i = fill; i > pos; i--) { in btree_insert_level()
541 unsigned long *key, int level, unsigned long *child, int fill) in rebalance() argument
546 if (fill == 0) { in rebalance()
563 if (fill + no_left <= geo->no_pairs) { in rebalance()
566 child, fill, in rebalance()
574 if (fill + no_right <= geo->no_pairs) { in rebalance()
576 child, fill, in rebalance()
595 int i, pos, fill; in btree_remove_level() local
607 fill = getfill(geo, node, pos); in btree_remove_level()
613 for (i = pos; i < fill - 1; i++) { in btree_remove_level()
617 clearpair(geo, node, fill - 1); in btree_remove_level()
619 if (fill - 1 < geo->no_pairs / 2) { in btree_remove_level()
621 rebalance(head, geo, key, level, node, fill - 1); in btree_remove_level()
622 else if (fill - 1 == 1) in btree_remove_level()