Searched refs:will_make_reachable (Results 1 – 5 of 5) sorted by relevance
133 unsigned long will_make_reachable; member149 x(will_make_reachable) \597 x(will_make_reachable) \
231 BUG_ON(b->will_make_reachable); in __btree_node_free()264 BUG_ON(b->will_make_reachable != (1UL|(unsigned long) as)); in bch2_btree_node_free_never_used()266 b->will_make_reachable = 0; in bch2_btree_node_free_never_used()808 BUG_ON(b->will_make_reachable != (unsigned long) as); in btree_update_nodes_written()809 b->will_make_reachable = 0; in btree_update_nodes_written()951 BUG_ON(b->will_make_reachable); in bch2_btree_update_add_new_node()954 b->will_make_reachable = 1UL|(unsigned long) as; in bch2_btree_update_add_new_node()985 v = xchg(&b->will_make_reachable, 0); in btree_update_drop_new_node()
1819 old = READ_ONCE(b->will_make_reachable); in bch2_btree_complete_write()1826 } while (!try_cmpxchg(&b->will_make_reachable, &old, new)); in bch2_btree_complete_write()2081 BUG_ON((b->will_make_reachable != 0) != !b->written); in __bch2_btree_node_write()
492 prt_printf(out, "will make reachable:\t%lx\n", b->will_make_reachable); in bch2_cached_btree_node_to_text()
416 BTREE_CACHE_NOT_FREED_INCREMENT(will_make_reachable); in __btree_node_reclaim()