.. | .. |
---|
620 | 620 | struct buffer_head *bh; |
---|
621 | 621 | struct path_element *last_element; |
---|
622 | 622 | int node_level, retval; |
---|
623 | | - int right_neighbor_of_leaf_node; |
---|
624 | 623 | int fs_gen; |
---|
625 | 624 | struct buffer_head *reada_bh[SEARCH_BY_KEY_READA]; |
---|
626 | 625 | b_blocknr_t reada_blocks[SEARCH_BY_KEY_READA]; |
---|
.. | .. |
---|
640 | 639 | */ |
---|
641 | 640 | |
---|
642 | 641 | pathrelse(search_path); |
---|
643 | | - |
---|
644 | | - right_neighbor_of_leaf_node = 0; |
---|
645 | 642 | |
---|
646 | 643 | /* |
---|
647 | 644 | * With each iteration of this loop we search through the items in the |
---|
.. | .. |
---|
728 | 725 | */ |
---|
729 | 726 | block_number = SB_ROOT_BLOCK(sb); |
---|
730 | 727 | expected_level = -1; |
---|
731 | | - right_neighbor_of_leaf_node = 0; |
---|
732 | 728 | |
---|
733 | 729 | /* repeat search from the root */ |
---|
734 | 730 | continue; |
---|
.. | .. |
---|
948 | 944 | ih = tp_item_head(path); |
---|
949 | 945 | return memcmp(stored_ih, ih, IH_SIZE); |
---|
950 | 946 | } |
---|
951 | | - |
---|
952 | | -/* unformatted nodes are not logged anymore, ever. This is safe now */ |
---|
953 | | -#define held_by_others(bh) (atomic_read(&(bh)->b_count) > 1) |
---|
954 | | - |
---|
955 | | -/* block can not be forgotten as it is in I/O or held by someone */ |
---|
956 | | -#define block_in_use(bh) (buffer_locked(bh) || (held_by_others(bh))) |
---|
957 | 947 | |
---|
958 | 948 | /* prepare for delete or cut of direct item */ |
---|
959 | 949 | static inline int prepare_for_direct_item(struct treepath *path, |
---|