nilfs_btree_node_get_nchildren
if (nilfs_btree_node_get_nchildren(node) < ncblk) {
if (nilfs_btree_node_get_nchildren(sib) < ncblk) {
if (pindex < nilfs_btree_node_get_nchildren(parent) - 1) {
if (nilfs_btree_node_get_nchildren(sib) < ncblk) {
if (nilfs_btree_node_get_nchildren(node) <
nchildren = nilfs_btree_node_get_nchildren(node);
lnchildren = nilfs_btree_node_get_nchildren(left);
nchildren = nilfs_btree_node_get_nchildren(node);
rnchildren = nilfs_btree_node_get_nchildren(right);
n = nilfs_btree_node_get_nchildren(node);
path[level].bp_index += nilfs_btree_node_get_nchildren(left);
n = nilfs_btree_node_get_nchildren(right);
n = nilfs_btree_node_get_nchildren(child);
if (nilfs_btree_node_get_nchildren(node) > ncmin) {
if (nilfs_btree_node_get_nchildren(sib) > ncmin) {
nilfs_btree_node_get_nchildren(parent) - 1) {
if (nilfs_btree_node_get_nchildren(sib) > ncmin) {
if (nilfs_btree_node_get_nchildren(node) - 1 <=
nchildren = nilfs_btree_node_get_nchildren(root);
nchildren = nilfs_btree_node_get_nchildren(node);
nchildren = nilfs_btree_node_get_nchildren(root);
nchildren = nilfs_btree_node_get_nchildren(node);
lnchildren = nilfs_btree_node_get_nchildren(left);
rnchildren = nilfs_btree_node_get_nchildren(right);
lnchildren = nilfs_btree_node_get_nchildren(left);
rnchildren = nilfs_btree_node_get_nchildren(right);
nchildren = nilfs_btree_node_get_nchildren(node);
nchildren = nilfs_btree_node_get_nchildren(node);
high = nilfs_btree_node_get_nchildren(node) - 1;
nchildren = nilfs_btree_node_get_nchildren(node);
nchildren = nilfs_btree_node_get_nchildren(node);
if (level < minlevel || nilfs_btree_node_get_nchildren(node) <= 0)
index = nilfs_btree_node_get_nchildren(node) - 1;
index = nilfs_btree_node_get_nchildren(node) - 1;
if (index < nilfs_btree_node_get_nchildren(node)) {
while (index < nilfs_btree_node_get_nchildren(node)) {
if (p.index >= nilfs_btree_node_get_nchildren(p.node) ||
nchildren = nilfs_btree_node_get_nchildren(node);
lnchildren = nilfs_btree_node_get_nchildren(left);
nchildren = nilfs_btree_node_get_nchildren(node);
rnchildren = nilfs_btree_node_get_nchildren(right);
path[level].bp_index -= nilfs_btree_node_get_nchildren(node);
nchildren = nilfs_btree_node_get_nchildren(node);
path[level].bp_index -= nilfs_btree_node_get_nchildren(node);
n = nilfs_btree_node_get_nchildren(root);