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