1324         assert(path->count < countof(path->entry));  in block_tree_walk()
1335         path->entry[path->count].block_mac = *block_mac;  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()
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()
1414     assert(path->entry[depth].next_key);  in block_tree_path_next()
1421     block_mac = &path->entry[depth].block_mac;  in block_tree_path_next()
1422     index = path->entry[depth].index;  in block_tree_path_next()
1423     parent_next_key = depth > 0 ? path->entry[depth - 1].next_key : 0;  in block_tree_path_next()
1445     assert(path->entry[depth].next_key == prev_key || !prev_key);  in block_tree_path_next()
1449         path->entry[depth].index = index;  in block_tree_path_next()
1450         path->entry[depth].prev_key = prev_key;  in block_tree_path_next()
1451         path->entry[depth].next_key = next_key;  in block_tree_path_next()
1457                    block_mac_to_block(path->tr, &path->entry[depth].block_mac),  in block_tree_path_next()
1458                    path->entry[depth].index, path->entry[depth].prev_key,  in block_tree_path_next()
1459                    path->entry[depth].next_key);  in block_tree_path_next()
1470         if (!path->entry[depth].next_key) {  in block_tree_path_next()
1473         block_mac = &path->entry[depth].block_mac;  in block_tree_path_next()
1474         index = path->entry[depth].index;  in block_tree_path_next()
1485         parent_next_key = depth > 0 ? path->entry[depth - 1].next_key : 0;  in block_tree_path_next()
1500             assert(prev_key && prev_key == path->entry[depth].next_key);  in block_tree_path_next()
1501             path->entry[depth].index = index;  in block_tree_path_next()
1502             path->entry[depth].prev_key = prev_key;  in block_tree_path_next()
1503             path->entry[depth].next_key = next_key ?: parent_next_key;  in block_tree_path_next()
1509                                           &path->entry[depth].block_mac),  in block_tree_path_next()
1510                        path->entry[depth].index, path->entry[depth].prev_key,  in block_tree_path_next()
1511                        path->entry[depth].next_key);  in block_tree_path_next()
1527         path->entry[depth].block_mac = *next_child;  in block_tree_path_next()
1529         path->entry[depth].index = 0;  in block_tree_path_next()
1530         path->entry[depth].prev_key = prev_key;  in block_tree_path_next()
1531         path->entry[depth].next_key = block_tree_node_get_key(  in block_tree_path_next()
1537                    block_mac_to_block(path->tr, &path->entry[depth].block_mac),  in block_tree_path_next()
1538                    path->entry[depth].index, path->entry[depth].prev_key,  in block_tree_path_next()
1539                    path->entry[depth].next_key);  in block_tree_path_next()
1545         assert(path->entry[depth].next_key);  in block_tree_path_next()
1558     path->entry[depth].block_mac = *next_child;  in block_tree_path_next()
1560     path->entry[depth].index = 0;  in block_tree_path_next()
1561     path->entry[depth].prev_key = prev_key;  in block_tree_path_next()
1562     path->entry[depth].next_key =  in block_tree_path_next()
1567     assert(path->entry[depth].next_key);  in block_tree_path_next()
1572                block_mac_to_block(path->tr, &path->entry[depth].block_mac),  in block_tree_path_next()
1573                path->entry[depth].index, path->entry[depth].prev_key,  in block_tree_path_next()
1574                path->entry[depth].next_key);  in block_tree_path_next()
1606     block_mac = &path->entry[path_index].block_mac;  in block_tree_block_dirty()
1661     node_ro = block_get(tr, &path->entry[path_index].block_mac, NULL, ref);  in block_tree_block_get_write()
1698         assert(path_index < (int)countof(path->entry));  in block_tree_path_put_dirty()
1699         path->entry[path_index].block_mac = path->data;  // copy data  in block_tree_path_put_dirty()
1713         index = path->entry[path_index].index;  in block_tree_path_put_dirty()
1725                                      &path->entry[path_index + 1].block_mac));  in block_tree_path_put_dirty()
1730                                     &path->entry[path_index + 1].block_mac) ||  in block_tree_path_put_dirty()
1734                                   &path->entry[path_index + 1].block_mac)) {  in block_tree_path_put_dirty()
1739                                tr, &path->entry[path_index + 1].block_mac));  in block_tree_path_put_dirty()
1744                                        &path->entry[path_index + 1].block_mac));  in block_tree_path_put_dirty()
1755                             &path->entry[path_index + 1].block_mac));  in block_tree_path_put_dirty()
1758                              &path->entry[path_index + 1].block_mac) ||  in block_tree_path_put_dirty()
1760         block_mac_copy_mac(tr, &path->entry[path_index + 1].block_mac,  in block_tree_path_put_dirty()
1763                             &path->entry[path_index + 1].block_mac));  in block_tree_path_put_dirty()
1769     assert(block_mac_same_block(tr, block_mac, &path->entry[0].block_mac));  in block_tree_path_put_dirty()
1770     assert(block_mac_eq(tr, block_mac, &path->entry[0].block_mac));  in block_tree_path_put_dirty()
1772     assert(!block_mac_eq(tr, block_mac, &path->entry[0].block_mac) ||  in block_tree_path_put_dirty()
1774     block_mac_copy_mac(tr, &path->entry[0].block_mac, block_mac);  in block_tree_path_put_dirty()
1775     assert(block_mac_eq(tr, block_mac, &path->entry[0].block_mac));  in block_tree_path_put_dirty()
1802         assert(path_index < (int)countof(path->entry));  in block_tree_update_key()
1803         block_mac = &path->entry[path_index].block_mac;  in block_tree_update_key()
1804         index = path->entry[path_index].index;  in block_tree_update_key()
1835         assert(path->entry[path_index].prev_key ==  in block_tree_update_key()
1842         path->entry[path_index].prev_key = new_key;  in block_tree_update_key()
1947     block_mac = &path->entry[path->count - 1].block_mac;  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()
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()
2262     parent_index = path->entry[path->count - 2].index;  in block_tree_path_set_sibling_block()
2274                path->entry[path->count - 2].index, parent_index);  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()
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()
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()
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()
2576             merge_key = &path->entry[path->count - 2].next_key;  in block_tree_node_merge()
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()
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()
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()
2964         next_key = path.entry[path.count - 2].next_key;  in block_tree_update_block_mac()