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