Home
last modified time | relevance | path

Searched refs:will_make_reachable (Results 1 – 5 of 5) sorted by relevance

/linux/fs/bcachefs/
A Dbtree_types.h133 unsigned long will_make_reachable; member
149 x(will_make_reachable) \
591 x(will_make_reachable) \
A Dbtree_update_interior.c237 BUG_ON(b->will_make_reachable); in __btree_node_free()
277 BUG_ON(b->will_make_reachable != (1UL|(unsigned long) as)); in bch2_btree_node_free_never_used()
279 b->will_make_reachable = 0; in bch2_btree_node_free_never_used()
823 BUG_ON(b->will_make_reachable != (unsigned long) as); in btree_update_nodes_written()
824 b->will_make_reachable = 0; in btree_update_nodes_written()
966 BUG_ON(b->will_make_reachable); in bch2_btree_update_add_new_node()
969 b->will_make_reachable = 1UL|(unsigned long) as; in bch2_btree_update_add_new_node()
1000 v = xchg(&b->will_make_reachable, 0); in btree_update_drop_new_node()
A Dbtree_io.c1779 old = READ_ONCE(b->will_make_reachable); in bch2_btree_complete_write()
1786 } while (!try_cmpxchg(&b->will_make_reachable, &old, new)); in bch2_btree_complete_write()
2036 BUG_ON((b->will_make_reachable != 0) != !b->written); in __bch2_btree_node_write()
A Ddebug.c489 prt_printf(out, "will make reachable:\t%lx\n", b->will_make_reachable); in bch2_cached_btree_node_to_text()
A Dbtree_cache.c414 BTREE_CACHE_NOT_FREED_INCREMENT(will_make_reachable); in __btree_node_reclaim()

Completed in 19 milliseconds