Lines Matching defs:nchildren
107 nilfs_btree_node_set_nchildren(struct nilfs_btree_node *node, int nchildren)
109 node->bn_nchildren = cpu_to_le16(nchildren);
163 int level, int nchildren, int ncmax,
172 nilfs_btree_node_set_nchildren(node, nchildren);
176 for (i = 0; i < nchildren; i++) {
244 int nchildren;
248 nchildren = nilfs_btree_node_get_nchildren(node);
249 if (index < nchildren) {
251 (nchildren - index) * sizeof(*dkeys));
253 (nchildren - index) * sizeof(*dptrs));
257 nchildren++;
258 nilfs_btree_node_set_nchildren(node, nchildren);
269 int nchildren;
275 nchildren = nilfs_btree_node_get_nchildren(node);
281 if (index < nchildren - 1) {
283 (nchildren - index - 1) * sizeof(*dkeys));
285 (nchildren - index - 1) * sizeof(*dptrs));
287 nchildren--;
288 nilfs_btree_node_set_nchildren(node, nchildren);
343 int level, flags, nchildren;
348 nchildren = nilfs_btree_node_get_nchildren(node);
353 nchildren < 0 ||
354 nchildren > NILFS_BTREE_NODE_NCHILDREN_MAX(size))) {
356 "bad btree node (ino=%lu, blocknr=%llu): level = %d, flags = 0x%x, nchildren = %d",
358 flags, nchildren);
374 int level, flags, nchildren;
379 nchildren = nilfs_btree_node_get_nchildren(node);
383 nchildren < 0 ||
384 nchildren > NILFS_BTREE_ROOT_NCHILDREN_MAX)) {
386 "bad btree root (ino=%lu): level = %d, flags = 0x%x, nchildren = %d",
387 inode->i_ino, level, flags, nchildren);
840 int nchildren, lnchildren, n, move, ncblk;
844 nchildren = nilfs_btree_node_get_nchildren(node);
849 n = (nchildren + lnchildren + 1) / 2 - lnchildren;
886 int nchildren, rnchildren, n, move, ncblk;
890 nchildren = nilfs_btree_node_get_nchildren(node);
895 n = (nchildren + rnchildren + 1) / 2 - rnchildren;
896 if (n > nchildren - path[level].bp_index) {
933 int nchildren, n, move, ncblk;
937 nchildren = nilfs_btree_node_get_nchildren(node);
941 n = (nchildren + 1) / 2;
942 if (n > nchildren - path[level].bp_index) {
1288 int nchildren, lnchildren, n, ncblk;
1294 nchildren = nilfs_btree_node_get_nchildren(node);
1298 n = (nchildren + lnchildren) / 2 - nchildren;
1320 int nchildren, rnchildren, n, ncblk;
1326 nchildren = nilfs_btree_node_get_nchildren(node);
1330 n = (nchildren + rnchildren) / 2 - nchildren;
1653 int nchildren, ret;
1662 nchildren = nilfs_btree_node_get_nchildren(root);
1663 if (nchildren > 1)
1665 ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,
1676 nchildren = nilfs_btree_node_get_nchildren(node);
1677 maxkey = nilfs_btree_node_get_key(node, nchildren - 1);
1678 nextmaxkey = (nchildren > 1) ?
1679 nilfs_btree_node_get_key(node, nchildren - 2) : 0;
1693 int nchildren, ncmax, i, ret;
1703 nchildren = nilfs_btree_node_get_nchildren(root);
1704 WARN_ON(nchildren > 1);
1705 ptr = nilfs_btree_node_get_ptr(root, nchildren - 1,
1718 nchildren = nilfs_btree_node_get_nchildren(node);
1719 if (nchildren < nitems)
1720 nitems = nchildren;