Lines Matching defs:fill
412 int fill;
418 fill = getfill(geo, head->node, 0);
419 setkey(geo, node, 0, bkey(geo, head->node, fill - 1));
430 int fill;
436 fill = getfill(geo, node, 0);
437 BUG_ON(fill > 1);
448 int i, pos, fill, err;
460 fill = getfill(geo, node, pos);
462 BUG_ON(pos < fill && keycmp(geo, node, pos, key) == 0);
464 if (fill == geo->no_pairs) {
472 bkey(geo, node, fill / 2 - 1),
478 for (i = 0; i < fill / 2; i++) {
481 setkey(geo, node, i, bkey(geo, node, i + fill / 2));
482 setval(geo, node, i, bval(geo, node, i + fill / 2));
483 clearpair(geo, node, i + fill / 2);
485 if (fill & 1) {
486 setkey(geo, node, i, bkey(geo, node, fill - 1));
487 setval(geo, node, i, bval(geo, node, fill - 1));
488 clearpair(geo, node, fill - 1);
492 BUG_ON(fill >= geo->no_pairs);
495 for (i = fill; i > pos; i--) {
536 unsigned long *key, int level, unsigned long *child, int fill)
541 if (fill == 0) {
558 if (fill + no_left <= geo->no_pairs) {
561 child, fill,
569 if (fill + no_right <= geo->no_pairs) {
571 child, fill,
581 * nodes can be merged". Which means that the average fill of
590 int i, pos, fill;
602 fill = getfill(geo, node, pos);
608 for (i = pos; i < fill - 1; i++) {
612 clearpair(geo, node, fill - 1);
614 if (fill - 1 < geo->no_pairs / 2) {
616 rebalance(head, geo, key, level, node, fill - 1);
617 else if (fill - 1 == 1)