bp_index 35 fs/nilfs2/btree.c path[level].bp_index = 0; bp_index 554 fs/nilfs2/btree.c path[level].bp_index = index; bp_index 586 fs/nilfs2/btree.c path[level].bp_index = index; bp_index 613 fs/nilfs2/btree.c path[level].bp_index = index; bp_index 625 fs/nilfs2/btree.c path[level].bp_index = index; bp_index 662 fs/nilfs2/btree.c index = path[level].bp_index + next_adj; bp_index 725 fs/nilfs2/btree.c index = path[level].bp_index + 1; bp_index 748 fs/nilfs2/btree.c p.index = path[level + 1].bp_index + 1; bp_index 754 fs/nilfs2/btree.c path[level + 1].bp_index = p.index; bp_index 766 fs/nilfs2/btree.c path[level].bp_index = index; bp_index 784 fs/nilfs2/btree.c path[level].bp_index, key); bp_index 787 fs/nilfs2/btree.c } while ((path[level].bp_index == 0) && bp_index 794 fs/nilfs2/btree.c path[level].bp_index, key); bp_index 808 fs/nilfs2/btree.c nilfs_btree_node_insert(node, path[level].bp_index, bp_index 813 fs/nilfs2/btree.c if (path[level].bp_index == 0) bp_index 819 fs/nilfs2/btree.c nilfs_btree_node_insert(node, path[level].bp_index, bp_index 840 fs/nilfs2/btree.c if (n > path[level].bp_index) { bp_index 860 fs/nilfs2/btree.c path[level].bp_index += lnchildren; bp_index 861 fs/nilfs2/btree.c path[level + 1].bp_index--; bp_index 865 fs/nilfs2/btree.c path[level].bp_index -= n; bp_index 886 fs/nilfs2/btree.c if (n > nchildren - path[level].bp_index) { bp_index 899 fs/nilfs2/btree.c path[level + 1].bp_index++; bp_index 902 fs/nilfs2/btree.c path[level + 1].bp_index--; bp_index 908 fs/nilfs2/btree.c path[level].bp_index -= nilfs_btree_node_get_nchildren(node); bp_index 909 fs/nilfs2/btree.c path[level + 1].bp_index++; bp_index 932 fs/nilfs2/btree.c if (n > nchildren - path[level].bp_index) { bp_index 945 fs/nilfs2/btree.c path[level].bp_index -= nilfs_btree_node_get_nchildren(node); bp_index 946 fs/nilfs2/btree.c nilfs_btree_node_insert(right, path[level].bp_index, bp_index 965 fs/nilfs2/btree.c path[level + 1].bp_index++; bp_index 1008 fs/nilfs2/btree.c if (path[level].bp_index > 0) { bp_index 1011 fs/nilfs2/btree.c path[level].bp_index - 1, bp_index 1019 fs/nilfs2/btree.c return nilfs_btree_node_get_ptr(node, path[level].bp_index, bp_index 1084 fs/nilfs2/btree.c pindex = path[level + 1].bp_index; bp_index 1258 fs/nilfs2/btree.c nilfs_btree_node_delete(node, path[level].bp_index, bp_index 1262 fs/nilfs2/btree.c if (path[level].bp_index == 0) bp_index 1267 fs/nilfs2/btree.c nilfs_btree_node_delete(node, path[level].bp_index, bp_index 1302 fs/nilfs2/btree.c path[level].bp_index += n; bp_index 1329 fs/nilfs2/btree.c path[level + 1].bp_index++; bp_index 1332 fs/nilfs2/btree.c path[level + 1].bp_index--; bp_index 1361 fs/nilfs2/btree.c path[level].bp_index += nilfs_btree_node_get_nchildren(left); bp_index 1386 fs/nilfs2/btree.c path[level + 1].bp_index++; bp_index 1435 fs/nilfs2/btree.c for (level = NILFS_BTREE_LEVEL_NODE_MIN, dindex = path[level].bp_index; bp_index 1453 fs/nilfs2/btree.c pindex = path[level + 1].bp_index; bp_index 1904 fs/nilfs2/btree.c nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, bp_index 1950 fs/nilfs2/btree.c nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, bp_index 2036 fs/nilfs2/btree.c path[level + 1].bp_index, bp_index 2185 fs/nilfs2/btree.c ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, bp_index 2202 fs/nilfs2/btree.c nilfs_btree_node_set_ptr(parent, path[level + 1].bp_index, blocknr, bp_index 2205 fs/nilfs2/btree.c key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); bp_index 2228 fs/nilfs2/btree.c ptr = nilfs_btree_node_get_ptr(parent, path[level + 1].bp_index, bp_index 2236 fs/nilfs2/btree.c key = nilfs_btree_node_get_key(parent, path[level + 1].bp_index); bp_index 32 fs/nilfs2/btree.h int bp_index;