145 nilfs_btree_node_get_key(const struct nilfs_btree_node *node, int index)  in nilfs_btree_node_get_key()  argument
147 	return le64_to_cpu(*(nilfs_btree_node_dkeys(node) + index));  in nilfs_btree_node_get_key()
151 nilfs_btree_node_set_key(struct nilfs_btree_node *node, int index, __u64 key)  in nilfs_btree_node_set_key()  argument
153 	*(nilfs_btree_node_dkeys(node) + index) = cpu_to_le64(key);  in nilfs_btree_node_set_key()
157 nilfs_btree_node_get_ptr(const struct nilfs_btree_node *node, int index,  in nilfs_btree_node_get_ptr()  argument
160 	return le64_to_cpu(*(nilfs_btree_node_dptrs(node, ncmax) + index));  in nilfs_btree_node_get_ptr()
164 nilfs_btree_node_set_ptr(struct nilfs_btree_node *node, int index, __u64 ptr,  in nilfs_btree_node_set_ptr()  argument
167 	*(nilfs_btree_node_dptrs(node, ncmax) + index) = cpu_to_le64(ptr);  in nilfs_btree_node_set_ptr()
247 static void nilfs_btree_node_insert(struct nilfs_btree_node *node, int index,  in nilfs_btree_node_insert()  argument
257 	if (index < nchildren) {  in nilfs_btree_node_insert()
258 		memmove(dkeys + index + 1, dkeys + index,  in nilfs_btree_node_insert()
259 			(nchildren - index) * sizeof(*dkeys));  in nilfs_btree_node_insert()
260 		memmove(dptrs + index + 1, dptrs + index,  in nilfs_btree_node_insert()
261 			(nchildren - index) * sizeof(*dptrs));  in nilfs_btree_node_insert()
263 	dkeys[index] = cpu_to_le64(key);  in nilfs_btree_node_insert()
264 	dptrs[index] = cpu_to_le64(ptr);  in nilfs_btree_node_insert()
270 static void nilfs_btree_node_delete(struct nilfs_btree_node *node, int index,  in nilfs_btree_node_delete()  argument
281 	key = le64_to_cpu(dkeys[index]);  in nilfs_btree_node_delete()
282 	ptr = le64_to_cpu(dptrs[index]);  in nilfs_btree_node_delete()
289 	if (index < nchildren - 1) {  in nilfs_btree_node_delete()
290 		memmove(dkeys + index, dkeys + index + 1,  in nilfs_btree_node_delete()
291 			(nchildren - index - 1) * sizeof(*dkeys));  in nilfs_btree_node_delete()
292 		memmove(dptrs + index, dptrs + index + 1,  in nilfs_btree_node_delete()
293 			(nchildren - index - 1) * sizeof(*dptrs));  in nilfs_btree_node_delete()
303 	int index, low, high, s;  in nilfs_btree_node_lookup()  local
308 	index = 0;  in nilfs_btree_node_lookup()
311 		index = (low + high) / 2;  in nilfs_btree_node_lookup()
312 		nkey = nilfs_btree_node_get_key(node, index);  in nilfs_btree_node_lookup()
317 			low = index + 1;  in nilfs_btree_node_lookup()
320 			high = index - 1;  in nilfs_btree_node_lookup()
327 		if (s > 0 && index > 0)  in nilfs_btree_node_lookup()
328 			index--;  in nilfs_btree_node_lookup()
330 		index++;  in nilfs_btree_node_lookup()
333 	*indexp = index;  in nilfs_btree_node_lookup()
474 	int index;			/* current index on the parent node */  member
500 		for (n = ra->max_ra_blocks, i = ra->index + 1;  in __nilfs_btree_get_block()
552 	int level, index, found, ncmax, ret;  in nilfs_btree_do_lookup()  local
559 	found = nilfs_btree_node_lookup(node, key, &index);  in nilfs_btree_do_lookup()
560 	ptr = nilfs_btree_node_get_ptr(node, index,  in nilfs_btree_do_lookup()
563 	path[level].bp_index = index;  in nilfs_btree_do_lookup()
572 			p.index = index;  in nilfs_btree_do_lookup()
585 			found = nilfs_btree_node_lookup(node, key, &index);  in nilfs_btree_do_lookup()
587 			index = 0;  in nilfs_btree_do_lookup()
588 		if (index < ncmax) {  in nilfs_btree_do_lookup()
589 			ptr = nilfs_btree_node_get_ptr(node, index, ncmax);  in nilfs_btree_do_lookup()
595 		path[level].bp_index = index;  in nilfs_btree_do_lookup()
612 	int index, level, ncmax, ret;  in nilfs_btree_do_lookup_last()  local
615 	index = nilfs_btree_node_get_nchildren(node) - 1;  in nilfs_btree_do_lookup_last()
616 	if (index < 0)  in nilfs_btree_do_lookup_last()
619 	ptr = nilfs_btree_node_get_ptr(node, index,  in nilfs_btree_do_lookup_last()
622 	path[level].bp_index = index;  in nilfs_btree_do_lookup_last()
632 		index = nilfs_btree_node_get_nchildren(node) - 1;  in nilfs_btree_do_lookup_last()
633 		ptr = nilfs_btree_node_get_ptr(node, index, ncmax);  in nilfs_btree_do_lookup_last()
634 		path[level].bp_index = index;  in nilfs_btree_do_lookup_last()
638 		*keyp = nilfs_btree_node_get_key(node, index);  in nilfs_btree_do_lookup_last()
661 	int index, next_adj, level;  in nilfs_btree_get_next_key()  local
671 		index = path[level].bp_index + next_adj;  in nilfs_btree_get_next_key()
672 		if (index < nilfs_btree_node_get_nchildren(node)) {  in nilfs_btree_get_next_key()
674 			*nextkey = nilfs_btree_node_get_key(node, index);  in nilfs_btree_get_next_key()
710 	int ret, cnt, index, maxlevel, ncmax;  in nilfs_btree_lookup_contig()  local
734 	index = path[level].bp_index + 1;  in nilfs_btree_lookup_contig()
736 		while (index < nilfs_btree_node_get_nchildren(node)) {  in nilfs_btree_lookup_contig()
737 			if (nilfs_btree_node_get_key(node, index) !=  in nilfs_btree_lookup_contig()
740 			ptr2 = nilfs_btree_node_get_ptr(node, index, ncmax);  in nilfs_btree_lookup_contig()
749 			index++;  in nilfs_btree_lookup_contig()
757 		p.index = path[level + 1].bp_index + 1;  in nilfs_btree_lookup_contig()
759 		if (p.index >= nilfs_btree_node_get_nchildren(p.node) ||  in nilfs_btree_lookup_contig()
760 		    nilfs_btree_node_get_key(p.node, p.index) != key + cnt)  in nilfs_btree_lookup_contig()
762 		ptr2 = nilfs_btree_node_get_ptr(p.node, p.index, p.ncmax);  in nilfs_btree_lookup_contig()
763 		path[level + 1].bp_index = p.index;  in nilfs_btree_lookup_contig()
774 		index = 0;  in nilfs_btree_lookup_contig()
775 		path[level].bp_index = index;  in nilfs_btree_lookup_contig()
2151 	pgoff_t index = 0;  in nilfs_btree_lookup_dirty_buffers()  local
2161 	while (pagevec_lookup_tag(&pvec, btcache, &index,  in nilfs_btree_lookup_dirty_buffers()