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