diff options
author | Kent Overstreet <kent.overstreet@gmail.com> | 2020-01-21 17:24:32 -0500 |
---|---|---|
committer | Kent Overstreet <kent.overstreet@gmail.com> | 2020-01-21 17:24:32 -0500 |
commit | e0eb64c84601b2bbae055df809dd21f95f85c034 (patch) | |
tree | 85ac2fd5b2092ab96646cf05c00ce10d22f27088 /libbcachefs/btree_types.h | |
parent | 4d697aa315701e238e93e77947ac7ee61f10c578 (diff) |
Update bcachefs sources to 3cd63315a6 bcachefs: Track incompressible data
Diffstat (limited to 'libbcachefs/btree_types.h')
-rw-r--r-- | libbcachefs/btree_types.h | 16 |
1 files changed, 16 insertions, 0 deletions
diff --git a/libbcachefs/btree_types.h b/libbcachefs/btree_types.h index 86e52468..b7af88e0 100644 --- a/libbcachefs/btree_types.h +++ b/libbcachefs/btree_types.h @@ -184,9 +184,25 @@ enum btree_iter_type { #define BTREE_ITER_TYPE ((1 << 2) - 1) +/* + * Iterate over all possible positions, synthesizing deleted keys for holes: + */ #define BTREE_ITER_SLOTS (1 << 2) +/* + * Indicates that intent locks should be taken on leaf nodes, because we expect + * to be doing updates: + */ #define BTREE_ITER_INTENT (1 << 3) +/* + * Causes the btree iterator code to prefetch additional btree nodes from disk: + */ #define BTREE_ITER_PREFETCH (1 << 4) +/* + * Indicates that this iterator should not be reused until transaction commit, + * either because a pending update references it or because the update depends + * on that particular key being locked (e.g. by the str_hash code, for hash + * table consistency) + */ #define BTREE_ITER_KEEP_UNTIL_COMMIT (1 << 5) /* * Used in bch2_btree_iter_traverse(), to indicate whether we're searching for |