365         unsigned int count,  in block_tree_node_merge_entries()  argument
378     block_tree_node_shift(tree, node_rw, dest_index + count, dest_index,  in block_tree_node_merge_entries()
1314     path->count = 0;  in block_tree_walk()
1324         assert(path->count < countof(path->entry));  in block_tree_walk()
1330             path->count = 0;  in block_tree_walk()
1335         path->entry[path->count].block_mac = *block_mac;  in block_tree_walk()
1340         if (path->count) {  in block_tree_walk()
1341             assert(!path->entry[path->count - 1].next_key || next_key);  in block_tree_walk()
1342             assert(!path->entry[path->count - 1].next_key ||  in block_tree_walk()
1343                    next_key <= path->entry[path->count - 1].next_key);  in block_tree_walk()
1344             assert(!path->entry[path->count - 1].prev_key || prev_key);  in block_tree_walk()
1345             assert(!path->entry[path->count - 1].prev_key ||  in block_tree_walk()
1346                    prev_key >= path->entry[path->count - 1].prev_key);  in block_tree_walk()
1348         path->entry[path->count].index = child_index;  in block_tree_walk()
1349         path->entry[path->count].prev_key = prev_key;  in block_tree_walk()
1350         path->entry[path->count].next_key = next_key;  in block_tree_walk()
1357                    path->count == 0);  in block_tree_walk()
1370                    __func__, path->count,  in block_tree_walk()
1372                                       &path->entry[path->count].block_mac),  in block_tree_walk()
1373                    path->entry[path->count].index,  in block_tree_walk()
1374                    path->entry[path->count].prev_key,  in block_tree_walk()
1375                    path->entry[path->count].next_key);  in block_tree_walk()
1381         path->count++;  in block_tree_walk()
1411     assert(path->count);  in block_tree_path_next()
1413     depth = path->count - 1;  in block_tree_path_next()
1518     while (++depth < path->count - 1) {  in block_tree_path_next()
1584     path->count = 0;  in block_tree_path_next()
1697     if (path_index == (int)path->count) {  in block_tree_path_put_dirty()
1714         assert(path_index == (int)path->count - 1 || !parent_is_leaf);  in block_tree_path_put_dirty()
1944     assert(path->count > 0);  in block_tree_node_split()
1947     block_mac = &path->entry[path->count - 1].block_mac;  in block_tree_node_split()
1948     path->count--;  in block_tree_node_split()
1975     if (!path->count) {  in block_tree_node_split()
2003             block_tree_block_get_write(tr, path, path->count, &node_left_ref);  in block_tree_node_split()
2011     if (!path->count) {  in block_tree_node_split()
2035         parent_block_mac = &path->entry[path->count - 1].block_mac;  in block_tree_node_split()
2036         parent_index = path->entry[path->count - 1].index;  in block_tree_node_split()
2037         parent_node_rw = block_tree_block_get_write(tr, path, path->count - 1,  in block_tree_node_split()
2156     if (!path->count && print_internal_changes) {  in block_tree_node_split()
2167     block_tree_path_put_dirty(tr, path, (int)path->count - 1, parent_node_rw,  in block_tree_node_split()
2171         assert(path->count); /* new root node should not overflow */  in block_tree_node_split()
2219     assert(path->count > 1);  in block_tree_get_sibling_block()
2221     parent = &path->entry[path->count - 2].block_mac;  in block_tree_get_sibling_block()
2222     parent_index = path->entry[path->count - 2].index;  in block_tree_get_sibling_block()
2261     assert(path->count > 1);  in block_tree_path_set_sibling_block()
2262     parent_index = path->entry[path->count - 2].index;  in block_tree_path_set_sibling_block()
2273         printf("%s: path[%d].index: %d -> %d\n", __func__, path->count - 2,  in block_tree_path_set_sibling_block()
2274                path->entry[path->count - 2].index, parent_index);  in block_tree_path_set_sibling_block()
2276                __func__, path->count - 1,  in block_tree_path_set_sibling_block()
2278                                   &path->entry[path->count - 1].block_mac),  in block_tree_path_set_sibling_block()
2282     path->entry[path->count - 2].index = parent_index;  in block_tree_path_set_sibling_block()
2284         path->entry[path->count - 2].next_key =  in block_tree_path_set_sibling_block()
2285                 path->entry[path->count - 2].prev_key;  in block_tree_path_set_sibling_block()
2286         path->entry[path->count - 2].prev_key = 0;  // unknown  in block_tree_path_set_sibling_block()
2288         path->entry[path->count - 2].prev_key =  in block_tree_path_set_sibling_block()
2289                 path->entry[path->count - 2].next_key;  in block_tree_path_set_sibling_block()
2290         path->entry[path->count - 2].next_key = 0;  // unknown  in block_tree_path_set_sibling_block()
2294     *block_mac = path->entry[path->count - 1].block_mac;  in block_tree_path_set_sibling_block()
2295     path->entry[path->count - 1].block_mac = tmp;  in block_tree_path_set_sibling_block()
2322     assert(path->count);  in block_tree_remove_internal()
2324     block_mac = &path->entry[path->count - 1].block_mac;  in block_tree_remove_internal()
2325     index = path->entry[path->count - 1].index;  in block_tree_remove_internal()
2341     if (path->count == 1 &&  in block_tree_remove_internal()
2361     node_rw = block_tree_block_dirty(tr, path, path->count - 1, node_ro);  in block_tree_remove_internal()
2377             path->count > 1 && block_tree_below_min_full(path->tree, node_rw);  in block_tree_remove_internal()
2378     block_tree_path_put_dirty(tr, path, path->count - 1, node_rw, &node_ref);  in block_tree_remove_internal()
2413     assert(path->count > 1);  in block_tree_node_merge()
2416     block_mac = &path->entry[path->count - 1].block_mac;  in block_tree_node_merge()
2417     node_is_left = !path->entry[path->count - 2].index;  in block_tree_node_merge()
2459         merge_node_rw = block_tree_block_dirty(tr, path, path->count - 1,  in block_tree_node_merge()
2494                 key = path->entry[path->count - 2].next_key;  in block_tree_node_merge()
2496                 key = path->entry[path->count - 2].prev_key;  in block_tree_node_merge()
2521                 block_tree_update_key(tr, path, path->count - 2, key0);  in block_tree_node_merge()
2526         block_tree_update_key(tr, path, path->count - 2, parent_key);  in block_tree_node_merge()
2540         block_tree_path_put_dirty(tr, path, path->count - 1, node_rw, node_ref);  in block_tree_node_merge()
2542         block_tree_path_put_dirty(tr, path, path->count - 1, merge_node_rw,  in block_tree_node_merge()
2562         node_rw = block_tree_block_dirty(tr, path, path->count - 1, node_ro);  in block_tree_node_merge()
2576             merge_key = &path->entry[path->count - 2].next_key;  in block_tree_node_merge()
2596             block_tree_update_key(tr, path, path->count - 2, key0);  in block_tree_node_merge()
2606         block_tree_path_put_dirty(tr, path, path->count - 1, node_rw, node_ref);  in block_tree_node_merge()
2610         path->count--;  in block_tree_node_merge()
2676     assert(path.count > 0);  in block_tree_insert_block_mac()
2678     block_mac = &path.entry[path.count - 1].block_mac;  in block_tree_insert_block_mac()
2679     index = path.entry[path.count - 1].index;  in block_tree_insert_block_mac()
2698     assert(index || !path.entry[path.count - 1].prev_key ||  in block_tree_insert_block_mac()
2702     node_rw = block_tree_block_dirty(tr, &path, path.count - 1, node_ro);  in block_tree_insert_block_mac()
2713     block_tree_path_put_dirty(tr, &path, path.count - 1, node_rw, &node_ref);  in block_tree_insert_block_mac()
2790     assert(path.count > 0);  in block_tree_remove()
2802     block_mac = &path.entry[path.count - 1].block_mac;  in block_tree_remove()
2803     index = path.entry[path.count - 1].index;  in block_tree_remove()
2824     node_rw = block_tree_block_dirty(tr, &path, path.count - 1, node_ro);  in block_tree_remove()
2832     if (path.count > 1) {  in block_tree_remove()
2839                 block_tree_update_key(tr, &path, path.count - 2,  in block_tree_remove()
2845     block_tree_path_put_dirty(tr, &path, path.count - 1, node_rw, &node_ref);  in block_tree_remove()
2921     assert(path.count > 0);  in block_tree_update_block_mac()
2933     block_mac = &path.entry[path.count - 1].block_mac;  in block_tree_update_block_mac()
2934     index = path.entry[path.count - 1].index;  in block_tree_update_block_mac()
2963     if (path.count > 1 && !next_key) {  in block_tree_update_block_mac()
2964         next_key = path.entry[path.count - 2].next_key;  in block_tree_update_block_mac()
2967     node_rw = block_tree_block_dirty(tr, &path, path.count - 1, node_ro);  in block_tree_update_block_mac()
2982             path.count--;  in block_tree_update_block_mac()
2987             block_tree_update_key(tr, &path, (int)path.count - 1, new_key);  in block_tree_update_block_mac()
2988             path.count++;  in block_tree_update_block_mac()
2993     block_tree_path_put_dirty(tr, &path, path.count - 1, node_rw, &node_ref);  in block_tree_update_block_mac()