141 nilfs_btree_node_dptrs(const struct nilfs_btree_node *node, int ncmax)  in nilfs_btree_node_dptrs()  argument
143 	return (__le64 *)(nilfs_btree_node_dkeys(node) + ncmax);  in nilfs_btree_node_dptrs()
160 			 int ncmax)  in nilfs_btree_node_get_ptr()  argument
162 	return le64_to_cpu(*(nilfs_btree_node_dptrs(node, ncmax) + index));  in nilfs_btree_node_get_ptr()
167 			 int ncmax)  in nilfs_btree_node_set_ptr()  argument
169 	*(nilfs_btree_node_dptrs(node, ncmax) + index) = cpu_to_le64(ptr);  in nilfs_btree_node_set_ptr()
173 				  int level, int nchildren, int ncmax,  in nilfs_btree_node_init()  argument
185 	dptrs = nilfs_btree_node_dptrs(node, ncmax);  in nilfs_btree_node_init()
250 				    __u64 key, __u64 ptr, int ncmax)  in nilfs_btree_node_insert()  argument
257 	dptrs = nilfs_btree_node_dptrs(node, ncmax);  in nilfs_btree_node_insert()
273 				    __u64 *keyp, __u64 *ptrp, int ncmax)  in nilfs_btree_node_delete()  argument
282 	dptrs = nilfs_btree_node_dptrs(node, ncmax);  in nilfs_btree_node_delete()
441 	int ncmax;			/* nof children in the parent node */  member
466 		     n > 0 && i < ra->ncmax; n--, i++) {  in __nilfs_btree_get_block()
467 			ptr2 = nilfs_btree_node_get_ptr(ra->node, i, ra->ncmax);  in __nilfs_btree_get_block()
513 	int level, index, found, ncmax, ret;  in nilfs_btree_do_lookup()  local
526 	ncmax = nilfs_btree_nchildren_per_block(btree);  in nilfs_btree_do_lookup()
532 						      &p.ncmax);  in nilfs_btree_do_lookup()
549 		if (index < ncmax) {  in nilfs_btree_do_lookup()
550 			ptr = nilfs_btree_node_get_ptr(node, index, ncmax);  in nilfs_btree_do_lookup()
573 	int index, level, ncmax, ret;  in nilfs_btree_do_lookup_last()  local
584 	ncmax = nilfs_btree_nchildren_per_block(btree);  in nilfs_btree_do_lookup_last()
594 		ptr = nilfs_btree_node_get_ptr(node, index, ncmax);  in nilfs_btree_do_lookup_last()
632 	int ret, cnt, index, maxlevel, ncmax;  in nilfs_btree_lookup_contig()  local
655 	node = nilfs_btree_get_node(btree, path, level, &ncmax);  in nilfs_btree_lookup_contig()
662 			ptr2 = nilfs_btree_node_get_ptr(node, index, ncmax);  in nilfs_btree_lookup_contig()
678 		p.node = nilfs_btree_get_node(btree, path, level + 1, &p.ncmax);  in nilfs_btree_lookup_contig()
684 		ptr2 = nilfs_btree_node_get_ptr(p.node, p.index, p.ncmax);  in nilfs_btree_lookup_contig()
695 		ncmax = nilfs_btree_nchildren_per_block(btree);  in nilfs_btree_lookup_contig()
937 	int level, ncmax;  in nilfs_btree_find_near()  local
945 		node = nilfs_btree_get_node(btree, path, level, &ncmax);  in nilfs_btree_find_near()
948 						ncmax);  in nilfs_btree_find_near()
954 		node = nilfs_btree_get_node(btree, path, level, &ncmax);  in nilfs_btree_find_near()
956 						ncmax);  in nilfs_btree_find_near()
990 	int pindex, level, ncmax, ncblk, ret;  in nilfs_btree_prepare_insert()  local
1019 		parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_prepare_insert()
1025 							  ncmax);  in nilfs_btree_prepare_insert()
1043 							  ncmax);  in nilfs_btree_prepare_insert()
1359 	int pindex, level, ncmin, ncmax, ncblk, ret;  in nilfs_btree_prepare_delete()  local
1384 		parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_prepare_delete()
1390 							  ncmax);  in nilfs_btree_prepare_delete()
1410 							  ncmax);  in nilfs_btree_prepare_delete()
1584 	int nchildren, ncmax, i, ret;  in nilfs_btree_gather_data()  local
1591 		ncmax = NILFS_BTREE_ROOT_NCHILDREN_MAX;  in nilfs_btree_gather_data()
1602 		ncmax = nilfs_btree_nchildren_per_block(btree);  in nilfs_btree_gather_data()
1613 	dptrs = nilfs_btree_node_dptrs(node, ncmax);  in nilfs_btree_gather_data()
1800 	int ncmax, ret;  in nilfs_btree_prepare_update_v()  local
1802 	parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_prepare_update_v()
1805 					 ncmax);  in nilfs_btree_prepare_update_v()
1835 	int ncmax;  in nilfs_btree_commit_update_v()  local
1849 	parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_commit_update_v()
1851 				 path[level].bp_newreq.bpr_ptr, ncmax);  in nilfs_btree_commit_update_v()
1924 	int ncmax;  in nilfs_btree_propagate_v()  local
1934 		parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_propagate_v()
1937 					       ncmax);  in nilfs_btree_propagate_v()
2081 	int ncmax, ret;  in nilfs_btree_assign_p()  local
2083 	parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_assign_p()
2085 				       ncmax);  in nilfs_btree_assign_p()
2102 				 ncmax);  in nilfs_btree_assign_p()
2124 	int ncmax, ret;  in nilfs_btree_assign_v()  local
2126 	parent = nilfs_btree_get_node(btree, path, level + 1, &ncmax);  in nilfs_btree_assign_v()
2128 				       ncmax);  in nilfs_btree_assign_v()