ncmax 130 fs/nilfs2/btree.c nilfs_btree_node_dptrs(const struct nilfs_btree_node *node, int ncmax) ncmax 132 fs/nilfs2/btree.c return (__le64 *)(nilfs_btree_node_dkeys(node) + ncmax); ncmax 149 fs/nilfs2/btree.c int ncmax) ncmax 151 fs/nilfs2/btree.c return le64_to_cpu(*(nilfs_btree_node_dptrs(node, ncmax) + index)); ncmax 156 fs/nilfs2/btree.c int ncmax) ncmax 158 fs/nilfs2/btree.c *(nilfs_btree_node_dptrs(node, ncmax) + index) = cpu_to_le64(ptr); ncmax 162 fs/nilfs2/btree.c int level, int nchildren, int ncmax, ncmax 174 fs/nilfs2/btree.c dptrs = nilfs_btree_node_dptrs(node, ncmax); ncmax 239 fs/nilfs2/btree.c __u64 key, __u64 ptr, int ncmax) ncmax 246 fs/nilfs2/btree.c dptrs = nilfs_btree_node_dptrs(node, ncmax); ncmax 262 fs/nilfs2/btree.c __u64 *keyp, __u64 *ptrp, int ncmax) ncmax 271 fs/nilfs2/btree.c dptrs = nilfs_btree_node_dptrs(node, ncmax); ncmax 466 fs/nilfs2/btree.c int ncmax; /* nof children in the parent node */ ncmax 492 fs/nilfs2/btree.c n > 0 && i < ra->ncmax; n--, i++) { ncmax 493 fs/nilfs2/btree.c ptr2 = nilfs_btree_node_get_ptr(ra->node, i, ra->ncmax); ncmax 543 fs/nilfs2/btree.c int level, index, found, ncmax, ret; ncmax 556 fs/nilfs2/btree.c ncmax = nilfs_btree_nchildren_per_block(btree); ncmax 562 fs/nilfs2/btree.c &p.ncmax); ncmax 579 fs/nilfs2/btree.c if (index < ncmax) { ncmax 580 fs/nilfs2/btree.c ptr = nilfs_btree_node_get_ptr(node, index, ncmax); ncmax 603 fs/nilfs2/btree.c int index, level, ncmax, ret; ncmax 614 fs/nilfs2/btree.c ncmax = nilfs_btree_nchildren_per_block(btree); ncmax 624 fs/nilfs2/btree.c ptr = nilfs_btree_node_get_ptr(node, index, ncmax); ncmax 701 fs/nilfs2/btree.c int ret, cnt, index, maxlevel, ncmax; ncmax 724 fs/nilfs2/btree.c node = nilfs_btree_get_node(btree, path, level, &ncmax); ncmax 731 fs/nilfs2/btree.c ptr2 = nilfs_btree_node_get_ptr(node, index, ncmax); ncmax 747 fs/nilfs2/btree.c p.node = nilfs_btree_get_node(btree, path, level + 1, &p.ncmax); ncmax 753 fs/nilfs2/btree.c ptr2 = nilfs_btree_node_get_ptr(p.node, p.index, p.ncmax); ncmax 764 fs/nilfs2/btree.c ncmax = nilfs_btree_nchildren_per_block(btree); ncmax 1001 fs/nilfs2/btree.c int level, ncmax; ncmax 1009 fs/nilfs2/btree.c node = nilfs_btree_get_node(btree, path, level, &ncmax); ncmax 1012 fs/nilfs2/btree.c ncmax); ncmax 1018 fs/nilfs2/btree.c node = nilfs_btree_get_node(btree, path, level, &ncmax); ncmax 1020 fs/nilfs2/btree.c ncmax); ncmax 1054 fs/nilfs2/btree.c int pindex, level, ncmax, ncblk, ret; ncmax 1083 fs/nilfs2/btree.c parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); ncmax 1089 fs/nilfs2/btree.c ncmax); ncmax 1107 fs/nilfs2/btree.c ncmax); ncmax 1428 fs/nilfs2/btree.c int pindex, dindex, level, ncmin, ncmax, ncblk, ret; ncmax 1452 fs/nilfs2/btree.c parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); ncmax 1459 fs/nilfs2/btree.c ncmax); ncmax 1479 fs/nilfs2/btree.c ncmax); ncmax 1684 fs/nilfs2/btree.c int nchildren, ncmax, i, ret; ncmax 1691 fs/nilfs2/btree.c ncmax = NILFS_BTREE_ROOT_NCHILDREN_MAX; ncmax 1702 fs/nilfs2/btree.c ncmax = nilfs_btree_nchildren_per_block(btree); ncmax 1713 fs/nilfs2/btree.c dptrs = nilfs_btree_node_dptrs(node, ncmax); ncmax 1900 fs/nilfs2/btree.c int ncmax, ret; ncmax 1902 fs/nilfs2/btree.c parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); ncmax 1905 fs/nilfs2/btree.c ncmax); ncmax 1935 fs/nilfs2/btree.c int ncmax; ncmax 1949 fs/nilfs2/btree.c parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); ncmax 1951 fs/nilfs2/btree.c path[level].bp_newreq.bpr_ptr, ncmax); ncmax 2024 fs/nilfs2/btree.c int ncmax; ncmax 2034 fs/nilfs2/btree.c parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); ncmax 2037 fs/nilfs2/btree.c ncmax); ncmax 2182 fs/nilfs2/btree.c int ncmax, ret; ncmax 2184 fs/nilfs2/btree.c parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); ncmax 2186 fs/nilfs2/btree.c ncmax); ncmax 2203 fs/nilfs2/btree.c ncmax); ncmax 2225 fs/nilfs2/btree.c int ncmax, ret; ncmax 2227 fs/nilfs2/btree.c parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax); ncmax 2229 fs/nilfs2/btree.c ncmax);