Home
last modified time | relevance | path

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

/fs/bcachefs/
A Dbtree_types.h133 unsigned long will_make_reachable; member
150 x(will_make_reachable) \
611 x(will_make_reachable) \
A Dbtree_update_interior.c228 BUG_ON(b->will_make_reachable); in __btree_node_free()
261 BUG_ON(b->will_make_reachable != (1UL|(unsigned long) as)); in bch2_btree_node_free_never_used()
263 b->will_make_reachable = 0; in bch2_btree_node_free_never_used()
829 BUG_ON(b->will_make_reachable != (unsigned long) as); in btree_update_nodes_written()
830 b->will_make_reachable = 0; in btree_update_nodes_written()
972 BUG_ON(b->will_make_reachable); in bch2_btree_update_add_new_node()
975 b->will_make_reachable = 1UL|(unsigned long) as; in bch2_btree_update_add_new_node()
1006 v = xchg(&b->will_make_reachable, 0); in btree_update_drop_new_node()
A Dbtree_io.c2106 old = READ_ONCE(b->will_make_reachable); in bch2_btree_complete_write()
2113 } while (!try_cmpxchg(&b->will_make_reachable, &old, new)); in bch2_btree_complete_write()
2392 BUG_ON((b->will_make_reachable != 0) != !b->written); in __bch2_btree_node_write()
A Ddebug.c486 prt_printf(out, "will make reachable:\t%lx\n", b->will_make_reachable); in bch2_cached_btree_node_to_text()

Completed in 24 milliseconds