221     unsigned int max_count = tree->key_count[is_leaf];  in block_tree_node_shift()  local
232     assert(max_count);  in block_tree_node_shift()
233     assert(dest_index <= max_count + !is_leaf + 1);  in block_tree_node_shift()
242             base = node_rw->data + tree->key_size * max_count;  in block_tree_node_shift()
246                 max_count++;  in block_tree_node_shift()
260             if (src_index == max_count) {  in block_tree_node_shift()
263                 src = base + max_count * entry_size - size;  in block_tree_node_shift()
270                            __func__, src, max_count - (dest_index - src_index),  in block_tree_node_shift()
271                            max_count, dest, size, is_zero(src, size));  in block_tree_node_shift()
274                            __func__, max_count - (dest_index - src_index),  in block_tree_node_shift()
275                            max_count, size, is_zero(src, size));  in block_tree_node_shift()
284         if (src_index < max_count) {  in block_tree_node_shift()
288             size = (max_count - MAX(src_index, dest_index)) * entry_size;  in block_tree_node_shift()
302                 clear_index = max_count + dest_index - src_index;  in block_tree_node_shift()
315             if (src_index == max_count) {  in block_tree_node_shift()
334             assert(dest_index <= max_count);  in block_tree_node_shift()
336             size = (max_count - clear_index) * entry_size;  in block_tree_node_shift()
340                        clear_index, max_count, size);  in block_tree_node_shift()
343                        clear_index, max_count, size);  in block_tree_node_shift()
368     unsigned int max_count = tree->key_count[is_leaf];  in block_tree_node_merge_entries()  local
380                           src_node_ro->data + tree->key_size * max_count, NULL,  in block_tree_node_merge_entries()