Lines Matching refs:write
26 * specifying read vs. write locking, and the embedded closure is used for
58 * write in flight, and one being set up, and we toggle between them.
65 * When passing now = true, bch_btree_write() causes a write to happen
66 * "immediately" (if there was already a write in flight, it'll cause the write
67 * to happen as soon as the previous write completes). It returns immediately
69 * to it, so a closure_sync() later can be used to wait for the write to
73 * in parallel, reducing the amount of time they have to hold write locks.
77 * When traversing the btree, we may need write locks starting at some level -
78 * inserting a key into the btree will typically only require a write lock on
82 * take write locks at level <= 0, i.e. only leaf nodes. bch_btree_node_get()
90 * Handling cache misses require a different mechanism for upgrading to a write
93 * placeholder key to detect races - otherwise, we could race with a write and
97 * For this we use a sequence number that write locks and unlocks increment - to
98 * insert the check key it unlocks the btree node and then takes a write lock,
110 * c->prio_blocked because we can't write the gens until the new
216 /* Btree level at which we start taking write locks */
272 struct bkey *k, int level, bool write,
315 * op->lock determines whether we take a read or a write lock at a given depth.
316 * If you've got a read lock and find that you need a write lock (i.e. you're