131 nilfs_btree_node_dptrs(const struct nilfs_btree_node *node, int ncmax)  in nilfs_btree_node_dptrs()  argument
133 	return (__le64 *)(nilfs_btree_node_dkeys(node) + ncmax);  in nilfs_btree_node_dptrs()
150 			 int ncmax)  in nilfs_btree_node_get_ptr()  argument
152 	return le64_to_cpu(*(nilfs_btree_node_dptrs(node, ncmax) + index));  in nilfs_btree_node_get_ptr()
157 			 int ncmax)  in nilfs_btree_node_set_ptr()  argument
159 	*(nilfs_btree_node_dptrs(node, ncmax) + index) = cpu_to_le64(ptr);  in nilfs_btree_node_set_ptr()
163 				  int level, int nchildren, int ncmax,  in nilfs_btree_node_init()  argument
175 	dptrs = nilfs_btree_node_dptrs(node, ncmax);  in nilfs_btree_node_init()
240 				    __u64 key, __u64 ptr, int ncmax)  in nilfs_btree_node_insert()  argument
247 	dptrs = nilfs_btree_node_dptrs(node, ncmax);  in nilfs_btree_node_insert()
263 				    __u64 *keyp, __u64 *ptrp, int ncmax)  in nilfs_btree_node_delete()  argument
272 	dptrs = nilfs_btree_node_dptrs(node, ncmax);  in nilfs_btree_node_delete()
467 	int ncmax;			/* nof children in the parent node */  member
494 		     n > 0 && i < ra->ncmax; n--, i++) {  in __nilfs_btree_get_block()
495 			ptr2 = nilfs_btree_node_get_ptr(ra->node, i, ra->ncmax);  in __nilfs_btree_get_block()
545 	int level, index, found, ncmax, ret;  in nilfs_btree_do_lookup()  local
558 	ncmax = nilfs_btree_nchildren_per_block(btree);  in nilfs_btree_do_lookup()
564 						      &p.ncmax);  in nilfs_btree_do_lookup()
581 		if (index < ncmax) {  in nilfs_btree_do_lookup()
582 			ptr = nilfs_btree_node_get_ptr(node, index, ncmax);  in nilfs_btree_do_lookup()
605 	int index, level, ncmax, ret;  in nilfs_btree_do_lookup_last()  local
616 	ncmax = nilfs_btree_nchildren_per_block(btree);  in nilfs_btree_do_lookup_last()
626 		ptr = nilfs_btree_node_get_ptr(node, index, ncmax);  in nilfs_btree_do_lookup_last()
703 	int ret, cnt, index, maxlevel, ncmax;  in nilfs_btree_lookup_contig()  local
726 	node = nilfs_btree_get_node(btree, path, level, &ncmax);  in nilfs_btree_lookup_contig()
733 			ptr2 = nilfs_btree_node_get_ptr(node, index, ncmax);  in nilfs_btree_lookup_contig()
749 		p.node = nilfs_btree_get_node(btree, path, level + 1, &p.ncmax);  in nilfs_btree_lookup_contig()
755 		ptr2 = nilfs_btree_node_get_ptr(p.node, p.index, p.ncmax);  in nilfs_btree_lookup_contig()
766 		ncmax = nilfs_btree_nchildren_per_block(btree);  in nilfs_btree_lookup_contig()
1003 	int level, ncmax;  in nilfs_btree_find_near()  local
1011 		node = nilfs_btree_get_node(btree, path, level, &ncmax);  in nilfs_btree_find_near()
1014 						ncmax);  in nilfs_btree_find_near()
1020 		node = nilfs_btree_get_node(btree, path, level, &ncmax);  in nilfs_btree_find_near()
1022 						ncmax);  in nilfs_btree_find_near()
1056 	int pindex, level, ncmax, ncblk, ret;  in nilfs_btree_prepare_insert()  local
1085 		parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_prepare_insert()
1091 							  ncmax);  in nilfs_btree_prepare_insert()
1109 							  ncmax);  in nilfs_btree_prepare_insert()
1430 	int pindex, dindex, level, ncmin, ncmax, ncblk, ret;  in nilfs_btree_prepare_delete()  local
1454 		parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_prepare_delete()
1461 							  ncmax);  in nilfs_btree_prepare_delete()
1481 							  ncmax);  in nilfs_btree_prepare_delete()
1686 	int nchildren, ncmax, i, ret;  in nilfs_btree_gather_data()  local
1693 		ncmax = NILFS_BTREE_ROOT_NCHILDREN_MAX;  in nilfs_btree_gather_data()
1704 		ncmax = nilfs_btree_nchildren_per_block(btree);  in nilfs_btree_gather_data()
1715 	dptrs = nilfs_btree_node_dptrs(node, ncmax);  in nilfs_btree_gather_data()
1906 	int ncmax, ret;  in nilfs_btree_prepare_update_v()  local
1908 	parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_prepare_update_v()
1911 					 ncmax);  in nilfs_btree_prepare_update_v()
1941 	int ncmax;  in nilfs_btree_commit_update_v()  local
1955 	parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_commit_update_v()
1957 				 path[level].bp_newreq.bpr_ptr, ncmax);  in nilfs_btree_commit_update_v()
2030 	int ncmax;  in nilfs_btree_propagate_v()  local
2040 		parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_propagate_v()
2043 					       ncmax);  in nilfs_btree_propagate_v()
2189 	int ncmax, ret;  in nilfs_btree_assign_p()  local
2191 	parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_assign_p()
2193 				       ncmax);  in nilfs_btree_assign_p()
2210 				 ncmax);  in nilfs_btree_assign_p()
2232 	int ncmax, ret;  in nilfs_btree_assign_v()  local
2234 	parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_assign_v()
2236 				       ncmax);  in nilfs_btree_assign_v()