no_left           544 lib/btree.c    	int i, no_left, no_right;
no_left           562 lib/btree.c    		no_left = getfill(geo, left, 0);
no_left           563 lib/btree.c    		if (fill + no_left <= geo->no_pairs) {
no_left           565 lib/btree.c    					left, no_left,