Lines Matching defs:flags

305 					     unsigned flags)
313 enum bch_watermark watermark = flags & BCH_WATERMARK_MASK;
406 b->data->flags = 0;
525 unsigned flags,
547 interior, flags);
703 wait_on_bit_io(&b->flags, BTREE_NODE_write_in_flight_inner,
1133 unsigned level_start, bool split, unsigned flags)
1138 int disk_res_flags = (flags & BCH_TRANS_COMMIT_no_enospc)
1142 enum bch_watermark watermark = flags & BCH_WATERMARK_MASK;
1153 flags &= ~BCH_WATERMARK_MASK;
1154 flags |= watermark;
1157 test_bit(JOURNAL_SPACE_LOW, &c->journal.flags)) {
1158 if (flags & BCH_TRANS_COMMIT_journal_reclaim)
1162 wait_event(c->journal.wait, !test_bit(JOURNAL_SPACE_LOW, &c->journal.flags));
1244 ret = bch2_btree_reserve_get(trans, as, nr_nodes, flags, NULL);
1254 (flags & BCH_TRANS_COMMIT_journal_reclaim) &&
1263 ret = bch2_btree_reserve_get(trans, as, nr_nodes, flags, &cl);
1363 if (unlikely(!test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags)))
1397 v = READ_ONCE(b->flags);
1404 } while ((v = cmpxchg(&b->flags, old, new)) != old);
1842 unsigned flags)
1852 true, flags);
1867 ret = bch2_foreground_maybe_merge(trans, path, l, flags);
1913 int bch2_btree_increase_depth(struct btree_trans *trans, btree_path_idx_t path, unsigned flags)
1919 return bch2_btree_split_leaf(trans, path, flags);
1922 bch2_btree_update_start(trans, trans->paths + path, b->c.level, true, flags);
1934 unsigned flags,
1960 if ((flags & BCH_WATERMARK_MASK) == BCH_WATERMARK_interior_updates)
1963 if ((flags & BCH_WATERMARK_MASK) <= BCH_WATERMARK_reclaim) {
1964 flags &= ~BCH_WATERMARK_MASK;
1965 flags |= BCH_WATERMARK_btree;
1966 flags |= BCH_TRANS_COMMIT_journal_reclaim;
2046 BCH_TRANS_COMMIT_no_enospc|flags);
2128 unsigned flags)
2136 flags |= BCH_TRANS_COMMIT_no_enospc;
2140 as = bch2_btree_update_start(trans, path, b->c.level, false, flags);
2267 if (unlikely(!test_bit(BCH_FS_may_go_rw, &c->flags))) {
2275 if (test_bit(BCH_FS_started, &c->flags)) {
2356 iter2.flags & BTREE_ITER_INTENT,
2543 b->data->flags = 0;